Datasets:

baber

/

test

like 0

US-80773010-A

Exterior building wall insulation systems with hygro thermal wrap ABSTRACT A composite, layered, thermal insulation and cladding system and method to construct a hygro thermal (HT) wrap. The external insulation system controls the passage of heat, air, liquid water, water vapor, and moisture permeability of the system with the change of the moisture content in some materials. The HT wrap comprises at a material mix applied in two layers, with or without additional surface treatments. The inventive method includes the material combinations and their fiber diameter or particle size in such a manner that the microstructure of HT wrap will provide pore space for retention of the initially added water, permit expansion of the freezing water (thereby improving freeze-thaw durability), provide the interruption in the crack propagation (because the brittle inorganic matrix of the binders is prone to cracking), and provide a degree of elasticity needed to accommodate movements caused by the polyurethane foam or other substrates. BACKGROUND OF THE INVENTION 1. Field of Invention The present invention relates to building materials and more specifically, to a composite exterior insulation system and cladding used in the construction of building walls and structure, to control heat transfer, rain-water penetration, air and water vapor transmission through a building enclosure, and is based upon Provisional Patent Application Ser. Nos. 61/342,513 filed 15 Apr. 2010, and 61/399,497 filed 13 Jul. 2010, each being incorporated herein by reference in their entirety. 2. Description of Prior Art A building wall's typical exterior insulation layer includes a thermal insulating material covered by a rain intrusion protection layer such as siding or stucco. Thermal insulation material can be impermeable or permeable to water vapor. Stucco can be a “three-coat stucco” (for example, a 3-coat, traditional, metal-lath-reinforced, cladding system) or one-coat stucco (for example, a reinforced portion, applied in two layers) or a modern “synthetic stucco” (for example, a thin lamina reinforced with fiberglass or polymeric mesh) used in Exterior Insulation and Finish Systems (EIFS). Those plasters (stuccos) provide a barrier to rain entry. While the old masonry buildings used renderings with slack lime as the binder and provided substantial capillary action, the renderings based on cement generally use polymeric admixtures which reduces the capillarity of the material. This is reflected in the name of Portland Cement Plaster that replaced the traditional rendering (stucco). In effect, the conventional rain controlling elements in building enclosures are focused on the reduction or elimination of moisture entry into building materials or components. For example, hydrophobic coatings or other film forming compositions may be applied on the exterior surface of Portland Cement Plaster to provide low water transmission, while retaining good flame retarding property and low smoke generation of the plaster. Similarly, a coating of polypropylene resin can be applied to the surface of a fibrous sheet to make the sheet impermeable to water and vapor. Subsequent treatment provides vapor permeability to the sheet while maintaining liquid water impermeability. The resultant product is particularly suited for use as a roofing-tile underlayment or as an air-infiltration barrier. Alternatively, water barriers may be coated with other elastomers, including dispersed layer fillers in liquid carriers, or may include a sheet of paper impregnated with asphalt or urethane compounds. Yet 3-coat Portland Cement Plaster is prone to cracking and subsequent moisture penetration. On the other hand, “synthetic stucco” (a thin lamina reinforced with fiberglass mesh) is elastic and less prone to cracking but it does not provide sufficient fire protection and drying ability to the wall as well. It lacks the “moisture storage capacity” of the traditional 3-coat lime-cement stucco. Recently a vapor barrier technology was revolutionized, for instance, one vapor barrier includes polyamide (nylon) fibers that are modified with polyvinyl alcohol. Since these fibers are susceptible to moisture, the water vapor permeance of membrane changes with relative humidity. Another conventional barrier comprises a sheet of a unitary, non-woven material that is spun-bonded from synthetic plexifilamentary fibers. The sheet is then textured with protrusions in a random polyhedral pattern to define channels oriented in multiple directions by which a liquid on the first side of the sheet may drain. A change of similar magnitude is now introduced by the following invention into the Portland Cement Plaster (stucco) type of cladding systems. OBJECTS AND ADVANTAGES OF THE PRESENT INVENTION It is a principal object and advantage of the present invention to provide an external insulating system and a process of construction of that insulating system onto a wall, leading to an assembly for that accelerates drying of moisture encapsulated during construction of the building or the building enclosure. It is an additional object and advantage of the present invention to provide a system and method for dealing with the moisture that comes from incidental rain leaks at windows or other penetrations or failures of the vapor barrier of a building or its enclosure. It is a further object and advantage of the present invention to provide an insulated cladding system for new buildings, or retrofit to existing buildings that provides adequate rain water absorption, storage and accelerated water removal capability. It is another object and advantage of the present invention to provide a system and method for constructing an improved transfer of moisture to an adjacent material layer having a higher activity index or higher storage capability. Other objects and advantages of the present invention will in part be apparent, and in part appear hereinafter. BRIEF SUMMARY OF THE INVENTION The present invention recognizes that building enclosures must be designed differently for warm, mixed and cold climates and therefore the principles defined here may have different representation in each of these climatic regions. Yet, the process of construction covered by this invention comprises two interacting layers: (1) permeable or semi-permeable exterior thermal insulation and (2) a composite called here a hygrothermal or “HT” wrap. Depending on requirements of heat, air and moisture control, the thermal insulating layer may be continuous (spray or poured polyurethane foam) or constructed with boards permeable for water vapor, namely: expanded polystyrene or Eco-fiber boards. The composite “HT” wrap comprise of three layers, namely a bonding layer, a protective layer and a finishing layer. The bonding and protective layers have either identical or almost identical composition so that 3-layer system actually comprise two materials where one of them is applied in two steps. The objective of this invention is controlling ingress of water, air and water vapor and accelerating the rate of moisture removal from the building enclosure. To this end either a thermal insulating material with measurable drainage ability (eco-fiber board such as wood fiber thermal insulation) or a special drainable thermal insulation (mineral fiber thermal insulation) may use earth gravity force for water removal. Those materials may also be used to enhance diffusion-based drying. As discussed in the section of examples, the mineral fiber insulation is inserted in the layer of spray polyurethane to enhance a combination of drainage and diffusion-based drying. In a parallel system, specially designed HT wrap with Eco-fiber board also provide enhanced capability for drying. The HT wrap is a material that is Comprised of three components (1) a “binder” that include S-type hydrated lime mixed with natural cement and Portland cement, (2) a “natural fibrous aggregate” such as coming from recycled wood, newsprint or other biological fibers that may be mixed with and post industrial recycled and fiberized materials or post consumer ground glass and (3) a selected “mix of biological and industrial polymers” utilized to provide required dispersion of the recycled materials and bonding to the substrate. The polymer mix determines the moisture retention and the curing rate of the HT wrap. The substrate can be any construction material that is on the surface of the existing building (direct applied HT wrap) but preferably, the particular design includes three types of thermal insulation materials: (1) bio-fiber insulation boards, (2) polystyrene insulation boards and (3) continuous either sprayed/frothed or poured polyurethane foam, on which surface the HT wrap is applied. Either closed or open cell foams can be used. A reinforcement mesh is placed between the bonding and protective layers of the HT wrap. The mesh is either a metal wire (for example 2.5 oz or 3.4 self-furring lath) or a flexible polymeric mesh (for example, 4 oz or 15 oz fiberglass mesh, permalath, polypropylene etc). The third (finishing) layer may be of a similar nature as the first two or one of the traditional materials used in exterior insulation finishing systems. Any textured and pigmented coating or appropriate paint (mineral oil) can be applied on the top of the finishing layer. The HT wrap may be designed differently for each of the basic climatic zones of for example, the USA. BRIEF DESCRIPTION OF THE DRAWINGS The present invention will be more fully understood and appreciated by reading the following Detailed Description in conjunction with the accompanying drawings, in which: FIG. 1 is a cross-sectional schematic of thermal insulating material and an “HT” wrap constructed and applied to the wall of a building, according to the principles of the present invention; FIG. 2 is a graph of: cumulative water inflow vs. square root of time, for several alternative components (mixes C and D) of the present invention; FIG. 3 is a graph of: drying rate vs. time for modified stucco mixes shown in FIG. 2; FIG. 4 is a graph representing water absorption rate of modified stucco that uses recycled insulation material (EPS beads); FIG. 5 is a graph representing drying rates vs. time of the same modified stucco; FIG. 6 is a cross-sectional schematic of the HT wrap on Eco-fiber board adhered by mortar or adhesive to the wall in a cold climate application; and FIG. 7 is a cross-sectional schematic of the HT wrap on Eco-fiber board adhered with close cell polyurethane foam to the wall in a warm climate application. DETAIL DESCRIPTION OF THE PREFERRED EMBODIMENTS Referring now to the drawings herein, the numerals refer to parts throughout, for controlling the rate of air, vapor, and liquid water flow across the wall “W” of a building enclosure, as may be seen herein below, in FIG. 1, representing an external insulation system that includes a hygro thermal (HT) wrap 10. The “HT” system shown in FIG. 1 restricts the passage of air and liquid water while permitting the transfer of water vapor to a degree required by the particular climatic conditions. The rate of water vapor transmission across the system is controlled by components of the assembly but it also varies with the moisture content of layers 13 and 14 shown in FIG. 1. The HT wrap 10 applied to a wall “W”, comprises a bonding layer 13, a protective layer 14 and a finishing layer 15. The bonding layer 13 and the protective layer 14 are preferably identical or nearly identical in composition and thickness and have a thickness of about 3/16 to ¼ in (4 to 6 mm) each and constructed so as to ensure that the reinforcing mesh is placed in the middle of the layered composition. The layers 13 and 14 contain inorganic binders and fillers, for example: lime, cement and fly ash mixed with organic, recycled materials, for example: wood and cellulose fibers fiberized and ground to the particle size as for example: recycled glass mesh 80, generally as needed to accomplish several elements of performance such as (1) provide the required characteristic length allowing for expansion of the freezing water and thereby providing high degree of freeze-thaw durability, (2) provide the interruption in the crack propagation through the brittle inorganic matrix of the stucco and thereby reduce shrinkage and cracking ability (3) provide a degree of elasticity to accommodate movements caused by the structure or gas-filled thermal insulating materials of the HT wrap substrate. FIG. 1 of The Drawings shows a Schematic drawing of the exterior insulation system that includes the multiple layers 13-16 comprising the “HT” wrap 10, as applied onto insulation 12 on a wall “W”. The layer 12 is a thermal insulation material, such as for example, commercially available Eco-fiber board or mineral fiber board adhered and/or mechanically fastened to the structure of the wall “W”. The layers 13 and 14 of the HT wrap 10 are designed to have the target capillary active, absorbent and hygroscopic performance. The micro-porous system of layers 13 and 14 is inherently a capillary active and hygroscopic material such as for example: modified stucco with recycled insulation shown in FIGS. 4 and 5, with ability to change the rate of moisture transfer with the changes in relative humidity (RH) to which it is exposed. Conversely the layer 15, such as for example: acrylic modified lime-cement finishing coating has hydrophilic properties. The outermost layer 16 is an optional decorative finish. At a low RH, the HT wrap 10 has higher resistance to water vapor diffusion than that at a high RH. The HT wrap 10, in combination with the three recited thermal insulation types provides a durable water protection under conditions-involving prolonged presence of water and thermal gradients. The required degree of water storage depends on physical properties of the HT wrap layers and considered climate. In cold and mixed climates, the lowermost layers 13 and 14 are preferably enclosed by a thermal insulation on one side and permeable for water vapor finishing layer 15 on the other side. In climates with a frequent interim wetting and drying, the layers 13 and 14 are preferably designed with lower water vapor permeance. Different aggregate compounds may be used to modify moisture characteristics of the layers 13 and 14. An inorganic layered silicate, such as bentonite, vermiculite, or montmorillonite, or selected particulate such as silica, diatomous earth or fly ash can be used for these layers made as a dry premix of binder, recycled aggregate and polymers. The outer layers 15 and/or 16 may also be pre-treated with ingredients which act as biocides e.g., bark of pine tree and enhance protection from microbial deterioration in the form of mold. Other polymeric compounds can also be incorporated into layer 16 to expand the range of control over water, and vapor transport. Generally, the control of the resistance to liquid water penetration and air while maintaining an ability to transfer water vapor at desired levels is achieved by the pore structure of each layer of the HT wrap 10, as well as by the interface between layers 14 and 15 that constitutes the contrast between the nature of these two layers. The composite laminate and micro-porous structure of the HT wrap 10 is also less susceptible to shrinkage during drying (typically less than 0.22% after de-molding of the test specimen). Increased water retention of the HT wrap to extend its pot life and eliminate wetting during the curing time makes it resistant to shrinkage cracking and fibrous reinforcement resistant against cracking caused by structural and hygro-thermal movements and deformations. Effectively, the HT wrap 10 has improved resistance to cracking in comparison to conventional stuccos currently used in the exterior insulation systems. The rate of water vapor transfer needed in a typical construction application depends on both on the climate and service conditions in the specific application. Yet the curing of cement to rapidly achieve initial strength requires high moisture content in the first two days of the service life. To this end selecting adequate type and fraction of admixtures affects the initial water retention of the HT wrap. Furthermore, the composition and micro-porous structure of the layers 13 and 14 as well as inter-face between the layers 14 and 15 dramatically improves the tolerance to poor curing conditions in hot climates. The period of initial water retention in the HT wrap is thus climate dependent and the present inventive HT wrap technology allows us to modify the water retention period during the design of mix. In effect, these possibilities of the selection of the air, water and vapor controlling properties of the HT wraps improve the durability of building wall assemblies. The present invention thus includes the design of two classes of the HT wrap that are designated for use in various climates, according to standard building specifications. Two extreme classes of the HT wrap 10 differ in their water vapor transmission ability. The first class of the HT wrap is semi-impermeable for water vapor (WV) and has WV permeability coefficient measured by ASTM E96 dry cup method of between 0.1 perm and 0.5 perm (6 to 28 ng/(m2sPa)) for use in hot and humid climates. With the rate of air transmission of the HT wrap 10 tested at 50 Pa that is lower than 0.02 l/m2sPa, this material is also suitable for air control in hot and humid environments. The second class of the HT wrap 10 is semi-permeable, and has a water vapor permeability coefficient measured by ASTM E96 dry cup method between 4 perm and 8 perm (230 to 460 ng/(m2sPa) and is suitable for mixed and cold climate applications. The HT wrap also provides additional protection measures from moisture that is enclosed during the construction process, or that infiltrates from incidental water leakage. For enhanced dissipation of incidental water leakage, the finishing layer (15) or the coating (16) may include a granular finish. The HT wrap may thus be used in many applications where enhanced moisture removal is required, such as walls prone to heavy rain loads, on concrete block walls in basements, or other applications where enhanced drying capability is needed. Example 1 Basic Concepts Several laboratory samples of base coat of the HT wrap 10 were prepared and tested. The sample denoted “C” in FIG. 2 was produced with the ratio hydraulic lime:fly ash:cement:sand 1:1:1:6 while sample “B” represent a traditional base-coat of Portland Cement Plaster with the ration cement:lime:sand 1:0.25:4. Mixes C and D, shown in FIGS. 2 and 3 are binder compositions that are used in the following invention. Another mix, shown in FIGS. 4 and 5, also included as a partial subject of this invention used recycled polystyrene beads. FIG. 2 is a graph with a Lime based binder mix C shows wetting from free water surface faster than mix B that is based on the standard Portland cement. Note that faster wetting also implies faster drying of the rain wetted material. FIG. 3 is a graph showing Drying rate versus drying time measured on two specimens from different mixes (B-E). Mix B is based on standard Portland Cement, other mixes (C, D, E) are based on lime with varying fraction of insulation aggregate to change product density (e.g. mix D has density of 800 kg/m3). FIG. 4 is a graph showing Water absorption measured on modified stucco mix with polystyrene beads and density of 170 kg/m3 FIG. 5 is a graph showing Drying rates versus drying time measured on modified stucco shown in FIG. 4. FIGS. 2-5 thus show that hygric properties can be designed independently of fractions of cement and aggregate. Example 2 An HT wrap on Eco-Fiber Board External Insulation Systems for Cold Climate Since 1994 flexible and rigid wood-fiber insulation boards have been produced in Germany in accordance with a standard WF-EN 13171-T3-CS (10/Y) 20-TR7, 5-WS2, 0-MU5-AF100. When a multi-fiber system is used as an additive to the wood fibers to modify its physical properties this product is known as “Eco-fiber board”. FIG. 6 shows a system based on application of the rigid Eco-fiber board. FIG. 6 is a cross-section example of an HT wrap 10, comprising layers 13-16, applied on Eco-fiber board 12 for cold climate application applied to a wall surface “W”. The layer 12 here is Eco-fiber board from a special run of Homatherm GmbH in Berga, Germany. It has density about 120 kg/m3, a thermal conductivity measured at 10° C. equal to 0.037 W/mK or thermal resistivity of 3.9 (of hr ft2)/BTU in, specific heat 2100 J/(kgK) and thickness 80 mm (3¼ inch). It is adhered to the OSB substrate using Sto Corp manufactured primer/Adhesive placed with a trowel. The HT wrap (the layers 13 and 14) was also manufactured by Sto Corp with the mix designed in accordance with this invention. Glass fiber mesh (5 oz) was placed between the layers 13 and 14. The layer 15 was a StoSilco®Lastic—a ready-mixed, silicone-enhanced, smooth elastomeric exterior wall coating that is weather and mildew-resistant. Total thickness of the HT wrap was 12 mm. No special treatment (16) was used. Example 3 Continuous External Insulation (SPF) Systems for warm climate FIG. 7 shows an example of an HT wrap 10, comprised of layers 13-16, placed on Eco-fiber board and adhered with close cell polyurethane foam onto a wall surface “W” in warm climate application. The insulation layer 12 represented here may be made of 1½ inch thick, close or open cell polyurethane foam. This could be either poured foam, applied with a typical 4 ft (1.2 m) height, between extruded polystyrene strips placed on each stud serving as both distance marks and locations of the mechanical fasteners locations or 2 component pressurized froth. In the latter case the maximum height of the insulation board is 2 ft (60 cm). In the actual example 3 different foams from two different manufacturers were used. One of the foams had CCMC 12840-Report that describes the technical features as follows: The final cured product has a nominal density of 30.4 kg/m3 and an assigned design thermal resistance of 1.05 m2·° C./W per 25 mm (R6 per inch). Compressive strength is 222 kPa and tensile strength 337 kPa that is sufficient to ensure adhesion to the substrate and cohesion of the foam. In this example, the HT wrap had additional admixture of layered silica to reduce its WVT and the finishing layer applied on an HT-wrap was acrylic coating with permeance below 1 perm. Example 4 Continuous External Insulation (SPF) Systems for any Climate When additional windows are included in the wall rehabilitation, the mechanical loads carried by the exterior insulation may exceed the load bearing capability of the fasteners and specially designed, thermally broken frames are used with eco-fiber board adhered to the wall with spray polyurethane foam but carried by the horizontal shelves. The surface of the Eco-boards is flush with the exterior of the shelves and special tape may be used to cover the board to shelf connections and avoid stress concentration on the HT wrap. Notes on the Examples of this Invention This system has a few options that depend on the climatic and service conditions. For 1½ inch thick foam the water vapor permeance of this foam is about 1.5 perm i.e. is semi-permeable. For exposed conditions with coastal climate and high winds it is preferable to use a drainable system with the drainage layer is made out of Eco-fiber board or a mineral fiber as discussed above. This layer is connected to venting and flashing on the level of floor that leads water outwards. For less exposed locations in Central or Western US, an eco-board of the required thickness may be used with poured foam behind it. The mechanical fasteners are typically not required for this option. Use of horizontally placed eco-fiber changes the pattern of work, which namely leads to filling the whole perimeter of the house in horizontal increments of height. OVERVIEW OF THE INVENTION This invention covers a process of construction leading to an external insulating system that accelerates drying of moisture encapsulated during construction of for example, the walls, ceilings, roofs or floors of a building enclosure, or when moisture which comes from condensation or incidental rain leaks at windows or other penetrations of that enclosure. This invention also covers an insulated cladding system for new building construction or an insulation system which is retrofit to the walls, ceilings, roofs or floors of existing buildings in order to provide adequate rain water absorption, storage and removal capability. To accelerate the process of moisture removal while at the same reduce rain wetting capability, one or more of the following measures may be utilized: (1) drainage capability; (2) temporary moisture storage capability, (3) negative wetting angle preventing water flow combine with high water vapor permeance of eco-fiber, (4) sequence of material with a higher activity index or higher storage capability. The present invention recognizes that building enclosures must be designed differently for various climates and therefore the principles defined in this invention description may have different representation in warm, mixed or cold climates. The process of construction covered by this invention comprises two interacting and in itself often composite layers: (1) exterior thermal insulation and (2) a hygro-thermal (HT) wrap. The thermal insulating layer may be continuous (spray polyurethane foam) or constructed with boards that are permeable for water vapor, such as expanded polystyrene or Eco-fiber boards. If spray foam is used preferably an eco-fiber board or mineral fiber layer with known ability for drainage and diffusion-based drying is included in the exterior insulating system. This system may or may not be open for air flow. The HT wrap comprises of three layers, namely a bonding layer, a protective layer and a finishing layer. The bonding and protective layers have either identical or almost identical composition so that 3-layer system actually comprise two materials where one of them is applied in two steps. The external cladding system, as represented in FIG. 1 is called the “HT” wrap 10, that is comprised of: a bonding layer (13) and a protective layer (14), those layers being identical but placed on both sides of the reinforcing mesh and both having capillary active and hygroscopic behavior; and a finishing (15) layer adhered to the protective layer (14) that may or may not be covered with an exterior paint layer (16), wherein the water vapor permeability of this system is directionally sensitive. If water falls on the layer 15 or layer 16, the moisture transmission coefficient is lower than when tested from the inner layer 12 to the exterior layer 16. Furthermore, the intermediate layers 13 and 14 may change water vapor transmission coefficient with a change in moisture content of the material. The binder in layers 13 and 14 include hydraulic lime modified with natural and Portland cements. The layers 13 and 14 may include at least one compound selected from the group of inorganic layered silicates. The inorganic layered silicate may comprise at least one compound selected from the group consisting of bentonite, vermiculite, montmorillonite and colloidal clay. The inorganic layered silicate may comprise an alkali metal polysilicate solution. The layers 13 and 14 may include at least one compound selected from the group of natural cements. The natural cement may comprise at least one compound selected from the group consisting of fly ashes or pozzolanic materials (metakaolin, ground brick, and enamel glass). The layers 13 and 14 may include at least one compound selected from the group of bio-fibers. The bio-fibers may comprise one fiber type from the group consisting of wood, cellulose, hemp, flax, jute or bamboo. The layers 13 and 14 may include at least one compound selected from the group of regrind/recycled material such as expanded polystyrene coming from molded products such as boards, cups or packaging materials or glass. This recycled material may be ground to the fiber or particle size as needed, for example, about 60 to about 240 microns to provide the required characteristic length for a number of performance aspects: 1) To allow for expansion of the freezing water and thereby providing high degree of freeze-thaw durability; 2) To provide the interruption in the crack propagation through the brittle inorganic matrix of the stucco; 3) To provide a degree of elasticity to accommodate movements caused by the structure and gas-filled thermal polyurethane foam The layers 13 and 14 may include at least one compound selected from the group of bio-chemical and industrial surfactants, dispersive and bonding polymers. These polymers may provide multiple functions e.g. hydroxypropyl methyl cellulose not only increases bonding and allows usage of a non-wetting aggregate taken from the recycling but also reduces the volumetric fraction of water added to the dry stucco. The reinforcing mesh, placed between layers 13 and 14 (see FIG. 1) is made either of metal or polymers (fiberglass, polypropylene etc). Any of the layers 13, 14, 15 or 16 may includes a biocide. The layer 16 is optional. It may include an additional granular admixture or micro-pores to enhance the transport of moisture. The layer 16 may further comprise fillers for improving the radiant barrier properties. The surface finish on the layer 15 may include at least one hygroscopic compound selected from the group consisting of diatomous earth, fly ash, silica powder or ground bark. The layer 15 may be covered with surface finish (16). The surface finish (16) may be comprised of latex acrylic. The surface finish (16) may be comprised of latex rubber. The surface finish (16) may be comprised of mineral oil. The surface finish (16) may be comprising pigments. The HT wrap may have an air permeability rate at 50 Pa lower than 0.021/m2sPa. When measured with the ASTM E96 standard test method—dry cup, the HT wrap may have water vapor permeability of between 0.1 to 0.5 perms (6 to 28 ng/m2sPa) for use in warm climates or up to 10 perms (570 ng/m2sPa) for use in cold climates. In conclusion, any permeable or semi-permeable external thermal insulating material such as Eco-fiber board, spray polyurethane foam or even expanded polystyrene, when covered with HT wrap to achieve good drying capability, is the subject of this invention. The method of manufacturing an HT wrap comprises the one or more of the steps of: 1. Selecting a mix that is comprised of one or two components from each of the three following groups: (1) a binder that include S-type hydrated lime mixed with natural cements and Portland cement filled, (2) a natural fibrous aggregate such as coming from recycled wood, newsprint or other biological fibers mixed with and post industrial or post consumer ground glass etc, and (3) a selected bio-chemical or/and industrial polymeric admixture to provide required dispersion of the recycled thermal insulation materials and the bonding to the substrate. The mix may or may not include at least one additional compound selected from the group consisting of diatomous earth, silica powder or ground bark. The recycled materials may be fiberized or ground to the size as needed to provide improvement of selected performance aspects. 2. The mix preferably includes at least one compound selected from the group of bio-chemical and industrial surfactants, dispersive and bonding polymers. The polymers may provide a multiple function e.g. hydroxypropyl methyl cellulose not only increases bonding and allows usage of a non-wetting aggregate taken from the recycling and reduces the volumetric fraction of water added to the dry stucco mixture. 3. Applying the mix in two layers, where the second layer may have identical composition but a reinforcing mesh is placed in between them. After adequate drying time the finishing layer is applied. 4. The stucco system may have an air permeability rate at 50 Pa lower than 0.02 l/(m2s Pa). The HT wrap may have a water vapor permeability of between 0.1 to 0.5 perms (6 to 28 ng/m2sPa), class 1, or between 4 and 8 perms (230 to 460 ng/m2sPa), class 2, when measured with the ASTM E96 standard test. The invention thus comprises an external insulation appliqué system for stepped application to a building wall construction, the system comprising: a layer of permeable or semi-permeable thermal insulation arranged onto the wall of the building, covered with a hygro thermal (HT) wrap consisting initially of three individually applied, climate-dependent layers of: an inner bonding layer arranged onto the layer of thermal insulation; a layer of reinforcing mesh arranged on the inner bonding layer, and a protective layer arranged on the layer of reinforcing mesh, and wherein the inner bonding layer and the protective layer both comprise capillary active and hygroscopic components, wherein the inner bonding layer and the protective layer both comprise capillary active and hygroscopic components, to achieve water resistivity and permit accelerated drying of the exterior insulation system. The layer of thermal insulation is preferably selected from the group comprising: fiber board, open cell polyurethane foam, closed cell polyurethane foam, and expanded polystyrene. The polyurethane foam is preferably applied to both the front and rear sides of the fiber boards, to facilitate drainage and accelerated drying of the exterior insulation system. The inner bonding layer and the protective layer both preferably include a compound of inorganic, layered silicate selected from the group consisting of: bentonite, vermiculite, montmorillonite and colloidal clay. The inorganic layered silicate is preferably comprised of an alkali metal polysilicate solution. The bonding layer and the protective layer preferably include at least one compound selected from the group consisting of: fly ashes and pozzolanic materials consisting of metakaolin, ground brick and glass. The bonding layer and the protective layer include at least one compound preferably selected from a bio-fiber group consisting of: wood, cellulose, hemp, flax, jute and bamboo. The bonding layer and the protective layer may include at least one compound selected from a recycled material consisting of: expanded polystyrene and glass. The bonding layer and the protective layer may include at least one compound selected from a group of consisting of: bio-chemical polymers (extracts from corn, guar gum and sugar cane) from and the industrial polymers such as hydroxypropyl methyl cellulose. The reinforcing mesh layer preferably consists of at least one compound selected from metal and polymers selected from the group consisting of: fiberglass and polypropylene. At least one layer of the hygro-thermal wrap preferably includes a water-retention modifying compound selected from the group consisting of: diatomous earth, fly ash, silica powder and ground bark. The layer of thermal insulation under the hygro wrap consists of a semi permeable film to permit effective drying capability of the building wall under the layer of thermal insulation. At least one of the layers of the hygro thermal wrap may include a biocide compound. The protective layer is preferably covered by a further finish layer selected from the group consisting of: paint pigments, biocides and fillers, comprising the balance of the HT wrap. 1. An external insulation appliqué system for stepped application to a building wall construction, the system comprising: a layer of permeable or semi-permeable thermal insulation arranged onto the wall of the building, covered with a hygro thermal (HT) wrap consisting initially of three individually applied, climate-dependent layers of: an inner bonding layer arranged onto the layer of thermal insulation; a layer of reinforcing mesh arranged on the inner bonding layer, and a protective layer arranged on the layer of reinforcing mesh, and wherein the inner bonding layer and the protective layer both comprise capillary active and hygroscopic components, wherein the inner bonding layer and the protective layer both comprise capillary active and hygroscopic components, to achieve water resistivity and permit accelerated drying of the exterior insulation system. 2. The external insulation system as recited in claim 1, wherein the layer of thermal insulation is selected from the group comprising: fiber board, open cell polyurethane foam, closed cell polyurethane foam, and expanded polystyrene. 3. The external insulation system as recited in claim 2, wherein the polyurethane foam is applied to both the front and rear sides of the fiber boards, to facilitate drainage and accelerated drying of the exterior insulation system. 4. The external insulation system as recited in claim 1, wherein the inner bonding layer and the protective layer both include a compound of inorganic, layered silicate selected from the group consisting of: bentonite, vermiculite, montmorillonite and colloidal clay. 5. The external insulation system as recited in claim 4, wherein the inorganic layered silicate is comprised of an alkali metal polysilicate solution. 6. The external insulation system as recited in claim 1, wherein the bonding layer and the protective layer include at least one compound selected from the group consisting of: fly ashes and pozzolanic materials consisting of metakaolin, ground brick and glass. 7. The external insulation system as recited in claim 1, wherein the bonding layer and the protective layer include at least one compound selected from a bio-fiber group consisting of: wood, cellulose, hemp, flax, jute and bamboo. 8. The external insulation system as recited in claim 1, wherein the bonding layer and the protective layer include at least one compound selected from a recycled material consisting of: expanded polystyrene and glass. 9. The external insulation system as recited in claim 1, wherein the bonding layer and the protective layer include at least one compound selected from a group of consisting of: bio-chemical polymers (extracts from corn, guar gum and sugar cane) from and the industrial polymers such as hydroxypropyl methyl cellulose. 10. The external insulation system as recited in claim 1, wherein the reinforcing mesh layer consists of at least one compound selected from metal and polymers selected from the group consisting of: fiberglass and polypropylene. 11. The external insulation system as recited in claim 1, wherein at least one layer of the hygro-thermal wrap includes a water-retention modifying compound selected from the group consisting of: diatomous earth, fly ash, silica powder and ground bark. 12. The external insulation system as recited in claim 1, wherein the layer of thermal insulation under the hygro wrap consists of a permeable material to permit effective drying capability of the building wall under the layer of thermal insulation. 13. The external insulation system as recited in claim 1, wherein at least one of the layers of the hygro thermal wrap includes a biocide compound. 14. The external insulation system as recited in claim 1, wherein the protective layer of the initial three layers of the hygro thermal wrap is covered by a further layer selected from the group consisting of paint pigments, biocides and fillers. 15. An external insulation system for stepped application to a building construction, the system comprising: a layer of permeable or semi-permeable thermal insulation arranged onto the wall of the building, covered with a hygro thermal (HT) wrap consisting of three individually applied, climate-dependent layers of: an inner bonding layer arranged onto the layer of thermal insulation; a layer of reinforcing mesh arranged on the inner bonding layer, a protective layer arranged on the layer of reinforcing mesh, and wherein the inner bonding layer and the protective layer both comprise capillary active and hygroscopic components covered by a finish layer of material selected from the group consisting of: paint pigments, fillers, and wherein the inner bonding layer and the protective layer both comprise capillary active and hygroscopic components, to achieve water resistivity and to permit accelerated drying of the exterior insulation system; and wherein the layer of thermal insulation is selected from the group comprising: fiber board, open cell polyurethane foam, closed cell polyurethane foam, and expanded polystyrene; and wherein the polyurethane foam is arranged on both the front and rear sides of the fiber boards, to facilitate drainage and accelerated drying of the exterior insulation system. 16. The external insulation system as recited in claim 15, wherein the inner bonding layer and the protective layer both include a compound of inorganic, layered silicate selected from the group consisting of: bentonite, vermiculite, montmorillonite and colloidal clay.

2010-09-13

en

2011-10-20

US-202117205045-A

Automatic device enrollment in an internet of things network ABSTRACT In an approach to automatic device enrollment in an IoT network, responsive to receiving a request to add a new device to an IoT network, device metadata is requested from the new device. Responsive to receiving the device metadata, the device metadata is confirmed with the device manufacturer using secure information services. Responsive to confirming the device metadata with the device manufacturer, configuration data for the new device is gathered from a repository, where the configuration data is gathered from devices with a same context type in the repository. Responsive to gathering the configuration data for the new device from the repository, the new device is enrolled in the IoT network using the configuration data. BACKGROUND The present invention relates generally to the field of network-based applications, and more particularly to automatic device enrollment in an Internet of Things (IoT) network. The Internet of Things refers to the ever-growing network of physical objects that feature an IP address for internet connectivity specifically, or other network connectivity generally, and the communication that occurs between these objects and other network-enabled devices and systems. A home IoT network may include many different types of IoT devices, for example, smart locks, cameras, lighting controls, smart appliances, garage door openers, entertainment equipment, mobile devices, etc. SUMMARY Embodiments of the present invention disclose a method, a computer program product, and a system for automatic device enrollment in an IoT network. In one embodiment, responsive to receiving a request to add a new device to an IoT network, device metadata is requested from the new device. Responsive to receiving the device metadata, the device metadata is confirmed with the device manufacturer using secure information services. Responsive to confirming the device metadata with the device manufacturer, configuration data for the new device is gathered from a repository, where the configuration data is gathered from devices with a same context type in the repository. Responsive to gathering the configuration data for the new device from the repository, the new device is enrolled in the IoT network using the configuration data. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a functional block diagram illustrating a distributed data processing environment, in accordance with an embodiment of the present invention. FIG. 2 is an example system overview, in accordance with an embodiment of the present invention. FIG. 3 is a flowchart depicting operational steps of the IoT enrollment program, on a computing device within the distributed data processing environment of FIG. 1, for automatic device enrollment in an IoT network, in accordance with an embodiment of the present invention. FIG. 4 depicts a block diagram of components of the computing devices executing the IoT enrollment program within the distributed data processing environment of FIG. 1, in accordance with an embodiment of the present invention. DETAILED DESCRIPTION Enrollment of devices to IoT networks is still a very manual process that is time consuming and prone to errors. For example, in a home IoT network, a smart lock needs the passwords or fingerprints for each person authorized entry via the lock, and the schedules by role of the personnel and inhabitants. Current enrollment mechanisms are centered on security, using methods like certificates from a Certificate Authority (CA) and Public Key Infrastructure (PKI) to authenticate and secure the device, but the process of enrollment is still manual. The current process is clearly inconvenient when you have to maintain several smart locks, mobile devices, TVs, freezers, garage doors, and another set of appliances. The present invention describes a mechanism that addresses this issue by automating the enrollment process based on the classification of the new and existing devices in the IoT network, the gathering and verification of manufacturer information, and configurations sharing. The present invention describes a mechanism by which a device can be securely and automatically enrolled and configured in an IoT network by an IoT controller which checks the device type, function, and required data, validates the device model data with the manufacturer and, if security considerations are met, grants accesses to the device and shares configurations of devices of the same type. The present invention is a method, computer program product, and system that automates the enrollment of devices in IoT networks. In a typical embodiment, the present invention includes an IoT controller for the IoT network; a database that keeps the configuration data for the IoT network devices, the device classifications, configurations and properties; a set of services available for each of the different manufacturers of devices capable of validating identification data of devices and providing basic configurations; a classification of devices based on the type, function and the necessary device data; sharing of configuration information between devices of the same type and model; sharing of access control information (authorized list of users, private encryption keys, etc.); sharing of preconfigured routines (e.g., IFTTT, etc.); and enrollment with Artificial Intelligence (AI) assistants. The present invention improves security by requiring less manual configuration, reduces the configurations tasks for the owners of the IoT networks and devices, prevents the use of default credentials on IoT devices, and ensures standardization of configurations across the entire IoT network. In an embodiment, the IoT controller manages the membership of the IoT network. Each device has a primary context, which is used by the IoT controller to create groups of devices. These groups are qualified to manage specific types of data. Some examples of context types are Financial, Health, Physical security, Personal, and Appliance. New devices request membership to the IoT network from the IoT controller, which in turn requests metadata from the device (e.g., context, manufacturer, serial number, model number). The controller then confirms all this information with the device manufacturer through enabled information services (e.g., web services, API, etc.). This way, only “known” devices will be allowed to enter the IoT network. In an embodiment, the information services are secured so only trusted authorized entities can update it. The IoT network database keeps all data required by the system to run (profiles, context types, etc.). The IoT controller can ask the user to authorize devices that it cannot completely identify, such as those with minimal configuration, where the configuration data is insufficient to uniquely identify the device. Also, the user can request to be the approver of all addition of new devices to the IoT network (after system validation flow is completed). In an embodiment, the user can create predefined rules regarding the addition of new IoT devices where certain devices can be added by the system, other devices can only be added by the user, or a combination of both. The IoT controller, based on the new device context, model and type, gathers configuration data from the devices with the same context type. For example, a new door lock can obtain the configuration from an existing door lock and avoid having the user manually configure the lock. This may include a list of authorized users, encrypted authentication data, entry codes, etc. Additionally, the automatic enrollment process may be based on predefined rules. Some example of those predefined rules can include, but are not limited to: a device that is already connected to the home network (Wi-Fi/LAN); a device that is the same brand and model of another member of the network (this can be achieved by using web services or APIs to connected to the manufacturer site); by purchase history (since the device may have access to the credit card information of the user, the controller may be able to see if the device that has requested access to the IoT network was recently purchased by the user); or if the device was already part of the network (in case the device was removed from the network and then added again). This can be controlled by having a log of all devices that have been part of the IoT network (using any identification method such as the MAC address, serial number, etc., of the new device). This automatic enrollment option can trigger alerts/notifications to the user to enhance the level of security. FIG. 1 is a functional block diagram illustrating a distributed data processing environment, generally designated 100, suitable for operation of IoT enrollment program 112 in accordance with at least one embodiment of the present invention. The term “distributed” as used herein describes a computer system that includes multiple, physically distinct devices that operate together as a single computer system. FIG. 1 provides only an illustration of one implementation and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environment may be made by those skilled in the art without departing from the scope of the invention as recited by the claims. Distributed data processing environment 100 includes computing device 110, connected to both network 120 and IoT network 130, and IoT devices 132, 134, and 136, all connected to IoT network 130. Network 120 can be, for example, a telecommunications network, a local area network (LAN), a wide area network (WAN), such as the Internet, or a combination of the three, and can include wired, wireless, or fiber optic connections. Network 120 can include one or more wired and/or wireless networks that are capable of receiving and transmitting data, voice, and/or video signals, including multimedia signals that include voice, data, and video information. In general, network 120 can be any combination of connections and protocols that will support communications between computing device 110, IoT network 130, and other computing devices (not shown) within distributed data processing environment 100. IoT network 130 allows communication between any number of IoT devices and will allow access to the internet or any other network access required by any of the IoT devices or programs running on the IoT devices. In an embodiment, IoT network 130 is separate from network 120. In another embodiment, IoT network 130 is part of network 120. IoT network 130 can include one or more wired and/or wireless networks that are capable of receiving and transmitting data, voice, and/or video signals. In general, IoT network 130 can be any combination of connections and protocols that will support communications between computing device 110 and IoT devices 132, 134, and 136. Computing device 110 can be a standalone computing device, a management server, a web server, a mobile computing device, or any other electronic device or computing system capable of receiving, sending, and processing data. In an embodiment, computing device 110 can be a laptop computer, a tablet computer, a netbook computer, a personal computer (PC), a desktop computer, a personal digital assistant (PDA), a smart phone, or any programmable electronic device capable of communicating with other computing devices (not shown) within distributed data processing environment 100 via network 120. In another embodiment, computing device 110 can represent a server computing system utilizing multiple computers as a server system, such as in a cloud computing environment. In yet another embodiment, computing device 110 represents a computing system utilizing clustered computers and components (e.g., database server computers, application server computers) that act as a single pool of seamless resources when accessed within distributed data processing environment 100. In an embodiment, computing device 110 includes IoT enrollment program 112. In an embodiment, IoT enrollment program 112 is a program, application, or subprogram of a larger program for automatic device enrollment in an IoT network. In an alternative embodiment, IoT enrollment program 112 may be located on any other device accessible by computing device 110 via network 120. In an embodiment, computing device 110 includes information repository 114. In an embodiment, information repository 114 may be managed by IoT enrollment program 112. In an alternate embodiment, information repository 114 may be managed by the operating system of the device, alone, or together with, IoT enrollment program 112. Information repository 114 is a data repository that can store, gather, compare, and/or combine information. In some embodiments, information repository 114 is located externally to computing device 110 and accessed through a communication network, such as network 120. In some embodiments, information repository 114 is stored on computing device 110. In some embodiments, information repository 114 may reside on another computing device (not shown), provided that information repository 114 is accessible by computing device 110. Information repository 114 includes, but is not limited to, IoT device data, software data, IoT network configuration data, user data, system configuration data, and other data that is received by IoT enrollment program 112 from one or more sources, and data that is created by IoT enrollment program 112. Information repository 114 may be implemented using any volatile or non-volatile storage media for storing information, as known in the art. For example, information repository 114 may be implemented with a tape library, optical library, one or more independent hard disk drives, multiple hard disk drives in a redundant array of independent disks (RAID), solid-state drives (SSD), or random-access memory (RAM). Similarly, information repository 114 may be implemented with any suitable storage architecture known in the art, such as a relational database, an object-oriented database, or one or more tables. Distributed data processing environment 100 includes the IoT devices 132, 134, and 136. In an embodiment, IoT devices 132, 134, and 136 are devices that connect to each other and to computing device 110 over IoT network 130. In an embodiment, IoT devices 132, 134, and 136 may connect via a wired network connection. In another embodiment, IoT devices 132, 134, and 136 may connect via a wireless network connection. In yet another embodiment, IoT devices 132, 134, and 136 may connect via any method that is appropriate for connecting IoT devices as would be known to those skilled in the art. In an embodiment, IoT devices 132, 134, and 136 may be, for example, smart locks, mobile devices, appliances, such as a smart IoT enabled refrigerator, garage door openers, and entertainment equipment. In an embodiment, distributed data processing environment 100 may include any number of IoT devices 132, 134, and 136. FIG. 2 is an example system overview, generally designated 200, in accordance with an embodiment of the present invention. It includes New Devices 201, which are devices that are to be added to the IoT network. New devices 201 send Enrollment Requests 202 to IoT Controller 220, which manages the membership of the IoT network, to gain membership in IoT Network 210. IoT network 210 allows communication between any number of IoT devices and will allow access to the Internet or any other network access required by any of the IoT devices or programs running on the IoT devices. This is an example of IoT network 130 from FIG. 1. In addition to IoT controller 220, IoT network 210 includes IoT Network Data 225, which is a repository that stores the classifications and configuration data for the categories of IoT devices. In an embodiment, the categories are based on the classifications and configuration data that is managed by that group of IOT devices. For example, devices in the category entertainment may have access to my credit card data (required for example to pay for a movie using a smart watch), while devices on the appliance categories have no need for credit card data and therefore may not be allowed to access credit card information. In an embodiment, the configurations and parameters for the classification and categories are the one stored in IoT network data 225. In an embodiment, IoT network data 225 is contained in information repository 114 of FIG. 1. In another embodiment, IoT network data 225 is separate from information repository 114 of FIG. 1. IoT network 130 also includes all the IoT devices that are enrolled in the IoT network. These IoT devices are arranged in IoT Categories 221-224. These categories contain groups that are qualified to manage specific types of data. Each device has a primary context, which is used by the IoT controller to create groups of devices that are arranged in the categories. In the example of FIG. 2, four different categories are illustrated, Category Appliance 221, Category Mobile 222, Category Entertainment 223, and Category Physical Security 224. When new devices 201 send enrollment requests 202 to IoT controller 220 to join IoT network 210, IoT controller 220 sends New Device Information Gathering Messages 226 to Manufacturer Services 231 via network 230, e.g., network 120 from FIG. 1, to verify that the devices that are attempting to join the network are genuine devices. New device information gathering messages 226 are requests from IoT controller 220 to the manufacturer of the new IoT device that is enrolling in IoT network 210 to get information on the new IoT device, such as model and serial numbers, to verify that the device is actually the device it claims to be, and not a false device attempting to infiltrate the system. Manufacturer services 231 are enabled information services (web services, API, etc.) maintained by the manufacturers of the IoT devices. This way, only “known” devices will be enabled to enter the IoT network. The information services are secured so only trusted authorized entities can update the information services. IoT network data 225 is a database or repository that keeps all data required by the system for the IoT devices to run (profiles, context types, etc.). In the case that the new device cannot be completely identified, such as when the device contains minimal configuration data making identification difficult, IoT controller 220 will send User Authorization Request 227 to Network Owner 240, the user or owner that authorizes devices to be enrolled in IoT network 210. User authorization request 227 can also be sent by IoT controller 220 when network owner 240 has directed that any new device needs to be authorized prior to joining the IoT network. Once the device has been verified with the manufacturer, and user authorization has been received if required, then IoT controller 220 will use the data stored in IoT network data 225 for the category of the new device, along with any data received from the manufacturer, to enroll and configure new devices 201 in IoT network 210. FIG. 3 is a flow chart diagram of workflow 300 depicting operational steps for IoT enrollment program 112, in accordance with an embodiment of the present invention. In an alternative embodiment, the steps of workflow 300 may be performed by any other program while working with IoT enrollment program 112. In an embodiment, IoT enrollment program 112 receives an enrollment request from a new IoT device, e.g., new devices 201 from FIG. 2, to join an IoT network, e.g., IoT network 210 from FIG. 2. In an embodiment, in response to receiving an enrollment request from a new IoT device, IoT enrollment program 112 sends a request to the new IoT device for device metadata. In an embodiment, IoT enrollment program 112 receives the device metadata that was requested in step 304 from the new IoT device. In an embodiment, IoT enrollment program 112 sends a request, e.g., new device information gathering message 226, to the manufacturer through enabled information services, e.g., web services, API, etc. In an embodiment, IoT enrollment program 112 sends a request, e.g., new device information gathering message 226 from FIG. 2, to the manufacturer through enabled information services, e.g., web services, API, etc., to confirm that the device metadata received from the new IoT device is valid for a genuine device from that manufacturer. In an embodiment, if IoT enrollment program 112 determines that it cannot completely identify the new IoT device, for example, a device with minimal configuration that is insufficient to uniquely identify the device, or if the user has required that all new IoT devices get user approval prior to adding the new IoT device to the IoT network, then IoT enrollment program 112 determines that user authorization is required. In an embodiment, if IoT enrollment program 112 determines that user authorization is required, then IoT enrollment program 112 sends a request for authorization to the user or network owner. In an embodiment, if IoT enrollment program 112 cannot confirm the IoT device metadata with the manufacturer, or if IoT enrollment program 112 determines that user authorization is required and the response from the user is negative, then IoT enrollment program 112 cancels the enrollment request, disconnects the new IoT device from the IoT network, and does not allow the new IoT device to join the IoT network. IoT enrollment program 112 then ends for this cycle. In an embodiment, if IoT enrollment program 112 that user authorization is not required or, if IoT enrollment program 112 that user authorization is required, and IoT enrollment program 112 receives user authorization, then IoT enrollment program 112, based on the new device context, model and type, gathers configuration data from the devices with the same context type. In an embodiment, IoT enrollment program 112 enrolls the new IoT device using the configuration data as well as the information gathered from the device manufacturer. In an embodiment, IoT enrollment program 112 then ends for this cycle. It should be appreciated that embodiments of the present invention provide at least for the steps of IoT enrollment program 112 for automatic device enrollment in an IoT network. However, FIG. 3 provides only an illustration of one implementation and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environment may be made by those skilled in the art without departing from the scope of the invention as recited by the claims. It should be appreciated that the process depicted in FIG. 3 illustrates one possible iteration of IoT enrollment program 112, which repeats each time a new IoT device attempts to enroll in the IoT network. IoT enrollment program 112 receives an enrollment request from an IoT device (step 302). In an embodiment, IoT enrollment program 112 receives an enrollment request from a new IoT device, e.g., new devices 201 from FIG. 2, to join an IoT network, e.g., IoT network 210 from FIG. 2. IoT enrollment program 112 requests metadata from the IoT device (step 304). In an embodiment, in response to receiving an enrollment request from a new IoT device, IoT enrollment program 112 sends a request to the new IoT device for device metadata. In an embodiment, the device metadata may include, but is not limited to, a context, the device manufacturer, device serial number, and device model number. IoT enrollment program 112 receives metadata from the IoT device (step 306). In an embodiment, IoT enrollment program 112 receives the device metadata that was requested in step 304 from the new IoT device. IoT enrollment program 112 confirms the IoT device metadata with the manufacturer (step 308). In an embodiment, IoT enrollment program 112 sends a request, e.g., new device information gathering message 226 from FIG. 2, to the manufacturer through enabled information services, e.g., web services, API, etc., to confirm that the device metadata received from the new IoT device in step 306 is valid for a genuine device from that manufacturer. In an embodiment, IoT enrollment program 112 determines whether the metadata confirmed with the manufacturer conforms to a set of predetermined rules. In an embodiment, in response to determining that the metadata conforms to a rule in the set of predetermined rules, IoT enrollment program 112 updates the IoT network data repository, e.g., IoT network data 225 of FIG. 2, with the IoT network data including classifications and configurations with known information from the manufacturer. In this way, only devices that have been validated as genuine will be enabled to enter the IoT network. In an embodiment, these predefined rules may include, but are not limited to, a device that is already connected to the home network (Wi-Fi/LAN); a device that is the same brand/model as another member of the network (which is verified by using web services or APIs to connect to the manufacturer site as described previously), or by purchase history (since the device has access to the user's credit card information, it may be able to determine if the device that is requesting access to the IoT network was recently purchased by the user), or if the device was already part of the network (in the case where the device was removed from the network and then added again). This last case can be controlled by IoT enrollment program 112 keeping a log of all devices that have been part of the IoT network using any identification method, such as MAC address, serial number, etc., as would be known to a person having skill in the art. IoT enrollment program 112 determines if the manufacturer confirmed the IoT device metadata (decision block 310). In an embodiment, only devices that have been validated as genuine will be enabled to enter the IoT Network. In an embodiment, if IoT enrollment program 112 determines that the manufacturer confirms the IoT device metadata (“yes” branch, decision block 310), then IoT enrollment program proceeds to Decision Block 312 to determine if user authorization is required. In an embodiment, if IoT enrollment program 112 determines that the manufacturer cannot confirm the IoT device metadata (“no” branch, decision block 310), then IoT enrollment program proceeds to step 314 to user authorization to enroll the device. IoT enrollment program 112 determines if user authorization is required (decision block 312). In an embodiment, if IoT enrollment program 112 determines that it cannot completely identify the new IoT device, for example, a device with minimal configuration that is insufficient to uniquely identify the device, or if the user has required that all new IoT devices get user approval prior to adding the new IoT device to the IoT network, then IoT enrollment program 112 determines that user authorization is required. In an embodiment, if IoT enrollment program 112 determines that user authorization is not required (“no” branch, decision block 312), then IoT enrollment program continues to step 320 to gather configuration data. In an embodiment, if IoT enrollment program determines that user authorization is required (“yes” branch, decision block 312), then IoT enrollment program proceeds to step 314 to request the authorization from the user or IoT network owner. IoT enrollment program 112 requests user authorization (step 314). In an embodiment, if IoT enrollment program 112 determines that the manufacturer cannot confirm the IoT device metadata, or if IoT enrollment program 112 determines that user authorization is required, then IoT enrollment program 112 sends a request for authorization to the user or network owner. In an embodiment, this request is sent to the user as a message to a user device, such as a smart phone. In another embodiment, the request is sent to the user as an email. In yet another embodiment, the request is sent to the user via an instance of IoT enrollment program 112 running on a computing device. In other embodiments, the request is sent to the user via any method as would be known to a person of skill in the art. IoT enrollment program 112 determines if user authorization was received (decision block 316). In an embodiment, IoT enrollment program 112 receives the response from the user. In an embodiment, if the response is negative, (“no” branch, decision block 312), then IoT enrollment program 112 proceeds to step 318 to cancel the enrollment request. In an embodiment, if the response is positive (“yes” branch, decision block 312), then IoT enrollment program continues to step 320 to gather configuration data. IoT enrollment program 112 cancels the enrollment (step 318). In an embodiment, if IoT enrollment program 112 cannot confirm the IoT device metadata with the manufacturer, or if IoT enrollment program 112 determines that user authorization is required and the response from the user is negative, then IoT enrollment program 112 cancels the enrollment request, disconnects the new IoT device from the IoT network, and does not allow the new IoT device to join the IoT network. IoT enrollment program 112 then ends for this cycle. IoT enrollment program 112 gathers configuration data from devices with the same context type (step 320). In an embodiment, if IoT enrollment program 112 determines that user authorization is not required or, if IoT enrollment program 112 determines that user authorization is required, and IoT enrollment program 112 receives user authorization, then IoT enrollment program 112 gathers configuration data from the devices with the same context type based on the new device context, model, and type. For example, a new door lock can obtain the configuration data from an existing door lock and avoid the user to have to go through the configuration of the new lock. In an embodiment, this may include a list of authorized users, encrypted authentication data, user unlock codes, etc. In an embodiment, if IoT enrollment program 112 determines that there are no devices in the repository with a similar context to the new device, then IoT enrollment program 112 notifies the user that the new device cannot be automatically enrolled. In an embodiment, IoT enrollment program 112 then ends for this cycle. IoT enrollment program 112 enrolls the device (step 322). In an embodiment, IoT enrollment program 112 enrolls the new IoT device using the configuration data gathered in step 320 as well as the information gathered from the device manufacturer in decision block 310. In an embodiment, IoT enrollment program 112 then ends for this cycle. FIG. 4 is a block diagram depicting components of computing device 110 suitable for IoT enrollment program 112, in accordance with at least one embodiment of the invention. FIG. 4 displays computer 400; one or more processor(s) 404 (including one or more computer processors); communications fabric 402; memory 406, including random-access memory (RAM) 416 and cache 418; persistent storage 408; communications unit 412; I/O interfaces 414; display 422; and external devices 420. It should be appreciated that FIG. 4 provides only an illustration of one embodiment and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environment may be made. As depicted, computer 400 operates over communications fabric 402, which provides communications between computer processor(s) 404, memory 406, persistent storage 408, communications unit 412, and I/O interface(s) 414. Communications fabric 402 may be implemented with any architecture suitable for passing data or control information between processors 404 (e.g., microprocessors, communications processors, and network processors), memory 406, external devices 420, and any other hardware components within a system. For example, communications fabric 402 may be implemented with one or more buses. Memory 406 and persistent storage 408 are computer readable storage media. In the depicted embodiment, memory 406 comprises RAM 416 and cache 418. In general, memory 406 can include any suitable volatile or non-volatile computer readable storage media. Cache 418 is a fast memory that enhances the performance of processor(s) 404 by holding recently accessed data, and near recently accessed data, from RAM 416. Program instructions for IoT enrollment program 112 may be stored in persistent storage 408, or more generally, any computer readable storage media, for execution by one or more of the respective computer processors 404 via one or more memories of memory 406. Persistent storage 408 may be a magnetic hard disk drive, a solid-state disk drive, a semiconductor storage device, read only memory (ROM), electronically erasable programmable read-only memory (EEPROM), flash memory, or any other computer readable storage media that is capable of storing program instruction or digital information. The media used by persistent storage 408 may also be removable. For example, a removable hard drive may be used for persistent storage 408. Other examples include optical and magnetic disks, thumb drives, and smart cards that are inserted into a drive for transfer onto another computer readable storage medium that is also part of persistent storage 408. Communications unit 412, in these examples, provides for communications with other data processing systems or devices. In these examples, communications unit 412 includes one or more network interface cards. Communications unit 412 may provide communications through the use of either or both physical and wireless communications links. In the context of some embodiments of the present invention, the source of the various input data may be physically remote to computer 400 such that the input data may be received, and the output similarly transmitted via communications unit 412. I/O interface(s) 414 allows for input and output of data with other devices that may be connected to computer 400. For example, I/O interface(s) 414 may provide a connection to external device(s) 420 such as a keyboard, a keypad, a touch screen, a microphone, a digital camera, and/or some other suitable input device. External device(s) 420 can also include portable computer readable storage media such as, for example, thumb drives, portable optical or magnetic disks, and memory cards. Software and data used to practice embodiments of the present invention, e.g., IoT enrollment program 112, can be stored on such portable computer readable storage media and can be loaded onto persistent storage 408 via I/O interface(s) 414. I/O interface(s) 414 also connect to display 422. Display 422 provides a mechanism to display data to a user and may be, for example, a computer monitor. Display 422 can also function as a touchscreen, such as a display of a tablet computer. The programs described herein are identified based upon the application for which they are implemented in a specific embodiment of the invention. However, it should be appreciated that any particular program nomenclature herein is used merely for convenience, and thus the invention should not be limited to use solely in any specific application identified and/or implied by such nomenclature. The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention. The computer readable storage medium can be any tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire. Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device. Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention. Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions. These computer readable program instructions may be provided to a processor of a general-purpose computer, a special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks. The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks. The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, a segment, or a portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions. The descriptions of the various embodiments of the present invention have been presented for purposes of illustration but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The terminology used herein was chosen to best explain the principles of the embodiment, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. 1. A computer-implemented method comprising: responsive to receiving a request to add a new device to an Internet of Things (IoT) network, requesting, by one or more computer processors, a device metadata from the new device, wherein the device metadata includes a context of the new device; responsive to receiving the device metadata from the new device, requesting, by the one or more computer processors, verification from a manufacturer of the new device that the new device is not a false device based on the device metadata, wherein the device metadata is verified using secured information services maintained by the manufacturer of the new device, wherein the secured information services include at least one of web services and application programming interfaces (APIs) maintained by the manufacturer of the new device; responsive to verifying the device metadata with the device manufacturer, gathering, by the one or more computer processors, a configuration data for the new device from a repository, wherein the configuration data for the new device is gathered from one or more devices with a same context type, in the repository, as the context of the new device included in the device metadata; and responsive to gathering the configuration data for the new device from the repository, enrolling, by the one or more computer processors, the new device in the IoT network, wherein the new device is enrolled using the configuration data. 2. (canceled) 3. The computer-implemented method of claim 1, wherein responsive to gathering the configuration data for the new device from the repository, enrolling the new device in the IoT network, wherein the new device is enrolled using the configuration data from the repository comprises: responsive to determining that authorization from a user is required to enroll the new device, requesting, by the one or more computer processors, the authorization from the user; and responsive to receiving the authorization from the user, enrolling, by the one or more computer processors, the new device in the IoT network, wherein the new device is enrolled using the configuration data from the repository. 4. The computer-implemented method of claim 3, wherein responsive to receiving the authorization from the user, enrolling the new device in the IoT network, wherein the new device is enrolled using the configuration data from the repository further comprises: updating, by the one or more computer processors, the repository, wherein the repository is updated with the device metadata from the new device. 5. The computer-implemented method of claim 1, wherein responsive to verifying the device metadata with the device manufacturer, gathering the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository comprises: responsive to the device manufacturer not verifying the device metadata, requesting, by the one or more computer processors, authorization to enroll the new device from a user; and responsive to receiving the authorization from the user, gathering, by the one or more computer processors, the configuration data for the new device from the repository, wherein the configuration data from the repository is gathered from the one or more devices with the same context type. 6. The computer-implemented method of claim 1, wherein responsive to confirming the device metadata with the device manufacturer, gathering the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository comprises: responsive to confirming the device metadata with the device manufacturer, determining, by the one or more computer processors, whether the device metadata conforms to at least one rule in a set of predetermined rules; updating, by the one or more computer processors, the repository with manufacturer data, wherein the manufacturer data includes at least one of classifications and configurations with known information; and gathering, by the one or more computer processors, the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository. 7. The computer-implemented method of claim 1, further comprising: configuring, by the one or more computer processors, the new device using the configuration data from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository. 8. A computer program product comprising one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions including instructions to: responsive to receiving a request to add a new device to an Internet of Things (IoT) network, request a device metadata from the new device, wherein the device metadata includes a context of the new device; responsive to receiving the device metadata from the new device, request verification from a manufacturer of the new device that the new device is not a false device based on the device metadata, wherein the device metadata is verified using secured information services maintained by the manufacturer of the new device, wherein the secured information services include at least one of web services and application programming interfaces (APIs) maintained by the manufacturer of the new device; responsive to verifying the device metadata with the device manufacturer, gather a configuration data for the new device from a repository, wherein the configuration data for the new device is gathered from one or more devices with a same context type, in the repository, as the context of the new device included in the device metadata; and responsive to gathering the configuration data for the new device from the repository, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data. 9. (canceled) 10. The computer program product of claim 8, wherein the program instructions to, responsive to gathering the configuration data for the new device from the repository, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: responsive to determining that an authorization from a user is required to enroll the new device, request the authorization from the user; and responsive to receiving the authorization from the user, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data from the repository. 11. The computer program product of claim 10, wherein the program instructions to, responsive to receiving the authorization from the user, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data from the repository comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: update the repository, wherein the repository is updated with the device metadata from the new device. 12. The computer program product of claim 8, wherein the program instructions to, responsive to verifying the device metadata with the device manufacturer, gather the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: responsive to the device manufacturer not verifying the device metadata, request authorization to enroll the new device from a user; and responsive to receiving the authorization from the user, gather the configuration data for the new device from the repository, wherein the configuration data from the repository is gathered from the one or more devices with the same context type. 13. The computer program product of claim 8, wherein the program instructions to, responsive to confirming the device metadata with the device manufacturer, gather the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: responsive to confirming the device metadata with the device manufacturer, determine whether the device metadata conforms to at least one rule in a set of predetermined rules; update the repository with manufacturer data, wherein the manufacturer data includes at least one of classifications and configurations with known information; and gather the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository. 14. The computer program product of claim 8, further comprising to: configure the new device using the configuration data from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository. 15. A computer system comprising: one or more computer processors; one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more computer processors, the stored program instructions including instructions to: responsive to receiving a request to add a new device to an Internet of Things (IoT) network, request a device metadata from the new device, wherein the device metadata includes a context of the new device; responsive to receiving the device metadata from the new device, request verification from a manufacturer of the new device that the new device is not a false device based on the device metadata, wherein the device metadata is verified using secured information services maintained by the manufacturer of the new device, wherein the secured information services include at least one of web services and application programming interfaces (APIs) maintained by the manufacturer of the new device; responsive to verifying the device metadata with the device manufacturer, gather a configuration data for the new device from a repository, wherein the configuration data for the new device is gathered from one or more devices with a same context type, in the repository, as the context of the new device included in the device metadata; and responsive to gathering the configuration data for the new device from the repository, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data. 16. The computer system of claim 15, wherein: the device metadata includes the context of the new device and the manufacturer of the new device, and the requesting the device metadata, the requesting verification, the gathering the configuration data, and the enrolling the new device in the IoT network are performed by an IoT controller included in the IoT network. 17. The computer system of claim 15, wherein the program instructions to, responsive to gathering the configuration data for the new device from the repository, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: responsive to determining that an authorization from a user is required to enroll the new device, request the authorization from the user; and responsive to receiving the authorization from the user, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data from the repository. 18. The computer system of claim 17, wherein the program instructions to, responsive to receiving the authorization from the user, enroll the new device in the IoT network, wherein the new device is enrolled using the configuration data from the repository comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: update the repository, wherein the repository is updated with the device metadata from the new device. 19. The computer system of claim 15, wherein the program instructions to, responsive to verifying the device metadata with the device manufacturer, gather the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: responsive to the device manufacturer not verifying the device metadata, request authorization to enroll the new device from a user; and responsive to receiving the authorization from the user, gather the configuration data for the new device from the repository, wherein the configuration data from the repository is gathered from the one or more devices with the same context type. 20. The computer system of claim 15, wherein the program instructions to, responsive to confirming the device metadata with the device manufacturer, gather the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository comprises one or more of the following program instructions, stored on the one or more computer readable storage media, comprise program instructions to: responsive to confirming the device metadata with the device manufacturer, determine whether the device metadata conforms to at least one rule in a set of predetermined rules; update the repository with manufacturer data, wherein the manufacturer data includes at least one of classifications and configurations with known information; and gather the configuration data for the new device from the repository, wherein the configuration data is gathered from the one or more devices with the same context type in the repository.

2021-03-18

en

2022-09-22

US-202318354721-A

Shift energy management through repetitive garage shift detection ABSTRACT Techniques for controlling an automatic transmission of a vehicle include receiving a set of operating parameters each relating to a rock cycling maneuver of the vehicle, the rock cycling maneuver comprising a plurality of consecutive garage shifts of the transmission, determining whether the set of operating parameters satisfy a set of entry or exit criteria to/from a rock cycling mode of the transmission and enter/exit the rock cycling mode based on the determination, while not in the rock cycling mode, controlling the transmission based on a first set of calibrations for the transmission, the first set of calibrations being optimized for normal garage shifts of the transmission, and while in the rock cycling mode, controlling the transmission based on a different second set of calibrations for the transmission, the second set of calibrations being optimized for the rock cycling maneuver. CROSS-REFERENCE TO RELATED APPLICATION(S) The present application claims the benefit of U.S. Provisional Application No. 63/393,558, filed on Jul. 29, 2022. The disclosure of this application is incorporated herein by reference in its entirety. FIELD The present application generally relates to vehicle automatic transmission controls and, more particularly, to techniques for shift energy management through repetitive garage shift detection. BACKGROUND Many of today's vehicles are equipped with an automatic transmission that transfers drive torque from a torque generating system (e.g., an engine, an electric motor, or a combination thereof) to a driveline for vehicle propulsion. In general, the automatic transmission is transitioned into one of four primary states: park, reverse, neutral, and drive (also known as “PRND”). The term “garage shift” refers to a shift from park or neutral into either reverse or drive (forward). “Rock cycling” refers to a plurality of back-and-forth transitions between drive and reverse and through neutral (thus, a plurality of garage shifts) in an attempt to “rock” the vehicle forwards and backwards, such as out of a stuck or immovable state (in snow/ice, on rough terrain, etc.). When the accelerator pedal is being applied during multiple consecutive garage shifts (e.g., rock cycling), there is little time for the transmission's clutches to cool down thus resulting in rising clutch temperatures that could cause a fault or malfunction of the transmission. One potential solution to this problem includes reduction of powertrain (e.g., engine) torque to allow the clutch temperatures to decrease, but this torque limiting requires additional controls and has a negative impact on customer performance. Another potential solution to this problem includes shortening the garage shifts to limit energy, but this could result in decreased or compromised shift quality for a majority of customer-performed garage shifts. Accordingly, while such conventional automatic transmission control systems do work for their intended purpose, there exists an opportunity for improvement in the relevant art. SUMMARY According to one example aspect of the invention, a control system for an automatic transmission of a vehicle is presented. In one exemplary implementation, the control system comprises a set of sensors configured to monitor a set of operating parameters of the vehicle, the set of operating parameters each relating to a rock cycling maneuver of the vehicle, the rock cycling maneuver comprising a plurality of consecutive garage shifts of the transmission and a controller configured to determine whether the set of operating parameters satisfy a set of entry or exit criteria to/from a rock cycling mode of the transmission and enter/exit the rock cycling mode based on the determination, while not in the rock cycling mode, control the transmission based on a first set of calibrations for the transmission, the first set of calibrations being optimized for normal garage shifts of the transmission, and while in the rock cycling mode, control the transmission based on a different second set of calibrations for the transmission, the second set of calibrations being optimized for the rock cycling maneuver. In some implementations, the controller is configured to apply hysteresis to the determination of whether the set of operating parameters satisfy the set of exit criteria from the rock cycling mode of the transmission. In some implementations, the set of operating parameters includes (i) a shift counter of successive drive-to-reverse (D-R) or reverse-to-drive (R-D) transitions of the transmission and (ii) a temperature of a clutch of the transmission. In some implementations, the controller is configured to enter the rock cycling mode when the shift counter and the clutch temperature exceed respective thresholds. In some implementations, the set of operating parameters further comprises (i) a position of an accelerator pedal of the vehicle, (ii) a speed of the vehicle, and (iii) a speed of an output shaft of the transmission. In some implementations, the controller is configured to enter the rock cycling mode when at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed exceeds respective thresholds. In some implementations, the controller is configured to exit the rock cycling mode when the shift counter returns to zero and the clutch temperature falls below the respective threshold including an applied hysteresis. In some implementations, the controller is configured to exit the rock cycling mode when the shift counter returns to zero, the clutch temperature falls below the respective threshold including an applied hysteresis, and at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed falls below their respective thresholds including applied hysteresis. In some implementations, the set of operating parameters further includes a driver-controllable enable/disable signal for rock cycling detection. In some implementations, the vehicle is a heavy duty pickup truck. According to another example aspect of the invention, a method for controlling an automatic transmission of a vehicle is presented. In one exemplary implementation, the method comprises receiving, by a controller and from a set of sensors, a set of operating parameters of the vehicle, the set of operating parameters each relating to a rock cycling maneuver of the vehicle, the rock cycling maneuver comprising a plurality of consecutive garage shifts of the transmission, determining, by the controller, whether the set of operating parameters satisfy a set of entry or exit criteria to/from a rock cycling mode of the transmission and enter/exit the rock cycling mode based on the determination, while not in the rock cycling mode, controlling, by the controller, the transmission based on a first set of calibrations for the transmission, the first set of calibrations being optimized for normal garage shifts of the transmission, and while in the rock cycling mode, controlling, by the controller, the transmission based on a different second set of calibrations for the transmission, the second set of calibrations being optimized for the rock cycling maneuver. In some implementations, the method further comprises applying, by the controller, hysteresis to the determination of whether the set of operating parameters satisfy the set of exit criteria from the rock cycling mode of the transmission. In some implementations, the set of operating parameters includes (i) a shift counter of successive D-R or R-D transitions of the transmission and (ii) a temperature of a clutch of the transmission. In some implementations, the method further comprises entering, by the controller, the rock cycling mode when the shift counter and the clutch temperature exceed respective thresholds. In some implementations, the set of operating parameters further comprises (i) a position of an accelerator pedal of the vehicle, (ii) a speed of the vehicle, and (iii) a speed of an output shaft of the transmission. In some implementations, the method further comprises entering, by the controller, the rock cycling mode when at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed exceeds respective thresholds. In some implementations, the method further comprises exiting, by the controller, the rock cycling mode when the shift counter returns to zero and the clutch temperature falls below the respective threshold including an applied hysteresis. In some implementations, the method further comprises exiting, by the controller, the rock cycling mode when the shift counter returns to zero, the clutch temperature falls below the respective threshold including an applied hysteresis, and at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed falls below their respective thresholds including applied hysteresis. In some implementations, the set of operating parameters further includes a driver-controllable enable/disable signal for rock cycling detection. In some implementations, the vehicle is a heavy duty pickup truck. Further areas of applicability of the teachings of the present application will become apparent from the detailed description, claims and the drawings provided hereinafter, wherein like reference numerals refer to like features throughout the several views of the drawings. It should be understood that the detailed description, including disclosed embodiments and drawings referenced therein, are merely exemplary in nature intended for purposes of illustration only and are not intended to limit the scope of the present disclosure, its application or uses. Thus, variations that do not depart from the gist of the present application are intended to be within the scope of the present application. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a functional block diagram of a vehicle having an automatic transmission control system according to the principles of the present application; FIG. 2 is a flow diagram of an example entry method for rock cycling automatic transmission control according to the principles of the present application; and FIG. 3 is a flow diagram of an example exit method for rock cycling automatic transmission control according to the principles of the present application. DESCRIPTION As previously discussed, when an accelerator pedal is being applied during multiple consecutive garage shifts (e.g., rock cycling) of an automatic transmission of a vehicle, there is little time for the transmission's clutches to cool down thus resulting in rising clutch temperatures that could cause a fault or malfunction of the transmission. Because rock cycling is a very aggressive maneuver, clutch life and durability should be prioritized over shift feel and driver comfort, as the driver would or should expect. One potential solution to this problem includes reduction of powertrain (e.g., engine) torque to allow the clutch temperatures to decrease, but this torque limiting requires additional controls and has a significant negative impact on customer performance. Another potential solution to this problem includes shortening the garage shifts to limit energy, but this could result in decreased or compromised shift quality for a majority of customer-performed garage shifts. As both of these solutions have their drawbacks, there exists an opportunity for improvement in the relevant art. Accordingly, improved automatic transmission control systems and methods are presented herein. These improved control systems and methods specifically involve the clutch control logic in an automatic transmission to affect the transmission pressure during a garage shift. The logic includes controls to detect repeated garage shift maneuvers based various entry or entrance criteria. This entry criteria allows for a separate set of calibration handles to thereafter be used to close the clutches faster and reduce the energy during the shift while maintaining standard garage shift quality. This solution also involves detecting a specific set of maneuvers—reverse (R) to drive (D), or R-D, and D-R—based on a set of input criteria (temperature, pedal, number of repetitions, etc.) that would indicate that the driver may be in position where rocking the vehicle is necessary. Once these maneuvers are detected, the software will switch to the separate set of calibration labels specifically used to ensure that the shift energy is controlled to a satisfactory level during the rock cycling, while keeping the normal calibrated garage shifts untouched. This solution is different than the previous conventional solutions as it will allow detection of repeated maneuvers and will allow the use of a separate set of calibration labels to reduce and control shift energy during rock cycling (repeated garage shifts). Traditionally, transmission calibration changes for these repeated vehicle rocking maneuvers would compromise the shift quality for all other garage shifts globally. This solution prevents compromises in garage shift quality being made to cover durability concerns for a specific set of maneuvers that are not covered under normal customer usage. In other words, conventional calibration to cover these “worst-case” scenarios such as rock cycling, even though they are considered extreme scenarios and not often encountered, would result in decreased shift quality/performance for other non-extreme (normal) garage shift operating scenarios that are more often or mostly encountered. This decreased normal garage shift quality/performance could be noticeable to a driver of the vehicle, which is undesirable. On the other hand, the ability to perform rock cycling on certain types of vehicles (e.g., sport utility vehicles (SUVs) or heavy duty trucks) is also desirable to the driver. Referring now to FIG. 1 , a functional block diagram of a vehicle 100 having an example automatic transmission control system 104 according to the principles of the present application is illustrated. It will be appreciated that this is merely one example configuration of the vehicle 100 and that the techniques of the present application could be applicable to any suitable vehicle having an automatic transmission. In one exemplary implementation, the vehicle 100 is a heavy duty pickup truck capable of carrying and/or towing a large payload. The vehicle 100 generally comprises a torque generating system 108 (an engine, an electric motor, or combinations thereof) configured to generate and transfer drive torque via a multi-speed automatic transmission 112 to a driveline 116 of the vehicle 100 for propulsion. The automatic transmission 112 comprises a plurality of clutches 120 configured to selectively engage one of a plurality of gears 124 (e.g., park/reverse/neutral/drive, PRND, or PRND plus drive-low, PRNDL). The torque generating system 108 and the automatic transmission 112 could be collectively referred to as a powertrain of the vehicle 100. A controller 128 controls operation of the vehicle 100, including controlling the torque generating system 108 to generate a desired amount of drive torque to meet a driver torque request received via a driver interface 132 (e.g., an accelerator pedal 136). Other input devices of the driver interface 132 include a gear selector 140 (e.g., PRND or PRNDL) for the automatic transmission 112 and a brake pedal 144. The vehicle 100 also comprises a set of sensors 148 configured to measure various parameters, such as, but not limited to, clutch temperature(s), speed of an output shaft 152 of the automatic transmission 112, a speed of the vehicle 100 (e.g., a speed of the driveline 116), and position(s) of the accelerator/brake pedals 136, 144. The controller 128 is also configured to perform at least a portion of the techniques of the present application, which are described in greater detail below with reference to FIGS. 2 and 3 . These techniques include determining whether standard garage shift calibrations for control of the automatic transmission 112 should be utilized, or if different calibrations for rock cycling of the automatic transmission 112 should be temporarily utilized (e.g., based on specific entry and exit conditions). Rock cycling represents an extreme corner case and thus conventional automatic transmission control systems/methods do not have calibration labels to specifically address this condition. This often results in sacrificed calibration in order to also cover these extreme corner cases. During initial rock cycle testing, the throttle/accelerator is held at wide-open throttle (WOT) and the gear selector 140 is rapidly changed from R-D, D-R, and back-and-forth. As previously mentioned, there are currently no independent calibration labels to specifically address this condition, which results in sacrificed calibration to cover extreme corner cases. This improved rock cycle testing of the present application Introduces several new calibration labels to specifically target rock cycle conditions (rock cycle detection and entry/exit to a specific rock cycling mode). Examples of the criteria include, but are not limited to, (i) shift counter (how many R-D/D-R maneuvers are done successively), (ii) clutch temperature threshold (e.g., with hysteresis to prevent inadvertent exit/toggle), (iii) transmission output shaft speed threshold (e.g., with hysteresis to prevent inadvertent exit/toggle, (iv) vehicle speed threshold (e.g., with hysteresis to prevent inadvertent exit/toggle, and (v) pedal threshold (e.g., with hysteresis to prevent inadvertent exit/toggle). This hysteresis is discussed in greater detail below with respect to FIGS. 2-3 . The resulting calibrations represent pressure surfaces (an offset to ratio change pressure) to use once in a detected rock cycle. These surfaces also limit torque during detected rock cycle. In one embodiment, these surfaces are utilized in a closed-loop manner, thereby allowing for the clutches could be aggressively closed thus prioritizing clutch transmission durability. Referring now to FIGS. 2-3 , a flow diagram of an example entry and exit methods 200, 300 for rock cycling automatic transmission control according to the principles of the present application is illustrated. In the entry method 200, at 204, 208, and 212, the controller 128 determines (i) whether the calibratable enable switch for rock cycle detection is activated, (ii) whether the current number of successive maneuvers (D-R and R-D) exceeds the calibrated shift counter, and (iii) whether the clutch temperature(s) exceed the calibrated clutch temperature threshold. When all three of these are true, the method 200 proceeds. At 216, 220, and 224, the controller 128 then determines whether (i) the accelerator pedal threshold exceeds the calibrated accelerator pedal threshold, (ii) the vehicle speed exceeds the calibrated vehicle speed threshold, and (iii) the transmission output speed threshold exceeds the calibrated output speed threshold. When one of these three determinations is true, the method 200 proceeds to 232 where the controller 128 determines that rock cycling has been detected and the controller 128 transitions to (e.g., a rock cycling mode) using the new calibration labels for faster clutch application in an attempt to prevent clutch/transmission damage or malfunction. FIG. 3 is similar to FIG. 2 but illustrates an exit method 300, i.e., after the controller 128 has detected rock cycling at 232. In the exit method 300, at 304, 308, and 312, the controller 128 determines (i) whether the calibratable enable switch for rock cycle detection is activated, (ii) whether the current number of successive maneuvers (D-R and R-D) has returned to zero (or some suitable low threshold), and (iii) whether the clutch temperature(s) falls below the calibrated clutch temperature threshold, taking into account a corresponding hysteresis. When all three of these are true, the method 300 proceeds. At 316, 320, and 324, the controller 128 then determines whether (i) the accelerator pedal threshold falls below the calibrated accelerator pedal threshold, taking into account a corresponding hysteresis, (ii) the vehicle speed falls below the calibrated vehicle speed threshold, taking into account a corresponding hysteresis, and (iii) the transmission output speed threshold falls below the calibrated output speed threshold, taking into account a corresponding hysteresis. These hysteresis values are applied at 312, 316, 320, and 324 to prevent inadvertent or unnecessary exit and re-entry, which could be undesirable or otherwise noticeable to the driver. When one of these three determinations is true, the method 300 proceeds to 332 where the controller 128 determines that the current rock cycling has concluded and the controller 128 transitions to from using the new calibration labels back to using the standard garage shift calibration labels, i.e., until another rock cycling event is determined. It will be appreciated that the term “controller” as used herein refers to any suitable control device or set of multiple control devices that is/are configured to perform at least a portion of the techniques of the present application. Non-limiting examples include an application-specific integrated circuit (ASIC), one or more processors and a non-transitory memory having instructions stored thereon that, when executed by the one or more processors, cause the controller to perform a set of operations corresponding to at least a portion of the techniques of the present application. The one or more processors could be either a single processor or two or more processors operating in a parallel or distributed architecture. It should also be understood that the mixing and matching of features, elements, methodologies and/or functions between various examples may be expressly contemplated herein so that one skilled in the art would appreciate from the present teachings that features, elements and/or functions of one example may be incorporated into another example as appropriate, unless described otherwise above. What is claimed is: 1. A control system for an automatic transmission of a vehicle, the control system comprising: a set of sensors configured to monitor a set of operating parameters of the vehicle, the set of operating parameters each relating to a rock cycling maneuver of the vehicle, the rock cycling maneuver comprising a plurality of consecutive garage shifts of the transmission; and a controller configured to: determine whether the set of operating parameters satisfy a set of entry or exit criteria to/from a rock cycling mode of the transmission and enter/exit the rock cycling mode based on the determination; while not in the rock cycling mode, control the transmission based on a first set of calibrations for the transmission, the first set of calibrations being optimized for normal garage shifts of the transmission; and while in the rock cycling mode, control the transmission based on a different second set of calibrations for the transmission, the second set of calibrations being optimized for the rock cycling maneuver. 2. The control system of claim 1, wherein the controller is configured to apply hysteresis to the determination of whether the set of operating parameters satisfy the set of exit criteria from the rock cycling mode of the transmission. 3. The control system of claim 1, wherein the set of operating parameters includes (i) a shift counter of successive drive-to-reverse (D-R) or reverse-to-drive (R-D) transitions of the transmission and (ii) a temperature of a clutch of the transmission. 4. The control system of claim 3, wherein the controller is configured to enter the rock cycling mode when the shift counter and the clutch temperature exceed respective thresholds. 5. The control system of claim 4, wherein the set of operating parameters further comprises (i) a position of an accelerator pedal of the vehicle, (ii) a speed of the vehicle, and (iii) a speed of an output shaft of the transmission. 6. The control system of claim 5, wherein the controller is configured to enter the rock cycling mode when at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed exceeds respective thresholds. 7. The control system of claim 4, wherein the controller is configured to exit the rock cycling mode when the shift counter returns to zero and the clutch temperature falls below the respective threshold including an applied hysteresis. 8. The control system of claim 6, wherein the controller is configured to exit the rock cycling mode when the shift counter returns to zero, the clutch temperature falls below the respective threshold including an applied hysteresis, and at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed falls below their respective thresholds including applied hysteresis. 9. The control system of claim 1, wherein the set of operating parameters further includes a driver-controllable enable/disable signal for rock cycling detection. 10. The control system of claim 1, wherein the vehicle is a heavy duty pickup truck. 11. A method for controlling an automatic transmission of a vehicle, the method comprising: receiving, by a controller and from a set of sensors, a set of operating parameters of the vehicle, the set of operating parameters each relating to a rock cycling maneuver of the vehicle, the rock cycling maneuver comprising a plurality of consecutive garage shifts of the transmission; determining, by the controller, whether the set of operating parameters satisfy a set of entry or exit criteria to/from a rock cycling mode of the transmission and enter/exit the rock cycling mode based on the determination; while not in the rock cycling mode, controlling, by the controller, the transmission based on a first set of calibrations for the transmission, the first set of calibrations being optimized for normal garage shifts of the transmission; and while in the rock cycling mode, controlling, by the controller, the transmission based on a different second set of calibrations for the transmission, the second set of calibrations being optimized for the rock cycling maneuver. 12. The method of claim 11, further comprising applying, by the controller, hysteresis to the determination of whether the set of operating parameters satisfy the set of exit criteria from the rock cycling mode of the transmission. 13. The method of claim 11, wherein the set of operating parameters includes (i) a shift counter of successive drive-to-reverse (D-R) or reverse-to-drive (R-D) transitions of the transmission and (ii) a temperature of a clutch of the transmission. 14. The method of claim 13, further comprising entering, by the controller, the rock cycling mode when the shift counter and the clutch temperature exceed respective thresholds. 15. The method of claim 14, wherein the set of operating parameters further comprises (i) a position of an accelerator pedal of the vehicle, (ii) a speed of the vehicle, and (iii) a speed of an output shaft of the transmission. 16. The method of claim 15, further comprising entering, by the controller, the rock cycling mode when at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed exceeds respective thresholds. 17. The method of claim 14, further comprising exiting, by the controller, the rock cycling mode when the shift counter returns to zero and the clutch temperature falls below the respective threshold including an applied hysteresis. 18. The method of claim 16, further comprising exiting, by the controller, the rock cycling mode when the shift counter returns to zero, the clutch temperature falls below the respective threshold including an applied hysteresis, and at least one of the accelerator pedal position, the vehicle speed, and the transmission output shaft speed falls below their respective thresholds including applied hysteresis. 19. The method of claim 11, wherein the set of operating parameters further includes a driver-controllable enable/disable signal for rock cycling detection. 20. The method of claim 11, wherein the vehicle is a heavy duty pickup truck.

2023-07-19

en

2024-02-01

US-41693709-A

High chair ABSTRACT A folding device is configured at the pivot between the rear leg frame and the front leg frame of a high chair and allows a user to complete folding process by pressing a driving member. When the driving member is pressed, an engaging member of the folding device moves correspondingly to an unlocked position, so that the rear leg frame disengages from and pivots about the front leg frame. The high chair can then be folded easily for the user, and the structure of the invention is simpler than the prior art. CROSS REFERENCE TO RELATED APPLICATIONS This application claims the benefit of U.S. Provisional Application No. 61/041,922, filed on Apr. 3, 2008 and entitled “High Chair” the contents of which are incorporated herein by reference. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a high chair, and more particularly, to a high chair including a folding device using simplified mechanism and easy to use. 2. Description of the Prior Art High chairs designed for babies or toddlers have brought great convenience to care givers. With their designed height, babies sitting in seats are tall enough for a sitting care giver to feed them or have interaction. Most conventional high chairs are foldable, which is done by folding the frame body of the high chairs to a smaller size. In order to fold the high chairs, many ways have been disclosed in the prior art skills, by the ways of assembling the front leg frame and the rear leg frame, and unlocking the two leg frames so that they can move to each other. For example, the U.S. Pat. Nos. 6,126,236 and 5,104,180 add a transverse supportive frame between the front leg frame and the rear leg frame in the high chair. The supportive frame, with fixed length, fixes to the front leg frame and the rear leg frame and maintains the relative position between the front leg frame and the rear leg frame in an engaged status. With different mechanism provided by each patent, users can operate an engagement device at the supportive frame and the front leg frame (or the rear leg frame) to stop the engagement of the supportive frame on the front leg frame (or the rear leg frame). The two leg frames of the high chair can then be folded. A foldable supportive frame linking between the bottoms of the front leg frame and the rear leg frame is disclosed in the U.S. Pat. No. 5,707,104. In the opening status of the high chair, the supportive frame can not be folded and the front leg frame and the rear leg frame can be maintained in the opening status. The user can step on an actuator of the supportive frame on the rear leg frame to fold the supportive frame, and further fold the front and rear leg frames. The conventional high chairs mentioned above and in the prior art, however, needs an additional supportive frame or pipe transversely configured between the front leg frame and the rear leg frame, and requires direct operation on a folding device at the supportive frame/pipe to fold the high chair. The conventional mechanisms are complicated to be used and difficult to be stored. SUMMARY OF THE INVENTION According to the present invention, a high chair includes a seat, a frame body for supporting the seat, and a folding device. The frame body is capable of moving between an opened position and a folding position, and includes a front leg frame and a rear leg frame pivotally connected to each other. The folding device includes a folding body mounted on the front leg frame and pivotally connected to a pivoting section of the rear leg frame, an engaging member movably configured on one of the folding body and the pivoting section of the rear leg frame and engaged with the other one of the folding body and the pivoting section of the rear leg frame so as to restrain the frame body in the opened position, and a driving member movably configured on the folding body, for disengaging the engaging member from the other one of the folding body and the pivoting section of the rear leg frame such that the frame body is capable of moving to the folding position. These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagram of a high chair in an opened position of the present invention. FIG. 2 is a diagram of the high chair in a folding position of the present invention. FIG. 3 is a stereoscopic diagram of the high chair of the present invention. FIG. 4 is a diagram of a folding device according to a first embodiment of the present invention. FIG. 5 is an exploded diagram of elements of the folding device according to the first embodiment of the present invention. FIG. 6 is a diagram of the folding device in an unlocked position according to the first embodiment of the present invention. FIG. 7 is a diagram of a rear leg frame pivoted to the folding position relative to a front leg frame according to the first embodiment of the present invention. FIG. 8 is a diagram of a pivoting section of the rear leg frame according to the first embodiment of the present invention. FIG. 9 is a diagram of a folding device according to a second embodiment of the present invention. FIG. 10 is an exploded diagram of elements of the folding device according to the second embodiment of the present invention. FIG. 11 is a diagram of the folding device in the unlocked position according to the second embodiment of the present invention. FIG. 12 is a diagram of the rear leg frame pivoted to the folding position relative to the front leg frame according to the second embodiment of the present invention. FIG. 13 is a diagram of a folding device according to a third embodiment of the present invention. FIG. 14 is an exploded diagram of elements of the folding device according to the third embodiment of the present invention. FIG. 15 is a diagram of the folding device in the unlocked position according to the third embodiment of the present invention. FIG. 16 is a diagram of the rear leg frame pivoted to the folding device relative to the front leg frame according to the third embodiment of the present invention. DETAILED DESCRIPTION Please refer to FIG. 1 and FIG. 2. FIG. 1 is a diagram of a high chair 100 in an opened position of the present invention. FIG. 2 is a diagram of the high chair 100 in a folding position of the present invention. The high chair 100 includes a frame body 40 composed of a front leg frame 20 and a rear leg frame 30, a folding device 60 mounted on a pivot where the front leg frame 20 and the rear leg frame 30 are pivotally connected to each other (Please refer to FIG. 4), and a seat 10 supported by the frame body 40. Please refer to FIG. 3. FIG. 3 is a stereoscopic diagram of the high chair 100 of the present invention. The rear leg frame 30 is pivotally connected to a middle of the front leg frame 20. The front leg frame 20 includes an upper front leg 200 and a lower front leg 202. The seat 10 is installed on the upper front leg 200 which can move relative to the lower front leg 202 for adjusting the height of the seat 10. The rear leg frame 30 is pivotally connected to a top end of the lower front leg 202. When the high chair 100 is in the opened position, a baby can sit in the seat 10, with an adjustable height for a care giver to take care of the baby sitting in the seat 10. The seat 10 can be fixed on the frame body 40, or can be detached from the frame body 40 for storage or other application. The lower front leg 202 of the front leg frame 20 of the frame body 40 and the rear leg frame 30 are U-shaped structure in this embodiment (For example, FIG. 3 shows the U-shaped structure of the lower front leg 202 of the front leg frame 20 and the rear leg frame 30). The front leg frame 20 and the rear leg frame 30 of the frame body 40 are pivotally connected to each other. The folding device 60 is mounted on the pivot where the rear leg frame 30 is pivotally connected to the front leg frame 20. The frame body 40 can move between the opened position shown in FIG. 1 and the folding position shown in FIG. 2 with the folding device 60. In the opened position, foot ends of the rear leg frame 30 and the front leg frame 20 are fixed and far away to each other. In the folding position, the front leg frame 20 and the rear leg frame 30 can be pivoted and close to each other. The high chair 100 can be folded to a smaller size for storage when the front leg frame 20 and rear leg frame 30 are pivoted to the folding position. Please refer to FIG. 4 and FIG. 5. FIG. 4 is a diagram of the folding device 60 according to a first embodiment of the present invention. FIG. 5 is an exploded diagram of elements of the folding device 60 according to the first embodiment of the present invention. As shown in FIG. 4, when the folding device 60 is in a locked position, the rear leg frame 30 can not be pivoted relative to the front leg frame 20 so as to restrain the frame body 40 in the opened position. The folding device 60 includes a folding body 61, an engaging member 62, a driving member 63, a spindle 64, and an elastic element 65. As shown in FIG. 4 and FIG. 5, the folding body 61 includes a first arm 614 and a second arm 615 connected to the first arm 614 with an angle. In this embodiment, the first arm 614 shorter than the second arm 615 is configured on a top end of the lower front leg 202 of the front leg frame 20. The spindle 64 is connected to a pivoting section 31 of the rear leg frame 30, and further pivotally connected to the second arm 615 of the folding body 61. Therefore, the spindle 64 and the rear leg frame 30 can be pivoted relative to the folding body 61 (and the front leg frame 20 where the folding body 61 is located). The second arm 615 of the folding body 61 includes a sliding slot 611 extending along direction F1-F2 in this embodiment. The engaging member 62 is slidably configured on the sliding slot 611 and can be moved along directions F1 or F2 between the locked position shown in FIG. 4 and an unlocked position shown in FIG. 6. The engaging member 62 includes an engaging section 620 and a second inclined surface 621 located on the engaging section 620. The elastic element 65 can be a spring. In this embodiment, the elastic element 65 is configured in the sliding slot 611 and connected between the engaging member 62 and the folding body 61. When the engaging member 62 moves in the sliding slot 611, the elastic element 65 is compressed and bears elastic stress. The driving member 63 can be a button. In this embodiment, the driving member 63 includes a pressing portion 630 and a triangular driving portion 633 transversely stretching from the pressing portion 630. The pressing portion 630 can protrude from an opening of the folding body 61 for operation. The driving portion 633 includes a first inclined surface 632 corresponding to the second inclined surface 621 of the engaging member 62 and a long slot 631. The folding body 61 includes an axle 612 passing through the long slot 631 so that the driving member 63 is configured on the folding body 61 in a manner of moving along directions N1 or N2 relative to the folding body 61. Direction N1-N2 and direction F1-F2 are perpendicular to each other in this embodiment. As shown is FIG. 4, the spindle 64 includes a slot 641 in this embodiment. When the engaging member 62 of the folding device 60 is in the locked position, the engaging section 620 of the engaging member 62 stretches out of the sliding slot 611 of the folding body 61 and into the slot 641 of the spindle 64. At this position, the engaging member 62 abuts on two lateral walls of the slot 641 and the first inclined surface 632 of the driving portion 633 abuts on the second inclined surface 621 of the engaging member 62, so that the spindle 64 and the rear leg frame 30 can not be pivoted relative to the folding body 61 and the front leg frame 20 so that the frame body 40 can be restrained in the opened position. Please refer to FIG. 6 and FIG. 7. FIG. 6 is a diagram of the folding device 60 in the unlocked position according to the first embodiment of the present invention. FIG. 7 is a diagram of the rear leg frame 30 pivoted to the folding position relative to the front leg frame 20 according to the first embodiment of the present invention. In order to fold the frame body 40 to a smaller size, the folding device 60 is unlocked by pressing the pressing portion 630 of the driving member 63 so that the driving member 63 moves to the folding body 61 along direction N1. At this time, the first inclined surface 632 of the driving member 63 has interaction with the second inclined surface 621 of the engaging member 62 and moves the engaging member 62 sliding in the sliding slot 611 along direction F2, so that the engaging section 620 of the engaging member 62 retracts from the slot 641 of the spindle 64 and the whole engaging member 62 moves back into the sliding slot 611 of the folding body 61. Then, the engaging member 62 is in the unlocked position shown in FIG. 6. The two lateral walls of the slot 641 of the spindle 64 are not abutted by the engaging member 62, and the spindle 64 and the rear leg frame 30 can be pivoted to the folding position shown in FIG. 7 relative to the folding body 61 (and the front leg frame 20) for folding the frame body 40. When the engaging member 62 is in the unlocked position shown in FIG. 6, the elastic element 65 connected between the engaging member 62 and the folding body 61 is compressed. When the rear leg frame 30 is pivoted from the folding position shown in FIG. 7 to the opened position shown in FIG. 6 relative to the front leg frame 20, the elastic stress of the elastic element 65 pushes the engaging section 620 of the engaging member 62 along direction F1, from the sliding slot 611 of the folding body 61 to the slot 641 of the spindle 64, so as to restrain the frame body 40 in the opened position. As shown in FIG. 4, FIG. 5, and FIG. 7, a long slot 642 is configured on a lateral side of the spindle 64. When the front leg frame 20 is pivoted relative to the rear leg frame 30, a limiting element 613 passing through a hole 616 of the second arm 615 and the long slot 642 of the spindle 64 of the folding body 61 moves in the long slot 642. In this embodiment, the limiting element 613 can be a rivet disposed on the folding body 61. Please refer to FIG. 8. FIG. 8 is a diagram of the pivoting section 31 of the rear leg frame 30 according to the first embodiment of the present invention. The pivoting section 31 of the rear leg frame 30 includes a first holder 311 and a second holder 312. When the frame body 40 is in the opened position shown in FIG. 4, the first holder 311 abuts on the limiting element 613 for preventing over-opening between the front leg frame 20 and the rear leg frame 30 caused by overloading of the seat 10. When the frame body 40 is in the folding position shown in FIG. 6, the second holder 312 abuts on the limiting element 613 for preventing over-rotation of the rear leg frame 30. The slot 641 of the spindle 64 can be hid by the folding body 61 so as to prevent an accident. Please refer to FIG. 9 and FIG. 10. FIG. 9 is a diagram of a folding device 70 according to a second embodiment of the present invention. FIG. 10 is an exploded diagram of elements of the folding device 70 according to the second embodiment of the present invention. As shown in FIG. 9, when the folding device 70 is in the locked position, the rear leg frame 30 can not be pivoted relative to the front leg frame 20 so that the frame body 40 can be restrained in the opened position. The folding device 70 includes a folding body 71, an engaging member 72, a driving member 73, a spindle 74, and an elastic element 75. The difference between the folding device 70 of the second embodiment and the folding device 60 of the first embodiment is the engaging member 72 and the driving member 73. The engaging member 72 includes an engaging section 720 and an inclined slot 721 located on an end opposite to the engaging section 720. The driving member 73 includes an axle 731 configured on a top end of the driving member 73 and a triangular pressing portion 732 in this embodiment. The axle 731 passes through the inclined slot 721 and engages with the inner slot of the folding body 71 and the sliding slot 760 of a cover 76 with its two ends so that the axle 731 can be movably configured on the folding body 71. The axle 731 can be moved in the inclined slot 721. When the driving member 73 is moved along directions N1 or N2, the axle 731 can be moved in the inclined slot 721 for driving the engaging member 72 to move along directions F1 or F2 in the sliding slot 711. In this embodiment, direction F1-F2 and direction N1-N2 are not parallel but with an angle. Please refer to FIG. 11 and FIG. 12. FIG. 11 is a diagram of the folding device 70 in the unlocked position according to the second embodiment of the present invention. FIG. 12 is a diagram of the rear leg frame 30 pivoted to the folding position relative to the front leg frame 20 according to the second embodiment of the present invention. In order to fold the frame body 40 to a smaller size, the driving member 73 is pressed to move to the folding body 71 along direction N1. At this time, the axle 731 of the driving member 73 can be moved in the inclined slot 721 so as to drive the engaging member 72 moving in the sliding slot 711 along direction F2, retracting the engaging section 720 of the engaging member 72 out of a slot 741 of the spindle 74, and retracting the whole engaging member 72 out of the sliding slot 711 of the folding body 71. Then, the engaging member 72 is in the unlocked position shown in FIG. 11, and the spindle 74 and the rear leg frame 30 can be pivoted to the folding position shown in FIG. 12 relative to the folding body 71 (and the front leg frame 20) so that the frame body 40 can be folded. In addition, other working mechanism of the folding device 70 according to the second embodiment is substantially the same as the folding device 60 according to the first embodiment. The pivoting section 31 of the rear leg frame 30 also includes a first holder 311 and a second holder 312 so as to abut on the limiting element 613 when the frame body 40 is in the opened position and in the folding position, and detailed description is omitted herein for simplicity. Please refer to FIG. 13 and FIG. 14. FIG. 13 is a diagram of a folding device 80 according to a third embodiment of the present invention. FIG. 14 is an exploded diagram of elements of the folding device 80 according to the third embodiment of the present invention. As shown in FIG. 13, when the folding device 80 is in the locked position, the rear leg frame 30 can not be pivoted relative to the front leg frame 20 so that the frame body 40 can be restrained in the opened position. The folding device 80 includes a folding body 81, an engaging member 82, a driving member 83, a spindle 84, and an elastic element 85. As shown in FIG. 13, the folding body 81 is mounted on an end of the front leg frame 20, and the spindle 84 is not only connected to the pivoting section 31 of the rear leg frame 30 but also pivotally connected to a second arm 810 of the folding body 81. Therefore, the spindle 84 and the rear leg frame 30 can be pivoted relative to the folding body 81 (and the front leg frame 20 where the folding body 81 is located). The engaging member 82 connects to the spindle 84 slidably and extends out of the spindle 84 and the pivoting section 31 of the rear leg frame 30 movably. The folding body 81 includes a slot 811. In this embodiment, an end of the engaging member 82 includes an engaging section 820 engaged with the slot 811 that can be moved between the locked position shown in FIG. 13 and the unlocked position shown in FIG. 15 along directions F1 or F2. The engaging section 820 includes a second inclined surface 821. The elastic element 85 can be a spring. In this embodiment, the elastic element 85 is configured between the pivoting section 31 of the rear leg frame 30 and the engaging member 82. When the engaging member 82 moves along direction F1, the elastic element 85 can be compressed and bears elastic stress. The driving member 83 can be a button. In this embodiment, the driving member 83 pivotally connected to the second arm 810 of the folding body 81 includes a first inclined surface 832 on an end opposite to the pivot so as to correspond to the second inclined surface 821 of the engaging member 82. The driving member 83 can be configured on the folding body 81 in a manner of pivoting along directions N1 or N2 relative to the folding body 81. As shown in FIG. 13, when the engaging member 82 of the folding device 80 is in the locked position, the engaging section 820 of the engaging member 82 extends in the slot 811 of the folding body 81. At this time, the engaging member 82 abuts on a lateral side of the slot 811, and the first inclined surface 832 of the driving member 83 abuts on the second inclined surface 821 of the engaging section 820 of the engaging member 82. Therefore, the spindle 84 and the rear leg frame 30 can not be pivoted relative to the folding body 81 and the front leg frame 20 so that the frame body 40 can be restrained in the opened position. Please refer to FIG. 15 and FIG. 16. FIG. 15 is a diagram of the folding device 80 in the unlocked position according to the third embodiment of the present invention. FIG. 16 is a diagram of the rear leg frame 30 pivoted to the folding position relative to the front leg frame 20 according to the third embodiment of the present invention. In order to fold the frame body 40 to a smaller size, the folding device 80 is unlocked by pressing the driving member 83 to rotate to the folding body 81 correspondingly along direction N1. At this time, the first inclined surface 832 of the driving member 83 has interaction with the second inclined surface 821 of the engaging member 82, and moves the engaging member 82 sliding along direction F1 so as to retract the engaging member 82 out of the slot 811 of the folding body 81. When the engaging member 82 is in the unlocked position shown in FIG. 15, the spindle 84 and the rear leg frame 30 can be pivoted to the folding position shown in FIG. 16 relative to the folding body 81 (and the front leg frame 20) so that the frame body 40 can be folded. When the rear leg frame 30 is pivoted from the folding position shown in FIG. 16 to the opened position shown in FIG. 15 relative to the front leg frame 20, the elastic element 85 connected between the engaging member 82 and the rear leg frame 30 is compressed, and the elastic stress of the elastics element 85 pushed the engaging member 82 to extend in the slot 811 of the folding body 81 so as to restrain the frame body 40 in the opened position again. The high chair configures the folding device at the pivot between the rear leg frame and the front leg frame so that operation from a user is easy by pressing the driving member. When the driving member is pressed, the driving member moves the engaging member to the unlocked position relative to the folding body, so that the rear leg frame disengages from and pivots on the front leg frame. The high chair can then be folded easily for the user, and the structure of the present invention is simpler than the prior art. Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims. 1. A high chair comprising: a seat; a frame body for supporting the seat and capable of moving between an opened position and a folding position, the frame body comprising a front leg frame and a rear leg frame pivotally connected to each other; and a folding device comprising: a folding body mounted on the front leg frame and pivotally connected to a pivoting section of the rear leg frame; an engaging member movably configured on one of the folding body and the pivoting section of the rear leg frame and engaged with the other one of the folding body and the pivoting section of the rear leg frame so as to restrain the frame body in the opened position; and a driving member movably configured on the folding body, for disengaging the engaging member from the other one of the folding body and the pivoting section of the rear leg frame such that the frame body is capable of moving to the folding position. 2. The high chair of claim 1, wherein the folding device further comprises a spindle mounted on the pivoting section of the rear leg frame and pivotally connected to the folding body. 3. The high chair of claim 2, wherein the folding body comprises a first arm and a second arm connected to the first arm with an angle, the first arm is mounted on the front leg frame, and the spindle is pivotally connected to the second arm of the folding body. 4. The high chair of claim 2, wherein the front leg frame comprises a lower front leg and an upper front leg slidably mounted on the lower front leg, the seat is installed on the upper front leg, and the rear leg frame is pivotally connected to a top end of the lower front leg. 5. The high chair of claim 2, wherein the spindle comprises a slot, and the engaging member is movably configured on the folding body and engaged with the slot so as to restrain the rear leg frame in the opened position. 6. The high chair of claim 1, wherein the folding body comprises a limiting element and the pivoting section of the rear leg frame comprises a first holder for abutting the limiting element when the rear leg frame is in the opened position. 7. The high chair of claim 1, wherein the folding body comprises a limiting element and the pivoting section of the rear leg frame comprises a second holder for abutting the limiting element when the rear leg frame is in the folding position. 8. The high chair of claim 2, wherein the spindle comprises a long slot, the folding body comprises a limiting element extending and movable in the long slot, and the pivoting section of the rear leg frame comprises a first holder and a second holder, the first holder abutting the limiting element when the rear leg frame is in the opened position and the second holder abutting the limiting element when the rear leg frame is in the folding position. 9. The high chair of claim 1, wherein the folding device further comprises an elastic element connected between the engaging member and one of the folding body and the pivoting section of the rear leg frame. 10. The high chair of claim 9, wherein the elastic element is a spring. 11. The high chair of claim 1, wherein the driving member is a button moveable along a first direction relative to the folding body so as to move the engaging member. 12. The high chair of claim 11, wherein the first direction is perpendicular to a moving direction of the engaging member. 13. The high chair of claim 11, wherein the first direction forms an angle to the moving direction of the engaging member. 14. The high chair of claim 1, wherein the engaging member comprises an inclined slot and the driving member comprises an axle extending and movable in the inclined slot. 15. The high chair of claim 1, wherein the driving member comprises a first inclined surface and the engaging member comprises a second inclined surface, the first inclined surface of the driving member abutting the second inclined surface for moving the engaging member when the driving member moves relative to the folding body. 16. The high chair of claim 15, wherein the driving member is configured slidably on the folding body. 17. The high chair of claim 15, wherein the driving member is configured rotatably on the folding body. 18. The high chair of claim 1, wherein the folding body comprises a slot, the engaging member is movably configured on the pivoting section of the rear leg frame and engaged with the slot so as to restrain the rear leg frame in the opened position. 19. A high chair comprising: a seat; a frame body for loading the seat and comprising a front leg frame and a rear leg frame pivotally connected to a middle of the front leg frame; a folding body mounted on the middle of the front leg frame for pivotally connecting the rear leg frame and the front leg frame; and an engaging member movably configured on one of the folding body and the rear leg frame and moved between a locked position and an unlocked position so as to engage and disengage with the other one of the folding body and the rear leg frame. 20. The high chair of claim 19, wherein the high chair further comprises a driving member movably configured on the folding body for disengaging the engaging member from the locked position to the unlocked position. 21. The high chair of claim 19, wherein the rear leg frame comprises a spindle pivotally connected to the folding body. 22. The high chair of claim 21, wherein the spindle comprises a slot and the engaging member movably configured on the folding body comprises an engaged portion, the engaged portion of the engaging member is engaged with the slot when the engaging member is in the locked position. 23. The high chair of claim 19, wherein the high chair comprises an elastic element for providing an elasticity so as to move the engaging member to the locked position. 24. The high chair of claim 19, wherein the front leg frame comprises a lower front leg and an upper front leg slidably mounted on the lower front leg, the seat is installed on the upper front leg, and the folding body is on a top end of the lower front leg.

2009-04-02

en

2009-10-08

US-201816765691-A

Methods of making cordierite ceramic bodies using chlorite raw material ABSTRACT A method of making a porous cordierite ceramic article using chlorite raw material is described herein. The method includes mixing materials to form a cordierite-forming mixture. The cordierite-forming mixture includes a chlorite raw material in an amount of about 5% to about 60% by weight and a platy aluminum silicate raw material in an amount of 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture. The cordierite-forming mixture is then formed into a green body and fired to form the porous cordierite ceramic article. In some cases, the porous cordierite ceramic article exhibits a low coefficient of thermal expansion (CTE), which provides the article with high thermal shock resistance. CROSS-REFERENCE TO RELATED APPLICATIONS This application claims the benefit of priority under 35 U.S.C. § 119 of U.S. Provisional Application No. 62/592,997, filed Nov. 30, 2017, the content of which is incorporated herein by reference in its entirety. FIELD The following description relates generally to making cordierite bodies and, more particularly, to making cordierite honeycomb bodies for use in engine exhaust treatment applications. BACKGROUND Cordierite honeycomb bodies are used in the motor vehicle industry in engine exhaust treatment applications such as filter and catalytic converter applications. During use in these applications, the cordierite honeycomb bodies will often experience environments with significant temperature gradients. For example, when a vehicle engine starts, the cordierite body experiences a significant temperature gradient between the ambient environment and the hot exhaust from the engine. SUMMARY Illustrative embodiments of the present disclosure are directed to a method of making a porous ceramic article comprising cordierite. The method comprises: mixing a plurality of materials to form a cordierite-forming mixture, wherein the cordierite-forming mixture comprises: (i) a chlorite raw material in an amount of about 5% to about 60% by weight of a total inorganic content of the cordierite-forming mixture, (ii) a silica source material, and (iii) an aluminum-containing source material, wherein the aluminum-containing source material comprises a platy aluminum silicate raw material in an amount of 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture; forming the cordierite-forming mixture into a green body; and firing the green body to form the porous ceramic article comprising cordierite. In some embodiments, the cordierite-forming mixture comprises the chlorite raw material in an amount of about 5% to about 45% by weight of a total inorganic content of the cordierite-forming mixture. In some embodiments, the chlorite raw material comprises a clinochlore. In some embodiments, the aluminum-containing source material comprises an alumina source material. In some embodiments, the aluminum-containing source material comprises the platy aluminum silicate raw material in an amount of 0% to about 20% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of the platy aluminum silicate raw materials. In some embodiments, the platy aluminum silicate raw material comprises at least one of pyrophyllite, kaolin clay, and ball clay. In some embodiments, the aluminum-containing source material comprises an Al2SiO5 raw material in an amount of 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the aluminum-containing source material comprises the Al2SiO5 raw material in an amount of 0% to about 40% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of the Al2SiO5 raw material. In some embodiments, the aluminum-containing source material comprises a mullite raw material in an amount of 0% to about 35% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the aluminum-containing source material comprises the mullite raw material in an amount of 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of the mullite raw material. In some embodiments, the cordierite-forming mixture comprises Al2SiO5 raw material and mullite raw material together in an amount of 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the aluminum-containing source material comprises: (a) an alumina source material in an amount of 0% to about 40% by weight of the total inorganic content of the cordierite-forming mixture; (b) an Al2SiO5 raw material in an amount of 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture; and (c) a mullite raw material in an amount of 0% to about 35% by weight of the total inorganic content of the cordierite-forming mixture, wherein the cordierite-forming mixture satisfies the following relationship: W M(0.477−0.0095D 50,M)+W S(0.469−0.019D 50,S)+W P(0.721−0.075D 50,P)+0.055(W A)(D 50,M)≤13, wherein WM is a percentage by weight of mullite raw material, WS is a percentage by weight of Al2SiO5 raw material, WP is a percentage by weight of the platy aluminum silicate raw material, and WA is a percentage by weight of the alumina source material, D50,M is a median particle diameter of the mullite raw material in microns, D50,S is a median particle diameter of the Al2SiO5 raw material in microns, D50,P is a median particle diameter of the platy aluminum silicate raw material in microns, and D50,A is a median particle diameter of the alumina source material in microns. In some embodiments, WM(0.477−0.0095D50,M)+WS(0.469−0.019D50,S)+WP(0.721−0.075D50,P)+0.055(WA)(D50,M)≤12.6 In some embodiments, WM(0.477−0.0095D50,M)+WS(0.469−0.019D50,S)+WP(0.721−0.075D50,P)+0.055(WA)(D50,M)≤12. In some embodiments, the cordierite-forming mixture comprises talc in an amount of about 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of talc. In some embodiments, the porous ceramic article comprises a coefficient of thermal expansion of less than or equal to about 14×10−7° C.−1 from 25 to 800° C. In some embodiments. In some embodiments, the porous ceramic article comprises a coefficient of thermal expansion of less than or equal to about 12×10−7° C.−1 from 25 to 800° C. In some embodiments, the porous ceramic article comprises a porosity of at least about 35%. In some embodiments, the porous ceramic article comprises cordierite in an amount greater than about 85% by weight of a total of all crystalline phases within the porous ceramic article. In some embodiments, the porous ceramic article comprises a sum of spinel, sapphirine, mullite, and corundum in an amount of 0% to about 10% by weight of a total of all crystalline phases within the porous ceramic article. In some embodiments, the porous ceramic article comprises a sum of spinel, sapphirine, mullite, and corundum in an amount of 0% to about 2% by weight of a total of all crystalline phases within the porous ceramic article. In some embodiments, the porous ceramic article comprises cristobalite in an amount of 0% to about 5% by weight of a total of all crystalline phases within the porous ceramic article. In some embodiments, the porous ceramic article is substantially free of cristobalite. In some embodiments, the porous ceramic article comprises a composition that satisfies the following relationships: (wt % MgO+wt % Al2O3+wt % SiO2)≥90, 10≤100[wt % MgO/(wt % MgO+wt % Al2O3+wt % SiO2)]≤16, 31≤100[wt % Al2O3/(wt % MgO+wt % Al2O3+wt % SiO2)]≤40, and 47≤100[wt % SiO2/(wt % MgO+wt % Al2O3+wt % SiO2)]≤56. In some embodiments, the composition of the porous ceramic article further satisfies the following relationship: A+AE+RE<0.5, where A is a sum of weight percentages of alkali metal oxides, AE is a sum of weight percentages of alkaline earth metal oxides excluding MgO, and RE is a sum of weight percentages of rare earth metal oxides. In some embodiments, forming the cordierite-forming mixture to form the green body comprises extruding the cordierite-forming mixture to form a green body that comprises a network of walls that extend in an axial direction about a longitudinal axis from an inlet end to an outlet end of the green body. In some embodiments, the porous ceramic article comprises an E800° C./E25° C. ratio of at least about 1.00. In some embodiments, the porous ceramic article comprises an E25° C./E°25° C. ratio of less than or equal to about 0.92. Illustrative embodiments are directed to another method of making a porous ceramic article comprising cordierite. The method comprises: mixing a plurality of materials to form a cordierite-forming mixture, wherein the cordierite-forming mixture comprises: (i) a chlorite raw material in an amount of about 5% to about 60% by weight of a total inorganic content of the cordierite-forming mixture, (ii) a silica source material, (iii) an alumina source material in an amount of 0% to about 40% by weight of the total inorganic content of the cordierite-forming mixture; (iv) a platy aluminum silicate raw material in an amount of 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture; (v) an Al2SiO5 raw material in an amount of 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture; (vi) a mullite raw material in an amount of 0% to about 35% by weight of the total inorganic content of the cordierite-forming mixture, wherein the cordierite-forming mixture satisfies the following relationship: W M(0.477−0.0095D 50,M)+W S(0.469−0.019D 50,S)+W P(0.721−0.075D 50,P)+0.055(W A)(D 50,M)≤13, wherein WM is a percentage by weight of mullite raw material, WS is a percentage by weight of Al2SiO5 raw material, WP is a percentage by weight of the platy aluminum silicate raw material, and WA is a percentage by weight of the alumina source material, D50,M is a median particle diameter of the mullite raw material in microns, D50,S is a median particle diameter of the Al2SiO5 raw material in microns, D50,P is a median particle diameter of the platy aluminum silicate raw material in microns, and D50,A is a median particle diameter of the alumina source material in microns; forming the cordierite-forming mixture into a green body; and firing the green body to form the porous ceramic article comprising cordierite. In some embodiments, WM(0.477−0.0095D50,M)+WS(0.469−0.019D50,S)+WP(0.721−0.075D50,P)+0.055(WA)(D50,M)≤12.6. In some embodiments, WM(0.477−0.0095D50,M)+WS(0.469−0.019D50,S)+WP(0.721−0.075D50,P)+0.055(WA)(D50,M)≤12. In some embodiments, the porous ceramic article comprises a coefficient of thermal expansion of less than or equal to about 14×10−7° C.−1 from 25 to 800° C. Illustrative embodiments of the present disclosure are also directed to a cordierite-forming mixture comprising: (i) chlorite raw material in an amount of about 5% to about 60% by weight of a total inorganic content of the cordierite-forming mixture; (ii) an alumina source material; (iii) a silica source material; (iv) a platy aluminum silicate raw material in an amount of about 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture; (v) an Al2SiO5 raw material in an amount of 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture; and (vi) a mullite raw material in an amount of 0% to about 35% by weight of the total inorganic content of the cordierite-forming mixture; wherein the cordierite-forming mixture satisfies the following relationship: WM(0.477−0.0095D50,M)+WS(0.469−0.019D50,S)+WP(0.721−0.075D50,P)+0.055(WA)(D50,M)≤13, wherein WM is a percentage by weight of mullite raw material, WS is a percentage by weight of Al2SiO5 raw material, WP is a percentage by weight of the platy aluminum silicate raw material, and WA is a percentage by weight of the alumina source material, D50,M is a median particle diameter of the mullite raw material in microns, D50,S is a median particle diameter of the Al2SiO5 raw material in microns, D50,P is a median particle diameter of the platy aluminum silicate raw material in microns, and D50,A is a median particle diameter of the alumina source material in microns. In some embodiments, the cordierite-forming mixture comprises the chlorite raw material in an amount of about 5% to about 45% by weight of a total inorganic content of the cordierite-forming mixture. BRIEF DESCRIPTION OF THE DRAWINGS The above and other features, aspects and advantages of the present disclosure are better understood when the following detailed description of the disclosure is read with reference to the accompanying drawings, in which: FIG. 1 schematically depicts a method of making a porous cordierite ceramic article in accordance with one embodiment of the present disclosure; FIG. 2 shows a plot of CTE versus C parameter for Examples 1-9 in accordance with some embodiments of the present disclosure; FIG. 3 is an isometric view of a porous ceramic article in accordance with one embodiment of the present disclosure; FIG. 4 is an isometric view of a porous ceramic article in accordance with another embodiment of the present disclosure; FIG. 5 shows a plot of Young's elastic modulus versus temperature for Example 5 in accordance with one embodiment of the present disclosure; and FIG. 6 shows a plot of Young's elastic modulus versus temperature for Example 6 in accordance with one embodiment of the present disclosure. DETAILED DESCRIPTION Illustrative embodiments of the present disclosure are directed to a method of making a porous cordierite ceramic article using chlorite raw material. The method comprises mixing a plurality of materials to form a cordierite-forming mixture. The cordierite-forming mixture comprises, among other things, a chlorite raw material in an amount of about 5% to about 60% by weight and a platy aluminum silicate raw material in an amount of 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture. The cordierite-forming mixture is then formed into a green body and fired to form the porous ceramic article comprising cordierite. In various embodiments, the porous cordierite ceramic article exhibits a low coefficient of thermal expansion (CTE), which provides the article with high thermal shock resistance. Details of various embodiments are discussed below. Method of Making a Porous Ceramic Article Comprising Cordierite FIG. 1 schematically depicts a method of making a porous ceramic article comprising cordierite, such as the ones shown in FIGS. 3 and 4, using a chlorite raw material. At process 102, the method begins by mixing materials to form a cordierite-forming mixture. The raw materials comprise (i) a chlorite raw material, (ii) a silica source material, and (iii) an aluminum-containing source material. A chlorite raw material is a magnesium-containing compound from the chlorite mineral group. An example of a chlorite raw material is a magnesium-containing chlorite material, such as a clinochlore mineral. In some embodiments, the chlorite minerals disclosed herein have a generalized chemical composition of (X,Y)4-6(Si,Al)4O10(OH,O)8, where “X” and “Y” represent ions, such as: Fe+2, Fe+3, Mg+2, Mn+2, Ni+2, Zn+2, Al+3, Li+1, or Ti+4. One approximate composition for chlorite, as the mineral clinochlore, is Mg5Si3Al2O10(OH)8. In some embodiments, the chlorite raw material is predominantly a clinochlore mineral (e.g., at least about 70%, 80%, or 90% by weight of the chlorite raw material is a clinochlore mineral). The cordierite-forming mixture preferably comprises a chlorite raw material in an amount of about 5% to about 60% by weight of total inorganic content of the cordierite-forming mixture. In further embodiments, the cordierite-forming mixture comprises the chlorite raw material an amount of about 5% to about 45% by weight, in an amount of about 10% to about 45% by weight, in an amount of about 20% to about 45% by weight, in an amount of about 30% to about 45% by weight, or in an amount of about 35% to about 40% by weight of total inorganic content of the cordierite-forming mixture. Also, in various embodiments, the cordierite-forming mixture preferably comprises the chlorite raw material in an amount of at least about 5% by weight of a total inorganic content of the cordierite-forming mixture, such as at least about 10% by weight, at least about 15% by weight, at least about 20% by weight, at least about 30% by weight, or at least about 35% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the chlorite raw material comprises Fe2O3 in an amount of not more than about 2% by weight of the chlorite raw material. In further embodiments, the chlorite raw material comprises Fe2O3 in an amount of not more than about 1.5% by weight, in an amount of not more than about 1% by weight, in an amount of not more than about 0.5% by weight, or in an amount of not more than about 0.3% by weight of the chlorite raw material. In some embodiments, the chlorite raw material is substantially free of Fe2O3. As used herein, the phrase “substantially free” with respect to a component of a cordierite-forming mixture means that the component is not actively or intentionally added to the cordierite-forming mixture during initial mixing, but may be present as an impurity in an amount less than about 0.01% by weight of the cordierite-forming mixture. As used herein, the phrase “substantially free” with respect to a component or phase of a ceramic article means that the component or phase may be present as an impurity in an amount less than about 0.01% by weight of the ceramic article. In some embodiments, the chlorite raw material comprises CaO in an amount of not more than about 1% by weight of the chlorite raw material. In further embodiments, the chlorite raw material comprises CaO in an amount of not more than about 0.5% by weight, in an amount of not more than about 0.25% by weight, or in an amount of not more than about 0.15% by weight of the chlorite raw material. In some embodiments, the chlorite raw material is substantially free of CaO. In some embodiments, the chlorite raw material comprises a sum of Na2O and K2O in an amount of not more than about 0.5% by weight of the chlorite raw material. In further embodiments, the chlorite raw material comprises a sum of Na2O and K2O in an amount of not more than about 0.25% by weight, in an amount of not more than about 0.10% by weight, or in an amount of not more than about 0.05% by weight of the chlorite raw material. In some embodiments, the chlorite raw material is substantially free of Na2O and/or K2O. The cordierite-forming mixture preferably comprises a silica source material. A silica source material is silica itself and/or any compound that yields at least 85% by weight (e.g., at least 98% by weight) of a free silica phase when heated. Silica source material comprises, but is not limited to, (i) non-crystalline silica, such as fused silica and sol-gel silica; (ii) crystalline silica, such as zeolite, quartz, and cristobalite; (iii) silicone resin; and (iv) diatomaceous silica. Silica source material also comprises one or more compounds that form free silica when heated, such as, for example, silicic acid and silicone organometallic compounds. In some embodiments, the median particle diameter (D50) of the silica source material is less than about 25.0 microns, and in further embodiments, may be less than about 20.0 microns, less than about 15.0 microns, less than about 10.0 microns, or less than about 5.0 microns. The median particle diameter (D50) is the particle diameter value at the 50th percentile of the cumulative particle size distribution as determined by a laser diffraction particle size analyzer. The median particle diameter (D50) is the particle diameter at which 50% by volume of the particles are of a finer diameter and 50% by volume of the particles are of a coarser diameter. The cordierite-forming mixture preferably comprises an aluminum-containing source material. The aluminum-containing source material may comprise an alumina source material and/or an aluminosilicate raw material. An alumina source material is alumina itself and/or any compound that yields at least 98% by weight of a free alumina phase when heated. Alumina source material comprises, but is not limited to, corundum, aluminum hydroxide (e.g., gibbsite, bayerite, and aluminum trihydrate), and aluminum oxide hydroxide (e.g., boehmite and diaspore). In some embodiments, the cordierite-forming mixture comprises the alumina source material in an amount of not more than about 45% by weight of the total inorganic content of the cordierite-forming mixture, such as in an amount of not more than about 40%, in an amount of not more than about 30% by weight, in an amount of not more than about 15% by weight, or in an amount of not more than about 5% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of the alumina source material. In some embodiments, the cordierite-forming mixture comprises the alumina source material in an amount of at least 5% by weight of the total inorganic content of the cordierite-forming mixture, such as at least 10% by weight, at least 15% by weight, or at least 20% by weight of the total inorganic content of the cordierite-forming mixture. An alumina source material of a fine particle size is beneficial to reducing CTE of the porous ceramic article, as compared to a coarser alumina source material, because finer alumina source material creates a ceramic microstructure that promotes a greater amount of microcracking and also facilitates reaction of raw materials to produce a higher percentage of cordierite in the porous ceramic article. Also, the use of a finer alumina source material provides for a porous ceramic article with a low CTE, even when the cordierite-forming mixture comprises a greater amount of aluminosilicate raw material and/or an aluminosilicate raw material of a slightly finer particle size, as represented in the relationship of Equation 2 below. To this end, in some embodiments, the median particle diameter (D50) of the alumina source material is less than about 10.0 microns, and in further embodiments, is less than about 7.0 microns, less than about 5.0 microns, less than about 3.0 microns, or less than about 1.0 microns. The aluminum-containing source material used in the cordierite-forming mixture may comprise an aluminosilicate raw material. An aluminosilicate raw material is a compound that (i) comprises 20 to 75% by weight of SiO2 and 25 to 80% by weight Al2O3 (after excluding fugitive components, such as H2O, CO2, and SO2) and (ii) comprises at least 90% by weight of SiO2 and Al2O3 (after excluding fugitive components), and preferably comprises at least 95%, 97%, 98%, or 99% by weight of SiO2 and Al2O3. Aluminosilicate raw material comprises (i) platy aluminum silicate raw materials, (ii) Al2SiO5 raw materials, and/or (iii) mullite raw materials. In some embodiments, the aluminum-containing source material used in the cordierite-forming mixture may comprise a platy aluminum silicate raw material. As used herein, the term “platy aluminum silicate raw material” refers to any material that comprises aluminum silicate and that has a platy particle morphology. Examples of platy aluminum silicate raw materials comprise pyrophyllite and clays, such as kaolin clay and ball clay. The platy aluminum silicate raw material can be used within a cordierite-forming mixture in hydrous form, calcined form, or in combinations thereof. The cordierite-forming mixture optionally comprises the platy aluminum silicate raw material in an amount of not more than about 30% by weight of the total inorganic content of the cordierite-forming mixture. In further embodiments, the cordierite-forming mixture comprises the platy aluminum silicate raw material in an amount of not more than about 20% by weight, in an amount of not more than about 10% by weight, in an amount of not more than about 5% by weight, or in an amount of not more than about 2% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of the platy aluminum silicate raw material. The cordierite-forming mixture may comprise other aluminosilicate raw materials. For example, the cordierite-forming mixture may comprise Al2SiO5 raw material and/or mullite raw material. An Al2SiO5 raw material comprises one or more of the minerals kyanite, andalusite, sillimanite, and their calcined products. In some embodiments, the cordierite-forming mixture comprises an Al2SiO5 raw material in an amount of not more than about 45% by weight of the total inorganic content of the cordierite-forming mixture, such as in an amount of not more than about 40% by weight, in an amount of not more than about 30% by weight, in an amount of not more than about 15% by weight, or in an amount of not more than about 5% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of the Al2SiO5 raw material. A mullite raw material is (i) Al6Si2O13 and its crystalline solutions, such as, but not restricted to, those mullite compositions lying between the limits of about Al6Si2O13 and about Al8Si2O18, and/or (ii) “fused mullite” powders that may comprise mixtures of a mullite phase with one or more of (a) corundum, (b) cristobalite, and (c) a silica or aluminosilicate glass phase. In some embodiments, the cordierite-forming mixture comprises a mullite raw material in an amount of not more than about 35% by weight of the total inorganic content of the cordierite-forming mixture, such as in an amount of not more than about 30%, in an amount of not more than about 15% by weight, in an amount of not more than about 10% by weight, or in an amount of not more than about 5% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of the mullite raw material. In some embodiments, the cordierite-forming mixture comprises the Al2SiO5 raw material and the mullite raw material together in an amount of not more than about 45% by weight of the total inorganic content of the cordierite-forming mixture. In further embodiments, the cordierite-forming mixture comprises the Al2SiO5 raw material and the mullite raw material together in an amount of not more than about 35% by weight, not more than about 30% by weight, not more than about 15% by weight, not more than about 10% by weight, or not more than about 5% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of Al2SiO5 raw material and/or mullite raw material. In some embodiments, the cordierite-forming mixture satisfies one or both of the following relationships: WM≤35, WS≥45, and WP≤30, and/or  Eq. 1 C=W M(0.477−0.0095D 50,M)+W S(0.469−0.019D 50,S)+W P(0.721−0.075D 60,P)+0.055(W A)(D 50,M)≤13,  Eq. 2 where WM is a percentage by weight of mullite raw material, WS is a percentage by weight of Al2SiO5 raw material, WP is a percentage by weight of the platy aluminum silicate raw material, and WA is a percentage by weight of the alumina source material, D50,M is a median particle diameter of the mullite raw material in microns, D50,S is a median particle diameter of the Al2SiO5 raw material in microns, D50,P is a median particle diameter of the platy aluminum silicate raw material in microns, and D50,A is a median particle diameter of the alumina source material in microns (all median particle diameters measured using a laser diffraction particle size analyzer). The percentages by weight of the raw materials are based upon a sum of all the inorganic content in the cordierite-forming mixture equal to 100%. In accordance with various embodiments, the value of the C parameter in Equation 2 is less than or equal to 13. In further embodiments, the value of the C parameter in Equation 2 is less than or equal to 12.6, less than or equal to 12, less than or equal to 11, less than or equal to 10, less than or equal to 8, or less than or equal to 4. A lower value for the C parameter is associated with lower values for the coefficient of thermal expansion of the porous ceramic article. FIG. 2 shows a plot of CTE versus the C parameter for Examples 1-9 in Tables 4 and 5. The plot shows that lower values for the C parameter are associated with lower values for the coefficient of thermal expansion in the porous ceramic article. In some embodiments, the cordierite-forming mixture may comprise more than one source of a mullite raw material, more than one source of an Al2SiO5 raw material, more than one source of a platy aluminum silicate raw material, and/or more than one source of an alumina source material. In such cases, the values of D50,M, D50,S, D50,P, and D50,A used in Equation 2 may represent a weighted average of the median particle diameters of the constituent raw materials comprising each respective raw material group, as shown below: D 50,M=(1/W M)Σ{(W M,i)(D 50,M,i)}  Eq. 3 D50,S=(1/W S)Σ{(W S,i)(D 50,S,i)}  Eq. 4 D 50,P=(1/W P)Σ{(W P,i)(D 50,P,i)}  Eq. 5 D50,A=(1/WA)Σ{(W A,i)(D 50,A,i)}  Eq. 6 where the subscript “i” denotes each individual raw material within the respective group. For example, if a cordierite-forming mixture contains 10.0% by weight of an alumina having a median particle diameter of 6.6 μm and 15.0% by weight of an alumina having a median particle diameter of 0.5 μm, the value of D50,A is equal to ( 1/25){10.0(6.6)+15.0(0.5)}=2.94. In some embodiments, the total amount of aluminosilicate raw material in the cordierite-forming mixture is preferably less than about 25.0% by weight of the total inorganic content of the cordierite-forming mixture, such as less than about 20.0% by weight, less than about 15.0% by weight, or less than about 10.0% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of aluminosilicate materials. The total amount of aluminosilicate raw material is the sum of Al2SiO5 raw materials, mullite raw materials, platy aluminum silicate raw materials, and any other aluminosilicate raw materials. If present in the cordierite-forming mixture, an aluminosilicate powder of a coarse particle size yields a cordierite ceramic having a greater extent of microcracking and lower CTE than does a finer aluminosilicate powder. Equations 1 and 2 above advantageously use this dependence of CTE on the particle sizes, amounts, and mineral phases of the alumina and aluminosilicate raw materials to facilitate selection of raw materials that will produce ceramic articles with favorable characteristics. As explained above, a lower value for the C parameter in Equation 2 has been found to yield fired ceramic bodies with lower CTE. In some embodiments, if aluminosilicate raw materials are present in the cordierite-forming mixture, the median particle diameter (D50) of the aluminosilicate powders (as measured by a laser diffraction particle size analyzer) is at least about 4 microns, such as at least about 6 microns, at least about 8 microns, at least about 10 microns, and at least about 12 microns. In some embodiments, the cordierite-forming mixture may comprise other material powders. More specifically, the cordierite-forming mixture may comprise other sources of magnesium, such as talc. Talc may also be present in the cordierite-forming mixture as an impurity in the chlorite raw material and/or as a separate additional raw material powder. The cordierite-forming mixture may comprise talc in an amount of not more than about 45% by weight of the total inorganic content of the cordierite-forming mixture. In further embodiments, the cordierite-forming mixture may comprise the talc in an amount of not more than about 35% by weight, in an amount of not more than about 25% by weight, in an amount of not more than about 15% by weight, or in an amount of not more than about 5% by weight of the total inorganic content of the cordierite-forming mixture. In some embodiments, the cordierite-forming mixture is substantially free of talc. In some embodiments, the composition of the cordierite-forming mixture on a simple metal oxide basis in weight percent (excluding fugitive components such as H2O, CO2, and SO2) satisfies one or more of the following relationships: (wt % MgO+wt % Al2O3+wt % SiO2)≥90, 10≤100[wt % MgO/(wt % MgO+wt % Al2O3+wt % SiO2)]≤16, 31≤100[wt % Al2O3/(wt % MgO+wt % Al2O3+wt % SiO2)]≤40, and/or 47≤100[wt % SiO2/(wt % MgO+wt % Al2O3+wt % SiO2)]≤56. Ceramic articles produced from such cordierite-forming mixtures may also have the same composition on a simple metal oxide basis. In more specific embodiments, the composition of the cordierite-forming mixture on a simple metal oxide basis in weight percent (excluding fugitive components such as H2O, CO2, and SO2) satisfies one or more of the following relationships: (wt % MgO+wt % Al2O3+wt % SiO2)≥95, 12.5≤100[wt % MgO/(wt % MgO+wt % Al2O3+wt % SiO2)]≤15, 33≤100[wt % Al2O3/(wt % MgO+wt % Al2O3+wt % SiO2)]≤37, and 49≤100[wt % SiO2/(wt % MgO+wt % Al2O3+wt % SiO2)]≤53. Ceramic articles produced from such cordierite-forming mixtures may also have the same compositions on a simple metal oxide basis. In further embodiments, the composition of the cordierite-forming mixture on a simple metal oxide basis in weight percent (excluding fugitive components such as H2O, CO2, and SO2) satisfies one or more the following relationships: (wt % MgO+wt % Al2O3+wt % Si2)≥98, 13≤100[wt % MgO/(wt % MgO+wt % Al2O3+wt % SiO2)]≤14, 34≤100[wt % Al2O3/(wt % MgO+wt % Al2O3+wt % SiO2)]≤35, 50≤100[wt % SiO2/(wt % MgO+wt % Al2O3+wt % SiO2)]≤52, Ceramic articles produced from such cordierite-forming mixtures may also have the same compositions on a simple metal oxide basis. In various embodiments, the inorganic raw materials used in the cordierite-forming mixture are selected to be of a sufficiently high purity so as to produce a ceramic article that comprises not more than about 0.5% by weight of a sum of alkali element oxides, alkaline earth element oxides (excluding MgO), and rare earth element oxides based upon a sum of all metal oxide components (excluding fugitive components such as H2O, CO2, or SO2) in the ceramic article. A “rare earth element” comprises yttrium and lanthanide elements. In further embodiments, the raw materials are of a sufficiently high purity so as to provide a ceramic body comprising not more than about 0.4% by weight, not more than about 0.3% by weight, not more than about 0.2% by weight, or not more than about 0.1% by weight of a sum of alkali element oxides, alkaline earth element oxides (excluding MgO), and rare earth element oxides based upon a sum of all metal oxide components (excluding fugitive components such as H2O, CO2, or SO2) in the ceramic article. In addition to the inorganic content described above, the cordierite-forming mixture may also comprise other components. For example, the cordierite-forming mixture typically comprises a liquid vehicle, such as water or an organic solvent, and a binder, such as a cellulose ether binder (e.g., methylcellulose, hydroxypropyl methylcellulose, and/or methylcellulose derivatives). The cordierite-forming mixture also may comprise a pore former, such as carbon, graphite, starch, nut shell flour, and/or polymer pore formers. The cordierite-forming mixture may also comprise plasticizers and lubricants. The inorganic content and the other components of the cordierite-forming mixture are mixed together to form a wet cordierite-forming mixture. At process 104 of the method 100, the wet cordierite-forming mixture is formed into a green body. The wet cordierite-forming mixture can be extruded to form a green body that, for example, comprises a network of walls that extend in an axial direction about a longitudinal axis from an inlet end to an outlet end of the green body. The network of walls defines a plurality of cells. As formed mixture exits the extruder, the extrudate can be cut to form the green body. The green body is then dried, for example, by using a hot air and/or microwave energy. Various embodiments of the green body may comprise some or all of the compositions described above and may satisfy some or all of the compositional relationships described above, such as in Equations 1-6. At process 106, the green body is fired to form the porous ceramic article comprising cordierite. In some embodiments, the green body is fired to a maximum temperature of between 1360° C. and 1440° C., such as between 1380° C. and 1430° C. or between 1390° C. and 1420° C. The body may be held at the maximum temperature for a period of time of between 5 and 50 hours, such as between 10 and 40 hours or between 15 and 30 hours. The fired porous cordierite ceramic article may have the honeycomb form of the articles shown in FIGS. 3 and 4. Porous Ceramic Article Comprising Cordierite FIG. 3 shows an example of a porous cordierite ceramic article 310 that may be made using the method described herein. The ceramic article 310 may be suitable for use as a flow-through catalyst substrate. The ceramic honeycomb article 310 has a honeycomb structure that comprises a network of walls 314 that extend in an axial direction about a longitudinal axis from an inlet end 312 to an outlet end 313. The walls 314 define a plurality of cells 311 that form a honeycomb structure. The term “honeycomb” refers to a connected structure with a generally repeating pattern of longitudinally-extending cells formed of walls. The cells 311 are not plugged and allow fluid to flow from an inlet end 312 to an outlet end 313. The ceramic article 10 also comprises an outermost layer or external skin 315 formed about the honeycomb structure. The skin 315 may be formed as part of the ceramic article 310 during the extrusion process or the skin may be formed in later processing as an after-applied skin. In some embodiments, the wall thickness of each cell wall 314 can be, for example, between about 0.002 to about 0.010 inches (about 51 to about 254 μm). The cell density can be, for example, from about 300 to about 900 cells per square inch (cpsi). In one implementation, the cellular honeycomb structure comprises a plurality of parallel cells 311 of generally square cross section. Alternatively, other cross-sectional configurations may be used in the honeycomb structure as well, including rectangular cells, round cells, oblong cells, triangular cells, octagonal cells, hexagonal cells, or combinations thereof. FIG. 4 shows another example of a porous cordierite ceramic article 400. In this case, the ceramic article 400 may be suitable for use as a wall-flow exhaust gas particulate filter, such as a diesel particulate filter or a gasoline engine particulate filter. The ceramic article 400 comprises a body 401 made of intersecting porous ceramic walls 406 extending from the inlet end 402 to the outlet end 404. Some cells are designated as inlet cells 408, while other cells are designated as outlet cells 410. In the filter 400, some channels comprise plugs 412. Generally, the plugs are arranged at the ends of the channels and in a defined pattern, such as the checkerboard patterns shown in FIG. 4. The inlet channels 408 are plugged at the outlet end 404 and the outlet channels 410 are plugged at the inlet end 402. In some embodiments, all of the outermost peripheral cells are plugged (as shown) for additional strength. Other plugging patterns may be used. In some embodiments, some channels can be flow-through channels and some can be plugged providing a “partial filtration” design. In some embodiments, the wall thickness of each cell wall 14 for the filter can be, for example, from about 0.003 to about 0.030 inches (about 76 to about 762 μm). The cell density can be, for example, between about 100 and 400 cells per square inch (cpsi). In some embodiments, the porous cordierite ceramic article comprises a cordierite phase that comprises greater than about 85.0% by weight of a total of all crystalline phases within the porous cordierite ceramic article. The cordierite phase may comprise hexagonal and/or orthorhombic cordierite. In further embodiments, the porous cordierite ceramic article comprises a cordierite phase in an amount greater than about 90.0% by weight, greater than about 95.0% by weight, or greater than about 98.0% by weight of a total of all crystalline phases within the porous cordierite ceramic article. The fired porous ceramic article may comprise other phases. For example, the ceramic article may comprise spinel, sapphirine, mullite, and/or corundum. In some embodiments, a sum of spinel phase, sapphirine phase, mullite phase, and corundum phase in the porous cordierite ceramic article comprises no greater than about 10% by weight of a total of all crystalline phases within the porous cordierite ceramic article, such as no greater than about 8% by weight, no greater than about 6% by weight, no greater than about 4% by weight, or no greater than about 2% by weight of the total of all crystalline phases within the porous cordierite ceramic article. In yet further embodiments, the porous cordierite ceramic article may comprise cristobalite. The porous cordierite ceramic article may comprise cristobalite phase in an amount no greater than about 5.0% by weight of a total of all crystalline phases within the porous cordierite ceramic article, such as no greater than about 3.0% by weight, no greater than about 2.0% by weight, or no greater than about 1.0% by weight of the total of all crystalline phases within the porous cordierite ceramic article. In some embodiments, the porous cordierite ceramic is substantially free of cristobalite phase. In various embodiments, the porous ceramic article comprises a porosity in a range between about 25% and about 85%. In some embodiments, the porous ceramic article comprises a porosity of at least about 35%, such as at least about 45%, at least about 55%, at least about 60%, or at least about 65%. Values of percent porosity are determined by mercury porosimetry. In some embodiments, the method shown in FIG. 1 produces a porous cordierite ceramic body with a low CTE from 25° C. to 800° C. that is less than or equal to about 14×10−7° C.−1 along at least one direction of the ceramic article, such as less than or equal to about 12×10−7° C.−1, less than or equal to about 10×10−7° C.−1, less than or equal to about 9×10−7° C.−1, less than or equal to about 8×10−7° C.−1, less than or equal to about 6×10−7° C.−1, less than or equal to about 3×10−7° C.−1, or less than or equal to about 2×10−7° C.−1. The CTE that characterizes the fired porous cordierite ceramic articles prepared by the method described herein depends to an extent on microcracking within the articles. The extent of microcracking may be quantified by measurement of the Young's elastic modulus (E) of the ceramic from room temperature to 1200° C. and back to room temperature at, for example, 50° C. intervals. The elastic modulus is measured by a sonic resonance technique on a sample of a ceramic article. A solid or honeycomb rod or bar of circular or rectangular cross section can be used as the sample. Although the sample geometry will influence the absolute values of elastic modulus, the sample geometry should not influence the ratios of the elastic moduli described below (e.g., E800° /E25° C and E25° C./E°25° C.). The elastic modulus of a non-microcracked cordierite ceramic decreases slightly with increasing temperature due to the thermal vibration of the atomic bonds in the crystal structure. The rate of decrease, ΔF/ΔT, from 25° C. to about 1000° C. is equal to approximately (−7.5×10−5)(E°25° C.)°C−1, where E°25° C. is the elastic modulus of the non-microcracked specimen at 25° C. The value of E°25° C. depends upon the amount of porosity in the ceramic article, and also upon whether the article is of a cellular or solid geometry. The elastic modulus is sometimes observed to decrease with temperature at a greater rate upon approaching 1200° C. due to the softening of a grain-boundary phase that contains impurities in the ceramic article. Upon cooling back to room temperature, the elastic modulus versus temperature curve is observed to follow a path that is close to or equal to the path defined by the heating curve if the ceramic article is not initially microcracked at room temperature. FIG. 6 shows an example of an elastic modulus versus temperature curve with a cooling portion that follows a heating portion. By contrast, when the ceramic article is initially microcracked at room temperature, the microcracks gradually reclose during heating, causing a stiffening of the ceramic material and an increase in the elastic modulus with increasing temperature. This is especially evident between about 700° C. and 1100° C. By about 1100° C., the microcracks are closed and annealed, and the ceramic is in a non-microcracked state from about 1100 to 1200° C. during heating. Upon cooling from 1200° C., the microcracks do not immediately reopen, but remain closed at lower temperatures. During these initial stages of cooling, the ceramic article remains in a non-microcracked state, and the elastic modulus increases slightly with decreasing temperature. Eventually, the internal stresses within the ceramic article achieve a level at which the microcracks reopen with further cooling, and the elastic modulus continuously decreases to room temperature. Thus, the E versus temperature behavior of a microcracked ceramic material is manifested by a hysteresis, and the magnitude of the hysteresis is proportional to the amount of microcracking in the original ceramic article at room temperature. FIG. 5 shows an example of the hysteresis. The hysteresis may be quantified using two different ratios (e.g., E800° C./E25° C. and E25° C./E°25° C.). In accordance with one method for quantifying the amount of microcracking by the hysteresis in the E vs. T curve, the elastic modulus ratio E800° C./E25° C. is calculated from the measured value of E25° C. (the initial elastic modulus of the sample at 25° C.) and E800° C./E25° C. value of elastic modulus measured at 800° C. during heating). In some embodiments, the fired porous cordierite ceramic articles prepared by the method described herein have a E800° C./E25° C. ratio of at least about 1.00, such as at least about 1.02, at least about 1.04, at least about 1.06, at least about 1.08, at least about 1.10, or at least about 1.12. A higher value of E800° C./E25° C. indicates a greater extent of microcracking in the fired ceramic article at room temperature and the partial reclosing of these microcracks at 800° C. An additional or alternative method for quantifying the amount of microcracking by the hysteresis in the E vs. T curve is to determine the elastic modulus ratio, E25° C./E°25° C., where E°25° C. represents the estimated value of the elastic modulus of the ceramic in a non-microcracked state at room temperature. The value of E°25° C. is obtained by constructing a tangent line to the near-linear portion of the E vs. temperature curve measured during cooling after heating to 1200° C. This near-linear portion is typically observed to lie somewhere between about 900° C. and 400° C. The tangent is then extrapolated back to 25° C., and the value of the tangent line at 25° C. is E°25° C.. The exact position and the slope of the tangent line to the E vs. T cooling curve is constrained by the restriction that the tangent line must have a slope equal to that for a non-microcracked cordierite ceramic, which is (−7.5×10−5)(E°25° C.). The slope of the tangent, its point of interception with the elastic modulus cooling curve, and the value of E°25° C. are determined by an iterative method because the slope of the tangent is required to determine E°25° C. and the value of E°25° C. is required to determine the slope of the tangent. In some embodiments, the ceramic articles prepared by the method described herein preferably have a ratio E25° C./E°25° C. of not more than about 0.92, such as not more than about 0.90, not more than about 0.80, not more than about 0.75, not more than about 0.70, not more than about 0.65, and not more than about 0.60. Smaller values of E25° C./E°25° C. indicate greater amounts of microcracking in the actual ceramic at 25° C. because the microcracking lowers the value of E relative to its value for a non-microcracked ceramic of equivalent porosity and internal specimen geometry (solid or cellular). In some embodiments, when extrusion is used to form the green body, the resulting fired ceramic body preferably has an axial I-ratio (IA) of less than or equal to 0.55 and/or a transverse I-ratio (IT) of greater than or equal to 0.80. The I-ratio is defined as the ratio I(110)/[I(110)+I(002)] in which I(hkl) is a peak height of a hkl reflection measured by x-ray diffractometry. The axial I-ratio (IA) is the I-ratio as measured on an axial cross section of the honeycomb structure of the ceramic article (orthogonal to the direction of the channels). The transverse I-ratio (IT) is the I-ratio measured on a flat, as-fired surface of the channel walls after removal of the orthogonal channel walls projecting from the surface to be measured. Further details regarding measurement of the axial I-ratio (IA) and the transverse I-ratio (IT) can be found in U.S. Pat. No. 5,258,150, issued on Nov. 2, 1993, which is hereby incorporated herein by reference in its entirety. A lower axial I-ratio (IA) and a higher transverse I-ratio (IT) represent an increasing degree of preferred alignment of the cordierite crystals in the plane of the wall. In some embodiments, the axial I-ratio is not more than about 0.52, not more than about 0.50, not more than about 0.48, not more than about 0.46, not more than about 0.44, not more than about 0.42, or not more than about 0.40. In some embodiments, the transverse I-ratio is at least about 0.82, at least about 0.84, or at least about 0.86. Known methods directed to formation of cordierite ceramics using a chlorite raw material use large amounts of aluminosilicate clay in the raw material mixture (typically comprising 40 to 60% by weight of the batch). Ceramic articles made by these methods suffer from an undesirably high CTE (e.g., CTE values from 25 to 800° C. of at least 13×10−7° C.−1). In some embodiments, the methods described herein produce cordierite articles with low CTEs because the methods replace some or all of the aluminosilicate clay with an alumina source material and a silica source material, which, in various embodiments, reduces the CTE to a value of less than 12×10−7° C.−1. Also, known methods teach away from using an alumina source material (i) because the alumina source increases wear on forming dies used to shape batch from the raw material mixture and (ii) because the alumina source material needs to be milled to a sufficiently small particle size to promote reaction to form cordierite during firing. Thus, there is no indication from previous known methods that the replacement of aluminosilicate clay with an alumina source material and a silica source material would beneficially reduce CTE and improve thermal shock resistance. EXAMPLES For the purpose of illustration, examples of the methods described herein are presented in Tables 1 to 6 and described below. Table 1 lists the chemical compositions and median particle diameters of raw materials used in the examples. Median particle diameters (D50) were measured using a laser diffraction particle size analyzer. Weight percentages of raw materials used in the cordierite-forming mixtures used to make Examples 1 to 9 are presented in Tables 2 and 3. Weight percentages of the metal oxides in the cordierite-forming mixtures and ceramics (Tables 2 and 3) were computed from the compositions of the raw materials (Table 1) excluding fugitive components such as H2O. TABLE 1 Weight Percentages MgO Al2O3 SiO2 Fe2O3 TiO2 CaO Na2O K2O Est. H2O D50 (μm) Chlorite A 32.70 20.20 31.80 0.22 0.150 0.028 0.005 0.013 14.9 18.6 Chlorite B 32.50 19.60 32.60 0.26 0.079 0.100 0.004 0.006 14.9 6.9 Talc 30.23 0.31 62.52 1.51 trace trace 0.15 0.05 5.2 — Alumina A 0.00 99.90* 0.008 0.014 0.000 0.010 0.067 0.005 0.0 6.6 Alumina B 0.044 99.80* 0.037 0.013 0.000 0.035 0.061 0.010 0.0 0.5 Quartz 0.008 0.260 99.52* 0.047 0.018 0.009 0.076 0.042 0.0 4.5 Kaolin A 0.070 38.18 45.10 0.210 0.990 0.050 0.070 0.040 15.3 7.3 Kaolin B 0.120 38.02 44.80 0.300 1.50 0.050 0.060 0.050 15.1 3.4 Mullite A 0.00 73.19 25.65 0.22 0.02 0.00 0.00 0.00 0.9 17.6 Mullite B 0.02 76.10 23.30 0.04 0.01 0.05 0.13 0.06 0.3 6.0 Kyanite A 0.06 56.30 41.00 0.63 1.47 0.04 0.03 0.04 0.4 12.0 Kyanite B 0.06 56.30 41.00 0.63 1.47 0.04 0.03 0.04 0.4 8.5 *Not measured, computed by difference from 100% TABLE 2 Raw material mixtures used in Examples 1 to 4 and calculated ceramic composition Composition A B C D Chlorite A 39.59 39.43 39.06 38.70 Kaolin A 0 0 0 16.00 Mullite A 0 33.69 0 0 Kyanite A 0 0 43.49 0 Alumina A 24.75 0 0 17.88 Quartz 35.66 26.88 17.45 27.42 MgO 13.79 13.73 13.62 13.81 Al2O3 34.85 34.96 34.52 34.70 SiO2 51.07 50.98 50.62 50.98 Fe2O3 0.114 0.185 0.392 0.146 TiO2 0.070 0.075 0.746 0.242 Na2O 0.048 0.024 0.030 0.050 K2O 0.023 0.017 0.032 0.026 CaO 0.018 0.014 0.030 0.025 MgO + Al2O3 + 99.71 99.67 98.76 99.49 SiO2 A + AE* + RE 0.089 0.056 0.091 0.101 Oxides *Excludes MgO TABLE 3 Raw material mixtures used in Examples 5 to 9 and calculated ceramic composition Composition E F G H J Chlorite B 39.82 39.72 39.28 38.93 38.93 Kaolin A 0 0 0 16.00 0 Kaolin B 0 0 0 0 16.00 Mullite B 0 32.71 0 0 0 Kyanite B 0 0 43.81 0 0 Alumina B 24.93 0 0 18.06 18.06 Quartz 35.25 27.57 16.91 27.02 27.02 MgO 13.80 13.76 13.62 13.81 13.83 Al2O3 34.82 34.86 34.51 34.68 34.63 SiO2 51.07 51.02 50.61 50.98 50.90 Fe2O3 0.131 0.138 0.411 0.164 0.179 TiO2 0.040 0.042 0.722 0.213 0.301 CaO 0.046 0.068 0.029 0.048 0.046 Na2O 0.021 0.035 0.029 0.024 0.026 K2O 0.055 0.063 0.060 0.061 0.061 MgO + Al2O3 + 99.69 99.64 98.74 99.47 99.36 SiO2 A + AE* + RE 0.122 0.167 0.118 0.133 0.133 Oxides *Excludes MgO Cordierite-forming mixtures comprising 1500 grams of inorganic raw materials were weighed out and mixed with 90 grams of methyl cellulose and 15 grams of sodium stearate in a Processall Mixer. Each mixture was placed in a stainless steel muller and plasticized with 370 to 420 ml of deionized water. The material was transferred to a ram extruder, vacuum was pulled on the mixture, and the material was passed through a spaghetti die several times before being extruded as 8 mm diameter rod and 25.4 mm (1 inch) diameter cellular ware with a cell density of 31 cells/cm2 (200 cells/in2) and a wall thickness of 0.41 mm (0.016 in). The rod was cut into sections that were placed in glass tubes. Cellular ware was cut into segments and wrapped in aluminum foil. The extruded products were dried in a convection oven for several days. Dried material was further cut to desired lengths, set in an alumina tray, and fired in an electric furnace at 50° C./h to 1400° C., held for 20 hours, and cooled at a nominal rate of 500° C./h. The cooling rate was slower at lower temperatures due to the thermal mass of the furnace. The coefficient of thermal expansion of cellular ware along the direction of the lengths of the channels was measured from room temperature to 1000° C. and back to room temperature by dilatometry. Values of the mean CTE from room temperature to 800° C., room temperature to 1000° C., and from 500° C. to 900° C., all upon heating, were calculated. The axial and transverse I-ratio values were measured on the cellular ware by x-ray diffractometry. The I-ratio of crushed and pulverized powder samples was also determined by loading the powder samples into a sample holder. This material was also used to determine the weight percentages of spinel, mullite, corundum, and cristobalite in the fired ware by X-ray diffraction, from which percentage by weight of cordierite was derived by difference from 100%. Values of the C parameter for each sample were computed from the cordierite-forming mixture and the particle sizes of the raw materials. Values of percent porosity and pore size distribution were determined by mercury porosimetry. The values of d10, d50, and d90 are the pore diameters at the tenth, fiftieth, and ninetieth percentiles of the cumulative pore size distribution function, respectively, based upon pore volume. The cumulative pore size distribution function begins with the lowest pore size and ends at the highest pore size, whereby d10<d50<d90. The value of d50 therefore is equal to the median pore diameter of the ceramic. Modulus of rupture was measured on rods using a four-point method with a support span of 2 inches and a load span of 0.75 inch. Young's elastic modulus was measured from room temperature to 1200° C. using a sonic resonance technique. Physical properties and C parameter values of Examples 1 to 9 are provided in Tables 4 and 5. TABLE 4 Physical properties of Examples 1 to 4 Example Number 1 2 3 4 Composition A B C D Pore Volume 0.2797 0.3485 0.3519 0.3786 (ml/g) Porosity (%) 41.2 46.9 48.1 49.3 d10 (μm) 4.8 4.4 3.1 3.3 d50 (μm) 6.9 11.2 7.7 7.1 d90 (μm) 9.7 16.2 11.6 10.1 (d50 − d10)/d50 0.31 0.61 0.60 0.54 (d90 − d10)/d50 0.71 1.05 1.11 0.96 CTE25-800° C. 11.8 11.8 11.8 8.6 (10−7° C.−1) CTE25-1000° C. 13.4 13.9 14.2 10.6 (10−7° C.−1) CTE500-900° C. 17.2 19.7 19.7 15.6 (10−7° C.−1) Axial I-Ratio 0.40 0.49 0.57 0.52 Powder I-Ratio 0.61 0.66 0.67 0.66 Transverse 0.87 0.85 0.76 0.83 I-Ratio Mullite 0 0 0 0 Spinel 8.0 2.4 1.0 2.0 Alumina 0.3 0 0 0.1 Cristobalite 3.5 0 0 0 Cordierite 88.2 97.6 99.0 97.9 C Parameter 9.0 10.4 10.5 9.3 MOR (psi) 2775 1955 2169 1831 E25° C. (psi) 3.65E+06 2.68E+06 3.09E+06 2.23E+06 E° 25° C. (psi) 4.30E+06 3.01E+06 3.54E+06 3.04E+06 E800° C., Heating 3.56E+06 2.62E+06 3.09E+06 2.37E+06 (psi) E25° C./E°25° C. 0.811 0.891 0.874 0.734 E800° C., Heating/ 1.020 0.978 1.000 1.063 E25° C. MOR/E 0.076% 0.073% 0.070% 0.082% TABLE 5 Physical properties of Examples 5 to 9 Example Number 5 6 7 8 9 Composition E F G H J Pore Volume (ml/g) 0.2163 0.3198 0.3085 0.2594 0.2559 Porosity (%) 35.2 45.2 41.6 38.0 38.2 d10 (μm) 1.4 2.1 2.0 1.6 1.5 d50 (μm) 2.6 6.1 4.7 3.0 3.1 d90 (μm) 3.7 8.3 7.3 4.2 4.6 (d50 − d10)/d50 0.46 0.65 0.57 0.47 0.53 (d90 − d10)/d50 0.85 1.01 1.11 0.84 1.02 CTE25-800° C. 0.6 15.1 14.8 6.6 9.3 (10−7° C.−1) CTE25-1000° C. 2.3 17.2 16.6 8.5 11.4 (10−7° C.−1) CTE500-900° C. 7.8 22.5 22.2 13.9 16.6 (10−7° C.−1) Axial I-Ratio 0.42 0.60 0.60 0.52 0.57 Powder I-Ratio 0.65 0.65 0.64 0.63 0.62 Transverse I-Ratio 0.86 0.74 0.73 0.82 0.75 Mullite 0 0 0 0 0 Spinel 2.2 1.8 0 1.6 1.4 Alumina 0.1 0 0 0 0 Cristobalite 0 0 0 0 0 Cordierite 97.7 98.2 100.0 98.4 98.6 C Parameter 0.7 13.7 13.5 3.3 8.0 MOR (psi) 2909 3756 2169 2492 3997 E25° C. (psi) 3.54E+06 4.23E+06 4.36E+06 4.10E+06 4.64E+06 E° 25° C. (psi) 6.31E+06 4.48E+06 4.64E+06 5.27E+06 6.26E+06 E800° C., Heating (psi) 4.01E+06 4.03E+06 4.21E+06 4.24E+06 4.90E+06 E25° C./E°25° C. 0.561 0.944 0.939 0.777 0.741 E800° C., Heating/ 1.133 0.953 0.966 1.034 1.056 E25° C. MOR/E 0.082% 0.089% 0.050% 0.061% 0.086% Example 1 was prepared according to the method described herein based upon a raw material mixture comprising chlorite, corundum, and quartz. The relatively coarse particle sizes of the chlorite and corundum and the refractory nature of the raw materials resulted in residual spinel (8% by weight), corundum (0.3% by weight), and cristobalite (3.5% by weight) in the fired ceramic, corresponding to 88.2% cordierite by weight. The calculated C parameter for this sample was 9.0 and the value of CTE (RT-800° C.) was 11.8×10−7° C.−1. The values of E800° C./E25° C.=1.02 and E25° C.0.811 indicate the presence of sufficient microcracking to offset the presence of the high-expansion secondary phases and provide a ceramic article with a usefully low CTE. Example 2 was prepared according to the method described herein based upon a raw material mixture comprising chlorite, mullite, and quartz. The fired ceramic article contained only 2.4% spinel by weight and, therefore, 97.6% cordierite by weight. Due to the coarse size of the mullite raw material, the value of the C parameter is 10.4 and the value of CTE (RT-800° C.) is 11.8×10−7° C.−1 (both within the preferred ranges). The values of E800° C./E25° C.=0.978 and E25° C./E°25° C.=0.891 indicate the presence of a small amount of microcracking. Example 3 was prepared according to the method described herein based upon a raw material mixture comprising chlorite, kyanite, and quartz. The fired ceramic article contained 1.0% spinel by weight and, therefore, 99.0% cordierite by weight. Due to the coarse size of the kyanite raw material, the value of the C parameter is 10.5 and the value of CTE (RT-800° C.) is 11.8×10−7° C.−1 (both within preferred ranges). The values of E800° C./E25° C.=1.000 and E25° C./E°25° C.=0.874 indicate the presence of a small amount of microcracking. Example 4 was prepared according to the method described herein based upon a raw material mixture comprising chlorite, kaolin, corundum, and quartz. The fired ceramic article contained 2.0% spinel by weight and 0.1% corundum by weight and, therefore, 97.9% cordierite by weight. Due to the coarse size of the kaolin raw material and its limitation to only 16% by weight of the cordierite-forming mixture, the value of the C parameter is only 9.3 and the value of CTE (RT-800° C.) is only 8.6×10−7° C.−1 (well within the preferred ranges). The values of E800° C./E25° C.=1.063 and E25° C./E°25° C.=0.734 indicate the presence of substantial microcracking. Example 5 was prepared according to the method described herein based upon a raw material mixture comprising a fine chlorite, fine corundum, and quartz. Example 5 used finer raw materials, as compared to Example 1, allowing greater reaction among the raw materials, such that the fired ceramic article contained only 2.2% spinel by weight and 0.1% corundum by weight, and therefore 97.7% cordierite by weight. Due to the absence of an aluminosilicate raw material and the fine particle size of the alumina source material, the value of the C parameter is only 0.7 and the value of CTE (RT-800° C.) is an extremely low 0.6×10−7° C.−1. The values of E800° C./E25° C.=1.133 and E25° C./E°25° C.=0.561 indicate the presence of a very substantial amount of microcracking. The large hysteresis between the elastic modulus heating and cooling curves is evident in FIG. 5, which shows a plot of Young's elastic modulus for Example 5 during heating from 25 to 1200° C. (open circles) and cooling back to room temperature (open squares). The tangent line to the cooling curve at the position indicated by the filled triangle indicates the path that would be taken by a non-microcracked version of the sample during further cooling. The value of the tangent line at 25° C. is E°25° C.. This is the elastic modulus of the ceramic article of Example 5 at 25° C. in a hypothetically non-microcracked state. Also, the measured elastic modulus values of the sample are indicated at 25° C., E25° c (before heating), and at 800° C., E800° C. (during heating). The large hysteresis indicates extensive microcracking. Example 6 was prepared according to the method described herein based upon a raw material mixture comprising fine chlorite, finer mullite, and quartz. The fired ceramic article contained only 1.8% spinel by weight and therefore 98.2% cordierite by weight. However, due to the large amount and finer size of the mullite raw material, the value of the C parameter is 13.7 and the value of CTE (RT-800° C.) is 15.1×10−7° C.−1 (both outside the preferred ranges). The values of E800° C./E25° C.=0.953 and E25° C.=0.944 indicate the presence of insufficient microcracking to provide a CTE below 14×10−7° C.−1. The very low amount of hysteresis between the elastic modulus heating and cooling curves is evident in FIG. 6, which shows a plot of Young's elastic modulus for Example 6 during heating from 25° C. to 1200° C. (open circles) and cooling back to room temperature (open squares). The tangent line to the cooling curve at the position indicated by the filled triangle indicates the path that would be taken by a non-microcracked version of the sample during further cooling. The value of the tangent line at 25° C. is E°25° C. (the elastic modulus of the ceramic of Example 6 at 25° C. in a non-microcracked state). The elastic modulus values of the sample at 25° C., E25° C. (before heating) and at 800° C., E800° C. (during heating), are also indicated. The small hysteresis indicates a small degree of microcracking. Example 7 was prepared according to the method described herein based upon a raw material mixture comprising fine chlorite, finer kyanite, and quartz. The fired ceramic contained no residual crystalline phases and therefore 100% cordierite by weight. However, due to the large amount and finer size of the kyanite raw material, the value of the C parameter is 13.5 and the value of CTE (RT-800° C.) is 14.8×10−7° C.−1 (both outside the preferred ranges). The values of E800° C./E25° C.=0.966 and E25° C./E°25° C.=0.939 indicate the presence of insufficient microcracking to provide a CTE below 14×10−7° C.−1. Example 8 was prepared according to the method described herein based upon a raw material mixture comprising fine chlorite, coarse kaolin, fine corundum, and quartz. The fired ceramic contained only 1.6% spinel by weight and, therefore, 98.4% cordierite by weight. Due to the coarse size of the kaolin raw material, its limitation to only 16% by weight of the cordierite-forming mixture, and the fine particle size of the corundum raw material, the value of the C parameter is only 3.3, and the value of CTE (RT-800° C.) is only 6.6×10−7° C.−1 (well within the preferred ranges). The values of E800° C./E25° C.=1.034 and E25° C./E°25° C.=0.777 indicate the presence of substantial microcracking. Example 9 was prepared according to the method described herein based upon a raw material mixture comprising fine chlorite, fine kaolin, fine corundum, and quartz. The fired ceramic contained only 1.4% spinel by weight and, therefore, 98.6% cordierite by weight. Due to the limitation of kaolin to only 16% by weight of the cordierite-forming mixture, and also the fine particle size of the corundum raw material, the value of the C parameter is only 8.0 and the value of CTE (RT-800° C.) is only 9.3×10−7° C.−1 (well within the preferred ranges). The values of E800° C./E25° C.=1.056 and E25° C./E°25° C.=0.741 indicate the presence of substantial microcracking. Although the amount of microcracking in Example 9 was slightly greater than that of Example 8, the degree of orientation of the cordierite crystals within the plane of the cell walls of the honeycomb ceramic was lower in Example 9, as indicated by the higher axial I-ratio and lower transverse I-ratio. The higher CTE of Example 9 is attributed to this lower degree of cordierite crystal alignment. It will be understood that for the purposes of this disclosure, “at least one of X, Y, and Z” can be construed as X only, Y only, Z only, or any combination of two or more items X, Y, and Z (e.g., XYZ, XY, XZ, YZ). Furthermore, it will be understood that for the purposes of this disclosure, “X, Y, and/or Z” can be construed as X only, Y only, Z only, or any combination of two or more items X, Y, and Z (e.g., XYZ, XY, XZ, YZ). Although several example embodiments have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the example embodiments without materially departing from the scope of this disclosure. Accordingly, all such modifications are intended to be included within the scope of this disclosure. 1. A method of making a porous ceramic article comprising cordierite, the method comprising: mixing a plurality of materials to form a cordierite-forming mixture, wherein the cordierite-forming mixture comprises: (i) a chlorite raw material in an amount of about 5% to about 60% by weight of a total inorganic content of the cordierite-forming mixture, (ii) a silica source material, and (iii) an aluminum-containing source material, wherein the aluminum-containing source material comprises a platy aluminum silicate raw material in an amount of 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture; forming the cordierite-forming mixture into a green body; and firing the green body to form the porous ceramic article comprising cordierite. 2. The method of claim 1, wherein the cordierite-forming mixture comprises the chlorite raw material in an amount of about 5% to about 45% by weight of a total inorganic content of the cordierite-forming mixture. 3. The method of claim 1, wherein the chlorite raw material comprises a clinochlore. 4-5. (canceled) 6. The method of claim 1, wherein the cordierite-forming mixture is substantially free of the platy aluminum silicate raw materials. 7. The method of claim 1, wherein the platy aluminum silicate raw material comprises at least one of pyrophyllite, kaolin clay, and ball clay. 8-10. (canceled) 11. The method of claim 1, wherein the aluminum-containing source material comprises a mullite raw material in an amount of 0% to about 35% by weight of the total inorganic content of the cordierite-forming mixture. 12-14. (canceled) 15. The method of claim 1, wherein the aluminum-containing source material comprises: an alumina source material in an amount of 0% to about 40% by weight of the total inorganic content of the cordierite-forming mixture; an Al2SiO5 raw material in an amount of 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture; and a mullite raw material in an amount of 0% to about 35% by weight of the total inorganic content of the cordierite-forming mixture, wherein the cordierite-forming mixture satisfies the following relationship: W M(0.477−0.0095D 50,M)+W S(0.469−0.019D 50,S)+W P(0.721−0.075D 50,P)+0.055(W A)(D 50,M)≤13, wherein WM is a percentage by weight of mullite raw material, WS is a percentage by weight of Al2SiO5 raw material, WP is a percentage by weight of the platy aluminum silicate raw material, and WA is a percentage by weight of the alumina source material, D50,M is a median particle diameter of the mullite raw material in microns, D50,S is a median particle diameter of the Al2SiO5 raw material in microns, D50,P is a median particle diameter of the platy aluminum silicate raw material in microns, and D50,A is a median particle diameter of the alumina source material in microns. 16. The method of claim 15, wherein: W M(0.477−0.0095D 50,M)+W S(0.469−0.019D 50,S)+W P(0.721−0.075D 50,P)+0.055(W A)(D 50,M)≤12.6 17. (canceled) 18. The method of claim 1, wherein the cordierite-forming mixture comprises talc in an amount of about 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture. 19. The method of claim 18, wherein the cordierite-forming mixture is substantially free of talc. 20. The method of claim 1, wherein the porous ceramic article comprises a coefficient of thermal expansion of less than or equal to about 14×10−7° C.−1 from 25 to 800° C. 21. (canceled) 22. The method of claim 1, wherein the porous ceramic article comprises a porosity of at least about 35%. 23. The method of claim 1, wherein the porous ceramic article comprises cordierite in an amount greater than about 85% by weight of a total of all crystalline phases within the porous ceramic article. 24. The method of claim 1, wherein the porous ceramic article comprises a sum of spinel, sapphirine, mullite, and corundum in an amount of 0% to about 10% by weight of a total of all crystalline phases within the porous ceramic article. 25-26. (canceled) 27. The method of claim 24, wherein the porous ceramic article is substantially free of cristobalite. 28. The method of claim 1, wherein the porous ceramic article comprises a composition that satisfies the following relationships: (wt % MgO+wt % Al2O3+wt % SiO2)≥90, 10≤100[wt % MgO/(wt % MgO+wt % Al2O3+wt % SiO2)]≤16, 31≤100[wt % Al2O3/(wt % MgO+wt % Al2O3+wt % SiO2)]≤40, and 47<100[wt % SiO2/(wt % MgO+wt % Al2O3+wt % SiO2)]≤56. 29. The method of claim 28, wherein the composition of the porous ceramic article further satisfies the following relationship: A+AE+RE<0.5, where A is a sum of weight percentages of alkali metal oxides, AE is a sum of weight percentages of alkaline earth metal oxides excluding MgO, and RE is a sum of weight percentages of rare earth metal oxides. 30. The method of claim 1, wherein forming the cordierite-forming mixture to form the green body comprises extruding the cordierite-forming mixture to form a green body that comprises a network of walls that extend in an axial direction about a longitudinal axis from an inlet end to an outlet end of the green body. 31. The method of claim 1, wherein the porous ceramic article comprises an E800° C./E25° C. ratio of at least about 1.00. 32. (canceled) 33. A method of making a porous ceramic article comprising cordierite, the method comprising: mixing a plurality of materials to form a cordierite-forming mixture, wherein the cordierite-forming mixture comprises: (i) a chlorite raw material in an amount of about 5% to about 60% by weight of a total inorganic content of the cordierite-forming mixture, (ii) a silica source material, (iii) an alumina source material in an amount of 0% to about 40% by weight of the total inorganic content of the cordierite-forming mixture; (iv) a platy aluminum silicate raw material in an amount of 0% to about 30% by weight of the total inorganic content of the cordierite-forming mixture; (v) an Al2SiO5 raw material in an amount of 0% to about 45% by weight of the total inorganic content of the cordierite-forming mixture; (vi) a mullite raw material in an amount of 0% to about 35% by weight of the total inorganic content of the cordierite-forming mixture, wherein the cordierite-forming mixture satisfies the following relationship: W M(0.477−0.0095D 50,M)+W S(0.469−0.019D 50,S)+W P(0.721−0.075D 50,P)+0.055(W A)(D 50,M)≤13, wherein WM is a percentage by weight of mullite raw material, WS is a percentage by weight of Al2SiO5 raw material, WP is a percentage by weight of the platy aluminum silicate raw material, and WA is a percentage by weight of the alumina source material, D50,M is a median particle diameter of the mullite raw material in microns, D50,S is a median particle diameter of the Al2SiO5 raw material in microns, D50,P is a median particle diameter of the platy aluminum silicate raw material in microns, and D50,A is a median particle diameter of the alumina source material in microns; forming the cordierite-forming mixture into a green body; and firing the green body to form the porous ceramic article comprising cordierite. 34-38. (canceled)

2018-11-30

en

2020-09-24

US-201113520671-A

Radiation-collecting device ABSTRACT A radiation-collecting device includes at least one radiation-collecting element and a scattering layer placed, in relation to the element, on that side on which the radiation is incident on the device. The scattering layer has a transparent fibrous structure and a transparent medium for encapsulating the fibers of the fibrous structure, the absolute value of the difference between the refractive index of the fibers of the fibrous structure and the refractive index of the encapsulating medium being equal to or greater than 0.05. The present invention relates to a radiation-collecting device, such as a photovoltaic module. The present invention also relates to a cover for a radiation-collecting element, especially for a photovoltaic cell. As is known, a photovoltaic module comprises, as radiation-collecting element, at least one photovoltaic cell capable of converting radiation energy into electrical energy. A photovoltaic cell conventionally comprises a material capable of energy conversion and two electrically conductive contacts, or electrodes, on either side of this material. The front electrode of a photovoltaic cell, intended to be placed on the side on which radiation is incident on the cell, may especially be formed based on a transparent conductive oxide (or TCO) layer or based on a transparent metallic coating (transparent conductive coating or TCC). Conventionally, this front electrode is combined with a front substrate of the photovoltaic module, or substrate having a glazing function, which ensures that the photovoltaic cells are mechanically protected while still allowing good radiation transmission to the cells. The energy conversion efficiency of a photovoltaic module is directly influenced by the amount of radiation that reaches the energy conversion material of each photovoltaic cell. It is therefore necessary, to improve this efficiency, to maximize the amount of incident radiation on the module that reaches the energy conversion material. To do this, a first known strategy consists in improving the transmission properties of the front substrate, by texturing at least its front face, the one intended to be placed on the side on which the radiation is incident on the photovoltaic module, so as to limit reflection of the incident radiation on the module at the air/front substrate interface. Another known strategy consists, when the module comprises photovoltaic cells in which the front electrode is formed based on a TCO layer, in providing this TCO layer with microtexturing on its face on the opposite side from the front substrate. Thanks to this microtexturing, the TCO layer traps the incident radiation, thereby increasing the probability of the radiation being absorbed by the energy conversion material of the cell. However, the efficiency of photovoltaic modules incorporating such textured front substrates or such microtextured TCO layers remains limited. It is these drawbacks that the invention is more particularly intended to remedy by providing a radiation-collecting device, especially a photovoltaic module, which has a better energy conversion efficiency than the devices of the prior art. For this purpose, one subject of the invention is a radiation-collecting device comprising at least one radiation-collecting element, characterized in that it further comprises a scattering layer placed, in relation to the collecting element, on that side on which the radiation is incident on the device, the scattering layer having a transparent fibrous structure and a transparent medium for encapsulating the fibers of the fibrous structure, the absolute value of the difference between the refractive index of the fibers of the fibrous structure and the refractive index of the encapsulating medium being equal to or greater than 0.05. Throughout this application, the numerical values of the refractive indices are those measured at 550 nm. In the context of the invention, the term “transparent” refers to transparency at least in the wavelength ranges of use for the radiation-collecting elements of the device. To give an example, in the case of a photovoltaic module comprising photovoltaic cells based on polycrystalline silicon, each transparent structure or medium is advantageously transparent in the wavelength range between 400 nm and 1200 nm, these being the wavelengths of use for this type of cell. It should also be understood by the expression “encapsulating the fibers of the fibrous structure” that at least some of the fibers of the fibrous structure are coated. Thus, in the scattering layer there are interfaces between the material of the fibers and the material of the encapsulating medium. The scattering layer is positioned, relative to the collecting element, on the side on which the radiation is incident on the device, i.e. at the front of the collecting element. Conventionally, in the context of the invention, the rear-front direction in a radiation-collecting device is opposite that of the direction of propagation of radiation intended to be collected by the device. For a photovoltaic module according to the invention, the radiation-collecting element is a photovoltaic cell and the scattering layer is positioned at the front of this cell. Thanks to the relatively large difference between the refractive index of the fibers of the fibrous structure and the refractive index of the encapsulating medium, the scattering layer is capable of improving the way the radiation is guided to the energy conversion material of the photovoltaic cell, on the one hand by a radiation trapping effect, which increases the probability of absorption of the radiation by the energy conversion material of the cell, and, on the other hand, by an angle haze effect, which increases the transmission at large angles of incidence of the radiation. It is thus possible, for a photovoltaic module according to the invention and compared with a module of the prior art not having the scattering layer defined in the invention, either to increase the energy conversion efficiency of the module for the same thickness of the energy conversion material, or to maintain the same energy conversion efficiency while reducing the thickness of the energy conversion material, that is to say reducing the cost of the module. According to one advantageous feature of the invention, the medium for encapsulating the fibers of the fibrous structure is a polymeric material. In particular, the encapsulating medium may be formed by a polymeric lamination interlayer, for example based on polyvinylbutyral (PVB), ethylene vinyl acetate (EVA), polyurethane, an ionomer, or an adhesive based on polyolefin. As a variant, the encapsulating medium may be formed by a front substrate made of thermoplastic polymer of the collecting device. Examples of appropriate transparent thermoplastic polymers comprise, in particular, polyethylene terephthalate (PET), polyethylene naphthalate (PEN), polycarbonate, polyurethane, polymethyl methacrylate, polyamides, polyimides, fluoropolymers such as ethylene tetrafluoroethylene (ETFE) and polytetrafluoroethylene (PTFE). The fibers of the fibrous structure, whether having a woven or nonwoven structure, play a role in mechanically reinforcing the encapsulating medium. In particular, when the encapsulating medium is a lamination interlayer or a front substrate of the collecting device, the rigidity of this interlayer or substrate is increased as a result. A photovoltaic module according to the invention thus has improved mechanical properties, especially in terms of admissible load, enabling it to pass stringent mechanical tests, for example those provided by the IEC standards for checking the resistance of the module to wind or snow loadings. When the encapsulating medium is a lamination interlayer of the module, intended to be surmounted at the front by a glass substrate, the increased rigidity of the interlayer resulting from the mechanical reinforcement by the fibrous structure enables thinner glasses to be used at the front of the interlayer, and therefore a reduction in the thickness and the weight of the module. According to one advantageous feature of the invention, the fibrous structure comprises glass fibers and/or polymer fibers. In the case of glass fibers, the glass constituting the fibers may be of any fiberizable glass type, especially E-glass. In the case of polymer fibers, these may in particular be polyester fibers or fibers of a polyolefin such as polyethylene or polypropylene. Advantageously, the fibrous structure has a mass per unit area of between 10 and 500 g/m2, preferably between 10 and 100 g/m2, and comprises fibers having a diameter between 1 and 20 micrometers, preferably between 5 and 15 micrometers. Preferably, the fibrous structure has a thickness of between 10 micrometers and 1 millimeter. In practice, the haze and light transmission properties of the scattering layer may be adjusted by varying one or more parameters from among, in particular, the mass per unit area of the fibrous structure, the diameter of the fibers of the fibrous structure, the composition of the fibers of the fibrous structure, the composition of the encapsulating medium. In accordance with the invention, the composition of the fibers of the fibrous structure and the composition of the encapsulating medium are adapted in such a way that the absolute value of the difference between the refractive index of the fibers of the fibrous structure and the refractive index of the encapsulating medium is equal to or greater than 0.05. According to one advantageous feature of the invention, the scattering layer has a total light transmission equal to or greater than 80% and a haze value equal to or greater than 40%. In this application, the total light transmission of an element, which comprises the direct light transmission and the diffuse light transmission, is determined according to the ISO 9050:2003 standard. In addition, the haze value of an element, expressed as a percentage, is understood to mean a quantity representative of the capability of this element to deflect radiation. In this application, the haze values are measured using a haze meter according to the ASTM D 1003 standard. The fibrous structure may be a nonwoven structure or a woven structure. For a nonwoven structure, the fibers are generally mingled, whereas for a woven structure the fibers are aligned in the warp and weft directions. In both these cases, the fibrous structure plays a role in providing mechanical reinforcement to the encapsulating medium. When the fibrous structure is woven, the mechanical reinforcement is particularly substantial in the warp and the weft directions. In one advantageous embodiment, the fibrous structure is a veil, ensuring a random distribution of the fibers in the scattering layer. Conventionally, the term “veil” is understood to mean a nonwoven formed from completely dispersed filaments. With such a veil, the properties of the scattering layer, especially in terms of haze and light transmission, are thus substantially uniform. A nonwoven veil of glass fibers generally contains a binder, which binds the fibers and gives the veil sufficient rigidity for it to be able to be easily handled. This binder, which conventionally comprises at least one polymer capable of binding the fibers, is chosen to be transparent and may be of any appropriate type known to those skilled in the art. The presence of a binder in the veil may be advantageous in the industrial manufacture of the radiation-collecting device according to the invention, by facilitating the handling of the veil. However, the binder must cover only a limited surface of the glass fibers of the veil so that radiation passing through the scattering layer effectively encounters interfaces between the fibers and the encapsulating medium. For correct implementation of the invention, the binder preferably represents about 5 to 30%, more preferably 5 to 20%, by weight of the glass fiber veil. According to one advantageous feature of the invention, the scattering layer is placed against a front electrode of the radiation-collecting element. The radiation-collecting element of the device may be a photovoltaic cell. In one advantageous embodiment of a radiation-collecting device according to the invention, the device comprises a first photovoltaic cell, the absorber material of which has a first absorption spectrum, and a second photovoltaic cell, the absorber material of which has a second absorption spectrum at least partially separate with respect to the first absorption spectrum, the scattering layer being inserted between the first photovoltaic cell and the second photovoltaic cell. Another subject of the invention is also a cover for a radiation-collecting element, especially for a photovoltaic cell, this cover comprising a transparent substrate and a scattering layer, in which the scattering layer has a transparent fibrous structure and a transparent medium for encapsulating the fibers of the fibrous structure, the absolute value of the difference between the refractive index of the fibers of the fibrous structure and the refractive index of the encapsulating medium being equal to or greater than 0.05. The scattering layer of the cover may be placed against one face of the substrate. As a variant, when the substrate is made of a thermoplastic polymer, the scattering layer of the cover may be incorporated into the substrate, with at least part of the substrate that forms the medium for encapsulating the fibers of the fibrous structure. The features and advantages of the invention will become apparent in the following description of three embodiments of a radiation-collecting device according to the invention, given solely by way of example and with reference to the appended drawings in which: FIG. 1 is a schematic cross-sectional view of a photovoltaic solar module according to a first embodiment of the invention; FIG. 2 is a cross-sectional view similar to FIG. 1 for a photovoltaic solar module according to a second embodiment of the invention; and FIG. 3 is a cross-sectional view similar to FIG. 1 for a photovoltaic solar module according to a third embodiment of the invention. The photovoltaic solar module 20 shown in FIG. 1 comprises a photovoltaic cell 30 consisting of polycrystalline silicon wafers forming a p-n junction. As may be seen in FIG. 1, the module 20 comprises a front substrate 1 having a glazing function and a rear substrate 8 having a support function. The front substrate 1, intended to be placed on the side on which the solar radiation is incident on the module 20, may especially be made of an extra-clear transparent glass having a very low content of iron oxides, or made of a transparent thermoplastic polymer. The rear substrate 8 is made of any appropriate material, whether transparent or not, and bears, on its face directed toward the interior of the module 20, that is to say on the side on which the solar radiation is incident on the module, an electrically conductive layer 7 that forms a rear electrode of the photovoltaic cell 30. To give an example, the layer 7 is a metal layer, especially made of silver or aluminum. The layer 7 forming the rear electrode is surmounted, as is conventional, by a polycrystalline silicon wafer 6 capable of converting solar energy to electrical energy. The wafer 6 is itself surmounted by an electrically conductive transparent layer 5 which forms a front electrode of the cell 30. The photovoltaic cell 30 is thus formed by the stack of the layers 5, 6 and 7. In this example, the layer 5 forming the front electrode of the cell 30 is a layer based on aluminum-doped zinc oxide (AZO). As a variant, the layer 5 may be a layer based on another doped transparent conductive oxide (TCO), or a transparent metallic coating (TCC) such as a silver-based stack. A scattering layer 2 is positioned between the layer 5 forming the front electrode and the front substrate 1. This scattering layer 2 comprises a transparent veil 3 of E-glass fibers, the refractive index n3 of which is around 1.57, and a transparent matrix 4 made of PVB, the refractive index n4 of which is around 1.48, which matrix encapsulates the veil 3. Thus, the difference in refractive index between the fibers of the veil 3 and the matrix 4 is around 0.09. An example of a glass fiber veil that can be used for the veil 3 is a veil of the U50 type sold by Saint-Gobain Technical Fabrics, having a grammage, or mass per unit area, of 50 g/m2. As shown schematically in FIG. 1, the polymer matrix 4 encapsulates the veil 3, having substantially the same thickness as the veil. However, the polymer matrix 4 may have a greater thickness than the thickness of the veil 3, the veil 3 then being encapsulated in only a portion of the polymer matrix 4. The veil 3 mechanical reinforces the PVB matrix 4 so that the scattering layer 2 has a greater rigidity than a layer made only of PVB and having the same thickness as the scattering layer 2. By virtue of the relatively large difference in refractive index between the fibers of the veil 3 and the encapsulating matrix 4, the radiation is strongly scattered at the interface between the fibers of the veil and the matrix, resulting in a high haze value of the scattering layer 2. The scattering layer 2 thus has both a high haze value, greater than 40%, and also a high total light transmission, greater than 80%. In practice, the haze and light transmission properties of the scattering layer 2 may be adjusted by varying one or more parameters from among, especially, the mass per unit area of the veil 3, the diameter of the fibers of the veil 3, the composition of the fibers of the veil 3, the composition of the polymer matrix 4, so as to obtain a scattering layer 2 that provides an advantageous compromise between haze and light transmission. The high haze of the scattering layer 2 placed in front of the photovoltaic cell 30 promotes absorption of a high percentage of the radiation incident on the module by the energy conversion material 6, according to two main effects. The first effect is a radiation trapping effect, or light trapping effect, because of the scattering layer 2. Specifically, because of the strong scattering at the interface between the fibers of the veil 3 and the matrix 4, the optical path of the radiation in the layer 2 and the underlying layers 5, 6 is lengthened, thereby increasing the probability of absorption of the radiation by the photovoltaic semiconductor material of the wafer 6 positioned at the rear of the layer 2. The scattering layer 2 thus functions to a certain extent as a guide, which maintains and directs the radiation within the module 20 until it is absorbed by the energy conversion material 6. The second effect, or “angle haze” effect, corresponds to a reduction in reflection, for large angles of incidence of the radiation, at the interface between the scattering layer 2 and the underlying layer of the module, which is the front electrode 5 in this first embodiment. Due to scattering at the interface between the fibers of the veil 3 and the matrix 4, the rays having high angles of incidence on the module 20 are “straightened up” within the scattering layer 2 so that they encounter the underlying layer 5 of the module at lower angles of incidence. Since the range of high angles of incidence, close to 90°, promotes reflection at the interface between the scattering layer 2 and the underlying layer 5, the straightening-up of the rays by scattering in the layer 2 is accompanied by an appreciable reduction in reflection. Thus, a wider range of angles of incidence of the radiation is transmitted to the energy conversion material 6, thereby increasing the amount of incident radiation on the module 20 that is absorbed by the energy conversion material 6. These two effects, combined with the high total light transmission of the scattering layer, serve to increase the energy conversion efficiency of the photovoltaic module 20 relative to a similar photovoltaic module of the prior art not containing a scattering layer. In the second embodiment shown in FIG. 2, the elements analogous to those of the first embodiment bear the same references, but increased by 100. The photovoltaic solar module 120 of this second embodiment differs from the module 20 above in that it comprises, instead of cells comprising polycrystalline silicon wafers, a thin-film photovoltaic cell 130, the absorber layer of which is based on a chalcopyrite compound comprising copper, indium and selenium, called a CIS absorber layer. Optionally, gallium may be added to such a CIS absorber layer, to give a CIGS absorber layer, or else aluminum or sulfur may be added thereto. The module 120 according to the second embodiment comprises a front substrate 101 having a glazing function and a rear substrate 108 having a support function. The rear substrate 108 bears, on its face directed toward the interior of the module 120, an electrically conductive layer 107 forming a rear electrode of the photovoltaic cell 130 of the module. To give an example, the layer 107 is based on molybdenum. When the rear substrate 108 is made of glass and the rear electrode 107 is made of molybdenum, a layer (not shown), especially based on silicon nitride Si3N4, is advantageously placed between the rear substrate 108 and the layer 107 in order to form an alkali barrier. The layer 107 is surmounted by a layer 106 of absorber material based on a chalcopyrite compound, especially CIS or GIGS, capable of converting solar energy into electrical energy. The absorber layer 106 is itself surmounted by a layer of cadmium sulfide CdS (not shown), optionally combined with a layer of undoped intrinsic zinc oxide ZnO (also not shown), and then by an electrically conductive transparent layer 105 that forms a front electrode of the cell 130. The photovoltaic cell 130 of the module 120 is thus formed by the stack of the layers 105, 106 and 107. In this example, the layer 105 forming the front electrode of the cell 130 is a layer based on aluminum-doped zinc oxide (AZO). As a variant, the layer 5 may be a layer based on another doped transparent conductive oxide (TCO), or a transparent metallic coating (TCC) such as a silver-based stack. Similarly to the first embodiment, a scattering layer 102 is positioned between the layer 105 forming the front electrode and the front substrate 101. The scattering layer 102 comprises a transparent veil 103 made of E-glass fibers and an encapsulating matrix 104 made of PVB, in the same way as the scattering layer 2 of the first embodiment. The use of a PVB encapsulating matrix, or one made of any other polymeric lamination interlayer, is advantageous for holding the functional layers of the module 120 in place between the front substrate 101 and the rear substrate 108. As previously, by virtue of the high haze of the scattering layer 102 placed in front of the photovoltaic cell 130, the energy conversion efficiency of the module 120 is increased relative to the efficiency of a similar module not containing a scattering layer, according to the aforementioned two effects, namely radiation trapping and angle haze. In the third embodiment shown in FIG. 3, the elements analogous to those of the first embodiment bear identical references but increased by 200. The photovoltaic solar module 220 of this third embodiment differs from the modules described previously in that it comprises a “four-wire tandem cell” formed by the superposition of two photovoltaic cells 230 and 240. As may be seen in FIG. 3, the module 220 comprises a front substrate 201 having a glazing function and a rear substrate 208 having a support function, between which the stack of functional layers of the module is placed. The cell 240 placed at the front of the module 220 is a thin-film cell, the absorber layer 216 of which is based on amorphous silicon, which absorbs the high-energy photons of the solar spectrum, in the wavelength range between about 300 nm and 600 nm. The cell 230 placed at the rear of the module 220 is a thin-film cell, the absorber layer 206 of which is a CIGS absorber layer, which absorbs in the wavelength range between about 500 nm and 1000 nm. Since the absorption spectra of the front cell 240 and of the rear cell 230 are at least partly separate, that portion of the spectrum not used for energy conversion by the front cell 240 may be used by the rear cell 230. The tandem cell thus makes it possible to optimize the use of the solar radiation by the module 220. At the front of the module 220, the front substrate 201 covers the front cell 240 which comprises, in succession starting from the front substrate 201, an electrically conductive transparent layer 215 forming a front electrode of the cell 240, the absorber layer 216 based on amorphous silicon, and another electrically conductive transparent layer 217 forming a rear electrode of the cell 240. To give an example, each of the layers 215 and 217 forming the electrodes of the front cell 240 is a layer based on aluminum-doped zinc oxide (AZO). As a variant, each layer 215 or 217 may be a layer based on another doped transparent conductive oxide (TCO), or a transparent metallic coating (TCC) such as a silver-based stack. To the rear of the module 220, the rear substrate 208 bears the rear cell 230, which comprises, in succession starting from the rear substrate 208, an electrically conductive layer 207 forming a rear electrode of the cell 230, the CIGS absorber layer 206 with a thickness of between about 500 nm and 4000 nm, a layer of cadmium sulfide CdS (not shown), optionally combined with a layer of undoped intrinsic zinc oxide ZnO (also not shown), and a transparent electrically conductive layer 205 that forms a front electrode of the cell 230. To give an example, the layer 207 forming the rear electrode is based on molybdenum and the layer 205 forming the front electrode is a layer based on aluminum-doped zinc oxide (AZO). As a variant, the layer 205 may be a layer based on another doped transparent conductive oxide (TCO), or a transparent metallic coating (TCC) such as a silver-based stack. In this embodiment, in accordance with the invention, a scattering layer 202 is positioned at the front of the rear cell 230, between the layer 205 forming the front electrode of the rear cell 230 and the layer 217 forming the rear electrode of the front cell 240. The scattering layer 202 comprises a veil 203 of E-glass fibers and an encapsulating matrix 204 made of PVB, in the same way as the scattering layer 2 of the first embodiment. As previously, through the two effects of radiation trapping and angle haze, the scattering layer 202 placed at the front of the rear cell 230 improves the guiding of the radiation incident on the module 220 to the absorber layer 206 of the rear cell. The scattering layer 202 thus increases the amount of radiation incident on the module 220 that is absorbed by the absorber layer 206 and therefore the energy conversion efficiency of the module 220. The positioning of the scattering layer 202 between the two cells making up the four-wire tandem cell is all the more critical for increasing the energy conversion efficiency of the module 220 since the amount of incident radiation that can reach this central region of the module is limited because of radiation losses in the front portion of the module. Under these conditions, it is crucial for that part of the radiation that has arrived in the central region of the module to be optimally guided to the absorber layer 206 of the rear cell 230, so as to make the optimization of the use of solar radiation by the module 220 effective. A variant (not shown) of the four-wire tandem cell according to the invention differs from the module 220 described above only in that the rear cell 230 based on a chalcopyrite compound is replaced with a cell based on microcrystalline silicon, which absorbs in the near infrared zone, in the wavelength range between about 600 nm and 1000 nm. Such a cell based on microcrystalline silicon comprises, in succession starting from the rear substrate of the module, an electrically conductive layer forming a rear electrode, an absorber layer based on microcrystalline silicon and an electrically conductive transparent layer forming a front electrode. To give an example, the layer forming the rear electrode is a metallic layer, especially a silver or aluminum layer, and the layer forming the front electrode is a layer based on a doped transparent conductive oxide (TCO) or a transparent metallic coating (TCC). As previously, the absorption spectra of the front cell based on amorphous silicon and of the rear cell based on microcrystalline silicon are separate and that portion of the spectrum not used for energy conversion by the front cell may be used by the rear cell. As in the use of the module 220, the scattering layer inserted between the front and rear cells is critical for obtaining optimum use of the solar radiation by the tandem module and for guaranteeing improved energy conversion efficiency of the module compared with a similar module of the prior art containing no scattering layer. The invention is not only directed to a radiation-collecting device incorporating a scattering layer as described above, positioned at the front of at least one collecting element of the device, but also to a cover for a radiation-collecting element comprising a substrate and a scattering layer as described above. By virtue of the fibrous structure that acts as a mechanical reinforcement in the scattering layer, a cover according to the invention has greater rigidity than a substrate of the prior art containing no fibrous structure. The above examples illustrate the advantages of a device and a cover according to the invention comprising a composite scattering layer having both a high haze and a high light transmission, intended to be placed at the front of at least one radiation-collecting element. As explained above, the high haze of the scattering layer placed at the front of a radiation-collecting element promotes absorption of a large amount of the radiation incident on the device by this element, thereby increasing the energy conversion efficiency of the device incorporating this element. The invention thus makes it possible for a device according to the invention or incorporating a cover according to the invention, compared with a similar device of the prior art containing no scattering layer, either to increase the energy conversion efficiency of the device for the same thickness of energy conversion material, or to reduce the thickness of the energy conversion material, and therefore the cost of the device, for the same energy conversion efficiency. A process for manufacturing a photovoltaic module 20, 120 or 220 according to the invention, comprising a scattering layer as described above, which comprises a veil of E-glass fibers and a PVB encapsulating matrix, involves the formation of the veil forming part of the scattering layer, followed by the formation of the scattering layer and its insertion into the structure of the module. The glass fiber veil may be formed using a “dry” process or using a “wet” process. Since such processes for manufacturing glass fiber veils are well known to those skilled in the art, they are not described here in greater detail. Once prepared, the veil is embedded in a PVB layer, by compressing the veil against the PVB layer. The assembly comprising the PVB layer and the veil embedded in the PVB layer is then placed in the laminated structure of the module, in the same way as for a conventional lamination interlayer, and this laminated structure is heated in an oven so as to provide good cohesion between the various constituent layers of the module. As is known, a photovoltaic module according to the invention may be manufactured in superstrate mode, that is to say by successive deposition of the constituent layers of the device starting from the front substrate, this being especially the case for thin-film photovoltaic modules, the absorber of which is based on silicon or cadmium telluride, or in substrate mode, that is to say by successive deposition of the constituent layers of the cell on the rear substrate, which is especially the case for thin-film photovoltaic modules, the absorber of which is based on a chalcopyrite compound. Particularly advantageously, when the module is manufactured in substrate mode and the polymer matrix of the scattering layer is a polymeric lamination interlayer, the scattering layer makes it possible both to improve the guiding of the radiation in the module and to ensure mechanical cohesion of the module. When the encapsulating medium is formed by a transparent thermoplastic polymer, and especially by a portion of the front substrate having a glazing function of the module according to the invention, the fibers of the fibrous structure may be encapsulated in the thermoplastic substrate during molding, by positioning the fibrous structure in a mold and then injecting the thermoplastic polymer into the mold. Whatever the technique chosen to place the fibrous structure in the encapsulating medium, for example by embedding it or by injection molding as described above, the use of a fibrous structure, whether woven or nonwoven, the fibers of which are bonded together prior to incorporation of the fibrous structure in the encapsulating medium, by entanglement and/or using a binder, makes handling and manufacturing easier. The invention is not limited to the examples described and illustrated. The aforementioned advantages in terms of radiation trapping by the scattering layer and angle haze may be obtained by means of any layer having a transparent fibrous structure and a transparent encapsulating medium, which has suitable properties for exhibiting both high haze and high light transmission. One condition for obtaining a high haze is, in accordance with the invention, for the absolute value of the difference between the refractive index of the fibers of the fibrous structure and the refractive index of the encapsulating medium to be equal to or greater than 0.05. When the encapsulating medium is a polymer matrix, especially formed by a lamination interlayer or a thermoplastic substrate, this polymer matrix may have a thickness equal to or greater than the thickness of the fibrous structure. In particular, when the polymer matrix has a thickness greater than that of the fibrous structure, this matrix may extend beyond one side or both sides of the fibrous structure. As mentioned previously, the fibrous structure may be a woven or nonwoven structure. The fibrous structure may be formed by fibers not bonded together prior to the formation of the scattering layer, for example fibers that are deposited, or sprinkled, into a polymer matrix forming the encapsulating medium, while being mingled in the manner of a veil, this veil then not containing a binder other than the polymer matrix. According to a variant, the encapsulating medium may be formed by air or by a liquid of appropriate refractive index, instead of a polymer matrix. Moreover, the invention has been described on the basis of examples in which the scattering layer is placed against the front electrode of a photovoltaic cell. As a variant, the scattering layer may be placed at the front of a photovoltaic cell while being separated from the front electrode of this cell by transparent intermediate layers. As illustrated in the third embodiment, a device according to the invention may comprise several radiation-collecting elements. In this case, the device may integrate several scattering layers having a transparent fibrous structure and a transparent encapsulating medium, each being placed at the front of a collecting element of the device. In particular, in the third embodiment, the photovoltaic module 220 may comprise, apart from the scattering layer 202 placed between the rear cell 230 and the front cell 240, a second scattering layer positioned at the front of the front cell 240 between the front electrode 215 and the front substrate 201. Such a configuration having two scattering layers improves the guiding of the radiation both to the absorber layer 216 of the front cell and to the absorber layer 206 of the rear cell, enabling the energy conversion efficiency of the module to be further increased. Again with a view to increasing the energy conversion efficiency, a radiation-collecting device according to the invention may also incorporate, in addition to one or more scattering layers, other known means for improving the radiation guiding, especially a textured front substrate, so as to limit reflection of the radiation at the interface between the air and the front substrate. Finally, the invention may be implemented for any type of device comprising a radiation-collecting element, without being limited to the devices described above. In particular, the invention may apply to photovoltaic modules comprising thin-film photovoltaic cells, the absorber layer of which is based on silicon, whether amorphous or microcrystalline silicon, based on a chalcopyrite compound, especially of the CIS or CIGS type, or else based on cadmium telluride. The invention may also apply to photovoltaic modules, the photovoltaic cells of which are formed from polycrystalline or monocristalline silicon wafers forming a p-n junction, or to modules having organic photovoltaic cells. The invention is also applicable to radiation-collecting devices involving collecting elements other than photovoltaic cells, for example to thermal solar modules. 1. A radiation-collecting device comprising: a radiation-collecting element; and a scattering layer placed, in relation to the radiation-collecting element, on a side on which radiation is incident on the device, the scattering layer having a transparent fibrous structure and a transparent medium constructed and arranged to encapsulate fibers of the fibrous structure, an absolute value of a difference between a refractive index of the fibers of the fibrous structure and a refractive index of the encapsulating medium being equal to or greater than 0.05. 2. The device as claimed in claim 1, wherein the encapsulating medium is a polymeric material. 3. The device as claimed in claim 2, wherein the encapsulating medium is formed by a polymeric lamination interlayer. 4. The device as claimed in claim 2, wherein the encapsulating medium is formed by a front substrate of the device. 5. The device as claimed in claim 1, wherein the fibrous structure comprises glass fibers. 6. The device as claimed in claim 1 wherein the fibrous structure comprises polymer fibers. 7. The device as claimed in claim 1, wherein the fibrous structure has a mass per unit area of between 10 and 500 g/m2. 8. The device as claimed in claim 1, wherein the fibrous structure comprises fibers having a diameter between 1 and 20 micrometers. 9. The device as claimed in claim 1, wherein the scattering layer has a total light transmission equal to or greater than 80% and a haze value equal to or greater than 40%. 10. The device as claimed in claim 1, wherein the fibrous structure is a nonwoven veil. 11. The device as claimed in claim 1, wherein the scattering layer is placed against a front electrode of the radiation-collecting element. 12. The device as claimed in claim 1, wherein the radiation-collecting element of the device is a photovoltaic cell. 13. The device as claimed in claim 1, comprising a first photovoltaic cell, an absorber material of which has a first absorption spectrum, and a second photovoltaic cell, an absorber material of which has a second absorption spectrum at least partially separate with respect to the first absorption spectrum, the scattering layer being inserted between the first photovoltaic cell and the second photovoltaic cell. 14. A cover for a radiation-collecting element, the cover comprising a transparent substrate, and a scattering layer having a transparent fibrous structure and a transparent medium constructed and arranged to encapsulate fibers of the fibrous structure, an absolute value of a difference between a refractive index of the fibers of the fibrous structure and a refractive index of the encapsulating medium being equal to or greater than 0.05. 16. The device as claimed in claim 7, wherein the fibrous structure has a mass per unit area of between 10 and 100 g/m2. 17. The device as claimed in claim 8, wherein the fibrous structure comprises fibers having a diameter between 5 and 15 micrometers. 18. The cover as claimed in claim 14, wherein the radiation-collecting element is a photovoltaic cell.

2011-01-07

en

2013-01-10

US-201615570505-A

Pressure driven fluidic injection for chemical separations by electrophoresis ABSTRACT A pneumatic method, and associated apparatus, for injecting a discrete sample plug into the separation channel of an electrophoresis microchip ( 100 ) is disclosed. In a first step, pressurized gas ( 90 ) is applied to the sample ( 30 ) and background electrolyte ( 20 ) reservoirs such that the pressure is higher there than at the sample waste reservoir ( 35 ) to create a focused sample stream at the junction between the sample and separation channels. In a second step, the pressure at the sample reservoir ( 30 ) is reduced in order to pneumatically inject the sample plug into the separation channel. The waste reservoir ( 35 ) may be connected to a pressure reducing device ( 91 ). The methods, systems and devices are particularly suitable for use with a mass spectrometer ( 200 i ). RELATED APPLICATIONS This application claims priority to and is a continuation in part of U.S. patent application Ser. No. 14/987,326 filed Jan. 4, 2016, which is a continuation application of U.S. patent application Ser. No. 14/708,906 filed May 11, 2015, the contents of which are hereby incorporated by reference as if recited in full herein. STATEMENT OF FEDERAL SUPPORT This invention was made with government support under Grant No. GM066018 awarded by the National Institutes of Health and Grant No. W911NF-12-1-0539 awarded by the United States Army. The United States government has certain rights in the invention. FIELD OF THE INVENTION This invention is related to microfluidic sample processing that may be particularly suitable for electrospray ionization and/or sample processing systems that interface with mass spectrometers. BACKGROUND OF THE INVENTION Electrospray ionization (“ESI”) is an important technique for the analysis of biological materials contained in solution by mass spectrometry. See, e.g., Cole, R. B. Electrospray Ionization Mass Spectrometry: Fundamentals, Instrumentation & Applications; John Wiley and Sons, Inc.: New York, 1997. Electrospray ionization was developed in the late 1980s and was popularized by the work of Fenn. See, e.g., Fenn J B, Mann M, Meng C K, Wong S F & Whitehouse C M (1989), Electrospray ionization for mass-spectrometry of large biomolecules, Science 246, 64-71. Simplistically, electrospray ionization involves the use of electric fields to disperse a sample solution into charged droplets. Through subsequent evaporation of the droplets, analyte ions contained in the droplet are either field emitted from the droplet surface or the ions are desolvated resulting in gas phase analyte ions. The source of the liquid exposed to the electric field and to be dispersed is ideally one of small areal extent as the size of the electrospray emitter directly influences the size of droplets produced. Smaller droplets desolvate more rapidly and have fewer molecules present per droplet leading to greater ionization efficiencies. These ions can be characterized by a mass analyzer to determine the mass-to-charge ratio. Further analyte structural information can be obtained by employing tandem mass spectrometry techniques. Separation of analytes prior to electrospray ionization is important for minimizing ionization suppression and MS spectral complexity. Microfluidic capillary electrophoresis with integrated electrospray ionization has been demonstrated as a fast and efficient method of coupling a liquid phase chemical separation with mass spectroscopy detection. See, e.g., Anal. Chem. 2008, 50, 6881-6887; and Anal. Chem. 2015, 87, 2264-2272. Conventional microfluidic methods that employ electrokinetic flow of sample into the separation channel are subject to injection bias and cannot effectively be used for some on-device sample focusing methods. Further, the injection of a well-defined band of sample into the separation channel of the microfluidic device can be important to achieve an efficient separation. Summary of Embodiments of the Invention Embodiments of the invention provide simple, pressure-driven injection methods that can independently be applied to a plurality of different fluid reservoirs. Precise volumes of sample can be delivered into the separation and injection bias can be reduced or even eliminated. In some embodiments, the pressure-driven injection methods can also be used with on-device sample focusing methods such as transient isotachophoresis. The pressure-driven injection method has advantages over other microfluidic injection methods in that it can use a simple channel geometry, but it is capable of generating any desired sample plug size (i.e., volume) by simply adjusting the injection time and/or pressure. As the methods do not use voltage differentials for sample injection, they can be free of electrokinetic injection bias; furthermore, the step of applying a voltage to the sample reservoir, as occurs in some injection methods, can be omitted. The methods are suitable for performing online sample concentration methods such as transient isotachophoresis (tITP), because sample plugs with significantly different properties (electrical conductivity, pH, and/or viscosity) compared to the background electrolyte can be injected to equal extents, i.e., volumes and/or plug lengths. Embodiments of the invention are directed to methods of sample processing. The methods include: (a) providing a microfluidic device with at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir and a sample reservoir having a sample channel that merges into the separation channel; (b) injecting a fluid sample from the sample reservoir into the separation channel downstream of the BGE reservoir by concurrently applying a defined pressure to the BGE reservoir and a defined pressure to the sample reservoir; (c) then clearing a trailing end of the sample from the sample channel and flowing fluid from the BGE reservoir to deliver a plug of the sample in the separation channel in response to reducing or removing the pressure applied to the sample reservoir while applying pressure to the BGE reservoir so that pressure applied to the BGE reservoir is greater than pressure then applied to the sample reservoir; and then (d) electrophoretically separating the delivered sample in the separation channel by-applying voltage to the BGE reservoir and a downstream location of the separation channel. The injecting, clearing and electrophoretic separation can be carried out without applying a voltage to the sample reservoir. The electrophoretic separation can be carried out by further reducing or removing pressure applied to the BGE reservoir while applying electrokinetic voltage. The method can also include electronically adjusting a duration of the pressure or increasing or decreasing the pressure applied to the sample reservoir and/or BGE reservoir for the injecting and/or clearing to adjust a size of the plug of the sample delivered to the separation channel. Other embodiments are directed to methods of sample processing. The methods include: providing a microfluidic device with at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, a waste reservoir connected to the separation channel through a waste channel, and a sample reservoir connected to the separation channel through a sample channel; injecting a fluid sample from the sample reservoir into the at least one separation channel by concurrently applying pressurized gas to the BGE reservoir, the sample reservoir and optionally the waste reservoir; delivering fluid from the BGE reservoir into the at least one separation channel to define a plug of the sample in the at least one separation channel by reducing a gas pressure in the sample reservoir, so that a gas pressure in the BGE reservoir is greater than the gas pressure in the sample reservoir; electrophoretically separating an analyte component of the sample from other sample components in the at least one separation channel by generating an axial electric field within the separation channel; and performing at least one of: (a) electrospraying the separated analyte component from at least one emitter in fluid communication with the at least one separation channel; and (b) measuring an electrical signal corresponding to the separated analyte component in or emerging from the separation channel. The injection of the fluid sample, delivery of fluid from the BGE reservoir, and electrophoretic separation of the analyte component can be carried out without applying voltage to the sample reservoir and with no electrical potential gradient in the sample channel. During fluid delivery from the BGE reservoir, the gas pressure in the BGE reservoir is a first gas pressure, and the method can further include performing the electrophoretic separation by: reducing the gas pressure in the BGE reservoir to a second gas pressure less than the first gas pressure; and applying an electrokinetic voltage to the separation channel. The method can include performing the electrophoretic separation by: terminating the application of pressurized gas to the BGE reservoir; an applying a voltage to the fluid in the BGE reservoir. The method can include adjusting a time period over which the pressurized gases are applied to at least one of the sample reservoir and the BGE reservoir during the injection of the fluid sample. The method can include controlling a time period over which the pressurized gases are applied to the BGE reservoir and a magnitude of the gas pressure within the BGE reservoir to control a volume of the sample plug in the at least one separation channel. The method can include terminating the application of pressurized gas to the sample reservoir during delivery of fluid from the BGE reservoir into the at least one separation channel. The method can include electrospraying the separated analyte component from the at least one emitter toward at least one of a collection device for subsequent analysis of the analyte component or an entrance inlet of a mass spectrometer. The electrospraying can be carried out using a pump connected to the at least one separation channel through at least one pump channel to discharge the analyte component through the at least one emitter. The gas pressures within the BGE reservoir and the sample reservoir during the injection of the fluid sample can each be between 0.1 psi and 50 psi. The gas pressure within the sample reservoir during the injection of the fluid sample can be between 0.5 psi and 50 psi. A gas pressure within the waste reservoir during the injection of the fluid sample can be lower than the gas pressure within the sample reservoir (and may optionally be at a vacuum pressure). The method can include reducing the gas pressure in the sample reservoir during the delivery of fluid from the BGE reservoir by venting pressurized gas from the sample reservoir. During the injection of the fluid from the BGE reservoir, the gas pressures in the BGE reservoir and in the sample reservoir can each be between 0.5 psi and 50 psi and a gas pressure in the waste reservoir can be lower than the gas pressures in the sample and BGE reservoirs. During the injection of the fluid from the BGE reservoir, the gas pressure in the BGE reservoir can be between 0.1 psi and 10 psi, and the application of pressurized gas to the sample reservoir and to the waste reservoir can be terminated. During the injection of the fluid from the BGE reservoir, the gas pressures in the sample reservoir and the BGE reservoir can be maintained for a time period of between 1 second and 30 seconds. The method can further include: providing a first pressurized gas supply tube in communication with a first pressurized gas supply, a first valve, and the BGE reservoir; providing a second pressurized gas supply tube in communication with the first pressurized gas supply or with a second pressurized gas supply, a second valve, the sample reservoir; providing a third pressurized gas supply tube in communication with a pressure reducing device, a third valve, and the waste reservoir; and opening and closing the first, second and third valves in to perform the injection of the fluid from the BGE reservoir. The BGE reservoir can be in fluid communication with a BGE channel connected to the separation channel at a first location and the sample channel can be connected to the separation channel at a second location. The second location can be adjacent or downstream from the first location along the at least one separation channel. The sample channel and waste channel can define a continuous flow path intersecting with, and orthogonal to, the at least one separation channel. The flow path can intersect the at least one separation channel at a location that is downstream from the BGE reservoir along the at least one separation channel. The method can include, following the electrospraying of the separated analyte component, introducing the electrosprayed analyte component into a mass spectrometer, detecting one or more signals corresponding to the analyte component using the mass spectrometer, and generating at least one electropherogram corresponding to the analyte component. The method can include injecting the fluid sample without introducing electrokinetic injection bias so that the electrophoretic separation of the analyte component is not affected by electrokinetic injection bias. The plug of the sample in the at least one separation channel can include an electrolyte that has an electrophoretic mobility greater than an electrophoretic mobility of the analyte component of the sample. The sample can include one or more of amino acids, polar metabolites, charged molecules, molecules with electrophoretic mobility, peptides, proteins, and molecules extracted from one or more of biofluids, blood, serum, urine, dried blood, cell growth media, lysed cells, environmental samples, beverages and food. Other embodiments are directed to microfluidic analysis systems. The systems include a microfluidic device having at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, a sample reservoir connected to the at least one separation channel through a sample channel, and a waste reservoir connected to the at least one separation channel through a waste channel. The systems also include: (a) a first pressurized gas supply conduit in communication with the BGE reservoir, a first pressurized gas supply, and a first valve, and a voltage input having an electrode that extends into the BGE reservoir; (b) a second pressurized gas supply conduit in communication with the sample reservoir, the first pressurized gas supply or a second pressurized gas supply, and a second valve; (c) a third pressurized gas supply conduit in communication with the waste reservoir and a third valve; and (d) a controller in communication with a voltage source and with the first, second and third valves, and configured so that during operation of the system, the controller activates the first, second and third valves to control gas pressures in the BGE reservoir, the sample reservoir and the waste reservoir to: inject a fluid sample from the sample reservoir into the at least one separation channel; and electrophoretically separate an analyte component of the sample from other sample components in the at least one separation channel. The gas pressures in the BGE reservoir and the sample reservoir are higher than the gas pressure in the waste reservoir during the sample injection. No electrokinetic voltage is used to inject the sample into the at least one separation channel. The controller can be configured to control the gas pressures in the BGE reservoir, the sample reservoir and the waste reservoir so that during injection of the sample, the gas pressures in the BGE reservoir and in the sample reservoir are each between 0.1 psi and 50 psi for a duration of between 1 second and 30 seconds. The microfluidic device can include at least one pump in communication with the at least one separation channel and at least one emitter. During operation of the system, the analyte component can be discharged from the at least one emitter. The controller can be configured so that during operation of the system: (i) gas pressures of between 0.1 psi and 50 psi are concurrently maintained in the BGE reservoir and in the sample reservoir to inject the fluid sample into the at least one separation channel; (ii) the gas pressure is reduced in the sample reservoir so that the gas pressure in the BGE reservoir is greater than the gas pressure in the sample reservoir, thereby delivering fluid from the BGE reservoir into the at least one separation channel to define a plug of the sample in the at least one separation channel; and (iii) the gas pressure is reduced in or removed from the BGE reservoir, and an electrokinetic voltage is applied to the microfluidic device to perform the electrophoretic separation. The first and second valves can be three-way valves that can be configured to vent pressurized gas into respective first and second supply lines in response to a control signal from the controller. The system can include an optical detector positioned so that as the analyte component flows through the at least one separation channel, the optical detector can measure radiation from the analyte component. Still other embodiments are directed to mass spectrometer systems. The systems include: a mass spectrometer and a microfluidic device onboard or in communication with the mass spectrometer. The microfluidic device includes at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, a sample reservoir connected to the at least one separation channel through a sample channel, and optionally a waste reservoir connected to the at least one separation channel through a waste channel. The systems also include: (a) a first gas conduit in communication with a first valve and the BGE reservoir; a voltage input comprising an electrode extending into the BGE reservoir; (b) a second gas conduit in communication with a second valve and the sample reservoir; and optionally (c) a third gas conduit in communication with a third valve and the waste reservoir. The systems also include a voltage source in communication with the voltage input; at least one pressurized gas source in fluid communication with the first and second gas supply conduits; an optional pressure reducing device in fluid communication with the third gas conduit; and a controller connected to the first and second valves and optionally the third valve, and to the voltage source, and configured so that during operation of the system, the controller: (i) activates at least one of the first and second valves, and optionally the third valve, to inject a fluid sample from the sample reservoir into the at least one separation channel without applying a voltage gradient to the fluid sample; (ii) activates at least one of the first and second valves and optionally the third valve to deliver fluid from the BGE reservoir into the at least one separation channel to define a plug of the sample in the at least one separation channel; and (iii) applies an axial electric field to the sample in the at least one separation channel to electrophoretically separate an analyte component from other components of the sample in the at least one separation channel. The controller can be configured to inject the fluid sample by maintaining the BGE reservoir at a first gas pressure, maintaining the sample reservoir at a second gas pressure, and maintaining the waste reservoir at a third gas pressure smaller than the first and second gas pressures, for a first time interval. The controller can be configured to deliver the fluid from the BGE reservoir by maintaining the BGE reservoir at the first gas pressure, and the sample reservoir at a fourth gas pressure smaller than the first gas pressure, for a second time interval. The controller can be configured to reduce the gas pressure in the BGE reservoir by venting pressurized gas from the BGE reservoir before or during the electrophoretic separation. The first and second valves can be three-way valves configured to vent pressurized gas from the BGE and sample reservoirs respectively. The controller can be configured control gas pressures in the BGE and sample reservoirs by venting pressurized gas from the reservoirs within 0.1-3 seconds by activating the first and second valves. The system can include at least one electrospray ionization emitter and at least one pump in communication with the at least one electrospray ionization emitter and the controller. During operation of the system, the controller can be configured to operate the pump to electrospray the separated analyte component from the at least one separation channel through the at least one electrospray ionization emitter. During operation of the system, the controller can be configured to adjust a duration of at least one of the first and second time periods to control a volume of the sample plug. The first and second gas pressures can each be between 0.1 psi and 50 psi. The eletrophoretic separation can be carried out by removing pressure applied to the BGE reservoir while applying (electrokinetic) voltage to the BGE reservoir. The systems and methods can electronically adjusting a duration of the pressure applied to the sample reservoir and/or BGE reservoir for the injecting step. The systems and methods can include controlling a duration and magnitude of the pressure applied to the BGE reservoir to adjust a size of the plug of the sample delivered to the separation channel. The clearing the trailing end of the sample to deliver the plug of the sample into the separation channel can be carried out by removing the pressure applied to the sample reservoir while applying the pressure to the BGE reservoir. The pressure applied to the sample reservoir during the injecting step can be between 1 and 10 psi. The reducing or removing the pressure applied to the sample reservoir during the clearing step can be carried out by venting the pressurized gas in the sample reservoir headspace gas (typically to atmosphere, but other venting arrangements may be used). Yet other embodiments are directed to microfluidic analysis systems that include a microfluidic device comprising at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, and a sample reservoir having a sample channel that merges into the separation channel and a sample waste channel that merges into the separation channel. The systems also include a first pressure supply tube in communication with a pressurized gas supply and a first valve, the tube having a voltage input attached to the BGE reservoir. The systems also include a second pressure supply tube in communication with a pressurized gas supply and a second valve attached to the sample reservoir. The systems also include a controller in communication with a voltage source (typically for a high voltage input), and the first and second valves (and optionally at least one pressurized gas supply for the first/second supply tubes) configured to direct the first and second valves to open and close to carry out a respective sample injection into the at least one separation channel, then the electrophoretic separation. Sample injection can be carried out using only pressure applied to the BGE reservoir and sample reservoir from the first and second supply tubes without any electrokinetic voltage. The controller can be configured to have a defined timing sequence for applying pressures between 0.1 and 50 psi to a headspace of the BGE reservoir via the first supply tube and to a headspace of the sample reservoir via the second supply tube for defined durations between 1 and 30 seconds to inject a respective sample into the at least one separation channel. The controller can be configured to independently apply a defined pressure to the sample reservoir and a defined pressure to the BGE reservoir. The microfluidic device can include at least one pump channel (for example, but not limited to, an EO pump channel) in communication with the separation channel and/or at least one emitter for causing the separated sample to electrospray out of the at least one emitter toward a collection device for subsequent analysis and/or toward an entrance of a mass spectrometer. The controller can be configured to concurrently supply pressure that is between 0.1 psi and 50 psi to the BGE reservoir and the sample reservoir, then reduce or remove the pressure applied to the sample reservoir while applying pressure to the BGE reservoir so that pressure applied to the BGE reservoir is greater than any pressure then applied to the sample reservoir to clear a trailing end of the sample from the sample channel and flow fluid from the BGE reservoir to thereby deliver a plug of the sample in the separation channel in response. The controller can be configured to then further reduce or removes pressure applied to the BGE reservoir while applying a voltage to the BGE reservoir and a downstream location of the separation channel for the electrophoretic separation, all without applying any voltage to the sample reservoir. The first and second valves can be three-way valves that can vent pressurized gas in respective first and second supply lines in response to a control signal from the controller. Yet other embodiments are directed to mass spectrometer analyzer systems with a mass spectrometer with an entrance and a microfluidic device onboard or in communication with the mass spectrometer. The microfluidic device includes at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, a sample reservoir having a sample channel that merges into the separation channel and a sample waste channel that merges into the separation channel. The systems further include a first pressure supply tube attached to the BGE reservoir and in communication with a pressurized gas supply and a first valve. The systems also include a voltage input attached to the BGE reservoir and a second pressure supply tube in communication with a pressurized gas supply and a second valve attached to the sample reservoir. The systems also include at least one power source in communication with the BGE reservoir for providing the voltage input and at least one pressure source in fluid communication with the first and second pressure supply tubes. The systems also include at least one controller configured to control the at least one power source for application of an electric field to the microfluidic device and to control pressures supplied to respective headspaces of the sample reservoir and BGE reservoir. Loading of samples into the separation channel can be performed using pressure without any voltage applied to the BGE reservoir and sample reservoir of the microfluidic device. The first and second valves can be three-way valves that can controllably vent respective headspace pressure. It is noted that aspects of the invention described with respect to one embodiment, may be incorporated in a different embodiment although not specifically described relative thereto. That is, all embodiments and/or features of any embodiment can generally be combined in any way and/or combination as appropriate, unless stated otherwise. Applicant reserves the right to change any originally filed claim and/or file any new claim accordingly, including the right to be able to amend any originally filed claim to depend from and/or incorporate any feature of any other claim or claims although not originally claimed in that manner. These and other aspects are explained in detail in the specification set forth below. Further features, advantages and details will be appreciated by those of ordinary skill in the art from a reading of the figures and the detailed description of the embodiments that follow, such description being merely illustrative of the disclosure. BRIEF DESCRIPTION OF THE DRAWINGS FIGS. 1A-1C are schematic illustrations of a sequence of actions used to inject sample into a separation channel of a microfluidic device. FIGS. 2A-2C are schematic illustrations of the same microfluidic device shown in FIGS. 1A-1C, but illustrating prior art electrokinetic injection of a sample. FIG. 3 is a schematic illustration of an embodiment of a microfluidic device that can be used with pressure-driven injection. FIGS. 4A-4E are schematic illustrations of embodiments of microfluidic devices that can be configured for pressure-driven injection. FIG. 5A is a schematic illustration of an example of a gas-tight connection with a pressurized supply line for the background electrolyte (BGE) reservoir according to embodiments of the present invention. FIG. 5B is a schematic illustration of another example of a gas-tight connection between a pressurized supply line and a background electrolyte (BGE) reservoir. FIGS. 6A-6C are schematic illustrations of embodiments of microfluidic devices, showing various stages of injecting and separating samples. FIG. 6D is a schematic illustration of a microfluidic device similar to FIG. 6A and including a detector. FIG. 7A is a schematic illustration of a microfluidic system. FIG. 7B is a schematic illustration of another embodiment of a microfluidic system. FIG. 8 is an example of a timing chart showing pressures applied to the reservoirs of a microfluidic device for injecting a sample in to a separation channel. FIG. 9A is a schematic illustration of a portable mass spectrometry (MS) device with an onboard microfluidic system that implements pressure-driven injection of samples. FIG. 9B is a schematic illustration of a MS in communication with a microfluidic device. FIG. 10 is a flow chart of exemplary operations that can be used to carry out pressure-driven injection, separation, and analysis of a sample. FIG. 11 is a block diagram of a data processing system that can be implemented as part of the devices and systems disclosed herein. FIGS. 12A and 12B are electropherograms for a microfluidic CE-ESI-MS (Capillary Electrophoresis-Electrospray Ionization-Mass Spectrometry) analysis of an amino acid mixture prepared in a background electrolyte (BGE) solution with no salt added to the solution. FIG. 12A (the top electropherogram) was obtained using an electrokinetically gated injection of the mixture. FIG. 12B (the bottom electropherogram) was obtained from pressure driven injection of the mixture with a loading time of 3 seconds at 2 psi. FIG. 13 is a graph showing peak area ratio versus capillary electrophoresis migration time from electrokinetically gated injection of a sample relative to peak areas from pressure-driven injection of the sample. FIGS. 14A and 14B are electropherograms obtained from microfluidic CE-ESI-MS analysis of an amino acid mixture prepared in BGE solution with 100 mM sodium chloride added to the solution. FIG. 14A (the top electropherogram) was obtained using an electrokinetically gated injection of the mixture. FIG. 14B (the bottom electropherogram) was obtained from a pressure driven injection of the mixture with a loading time of 3 seconds at 2 psi. FIGS. 15A and 15B are electropherograms of base peak index as a function of time for different injection times (3 seconds, 5 seconds and 10 seconds). FIG. 15A (on the left) shows the effect of increased sample loading when the leading electrolyte concentration is too low to support tITP, with no salt added to the BGE. The electropherograms in FIG. 15B (on the right) show that tITP leads to sharp peaks of increasing concentration when larger amounts of a sample containing a sufficient concentration of leading electrolyte are loaded. This sample contained 100 mM sodium chloride. FIGS. 16A and 16B are electropherograms for tITP-CE-ESI-MS separation and analysis of amino acid samples with two different leading electrolytes added to the sample. FIG. 16A (the top electropherogram) was obtained for a sample injected with 100 mM sodium chloride. FIG. 16B (the bottom electropherogram) was obtained for a sample injected with 100 mM ammonium acetate. Both samples were injected for 10 seconds at 2 psi. The present invention will now be described more fully hereinafter with reference to the accompanying figures, in which various embodiments are shown. This disclosure may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Like numbers refer to like elements throughout. In the figures, certain layers, components or features may be exaggerated for clarity, and broken lines illustrate optional features or operations unless specified otherwise. In addition, the sequence of operations (or steps) is not limited to the order presented in the figures and/or claims unless specifically indicated otherwise. In the drawings, the thickness of lines, layers, features, components and/or regions may be exaggerated for clarity and broken lines illustrate optional features or operations, unless specified otherwise. The abbreviations “FIG. and “Fig.”) for the word “Figure” can be used interchangeably in the text and figures. DETAILED DESCRIPTION The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms, “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises,” “comprising,” “includes,” and/or “including” when used in this specification, specify the presence of stated features, regions, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, regions, steps, operations, elements, components, and/or groups thereof. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items. As used herein, phrases such as “between X and Y” and “between about X and Y” should be interpreted to include X and Y. As used herein, phrases such as “between about X and Y” mean “between about X and about Y.” As used herein, phrases such as “from about X to Y” mean “from about X to about Y.” It will be understood that when a feature, such as a layer, region or substrate, is referred to as being “on” another feature or element, it can be directly on the other feature or element or intervening features and/or elements may also be present. In contrast, when an element is referred to as being “directly on” another feature or element, there are no intervening elements present. It will also be understood that, when a feature or element is referred to as being “connected”, “attached” or “coupled” to another feature or element, it can be directly connected, attached or coupled to the other element or intervening elements may be present. In contrast, when a feature or element is referred to as being “directly connected”, “directly attached” or “directly coupled” to another element, there are no intervening elements present. Although described or shown with respect to one embodiment, the features so described or shown can apply to other embodiments. Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the present application and relevant art and should not be interpreted in an idealized or overly formal sense unless expressly so defined herein. Well-known functions or constructions may not be described in detail for brevity and/or clarity. Spatially relative terms, such as “under”, “below”, “lower”, “over”, “upper” and the like, may be used herein for ease of description to describe one element or feature's relationship to another element(s) or feature(s) as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations of the device in use or operation in addition to the orientation depicted in the figures. For example, if the device in the figures is inverted, elements described as “under” or “beneath” other elements or features would then be oriented “over” the other elements or features. Thus, the exemplary term “under” can encompass both an orientation of over and under. The device may be otherwise oriented (rotated 90 degrees or at other orientations) and the spatially relative descriptors used herein interpreted accordingly. Similarly, the terms “upwardly”, “downwardly”, “vertical”, “horizontal” and the like are used herein for the purpose of explanation only unless specifically indicated otherwise. It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, components, regions, layers and/or sections, these elements, components, regions, layers and/or sections should not be limited by these terms. These terms are only used to distinguish one element, component, region, layer or section from another region, layer or section. Thus, a first element, component, region, layer or section discussed below could be termed a second element, component, region, layer or section without departing from the teachings of the present invention. The term “about” means that the stated number can vary from that value by +/−20%. The term “analyte” refers to a molecule or substance undergoing analysis, typically, at least for mass spectrometry analysis, having an ion or ions of interest in a mass-to-charge (m/z) range of interest. The analyte can comprise biomolecules such as polymers, peptides, proteins and the like. Embodiments of the invention are particularly suitable for analyzing intact monoclonal antibodies. Embodiments of the invention are particularly suitable for analyzing metabolites. The term “separated sample” refers to the electrophoretically separated components of a sample mixture (i.e., spatially separated along the axial extent of the separation channel) and may or not be separated into individual components. Components will be separated based upon their effective electrophoretic mobilities and separation of components will depend on the difference in effective mobilities. The separated sample can be detected by observing the spatial separation in the separation channel or by observing the arrival times of the components at the electrospray emitter or detector. Effective electrophoretic mobility is defined as the observed velocity in the separation channel divided by the electric field strength in the separations channel and includes the actual electrophoretic mobility and the vector sum of any other effect imparting velocity to the component including but not limited to electroosmotic or pressure driven transport. The “sample” can include a collection of one or more different components (i.e., an analyte and surrounding matrix material). The sample is introduced into the fluidic device. During separation, an “analyte component” of the sample can be separated for analysis, apart from other components. The term “microfluidic chip” refers to a substantially planar, thin, and, in some embodiments, rigid device. The term “thin” refers to a thickness dimension that is less than about 10 mm, typically about 1 mm or less. The microchip typically has a width and length that is less than about 6 inches and a thickness that is less than about 5 mm, typically between about 2000 μm to about 250 μm. The term “pre-concentration” refers to one or more steps that are performed to increase a local concentration of an analyte relative to a concentration at introduction to a fluidic analysis device or system so that a sample with the analytes is processed, typically prior to introduction into a separation channel, to contain analytes at higher concentrations relative to concentration(s) when introduced to the system, device, or process, i.e., as introduced to a sample channel or reservoir upstream of the separation channel. The term “pre-concentrating” refers to processes, typically on-chip processes, that achieve the pre-concentration. Where electrokinetic techniques are used, the pre-concentrating can be referred to as “focusing.” The terms “integrated” and “integral” and variations thereof means that the component or process is incorporated into or carried out by a fluidic device. The term “high voltage” refers to voltage in the kV range, i.e., at least 1 kV, typically between about 1-100 kV, more typically between about 1-20 kV. ESI processes can employ potentials of a few kVs, typically between about 1 kV to about 5 kV, for example. Although other voltages may be appropriate. The term “microfluidic” refers to fluid flow channels that have sub-millimeter or smaller width and/or depth (e.g., the term includes nanometer size channels) and includes channels with width or depth in a size range of about tens to hundreds of microns. As used herein, the “width” of a respective channel, such as channel 31, is measured in the plane of device 10 (i.e., in the plane defined by the microfluidic chip) and in a direction that is perpendicular to an axis of the channel along which fluid flow occurs through a respective channel in a direction parallel to the axis. As used herein, the “depth” of a channel is measured in a direction perpendicular to the plane of device 10 and to the direction along which the width is measured. The term “defined” when used with a numerical value of an input such as voltage, time or pressure refers to user or system adjustable values as well as preset, “hard-coded” or programmed values. All of the document references (patents, patent applications and articles) are hereby incorporated by reference as if recited in full herein. In typical free zone capillary electrophoresis (CE) experiments, a sample plug is injected into a column, and an applied electric field causes sample components to separate according to differences in their mobilities. The mobility of a molecule is the sum of its electrophoretic mobility and the electroosmotic mobility, and any pressure driven flow, if present, of the separation column. The term “plug” with respect to “sample” refers to a quantity of a sample collected/localized within a spatial region, such as within a spatial region of a carrier fluid. The plug can be a physical band or segment with defined leading and trailing ends so that there is a distinct clearance between successive plugs or bands. The analyte in a sample can be any analyte of interest including, for example, various mixtures including synthetic and biological macromolecules, nanoparticles, small molecules, DNA, nucleic acids/polynucleic acids, peptides, proteins and the like. The sample can include one or more polar metabolites such as amino acids or charged molecules, molecules, peptides, and proteins. The sample may also or alternatively include molecules extracted from biofluids, blood, serum, urine, dried blood, cell growth media, lysed cells, beverages or food; or environmental samples such as water or soil. As shown in FIGS. 2A-2C, electrokinetic (EK) gate methods—which use a sequence of different voltages applied to a microfluidic device 10—have been used for sample injection. Generally stated, in the systems and methods disclosed herein, differential pressure is used to inject samples into a microfluidic device 10 for microchip capillary electrophoresis (CE). The pressure-drive method has advantages over other microfluidic injection methods such as voltage-driven loading methods, in that it can use a simple channel geometry, but is capable of generating desired sample plug (Sp) sizes by simply adjusting the injection time and/or pressure applied to the reservoirs 20, 30. The methods can also typically be free of eletrokinetic injection bias and no voltage is required to be applied to the sample reservoir 30. Electrophoretic separation of the analyte component from the sample once loaded can include reducing the pressure applied to the sealed headspace of the BGE reservoir and applying an electrical potential difference between a first position in the BGE reservoir and a second position downstream from the first position, when the sample is in the separation channel. The sample can be introduced into the separation channel 25 without applying an electrokinetic voltage and/or voltage gradient across the sample channel 31. The sample can be flowed through the sample channel 31 without applying a voltage to the sample reservoir 30, to the BGE reservoir 20, or to the waste reservoir 35 and/or with no electric potential gradient in any of the sample channel 31, the BGE channel 21 and the waste channel 32. The pressure-driven injection methods disclosed herein can be particularly suitable for performing online sample concentration methods such as transient isotachophoresis (tITP), because sample plugs Sp with significantly different properties (electrical conductivity, pH, or viscosity) compared to the background electrolyte can be injected. Salt or other electrolyte material in the sample/sample reservoir 30 can be used for tITP. Pressure-driven operation can be used to position a well-defined band of sample (sample plug Sp) into the separation channel 25 of the microfluidic device using only pressure-driven flow and can also be used for online sample focusing methods that are not possible by other microfluidic injection methods. FIGS. 1A and 1B illustrate pressure-driven injection of a sample into a microfluidic device while FIGS. 2A and 2B illustrate voltage driven/gated methods of injection by way of comparison. FIGS. 1C and 2C illustrate, respectively, subsequent transport/separation in a transport channel 25 of the microfluidic device. The noted voltages (and polarity) in FIGS. 2A-2C are also by way of example. Referring to FIGS. 1A, 1B and 1C, head pressure can be applied to at least two different fluid reservoirs 20, 30 on or in communication with microfluidic device 10, typically using off-device (e.g., off-chip) on/off valves 120, 130 (FIGS. 7A, 7B). The term “head pressure” refers to the gas pressure in a sealed headspace of the reservoir above the liquid. The head pressure of the BGE reservoir 20 is labeled P2 and the head pressure of the sample reservoir 30 is labeled P1. Where pressure is applied to the waste reservoir, the head pressure of the waste reservoir 35 is identified as P3 (FIG. 1A) and this can be applied via a pressure reducing device 91 such as a pump and/or vacuum. A controller 100 c (FIGS. 7A, 7B) can be in communication with the valves 120, 130 to independently control when the pressures P1, P2 are applied to respective reservoirs 20, 30. Thus, for sample loading, no voltage is applied to either the BGE reservoir 20 or the sample reservoir 30 (FIGS. 1A, 1B, for example). The microfluidic channels 25, 31, 32 within the device 10 can, in some embodiments, be configured to form a simple injection cross. The background electrolyte (BGE) reservoir 20 can reside at the top of the injection cross above the separation channel 25. Alternatively, the BGE reservoir 20 can reside directly adjacent the separation channel or may have a BGE flow channel 21 that merges into the separation channel 25 to position the BGE reservoir 20 a distance away from the sample channel 31 and the sample waste channel 32 that can extend to a waste reservoir 35. Referring to FIGS. 6C and 6D, the BGE channel 21 can have a length “L1” extending from the BGE reservoir 20 to the sample channel 31 and/or to the intersection of sample channel 31 and waste channel 32 with separation channel 25. The length “L1” can be any suitable length such as between 1-200 mm long. The length “L2” of the sample channel 31 extends from the sample reservoir 30 to the separation channel 25. The length “L3” of the waste channel 32 extends from the waste reservoir 35 to the separation channel 25. Also, the length L1, L2, L3 of one or more of the channels 21, 31, 32, can be any suitable length such as about 1 mm, about 5 mm, about 10 mm, about 20 mm, about 30 mm, about 40 mm, about 50 mm, about 60 mm, about 70 mm, about 80 mm, about 90 mm, or about 100 mm, in some embodiments, but other lengths can be used. Where used, the injection cross configuration may be such that channels 21, 31 and 32 have substantially the same length or different lengths, but typically lengths that are much less than the length of the separation channel 25. The sample and sample waste channels 31, 32, can be longer or shorter than the BGE channel 21 and may, for example, be between 1-20 mm long. In some embodiments, the sample and sample waste channels 31, 32 are about 8 mm in length, for example. The separation channel 25 can have any suitable length, typically between 1 cm to 100 cm, more typically between about 20-30 cm, such as about 23 cm. The fluidic (sample) channel 31 can have a width and/or depth that is between 40 nm and 1000 μm, more typically between about 1 μm and about 100 μm, such as a channel depth and width of about 10 μm (depth) and 70 μm (width), respectively. The fluidic channels 21, 31 and 32 can all have the same depth or may have different depths. The fluidic channels 21, 31 and 32 can have the same width or different widths. In the embodiments shown in FIGS. 1A, 1B and 1C, sample channel 31 and the waste channel 32 are positioned on opposite sides of the separation channel 25, and may optionally be orthogonal to and extend across to intersect the separation channel 25. The BGE reservoir 20 can be positioned at the top of the separation channel 25, and connected to separation channel 25 directly, or through BGE channel 21. In some embodiments, channels 31, 32 can be positioned so that they are offset from each other on opposite sides of separation channel 25. In some embodiments, the microfluidic devices do not include a waste channel 32. Thus, a “tee” intersection of the sample channel 31 (in lieu of the cross channel configuration) to the separation channel 25 may be used and may be implemented using a relatively precise pressure on the BGE reservoir 20 to hold that fluid stationary for injection/sample loading. Referring to FIG. 1A, pressure is initially concurrently applied to the sample reservoir 30 (P1) and the BGE reservoir 20 (P2) to drive sample from the sample reservoir 30 (shown by the hatched region and the directional arrows) into the separation channel 25 from the sample channel 31, and typically the waste channel 32, but not the BGE channel 21. When a plug of a sample Sp in the separation channel 25 reaches a desired length (typically downstream of both the BGE reservoir 20 and the sample reservoir 30), as shown in FIG. 1B, pressure P1 is decreased in sample reservoir 30, but pressure P2 is maintained in BGE reservoir 20. As shown by the arrows, BGE which flows from the BGE channel 21 clears sample in the sample and waste channels 31 and 32, leaving a defined plug of sample Sp (trailing end is separated from any adjacent sample in the channels 31, 32) in the separation channel 25. This pressure drive/injection is carried out without applying a voltage to the sample reservoir 30. At this point, as shown in FIG. 1C, the pressure P2 is reduced in BGE reservoir 20, and a voltage is applied to sample plug Sp between the BGE reservoir 20 and the separation channel 25 at a downstream location, typically at an end portion or terminus of the separation channel 25, to perform an electrophoretic separation. The voltage applied to the BGE reservoir 20 can be a high voltage HV as shown, although lower voltages may be used in some embodiments. The voltage V applied downstream can be a lower voltage than the voltage applied to the BGE reservoir 20. The lower voltage V can be between 10%-50% of the BGE reservoir voltage. Applied voltages can vary according to the sample that is analyzed and other conditions of the analytical method. For example, HV typically ranges from about +1 kV to +30 kV, and V typically ranges from 0 to +4 kV. But, the applied voltages and polarity can vary for different applications. For example, the polarity of the separation could be reversed so that the high voltage input shown in FIG. 1C is negative, or closer to zero (0) and the opposing voltage (shown in FIG. 1C as the “low voltage” input) could be higher or even negative depending on the relative length of the microfluidic channels, the charge of the analytes, and the polarity of the ESI process. The pressures applied to the headspaces of the reservoirs, i.e., reservoirs 20, 30 can be low pressures, such as between 0.1 psi and 50 psi, typically between 0.5 and 30 psi, and more typically between about 1 psi and about 12 psi, such as about 0.5 psi, about 1 psi, about 1.5 psi, about 2 psi, about 2.5 psi, about 3 psi, about 3.5 psi, about 4 psi, about 4.5 psi, about 5 psi, about 5.5 psi, about 6 psi, about 6.5 psi, about 7 psi, about 8 psi, about 8.5 psi, about 9 psi, about 9.5 psi, about 10 psi, about 10.5 psi, about 11 psi, about 11.5 psi and about 12 psi. It should be understood that above and elsewhere in this disclosure, exemplary pressure values (e.g., 0.1-50 psi) in the headspaces of reservoirs are relative to atmospheric pressure, not absolute pressures, unless expressly noted otherwise. It should also be understood that “reducing” pressure can include removing the applied pressure altogether, so that the headspace pressure in a reservoir is equal to atmospheric pressure. Using devices such as pumps, headspace pressures in a reservoir can also be reduced to values less than atmospheric pressure. The pressures can be controlled through respective gas supply lines 70 sealably attached to respective reservoirs 20, 30, typically conduits or lengths of tubing from at least one pressurized gas source 90 (FIGS. 7A, 7B, 9A, 9B). The pressurized gas for implementing pressure-driven injection can include air, noble gases such as helium or nitrogen, and/or other inert gases. As shown in FIG. 7A, a pressurized gas supply line 70 3 can also be attached to the waste reservoir 35. The pressurized gas supply line 70 3 can also be in fluid communication with a valve 135 and a pressure reducing device 91, typically a pump and/or vacuum as discussed further below. In FIG. 7A, discrete valves 120, 130, 135 are connected to pressurized gas supply lines 70 2, 70 1, 70 3, respectively. In some embodiments, any or all of valves 120, 130, 135 are three-way valves. In some embodiments, the pressure applied concurrently to the BGE reservoir 20 and the sample reservoir 30 for the injection (FIG. 1A) is between 0.5 psi and 50 psi, typically between about 0.5 psi and about 30 psi, more typically between about 1 and 12 psi, for between 1-5 seconds. Then, to clear the tail end of the sample (FIG. 1B) from the sample channel 31, the pressure in the BGE reservoir 20 can be held the same or reduced by 10-80%, such as to a pressure of between about 0.1 psi and about 10 psi, and the pressure in the sample reservoir 30 can be reduced more than the reduction in the pressure of the BGE reservoir 20, e.g., typically so that it is less than 0.1 psi, e.g., zero or at ambient or atmospheric pressure or below ambient or atmospheric pressure (e.g., partially evacuated). Where a reduced pressure is applied to the sample reservoir 35, it can be removed during the clearing. The clearing pressure on the BGE reservoir 20 can be held for a time that is less than the injection time where pressure is applied to both reservoirs 20, 30. The clearing pressure time for the pressure applied only to the BGE reservoir 20 can be 2 seconds or less, 1 second or less or 0.5 seconds, for example. FIGS. 6A-6C illustrate an exemplary sequence of operation of the valves 120, 130, 135 for injection (which can also be referred to interchangeably as “sample loading”) and clearing according to some particular embodiments of the present invention. As shown, the system 100 can include a pressure reducing device 91 such as a pump in communication with a waste reservoir 35 which may also be connected via a respective valve 135. The pressure-reducing device 91 can have an active or passive configuration, i.e., can comprise a vacuum, a pump, an evacuated reservoir, or any other enclosed volume at a pressure less than the pressure applied to the BGE reservoir 20 and/or sample reservoir 30, typically less than ambient pressure, that will reduce the pressure in the headspace of the waste reservoir 35 once connected. FIG. 6D illustrates that in some embodiments, the analysis system 100 can include the fluidic device 10 and may also include at least one detector 1200 to obtain signal from the sample in the separation channel 25. The fluidic device 10 may be configured without the at least one ESI emitter 50 and may be used without directing the input to the mass spectrometer 200. The detector 1200 can be an electronic detector such as an optical detector and/or a conductance detector (i.e., comprising an ammeter), for example. Where used, the optical detector 1200 can include a photodiode or photomultiplier tube. Other detectors that can be used include, but are not limited to, CCD detectors and CMOS detectors, and any combination of the above. Light sources that can be used with detector 1200 include, but are not limited to, lasers, LED sources, fluorescent lamps, flashlamps, metal-halide lamps, incandescent sources, discharge sources, and blackbody radiation sources. In general, detector 1200 obtains signals from a sample in the separation channel 25. In some embodiments, the analysis system 100 can include both the at least one detector 1200 and the at least one ESI emitter 50 for input to the inlet/entrance aperture of the mass spectrometer 200. In some embodiments, both mass spectrometer detection and optical detection by the detector 1200 can be carried out simultaneously, i.e., signal from a sample discharging from the ESI emitter 50 into the inlet of the mass spectrometer 200 can be obtained while signal from the detector 1200 is obtained for the same sample. In some embodiments, each of the sample reservoir 30, the BGE reservoir 20, and the waste reservoir 35 can be maintained at a common electrical potential as the sample is flowed through the sample channel using only pressure-driven operation so as to not apply an electrokinetic voltage, since these reservoirs are at the same electrical potential in the absence of an external field. Thus, no electrokinetic voltage drive is used (for either a common potential or a zero potential configuration). In contrast, conventionally, an electrokinetic voltage gradient is used to drive the injection. As noted above, transient isotachophoresis (tITP) has been previously described as an online sample focusing method for capillary electrophoresis. This technique is particularly useful for samples that include a relatively large concentration of an electrolyte (termed the leading electrolyte) that has higher electrophoretic mobility than analyte ions in the sample. As is well known, the leading electrolyte is typically added to the sample solution prior to performing tITP. The leading electrolyte concentration is typically significantly greater (such as at least 5× or 10× greater) than the electrolyte concentration in the background electrolyte to provide a sufficient minimum conductivity difference between the background electrolyte and the leading electrolyte. Suitable conditions for implementing tITP can be realized, for exampling, by injecting samples with high concentrations of sodium chloride or other electrolytes. For example, for a pH 2.2 background electrolyte (with a hydronium ion concentration of approximately 6 mM), a 15 mM leading electrolyte concentration is too low, but concentrations at or above 50 mM are sufficient for tITP to be realized. To take advantage of the sample focusing effects of tITP, a larger band of the sample can be injected, relative to other sample processing/analysis methods. Typically, a relatively large concentration of the leading electrolyte is introduced into the sample prior to injection. In general, the pressure-driven injection methods disclosed herein allow extensive control over the size of the injected sample band, simply by changing the head pressure(s) and/or the duration of the applied pressure during the sample loading step. To introduce the leading electrolyte, the BGE reservoir 20 can include liquid electrolyte comprising sodium or salt in sufficient amount for tITP. FIG. 3 illustrates that in some embodiments, the microfluidic device 10 can include a pump 40, optionally an electroosmotic (EU) pump, and at least one electrospray ionization (ESI) emitter 50 that can spray a separated sample 50 s for analysis optionally to an inlet of an mass spectrometer 200 i and/or to a collection device 202 (FIG. 7A). The electrospray from the at least one emitter 50 can be provided to a collection device for subsequent analysis and/or toward an inlet 200 i (FIGS. 3, 6A-6C) of a mass spectrometer 200 (FIG. 9A, 9B). The separation channel 25 is shown in FIG. 3 as having a serpentine shape but more generally, separation channel 25 can have a variety of shapes in the plane of microfluidic device 10. For example, in the plane of microfluidic device 10, the geometry of the separation channel 25 can be straight or curved, and the cross-sectional profiles of the channels do not all have to be the same. For further discussion of exemplary channel geometries and other features of microfluidic devices, see, e.g., U.S. patent application Ser. Nos. 14/001,549 and 14/368,971, the entire contents of each of which are hereby incorporated by reference herein. One or both of the reservoirs 20, 30 can be in fluid communication with an external fluid source to provide fluid thereto during analysis and/or one or both of the reservoirs 20, 30 may be pre-loaded prior to active analysis. As shown in FIG. 3, in some embodiments, a fluid junction 40 j can be used to connect the separation/transfer channel 25 and respective pump channel 40 c. The fluid junctions can be nanojunctions with associated nanojunction channels having nanometer-sized depths. These fluid junctions also typically have micrometer-sized widths. For example, nanojunctions 40 j can have a depth of about 50 nm and a width of about 50 μm. The depth of the nanochannel may be selected based on the ionic strength of the buffers used in the experiment/analysis and the corresponding Debye lengths. In general, the nanochannel depth is selected to be on the order of the Debye length or smaller. FIGS. 4A-4E show further examples of microfluidic devices 10 that can be operated as described above. FIG. 4A shows a microfluidic device 10 that does not include a waste channel 32 or waste reservoir 35. FIG. 4B shows a microfluidic device 10 with a waste channel 32 offset a longitudinal distance from the sample channel 31 across the separation channel 25. FIG. 4C shows a microfluidic device 10 with a plurality of sample reservoirs 30, shown by way of example as three, 30 1, 30 2, 30 3, but more or less than three may be used. The sample reservoirs 30 can feed a common or different sample channels 31, shown in FIG. 4C as sample channels 31 1,31 2, 31 3 all for a single separation channel 25, and at least one BGE reservoir 20 (shown as a single BGE reservoir 20 and reservoir channel 21). The sample reservoirs 30 can be controlled to sequentially inject respective sample plugs into the separation channel 25. The devices 10 can optionally also have an electroosmotic (EO) pump 40. FIG. 4D illustrates an embodiment of a microfluidic device 10 that has a plurality of separation channels 25, shown as two channels, but more generally, more than two may be included on a single device 10. The separation channels 25 can feed a common emitter 50 or separate emitters. Thus, the microfluidic device 10 can include more than one separation channel and associated BGE reservoir 20, sample reservoir 30, waste reservoir 35 and cross channels 31, 32. One or more of the individual channels 21, 25, 31, 32 can have lateral dimensions of about 1-100 μm, e.g., about 75 μm and/or may be lateral spaced apart by about 1-100 mm, in some particular embodiments. In some embodiments, as shown in FIG. 4E, one or more reference channels for a reference sample may be included on/in the microfluidic device 10. Where used, the reference sample includes one or more ions for internal calibration during analysis. In some embodiments, the reference sample provides a single defined ion for internal calibration. Alternatively, in certain embodiments, the reference sample includes multiple ions over a desired range of m/z values, typically that spans an entire m/z range of interest, to improve the accuracy of subsequent mass spectrometric analysis of sample components. FIG. 5A is a schematic illustration of a BGE reservoir 20 having a gas-tight fitting holding apressurized gas supply line 70 and a (high) voltage line 75 with a (high) voltage input electrode 75 i (shown as a platinum wire) that extends inside the sealed reservoir 20 to make contact with the fluid in the reservoir 20. The term “gas-tight” means that the seal on the reservoir 20 does not unduly leak when operated so as to be able to provide the desired pressure in the headspace 20 h for pressure-driven injection of fluid from reservoir 20. As shown in FIG. 6A, the sample reservoir 30 can also have a pressurized gas supply line 70 and may be connected via a gas-tight seal. The waste reservoir 35 can also have a pressurized gas supply line 70 and may be connected via a gas-tight seal. The pressurized gas supply line 70 can be provided with tubing with an open pressurized gas path extending into the sealed headspace 20 h. For an example of an 8 mm inner diameter reservoir wall 20 w, the pressurized gas supply line can be formed by a conduit having a smaller inner diameter, e.g., ¼ inch to about 1/16 inch outer diameter. However, larger size conduits can be used and/or may be stepped down in size to connect to the reservoir. The sealed (e.g., gas-tight) connection of a respective pressurized gas supply line 70 to either reservoir 20, 30 can be provided via epoxy, O-ring, metal or elastomeric gaskets, grease fittings, and/or other suitable configurations. In some embodiments, as shown in FIG. 5B, the pressurized gas supply line 70 can be held adjacent the high voltage cable 75 in a common sleeve 80. As another alternative, the high voltage cable 75 can be held routed into the headspace while held inside the gas supply tubing. FIG. 5B also illustrates that in some embodiments, the top of the reservoir 20 t can be sealed with a cap 20 c and a side port 20 p can be used to attach the pressurized gas supply line 70 to the reservoir 20. The same arrangement can be used for the sample reservoir 30 (not shown). In some embodiments, the pressurized gas supply line 70 can be attached over the outer surface of the wall 20 w of the reservoir 20 instead of extending inside the reservoir 20 for gas-tight or sealed connection. Other connection configurations may also be used. FIG. 7A illustrates an example of a microfluidic system 100 which includes a controller 100 c used to control the pressures applied to the reservoirs 20, 30, 35 to carry out the pressure-driven injection. The system 100 can include at least first and second pressurized gas supply lines/conduits 70, shown as 70 1, 70 2, each in fluid communication with at least one valve 120, 130. The system 100 can also optionally include a third pressurized gas supply line 70 3 and a third valve 135 as discussed above. The system 100 can optionally include a single three-way valve (FIG. 7B) that closes and opens each supply line 70 1, 70 2. One or both of the valves 120, 130 as well as valve 135 can be a three-way valve (e.g., three way operation, open/close to source, open/close to head space and open/close to atmosphere) for a respective pressurized gas supply line 70 which can allow for the rapid venting of pressurized gas from a respective supply line. Thus, in operation, one or both of the valves 120, 130 can be operated to vent the head pressure in the reservoir 20, 30, to atmosphere, which may help precisely control the injection process. One or all of the pressurized gas supply lines 70 and/or reservoirs 20, 30, 35 can also or alternatively include vents (121, 131, 132) that can be electronically opened and closed, for rapid venting to atmosphere to decrease pressure in a respective headspace 20 h, 30 h, 35 h. The term “rapid” with respect to the venting or pressure reduction (e.g., venting to atmosphere) in a respective pressurized supply line 70 refers to a change in pressure of the corresponding headspace 20 h, 30 h of a respective reservoir 20, 30 to at least atmospheric pressure within 0.1-3 seconds, more typically within about 2 seconds or within about 1 second. The rapid venting can be based on a control signal from the controller 100 c that (a) directs the valve 120 or 130 or 135 to open to atmosphere (where a three-way valve is used) or (b) opens a vent (e.g., one or more of 121, 131, 132) separate from the valve 120, 130, 135 and closes the valve 120, 130, 135. The rapid pressure change (e.g., venting) in the BGE reservoir and/or sample reservoir 20, 30, can be measured by a pressure sensor in the supply line or reservoir to indicate the rapid drop in head pressure from an operating pressure to atmospheric pressure within a 0.1-2 second time period. In some embodiments, the rapid venting can be carried out in between about 0.1 seconds and 1.5 seconds, such as about 0.1 seconds, about 0.2 seconds, about 0.3 seconds, about 0.4 seconds, about 0.5 seconds, about 0.6 seconds, about 0.7 seconds, about 0.8 seconds, about 0.9 seconds, about 1 second, about 1.1 seconds, about 1.2 seconds, about 1.25 seconds, about 1.5 seconds, about 2 seconds, and about 2.5 seconds. The first and second pressurized gas supply lines 70 1, 70 2 can each be in communication with a common pressurized gas source 90, or each may be connected to a different pressurized gas source. The system 100 can include a power supply 95 for the high voltage input to the microfluidic device 10. The power supply 95 can be attached to the cable 75. The controller 100 c can direct the timing sequence of the differentially applied pressures to the microfluidic device 10. The controller 100 c communicates with the valves 120, 130, 135, with the at least one pressure source 90, with the pressure reducing device 91 (e.g., one or more pumps), and with the power supply 95. The term “controller” is used broadly to include a single or multiple processors or application specific integrated circuits (ASICs) held on a single device, e.g., the microfluidic device 10, and/or computer, laptop, notebook, smartphone and the like, or distributed in different devices using wires or wireless connections including local area networks or wide area networks, e.g., the internet, including any server system. The controller 100 c can direct the first and second valves 120, 130 to open and close to carry out successive sample injection and electrophoretic separation using a defined sequence, an example of which is shown in the timing chart of FIG. 8. It is noted that the electrophoretic separation voltage can be applied concurrently with or just after pressure P2 is decreased in the BGE reservoir 20. In general, sample injection is carried out using only pressure P1 applied to the BGE reservoir and only pressure P2 applied to the sample reservoir from the first and second pressurized gas supply lines 70 (e.g., tubes or conduits) without any electrokinetic (EK) voltage being applied. Voltage can be applied to the BGE reservoir 20 after the injection (FIG. 1C). Pressure reducing device 91 (e.g., one or more pumps) can apply a pressure P3 to the waste reservoir 35 during part or all of the sample loading, typically removed during the clearing and/or separation. The controller 100 c can be configured to operate the microfluidic device 10 using a defined timing sequence for applying defined pressures (headspace pressures) between 0.1 and 50 psi to a headspace 20 h of the BGE reservoir 20 via the pressurized gas supply line (i.e., tube or conduit) 70 2 and to a headspace 30 h of the sample reservoir 30 via the pressurized gas supply line 70 1 for defined durations, typically between 1 and 10 seconds, to inject a sample into the separation channel 25. The timing chart shown in FIG. 8 is by way of example and the noted “zero” pressures of P1 (for the sample reservoir 30) and P2 (for the BGE reservoir 20) may be atmospheric or ambient pressures or may alternatively be below-atmospheric pressures. The applied voltage V from the power supply 95 to the input 75 i in the BGE reservoir 20 (top line of the timing chart in FIG. 8) can have a shorter or longer duration than the concurrent injection pressures P1, P2 (FIG. 1A) or the subsequent “clearing” pressure P2 (FIG. 1B). The P2 pressure can remain constant or change, typically decreasing, from the concurrent pressure for injection to the “clearing” pressure when P1 is decreased (FIG. 1B). The pressure P3 can remain constant or change during respective sample loading cycles. The pressure P3 can be removed during clearing and/or separation, and may be reduced (or not applied) when pressure P1 is reduced. The microfluidic device 10 can be a microfluidic chip that is formed of hard or substantially rigid materials that include, but are not limited to, substrates comprising one or combinations of: glass, quartz, silicon, ceramic, silicon nitride, polycarbonate, and polymethylmethacrylate. In particular embodiments, the device 10 can include a glass substrate such as a borosilicate. In other embodiments, a rigid polymer material may be used to form the microfluidic device. The device 10 can also include one or more layers of a soft or flexible substrate. Soft substrate materials, where used, can have a low Young's Modulus value. For example, elastomers and harder plastics and/or polymers can have a range between about 0.1-3000 MPa. Examples of soft materials include, but are not limited to, polydimethylsiloxane (PDMS), polymethylmethacrylate (PMMA), and polyurethane. See, e.g., co-pending PCT/US2012/027662 filed Mar. 5, 2012 and PCT/US2011/052127 filed Sep. 19, 2011 for a description of examples of microfabricated fluidic devices. See, also, Mellors, J. S.; Gorbounov, V.; Ramsey, R. S.; Ramsey, J. M., Fully integrated glass microfluidic device for performing high-efficiency capillary electrophoresis and electrospray ionization mass spectrometry. Anal Chem 2008, 80 (18), 6881-6887. For additional information that may be useful for some designs, see also, Xue Q, Foret F, Dunayevskiy Y M, Zavracky P M, McGruer N E & Karger B L (1997), Multichannel Microchip Electrospray Mass Spectrometry. Anal Chem 69, 426-430, Ramsey R S & Ramsey J M (1997), Generating Electrospray from Microchip Devices Using Electroosmotic Pumping. Anal Chem 69, 1174-1178, Chambers A G, Mellors J S, Henley W H & Ramsey J M (2011), Monolithic Integration of Two-Dimensional Liquid Chromatography-Capillary Electrophoresis and Electrospray Ionization on a Microfluidic Device. Analytical Chemistry 83, 842-849. The contents of these documents are hereby incorporated by reference as if recited in full herein. Pumps and pump channels, such as, but not limited to, EO pumps and EO pump channels, can be integrated on a microfluidic device 10 for electrospray ionization via implementations other than the examples shown in FIG. 3 or 4A-4E. In general, channels can intersect at a junction, which may be a T-like junction (but not necessarily a right angle intersection). Voltages are applied to two of the three resulting channel termini generating an axial electric field through the associated channel segments. To realize hydraulic transport through the third channel segment, the electroosmotic mobility in the two channel segments that contain the axial electric field is generally different in magnitude and/or sign. The difference in electroosmotic mobility can be achieved by chemically modifying one, or both, of the associated channel segments so as to produce different surface charge densities and hence different electroosmotic mobilities. Electroosmotic mobility can also be modified by coating a channel wall with electrically neutral polymer films, thereby increasing the effective fluid viscosity within the electrical double layer at the wall. Another way to modify electroosmotic mobility is reduce one of the channel lateral dimensions to distances similar in magnitude to the Debye length of the solution being electroosmotically pumped. Other aspects of electroosmotic mobility and electroosmotic pumping are described in U.S. Pat. No. 6,110,343, the entire contents of which are hereby incorporated by reference. While it is convenient to monolithically integrate functional pump elements on electrospray microfluidic devices, it is possible to hydraulically deliver sample materials to the emitter. See, e.g., Chambers A G, Mellors J S, Henley W H & Ramsey J M (2011) Monolithic Integration of Two-Dimensional Liquid Chromatography-Capillary Electrophoresis and Electrospray Ionization on a Microfluidic Device. Analytical Chemistry 83, 842-849. When utilizing hydraulic transport to supply analyte to the emitter, electrical connections for applying voltages to produce the electrospray can be implemented using a side channel similar to the EO pumping channel or by contacting the fluid using an electrode in a reservoir external to the microfluidic device, or in the case of using metal tubing between the device 10 and the pump, connection can be made to the tubing. FIGS. 9A and 9B schematically illustrate mass spectrometry systems that include the microfluidic devices disclosed herein. FIG. 9A illustrates a portable mass spectrometer 200 with a housing 201 holding at least one of the microfluidic devices 10 with an onboard controller 100 e, a power supply 95 to provide voltages, a pressurized gas supply 90, a detector 205, an analyzer 210 and an optional display 215 for providing output data. FIG. 9B illustrates that the microfluidic device 10 can be in communication with a mass spectrometer 200. The controller 100 c can be separate or partially or totally onboard the mass spectrometer 200. The term “totally onboard” means that the operational circuitry (i.e., at least one processor and programmatic instructions) can be totally integrated into the housing, control cabinet and/or operational system of the mass spectrometer. FIG. 10 is a flow chart of exemplary operations that can be used to carry out a sample analysis. A microfluidic device is provided (block 300). The microfluidic device can have at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir and a sample reservoir and having a sample channel that merges into the separation channel. A fluid sample is injected from the sample reservoir into the separation channel downstream of the BGE reservoir by concurrently applying a defined pressure to the BGE reservoir and a defined pressure to the sample reservoir and optionally applying a reduced pressure (i.e., a pressure less than that then applied to the BGE or sample reservoir, optionally evacuated) to the waste reservoir (block 310). Then, a trailing end of the sample is cleared from the sample channel and fluid is flowed from the BGE reservoir to deliver a plug of the sample in the separation channel (block 320). The clearing can be in response to reducing or removing the pressure applied to the sample reservoir while applying pressure to the BGE reservoir so that pressure applied to the BGE reservoir is greater than pressure then applied to the sample reservoir. Then, the delivered sample is electrophoretically separated in the separation channel (block 330). The separation can be carried out by applying voltages to the BGE reservoir and to a downstream location of the separation channel and/or a pump channel. The electrophoretic separation can be carried out by only applying an electric field to the fluidic device so that at least a component of the electric field is parallel to an axial direction of a portion of the separation channel. Alternatively, the sample can be flowed through the sample channel without applying a voltage to the sample reservoir, to the BGE reservoir, or to the waste reservoir and/or with no electrical potential gradient in any of the sample channel, the BGE channel and the waste channel. Where electrophoretic separation is carried out using the applied electric field, the pressure in the BGE reservoir can be held constant or reduced while the voltage is applied. Optionally, the injecting, clearing and electrophoretic separation can be carried out without applying a voltage to the sample reservoir and no electrical potential gradient in the sample channel. Optionally, the period of time during which the various pressures are applied can be increased or decreased (e.g., electronically adjusted) and/or magnitude of the pressure applied can be increased or decreased to adjust a size of the plug of the sample delivered to the separation channel (block 345). Optionally, after undergoing separation, the sample can be analyzed in a mass spectrometer to determine information about the sample (block 335). The analysis can include detecting analyte peak signals of the sample using a mass spectrometer and generating electropherograms of the sample, for example. Electronic detection of signal of the separated sample in the separation channel can be performed using a detector in communication with the separation channel (optically and/or electronically). The electronic detection can be carried out without the mass spectrometer detection or with the mass spectrometer detection. In some embodiments, the electronic detection by the detector is carried out simultaneously with detection by the mass spectrometer for a respective separated sample. Optionally, sample pre-conditioning, transport, and injection steps can be carried out using only a sequence of defined pressure inputs to the BGE channel, the sample channel and the waste channel, without applying voltages or generating electric fields. It is noted that embodiments of the present invention may combine software, firmware and/or hardware aspects, all generally referred to herein as a “circuit” or “module.” Furthermore, the present invention may take the form of a computer program product on a computer-usable storage medium having computer-usable program code embodied in the medium. Any suitable computer readable medium may be utilized including hard disks, CD-ROMs, optical storage devices, a transmission media such as those supporting the Internet or an intranet, or magnetic storage devices. Some circuits, modules or routines may be written in assembly language or even micro-code to enhance performance and/or memory usage. It will be further appreciated that the functionality of any or all of the program modules may also be implemented using discrete hardware components, one or more application specific integrated circuits (ASICs), or a programmed digital signal processor or microcontroller. Embodiments of the present invention are not limited to a particular programming language. Computer program code for carrying out operations of the present invention may be written in an object oriented programming language such as Java®, Smalltalk or C++. However, the computer program code for carrying out operations of the present invention may also be written in conventional procedural programming languages, such as the “C” programming language. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on another computer, local and/or remote or entirely on the other local or remote computer. In the latter scenario, the other local or remote computer may be connected to the user's computer through a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). Embodiments of the present invention are described herein, in part, with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing some or all of the functions/acts specified in the flowchart and/or block diagram block or blocks. The flowcharts and block diagrams of certain of the figures herein illustrate exemplary architecture, functionality, and operation of possible implementations of embodiments of the present invention. In this regard, each block in the flow charts or block diagrams represents a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may in fact be executed substantially concurrently or the blocks may sometimes be executed in the reverse order or two or more blocks may be combined, or a block divided and performed separately, depending upon the functionality involved. FIG. 11 is a schematic illustration of a circuit or data processing system 290. The system 290 can be used with microfluidic devices 10 and/or mass spectrometers 200. The circuits and/or data processing systems 290 may be incorporated in a digital signal processor in any suitable device or devices. As shown in FIG. 11, the processor 410 can communicate with a mass spectrometer 200 and/or microfluidic device 10 and with memory 414 via an address/data bus 448. The processor 410 can reside in a control circuit or controller that is separate from the spectrometer 200 or that is integrated wholly or partially therein. The processor 410 can be any commercially available or custom microprocessor. The memory 414 is representative of the overall hierarchy of memory devices containing the software and data used to implement the functionality of the data processing system. The memory 414 can include, but is not limited to, the following types of devices: cache, ROM, PROM, EPROM, EEPROM, flash memory, SRAM, and DRAM. FIG. 11 illustrates that the memory 414 may include several categories of software and data used in the data processing system: the operating system 452; the application programs 454; the input/output (I/O) device drivers 458; and data 455. The data 455 can include sample type, plug size adjustments for pressures, calibration data, time synchronization data (e.g., pressures/duration for loading/injection), and/or other detected or internal mass spectrometer data. As will be appreciated by those of skill in the art, the operating systems 452 may be any operating system suitable for use with a data processing system, such as OS/2, AIX, DOS, OS/390 or System390 from International Business Machines Corporation, Armonk, N.Y., Windows CE, Windows NT, Windows95, Windows98, Windows2000, WindowsXP or other Windows versions from Microsoft Corporation, Redmond, Wash., Unix or Linux or FreeBSD, Palm OS from Palm, Inc., Mac OS from Apple Computer, LabView, or proprietary operating systems. The I/O device drivers 458 typically include software routines accessed through the operating system 452 by the application programs 454 to communicate with devices such as I/O data port(s), data storage 455 and certain memory 414 components. The application programs 454 are illustrative of the programs that implement the various features of the data (image) processing system and can include at least one application, which supports operations according to embodiments of the present invention. Finally, the data 455 represents the static and dynamic data used by the application programs 454, the operating system 452, the I/O device drivers 458, and other software programs that may reside in the memory 414. In FIG. 11, Sequential Pressure Drive Injection Control Module 450 and Plug Size (pressure/duration) Adjustment Module 451 are application programs. More generally, however, other configurations may also be utilized. The Module 451 can allow for a user to select a desired injection time (Pressure ON time, OFF time, pressure for a respective injection and/or clearing and the like, for each reservoir). The Module 450 and/or 451 may also be incorporated into the operating system 452, the I/O device drivers 458 or other such logical division of the data processing system. Thus, the present disclosure should not be construed as limited to the configuration of FIG. 11, which is intended to encompass any configuration capable of carrying out the operations described herein. Further, Module 450 and/or 451 can communicate with or be incorporated partially or completely in other components, such as a mass spectrometer 200, power supply 95, an interface/gateway or a computer such as at a workstation that may be local or remote from the microfluidic device/spectrometer. The I/O data port can be used to transfer information between the data processing system, the workstation, the spectrometer, the microfluidic device, the interface/gateway and another computer system or a network (e.g., the Internet) or to other devices or circuits controlled by the processor. These components may be conventional components such as those used in many conventional data processing systems, which may be configured in accordance with the present invention to operate as described herein. The present invention is explained in greater detail in the following non-limiting Examples. Examples Microchip CE with integrated ESI for MS detection was used for the analysis of amino acids. The new pressure-driven injection method was compared to a conventional electrokinetic (EK) gate method (using the methodology described in FIGS. 1A-1C and 2A-2C) using the microfluidic device shown in FIG. 3. For all of the data presented here, the sample contained a 10 μM mixture of the 20 essential amino acids. The salt content of the samples was varied to illustrate the superior salt tolerance of the new injection method and also to illustrate transient isotachophoresis (tITP), which can be performed together with the pressure-driven injection methods disclosed herein. All separations were performed with a separation field strength of approximately 1000 V/cm with a background electrolyte (BGE) of 50% methanol, 2% formic acid (pH 2.2). For pressure-driven injection, a pressure of 2 psi was applied to the head space of the sample and BGE reservoirs. The pressure was controlled using one 3-way electronic valve (obtained from Clippard, Cincinnati, Ohio) for each of these two reservoirs. The valves were controlled using the same computer control system used to supply high voltage to the microfluidic device. Gas tight connections were made to the microfluidic reservoirs using PTFE tubing with an internal diameter equal to the diameter of the glass cylinders used as fluid reservoirs (8 mm). For the sample reservoir connection, the PTFE tubing was connected directly to the pressure supply line using a simple reducing union. The fitting used for the BGE reservoir is illustrated in FIG. 5A. To allow the application of both high voltage and pressure, this fitting includes the high voltage electrode and a segment of 1/16 inch tubing which is coupled to a pressure supply line. A Synapt G2 quadrupole-ion mobility-time of flight mass spectrometer (obtained from Waters Corp., Milford, Mass.) was used for detection and identification of the ions generated by the microchip CE-ESI device. FIGS. 12A and 12B show electropherograms for the separation of sample with low salt content using both injection methods. The electropherograms are for the microfluidic CELESI-MS analysis of an amino acid mixture prepared in BGE with no salt added. For the pressure-driven injection (FIG. 12B), 2 psi was applied to both the sample and BGE reservoirs for 3 seconds, then just the BGE reservoir for 1 second. For the EK gated injection (FIG. 12A), the gate was opened for 0.2 seconds using the voltages shown in FIGS. 2A-2C. The effects of injection bias can be seen in FIG. 12A as relatively smaller peaks for the later eluting amino acids in the EK gated electropherogram. For the electrokinetic injection, injection bias causes the later eluting compounds to be significantly smaller. The new pressure driven injection method has no electrokinetic bias, so the peak areas are more consistent for analytes. Differences in peak area for the pressure driven injection are caused purely by differences in the MS detector response for these different analytes. To illustrate this trend more clearly, the peak areas from the EK gated injection relative to the peak areas of the pressure driven injection are plotted in FIG. 13. The most mobile amino acid (lysine, K) had the same peak area using both injection methods. There is, however, a clear trend of decreasing relative peak area with longer migration times. The relative decrease in peak area as a function of migration time illustrates how analytes with slower electrophoretic mobility are more strongly influenced by bias when using the electrokinetically gated injection. Injection method comparison for a sample with high salt content showed that the EK injection method had a more severe type of injection bias that can occur when the ionic strength of the sample is significantly greater than the ionic strength of the BGE. In this case, current flow from the sample reservoir to the separation channel was limited by the ionic conductivity of the BGE. An excess of ions from salt in the sample will prevent analyte ions from migrating into the separation channel. The end result is a severely biased injection when the ionic strength of the sample is significantly higher than the ionic strength of the BGE. This phenomenon places a major limitation on the utility of EK-gated CE separations. Pressure-driven injection methods force samples into the separation channel without regard for the electrical conductivity of the BGE, so analyte injection is not hampered by the salt content of the sample. FIGS. 14A and 14B show electropherograms obtained from the analysis of a sample containing 100 mM sodium chloride using both injection methods. Sodium ions generate clusters of sodium formate during the electrospray process which can be detected by the mass spectrometer. For the EK injection (FIG. 14A), only the band of sodium and very small amounts of the highest mobility amino acids (K, R, and H) are detected. For the new pressure driven injection method (FIG. 14B), an even larger band of sodium is detected, but in this case all of the amino acids are also detected with similar intensity to the injection of the no-salt-added sample shown in FIG. 12B. The use of salt in the sample for transient isotachophoresis was investigated. The ability to position a well-defined band of sample into the separation channel of the microfluidic device using pressure-driven flow allows the use of online sample focusing methods that are more difficult (or even not possible) using other microfluidic injection methods. Transient isotachophoresis (tITP) has been previously described as an online sample focusing method for capillary electrophoresis, and can be used when the sample contains a relatively large concentration of an electrolyte (termed the leading electrolyte) that has higher electrophoretic mobility than the analyte ions. This is exactly the situation that exists for the pressure-driven injection of samples with high concentration of sodium chloride described above. To take advantage of the sample focusing effects of tITP a larger band of this sample is typically injected. The pressure-driven injection methods disclosed herein allow complete freedom in altering the size of the sample band, simply by changing the head pressure or the duration of the sample loading step. For the results presented in FIGS. 15A and 15B, the duration of the sample loading step was altered, while holding constant all other variables. FIGS. 15A and 15B show how tITP yields sharp bands of increasing concentration when larger amounts of samples containing a sufficient concentration of leading electrolyte are injected. The electropherograms on the left (FIG. 15A) show how the analyte bands simply become wider for longer injection times without tITP. This sample contained no added salt to the BGE. The electropherograms of FIG. 15B show how the analyte bands focus into narrow bands of increasing concentration when tITP is performed. The only difference between the two sets of runs was the addition of 100 mM sodium chloride to the sample used for the runs in FIG. 15B. A sodium peak can be seen in the data of FIG. 15B as a wide band that elutes before the amino acids. This shows how the leading electrolyte band does not focus during tITP while the less mobile analyte ions focus into sharp peaks. The effect of salt content on microchip tITP-CE-ESI-MS was based on a mixture of 20 amino acids (10 uM). The electropherograms of FIG. 15B show how tITP leads to sharp peaks of increasing concentration when larger amounts of a sample containing a sufficient concentration of leading electrolyte are loaded. The sample of FIG. 15B contained 100 mM sodium chloride. These injections were performed with a head pressure of 2 psi applied to the sample reservoir for the times indicated in the legend. All other conditions were identical for all of the electropherograms. While 100 mM sodium chloride yields satisfactory results for tITP-CE-ESI-MS, other electrolytes can be used. For certain samples, better separation performance can be achieved by using ammonium acetate instead of sodium chloride. FIGS. 16A and 16B show electropherograms from two tITP-CE-ESI-MS separations. Both samples were 10 μM amino acid mixtures injected for 10 seconds at 2 psi. The sample used for the electropherogram of FIG. 16A contained 100 mM sodium chloride, while the sample used for the electropherogram of FIG. 16B used 100 mM ammonium acetate. The sample injected with sodium chloride yielded abnormal peak shapes, with abnormalities visible at the bottoms of the amino acid peaks. The amino acid peaks for the sample containing ammonium acetate had much better (i.e., expected) shapes. This improvement in peak shape yielded better resolution between neighboring peaks. Another difference was that ammonium ions yielded a volatile salt during the ESI process, so they were not detected by ESI-MS like sodium ions. Ammonium ions are therefore less likely to cause fouling of the MS inlet electrodes. Ammonium ions also have a higher electrophoretic mobility than sodium ions, which allows the tITP process to occur more quickly, yielding less migration time delay. This effect can be observed by comparing the migration time of the earliest eluting amino acid (lysine) in the two runs shown in FIGS. 15A and 15B. The migration time was 3 seconds earlier for this example. The effect would be more significant for larger sample injection volumes. As discussed above, the pressure-driven injection methods disclosed herein allow injection of samples for microfluidic CE separations that are free of electrokinetic injection bias. These methods can be used to inject a cleanly-defined band of sample regardless of the sample composition. The size of the sample band can be precisely controlled simply by altering the pressure and/or duration of the injection. These potential advantages make the injection methods ideal for performing on-chip sample focusing methods such as transient isotachophoresis. Pressures can be applied to two different solvent reservoirs, with the ability to control those pressures independently using (typically off-chip) valves. This allows precise loading of samples into the separation channel and then clearing of extra sample material from the side arms of the injection cross in two discrete steps, driven only by applied pressure. The foregoing description is only illustrative and is not to be construed as limiting. Although a few exemplary embodiments have been described, those skilled in the art will readily appreciate that many modifications are possible without materially departing from the scope of the disclosure. The invention is defined by the following claims, with equivalents of the claims to be included therein. 1. A method of sample processing, comprising: providing a microfluidic device with at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, a waste reservoir connected to the separation channel through a waste channel, and a sample reservoir connected to the separation channel through a sample channel; injecting a fluid sample from the sample reservoir into the at least one separation channel by concurrently applying pressurized gas to the BGE reservoir, the sample reservoir and optionally the waste reservoir; delivering fluid from the BGE reservoir into the at least one separation channel to define a plug of the sample in the at least one separation channel by reducing a gas pressure in the sample reservoir, so that a gas pressure in the BGE reservoir is greater than the gas pressure in the sample reservoir; electrophoretically separating an analyte component of the sample from other sample components in the at least one separation channel by generating an axial electric field within the separation channel; and performing at least one of: (a) electrospraying the separated analyte component from at least one emitter in fluid communication with the at least one separation channel; and (b) measuring an electrical signal corresponding to the separated analyte component in or emerging from the separation channel. 2. The method of claim 1, wherein the injection of the fluid sample, delivery of fluid from the BGE reservoir, and electrophoretic separation of the analyte component are carried out without applying voltage to the sample reservoir and with no electrical potential gradient in the sample channel. 3. The method of claim 1, wherein during fluid delivery from the BGE reservoir, the gas pressure in the BGE reservoir is a first gas pressure, the method further comprising performing the electrophoretic separation by: reducing the gas pressure in the BGE reservoir to a second gas pressure less than the first gas pressure; and applying an electrokinetic voltage to the separation channel. 4. The method of claim 1, further comprising performing the electrophoretic separation by: terminating the application of pressurized gas to the BGE reservoir; and applying a voltage to the fluid in the BGE reservoir. 5. The method of claim 1, further comprising adjusting a time period over which the pressurized gases are applied to at least one of the sample reservoir and the BGE reservoir during the injection of the fluid sample. 6. The method of claim 1, further comprising controlling a time period over which the pressurized gases are applied to the BGE reservoir and a magnitude of the gas pressure within the BGE reservoir to control a volume of the sample plug in the at least one separation channel. 7. The method of claim 1, further comprising terminating the application of pressurized gas to the sample reservoir during delivery of fluid from the BGE reservoir into the at least one separation channel. 8. The method of claim 1, further comprising electrospraying the separated analyte component from the at least one emitter toward at least one of a collection device for subsequent analysis of the analyte component or an entrance inlet of a mass spectrometer. 9. The method of claim 8, wherein the electrospraying comprises using a pump connected to the at least one separation channel through at least one pump channel to discharge the analyte component through the at least one emitter. 10. The method of claim 1, wherein the gas pressures within the BGE reservoir and the sample reservoir during the injection of the fluid sample are each between 0.1 psi and 50 psi. 11. The method of claim 1, wherein the gas pressure within the sample reservoir during the injection of the fluid sample is between 0.5 psi and 50 psi, and wherein a gas pressure within the waste reservoir during the injection of the fluid sample is lower than the gas pressure within the sample reservoir. 12. The method of claim 1, further comprising reducing the gas pressure in the sample reservoir during the delivery of fluid from the BGE reservoir by venting pressurized gas from the sample reservoir. 13. The method of claim 1, wherein during the injection of the fluid from the BGE reservoir, the gas pressures in the BGE reservoir and in the sample reservoir are each between 0.5 psi and 50 psi, and a gas pressure in the waste reservoir is lower than the gas pressures in the sample and BGE reservoirs. 14. The method of claim 1, wherein during the injection of the fluid from the BGE reservoir, the gas pressure in the BGE reservoir is between 0.1 psi and 10 psi, and the application of pressurized gas to the sample reservoir and to the waste reservoir is terminated. 15. The method of claim 1, wherein during the injection of the fluid from the BGE reservoir, the gas pressures in the sample reservoir and the BGE reservoir are maintained for a time period of between 1 second and 30 seconds. 16. The method of claim 1, further comprising: providing a first pressurized gas supply tube in communication with a first pressurized gas supply, a first valve, and the BGE reservoir; providing a second pressurized gas supply tube in communication with the first pressurized gas supply or with a second pressurized gas supply, a second valve, the sample reservoir; providing a third pressurized gas supply tube in communication with a pressure reducing device, a third valve, and the waste reservoir; and opening and closing the first, second and third valves in to perform the injection of the fluid from the BGE reservoir. 17. The method of claim 1, wherein the BGE reservoir is in fluid communication with a BGE channel connected to the separation channel at a first location, wherein the sample channel is connected to the separation channel at a second location, and wherein the second location is adjacent or downstream from the first location along the at least one separation channel. 18. The method of claim 1, wherein the sample channel and waste channel define a continuous flow path intersecting with, and orthogonal to, the at least one separation channel, and wherein the flow path intersects the at least one separation channel at a location that is downstream from the BGE reservoir along the at least one separation channel. 19. The method of claim 1, further comprising, following the electrospraying of the separated analyte component, introducing the electrosprayed analyte component into a mass spectrometer, detecting one or more signals corresponding to the analyte component using the mass spectrometer, and generating at least one electropherogram corresponding to the analyte component. 20. The method of claim 1, further comprising injecting the fluid sample without introducing electrokinetic injection bias so that the electrophoretic separation of the analyte component is not affected by electrokinetic injection bias. 21. The method of claim 1, wherein the plug of the sample in the at least one separation channel comprises an electrolyte that has an electrophoretic mobility greater than an electrophoretic mobility of the analyte component of the sample. 22. The method of claim 1, wherein the sample comprises one or more of amino acids, polar metabolites, charged molecules, molecules with electrophoretic mobility, peptides, proteins, and molecules extracted from one or more of biofluids, blood, serum, urine, dried blood, cell growth media, lysed cells, environmental samples, beverages and food. 23. A microfluidic analysis system, comprising: a microfluidic device comprising at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, a sample reservoir connected to the at least one separation channel through a sample channel, and a waste reservoir connected to the at least one separation channel through a waste channel; a first pressurized gas supply conduit in communication with the BGE reservoir, a first pressurized gas supply, and a first valve, and comprising a voltage input having an electrode that extends into the BGE reservoir; a second pressurized gas supply conduit in communication with the sample reservoir, the first pressurized gas supply or a second pressurized gas supply, and a second valve; a third pressurized gas supply conduit in communication with the waste reservoir and a third valve; and a controller in communication with a voltage source and with the first, second and third valves, and configured so that during operation of the system, the controller activates the first, second and third valves to control gas pressures in the BGE reservoir, the sample reservoir and the waste reservoir to: inject a fluid sample from the sample reservoir into the at least one separation channel; and electrophoretically separate an analyte component of the sample from other sample components in the at least one separation channel, wherein the gas pressures in the BGE reservoir and the sample reservoir are higher than the gas pressure in the waste reservoir during the sample injection; and wherein no electrokinetic voltage is used to inject the sample into the at least one separation channel. 24. The system of claim 23, wherein the controller is configured to control the gas pressures in the BGE reservoir, the sample reservoir and the waste reservoir so that during injection of the sample, the gas pressures in the BGE reservoir and in the sample reservoir are each between 0.1 psi and 50 psi for a duration of between 1 second and 30 seconds. 25. The system of claim 23, wherein the microfluidic device further comprises: at least one pump in communication with the at least one separation channel; and at least one emitter, wherein during operation of the system, the analyte component is discharged from the at least one emitter. 26. The system of claim 23, wherein the controller is configured so that during operation of the system: (i) gas pressures of between 0.1 psi and 50 psi are concurrently maintained in the BGE reservoir and in the sample reservoir to inject the fluid sample into the at least one separation channel; (ii) the gas pressure is reduced in the sample reservoir so that the gas pressure in the BGE reservoir is greater than the gas pressure in the sample reservoir, thereby delivering fluid from the BGE reservoir into the at least one separation channel to define a plug of the sample in the at least one separation channel; and (iii) the gas pressure is reduced in or removed from the BGE reservoir, and an electrokinetic voltage is applied to the microfluidic device to perform the electrophoretic separation. 27. The system of claim 23, wherein the first and second valves are three-way valves configured to vent pressurized gas into respective first and second supply lines in response to a control signal from the controller. 28. The system of claim 23, further comprising an optical detector positioned so that as the analyte component flows through the at least one separation channel, the optical detector is configured to measure radiation from the analyte component. 29. A mass spectrometer system, comprising: a mass spectrometer; a microfluidic device onboard or in communication with the mass spectrometer, the microfluidic device comprising at least one separation channel in fluid communication with a background electrolyte (BGE) reservoir, a sample reservoir connected to the at least one separation channel through a sample channel, and a waste reservoir connected to the at least one separation channel through a waste channel; a first gas conduit in communication with a first valve and the BGE reservoir; a voltage input comprising an electrode extending into the BGE reservoir; a second gas conduit in communication with a second valve and the sample reservoir; a third gas conduit in communication with a third valve and the waste reservoir; a voltage source in communication with the voltage input; at least one pressurized gas source in fluid communication with the first and second gas supply conduits; a pressure reducing device in fluid communication with the third gas conduit; and a controller connected to the first, second, and third valves, and to the voltage source, and configured so that during operation of the system, the controller: (i) activates at least one of the first, second, and third valves to inject a fluid sample from the sample reservoir into the at least one separation channel without applying a voltage gradient to the fluid sample; (ii) activates at least one of the first, second, and third valves to deliver fluid from the BGE reservoir into the at least one separation channel to define a plug of the sample in the at least one separation channel; and (iii) applies an axial electric field to the sample in the at least one separation channel to electrophoretically separate an analyte component from other components of the sample in the at least one separation channel. 30. The system of claim 29, wherein the controller is configured to inject the fluid sample by maintaining the BGE reservoir at a first gas pressure, maintaining the sample reservoir at a second gas pressure, and maintaining the waste reservoir at a third gas pressure smaller than the first and second gas pressures, for a first time interval. 31. The system of claim 30, wherein the controller is configured to deliver the fluid from the BGE reservoir by maintaining the BGE reservoir at the first gas pressure, and the sample reservoir at a fourth gas pressure smaller than the first gas pressure, for a second time interval. 32. The system of claim 31, wherein the controller is configured to reduce the gas pressure in the BGE reservoir by venting pressurized gas from the BGE reservoir before or during the electrophoretic separation. 33. The system of claim 32, wherein the first and second valves are three-way valves configured to vent pressurized gas from the BGE and sample reservoirs respectively, and wherein the controller is configured control gas pressures in the BGE and sample reservoirs by venting pressurized gas from the reservoirs within 0.1-3 seconds by activating the first and second valves. 34. The system of claim 29, further comprising at least one electrospray ionization emitter and at least one pump in communication with the at least one electrospray ionization emitter and the controller, wherein during operation of the system, the controller is configured to operate the pump to electrospray the separated analyte component from the at least one separation channel through the at least one electrospray ionization emitter. 35. The system of claim 31, wherein during operation of the system, the controller is configured to adjust a duration of at least one of the first and second time periods to control a volume of the sample plug. 36. The system of claim 30, wherein the first and second gas pressures are each between 0.1 psi and 50 psi.

2016-05-10

en

2018-06-07

US-13602008-A

Method, Apparatus, and Program to Forward and Verify Multiple Digital Signatures in Electronic Mail ABSTRACT A mechanism is provided for augmenting the mail header of a message with a list of digital signatures representing the chain of contributors to the message. The augmented header may also encode the actual contributions corresponding to each digital signature. The list is appended every time a message is forwarded. If a message has a portion with no corresponding digital signature or if one or more of the digital signatures is not trusted, the user may handle the message accordingly. Furthermore, a mail server or client may discard a message if the number of digital signatures exceeds a threshold to filter out unwanted messages, such as e-mail chain letters. BACKGROUND OF THE INVENTION 1. Technical Field The present invention relates to network data processing systems and, in particular, to electronic mail. Still more particularly, the present invention provides a method, apparatus, and program for verifying multiple digital signatures in mail forwarding. 2. Description of Related Art With the increasing popularity of computers, paper transactions are gradually being replaced by digital formats, such as e-mail and electronic data interchange (EDI). While the legal framework to establish and support the validity of digital transactions are evolving, it is clear that digital signatures will play a pivotal role, especially in the area of non-repudiation in the near future. Therefore, it is essential that important documents are digitally signed for them to support the framework alluded to above. In this context, e-mail plays a pivotal role in communications, both in the corporate and noncorporate worlds. Since the content of e-mail can evoke a range of actions, such as litigation, it is important to assign responsibility and the non-repudiation properties to e-mail transmissions. Furthermore, with the spread of viruses and spyware through electronic transmissions, improved security and accountability is needed. Under current implementations, an e-mail message typically bears the digital signature of the sender. However, in the case of forwarded e-mail, there is no way to attach easily enforceable non-repudiation properties and responsibilities to the chain of recipients. In essence, the sender becomes responsible for the entire content in case of disputes under the current implementations. This implies that the sender has to always peruse through the entire chain before forwarding an e-mail message. This may be time consuming. Therefore, it would be advantageous to provide a mechanism for the insertion and retention of multiple digital signatures corresponding to contributing authors in forwarded e-mail. SUMMARY OF THE INVENTION The present invention provides a mechanism for augmenting the mail header of a message with a list of digital signatures representing the chain of contributors to the message. The augmented header may also encode the actual contributions corresponding to each digital signature. For example, when a user forwards a message and makes a contribution, the beginning bytes and length of the contribution may be associated with that user's digital signature in the header. Similarly, an attachment filename may be associated with a user that attaches a file in a forwarded message. The list is appended every time a message is forwarded. If a message has a portion with no corresponding digital signature or if one or more of the digital signatures is not trusted, the user may handle the message accordingly. For example, a user may choose to delete a message without opening if a file is attached by an untrusted user. Furthermore, a mail server or client may discard a message if the number of digital signatures exceeds a threshold to filter out unwanted messages, such as e-mail chain letters. BRIEF DESCRIPTION OF THE DRAWINGS The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further objectives and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein: FIG. 1 depicts a pictorial representation of a network of data processing systems in which the present invention may be implemented; FIG. 2 is a block diagram of a data processing system that may be implemented as a server in accordance with a preferred embodiment of the present invention; FIG. 3 is a block diagram illustrating a data processing system in which the present invention may be implemented; FIGS. 4A and 4B are pictorial representations of example network data processing systems in accordance with a preferred embodiment of the present invention; FIG. 5 is a flowchart illustrating the operation of a mail client sending a message in accordance with a preferred embodiment of the present invention; FIG. 6 is a flowchart illustrating the operation of a mail client sending a message in accordance with a preferred embodiment of the present invention; FIG. 7 is a flowchart depicting the operation of a mail client receiving a message in accordance with a preferred embodiment of the present invention; and FIG. 8 is a flowchart illustrating the operation of a process for filtering out unwanted messages in accordance with a preferred embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT With reference now to the figures, FIG. 1 depicts a pictorial representation of a network of data processing systems in which the present invention may be implemented. Network data processing system 100 is a network of computers in which the present invention may be implemented. Network data processing system 100 contains a network 102, which is the medium used to provide communications links between various devices and computers connected together within network data processing system 100. Network 102 may include connections, such as wire, wireless communication links, or fiber optic cables. In the depicted example, server 104 is connected to network 102 along with storage unit 106. In addition, clients 108, 110, and 112 are connected to network 102. These clients 108, 110, and 112 may be, for example, personal computers or network computers. In the depicted example, server 104 provides data, such as boot files, operating system images, and applications to clients 108-112. Clients 108, 110, and 112 are clients to server 104. Network data processing system 100 may include additional servers, clients, and other devices not shown. In the depicted example, network 102 represents the Internet, a worldwide collection of networks and gateways that use the TCP/IP suite of protocols to communicate with one another. At the heart of the Internet is a backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, government, educational and other computer systems that route data and messages. Of course, network data processing system 100 also may be implemented as a number of different types of networks, such as for example, an intranet, a local area network (LAN), or a wide area network (WAN). FIG. 1 is intended as an example, and not as an architectural limitation for the present invention. Referring to FIG. 2, a block diagram of a data processing system that may be implemented as a server, such as server 104 in FIG. 1, is depicted in accordance with a preferred embodiment of the present invention. Data processing system 200 may be a symmetric multiprocessor (SMP) system including a plurality of processors 202 and 204 connected to system bus 206. Alternatively, a single processor system may be employed. Also connected to system bus 206 is memory controller/cache 208, which provides an interface to local memory 209. I/O bus bridge 210 is connected to system bus 206 and provides an interface to I/O bus 212. Memory controller/cache 208 and I/O bus bridge 210 may be integrated as depicted. Peripheral component interconnect (PCI) bus bridge 214 connected to I/O bus 212 provides an interface to PCI local bus 216. A number of modems may be connected to PCI local bus 216. Typical PCI bus implementations will support four PCI expansion slots or add-in connectors. Communications links to network computers 108-112 in FIG. 1 may be provided through modem 218 and network adapter 220 connected to PCI local bus 216 through add-in boards. Additional PCI bus bridges 222 and 224 provide interfaces for additional PCI local buses 226 and 228, from which additional modems or network adapters may be supported. In this manner, data processing system 200 allows connections to multiple network computers. A memory-mapped graphics adapter 230 and hard disk 232 may also be connected to I/O bus 212 as depicted, either directly or indirectly. Those of ordinary skill in the art will appreciate that the hardware depicted in FIG. 2 may vary. For example, other peripheral devices, such as optical disk drives and the like, also may be used in addition to or in place of the hardware depicted. The depicted example is not meant to imply architectural limitations with respect to the present invention. The data processing system depicted in FIG. 2 may be, for example, an IBM e-Server pSeries system, a product of International Business Machines Corporation in Armonk, N.Y., running the Advanced Interactive Executive (AIX) operating system or LINUX operating system. With reference now to FIG. 3, a block diagram illustrating a data processing system is depicted in which the present invention may be implemented. Data processing system 300 is an example of a client computer. Data processing system 300 employs a peripheral component interconnect (PCI) local bus architecture. Although the depicted example employs a PCI bus, other bus architectures such as Accelerated Graphics Port (AGP) and Industry Standard Architecture (ISA) may be used. Processor 302 and main memory 304 are connected to PCI local bus 306 through PCI bridge 308. PCI bridge 308 also may include an integrated memory controller and cache memory for processor 302. Additional connections to PCI local bus 306 may be made through direct component interconnection or through add-in boards. In the depicted example, local area network (LAN) adapter 310, SCSI host bus adapter 312, and expansion bus interface 314 are connected to PCI local bus 306 by direct component connection. In contrast, audio adapter 316, graphics adapter 318, and audio/video adapter 319 are connected to PCI local bus 306 by add-in boards inserted into expansion slots. Expansion bus interface 314 provides a connection for a keyboard and mouse adapter 320, modem 322, and additional memory 324. Small computer system interface (SCSI) host bus adapter 312 provides a connection for hard disk drive 326, tape drive 328, and CD-ROM drive 330. Typical PCI local bus implementations will support three or four PCI expansion slots or add-in connectors. An operating system runs on processor 302 and is used to coordinate and provide control of various components within data processing system 300 in FIG. 3. The operating system may be a commercially available operating system, such as Windows 2000, which is available from Microsoft Corporation. An object oriented programming system such as Java may run in conjunction with the operating system and provide calls to the operating system from Java programs or applications executing on data processing system 300. “Java” is a trademark of Sun Microsystems, Inc. Instructions for the operating system and applications or programs are located on storage devices, such as hard disk drive 326, and may be loaded into main memory 304 for execution by processor 302. Those of ordinary skill in the art will appreciate that the hardware in FIG. 3 may vary depending on the implementation. Other internal hardware or peripheral devices, such as flash ROM (or equivalent nonvolatile memory) or optical disk drives and the like, may be used in addition to or in place of the hardware depicted in FIG. 3. Also, the processes of the present invention may be applied to a multiprocessor data processing system. As another example, data processing system 300 may be a stand-alone system configured to be bootable without relying on some type of network communication interface, whether or not data processing system 300 comprises some type of network communication interface. As a further example, data processing system 300 may be a Personal Digital Assistant (PDA) device, which is configured with ROM and/or flash ROM in order to provide nonvolatile memory for storing operating system files and/or user-generated data. The depicted example in FIG. 3 and above-described examples are not meant to imply architectural limitations. For example, data processing system 300 also may be a notebook computer or hand held computer in addition to taking the form of a PDA. Data processing system 300 also may be a kiosk or a Web appliance. Returning to FIG. 1, server 104 may be a message server, such as an e-mail server. Clients 108, 110, 112 may transmit messages to one another through server 104. More particularly, the messages may be forwarded e-mail messages. For example, client 108 may send an e-mail message to client 110 and client 110 may forward the e-mail message to client 112. While FIG. 1 shows one server, the network configuration may include more servers. In fact, each client may have its own mail server. In prior art implementations, e-mail messages typically bear the digital signature of the sender. In other words, when a message is sent from client 108 to client 110, the message bears the digital signature of the user of client 108. When the message is forwarded from client 110 to client 112, the forwarded message bears the digital signature of the user of client 110. Therefore, the user of client 112 can only authenticate the message with respect to the user of client 110. Even if the user of client 112 trusts the user of client 110, there is no way in the prior art to authenticate the originator of the forwarded message. In accordance with a preferred embodiment of the present invention, each client executes e-mail client software that augments the e-mail message header with a list of digital signatures representing the chain of contributors in an e-mail. The list is appended every time an e-mail message is forwarded. The header may also encode the actual contributions corresponding to each digital signature. For example, when a user forwards a message and includes a contribution, the beginning bytes and length of the contribution are associated with that user's digital signature in the header. However, other methods of associating the contribution with the digital signature may be used, such as marking up the actual message content. Furthermore, an attachment filename may also be associated with a user that attaches a file in a forwarded message. With reference to FIGS. 4A and 4B, pictorial representations of example network data processing systems are shown in accordance with a preferred embodiment of the present invention. Particularly, with respect to FIG. 4A, a network data processing system contains Internet 402, which is the medium used to provide communications links between various devices and computers connected together within the network data processing system. Client 1 404 communicates with mail server 1 406 through Internet 402 to send and receive mail. Similarly, client 2 408 communicates with mail server 410 and client 3 412 communicates with mail server 3 414. Person 1 uses client 1 to composes message 420 and sends the message to person 2 at client 2. Mail message 420 bears digital signature 422 for person 1 and includes the contribution of person 1. The mail message is transferred by sending the message from client 1 to mail server 1. Mail server 1 then transfers the message to mail server 2. Person 2 may then retrieve the mail message as message 424 from mail server 2 using client 2. Person 2 may then authenticate the digital signature of person 1 in a known manner. Person 2 may then make a contribution and forward the message. When person 2 forwards message 424 to person 3, the mail client software running on client 2 appends digital signature 426 of person 2 to message 424 and includes a contribution of person 2 before transferring the message to mail server 2. Mail server 2 then transfers the message to mail server 3, where it may be delivered to client 3. When person 3 retrieves the message as message 428 from mail server 3, the message includes in the header digital signatures 430. These digital signatures include the digital signature for person 1 and the digital signature for person 2. The message body includes the contribution of person 1 and the contribution of person 2. The header may also encode the actual contributions corresponding to each digital signature, as stated above. In an alternative embodiment, when person 2 forwards message 424, the message from person 1 is included as attachment. Thus, when person 3 retrieves message 428, the message includes attachment 432 including message 434 from person 1. The header may then associate the digital signature of person 1 with the attachment. Therefore, the digital signature for person 2 may be verified with respect to message 428 and the digital signature for person 1 may be verified with respect to message 434. Turning now to FIG. 4B, an example is shown in which an attachment is added in a forwarded message. Person 1 uses client 1 to send message 440 to person 2 at client 2. Mail message 440 bears digital signature 442 for person 1 and includes a contribution of person 1. Person 2 receives the message as message 444 and may then authenticate the digital signature of person 1. When person 2 forwards message 444 to person 3, the mail client software running on client 2 appends digital signature 446 of person 2 to message 444 before transferring the message to mail server 2. Person 2 may include attachment 448 in message 444. The mail client software running on client 2 then includes the contribution of person 2, including the file attachment, and associates the attachment filename with the digital signature for person 2. Mail server 2 then transfers the message to mail server 3, where it may be delivered to client 3. When person 3 retrieves the message as message 450 from mail server 3, the message includes in the header digital signatures 452. These digital signatures include the digital signature for person 1 and the digital signature for person 2. The header may also encode the actual contributions corresponding to each digital signature. Particularly, the header associates the attachment filename with the digital signature for person 2. Thus, person 3 may authenticate the digital signature for person 2 before opening the attachment. Furthermore, even if person 3 forwards the message to another person, the attachment remains associated with the digital signature for person 2. The contributions may also be encoded within the header, such as by indicating a beginning location and a length of a contribution. Alternatively, contributions may be encoded within the body of the message, such as through journaling techniques or tools for tracking edits similar to those in word processing applications. For example, a mail client application may track changes made by each user and display the changes for each person using a different color. With reference to FIG. 5, a block diagram of the functional components of a client device is shown in accordance with a preferred embodiment of the present invention. The client device includes communications interface 510 that is used to communicate with a mail server to send and receive mail messages. The system also includes mail client 520 for presenting, organizing, and composing mail messages. Mail client 520 includes mail forwarding manager 522. The mail forwarding manager allows the user to forward mail messages and to verify forwarded mail messages that are received. Digital signatures are verified using signature verification mechanism 530. Controller 540 controls the overall operation of the client device. Controller 540 sends and receives data through communications interface 510 and controls the operation of mail client and the signature verification mechanism to carry out the functions of the present invention. The elements of the functional block diagram of FIG. 5 may be implemented as hardware, software, or a combination of hardware and software components. In a preferred embodiment, the functional elements shown in FIG. 5 are implemented as software instructions executed by one or more of the hardware elements shown in FIG. 3. With reference to FIG. 6, a flowchart is depicted illustrating the operation of a mail client sending a message in accordance with a preferred embodiment of the present invention. The process begins when a mail message is being sent. A determination is made as to whether the mail is forwarded mail (step 602). If the mail is forwarded mail, the process appends the digital signature of the sender to the message header (step 604) and associates the current contribution with the digital signature of the sender (step 606). Next, a determination is made as to whether an attachment is added (step 608). If an attachment is not added, the process sends the mail message (step 610) and ends. If an attachment is added in step 608, the process associates the attachment filename with the digital signature of the sender in the header (step 612). Then, a determination is made as to whether the attachment is the last attachment (step 614). If the attachment is the last attachment, the process sends the mail message (step 610) and ends. If the attachment is not the last attachment, the process returns to step 612 to associate the next attachment filename with the digital signature of the sender in the header. Returning to step 602, if the mail message is not forwarded mail, the process includes the digital signature of the sender in the header (step 616) as known in the art. Thereafter, the process proceeds to step 608 to determine whether an attachment is added. Thus, the present invention may associate an attachment filename with the sender even if the message is not a forwarded mail message. This allows any file attachments to be associated with the sender if the message is forwarded by any of the recipients. With reference now to FIG. 7, a flowchart depicting the operation of a mail client receiving a message is shown in accordance with a preferred embodiment of the present invention. The process begins and receives a mail message (step 702). The process then verifies the digital signatures in the header (step 704). A determination is made as to whether the signatures are verified (step 706). If the digital signatures are approved, the mail client opens the mail message (step 708) and ends. However, if the digital signatures are not verified in step 706, the process gives the user the option to accept the digital signature or delete the mail message (step 710) and ends. Thus, if the user knows and trusts the person associated with the digital signature, the user may accept the digital signature to be added to the trusted list. However, if the user does not recognize or trust the person, the user may simply delete the e-mail without being exposed to its content. The signatures may be verified by checking the authenticity of the signatures themselves. Furthermore, a user may not trust a sender and the mail message may not be verified, because one of the senders in the chain is not trusted. Still further, the forwarded mail message may include content for which there is no associated digital signature. For example, a mail message may include an attachment, the filename of which is not associated with a digital signature. Such a mail message would fail verification. Turning now to FIG. 8, a flowchart illustrating the operation of a process for filtering out unwanted messages is shown in accordance with a preferred embodiment of the present invention. The process begins and receives a mail message (step 802). Next, the process compares the number of digital signatures in the header to a threshold (step 804) and a determination is made as to whether the number of signatures exceeds the threshold (step 806). If the number of signatures does not exceed the threshold, the process delivers the mail to the user's mailbox (step 808) and ends. If the number of signatures exceeds the threshold in step 806, the process discards the mail message (step 810) and ends. The threshold may be selected by a user. For example, a subscriber to the mail server may determine that a mail message that has been forwarded fifty or more times, for instance, is likely to be an e-mail chain letter. Thus, the present invention solves the disadvantages of the prior art by providing a mechanism for augmenting the mail header of a message with a list of digital signatures representing the chain of contributors to the message. The augmented header may also encode the actual contributions corresponding to each digital signature. The list is appended every time a message is forwarded. If a message has a portion with no corresponding digital signature or if one or more of the digital signatures is not trusted, the user may handle the message accordingly. Furthermore, a mail server or client may discard a message if the number of digital signatures exceeds a threshold to filter out unwanted messages, such as e-mail chain letters. It is important to note that while the present invention has been described in the context of a fully functioning data processing system, those of ordinary skill in the art will appreciate that the processes of the present invention are capable of being distributed in the form of a computer readable medium of instructions and a variety of forms and that the present invention applies equally regardless of the particular type of signal bearing media actually used to carry out the distribution. Examples of computer readable media include recordable-type media, such as a floppy disk, a hard disk drive, a RAM, CD-ROMs, DVD-ROMs, and transmission-type media, such as digital and analog communications links, wired or wireless communications links using transmission forms, such as, for example, radio frequency and light wave transmissions. The computer readable media may take the form of coded formats that are decoded for actual use in a particular data processing system. The description of the present invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention, the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated. 1-14. (canceled) 15. An apparatus for receiving a forwarded message, comprising: receipt means for receiving a message at a computer of a third user, wherein the message was sent from a first user to a second user and subsequently forwarded to the third user, and wherein the message has attached thereto a first digital signature and a second digital signature, the first digital signature corresponding to the first user and to a first contribution made by the first user, and the second digital signature corresponding to the second user and to a second contribution made by the second user; verification means for verifying the first digital signature and the second digital signature; and opening means for opening the message if the first digital signature and the second digital signature are approved. 16. The apparatus of claim 15, wherein the verification means comprises: comparison means for comparing the first digital signature and the second digital signature to a list of trusted digital signatures; and approval means for approving the first digital signature and the second digital signature if they are in the list of trusted digital signatures. 17. The apparatus of claim 16, further comprising: means for denying at least one of the first digital signature if the first digital signature is not in the list of trusted digital signatures or the second digital signature if the second digital signature is not in the list of trusted digital signatures, wherein, by denying, a denied digital signature is formed; means for prompting the third user to accept the denied digital signature; and means for adding the denied digital signature to the list of trusted digital signatures if the user accepts the denied digital signature. 18. The apparatus of claim 16, further comprising means for deleting the message if the first digital signature or the second digital signature is not approved. 19. The apparatus of claim 15, further comprising: means for attaching to the message a third digital signature corresponding to the third user; and means for forwarding the message to a fourth user. 20. The apparatus of claim 15 further comprising: receipt means for receiving a message, wherein the message was forwarded by a plurality of users, and wherein the message has attached thereto digital signatures corresponding to each of the plurality of users; determination means for determining the number of users in the plurality of users; comparison means for comparing the number to a threshold; and discarding means for discarding the message if the number exceeds the threshold. 21-22. (canceled) 23. A recordable type medium containing a computer program product for receiving a forwarded message, the computer program product comprising: instructions for receiving a message at a computer of a third user, wherein the message was sent from a first user to a second user and subsequently forwarded to the third user, and wherein the message has attached thereto a first digital signature and a second digital signature, the first digital signature corresponding to the first user and to a first contribution made by the first user, and the second digital signature corresponding to the second user and to a second contribution made by the second user; instructions for verifying the first digital signature and the second digital signature; and instructions for opening the message if the first digital signature and the second digital signature are approved. 24. The computer program product of claim 23, wherein the computer program product further comprises: instructions for receiving a message, wherein the message was forwarded by a plurality of users, and wherein the message has attached thereto digital signature corresponding to each of the plurality of users; instructions for determining the number of users in the plurality of users; instructions for comparing the number to a threshold; and instructions for discarding the message if the number exceeds the threshold.

2008-06-09

en

2008-09-25

US-202017641355-A

High frequency treatment handpiece having roller electrodes ABSTRACT Disclosed is a high frequency treatment handpiece having roller electrodes. The handpiece includes: a handpiece casing part; and a plurality of roller electrode members rotatably positioned on a lower surface of the handpiece casing part and applying a high frequency by being brought into contact with the skin. The handpiece prevents burning when the continuous rubbing of a treated area is performed during a treatment, allows a practitioner to conveniently perform the treatment, and allows a person being treated to comfortably receive the treatment with minimum pain. Ball electrodes and roller electrodes can be selectively used, and a roller fixed mode, which limits the rotation of the roller electrodes, can also be selectively used, and thus various massage effects can be selectively provided in accordance with the condition of a patient&#39;s skin, and the effect of the high frequency treatment can be maximized by means of the various massage effects. TECHNICAL FIELD The present disclosure relates generally to a high frequency treatment handpiece having roller electrodes and, more particularly, to a high frequency treatment handpiece having roller electrodes that are rotated in contact with the skin. BACKGROUND ART A high frequency current generally refers to an alternating current having a frequency of more than 100,000 Hz, and is characterized by a small oscillation amplitude, so that no electrochemical reaction or electrolysis phenomenon occurs, and oscillating current energy is converted into thermal energy only within a predetermined path. In particular, when the high frequency current passes through human tissue, it hardly causes ion movement and causes no electrochemical reaction or electrolysis phenomenon because the oscillation amplitude is very small. When the high frequency current is applied to the tissue, whenever the current changes the direction thereof, the molecules that make up the tissue vibrate and rub against each other, generating biological thermal energy. In addition, unlike other current types, the high frequency current does not stimulate the sensory and motor nerves, does not cause inconvenience or muscular contraction, and generates thermal energy. This thermal energy can also provide additional effects of enhancing cell function and increasing blood flow. For this reason, treatment devices using high frequency current are used for various therapeutic purposes such as skin rejuvenation, skin lifting, suppression of melanin secretion, obesity treatment, skin care, hair promotion, pain relief, etc. An example of conventional high-frequency treatment devices includes a handpiece for high-frequency treatment provided with a high-frequency electrode to which a high frequency current is applied in contact with a treated area of the skin, and a body having a high-frequency generator that receives power and supplies a high frequency current to the handpiece and a high-frequency operation controller that controls the operation of the high-frequency generator. The handpiece is configured in a form electrically connected to the body by a cable or the like. The handpiece for high-frequency treatment is provided with a flat electrode part or can only make contact with the skin at one point through a spherical fixed electrode. As a result, the handpiece for high-frequency treatment is problematic in that the heat is accumulated in a local area of the skin during high-frequency output from the electrode, causing burning. In addition, the handpiece for high-frequency treatment repeatedly performs the action of continuously rubbing the treated area during the treatment in order to increase the massage effect when used. In this case, friction is generated between the skin and the fixed electrode, causing unnecessary fatigue and pain for both a practitioner and a patient. In addition, the handpiece for high-frequency treatment is limited in the treatment method due to the use of the fixed electrode, so that it is difficult to expect an increase in the treatment effect through various massage effects according to the skin condition of patients. DISCLOSURE Technical Problem Accordingly, the present disclosure has been made keeping in mind the above problems occurring in the related art, and an objective of the present disclosure is to provide a high frequency treatment handpiece having roller electrodes that are rotated in contact with the skin, the handpiece being capable of preventing burning when the continuous rubbing of a treated area is performed during a treatment, allowing a practitioner to conveniently perform the treatment, and allows a person being treated to comfortably receive the treatment with minimum pain. Another objective of the present disclosure is to provide a high frequency treatment handpiece having roller electrodes, in which ball electrodes and roller electrodes can be selectively used, and a roller fixed mode, which limits the rotation of the roller electrodes, can also be selectively used, and thus various massage effects can be selectively provided in accordance with the condition of a patient's skin. Technical Solution In order to accomplish the above objectives, an aspect of the present disclosure provides a high frequency treatment handpiece having roller electrodes, the high frequency treatment handpiece including: a handpiece casing part; and a plurality of roller electrode members rotatably positioned on a lower surface of the handpiece casing part and configured to apply a high frequency by being brought into contact with the skin of a patient. The high frequency treatment handpiece may further include: a ball electrode part positioned to be movable upward and downward in the handpiece casing part and having a ball electrode member that protrudes from a lower surface thereof, configured to be rolled in contact with the skin, and configured to apply a high frequency; and an electrode lifting part configured to move the ball electrode part upward and downward. The ball electrode part may be positioned to protrude from the lower surface of the handpiece casing part so that the ball electrode member is positioned to protrude to a height equal to or lower than a height of the roller electrode members, whereby when the roller electrode members are brought into contact with the skin, the ball electrode member may be brought into contact with the skin simultaneously with the roller electrode members and be rolled in contact with the skin to generate a massage effect on the skin. The ball electrode member may be positioned to protrude from the lower surface of the handpiece casing part so that when the ball electrode member is brought into contact with the skin simultaneously with the roller electrode members, the ball electrode member may be in a state in which the supply of electric power is cut off. The electrode lifting part may include a stopper panel connected to the ball electrode part, positioned to be spaced apart from an upper portion of the handpiece casing part, and configured to limit a maximum protrusion height of the ball electrode part. The maximum protrusion height of the ball electrode part limited by the stopper panel may be a height at which only the ball electrode member applies the high frequency by being brought into contact with the skin while the roller electrode members are not brought into contact with the skin. A first ball electrode power application terminal configured to apply electric power to the ball electrode part may be positioned on a lower surface of the stopper panel, and a second ball electrode power application terminal electrically connected to the first ball electrode power application terminal and configured to apply electric power to the ball electrode part may be positioned on an upper surface of the handpiece casing part. When the ball electrode part protrudes to the maximum protrusion height from the lower surface of the handpiece casing part as the stopper panel is seated on the upper surface of the handpiece casing part, the ball electrode part may apply the high frequency to the skin through electrical connection between the first and second ball electrode power application terminals. Advantageous Effects By the provision of roller electrodes that are rotated in contact with the skin, the present disclosure prevents burning when the continuous rubbing of a treated area is performed during a treatment, allows a practitioner to conveniently perform the treatment, and allows a person being treated to comfortably receive the treatment with minimum pain. Ball electrodes and roller electrodes can be selectively used, and a roller fixed mode, which limits the rotation of the roller electrodes, can also be selectively used. Thus, various massage effects can be selectively provided in accordance with the condition of a patient's skin, and the effect of the high frequency treatment can be maximized by means of the various massage effects. DESCRIPTION OF DRAWINGS FIGS. 1 to 3 are perspective views illustrating an embodiment of a high frequency treatment handpiece having roller electrodes according to the present disclosure. FIGS. 4 and 5 are front views illustrating the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. FIG. 6 is a bottom view illustrating another embodiment of a high frequency treatment handpiece having roller electrodes according to the present disclosure. FIG. 7 is a use state view illustrating the other embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. FIG. 8 is a schematic view illustrating an embodiment of a ratchet part of a roller electrode member in the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. FIG. 9 is a view illustrating a screen displayed on a display panel part in the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. *Description of the Reference Numerals in the Drawings* 100: handpiece casing part 200: roller electrode member 210: hollow hole 300: ball electrode part 310: ball electrode housing member 320: ball electrode member 400: electrode lifting part 410: stopper panel 411: first ball electrode power 412: second ball electrode application terminal power application terminal 500: display panel part 600: ratchet part 610: ratchet wheel member 620: pole member 630: brush terminal 700: rotation detection sensor 800: pressure sensor BEST MODE The present disclosure will be described in more detail. Reference will now be made in detail to an exemplary embodiment of the present disclosure with reference to the accompanying drawings. Prior to the description, it should be understood that all terms or words used in the specification and claims have the same meaning as commonly understood by one of ordinary skill in the art to which inventive concepts belong. Therefore, the description proposed herein is just a preferable example for the purpose of illustrations only, not intended to limit the scope of the disclosure, so it should be understood that other equivalents and modifications could be made thereto without departing from the spirit and scope of the disclosure. FIGS. 1 to 3 are perspective views illustrating an embodiment of a high frequency treatment handpiece having roller electrodes according to the present disclosure. FIGS. 4 and 5 are front views illustrating the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. The embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure will be described in detail below with reference to FIGS. 1 to 4. The embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure includes a handpiece casing part 100. The handpiece casing part 100 is connected to a high frequency treatment body 10 having a high frequency generator that receives power and supplies a high frequency current to the handpiece and a high frequency operation controller that controls the operation of the high frequency generator. The high frequency treatment body 10 may be a body structure that controls the operation of the high frequency treatment handpiece in a known high frequency treatment device, but the present disclosure is not limited thereto. Various other body structures may also be used and a more detailed description thereof is omitted. A plurality of roller electrode members 200 are rotatably positioned on a lower surface of the handpiece casing part 100. The roller electrode members 200 may be positioned to be rotatable in the left and right directions or may be positioned to be rotatable in the front and rear directions, but the present disclosure is not limited thereto. For example, the roller electrode members 200 may be positioned to be rotatable in one direction. The roller electrode members 200 are high frequency electrodes that apply a high frequency by being brought into contact with the skin of a person being treated, i.e., a patient. Each of the roller electrode members 200 partially protrudes from the lower surface of the handpiece casing part 100 and is mounted on the handpiece casing part 100 so as to be rotatable about a roller shaft. The roller electrode member 200 may have a structure that can be rotated while receiving electric power through an electric wire connected to the center of rotation of the roller shaft, or may receive electric power by maintaining a state in which an outer circumferential surface thereof is in elastic contact with a brush electrode. The roller electrode member 200 generates a high frequency by receiving electric power from the high frequency treatment body 10 through a known mechanism for supplying electric power to a rotating body. The embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure may further include: a ball electrode part 300 positioned to be movable upward and downward in the handpiece casing part 100 and having a ball electrode member 320 that protrudes from a lower surface thereof, is rolled in contact with the skin, and applies a high frequency; and an electrode lifting part 400 moving the ball electrode part 300 upward and downward. The ball electrode part 300 includes a ball electrode housing member 310 positioned to be movable upward and downward in the handpiece casing part 100, and the ball electrode member 320 rotatably positioned under the ball electrode housing member 310 and protruding from a lower portion of the ball electrode housing member 310. The ball electrode part 300 may receive electric power by maintaining a state in which a brush electrode is in elastic contact with an outer circumferential surface of the ball electrode member 320 inside the ball electrode housing member 310. The ball electrode member 320 is a high frequency electrode that applies a high frequency by being brought into contact with the skin of the person being treated, i.e., the patient, and generates a high frequency by receiving electric power through a known mechanism for supplying electric power to a rotating body. Each of the roller electrode member 200 and the ball electrode member 320 is, for example, a capacity electric transfer (CET) type electrode or a resistive electric transfer (RET) type electrode. The electrode lifting part 400 may be a hydraulic cylinder, but the present disclosure is not limited thereto. For example, the electrode lifting part 400 may be other known linear reciprocating devices such as a rack pinion structure using a pinion gear rotated by a motor and a rack gear meshing with the pinion gear, a ball screw type linear actuator, etc. The ball electrode member 320 protrudes from a lower surface of the ball electrode housing member 310 and is rotatably positioned so as to be freely rotated in a 360 degree radius by being brought into contact with the skin. The ball electrode part 300 is positioned at a lower height than the roller electrode members 200 with respect to the lower surface of the handpiece casing part 100. The ball electrode part 300 may be positioned in a state inserted into the handpiece casing part 100 so as not to be brought into contact with the skin when a treatment is performed with the roller electrode members 200. In addition, the ball electrode part 300 may be positioned so that the ball electrode member 320 protrudes from the lower surface of the handpiece casing part 100. Thus, when the roller electrode member 200 performs the treatment by applying a high frequency to the skin, the ball electrode member 320 may be rotated in contact with the skin to generate a massage effect on the skin. The ball electrode member 320 may protrude to a height equal to that of the roller electrode members 200. Thus, when the roller electrode members 200 are brought into contact with the skin, the ball electrode member 320 may be rolled in contact with the skin to generate a massage effect on the skin, thereby improving a therapeutic effect. In this case, no electric power is applied to the ball electrode member 320, and the ball electrode member 320 provides only a massage effect while being simply rolled in contact with the skin. In a case where both the roller electrode members 200 and the ball electrode member 320 receive electric power and simultaneously apply a high frequency to the skin, burning may be caused in a treated area of the skin and excessive heat may cause damage to the skin. To overcome such a problem, when the ball electrode member 320 and the roller electrode members 200 are simultaneously brought into contact with the skin, the supply of the electric power to the ball electrode member 320 is cut off so that only the roller electrode members 200 apply the high frequency to the skin. In addition, the ball electrode part 300 may protrude to a height higher than that the roller electrode members 200 with respect to the lower surface of the handpiece casing part 100. Thus, only the ball electrode member 320 may apply the high frequency by being brought into contact with the skin while the roller electrode members 200 are not brought into contact with the skin. The electrode lifting part 400 may include a stopper panel 410 connected to the ball electrode housing member 310, positioned to be spaced apart from an upper portion of the handpiece casing part 100, and limiting a maximum protrusion height of the ball electrode part 300. The maximum protrusion height of the ball electrode part 300 limited by the stopper panel 410 is a height at which only the ball electrode member 320 applies the high frequency by being brought into contact with the skin while the roller electrode members 200 are not brought into contact with the skin. A first ball electrode power application terminal 411 applying electric power to the ball electrode part 300 is positioned on a lower surface of the stopper panel 410. A second ball electrode power application terminal 412 electrically connected to the first ball electrode power application terminal 411 to apply electric power to the ball electrode part 300 is positioned on an upper surface of the handpiece casing part 100. The ball electrode part 300 applies the high frequency to the skin by receiving electric power only when the ball electrode part 300 protrudes to a maximum height from the lower surface of the handpiece casing part 100 as the stopper panel 410 is seated on the upper surface of the handpiece casing part 100. When the first ball electrode power application terminal 411 and the second ball electrode power application terminal 412 are electrically connected to each other, the supply of the electric power to the roller electrode members 200 is automatically cut off so that the electric power is supplied only to the ball electrode part 300. Due to the fact that the ball electrode part 300 applies the high frequency to the skin by receiving the electric power only when it protrudes to the maximum protrusion height from the lower surface of the handpiece casing part 100, in a case where the ball electrode part 300 is brought into contact with the skin simultaneously with the roller electrode members 200 by protruding to a height equal to that of the roller electrode members 200 or protruding to a height lower than the maximum protrusion height, the ball electrode part 300 may be maintained in a state in which the supply of the electric power is automatically cut off. During a high frequency treatment, the roller electrode members 200 may be rubbed against the skin in one direction while being rotated in one direction, and the ball electrode member 320 may be rubbed against the skin in any direction while being freely rotated in a 360 degree radius. Depending on the treated area and skin condition of the patient, the practitioner may perform the high frequency treatment in various manners. For example, the practitioner may rub the roller electrode members 200 in one direction against the treated area of the skin. Alternatively, the practitioner may protrude the ball electrode part 300 from the lower surface of the handpiece casing part 100 and then rub the roller electrode members 200 against the treated area while allowing the ball electrode member 320 to massage the skin. Alternatively, the practitioner may protrude the ball electrode part 300 to the maximum protrusion height from the lower surface of the handpiece casing part 100 and then freely rub the ball electrode member 320 in any direction against the treated area. In other words, the high frequency treatment handpiece having roller electrodes according to the present disclosure may be used by selecting any one of a basic mode in which only the roller electrode members 200 are operated, a ball electrode mode in which only the ball electrode part 300 is operated, and a massage mode in which the roller electrode members 200 are operated while allowing the ball electrode part 300 to be brought into contact with the skin simultaneously with the roller electrode members 200. On the other hand, the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure may further include: a display panel part 500 displaying treatment information such as intensity of high frequency applied during treatment, treatment time, and treatment mode on a screen; and a controller (not illustrated) connected to the display panel part 500 controlling the operation of the roller electrode members 200, the ball electrode part 300, and the electrode lifting part 400. The display panel part 500 may be rotatably positioned on an upper surface of the stopper panel 410 and may be opened or closed for use. The display panel part 500 is a touch screen panel that is operable by touch, allowing the practitioner to select and output necessary information and select the desired treatment mode by touching the panel. The controller may include the basic mode in which only the roller electrode members 200 are operated, the ball electrode mode in which only the ball electrode part 300 is operated, and the massage mode in which the roller electrode members 200 are operated while allowing the ball electrode part 300 to be brought into contact with the skin simultaneously with the roller electrode members 200. During the treatment, any one of the basic mode, the ball electrode mode, and the massage mode may be selected through the display panel part 500. FIG. 6 is a bottom view illustrating another embodiment of a high frequency treatment handpiece having roller electrodes according to the present disclosure. FIG. 7 is a use state view illustrating the other embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. Referring to FIGS. 6 and 7, the other embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure may be configured such that a plurality of roller electrode members 200 are positioned to movable upward and downward in a handpiece casing part 100, and a flat electrode part 900 that is brought into contact with the skin 1 of a patient when the roller electrode members 200 are lifted may be positioned on a lower surface of the handpiece casing part 100. As an example, the flat electrode part 900 is positioned at the center of the lower surface of the handpiece casing part 100 and the roller electrode members 200 are spaced apart from each other along the outer periphery of the flat electrode part 900. The flat electrode part 900 is a Peltier element that cools the skin 1 to generate a cooling treatment effect on the skin 1, but the present disclosure is not limited thereto. For example, the flat electrode part 900 may be other known cooling treatment electrodes capable of cooling the skin 1. The flat electrode part 900, i.e., the Peltier element, may be used for necrosis of fat cells by cooling the skin 1 to a low temperature of about 4° C. FIG. 6(a) exemplarily illustrates that the roller electrode members 200 are roller-shaped electrodes 201, and FIG. 6(b) exemplarily illustrates that the roller electrode members 200 are ball-shaped electrodes 202. However, the present disclosure is not limited thereto, and various other shapes capable of being rotated and rolled in contact with the skin may also be used. The roller electrode members 200 may be positioned to protrude from the lower surface of the handpiece casing part 100 in a state of being elastically supported by springs. Thus, the roller electrode members 200 may be inserted into the handpiece casing part 100 by being brought into contact with and pressed against the skin 1, allowing the flat electrode part 900 to be brought into contact with the skin 1. In addition, although not illustrated in FIGS. 6 and 7, the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure may further include a roller lifting part lifting and lowering the roller electrode members 200. Thus, the roller electrode members 200 may be lifted by the operation of the roller lifting part and thereby inserted into the handpiece casing part 100, allowing the flat electrode part 900 to be brought into contact with the skin 1. FIG. 7(a) illustrates that the roller electrode members 200 are lowered to a position protruding from the lower surface of the handpiece casing part 100 and perform a high frequency treatment while being rolled in contact with the skin 1. FIG. 7(b) illustrates that the roller electrode members 200 are lifted and inserted into the handpiece casing part 100 to allow the flat electrode part 900 to perform a cooling treatment in contact with the skin 1. According to the high frequency treatment handpiece having roller electrodes according to the present disclosure, it is possible to perform the high frequency treatment through the roller electrode members 200 or to selectively perform the cooling treatment through the flat electrode part 900. In addition, by employing a structure in which the roller electrode members 200 are elastically supported by the springs, it is possible to allow the roller electrode members 200 and the flat electrode part 900 to be simultaneously brought into contact with the skin 1 by pressing the handpiece casing part 100, thereby simultaneously providing a high frequency treatment effect through the roller electrode members 200 and a cooling treatment effect through the flat electrode part 900. FIG. 8 is a schematic view illustrating an embodiment of a ratchet part 600 of each of the roller electrode members 200 in the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. FIG. 9 is a view illustrating a screen displayed on the display panel part 500 in the embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure. Referring to FIGS. 8 and 9, the roller electrode member 200 may be rotated only in one direction by the ratchet part 600, and the controller may include a one direction movement mode and a roller fixed mode in the basic mode so that the one direction movement mode or the roller fixed mode is selected and used. The ratchet part 600 includes: a ratchet wheel member 610 positioned in a hollow hole 210 of the roller electrode member 200 and on which the roller electrode member 200 is rotatably positioned; and a pawl member 620 positioned on the roller electrode member 200 and caught on outer teeth of the ratchet wheel member 610 in a state of being elastically supported by a spring so as to allow the roller electrode member 200 to rotate in one direction. The roller electrode member 200 has the hollow hole 210 into which the fixed ratchet wheel member 610 is inserted, and is rotated around the ratchet wheel member 610 inserted into the hollow hole 210. It should be noted that the ratchet wheel member 610 and the pawl member 620 are known ratchet mechanisms and a more detailed description will be omitted. A power supply brush terminal 630 being in elastically contact with an inner circumferential surface of the hollow hole 210 and applying electric power to the roller electrode member 200 may be positioned on the ratchet wheel member 610. A plurality of brush terminals 630 may be positioned in the circumferential direction of the ratchet wheel member 610 to stably apply electric power to the roller electrode member 200. The embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure may further include a rotation detection sensor 700 detecting the rotation of the roller electrode member 200. The rotation detection sensor 700 may be a known sensor such as an inductive rotation speed sensor, a Hall sensor, etc., but the present disclosure is not limited thereto. Various other known sensors may also be used and a more detailed description thereof is omitted. The embodiment of the high frequency treatment handpiece having roller electrodes according to the present disclosure may further include a pressure sensor 800 detecting the pressure applied to the pawl member 620 when the ratchet wheel member 610 is rotated in the reverse direction. The roller electrode member 200 is allowed to be rotated only in one direction but limited from being rotated in the other direction by the ratchet part 600 to thereby perform the role of a fixed electrode. The practitioner may select the one direction movement mode or the roller fixed mode through the display panel part 500. When the one direction movement mode is selected, the display panel part 500 displays the rotation direction of the roller electrode members 200 with an arrow to guide the practitioner to move the handpiece casing part 100 in the moving direction indicated by the arrow. The practitioner performs the treatment while moving the handpiece casing part 100 only in the moving direction indicated by the arrow in a state in which the roller electrode members 200 are in contact with the skin. At this time, the roller electrode members 200 are rubbed against the skin while being rotated. On the other hand, when the roller fixed mode is selected, the display panel part 500 displays the direction in which the roller electrode members 200 are not rotated, i.e., the direction in which the rotation thereof is limited by ratchet parts 600 with an arrow to guide the practitioner to move the handpiece casing part 100 in the moving direction indicated by the arrow. The practitioner performs the treatment while moving the handpiece casing part 100 only in the moving direction indicated by the arrow in a state in which the roller electrode members 200 are in contact with the skin. At this time, the roller electrode members 200 are rubbed against the skin while being fixed without rotation. The rotation detection sensor 700 detects that the roller electrode members 200 are rotated in the roller fixed mode and transmits the detection result to the controller. The controller then notifies the practitioner that the roller electrode members 200 are rotated in the roller fixed mode, i.e., the moving direction of the handpiece casing part 100 in the roller fixed mode is incorrect, thereby allowing the practitioner to perform a correct treatment. The pressure sensor 800 detects the pressure applied to pole members 620 when the roller electrode members 200 are about to be rotated in the reverse direction in the one direction movement mode and transmits the detection result to the controller. Then, the controller notifies the practitioner that the moving direction of the handpiece casing part 100 is incorrect in the one direction movement mode, thereby allowing the practitioner to perform a correct treatment. The controller may notify the practitioner through the screen of the display panel part 500 that the moving direction of the handpiece casing part 100 is incorrect, or notify the practitioner by outputting a voice through a speaker, but the present disclosure is not limited thereto. Various other known notification means may also be used and a more detailed description thereof is omitted. By the provision of the roller electrodes that are rotated in contact with the skin, the present disclosure prevents burning when the continuous rubbing of the treated area is performed during a treatment, allows the practitioner to conveniently perform the treatment, and allows the person being treated to comfortably receive the treatment with minimum pain. The ball electrodes and roller electrodes can be selectively used, and the roller fixed mode, which limits the rotation of the roller electrodes, can also be selectively used. Thus, various massage effects can be selectively provided in accordance with the condition of the patient's skin, and the effect of the high frequency treatment can be maximized by means of the various massage effects. The present disclosure is not limited to the above-described embodiment, and various modifications can be made without departing from the scope of the present disclosure, which is intended to be defined by the appended claims. 1. A high frequency treatment handpiece having roller electrodes, the high frequency treatment handpiece comprising: a handpiece casing part; and a plurality of roller electrode members rotatably positioned on a lower surface of the handpiece casing part and configured to apply a high frequency by being brought into contact with a skin of a patient. 2. The high frequency treatment handpiece of claim 1, further comprising: a ball electrode part positioned to be movable upward and downward in the handpiece casing part and having a ball electrode member that protrudes from a lower surface thereof, configured to be rolled in contact with the skin, and configured to apply a high frequency; and an electrode lifting part configured to move the ball electrode part upward and downward. 3. The high frequency treatment handpiece of claim 2, wherein the ball electrode part is positioned to protrude from the lower surface of the handpiece casing part so that the ball electrode member is positioned to protrude to a height equal to or lower than a height of the roller electrode members, whereby when the roller electrode members are brought into contact with the skin, the ball electrode member is brought into contact with the skin simultaneously with the roller electrode members and is rolled in contact with the skin to generate a massage effect on the skin. 4. The high frequency treatment handpiece of claim 3, wherein the ball electrode member is positioned to protrude from the lower surface of the handpiece casing part so that when the ball electrode member is brought into contact with the skin simultaneously with the roller electrode members, the ball electrode member is in a state in which the supply of electric power is cut off. 5. The high frequency treatment handpiece of claim 3, wherein the electrode lifting part comprises a stopper panel connected to the ball electrode part, positioned to be spaced apart from an upper portion of the handpiece casing part, and configured to limit a maximum protrusion height of the ball electrode part, wherein the maximum protrusion height of the ball electrode part limited by the stopper panel is a height at which only the ball electrode member applies the high frequency by being brought into contact with the skin while the roller electrode members are not brought into contact with the skin. 6. The high frequency treatment handpiece of claim 5, wherein a first ball electrode power application terminal configured to apply electric power to the ball electrode part is positioned on a lower surface of the stopper panel, and a second ball electrode power application terminal electrically connected to the first ball electrode power application terminal and configured to apply electric power to the ball electrode part is positioned on an upper surface of the handpiece casing part, wherein when the ball electrode part protrudes to the maximum protrusion height from the lower surface of the handpiece casing part as the stopper panel is seated on the upper surface of the handpiece casing part, the ball electrode part applies the high frequency to the skin through electrical connection between the first and second ball electrode power application terminals. 7. The high frequency treatment handpiece of claim 1, wherein the plurality of roller electrode members are positioned to be movable upward and downward in the handpiece casing part, and a flat electrode part configured to be brought into contact with the skin of the patient when the roller electrode members are lifted is positioned on the lower surface of the handpiece casing part. 8. The high frequency treatment handpiece of claim 7, wherein the roller electrode members are positioned to protrude from the lower surface of the handpiece casing part in a state of being elastically supported by springs so that the roller electrode members are inserted into the handpiece casing part by being brought into contact with and pressed against the skin, allowing the flat electrode part to be brought into contact with the skin, or a roller lifting part configured to lift and lower the roller electrode members is further provided so that the roller electrode members are lifted by the operation of the roller lifting part. 9. The high frequency treatment handpiece of claim 7, wherein the roller electrode members are roller-shaped electrodes or ball-shaped electrodes, and the flat electrode part is a Peltier element that is configured to cool the skin to generate a cooling treatment effect on the skin.

2020-07-08

en

2022-10-27

US-201013319415-A

Method and apparatus for continuously mixing fibers with a binding agent ABSTRACT The invention relates to a method for continuously mixing fibers with a binding agent for producing fiberboards in a continuously operating mixing apparatus which comprises at least one mixing chamber and one or a plurality of mixing tools fastened to a rotating mixer shaft, wherein the mixing tools mix the fibers with the binding agent and convey it in a conveying direction through the mixer. Said method is characterized in that the rotational speed (n) of the mixer shaft and the diameter (d) of the mixing chamber are matched to each other with the proviso that the (nominal) centrifugal acceleration of the fibers in the region of the mixer inside wall is 10000 to 30000 m/sec 2 . The invention relates to a method of continuously mixing fibers with a binder to produce fiberboard in a continuously operating mixing apparatus that has at least one mixing chamber and one or more mixing tools attached to a rotating mixer shaft, where the mixing tools mix the fibers with the binder and transport them in a transport direction through the mixer or the mixing chamber. In addition, the invention relates to a mixing apparatus for mixing fibers with a binder. Mixing apparatuses of this type are also referred to as gluing mixers. The mixing chamber is typically a cylindrical drum, although this drum does not rotate but is stationary. Coating fibers with glue and thus mixing fibers with a binder or glue is an essential process step in producing fiberboard. The quality of the fiberboard, for example wood-based boards, significantly depends on the quality of the fibers and in particular on a homogeneous coating of the fibers with glue. The approach is known in principle whereby wood fibers are mixed in what is called a blowline with a binder or glue, and thus coated with glue. The throughput capacity for this glue-coating technology is limited, however. Problems have furthermore sometimes arisen in practice in terms of so-called glue spots. The handling of isocyanate binder in particular has caused problems in blowline technology. For this reason, the approach has already been proposed for coating the fibers with glue in a mixer. The results that have been achieved in practice in the past using known glue-coating mixers have however often been unsatisfactory. An apparatus for continuously coating fibers with glue, where the apparatus is constructed as a horizontally extending glue-coating mixer using a drum-type design, has been disclosed, for example, in DE 24 38 818 [U.S. Pat. No. 4,006,887]. The mixer shaft in this embodiment is hollow and functions to supply the glue. To this end, the mixer shaft is fitted with mixing tools, the region of their hollow area being equipped with glue-centrifuging tubes that project therefrom. The diameter of this type of mixing container is approximately 600 mm, and a rotational speed of 1500 revolutions per minute is proposed for the mixer shaft. The intended goal here is to achieve a throughput performance of 3 to 4 t of fiber per hour. In previous practical experience, care had to be taken when coating fibers with glue using apparatuses of this type that the fibers to be coated with glue, which are set into a “rotating” motion by the mixing tools, have a specified rotation rate or peripheral speed. Mixers of different diameters are therefore operated in practice at substantially different rotational rates so as to set comparable speeds. The results achieved in this way have frequently been unsatisfactory. The object of this invention is to provide a method of continuously mixing fibers with a binder to produce fiberboard of the type described above, which method ensures perfect glue-coating results with simultaneously high throughput. In order to achieve this object, the invention teaches an approach relating to a method of the generic kind for continuously mixing fibers with a binder to produce fiberboard of the type described above, wherein the rotational speed n of the mixer shaft and the diameter d of the mixing chamber are matched to each other to meet the requirement that the (nominal) centrifugal acceleration of the fibers adjacent the inner wall of the mixer is 10,000 to 30,000 m/sec2. The (nominal) centrifugal acceleration is preferably 15,000 to 30,000 m/sec2. The fibers are accelerated by the rotating mixer shaft by the mixing tools outward toward the mixer housing, and then move essentially as a fiber ring through the mixer. The (nominal) centrifugal acceleration does not (necessarily) relate to the actual centrifugal acceleration of the moved fibers; what is referenced instead is a value for the is centrifugal acceleration a that is computed from the rotational speed n and diameter d as follows: a=2 π2 n 2 ·d. Diameter refers to the inside diameter of the mixing chamber. The invention is based on the discovery that optimal glue-coating depends less on the speed or circumferential speed of the fibers, but rather on the centrifugal acceleration of the fibers. High accelerations rates are established within the scope of the invention so that, for example operation can preferably be effected with relatively small diameters of the mixing chamber and relatively high rotational speeds of the mixer shaft. The invention preferably proposes an approach whereby the diameter d of the mixing chamber is 200 mm to 800 mm, preferably 300 mm to 700 mm. The rotational speed n of the mixer shaft can preferably be 1000 to 4000 rpm, especially preferably, 2000 to 4000 rpm. The method according to the invention is first of all suitable for coating wood fibers with glue, for example for MDF production. Fibers from annual plants, for example fibers from straw, for example rice straw, are also especially preferably coated with glue within the scope of the invention. The binder used in particular for these types of fibers from annual plants is isocyanate or contains isocyanate. This binder is particularly io well suited for these types of annual plants since some annual plants are often provided with a wax coating. The strong adhesive action of isocyanate-containing binders ensures problem-free processing despite this. A flawless glue-coating result is achieved using the method according to the invention with its high is centrifugal acceleration rates—without those problems occurring that have been observed previously in practice The method according to the invention is surprisingly especially well-suited for mixing fibers, and wood fibers in particular, with thermoplastic synthetic fibers, for example bicomponent fibers. An approach is known in principle whereby not only thermosetting binders such as, for example isocyanates, are used as the binders for wood-based boards, but instead it has already been proposed to use thermoplastic synthetic fibers, for example bicomponent synthetic fibers as binders, which fibers are mixed with the wood fibers and, for example dispersed using a mechanical dispersion head into a mat. Multi-component fibers of this type are distinguished by the fact that they have at least one first and one second synthetic component, where the synthetic components have different melting points. When the fiber mat is heated, one component, for example the second component of the synthetic fibers softens, after which the fiber mat is used to produce fiberboard, for example insulation board. Bicomponent filaments of this type surprisingly can be mixed homogeneously and with a high throughput especially effectively with wood fibers. The subject matter of the invention is also an apparatus for continuously mixing fibers with a binder to produce fiberboard, in particular, as set forth in a method of the type described above. The basic construction of this apparatus essentially has a horizontally extending cylindrical mixing chamber and at least one mixer shaft that is rotatable in the mixing chamber, a plurality of mixing tools being attached to the mixer shaft. The mixing chamber has at least one fill opening to supply the fibers and at least one outlet opening to discharge the fiber-binder mixture and a plurality of binder openings to supply the binder. The invention proposes an approach wherein a plurality of stiff combs are distributed as mixing tools around the outer surface of the mixer shaft, each of the stiff combs being provided with radially outwardly directed teeth, the stiff combs extending essentially parallel to the mixer axis, and every two adjacent stiff combs are offset by a predetermined amount relative to each other. These stiff combs or teeth perform both a mixing function and also a transport function, since the fibers are not only mixed with the binder during rotation of the mixer shaft by the mixing tools, but the mixture is also simultaneously transported without problem and with a high throughput in the transport direction from the fill opening to the outlet opening. The axial offset of the individual stiff combs enables an essentially spiral-shaped configuration of the teeth to be achieved, which configuration improves the transport effect. The individual teeth can also be referred to as rods or pins. These teeth or rods or pins are preferably designed without binder supply, i.e. the binder is not supplied through the teeth themselves but through separate (nonrotating) binder supply tubes that project, for example radially or tangentially by a predetermined amount through the mixing chamber housing into the interior of the mixing chamber. It is advantageous in this regard for the supply tubes projecting inside the mixing chamber are offset longitudinally relative to the teeth or to the stiff combs. This design allows the stiff combs to easily rotate at high speeds without colliding with the supply tubes, despite the fact that the supply tubes can project into the region of the teeth. Alternatively, a possible approach is for the stiff combs to have a plurality of short teeth in the region where the supply tubes are provided. These short teeth adjacent the supply tubes consequently are of shorter length than the remaining teeth that are outside the region of the supply tubes. It is not necessary with this design for the supply tubes to be longitudinally offset relative to the teeth. The length of these short teeth is matched here to the amount by which the supply tubes project into the interior of the chamber. Thee binder supply tubes are especially preferably disposed in the first half of the mixing chamber (relative to the transport direction), especially preferably in the first third of the mixing chamber. For example, two to ten, preferably three to seven glue supply tubes can be provided here that are arranged in pairs in the longitudinal direction of the mixer. It is also possible in principle to provide a plurality of such rows of supply tubes that can be distributed around the outer surface, or also distributed across the length of the chamber. In an alternative design, the invention also comprises forms of implementation in which the binder is supplied through the io mixer shaft and the mixing tools, for example the teeth. The mixer shaft in this type of mixer with “internal gluing” is provided in the form of a hollow shaft, and the teeth are proved simultaneously in the form of binder supply tubes that are connected to the mixer shaft. In another proposal of the invention, provision is made whereby the region of the mixer shaft near the fill opening is free of teeth, and transport tools, for example transport paddles are provided in this supply region. The fibers entering the mixing chamber through the fill opening are consequently transported quickly and reliably away by the transport tools, which act essentially as pushers, into the mixing region where they are then transported on by the teeth. In another proposal, the region near the outlet opening can optionally or additionally be free of teeth, and ejection tools, for example, ejection paddles, are provided in this discharge region. The fill opening is preferably disposed on top of the mixing chamber, and is provided, for example in the form of a loading funnel. The outlet opening or ejection opening is preferably provided on the bottom, for example in the bottom half of the mixing chamber, with the result that in overall terms loading and unloading are effected essentially by gravity. If the operation is effected using glue supply tubes that project essentially radially or tangentially through the mixer housing into the interior of the mixer, it is possible within the scope of the invention to provide these glue tubes so as to be height-adjustable. This means that the insertion depth of the glue tubes radially or tangentially into the interior of the mixing chamber can be adjusted. It is possible to use glue-coating tubes with single-component or two-component atomization. In addition, at least one drive is connected to the mixer shaft, optionally by interposing a gear transmission. The ejection side of the drive is preferably connected to the mixer shaft. This design is especially advantageous when interior glue-coating is employed and the glue is introduced through the supply side into the mixer shaft. The invention furthermore proposes an approach whereby the teeth or pins are wear-resistant. The inside walls of the mixing chamber or the mixer housing can also be wear-resistant, for example with hard facing. This wear-resistant embodiment is especially advantageous since mixing silicate-containing fibers, for example straw, can involve silicates emerging that strongly wear on the surface. The housing of the mixer can, for example be cooled, preferably by water cooling. The following describes the invention in more detail based on a drawing that illustrates only one embodiment. Therein: FIG. 1 is a simplified perspective view of a mixing apparatus according to the invention; FIG. 2 a shows an enlarged section of the structure in FIG. 1 adjacent fiber supply; FIG. 2 b shows another enlarged section of the structure of FIG. 1 adjacent discharge for the fiber-binding-agent mixture; FIG. 3 provides another section of the structure of FIG. 1; and FIG. 4 shows a section of a modified embodiment of a mixing apparatus and from a different perspective. The figures show a mixing apparatus for continuously mixing fibers with a binder to produce fiberboard. The mixing apparatus comprises an essentially horizontal chamber 1 with a cylindrically tubular housing 6 and at least one mixer shaft 2 rotatable in the mixing chamber 1 and carrying a plurality of mixing tools 3. The mixing chamber has a fill opening 4 that here is a loading funnel. The fibers are introduced into the interior of the mixing chamber 1 through this loading funnel from above This is indicated by arrow B. The tools 3 attached to the rotating mixer shaft 2 mix fibers with a binder and simultaneously transport the mixture in the direction F through the mixer. The binder is supplied through a plurality of binder tubes 5 that are attached to the chamber 1 and project completely through its housing 6 into the interior of the chamber 1. In the illustrated embodiment, the supply of binder is consequently effected not by the mixer shaft or by the mixing tools but by the supply tubes 5 that are in the form of supply nozzles permanently attached to the chamber 1 or to the housing 6 of the chamber 1. In addition, the mixing apparatus has an outlet opening 7 at the downstream end in the transport direction F. The mixture consisting of fibers and binder is discharged or ejected through this outlet opening 7. This is indicated by arrow E. The outlet opening 7 is provided here in the bottom of the chamber 1. Here, a plurality of stiff combs distributed over the outer surface of the mixer shaft 2 are provided as mixing tools 3, the combs each having a plurality of radially outwardly directed teeth 8 and 8′. The stiff combs extend along the longitudinal direction of the mixing chamber and thus parallel to the longitudinal axis A of the mixer. For example, three to fifteen, preferably five to ten stiff combs 3 can be distributed over the outer surface of the mixer shaft 2. The invention proposes an approach whereby two stiff combs 3 each are offset in the axial or longitudinal direction L by a predetermined amount M relative to each other. This design results in the ends of individual teeth 8 or 8′ ly8ng essentially on a spiral as seen in a top view. This ensures that not only is a problem-free mixing of the fibers effected with the binder, but also that a problem-free transport of the mixture is ensured with high throughput. The supply tubes 5 in the embodiments are disposed in rows extending along the longitudinal direction L of the mixer. In the embodiment of FIGS. 1 through 3, the supply tubes 5 that project completely through the mixer wall 6 into the mixing chamber are offset relative to the teeth 8 of the stiff combs 3. This is shown, for example, FIG. 3. It is evident that the supply tubes 5 essentially between the teeth 8 of the stiff combs 3 in this embodiment without any collisions occurring between the teeth 8 and the supply tubes 5. The design is chosen so that the clearance between the teeth 8 and the supply tubes 5 is at least 2 mm, preferably at least 4 mm. In the modified embodiment of FIG. 4, the supply tubes 5 are not offset relative to teeth 8 and 8′ but aligned essentially flush. Here shortened teeth 8 are provided adjacent the supply tubes 5 so as to avoid any collisions between teeth 8 and 8′ and the supply tubes 5. The length of teeth 8′ adjacent the supply tubes 5 is consequently shorter than the length of teeth 8 in the other regions of the mixer. The figures furthermore illustrate that the region of the mixer shaft 2 near the fill opening 4 is designed to be tooth-free, transport tools 9 being attached to the mixer shaft 2 in this supply region. These transport tools in the embodiment are provided in paddle form as pushing tools or pushing paddles. They ensure that the fibers entering into the chamber 1 through the fill opening 4 are quickly accelerated and are transported into the glue-coating region (see FIG. 2 a). It is furthermore evident that the region of the mixer shaft 2 near the outlet opening 7 is also tooth-free, ejection tools 10 being attached to the mixer shaft 2 in this outlet region. These ejection tools 10 are also provided in paddle-shape as ejection paddles. They ensure rapid discharge of the mixture of fibers and binder, and thus of the glue-coated fibers through drop opening 7 (see FIG. 2 b). The mixer tools 3 provided as stiff combs include a mounting bar 11 that extends along a longitudinal direction L and thus parallel to an axis A. The teeth or pins 8 and 8′ are attached to this mounting bar 11. The teeth 8 and 8′ here extend orthogonally to the mounting bar 11. An unillustrated drive, not shown, is connected in the manner known per se to the mixer shaft 2. Only a belt pulley 12 is indicated in FIG. 2 b for connecting the drive to the mixer shaft 2. The drive is thus disposed downstream end or outlet in the illustrated embodiment. When the mixing apparatus according to the invention is operating, fibers are introduced through the funnel 4 into the chamber 1 as indicated by arrow B, while binder, for example glue, such as for example isocyanate is simultaneously supplied through the supply tubes 5. The fibers are transported by the mixing tools 3 according to the invention in the longitudinal direction L and in the process moved by centrifugal acceleration outwardly, and thus into the region of mixer wall 6. A rotational speed n of the mixer shaft and diameter d of the mixing chamber are matched to each other according to the invention so that (nominal) centrifugal acceleration a of the fibers is from 15,000 to 30,000 m/sec2 adjacent the mixer wall. The diameter d is preferably 300 mm to 700 mm, while the rotational speed n of the mixer shaft is preferably 2000 to 4000 rpm. Operation is thus effected with relatively small diameters and high rotational speeds, thereby achieving high centrifugal accelerations. This ensures that the fibers are pressed effectively against the housing 6 or the inner surface of the mixer 1 and essentially compressed. This results in increased friction and thus in an improved glue-coating performance. At the same time, high throughput levels of, for example 5 t to 10 t per hour can be achieved. 1. A method of continuously mixing fibers with a binder to produce fiberboard in a continuously operating mixing apparatus that has at least one housing defining mixing chamber and one or more mixing tools attached to a rotating mixer shaft inside the housing the method comprising the steps of: feeding the fibers and the binder into a supply end of the mixing chamber; rotating the shaft such that the mixing tools orbit and mix the fibers with the binder and transport the mixed binder and fibers in a transport direction through the mixing chamber longitudinally away from the supply end, and setting a rotational speed of the mixer shaft a relative to a diameter of the mixing chamber such that a centrifugal acceleration of the fibers adjacent the mixing chamber housing is 10,000 to 30,000 m/sec2. 2. The method according to claim 1, centrifugal acceleration of the fibers is 15,000 to 30,000 m/sec2 adjacent the mixing chamber housing. 3. The method according to claims 1, wherein the centrifugal acceleration (a) of the fibers is computed from the rotational speed (n) and the diameter (d) as follows: a=2 π2 n2·d. 4. The method according to claim 1, wherein the diameter of the mixing chamber is 200 mm to 800 mm. 5. The method according to claim 1, wherein the rotational speed of the mixer shaft is approximately 1000 to 4000 rpm. 6. The method according to claim 1, wherein a thermosetting binder is used to glue the fibers. 7. The method according to claim 1 wherein fibers composed of wood or of annual plants are mixed with the binder. 8. The method according to claim 1, wherein fibers are mixed with a thermoplastic binder. 9. The method according to claim 8, wherein the thermoplastic fibers used are multicomponent fibers that are composed of at least one first and one second synthetic component that have different melting points. 10. An apparatus for continuously mixing fibers with a binder to produce fiberboard, comprising: at least one mixing chamber with a longitudinally extending and cylindrical mixing chamber housing, the mixing chamber being essentially horizontal, at least one mixer shaft rotatable in the mixing chamber and carrying a plurality of mixing tools the mixing chamber having at least one fill opening for the fibers and at least one outlet opening for the fiber-binder mixture and a plurality of binder supply openings to supply the binder, and a plurality of stiff combs that are distributed around the outer surface of the mixer shaft, run parallel to a longitudinal axis of the mixer, that serve as mixing tools, and that comb each include a plurality of teeth, each two angularly adjacent stiff combs being offset by a predetermined amount in an axial or longitudinal direction of the mixer. 11. The apparatus according to claim 10, wherein the teeth are not provided with binder supply means, the apparatus further comprising: supply tubes that supply the binder and that project into the interior of the mixing chamber. 12. The apparatus according to claim 10, wherein the teeth themselves are provided in the form of binder supply tubes that are connected to a mixer shaft that is hollow. 13. The apparatus according to claim 11, wherein the supply tubes project into the mixing chamber, are preferably oriented radially or tangentially, and are offset relative to the teeth or the stiff combs. 14. The apparatus according to claim 11, wherein the teeth of the stiff combs adjacent the supply tubes are shortened and are of a length that is reduced relative to the other teeth. 15. The apparatus according claim 10, wherein the region of the mixer shaft near the fill opening is tooth-free, transport tools being attached to the mixer shaft in this supply region of the mixer shaft. 16. The apparatus according to claim 10 wherein the region of the mixer shaft near the outlet opening is tooth-free, ejection tools, for example ejection paddles, being attached in this discharge region of the mixer shaft to the mixer shaft. 17. The apparatus according to claim 10, wherein the mixing tools formed stiff combs each include a mounting bar that is oriented parallel to the longitudinal direction of the mixer and is attached to the mixer shaft, a plurality of teeth oriented orthogonally relative to the mounting bar being attached to the mounting bar.

2010-05-11

en

2012-05-17

US-94660407-A

Method for infrared imaging of living or non-living objects including terrains that are either natural or manmade ABSTRACT An improved system for infrared (IR) imaging of terrain is disclosed wherein or or more IR cameras may be used at one or more locations to record images at multiple focal planes. The images are all taken of the same field of view but at varied focal planes. Global Positioning Satellite (GPS) may be used to track each camera location and each camera captures images of the object. Information regarding the orientation of the camera may also be measured. The digital information from the images from each camera at varying focal planes, the distance from the object to each camera, orientation of camera and the GPS location of each camera is transferred to a computer where the data is processed through the use of merging and photogrammetry software utilizing appropriate algorithms to convert the multiple images into a two-dimensional or three-dimensional image with improved depth of field. CROSS REFERENCE TO RELATED APPLICATIONS This application is a continuation-in-part of U.S. patent application Ser. No. 11/742,751 filed May 1, 2007, which is a continuation-in-part of U.S. patent application Ser. No. 11/506,701 filed Aug. 18, 2006, which is a continuation-in-part of U.S. patent application Ser. No. 10/971,217 filed Oct. 22, 2004, both of which are herein incorporated by reference. GOVERNMENT CONTRACT United States Government has certain rights to this invention pursuant to the funding and/or contracts awarded by the Strategic Environmental Research and Development Program (SERDP) in accordance with the Pollution Prevention Project WP-0407. SERDP is a congressionally mandated Department of Defense (DOD), Department of Energy (DOE) and Environmental Protection Agency (EPA) program that develops and promotes innovative, cost-effective technologies. FIELD OF THE INVENTION The present invention relates to improved infrared imaging of living or non-living objects including terrains that are either natural or manmade, and more particularly relates to image enhancement of objects that may be camouflaged in the normal visible or IR spectrums. BACKGROUND INFORMATION Radiation in the infrared range is of longer wavelength than visible light. The different wavelength of Infrared Radiation (IR) has several unique characteristics. For instance, materials that are opaque to visible light may be transparent to infrared, and vice-versa. Infrared is much less subject to scattering and absorption and infrared cannot be seen by the human eye. Also, unlike visible light, which is given off by ordinary objects only at very high temperatures, infrared energy is emitted by all objects at room temperatures and lower. This means that infrared radiation makes objects detectable in the dark. Different objects give off varying amounts of infrared energy, depending on the temperature of the object and their emissivity. IR cameras are designed to sense differing amounts of infrared energy coming from the various areas of a scene by focal plane array detector and to convert them to corresponding intensities of visible light by electronics for display purposes. However, Depth of Field (DOF) in IR cameras is limited similar to standard optical systems. In optics, DOF is the distance in front of and behind the subject which appears to be in focus. For any given lens setting, there is only one distance at which a subject is precisely in focus, and focus falls off gradually on either side of that distance, so there is a region in which the blurring is tolerable often termed “circle of confusion”. IR cameras similarly have only one distance at which a subject is precisely in focus. This limits the depth an observer is able to see in the image. The present invention has been developed in view of the foregoing. SUMMARY OF THE INVENTION In one embodiment, a single IR camera may be used to capture multiple image of the same scene from along a common optical axis. These images are then merged to provide an image with improved depth of field. In one embodiment, multiple IR cameras set a know distance apart record images of the same scene from different angles at multiple focal planes for a set field of view. The data from each image is transferred to a computer which merges the focused portions of the multiple images into one focused image with improved depth of field. The merger of the stacked images occurs through the use of appropriate algorithms which may also convert the data through photogrammetry into a three-dimensional image. In another embodiment of the invention, multiple IR cameras are used at different locations to record images from multiple focal planes. The images are all taken of the same object(s) from varying perspectives. Global Positioning Satellite (GPS) tracks each camera location and each camera captures images of the object. The digital information from the images from each camera at varying focal planes, the distance from the object to each camera, orientation of camera and the GPS location of each camera is transferred to a computer where the data is processed through the use of photogrammetry and appropriate algorithms into a three-dimensional image. It is an aspect of this invention to provide an imaging system, comprising a infrared camera, a first image generated at a first focal plane, a second image generated at a second focal plane, means for determining the distance from the camera to the first and second focal planes and means for combining the first and second image into a single image with improved depth of field. Another aspect of the present invention is to provide an imaging system, comprising a first infrared camera located at a first position, a first image generated by the first infrared camera at a first focal plane, a second image generated by the first infrared camera at a second focal plane, a second infrared camera located at a second position, a third image generated by the second infrared camera at a third focal plane, a fourth image generated by the second infrared camera at a fourth focal plane and means for merging the first image with the second image and for merging third image with the fourth image. These and other aspects will become apparent from the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 shows a single IR camera acquiring multiple images at varying focal planes with a scene according to one embodiment of the present invention. FIG. 2 is a flowchart depicting a process by which a single infrared camera may acquire and merge multiple images at varying focal planes according to one embodiment of the present invention. FIG. 3 shows the elevation angle, A, roll angle, B, and azimuth angle, C, which may be measured and incorporated in the image data according to one embodiment of the present invention. FIG. 4 shows how two IR cameras equipped with GPS may be used to triangulate points within a scene according to one embodiment of the present invention. FIG. 5 shows how multiple IR cameras may be used from different perspectives to acquire images at multiple focal planes within the same scene according to one embodiment of the present invention. FIG. 6 is a flowchart depicting a process by which multiple infrared cameras may be used to acquire and merge multiple images at varying focal planes according to one embodiment of the present invention. FIG. 7 shows infrared cameras mounted on aircraft used to capture improved depth of field images from multiple locations. DETAILED DESCRIPTION Infrared cameras convert IR radiation (˜750 nm to 1 mm) to a digital signal based on the wavelength of the radiation. As the makeup of terrain changes so too does the IR radiation produced by the surface. IR cameras are able to detect these changes and portray them as an image. Focal planes 12 are described and visualized as two dimensional as shown in FIG. 1. As commonly used, the term “focal plane” refers to planes, perpendicular to the optic axis, which pass through the front and rear focus points behind the lens of the camera. As used herein the term “focal plane” refers to a plane, perpendicular to the optic axis, which passes through the front focus point, i.e. a plane within the object space unless expressly indicated to have a different meaning. The term “optic axis” refers to an imaginary line perpendicular to the lens of a camera and passing through the center of the lens. As used herein the term “image” refers to a visual representation of an object or scene which may be stored electronically or displayed as a photograph or through an electronic display, e.g. an LCD screen, a CRT monitor, a plasma display, an OLED screen, a PHOLED, a plotter or a printer. As described above, increased and decreased depth around the focal plane remains visible but less focused as distance from the focal plane is increased. With reference now to FIG. 1 and FIG. 2, an IR camera 10 may be used to capture multiple images within the same field of view. Camera 10 focus is adjusted to capture images at focal planes 12 having different distances, D, from the camera 10 along a common optical axis. Images captured while an IR camera is in one location with one orientation share a common optical axis. The camera, 10, may be equipped with a GPS receiver 61 and a range finder 16 which may be a laser. The GPS receiver 61 is used to identify the location of the camera 10 and the range finder 16 can measure the distance, D, from the camera 10 to objects within each focal plane 12. The captured images of the same scene can then be merged into one image of the scene having improved depth of field. Coordinate data may also be incorporated into the merged image based on distances from the GPS coordinates of the camera 10 to objects in each focal plane 12 acquired by the range finder 16. The flowchart shown in FIG. 2 provides a overview of the process by which multiple images are acquired and merged. In one embodiment the camera 10 may be further equipped with theodolite equipment or other camera attitude equipment to improve the accuracy of the coordinates generated within the image. As used herein, “attitude equipment” refers to measurement equipment for determining the elevation angle, roll angle and azimuth angle of the camera relative to local gravity. In this embodiment, the camera 10 may be equipped so that, as seen in FIG. 3, the elevation angle, A, the roll, B, and the azimuth angle, is known and may be compensated for in the final coordinate determination. FIG. 4 illustrates a two camera 10, 20 embodiment of the present invention and shows how the two IR cameras may be utilized to detect the range, size and coordinates of distant objects 50. The distance, D1 between the cameras 10,20 may be known or may be determined through the use of range finders or GPS receivers 61, 62 accompanying the cameras 10, 20. Similarly, distances, D2 and D3, may be known or may be calculated through the use of a range finder, for example, a laser. In another embodiment, the D2 and/or D3 can be calculated through triangulation. Intersection points 70,80 can be readily calculated by way of triangulation. In this embodiment each camera must be equipped so that, with reference to in FIG. 3, the elevation angle, A, the roll, B, and the azimuth angle, C, is known and may be compensated for in the final measurement. In yet another embodiment, the focus of the camera may be calibrated so that the D2 and/or D3 is determined by adjustment of the focus of the camera 10,20. In yet another embodiment and again referring to FIG. 4, if the distance between the cameras is known (α−θ) and (β−ε) can give the size of an object 50 within a known field of view of the cameras 10,20. If the object 50 is moving the angular rate of change of one or both cameras 10,20 may be used to calculate the velocity and acceleration of the object 50. With reference now to FIG. 5, the present invention improves the infrared inspection of terrains by providing the observer with clearer two-dimensional images and available three-dimensional views of the terrain. In this embodiment, two IR cameras 10,20 are directed at the same scene 30 but from different perspectives or lines of sight. Each camera 10, 20 generates images of the scene 30 at different focal planes 12,22. For purposes of illustration only two focal planes 12 are shown for the first camera 10 and two focal planes 22 for the second camera 20. However, more images at different focal planes 12,22 would be used. Similarly, only two cameras 10,20 are shown, but additional cameras may be used to improve the final three dimensional image. The images generated at differing focal planes 12 may then be merged into a single first image from the perspective of the first camera 10 with an improved depth of field. A second image with improved depth of field may also be generated from the perspective of the second camera 20 by merging the images of the differing focal planes 22. As described in more detail below, the data from the merged images two-dimensional images can then be further combined to yield a three-dimensional image of the scene 30. Points along focal plane intersections 40 can be used to determine coordinates within the scene 30 through the use of known algorithms commonly used in photogrammetry. Referring now to the flowchart in FIG. 6, the process for multiple camera image acquisition is described. Two or more cameras are arranged in different locations. Each camera has a line of sight at the same object scene. It should be noted that the cameras may be hand-held, stand-mounted, or vehicle-mounted. The location of each camera is first determined. This may be accomplished through the use of a GPS receiver accompanying the camera or the location may be known. The range of a target object in the focal plane is then determined. At this point distance between the cameras is known and distance to an object in intersecting focal planes has been determined. Each camera may also be equipped with attitude equipment. The attitude data provides elevation angle, azimuth angle and roll angle for each camera which may be used to compensate for errors in or replace the distance data from each camera to the focal plane of interest. An image is then acquired with each camera. Coordinates within each image can then be calculated. This process is repeated several times until a sufficient amount of data is available to produce an acceptable image. Software embedded in the camera or communicated to a remote device merges the 2-dimensional images from each camera perspective into an image having improved depth of field. The 2-dimensional image may also have coordinate information inserted into the image. In one embodiment the 2-dimensional images are further combined by the embedded software to produce 3-dimensional renderings of the terrain. In one embodiment shown in FIG. 7, the camera 10 is mounted on a aircraft 90. Multiple infrared images are then acquired at different locations. Again, the distance of each focal plane may be determined through the use of a range finder. The roll, azimuth and elevation angles of the camera are then recorded as well as the elevation of the aircraft 90. In flight GPS records the coordinates of the camera for each photo taken. The photos at the different locations are merged into improved depth of field images with coordinate and elevation information. The improved images may then be transformed into 3-dimensional graphical images. The recorded images are merged or stacked using software using appropriate algorithms to process the digital data of each image. The algorithm uses the focused depth for each image to produce an image that is in focus for a much greater depth of field than could be achieved using traditional methods. The software incorporates algorithms to select the focused portion of each image. The portion of individual images used is a function of the number of images selected to be taken between the top focal plane and the bottom focal plane. The focused portion of each image is stacked with the focused portions of the other images. The stack is then merged to create one image. The software produces an image that is in focus for a much greater depth of field than could be achieved using traditional methods. In fact, depth of field is primarily limited by the number images produced at differing focal planes. In another embodiment also illustrated in FIG. 7, a first IR camera 10 may be mounted on an first aircraft 90, such as a plane or a helicopter. While and aircraft is used in this embodiment for illustration the IR camera can be located on any vehicle, such as a wheeled vehicle or tracked vehicle without deviating from the invention. The IR camera 10 acquires multiple images while focused on an object 31 within a scene 30 when the aircraft 90 is at a first position. Additional images focused on the same object 31 within the scene to can subsequently be captured when the aircraft 90′ is at another position. The images may then be merged into 2-dimensional image or processed into 3-dimensional renderings. In another embodiment, a second aircraft 91 with a second IR camera 20 also captures images of the same scene. The data is then relayed back to a central unit where it can be processed photogrammetrically and through merging to produce an improved rendering of the scene. As described above, each aircraft is equipped with a GPS receiver so the coordinates of the aircraft when an image is acquired is known. Attitude equipment may also be incorporated into each camera 10, 20 so that azimuth, roll and elevation angles is factored into the algorithms determining the combined image. Additionally, the elevation of the aircraft may also be accounted for and utilized in the algorithms combining the images. Whereas particular embodiments of this invention have been described above for purposes of illustration, it will be evident to those skilled in the art that numerous variations of the details of the present invention may be made without departing from the invention as defined in the appended claims. 1. An imaging system, comprising: a infrared camera; a first image generated at a first focal plane; a second image generated at a second focal plane; means for determining the distance from the camera to the first and second focal planes; and means for combining the first and second image into a single image with improved depth of field. 2. The imaging system of claim 1, wherein the means for determining the distance to the first and second focal planes is a laser range finder. 3. The imaging system of claim 1, wherein the means for combining the images at the different focal plane into one image comprises a computer in communication with the infrared camera and software installed on the computer capable of combining the images into one merged image. 4. The imaging system of claim 3, wherein the first and second focal planes are perpendicular to an optical axis of the infrared camera. 5. The imaging system of claim 1, wherein at least three images are taken at at least three different focal planes. 6. The imaging system of claim 5, wherein the infrared camera is repositioned whereby at least one of the at least three different focal planes intersects another of the at least three different focal planes. 7. The imaging system of claim 6, wherein the images are combined using merging software and photogrammetry software. 8. An imaging system, comprising: a first infrared camera located at a first position; a first image generated by the first infrared camera at a first focal plane; a second image generated by the first infrared camera at a second focal plane; a second infrared camera located at a second position; a third image generated by the second infrared camera at a third focal plane; a fourth image generated by the second infrared camera at a fourth focal plane; and means for merging the first image with the second image and for merging third image with the fourth image. 9. The imaging system of claim 8, wherein the images are further combining by photogrammetry. 10. The imaging system of claim 9, wherein the first and second camera are equipped with GPS receivers. 11. The imaging system of claim 10, wherein at least one of the first and second cameras are equipped with attitude equipment. 12. The imaging system of claim 11, wherein the second camera is mounted on a vehicle. 13. The imaging system of claim 12, wherein the vehicle is an aircraft.

2007-11-28

en

2009-01-08

US-31506008-A

Adaptive configuration of windows-of-interest for accurate and robust focusing in multispot autofocus cameras ABSTRACT In accordance with the exemplary embodiments of the invention there is at least a method, executable computer program, and apparatus to provide operations including logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation in an autofocus window of interest, assigning a focus value mask to each of the plurality of parts of the at least one sub-window, and executing an autofocus algorithm using the assigned focus value masks. TECHNICAL FIELD The teachings in accordance with the exemplary embodiments of this invention relate generally to an autofocus feature in a digital imaging camera and, more specifically, relate to a novel adaptive configuration scheme for operations using windows of interest in a multispot autofocus. BACKGROUND This section is intended to provide a background or context to the invention that is recited in the claims. The description herein may include concepts that could be pursued, but are not necessarily ones that have been previously conceived or pursued. Therefore, unless otherwise indicated herein, what is described in this section is not prior art to the description and claims in this application and is not admitted to be prior art by inclusion in this section. In recent years digital imaging cameras have been commonly used as imaging devices for photographing subjects. A conventional digital camera (such as a digital still camera or digital video camera) generally acquires an image by using an imaging element or the like, and records the image as digital image data in an internal memory or integrated circuit card provided inside the camera. In an imaging device such as the above-described digital imaging camera, a lens is provided for the purpose of focusing a subject image onto the imaging element with the subject is being photographed. By controlling a focusing of the lens, a focusing distance can be aligned with the subject being photographed. To address a wide spectrum of customer needs, mobile phones are rapidly converging into multi-purpose devices that incorporate multiple different products including digital imaging cameras. Digital imaging cameras nowadays are often seen as an integrated part of any mobile phone. However, the digital imaging features of these camera phones are mostly less functional and reliable than their counterparts, stand-alone digital imaging cameras. To address this gap of functionality and reliability, camera phones manufacturers strive to offer more sophisticated features and technological know-how to ensure high quality photo images with the digital imaging features of their phones. One important feature to be included in a camera system is autofocus (AF). The AF feature is designed to allow a user of the camera system to obtain a correct focus of a subject of particular interest without manually adjusting the lens focal length. All automatic focusing algorithms can be divided into two broad categories: active and passive. While active AF can be achieved using the external sensors (e.g. infrared), many consumer-level digital and cell phone cameras utilize passive AF. Passive AF is used to determine the correct focus of an image by using contrast or image sharpness measurements of the image. It can be understood that these measurements for AF may be performed for one or several respective areas or windows of the image. Generally, a passive AF is performed utilizing an AF algorithm to calculate a measurement of image sharpness or focus corresponding to the image in order to determine a best in-focus setting. The in-focus setting is usually found by choosing a respective lens position where the image sharpness or focus is maximal. Then the determined in-focus setting can be used for an AF of the image. It is noted that the operation of the AF techniques of the prior art digital cameras may deviate in their details somewhat from the description given above. However, it can be realized that prior art AF systems, such as the ones mentioned above, may be subject to certain limitations. These limitations can become apparent for certain cases, such as for cases where a resulting calculation of an image sharpness or focus does not correspond to a particular setting of the image, or where a condition of the subject or the camera interferes with the abilities of the AF system. Some of these limitations are described below in non-limiting terms. According to the numerous surveys, a highly frequent use of cameras in mobile devices is portrait imaging. Portrait imaging may be seen as the photographing of a single person or a group of people at a shorter distance, such as 1.5-3 meters, set to a more distant background which may constitute contrasting scenery. In a portrait image the single person or group of people of the image may be smaller parts of the image in comparison to the scenery. As such, a problem can exist where an AF technique, such as the passive AF technique as described above, may not choose the best in-focus position desired for the photograph. In addition, it is common that while a photograph is being taken the image lighting may be low which may tend, among other things, to render parts of the image less distinguishable from other parts of the image, thus effecting an AF. Further, it is a common occurrence that during an AF the camera may inadvertently move during a photograph due to a shaking of a hand holding the camera and/or a movement of the subject being photographed. These common occurrences can subsequently lead to inaccuracies in an AF process. Exemplary embodiments of the invention address potential AF problems, such as the ones mentioned above by example. SUMMARY In an exemplary aspect of the invention, there is a method comprising logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation in an autofocus window of interest, assigning a focus value mask to each of the plurality of parts of the at least one sub-window, and executing an autofocus algorithm using the assigned focus value masks. In another exemplary aspect of the invention, there is a computer readable medium encoded with a computer program executable by a processor to perform actions comprising logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation of an autofocus window of interest, assigning a focus value mask to each of the plurality of parts of the at least one sub-window, and executing an autofocus algorithm using the assigned focus value masks. In still another exemplary aspect of the invention, there is an apparatus comprising a processor configured to logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation of an autofocus window of interest, the processor configured to assign a focus value mask to each of the plurality of parts of the at least one sub-window, and the processor further configured to execute an autofocus algorithm using the assigned focus value masks. In yet another exemplary aspect of the invention, there is an apparatus, comprising means for logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation in an autofocus window of interest,means for assigning a focus value mask to each of the plurality of parts of the at least one sub-window, and means for executing an autofocus algorithm using the assigned focus value masks. In according to the exemplary aspect of the invention above, the means for logically separating, means for assigning, and means for executing comprises a processor. BRIEF DESCRIPTION OF THE DRAWINGS The foregoing and other aspects of embodiments of this invention are made more evident in the following Detailed Description, when read in conjunction with the attached Drawing Figures, wherein: FIG. 1 illustrates a block diagram showing functional modules of a device which may incorporate the exemplary embodiments of the invention; FIG. 2 illustrates a Window of interest in many current implementations of multispot AF; FIG. 3 illustrates a Window of interest in the proposed implementation of multispot AF with overlapping sub-WOIs; and FIG. 4 illustrates a Window of interest in multispot AF with moving sub-WOIs in the middle row. DETAILED DESCRIPTION As an image is viewed, a square or other shape may be presented on a user interface viewing of the image. According to the exemplary embodiments of the invention this square or other shape presented within the image is considered a window of interest (WOI), and this WOI is used for an AF operation. The WOI presented on a phone can take different forms. Some phones may have a large square, while others may have a small square. However, many cameras have a small square in the centre of the image or a matrix of squares, such as can be a 3×3 matrix, a 9×9 matrix, or other matrix size, of which one or a few of the squares are selected as the areas in a focus operation. These segmented squares or other shapes can each be referred to as a sub window of interest or sub-WOI. It is noted that the WOI may be present on a charge coupled device CCD of the camera. Further, a WOI may not be visible on the user interface of a phone. A passive AF algorithm may be achieved by using a contrast measurement or phase detection system. Contrast measurement may be accomplished by measuring contrast within a sensor field or WOI through a lens. The intensity difference between adjacent pixels of the sensor naturally increases with correct image focus. An optical system can thereby be adjusted until the maximum contrast is detected. In this method, an AF does not involve actual distance measurement at all and is generally slower than phase detection systems, especially when operating under dim light. The contrast measurement method for AF is a common method in video cameras and digital cameras that lack shutters and reflex mirrors. Some cameras use this method when focusing in modes such as a preview mode. Phase detection for an AF is achieved by dividing incoming light into pairs of images and comparing them. Both film and digital cameras may use passive phase detection or secondary image registration for this process. The phase detection system uses a beam splitter which may be implemented as a small semi-transparent area of a main reflex mirror coupled with a small secondary mirror to direct light to an AF sensor at the bottom of the camera. Two optical prisms capture the light rays coming from the opposite sides of the lens and divert it to the AF sensor, creating a simple rangefinder with a base identical to the lens' diameter. The two images are then analyzed for similar light intensity patterns (e.g. peaks and valleys) and the phase difference is calculated in order to determine if the object is in a front focus or back focus position. This provides the direction of focusing and amount of movement required for a focus ring. Although AF sensors are typically one-dimensional photosensitive strips that are a few pixels high and a few dozen pixels wide, some modern cameras feature area sensors that are more rectangular so as to provide two-dimensional intensity patterns. A phase detection system may include cross-type focus points that have a pair of sensors oriented at 90° to one another and where one sensor typically requires a larger aperture to operate than the other. Some cameras also have a few ‘high precision’ focus points with an additional set of prisms and sensors which are only active for certain focal ratios. In one manner, a passive AF algorithm may operate with measurements using a single WOI of an image, for which case the passive AF operation is referred to as a singlespot AF. In another manner, the passive AF algorithm may operate with measurements using multiple WOIs of an image, for which case the passive AF operation is referred to as a multispot AF. Thus, AF measurements may be performed for one or several respective areas of an image. FIG. 1 shows an electronic device 10 such as a user equipment which may incorporate the exemplary embodiments of the invention. In FIG. 1 a device 10 can be, for example, a digital camera equipped with a still and/or video imaging capability, a digital video camera, a mobile station equipped with a camera, a camera phone, or some other similar smart communicator (PDA), the components of which are peripheral from the point of view of the invention and so are not described in greater detail in this connection. Embodiments of the invention relate not only to the device 10, but also to at least a focusing module 28, such as may be, for example, disposed in the device 10. The device 10 according to the invention can include, as modular components, a camera circuit 11, 14 and a digital image-processing chain 27 connected to it and to a focusing circuit 28. The camera circuit 11, 14 can include an image sensor totality 12, 13, which is as such known, together with movable (or otherwise focal-length adjustable) lenses 15. The imaging target, which is converted by the camera sensor 12 in a known manner to form electrical signals, is converted into a digital form using an analog to digital AD converter 13. In an embodiment the sensor 12 is one or more CCDs. The focusing circuit 28 is in the device 10 for focusing the camera circuit 11, 14. A solution according to the exemplary embodiments of the invention can be implemented in a circuit such as the focusing circuit 28. Using the focusing circuit 28, at least one of the image objects in an imaging target can be focused to the camera circuit 11, 14, more particularly to the sensor 12, prior to the performance of the imaging that it intended to be stored, or even during imaging to be stored, if the image is of, for example, a video imaging application. In cameras, focusing conventionally involves the collection of statistics from an image data. According to one embodiment, the statistics can include, for example, a search for gradients for the detection of an edge of a primary image object. The statistics can be formed of, for example, luminance information of the image data. The focusing operations also include the movement of the lenses 15, in order to maximize the statistical image sharpness mathematically by comparing statistical information. Focusing can be performed automatically or also by the end user, who can manually adjust the focus, if there is, for example, a manually adjustable focus disc (mechanical focus control) in the camera. If the focusing is implemented automatically in the device 10, the focusing circuit 28 shown in FIG. 1 can include an autofocus control algorithm 24 stored on a computer readable memory, in which there can be a focus-point definition portion 21 as a sub-module. Further, there can be included within or in addition to the focusing circuit 28, a circuit for defining and assigning focus value masks for sub-windows of interest in accordance with the exemplary embodiments of the invention. In addition, the focusing circuit 28 or another circuit is capable of inserting an additional sub-WOI in an overlapping manner within a WOI. As input, the algorithm portion 24 receives AF data from the calculating module 20 of AF statistics. A modular such as, but not limited to, the statistics module 20 can process the image data in ways that are in accordance with the exemplary embodiments of the invention, and form from it, for example, the aforementioned gradient data. Further, the image data may be fed directly to the AD converter 13. On the basis of the data produced by the statistics module 20, the algorithm portion 24 can decide whether it images a selected first image object sharply to the sensor 12 in a manner in accordance with the exemplary embodiments of the invention. As output, the algorithm portion 24 produces control data that is as such known, for the adjustment mechanism 14 of the set of lenses 15. The control data is used to move the set of lenses 15, in such a way that the one or more image objects defined as primary by the focus-point sub-module 21 is imaged precisely and sharply to the sensor 12. The image-processing chain 27 connected to the camera circuit 11, 14 can include various modules in different implementation arrangements, which are used, for example, for processing, in the device 10, the image data formed from the imaging target. In both cases, whether imaging to be stored is being performed at that moment by the device 10 or not, it is possible to perform so-called viewfinder imaging, for which there can be a dedicated viewfinder module VF 23 in the device 10. The viewfinder VF 23 can be after color-interpolation 16, and or also after the enhancement algorithms sub-module 17. It is noted that the enhancement algorithms sub-module may comprise various other sub-modules which may perform different functions. An image-processing chain IC can consist of one or more processing circuits which may include, but is not limited to, modules or sub-modules 16, 17, and 18. In this case, the color-interpolation 16, the enhancement algorithm sub-module 17, and image-data compression 18 of the image-processing chain 27 are shown. When the image data is stored, this can take place to some storage medium 19. The technical implementation of these components will be obvious to one versed in the art and for this reason the invention is described at the illustrated block-diagram level. In terms of the practical implementation of the invention, hardware and software solutions, as well as combinations of them, can be considered. Of course, the circuits described in regards to FIG. 1 are not limiting for practicing the exemplary embodiments of the invention. The functional modules of or processes of a device according to the exemplary embodiments of the invention may contain more or less functional modules, sub-modules, and/or processes than described in FIG. 1. The focusing-area calculation module 22 can use the data obtained from the AF-statistics calculation portion 20 in the definition of the image area and now also the data obtained from the focusing point definition portion 21. Once the portion 22 has been calculated the focused primary image object of the image data, its location in the image information formed by the image data, and also its shape can be determined in the location areas of the one or more primary image objects in the image. The data obtained from the calculation portion 22 of the focused area may be sent to a module or sub-module of the image-processing chain 27. On the basis of the data of the focused focus area (e.g the focus area may be a portrait area), the final area, which is used in the calculation of the filtering coefficients, can be selected/calculated. This area can even be pixel-accurate, thus delimiting the primary image object very precisely. In addition, some or all of the modules, sub-modules, and/or processes can be implemented in a single module or in different modules or sub-modules. Further, the directions indicated by the arrows between the modules may or may not be determining of the operations in accordance with the exemplary embodiments of the invention and the names or labels indicated for the modules or sub-modules are not limiting, so that some or all of these modules may be named or labeled differently. In an automatic focusing/image-object selection application, focusing can be concentrated on, for example, one or more image areas or WOI (for example, on the centre of the imaging object). These focusing points can also be intelligently selected from the entire image area. It can be understood that a properly designed rule-based AF algorithm must be able to select a correct focus window or WOI even if there are multiple objects in a scene. The robustness and flexibility of automatic focusing primarily results from the proper choice of the number and position of the WOIs. The exemplary embodiments of the invention relate to novel adaptive configuration scheme for WOIs in multispot AF. The exemplary embodiments of the invention provide at least a method, executable computer program, and apparatus for reducing the effects in a multispot AF of camera shaking and “zooming”. In addition, certain exemplary embodiments of the invention employ a configuration scheme which adds robustness to a focusing algorithm, particularly when focusing on small objects of a size comparable to a size of one WOI of multiple WOIs of an image. It is noted that in accordance with the exemplary embodiments of the invention each of the multiple WOIs in a multispot AF may be herein referred to as a sub-WOI. As similarly stated above, three most crucial factors affecting the performance of an automatic focusing algorithm are: 1) the light level, 2) the contrast of the subject of interest, and 3) motion of the camera or subject during the focusing. Below are disclosed further details of problems affecting these factors as addressed by the exemplary embodiments of the invention. Problem 1 Many camera phones are equipped with the three-stage capture buttons. These stages include a 1st stage where a button is not pressed, a 2nd stage where the button is half pressed, and a 3rd stage where the button is fully pressed. Due to the small size of many such camera phones and the possible need to half press the button in order to focus, the camera can typically shake during a focusing operation. In addition, at low-light situations, such as indoors, when the exposure time needs to be quite long, any camera motion, such as the above described shaking, can affect focus value curves. In this case, some consecutive scene frames, which are captured at different lens positions, may become blurred. In addition, due to such camera motion, the frames of an image may also become shifted with respect to each other, and as a result these frames may each contain slightly different image content. An additional effect, which is very similar to camera shaking, is the so-called “zooming” effect. For example, when the lens moves between a far mechanical end and a near mechanical end, such as during a focusing operation, a small zooming of the image window occurs. As a result the area in each sub-WOI will be slightly different depending upon the lens position. All these aforementioned effects can result in abrupt changes in image contrast (or alternatively focus values) for a particular WOI. Such changes can occur if, for example, a contrasting element (e.g. edge) appears or vice versa disappears from a WOI as a result of motion and/or zooming. Exemplary embodiments of the invention address at least these problems by reducing the effect of these issues, as stated above, in order to at least smooth focus value curves during a focusing. Problem 2 The automatic focusing algorithms often experience problems when focusing on small objects of an image. As an example these small objects may be of a size approximately equal to the size of one sub-WOI. However, the position of the small object rarely coincides with the position of a particular sub-WOI in an image plane. More frequently small objects may occupy part of one sub-WOI and part of another. In addition, when there are multiple objects at different depths in one WOI, or over several sub-WOIs, the focus curves may become flat with not very well-defined peaks. This is a possible source of errors that can often lead to false peak detections and out-of-focus images. Another aspect of the exemplary embodiments of the invention address at least these problems, described in PROBLEM 2, by increasing the sensitivity of AF to focus on small objects of interest especially in the presence of a high contrast background. FIG. 2 relates to an implementation of multispot AF WOI 100 where there is a grid consisting of N rows and M columns (N×M) of sub-WOIs. In FIG. 2 there is illustrated a configuration of 9 blocks with 3 rows (N) and 3 columns (M). The N and M are identified as HWOI (210) and WWOI (220), respectively. The width of each AF sub-WOI (230) is denoted by a value WsubWOI (240) (the same as the distance between the centers of two neighboring sub-WOIs). The real-time computation of image sharpness in this implementation may be performed in an H3A engine of an image signal processor (ISP). In this configuration a problem arises as the configuration of the N×M sub-WOIs for the multispot AF is not very tolerant of camera handshaking and also can exhibit poor performance under low-light conditions especially if a size of an AF sub-WOI (230) is relatively small. In addition, another problem which can be seen to occur here is that small objects of interest of an image can easily appear between two AF sub-WOIs (230). This would result in a focus value curve with poorly defined peaks. A perceived solution for either PROBLEM 1 or PROBLEM 2 can be seen to worsen the other problem. On one side, by increasing the sub-WOI size one can improve the image statistics in low-light and reduce the effect of handshaking. On the other side, this has two major undesired effects. First, the bigger sub-WOIs decrease the capability of an AF algorithm to focus on small objects, as the probability that there will be several objects in one sub-WOI increases as the sub-WOI size gets bigger. Second, the increase of focus window size increases the AF integration time needed for computation of AF statistics and, as a result, increases the latency of AF. The exemplary embodiments of the invention relate to a novel adaptive configuration of sub-WOIs for use in an AF procedure, such as a multispot AF, which address the above issues. The exemplary embodiments of the invention provide for enhancing image statistics at low-light conditions and at the presence of camera motion. In addition the exemplary embodiments of the invention also provide improved discrimination of objects of a small size by an AF. In accordance with the exemplary embodiments of the invention sub-WOIs are configured to overlap partially with different weights while the overall size of an AF WOI does not increase. The resulting focus value is a weighted calculation of several (e.g. three) different masks assigned to each part of logically separated sub-WOIs such that it reduces false focusing information which may be based on occurrences such as motion. In accordance with another aspect of the exemplary embodiments of the invention there is an increase of sub-WOIs in a middle row of an AF grid such as to 2*M−1 in order to improve an auto focus detection of an object of interest so it can be tracked more precisely. With regards to issues similar to PROBLEM 1 as stated above, as illustrated in FIG. 3 in accordance with the exemplary embodiments of the invention there is, for use in an AF, a configuration of partially overlapping sub-WOIs with different assigned weights. An example of an overlapping AF sub-WOI 310 is depicted in FIG. 3 by the square line surrounding an AF sub-window of interest (310) which has been logically separated into a plurality of parts which include a Mask 1 (340), Mask 2 (350) and Mask 3 (360). Due to this overlapping of the AF sub-WOIs (310), it is possible to increase the width/height of each AF sub-WOI 310 without increasing the overall size of AF WOI (300) as depicted with WWOI (320). From FIG. 3 one can see that while the distance between the centers of two neighboring sub-WOIs stays WsubWOI (330), which is the same as for the non-overlapping scheme, the effective width of each AF sub-WOI (310) increases. Furthermore, in accordance with the illustration of FIG. 3, we propose to compute the resulting focus value in overlapping sub-WOIs is computed as a weighted calculation such as a sum of focus values from the three different masks. In a non-limiting embodiment of the invention the weight for the inner Mask 3 (360) is maximal and is represented by Value3, the weight for the Mask 2 (350) is represented by Value2, and the weight for the outer Mask 1 (340) is represented by Value1. According to the exemplary embodiments of the invention the focus value for a sub-WOI such as the sub-WOI 310 may then be calculated as: FV sub-WOI 1=Value1 *FV Mask1+Value2 *FV Mask2+Value3 *FV Mask3. Where Valuex represents a value such as a rational number or decimal value assigned to a corresponding focus value mask. The weighting of focus values are seen to reduce the effects of camera motion and zooming. For example, if some contrasting element (e.g. edge) located at the border of a particular sub-WOI suddenly disappears from that sub-WOI due to zooming or camera motion, the overall impact of this occurrence will be attenuated or lessened, as the sharpness values in Mask 1 have a smaller weight and thus provides a smaller contribution to the resulting focus value. As an example of the above disclosed exemplary embodiments of the invention, for a case where the weight for the inner Mask 3 is maximal and is equal to 1, the weight for the Mask 2 equals 0.75, and the weight for the outer Mask 1 equals to 0.625. Then the focus value for a sub-WOI such as the sub-WOI 310 may then be calculated as: FV sub-WOI 1=0.625*FV Mask1+0.75*FV Mask2+1*FV Mask3. FIG. 4 illustrates an exemplary embodiment of the invention in order to improve the AF multispot configuration scheme by placing at least one additional AF sub-WOI (410) in the middle row of a grid of an AF WOI (400). The idea is to preserve the width of each sub-WOI, while decreasing the distance between the centers of two neighboring sub-WOIs. By changing the distance (420) from WsubWOI to WsubWOI/2 we can increase the number of sub-WOIs in the middle row to 2*M−1, where M refers to the initial number of sub-WOI columns in the non-overlapping configuration of multispot AF (see FIG. 2). Using this method related to moving sub-WOIs, the position of an object of interest in an AF WOI (400) can be tracked more precisely. Thus, we can be more confident that at least in one sub-WOI there will be a distinct peak corresponding to the object of interest. Although, in accordance with the non-limiting exemplary embodiments of the invention, the sub-WOIs were added only to a middle row and so the number of sub-WOIs in an upper and lower row of the AF WOI was kept unchanged, it is noted that this configuration is non-limiting and the exemplary embodiments of the invention may be applied to any row including the upper and lower rows. The configuration scheme, in accordance with the exemplary embodiments of the invention, was implemented for the multispot AF algorithm. This algorithm was a part of the library of imaging algorithms (ISP-NIPS) developed for ISP used in Nokia mobile phones. For this case, where the grid consisted of 12 sub-WOIs with M=4 columns and N=3 rows, the second (middle) row was further extended to 7 sub-WOIs yielding the total number of sub-WOIs to 15. The AF statistics was computed with the H3A block of a camera ISP. The H3A engine allowed a setting up of a grid of small windows SWs in each sub-WOI or WOI, and for each SW the AF values are then separately accumulated for green, blue, and red colors. It is noted that the term “small windows” is non-limiting and refers to the minimal two-dimensional block of the image for which the focus value statistics can be calculated. Each sub-WOI can comprise multiple SWs. The calculating can be performed by, but not limited to, an operation of an H3A hardware engine. In accordance with the exemplary embodiments the total focus value will be the sum of focus values from all the SWs. It is noted that the sum may be calculated from overlapping and/or non-overlapping sub-WOI of the WOI. In addition, in accordance with the exemplary embodiments of the invention the term small windows may also be referred to as “paxels”, or any other minimal unit available on a device, such as a CCD, used in an autofocus procedure in accordance with the exemplary embodiments of the invention. For AF WOI configuration, the width of AF WOI WWOI was set up to 18 SWs and the height HWOI to 14 SWs. The distance between the two sub-WOIs WsubWOI in the upper and lower rows was equal to 4 SWs, while the distance between the two neighboring sub-WOIs in the middle row were equal to 2 SWs. The overall size of each sub-WOI was equal to 6×6 SWs. That is the size of Mask 3 was 2×2 SWs, the size of Mask 2 was 3×3 SWs, and the size of Mask 1 was 6×6 SWs. For each lens position the focus values were accumulated using the H3A block for each color and for each SW. Further, the focus values for each sub-WOI were summed from the corresponding SWs through the application of appropriate weights. The exemplary embodiments of the invention have been proven to provide the following technical effects in multispot AF: Enhancement of image statistics at low-light conditions through the use of bigger sub-WOIs Preservation of total AF WOI size. Hence, no increase in AF integration time and AF latencies. The improvement in robustness of focus values under conditions which include camera motion and/or image zooming. Improved detectability of small objects comparable to the size of one sub-WOI. Further, it is noted that the exemplary embodiments of the invention may result in: A minor increase in memory usage due to an additional memory allocation for the masks and additional sub-WOIs; and A minor increase in the complexity of the algorithm, mainly due to the more complex loop for computation of focus values from individual SWs. Based on at least the preceding, it can be seen that the drawbacks are minimal and insignificant compared to the utility of the invention. The embodiments of this invention may be implemented by computer software executable by a data processor of the, device 10, such as the main processor on board the device, or by hardware circuitry, or by a combination of software and hardware circuitry. Further in this regard it should be noted that the various blocks of the diagram of FIG. 1 may represent program steps, or interconnected logic circuits, blocks and functions, or a combination of program steps and logic circuits, blocks and functions for performing the specified tasks. In general, the various embodiments of the electronic device 10 can include, but are not limited to, cellular telephones, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions. The embodiments of this invention may be implemented by computer software executable by a data processor of the device 10, such as aforesaid modules or circuits 14, 11, 27, and 28, or by hardware, or by a combination of software and hardware. Further in this regard it should be noted that the various blocks of the diagram of FIGS. 1-4 may represent program steps, or interconnected logic circuits, blocks and functions, or a combination of program steps and logic circuits, blocks and functions. It is noted that any of these devices may have multiple processors (e.g. RF, baseband, imaging, user interface) which operate in a slave relation to a master processor. The teachings may be implemented in any single one or combination of those multiple processors. The memories such as storage memory 19 may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory. The aforesaid modules or circuits 14, 11, 27, and 28 may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs)/image signal processors ISP and processors based on a multi-core processor architecture, as non-limiting examples. In accordance with the exemplary embodiments of the invention there is at least a method, executable computer program, and apparatus for logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation in an autofocus window of interest, and assigning a focus value mask to each of the plurality of parts of the at least one sub-window. Further, in accordance with the above there can be an increasing of at least one of a width or height of the at least one sub-window of interest so that it partially overlaps with at least one adjacent sub-window of interest in the grid formation, where a distance between a center of the at least one sub-window of interest and the at least one adjacent sub-window of interest in the grid remains unchanged. In another non-limiting exemplary embodiment of the invention there can be a placing of at least one additional sub-window of interest in at least one row of sub-windows of interest in the grid formation, such that a width of a sub-window of interest in the at least one row of sub-windows remains unchanged, and the sub-window of interest in the at least one row overlaps with at least one adjacent sub-window such that a distance between a center of the sub-window of interest and the adjacent sub-window of interest in the grid formation decreases. In accordance with any of the above, there can be a placing of the at least one additional sub-window of interest in the at least one row that comprises changing the distance between the center of the sub-windows of interest in the at least one row from WsubWOI to WsubWOI/2 in order to increase the number of sub-windows in the at least one row to 2*M−1, where M refers to the initial number of sub-window columns in a non-overlapping configuration of the grid formation. In addition, according to any of the above there can be a computing of a focus value of an object of interest based on at least one corresponding focus value mask, and determining an autofocus setting for the object of interest based on at least the computed focus value. Where the computing of the autofocus value (FV) according to any of the above can use calculations including: FVsubWOI 1=Value1 *FV Mask1+Value2 *FV Mask2+Value3 *FV Mask3 where Valuex represents a rational value (which may be a decimal) value assigned to a corresponding focus value mask. Further, in any of the above a focus value mask of a logically separated part of a sub-window that is closer to a center of the sub-window is assigned a higher weighted focus value than a focus value mask of a logically separated part of the sub-window that is farther from the center of the sub-window. Where, in the above, for a case where the plurality of parts of the at least one sub-window of interest comprise a first part closest to the center of the sub-window of interest, a third part farthest from the center of the sub-window of interest, and a second part in between the first part and the second part, where the first part has a weighted focus value of Value3, the second part has a weighted focus value of Value2, and the third part has a weighted focus value of Value1. In addition, where in any of the preceding can be performed or embodied in a user equipment. In general, the various embodiments may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto. While various aspects of the invention may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof. Embodiments of the inventions may be practiced in various components such as integrated circuit modules. The design of integrated circuits is by and large a highly automated process. Complex and powerful software tools are available for converting a logic level design into a semiconductor circuit design ready to be etched and formed on a semiconductor substrate. Programs, such as those provided by Synopsys, Inc. of Mountain View, Calif. and Cadence Design, of San Jose, Calif. automatically route conductors and locate components on a semiconductor chip using well established rules of design as well as libraries of pre-stored design modules. Once the design for a semiconductor circuit has been completed, the resultant design, in a standardized electronic format (e.g., Opus, GDSII, or the like) may be transmitted to a semiconductor fabrication facility or “fab” for fabrication. The foregoing description has provided by way of exemplary and non-limiting examples a full and informative description of the best method and apparatus presently contemplated by the inventors for carrying out the invention. However, various modifications and adaptations may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings and the appended claims. However, all such and similar modifications of the teachings of this invention will still fall within the scope of this invention. It should be noted that the terms “connected,” “coupled,” or any variant thereof, mean any connection or coupling, either direct or indirect, between two or more elements, and may encompass the presence of one or more intermediate elements between two elements that are “connected” or “coupled” together. The coupling or connection between the elements can be physical, logical, or a combination thereof. As employed herein two elements may be considered to be “connected” or “coupled” together by the use of one or more wires, cables and/or printed electrical connections, as well as by the use of electromagnetic energy, such as electromagnetic energy having wavelengths in the radio frequency region, the microwave region and the optical (both visible and invisible) region, as several non-limiting and non-exhaustive examples. Furthermore, some of the features of the preferred embodiments of this invention could be used to advantage without the corresponding use of other features. As such, the foregoing description should be considered as merely illustrative of the principles of the invention, and not in limitation thereof. 1. A method comprising: logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation in an autofocus window of interest; assigning a focus value mask to each of the plurality of parts of the at least one sub-window; and executing an autofocus algorithm using the assigned focus value masks. 2. The method according to claim 1, wherein each of the at least one sub-window of interest along at least one row or column of the grid formation partially overlaps an adjacent one of the plurality of sub-window of interest in the grid formation, and where a distance between a center of the at least one sub-window of interest and the adjacent sub-window of interest in the grid remains unchanged. 3. The method according to claim 1, where an additional at least one sub-window of interest is placed in at least one row of sub-windows of interest in the grid formation such that a number of sub-windows of interest in the at least one row is greater than in another row of the grid formation, and where a width of a sub-window of interest in the at least one row of sub-windows remains unchanged, and the sub-window of interest in the at least one row overlaps with at least one adjacent sub-window such that a distance between a center of the sub-window of interest and the adjacent sub-window of interest in the grid formation decreases. 4. The method according to claim 3, where the placing the at least one additional sub-window of interest in the at least one row, comprises: changing the distance between the center of the sub-windows of interest in the at least one row from WsubWOI to WsubWOI/2 in order to increase the number of sub-windows in the at least one row to 2*M−1, where M refers to the initial number of sub-window columns in a non-overlapping configuration of the grid formation. 5. The method according to claim 2, further comprising computing a focus value of an object of interest based on at least one corresponding focus value mask; and determining an autofocus setting for the object of interest based on at least the computed focus value. 6. The method according to claim 5;where computing the autofocus value (FV) uses calculations comprising: FV subWOI 1=Value1 *FV Mask1+Value2 *FV Mask2 +FV Mask3 where Valuex represents a rational value assigned to a corresponding focus value mask. 7. The method according to claim 1, where a focus value mask of a logically separated part of a sub-window that is closer to a center of the sub-window is assigned a higher weighted focus value than a focus value mask of a logically separated part of the sub-window that is farther from the center of the sub-window. 8. The method according to claim 1, where the plurality of parts of the at least one sub-window of interest comprise a first part closest to the center of the sub-window of interest, a third part farthest from the center of the sub-window of interest, and a second part in between the first part and the second part, where the first part has a weighted focus value of Value1, the second part has a weighted focus value of Value2, and the third part has a weighted focus value of Value3, where Valuex is a rational value. 9. The method according to claim 1, performed in a user equipment. 10. A computer readable medium encoded with a computer program executable by a processor to perform actions comprising: logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation of an autofocus window of interest; assigning a focus value mask to each of the plurality of parts of the at least one sub-window; and executing an autofocus algorithm using the assigned focus value masks. 11. The computer readable medium encoded with a computer program according to claim 10, wherein each of the at least one sub-window of interest along at least one row or column of the grid formation partially overlaps an adjacent one of the plurality of sub-window of interest in the grid formation, and where a distance between a center of the at least one sub-window of interest and the adjacent sub-window of interest in the grid remains unchanged. 12. The computer readable medium encoded with a computer program according to claim 10, where an additional at least one sub-window of interest is placed in at least one row of sub-windows of interest in the grid formation such that a number of sub-windows of interest in the at least one row is greater than in another row of the grid formation, where a width of a sub-window of interest in the at least one row of sub-windows remains unchanged, and the sub-window of interest in the at least one row overlaps with at least one adjacent sub-window such that a distance between a center of the sub-window of interest and the adjacent sub-window of interest in the grid formation decreases. 13. The computer readable medium encoded with a computer program according to claim 12, where the placing the at least one additional sub-window of interest in the at least one of a row of the grid formation, comprises: changing the distance between the center of the sub-windows of interest in the at least one row from WsubWOI to WsubWOI/2 in order to increase the number of sub-windows in the at least one row to 2*M−1, where M refers to the initial number of sub-window columns in a non-overlapping configuration of the grid formation. 14. The computer readable medium encoded with a computer program according to claim 11, further comprising computing a focus value of an object of interest based on at least one corresponding focus value mask; and determining an autofocus setting for the object of interest based on at least the computed focus value. 15. The computer readable medium encoded with a computer program according to claim 14, where computing the autofocus value (FV) uses calculations comprising: FV subWOI 1=Value1 *FV Mask1+Value2 *FV Mask2 +FV Mask3 where Valuex represents a rational value assigned to a corresponding focus value mask. 16. The computer readable medium encoded with a computer program according to claim 11, where a focus value mask of a logically separated part of a sub-window that is closer to a center of the sub-window is assigned a higher weighted focus value than a focus value mask of a logically separated part of the sub-window that is farther from the center of the sub-window. 17. An apparatus comprising: a processor configured to logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation of an autofocus window of interest; the processor configured to assign a focus value mask to each of the plurality of parts of the at least one sub-window; and the processor further configured to execute an autofocus algorithm using the assigned focus value mask. 18. The apparatus according to claim 17, wherein each of the at least one sub-window of interest along at least one row or column of the grid formation partially overlaps with an adjacent one of the plurality of sub-window of interest in the grid formation, and where a distance between a center of the at least one sub-window of interest and the adjacent sub-window of interest in the grid remains unchanged. 19. The apparatus according to claim 17, where an additional at least one sub-window of interest is placed in at least one row of sub-windows of interest in the grid formation such that a number of sub-windows of interest in the at least one row is greater than in another row of the grid formation, where a width of a sub-window of interest in the at least one row of sub-windows remains unchanged, and the sub-window of interest in the at least one row overlaps with at least one adjacent sub-window such that a distance between a center of the sub-window of interest and the adjacent sub-window of interest in the grid formation decreases. 20. The apparatus according to claim 19, where the placing the at least one additional sub-window of interest in the at least one of a row of the grid formation, comprises: the processor configured to change the distance between the center of the sub-windows of interest in the at least one row from WsubWOI to WsubWOI/2 in order to increase the number of sub-windows in the at least one row to 2*M−1, where M refers to the initial number of sub-window columns in a non-overlapping configuration of the grid formation. 21. The apparatus according to claim 18, further comprising an executable computer program and a processor configured to compute a focus value of an object of interest based on at least one corresponding focus value mask; and the processor and a display interface configured to determine an autofocus setting for the object of interest based on at least the computed focus value. 22. The apparatus according to claim 21, where computing the autofocus value (FV) uses calculations comprising: FV subWOI 1=Value1 *FV Mask1+Value2*FV Mask2+Value3 *FV Mask3 where Valuex represents a rational value assigned to a corresponding focus value mask. 23. The apparatus according to claim 17, where a focus value mask of a logically separated part of a sub-window that is closer to a center of the sub-window is assigned a higher weighted focus value than a focus value mask of a logically separated part of the sub-window that is farther from the center of the sub-window. 24. The apparatus according to claim 17, where the plurality of parts of the at least one sub-window of interest comprise a first part closest to the center of the sub-window of interest, a third part farthest from the center of the sub-window of interest, and a second part in between the first part and the second part, where the first part has a weighted focus value of Value1, the second part has a weighted focus value of Value2, and the third part has a weighted focus value of Value3, where Valuex is a rational value. 25. The apparatus according to claim 17, embodied in a user equipment. 26. An apparatus, comprising: means for logically separating into a plurality of parts at least one sub-window of interest of a plurality of sub-windows of interest arranged in a grid formation in an autofocus window of interest; means for assigning a focus value mask to each of the plurality of parts of the at least one sub-window; and means for executing an autofocus algorithm using the assigned focus value masks. 27. The apparatus according to claim 26, wherein each of the at least one sub-window of interest along at least one row or column of the grid formation partially overlaps an adjacent one of the plurality of sub-window of interest in the grid formation, and where a distance between a center of the at least one sub-window of interest and the adjacent sub-window of interest in the grid remains unchanged. 28. The apparatus according to claim 26, where an additional at least one sub-window of interest is placed in at least one row of sub-windows of interest in the grid formation such that a number of sub-windows of interest in the at least one row is greater than in another row of the grid formation, where a width of a sub-window of interest in the at least one row of sub-windows remains unchanged, and the sub-window of interest in the at least one row overlaps with at least one adjacent sub-window such that a distance between a center of the sub-window of interest and the adjacent sub-window of interest in the grid formation decreases.

2008-11-25

en

2010-05-27

US-201816027824-A

Method of printing 3d-microoptic images on packaging systems ABSTRACT The invention relates to a method for printing 3D-microoptic images on packaging systems in an inline process comprising providing a substrate, printing a plurality of images on at least part of the first major surface of the substrate, applying a transparent varnish layer on the printed first major surface of the substrate, and forming a plurality of relief features on the outer surface of the varnish layer, wherein the relief-features are micro-lenses. FIELD OF THE INVENTION The present invention relates to a method for printing 3D-microoptic images on packaging systems, and 3D-microoptic image packaging systems. BACKGROUND Films used in products and packages can benefit from micro-sized patterns. Such patterns can provide various effects, such as optical effects (e.g. lensing, holographics), tactile effects (e.g. perceived softness), and/or functional effects (e.g. surface characteristics). Imparting 3D-effects can be realized by taking advantage of the moire-magnifier principle, wherein a substrate comprises images and micro-sized patterns with a specific relative arrangement. Especially, in the field of packaging systems, 3D-microoptic decoration techniques are of great interest, since they provide a high impact on the first impression of a product and serve as an eye-catcher with high holding power for consumers to stop at a product. 3D-microoptic films are for example provided by Nanoventions, Inc., Visual Physics, /LLC, Rolling Optics, AB, and Grapac Japan Co., Inc. Commercially available films may either have images printed on one side and micro-sized lenses printed on the other side, or the images are printed on one side with continuous relief features in the shape of grooves on the same side. However, these commercially available films have some major drawbacks: Where images and lenses are on different sides of the substrate, the substrate must be transparent so that the images are apparent from the side on which the lenses are arranged. Where the relief features are continuous, the desired moire magnifier effect is not achievable. Lenticular designs, with lenses having an expansion of 1 mm or more and continuous relief feature designs on flexible films or labels, often provide undesired properties like decreasing their flexibility. Further, the known lenticular designs with lenses having an expansion of 1 mm or more are often unappealing for consumers due to rough surfaces which provide an unpleasant feeling when handling a packaging system with such lenticular designs on the outer surface. SUMMARY Based on the above drawbacks, there is still a need for new processes for creating 3D-microoptic effects on a variety of substrates in a fast and cost effective way. According to the present invention, a process for making 3D-microoptic packaging systems is provided. The method comprises providing a substrate, printing a plurality of images on at least part of the first major surface of the substrate, applying a transparent varnish layer on the printed first major surface of the substrate, and forming a plurality of relief features on the outer surface of the varnish layer, wherein the relief features are micro-lenses. The process allows for making a wide variety of packaging systems which are printed with 3D-microoptic images providing a moire magnifier effect on a variety of different substrates which may be transparent and non-transparent. Microlens designs can be easily incorporated into flexible films and labels of packaging systems as they are typically thin and small. Microlens designs can be incorporated into packaging systems without significantly changing their characteristics with regard to their suitability as packaging systems, e.g., their flexibility, thickness, weight, feel. Microlens designs are therefore suitable for a variety of packaging systems. They can provide a smooth surface and thereby appeal to consumers. They can be thin and lightweight and thereby retain flexibility of flexible films and labels. BRIEF DESCRIPTION OF THE INVENTION The present invention relates to a method for printing 3D-microoptic images on packaging systems. The method comprises providing a substrate having a first and a second major surface; printing a plurality of images on at least part of the first major surface of the substrate to provide a substrate with a printed first major surface; applying a transparent varnish layer on the printed first major surface of the substrate, wherein the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate; and forming a plurality of relief features on the outer surface of the varnish layer, wherein the relief features are micro-lenses. The present invention further relates to 3D-microoptic image packaging systems comprising a substrate having a first and a second major surface, a plurality of images on at least part of the first major surface, a transparent varnish layer on the first major surface of the substrate superimposing the printed images, wherein the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate, wherein the varnish layer has a plurality of relief features on the outer surface of the varnish layer, and wherein the relief features are micro-lenses. BRIEF DESCRIPTION OF THE DRAWINGS While the specification concludes with claims particularly pointing out and distinctly claiming the present invention, it is believed that the same will be better understood from the following description read in conjunction with the accompanying drawings in which: FIG. 1 Schematic view of an inkjet printing process FIG. 2a-2d Schematic view of an in-mold labeling process FIG. 3a-3c Schematic view of a transfer printing process FIG. 4 Schematic view of a rotogravure printing process FIG. 5 Schematic view of a silk screen printing process FIG. 6 Schematic view of a letterpress printing process FIG. 7 Schematic view of an offset lithography process FIG. 8 Schematic view of a flexographic printing process FIG. 9a-9c Schematic views of a printed substrate with images FIG. 10a-10f Top views of varnish layers with micro-lenses FIG. 11a-11g Side views of varnish layers with relief features FIG. 12 Schematic view of a 3D micro-optic image from a viewer's perspective FIG. 13 Schematic view of a method for making 3D-microoptic image packaging systems FIG. 14 Flowchart of making 3D-microoptic image packaging systems FIG. 15 Schematic view of flexographic printing press for making 3D-microoptic image packaging systems FIG. 16 Flowchart of making a patterned flexographic printing or casting plate FIG. 17a-17j End views of the steps of making a patterned flexographic printing or casting plate FIG. 18 Flowchart of making a patterned flexographic printing or casting plate FIG. 19a-19b End views of the steps of making a patterned flexographic printing or casting plate FIG. 20 Side view of a 3D-microoptic image packaging system DETAILED DESCRIPTION OF THE INVENTION A “3D-microoptic image packaging system” according to the invention is a packaging system having images printed on its surface that exhibit 3D-optical effects for a viewer. “Substrates” according to the present invention are all materials which are suitable for printing and which have a first and a second major surface. Preferably, substrates have a sheet-like shape. “Rigid substrates” according to the invention are substrates which are resistant to deformation in response to an applied force and which are therefore not suitable for use in in-line printing processes. A “relief feature” according to the present invention is a feature protruding from the minimum expansion of the varnish in perpendicular direction from the substrate surface. The “image size” defines the maximum expansion of an image. The term “micro” according to the present invention means an expansion of less than 1 mm, preferably 1 μm to less than 1 mm “Micro-images” according to the present invention are images with an image size of less than 1 mm “Micro-lenses” according to the present invention are lenses with a maximum height and width of less than 1 mm According to the present invention, the “distance between images” characterizes the minimum distance between images. Accordingly, the “distance between relief features” characterizes the minimum distance between relief features. “Height” according to the present invention is defined as the expansion in perpendicular direction from a surface. For example, the height of the varnish layer is the expansion in perpendicular direction from the substrate surface. For example, the height of the relief features is the difference between the maximum expansion of the varnish in perpendicular direction from the substrate surface and the minimum expansion of the varnish in perpendicular direction from the substrate surface. In connection with layers, the height may also be called “thickness”, where the thickness of a structured layer is described as the minimum expansion of the layer in perpendicular direction from a surface. A “plurality” according to the present invention is more than one. According to the present invention, “transparent” means that a material has a transparency (I/I0)of at least 0.5 in a wavelength range of from 400 to 780 nm and a material layer thickness of 10 mm “Porous” according to the present invention defines materials with a pore size of at least 1 nm. Materials having lower pore sizes, i.e., in the sub-nanometer range, or no pores are “non-porous” materials. The pore size can be determined by ASTM D4404. A “photopolymer” according to the application under examination is a polymeric material that can be cured by electromagnetic irradiation, e.g., light. The present invention relates to a method for printing 3D-microoptic images on packaging systems comprising a. providing a substrate having a first and a second major surface; b. printing a plurality of images on at least part of the first major surface of the substrate to provide a substrate with a printed first major surface; c. applying a transparent varnish layer on the printed first major surface of the substrate, wherein the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate; and d. forming a plurality of relief features on the outer surface of the varnish layer, wherein the relief features ae micro-lenses. Step a. The method comprises the provision of a substrate having a first and a second major surface. The substrate may be flexible or rigid. Preferably, the substrate is rigid. The substrate may be of any shape. For example, the substrate may be sheet-like, e.g., be a foil or film, have the shape of a packaging system, or have the shape of a part of a packaging system. The substrate may have any thickness. For example, the substrate has a thickness of from 1 μm to 10 cm, or from 2 μm to 5 cm, or from 5 μm to 1 cm, or from 10 μm to 5 mm, or from 20 μm to 1 mm. The substrate may comprise polymeric materials, glass, wood, stone, ceramics, metals, woven or non-woven fabrics, paper, or combinations thereof. Preferably, the substrate comprises a polymeric material. More preferably, the polymeric material is selected from the group consisting of high density polyethylene, low density polyethylene, linear low density polyethylene, polypropylene, polyethylene terephthalate, and combinations of two or more thereof. Rigid substrates may comprise polymeric materials, glass, wood, stone, ceramics, enamels metals, or combinations thereof. Preferably, substrates comprise a polymeric material. More preferably, the polymeric material is selected from the group consisting of high density polyethylene, low density polyethylene, linear low density polyethylene, polypropylene, polyethylene terephthalate, and combinations of two or more thereof. The substrate may also be flexible. A flexible substrate may comprise polymeric materials, metal materials, woven or non-woven fabrics, paper, or combinations thereof, preferably a polymeric material. A flexible substrate is preferably a plastic foil or a plastic film. The polymeric material is preferably selected from the group consisting of high density polyethylene, low density polyethylene, linear low density polyethylene, polypropylene, polyethylene terephthalate, and combinations of two or more thereof. The substrate may be porous or non-porous. Porous substrates may for example be micro-porous substrates with a pore size of less than 1 μm, for example of less than 500 nm or in a range of from 1 to 500 nm or from 2 to 200 nm. Preferred substrates according to the present invention are non-porous. Step b. The method comprises printing a plurality of images on at least part of the first major surface of the substrate to provide a substrate with a printed first major surface. The images may be printed by any method known in the art which is suitable for printing images on a major surface of a substrate. Preferably, the images may be printed by a process selected from inkjet printing, in-mold labeling, transfer printing, rotogravure, silk screen printing, letterpress printing, offset lithography, and flexographic printing. These printing procedures are well known in the art. Inkjet printing generally includes a high-pressure pump directing liquid ink from a reservoir through a gun body and a microscopic nozzle creating ink droplets. The ink droplets are subjected to an electrostatic field as they form, so that each droplet can be individually charged. They are then directed by electrostatic deflection plates to print on the substrate. This process is described in further detail below with regard to FIG. 1 In-mold labeling is a plastic molding process which is used for shaping a plastic material while simultaneously decorating its surface. A carrier foil carrying the decoration to be transferred to the plastic part is placed inside the mold of an opened molding device. By using vacuum or static charging, the foil is fixated in the mold. The plastic material, e.g. polypropylene, is introduced into the mold in molten or softened state. The molding device is closed. By applying heat and/or pressure the plastic material is formed into the desired shape. In this step, the carrier foil and the plastic material are fused forming a printed substrate with the print being an integral part of the substrate. This process is described in further detail below with regard to FIGS. 2a -2 d. Transfer printing generally includes using a transfer device to transfer liquid-based inks from an ink pad onto a substrate. Suitable transfer devices are for example engraved metal plates like copper or steel plates, or structured polymeric stamps like rubber stamps. This process is described in further detail below with regard to FIGS. 3a -3 c. Rotogravure is a printing process using a rotary printing press that involves engraving an image onto an image carrier, namely a cylinder which is part of the rotary printing press. The ink is applied directly to the cylinder and transferred from the cylinder to the substrate. This process is described in further detail below with regard to FIG. 4. Silk screen printing is a printing technique where a design is imposed on a mesh screen which is used to transfer ink onto a substrate. The mesh screen can be made of any mesh material, preferably of polyethylene terephthalate. The open mesh apertures are filled with ink. The ink-filled mesh is contacted with the substrate which causes the ink to wet the substrate and be pulled out of the mesh apertures. This process is described in further detail below with regard to FIG. 5. Letterpress printing is a technique of relief printing using a printing press. Thereby, many copies can be produced by repeated direct impression of an inked raised surface against sheets or rolls of a substrate. The process comprises several steps: composition, i.e., assembling movable pieces to form the desired image; imposition, i.e., arranging various assemblies from the composition step to a form ready to use on the press; lock up, i.e., fixating the assemblies to avoid printing errors; and printing by inking the reliefs of the assemblies and pressing them onto the substrate surface. This process is described in further detail below with regard to FIG. 6. Offset lithography is a printing process where an inked image is transferred indirectly from an image carrier plate to a substrate surface. The lithographic process is based on the repulsion of oil and water. It uses a flat image carrier plate, i.e., a plate having a flat, non-engraved surface, on which the image to be printed obtains ink from ink rollers. The non-printing areas of the image carrier plate attract a water-based film, so that these areas remain ink-free. The image carrier plate transfers the image to a transfer blanket which then prints it on the substrate surface. Commonly, this process is carried out continuously using a rotary printing press, wherein the image carrier plate and the transfer blanket are rotating cylinders, i.e., the plate cylinder and the offset cylinder, and the substrate pass between the offset cylinder and an impression cylinder. This process is described in further detail below with regard to FIG. 7. An exemplified flexographic printing procedure is described as follows: A positive mirrored master of an image is created in a flexographic printing plate. Such plates can be made by analog or digital platemaking processes which are described in further detail below. Therein, the image areas are raised above the non-image areas on the plate. Ink is transferred to the plate in a uniform thickness. The substrate is then pressed to the inked flexographic printing plate, e.g., by sandwiching it between the plate and an impression cylinder, to transfer the image. For drying the ink, different methods are available, like feeding the substrate through a dryer or curing the ink by irradiating the substrate with UV light. Where an image comprises multiple colors, preferably for each color a different flexographic printing plate is used. In this case, the plates are made, and put on a cylinder which is placed in the printing press. For the picture to be completed, the image from each flexographic printing plate is transferred to the substrate. Flexographic printing is preferred for printing flexible substrates. This process is described in further detail below with regard to FIG. 8. The images printed on the substrate are not limited in their size, shape and color. The images may be the same or different. Preferably, at least some images are the same. For example, all images are the same. The printed surface may comprise two or more, for example two or three or four or five or more than five, arrays of images, wherein the images within an array are the same. The images may be arranged in a regular pattern. Where the substrate comprises arrays of images, the images within an array are preferably arranged in a regular pattern. The pattern in different arrays may be the same or different. Preferably, the images are micro-images. The image size may be at least 20 μm, preferably in the range of from 20 μm to 300 μm, for example in the range of from 50 to 100 μm. The images may have the same or different image sizes. Where the substrate comprises arrays of images, the images within an array preferably have the same image size. The image size in different arrays may be different. The distance between the images may be in the range of from 1 μm to 1 mm, preferably in the range of from 5 μm to 100 μm, more preferably in the range of from 10 to 50 μm. It may be preferred that the distance between the images is the order of the image size, for example differing by no more than 50% or by no more than 30% or by no more than 10%. The ratio of image size to image distance may be in the range of from 10:1 to 1:100, preferably in the range of from 5:1 to 1:50 or from 2:1 to 1:10. Where the substrate comprises arrays of images, the images within an array preferably have the same image distance. The image distance in different arrays may be different. Examples of suitable arrangements of images are shown in FIGS. 9a -9 c. Step c. The method comprises applying a transparent varnish layer in the printed first major surface of the substrate. The varnish layer has an inner surface which is in contact with the printed first major surface of the substrate, and an outer surface facing away from the substrate. According to the present invention, the varnish layer may be formed by applying a varnish composition to the printed first major surface of the printed substrate and subsequent hardening to form the varnish layer. For example, the varnish composition may be applied by spraying, dripping, rolling, flooding, spin coating or dip coating processes. The varnish composition may be any varnish known in the art which is compatible with the respective substrate material, which is suitable for coating a flexible substrate and which is suitable for use in an in-line process. Preferably the varnish is heat curable, light curable or both, preferably UV curable. The varnish may for example comprise polyolefins like polyethylene, preferably LLDPE, LDPE, MDPE, HDPE, or polypropylene, polyesters like polyethylene terephthalate, polyamides like nylon, halogenated vinyl resins like polyvinyl chloride, poly(meth)acrylates, biodegradable plastics, polyurethanes, alkyd resins, epoxy phenolic resins, or combinations of two or more thereof. Biodegradable plastics are plastics that are decomposed by the action of living organisms like bacteria, in particular bioplastics. They may for example be selected from aliphatic polyesters, polyanhydrides, polyvinyl alcohol, starch derivatives, cellulose esters like cellulose acetate and nitrocellulose, and polyethylene terephthalate. Bioplastics are plastics derived from renewable biomass sources like vegetable fats and oils, corn starch or microbiota, preferably composed of starches, cellulose or biopolymers. They may for example be selected from starch-based plastics, cellulose-based plastics, protein-based plastics, polyhydroxyalkanoates like poly-3-hydroxybutyrate, polyhydroxyvalerate, polyhydroxyhexanoate, polylactic acid, and polyhydroxyurethanes. Preferably the varnish is an acrylic varnish. An acrylic varnish according to the invention may be a varnish comprising poly(meth)acrylate, i.e., polyacrylic acid, polymethacrylic acid, polyacrylic acid derivatives like carboxylates, esters, amides or salts thereof, polymethacrylic acid derivatives like carboxylates, esters, amines or salts thereof, copolymers thereof, or combinations of two or more thereof. Preferably, the salts are alkaline metal salts, preferably sodium salts, in particular sodium polyacrylate. Preferably the acrylic varnish comprises a structural element of formula (I) or (II) wherein X and Y may be selected from N and O, preferably O; and R1 and R2 may be selected from H, C1-C18 alkyl, C1-C18 alkenyl, C6-C14 aryl, preferably from H, methyl and ethyl. Step d. The method comprises forming a plurality of relief features on the outer surface of the varnish layer. The relief features may be formed on the varnish layer by any method known in the art which is suitable for structuring a coating in an in-line process. The relief features on the varnish layer may be formed by a process similar to the above described printing processes, wherein relief features are printed instead of images. Preferably, the relief features may be formed by a process selected from transfer printing, rotogravure, and flexographic casting. The relief features may be formed by transfer printing. The general procedure for forming relief features by transfer printing is in accordance with the transfer printing process of printing images as described above. The transfer device comprises posts whose lower surface coming into contact with the substrate has an inverse shape of the relief features to be printed on the substrate, e.g., being inverse to a partial sphere. The relief features may be formed by rotogravure. The general procedure for forming relief features by rotogravure is in accordance with the rotogravure process of printing images as described above. The surface of the image carrier cylinder of the rotary printing press has dents which are inverse to the shape of the relief features to be printed on the substrate, e.g., inverse partial spheres. Preferably, the relief features are formed by a filmless casting process using a flexographic casting plate. In a filmless casting process, a mirrored master of the relief features is created in a flexographic casting plate. Methods of making such plates are described in further detail below. The relief feature areas are raised above the non-relief feature areas on the plate. Varnish is transferred to the plate. The printed substrate is then pressed to the flexographic casting plate, e.g., by sandwiching it between the plate and an impression cylinder, to transfer the varnish and thereby form the relief features. For curing the varnish, different methods are available, like heat curing or UV curing. Preferably the varnish is cured by UV curing. The relief features formed on the outer surface of the varnish layer are micro-lenses. According to the invention, micro-lenses are discontinuous relief features, i.e., which are not continuous in one direction of the substrate, with the ratio of the smallest expansion to the largest expansion of one relief feature being in the range of from 1:1000 to 1:1, preferably 1:100 to 1:1, more preferably 1:10 to 1:1. From a top view, micro-lenses may be round or angular, for example circular, elliptical, angular with 3 or 4 or 5 or 6 or 8 or more than 8 corners. Preferably, angular micro-lenses are selected from the group consisting of triangles, squares, rectangles, rhombi, and regular polygons like pentagons, hexagons, or octagons. Examples of shapes of discontinuous relief features are shown in FIGS. 10a -10 f. From a side view, the relief features may for example have the shape of triangles, trapezoids, squares, rectangles, or partial circles. Preferred side-view shapes of the relief features are shown in FIGS. 11a -11 g. Preferably, the relief features are in the shape of partial spheres, partial ellipsoids, cylinders, cones, tetrahedrons, pyramids, hexagonal pyramids, octagonal pyramids, cubes, cuboids, pentagonal prisms, hexagonal prisms. The relief features are preferably in the shape of partial spheres. The relief features may be arranged in a regular pattern. Where the substrate comprises arrays of relief features, the relief features within an array are preferably arranged in a regular pattern. The pattern in different arrays may be the same or different. Preferably, the relief features have a height in the range of from 50 nm to 150 μm, preferably from 10 to 30 μm. Preferably, the size of the relief features is at least 20 μm, preferably in the range of from 20 μm to 300 μm, for example in the range of from 50 to 100 μm. The relief features may have the same or different sizes. Where the substrate comprises arrays of relief features, the relief features within an array preferably have the same size. The size of the relief features in different arrays may be different. Any repeat pattern of relief features and images and their arrangement relative to each other can be used as long as an interference pattern (a moire magnification effect) is created. This principle is shown in FIG. 12. The pattern of the relief features and the images may be the same or different. It is preferred that the relief features and the images have an identical pattern. It may also be preferred that each image is superimposed with a relief feature. The ratio of the maximum diameter of the relief features to the maximum diameter of the images may be at least 1, for example the ratio is in the range of from 50:1 to 1:10, or 10:1 to 1:2, or 5:1 to 1:1.2, or 2:1 to 1:1, more preferably from 1.3:1 to 1:1. Where different arrays of images and/or relief features are arranged on a substrate, the above diameter ratio preferably relates to at least one array, more preferably all arrays. It may be most preferred for the invention that the relief features and the images have an identical pattern, wherein each image is superimposed with a relief feature which has at least the same maximum diameter as the image and which is centrally arranged on top of the image. Preferred examples of the process are described in further detail with regard to FIGS. 13-15. Flexographic Printing/Casting Plate Where the images are printed by flexographic printing, preferably a flexographic printing plate is used. Where the relief features are formed by a filmless casting process, preferably a flexographic casting plate is used. The flexographic printing plate, the flexographic casting plate or both may be made of a plastic material, for example polypropylene, high density polyethylene, low density polyethylene, linear low density polyethylene, polyethylene terephthalate, and combinations of two or more thereof, preferably polypropylene. The flexographic printing plate, the flexographic casting plate or both may be flexible or rigid, preferably flexible. The flexographic printing plate, the flexographic casting plate or both may be made by a process comprising injection molding, blow molding, embossing, printing, engraving, or combinations thereof. It may be preferred according to the invention that the flexographic printing plate, the flexographic casting plate or both are made by a process comprising the following steps: i. providing a flexible patterned substrate; ii. pressing the patterned surface of the patterned substrate onto an uncured soft photopolymer plate to provide a patterned uncured photopolymer plate; and iii. curing the patterned uncured photopolymer plate to provide the patterned flexographic plate. For example, a patterned substrate can be pressed into an uncured soft photopolymer plate to form a patterned flexographic printing or casting plate, which can be used to impart micro-sized patterns into curable coatings on films. This analog impression process does not require precise equipment control or the use of a wash-out step as known from prior applications. The resulting flexographic printing or casting plate can be used with commercially available coatings, on conventional flexographic equipment, and can last for many thousands of cycles, so the plate is also easy and inexpensive to use. This process is described in further detail with regard to FIGS. 16 and 17 a-j. The patterned substrates may be flexible or rigid. Flexible patterned substrates suitable for the invention may be commercially purchased in the form of a flexible patterned film, such as a CAST AND CURE holographic film available from Breit Technologies of Overland Park, Kansas, United States. A flexible patterned substrate can be any suitable material that is flexible (e.g. a thin, pliable, sheet-like material), has suitable pattern of relief features, and can be processed as described with regard to FIG. 16. Examples of flexible patterned substrates include textured paper, fabric, micro-embossed film, optical lens film. Rigid patterned substrates may also be suitable for the invention, such as for example metal sheets, molded plastic sheets, or silicon wafers. Preferably, the patterned substrate is flexible. The uncured soft photopolymer plate can have various overall thicknesses, for example of from 0.1 mm to 10.0 mm, or from 0.5 to 5 mm or from 0.8 to 3 mm, preferably from 1.0 to 2 mm An uncured soft photopolymer plate may for example have a thickness of 1.14 mm or of 1.70 mm The uncured soft photopolymer plate may however also be provided without a protective mask. Uncured soft photopolymers are commercially available in the form of a flexographic plate (with and without a mask layer), such as: CYREL FAST (e.g. types DFUV, DFR, DFM, and DFP) flexographic plates available from DuPont of Wilmington, Delaware, United States or flexographic plates such as types UVR, MAX, and MVP available from MacDermid, Inc. of Morristown, Tennessee, United States. Uncured soft photopolymer plates may be made from one or more suitable materials (such as mixtures of monomers, oligomers, and/or photoinitiators; common forms include acrylates and silicones) that are curable into a hardened state by exposure to visible and/or UV light, as known in the art. It may be preferred according to the invention that the flexographic printing plate, the flexographic casting plate or both are made by a process comprising the following steps: (i) providing a rigid patterned substrate; and (ii) applying a polymeric material, preferably polypropylene, in an injection molding process on the rigid patterned substrate to provide the patterned flexographic plate. The rigid patterned substrate may be made of a material selected from polymeric materials, metal materials, glass, ceramics, minerals, combinations of two or more thereof, and composite materials of one or more of the aforementioned materials. Preferably, the rigid patterned substrate is a patterned steel plate. The pattern in the rigid substrate can be formed by any suitable method for patterning rigid substrates, for example injection molding, blow molding, embossing, printing, engraving, or combinations thereof. Preferably, the pattern of the rigid patterned substrate is made by laser pulse engraving. The polymeric material may be a thermoplastic resin, for example selected from polypropylene, high density polyethylene, low density polyethylene, linear low density polyethylene, polyethylene terephthalate, and combinations of two or more thereof. Preferably, the polymeric material is polypropylene. The polymeric material may be applied in an injection molding process on the rigid patterned substrate. The general operation of injection molding is commonly known in the art. For example, the following procedure may be followed: The polymeric material is heated to a molten or malleable state. The material is then forced through a nozzle onto the rigid patterned substrate which serves as a mold cavity. The plastic material is then cooled on the mold, for example by the mold as such remaining cold, by external cooling, or both. This process is described in further detail with regard to FIGS. 18 and 19 a-b. The invention further relates to 3D-microoptic image packaging systems comprising A. a flexible substrate having a first and a second major surface; B. a plurality of images on at least part of the first major surface; C. a transparent varnish layer on the first major surface of the substrate superimposing the printed images. Therein, the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate. Further, the varnish layer has a plurality of relief features on the outer surface of the varnish layer. The preferred embodiments of the flexible substrate, the images, the varnish layer and the relief features described above with regard to the method according to the invention also apply to the flexible substrate, the images, the varnish layer and the relief features of the 3D-microoptic image packaging systems. One exemplary 3D-microoptic image packaging system is shown in FIG. 20. The 3D-microoptic image packaging systems are suitable for food and non-food packaging systems, for example for packaging personal care and pharma products, household and gardening products, entertainment and media products, electronic devices, toys, sports products. Preferred Embodiments of the Invention 1) Method for printing 3D-microoptic images on packaging systems comprising a. providing a substrate having a first and a second major surface; b. printing a plurality of images on at least part of the first major surface of the substrate to provide a substrate with a printed first major surface; c. applying a transparent varnish layer on the printed first major surface of the substrate, wherein the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate; and d. forming a plurality of relief features on the outer surface of the varnish layer, wherein the relief features are micro-lenses. 2) The method according to embodiment 1), wherein the substrate is a rigid substrate. 3) The method according to any of the preceding embodiments, wherein the substrate is a polymeric material selected from the group consisting of high density polyethylene, low density polyethylene, linear low density polyethylene, polypropylene and polyethylene terephthalate. 4) The method according to any of the preceding embodiments, wherein the substrate is non-porous. 5) The method according to any of the preceding embodiments, wherein the substrate is a rigid, non-porous polymeric material selected from the group consisting of high density polyethylene, low density polyethylene, linear low density polyethylene, polypropylene and polyethylene terephthalate. 6) The method according to any of the preceding embodiments, wherein the images are printed by a process selected from inkjet printing, in-mold labeling, transfer printing, rotogravure, silk screen printing, letterpress printing, offset lithography, and flexographic printing. 7) The method according to any of the preceding embodiments, wherein the images are micro-images. 8) The method according to any of the preceding embodiments, wherein the images are arranged in a regular pattern. 9) The method according to any of the preceding embodiments, wherein the image size is at least 20 μm, preferably in the range of from 20 to 300 μm. 10) The method according to any of the preceding embodiments, wherein the distance between the images is in the range of from 1 μm to 1 mm, preferably from 5 μm to 100 μm, more preferably from 10 to 50 μm. 11) The method according to any of the preceding embodiments, wherein the image size is at least 20 μm, preferably in the range of from 20 to 300 μm, and wherein the distance between the images is in the range of from 1 μm to 1 mm, preferably from 5 μm to 100 μm, more preferably from 10 to 50 μm. 12) The method according to any of the preceding embodiments, wherein the varnish is heat curable, light curable or both, preferably UV curable. 13) The method according to any of the preceding embodiments, wherein the varnish is an acrylic varnish. 14) The method according to any of the preceding embodiments, wherein the relief features on the varnish layer are formed by a filmless casting process using a flexographic casting plate. 15) The method according to any of the preceding embodiments, wherein the relief features have a height in the range of from 50 nm to 150 μm, preferably from 10 to 30 μm. 16) The method according to any of the preceding embodiments, wherein the size of the lenses is at least 20 μm, preferably in the range of from 20 to 300 μm. 17) The method according to any of the preceding embodiments, wherein the relief features have the shape of partial spheres. 18) The method according to any of the preceding claims, wherein the relief features have a height in the range of from 50 nm to 150 μm, preferably from 10 to 30 μm, a diameter of at least 20 μm, preferably in the range of from 20 to 300 μm, and the shape of partial spheres. 19) The method according to any of the preceding embodiments, wherein the relief features and the images have an identical pattern, preferably wherein each image is superimposed with a relief feature which has at least the same maximum diameter as the image and which is centrally arranged on top of the image. 20) The method according to any of the preceding embodiments, wherein the images are printed by flexographic printing using a flexographic printing plate, or wherein the relief features are formed by a filmless casting process using a flexographic casting plate, or both, and wherein the flexographic printing plate, the flexographic casting plate, or both are made by a process comprising injection molding, blow molding, embossing, printing, engraving, or combinations thereof. 21) The method according to embodiment 20, wherein the flexographic printing plate, the flexographic casting plate, or both are made of a plastic material, preferably polypropylene. 22) The method according to embodiments 20 or 21, wherein the flexographic printing plate, the flexographic casting plate, or both are flexible. 23) The method according to any of embodiments 20 to 22, wherein the flexographic printing plate, the flexographic casting plate or both are made by a process comprising the following steps: i. providing a flexible patterned substrate; ii. pressing the patterned surface of the patterned substrate onto an uncured soft photopolymer plate to provide a patterned uncured photopolymer plate; and iii. curing the patterned uncured photopolymer plate to provide the patterned flexographic plate. 24) The method according to any of embodiments 20 to 22, wherein the flexographic casting plate is made by a process comprising the steps (i) providing a rigid patterned substrate; and (ii) applying a polymeric material, preferably polypropylene, in an injection molding process on the rigid patterned substrate to provide the flexographic casting plate. 25) The method according to embodiment 24, wherein the rigid patterned substrate is a patterned steel plate. 26) The method according to any of embodiments 24 or 25, wherein the pattern of the rigid patterned substrate is made by laser pulse engraving. 27) 3D-microoptic image packaging system comprising A. a substrate having a first and a second major surface; B. a plurality of images on at least part of the first major surface; C. a transparent varnish layer on the first major surface of the substrate superimposing the printed images, wherein the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate; and wherein the varnish layer has a plurality of relief features on the outer surface of the varnish layer, wherein the relief features are micro-lenses. DETAILED DESCRIPTION OF THE FIGURES FIG. 1 shows an inkjet printing process. A high pressure pump 103 directs liquid ink 102 through a gunbody and a nozzle 105. A piezoelectric crystal 104 creates an acoustic wave, thereby breaking the stream of ink 102 into droplets 106. The ink droplets are subjected to an electrostatic field by a charging electrode 107. In another electrostatic field 109 the droplets are directed by electrostatic deflection plates 108 to print on the substrate 101 or are allowed to continue undeflected to a collection gutter 110 for re-use. The result is a substrate 101 with ink droplets 111 disposed thereon forming images. FIG. 2 shows an in-mold labeling process. The molding device used for in-mold labeling comprises two parts: a lower part 201 comprising the mold 205, and an upper part 202 for closing the mold and filling the plastic material into the mold 205. In a first step, a printed label 203 is introduced into the mold 205 using a handling device 204. The handling device 204 is removed. The printed label 203 is fixated in the mold 205 so that no air pockets or creases adversely affect the product. The molding device is closed. Through an opening 207, the plastic material 206 is introduced into the mold 205. After heat and pressure treatment and subsequent cooling, the molding device is opened and a molded plastic material with a printed surface 208 is obtained. FIG. 3a-3c shows a transfer printing process. The transfer device 302 includes a plurality of posts 303. The posts 302 can pick up liquid-based ink 304 from an ink pad 301. The picked-up ink 304 can then be transferred from the posts 303 of the transfer device 302 onto the surface of the substrate 305. After removing the transfer device 302, printed images 306 are disposed on the surface of the substrate 305. FIG. 4 shows a rotogravure printing process. Therein, the substrate 401 is printed continuously by passing through a rotary printing press in direction 406. The rotary printing press comprises a gravure cylinder 403 and an impression cylinder 402. An image is engraved onto the gravure cylinder 403. The gravure cylinder 403 is in contact with an ink reservoir 404. Excess ink is removed from the gravure cylinder 403 by a doctor blade 405 before coming into contact with the major surface of the substrate 401 which is to be printed. The impression cylinder 402 applies a pressure from the other side, i.e., on the second major surface of the substrate 401. A substrate with a printed surface is thereby obtained. FIG. 5 shows a silk screen printing process. Therein, a mesh 1901, preferably made of polyethylene terephthalate, with mesh apertures 1902 is provided. The mesh 1901 is contacted with an ink 1903, so that the ink fills the mesh apertures 1902. The ink-filled mesh is then contacted with a substrate 1904. By using a squeezer 1906, the ink is squeezed out of the mesh apertures 1902 and onto the substrate 1904. The mesh 1901 is removed 1905 to provide the printed substrate 1907. FIG. 6 shows a letterpress printing process. Therein, a bed 2001 is provided. In the bed 2001, movable pieces 2002 are assembled to form an image. The movable pieces 2002 are inked so that the top surfaces of the movable pieces 2002 are coated with the ink 2003. The substrate 2004 is then pressed onto the movable pieces 2002 so that the inked surface 2003 contacts the substrate 2004 and thereby transfers the ink to the substrate 2004 to provide the printed substrate 2005. FIG. 7 shows an offset lithography process. Therein, a substrate 501 is printed continuously by passing through a rotary printing press in direction 502. The rotary printing press comprises an impression cylinder 503, an offset cylinder 504, and a plate cylinder 505. The plate cylinder 505 is further in contact with a dampening unit comprising a water fountain and a dampening cylinder 507, and an inking unit comprising an ink fountain and an inking cylinder 506. The inking and dampening units deliver ink and water onto the plate cylinder 505. The plate cylinder 505 transfers the ink onto the blanket covering the offset cylinder 504. The substrate 501 is pressed against the offset cylinder 504 by the impression cylinder 503, transferring the ink onto the substrate to form a printed image. FIG. 8 is a schematic view of a flexographic printing process. The flexible substrate 601 passes through the flexographic printing press in the indicated direction 602. During passing through the flexographic printing press, an ink layer 603 comprising a plurality of images 605 is printed on the substrate 601 via ink stations 604, wherein each of the ink stations 604 contributes part of the images 605. FIGS. 9a-9c show schematic views of printed substrates with different regular patterns of different images. In FIGS. 10a -10 f, top views of varnish layers with different top view shapes of micro-lenses are shown. FIGS. 10a and 10b show a circular shape of the relief features. FIGS. 10d-10e show a square shape of the relief features. FIG. 10f shows a rhombic shape of the relief features. In FIGS. 11a -11 g, side views of varnish layers with preferred side view shapes of the relief features are shown. FIG. 11a shows a triangular shape of the relief features. FIG. 11b shows a trapezoid shape of the relief features. FIG. 11c shows a square shape of the relief features. FIGS. 11d and 11e show a rectangular shape of the relief features. FIG. 11f shows relief features in the shape of partial spheres. FIG. 11g shows relief features in the shape of partial ellipsoids. FIG. 12 shows a schematic view of the moire magnifier principle of the provision of a 3D micro-optic image from a viewer's perspective: a printed substrate with a regular pattern of micro-images 1001 is superimposed with a varnish layer with circular micro-lenses 1002. The resulting 3D micro-optic image 1003 is caused by a moire magnification effect. FIG. 13 is a flowchart that illustrates the steps of printing 3D-microoptic images on packaging systems. Step 1101 includes providing a substrate. Step 1102 includes printing a plurality of images on the first major surface of the substrate. Step 1103 includes applying a varnish layer on the printed first major surface of the substrate. Step 1104 includes forming a plurality of relief features on the outer surface of the varnish layer. Result 1105 is a 3D-microoptic image packaging system resulting from the steps 1101-1104. The 3D-microoptic effect is caused by the overlaying of images and relief features resulting in a moire magnification effect. FIG. 14 shows a process according to the invention. A substrate 1201 is provided. Images are printed on the substrate 1201 via ink stations 1202 in a flexographic printing process, providing a printed substrate with an ink layer 1203 with micro-images 1204 on one surface of the substrate 1201. A flexographic casting plate 1205 is then used for applying a varnish layer 1206 and casting varnish micro-lenses 1207 which superimpose the micro-images. FIG. 15 is a schematic view of a flexographic printing press suitable for printing 3D-microoptic images on packaging systems. The substrate 1301 passes the flexographic printing press in the indicated direction 1305. During passing through the flexographic printing press, an ink layer 1302 comprising a plurality of images 1303 is printed on the substrate 1301 via ink stations 1306, wherein each of the ink stations 1306 contributes part of the images 1303. A varnish layer comprising a plurality of relief features 1034 is casted via a varnish station 1307. FIG. 16 is a flowchart that illustrates the steps of making a patterned flexographic printing or casting plate according to the invention. Step 1401 includes providing a patterned substrate, preferably a flexible patterned substrate, which is described in further detail in connection with FIG. 17 a. Step 1402 includes providing an uncured soft photopolymer plate, as described in connection with FIG. 17 b. Step 1403 includes optional pretreatment steps of the plate, as described in connection with FIGS. 17c -17 e. Step 1404 includes impressing the substrate into the plate, as described in connection with FIGS. 17f and 17 g. Step 1405 includes curing the plate, as described in connection with FIGS. 17h -17 j. Result 1406 is the flexographic printing or casting plate resulting from the steps 1401-1405. FIG. 17a illustrates an end view of a flexible patterned substrate. At least part of the one major surface of the substrate 1510 includes relief features. The relief features are characterized by protrusions 1511 and recesses 1512. They may for example have a height (measured perpendicular to the substrate from the deepest recess to the tallest protrusion) of 50 nm to 150 μm. The protrusions 1511 and the recesses 1512 together form an exemplary pattern, which serves as the master pattern for the flexographic printing or casting plate made in the method of FIG. 16. The pattern on the substrate can have relief features that include any number of protrusions and/or recesses of any kind, of any shape, of any aspect ratio, having any distribution known in the art, with any of these configurations variable in any way, preferably so long as the pattern has a height from 50 nm to 150 μm, such as 50 nm to 75 μm, 50 nm to 37 μm, 50 nm to 15 μm, or 50 nm to 7 μm. FIG. 17b illustrates an end view of an uncured soft photopolymer plate comprising a protective mask 1520 and photopolymer material 1521. The presence of a protective mask 1520 in the uncured soft photopolymer plate is optional. FIG. 17c illustrates an end view of a step of curing a side of the plate which is the same as the plate of FIG. 17 b. A curing source 1534, such as a UV light or an electron-beam emitter, emits curing energy 1533 (e.g. heat and/or light), which at least partially cures an outer portion of the photopolymer material, such that the photopolymer material has a cured portion 1532 and an uncured portion 1531. As an example, a curing source (for use with any curing step disclosed herein) may be a DeGraf Concept 400 ECLF plate curing system (available from GLUNZ & JENSEN of Ringsted, Denmark). FIG. 17d illustrates an end view of a step of removing the mask 1540 from the plate. The removal process 1543 (such as laser ablation) comprises removing the mask 1540 in direction 1544, and exposing an unmasked area 1542 on a surface of the uncured portion 1541 of the photopolymer material. To prepare the plate for subsequent treating and/or impressing 1540, as described below, all of the mask may be removed, such that all of the first side 1542 becomes an unmasked area. It is also possible that only part of the protective mask 1540 may be removed. In this case, the unmasked area may be continuous or discontinuous. As an example, a mask may be ablated using a CDI Spark 4835 Inline UV Digital Flexo image setter (available from ESKO of Ghent, Belgium). FIG. 17e illustrates an end view of a step of pretreating the plate. A treating source 1552, such as a spray nozzle, a doctor blade, or a draw down rod provides a treatment 1553, which partially treats at least part of an outer portion of the uncured portion 1550 of the plate, e.g., to improve its ability to release a surface after contact. An example of said treating is spraying a thin silicone coating. The uncured portion 1551 may be partially or fully treated. FIG. 17f illustrates an end view of a step of impressing the flexible patterned substrate 1560 into an exposed surface of the uncured portion 1561 of the soft photopolymer plate. Opposing inward forces 1563 and 1564 provide pressure that presses the substrate 1560 and the plate against each other, such that the pattern of the substrate 1560 is imparted to the plate and the protrusions and recesses of the pattern shape at least an outer portion of the uncured portion 1561 into a pattern that is an inverse of the pattern of the substrate 1560. The protrusions and recesses of relief features of the substrate 1560 become recesses and protrusions of relief features on the plate. The opposed inward forces can be provided by various kinds of mechanical apparatus known in the art, including, for example, the pressure rollers as shown in FIG. 17 g. The impressing step may also include applying heat (e.g. by a heater that provides conduction, convection, and/or radiation) to further soften the soft photopolymer plate before and/or during impressing. FIG. 17g illustrates a side view of a portion of a mechanical apparatus that can be used in the step of impressing the flexible patterned substrate 1570 into an exposed surface of the uncured portion 1571 of the soft photopolymer plate. A first roller 1574 rotates 1576 counterclockwise and a second roller 1575 rotates 1577 clockwise. The rollers 1574 and 1575 together provide distributions of opposing inward forces that press the substrate 1570 and the plate against each other, such that the pattern of the substrate 1570 is imparted to the plate, as the substrate 1570 and the plate passes through 1573 between the rollers 1574 and 1575. The pair of rollers 1574 and 1575 can be provided by a (heated or unheated) roll laminating machine, as known in the art, including, for example, LUX Laminator Model 62 Pro S available from MacDermid, Inc. of Morristown, Tenn., United States. Substrate and plate may be passed through one or more pairs of such rollers, one or more times, with or without a carrier sheet on either or both sides. Other kinds of laminating machines or presses (with or without rollers) as known in the art may alternatively be used. FIG. 17h illustrates an end view of a step of partially curing a side of the plate. Therein, the plate is still in contact with the flexible patterned substrate 1580 from the impressing step of FIGS. 17f and/or 17 g. The substrate 1580 has material properties, e.g. translucence, that allow for transmission of the curing energy. A first curing source 1586 is located outside of the substrate 1580 and emits curing energy 1585 that travels through the substrate 1580. It partially cures at least a portion of the uncured portion 1581 of the photopolymer material. A second curing source 1584 is located outside of the cured portion of the plate 1582 and emits curing energy 1583 that travels through the plate. The plate has material properties, e.g. translucence, that allow for transmission of the curing energy. Thereby, at least a portion of the uncured portion 1581 of the photopolymer material is cured, such that the uncured portion 1581 becomes at least partially cured. Thereby, the substrate 1580 can be more easily removed from the plate without distorting or damaging the pattern formed on the plate. It is also possible that one or more curing sources are used on only one side. Typically, curing energy falls within the UV spectrum, such as UV-A (315 to 400 nm wavelengths), UV-B (280 to 315 nm wavelengths), and UV-C (100 to 280 nm wavelengths), and can be provided by various sources, such as mercury bulbs or LED fixtures configured to provide such wavelengths. As an alternative, the step of partial curing is replaced by a step of full curing, so that the partially cured portion 1581 is fully cured. As a further alternative, the step of partial curing is omitted, so that the partially cured portion 1581 is uncured. FIG. 17i illustrates an end view of a side of the plate. The flexible patterned substrate 1590 is removed 1595 from the plate, e.g., by pulling or peeling away. The photopolymer material of the plate has a cured portion 1592 and a portion 1591, which depending on previous steps may be uncured, partially cured or fully cured. At least part of the portion 1591 includes protrusions 1594 and recesses 1593, which together form an exemplary pattern, which is the imparted pattern on the flexographic printing plate. FIG. 17j illustrates an end view of a step of fully curing the photopolymer material of the plate. A first curing source 1506 located outside of the portion 1501 of the plate emits curing energy 1505 that travels to the portion 1501 and contributes to fully curing portion 1501. A second curing source 1504 located outside of the cured portion 1502 of the plate emits curing energy 1503 that travels through the cured portion 1502 which has material properties (e.g. translucence) that allow for transmission of the curing energy. Said curing energy 1503 contributes to fully curing portion 1501, such that the portion 1501 becomes fully cured. Thereby, the pattern formed on the plate is finally cured, and the plate is further prepared for end use. As an alternative, 1506 is a first treating source emitting detackifying energy 1505 that travels to the portion 1501 and contributes to fully curing portion 1501 by further polymerization of the photopolymer material. 1504 is a second treating source emitting detackifying energy 1503 that travels through the cured portion 1502 that contributes to further polymerization of the photopolymer material. Thereby, the pattern formed on the plate is finally cured, and the plate is further prepared for end use. One or more treating sources may be used on only one side. A cured photopolymer plate may be detackified in any other way known in the art, for example by immersing the plate in one or more chemical solutions (such as a halogen solution). The step of detackifying the plate is optional. Typically, detackifying energy falls within the UV-C spectrum (100 to 280 nm wavelengths). FIG. 18 is a flowchart that illustrates the steps of making a patterned flexographic printing or casting plate according to the invention. Step 1601 includes providing a rigid patterned substrate, preferably a patterned steel plate, which is described in further detail in connection with FIG. 19 a. Step 1602 includes providing a polymeric material, preferably polypropylene. Step 1603 includes heating the polymeric material in order to bring it in a molten or malleable state. Step 1604 includes forcing the molten or malleable polymeric material onto the substrate, e.g., as described in connection with FIG. 19 b. Step 1605 includes cooling the polymeric material. Result 1606 is the flexographic printing or casting plate resulting from the steps 1601-1605. FIG. 19a illustrates an end view of a rigid patterned substrate. At least part of the one major surface of the substrate 1701 includes relief features. The relief features are characterized by protrusions 1702 and recesses 1703. They may for example have a height (measured perpendicular to the substrate from the deepest recess to the tallest protrusion) of 50 nm to 150 μm. The protrusions 1702 and the recesses 1703 together form an exemplary pattern, which serves as the master pattern for the flexographic printing or casting plate made in the method of FIG. 18. The pattern on the substrate can have relief features that include any number of protrusions and/or recesses of any kind, of any shape, of any aspect ratio, having any distribution known in the art, with any of these configurations variable in any way, preferably so long as the pattern has a height from 50 nm to 150 μm, such as 50 nm to 75 μm, 50 nm to 37 μm, 50 nm to 15 μm, or 50 nm to 7 μm. FIG. 19b illustrates an injection molding device. A solid polymeric material is loaded in a vessel 1723 via a hopper 1724. The vessel 1723 is heatable, so that the polymeric material can be molten or made malleable in the vessel 1723. As an alternative, a polymeric material can be loaded into the vessel 1723 in an already molten or malleable state. From the vessel 1723, the molten or malleable polymeric material is forced through a nozzle 1722 into a cavity 1721 that is defined by a mold 1720. The mold 1720 comprises a rigid patterned substrate as shown in FIG. 19 a. FIG. 20 shows an example of a microoptic image packaging system 1800 from a side view. The system comprises a substrate 1810, an ink layer 1820 comprising micro-images 1830, and a varnish layer 1840. The varnish layer 1840 is superimposed on the ink layer 1820. The inner surface of the varnish layer 1840 is in contact with the ink layer. The outer surface of the varnish layer 1840 faces away from the ink layer 1820 and the substrate 1810. On the outer surface of the varnish layer 1840, a plurality of relief features 1850 is disposed. Each of the images 1830 are superimposed with one relief feature 1850 which has at least the same maximum diameter as the image 1830 and which is centrally arranged on top of the image 1830. The dimensions and values disclosed herein are not to be understood as being strictly limited to the exact numerical values recited. Instead, unless otherwise specified, each such dimension is intended to mean both the recited value and a functionally equivalent range surrounding that value. For example, a dimension disclosed as “40 mm” is intended to mean “about 40 mm ” Every document cited herein, including any cross referenced or related patent or application, is hereby incorporated herein by reference in its entirety unless expressly excluded or otherwise limited. The citation of any document is not an admission that it is prior art with respect to any invention disclosed or claimed herein or that it alone, or in any combination with any other reference or references, teaches, suggests or discloses any such invention. Further, to the extent that any meaning or definition of a term in this document conflicts with any meaning or definition of the same term in a document incorporated by reference, the meaning or definition assigned to that term in this document shall govern. While particular embodiments of the present invention have been illustrated and described, it would be obvious to those skilled in the art that various other changes and modifications can be made without departing from the spirit and scope of the invention. It is therefore intended to cover in the appended claims all such changes and modifications that are within the scope of this invention. 1. Method for printing 3D-microoptic images on packaging systems comprising a. providing a substrate having a first and a second major surface; b. printing a plurality of images on at least part of the first major surface of the substrate to provide a substrate with a printed first major surface; c. applying a transparent varnish layer on the printed first major surface of the substrate, wherein the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate; and d. forming a plurality of relief features on the outer surface of the varnish layer, wherein the relief features are micro-lenses. 2. The method according to claim 1, wherein the substrate is a rigid, non-porous polymeric material selected from the group consisting of high density polyethylene, low density polyethylene, linear low density polyethylene, polypropylene and polyethylene terephthalate. 3. The method according to claim 1, wherein the images are printed by a process selected from inkjet printing, in-mold labeling, transfer printing, rotogravure, silk screen printing, letterpress printing, offset lithography, and flexographic printing. 4. The method according to claim 1, wherein the images are micro-images. 5. The method according to claim 1, wherein the images are arranged in a regular pattern. 6. The method according to claim 1, wherein the image size is at least about 20 μm, and wherein the distance between the images is in the range of from about 1 μm to about 1 mm 7. The method according to claim 1, wherein the varnish is heat curable, light curable or both, preferably UV curable, preferably wherein the varnish is an acrylic varnish. 8. The method according to claim 1, wherein the relief features on the varnish layer are formed by a filmless casting process using a flexographic casting plate. 9. The method according to claim 1, wherein the relief features have a height in the range of from about 50 nm to about 150 μm. 10. The method according to claim 1, wherein the relief features and the images have an identical pattern, preferably wherein each image is superimposed with a relief feature which has at least the same maximum diameter as the image and which is centrally arranged on top of the image. 11. The method according to claim 1, wherein the images are printed by flexographic printing using a flexographic printing plate, or wherein the relief features are formed by a filmless casting process using a flexographic casting plate, or both, and wherein the flexographic printing plate, the flexographic casting plate, or both are made by a process comprising injection molding, blow molding, embossing, printing, engraving, or combinations thereof. 12. The method according to claim 11, wherein the flexographic printing plate, the flexographic casting plate, or both are flexible and made of a plastic material, preferably polypropylene. 13. The method according to claim 11 or 12, wherein the flexographic printing plate, the flexographic casting plate or both are made by a process comprising the following steps: i. providing a flexible patterned substrate; ii. pressing the patterned surface of the patterned substrate onto an uncured soft photopolymer plate to provide a patterned uncured photopolymer plate; and iii. curing the patterned uncured photopolymer plate to provide the patterned flexographic plate. 14. The method according to claim 11 or 12, wherein the flexographic casting plate is made by a process comprising the steps (i) providing a rigid patterned substrate, preferably a patterned steel plate made by laser pulse engraving; and (ii) applying a polymeric material, preferably polypropylene, in an injection molding process on the rigid patterned substrate to provide the flexographic casting plate. 15. 3D-microoptic image packaging system comprising A. a substrate having a first and a second major surface; B. a plurality of images on at least part of the first major surface; C. a transparent varnish layer on the first major surface of the substrate superimposing the printed images, wherein the varnish layer has an inner surface being in contact with the printed first major surface of the substrate and an outer surface facing away from the substrate; and wherein the varnish layer has a plurality of relief features on the outer surface of the varnish layer, wherein the relief features are micro-lenses.

2018-07-05

en

2019-01-10

US-201213437393-A

Access point multi-level transmission power control based on the exchange of characteristics ABSTRACT A first plurality of characteristics are received from a first client device relating to transmissions received by the first client device from both an access point and a second client device. A second plurality of characteristics are received from the second client device relating to transmissions received by the second client device from both the access point and the first client device. The first plurality of characteristics and the second plurality of characteristics are both assessed. Based on the assessment, a least one of a plurality of customized power levels is selected for transmissions by the access point to the first client device and the second client device. CROSS REFERENCE TO RELATED APPLICATIONS The present U.S. Utility patent application claims priority pursuant to 35 U.S.C. §120, as a continuation, to the following U.S. Utility patent application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility patent application for all purposes: 1. U.S. Utility application Ser. No. 13/004,999, entitled “ACCESS POINT MULTI-LEVEL TRANSMISSION POWER CONTROL BASED ON THE EXCHANGE OF CHARACTERISTICS,” (Attorney Docket No. BP5278C3), filed Jan. 12, 2011, pending, which application claims priority pursuant to 35 U.S.C. §120, as a continuation, to the following U.S. Utility patent application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility patent application for all purposes: 2. U.S. Utility application Ser. No. 12/844,687 entitled ACCESS POINT MULTI-LEVEL TRANSMISSION POWER AND PROTOCOL CONTROL BASED ON THE EXCHANGE OF CHARACTERISTICS, filed on Jul. 27, 2010, issued as U.S. Pat. No. 7,894,846; which claims priority pursuant to 35 U.S.C. §120, as a continuation, to the following U.S. Utility patent application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility patent application for all purposes: 3. U.S. Utility application Ser. No. 12/534,655 entitled ACCESS POINT MULTI-LEVEL TRANSMISSION POWER AND PROTOCOL CONTROL BASED ON THE EXCHANGE OF CHARACTERISTICS, filed on Aug. 3, 2009, issued as U.S. Pat. No. 7,787,901, which claims priority pursuant to 35 U.S.C. §120, as a continuation, to the following U.S. Utility patent application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility patent application for all purposes: 4. U.S. Utility application Ser. No. 11/398,930, entitled ACCESS POINT MULTI-LEVEL TRANSMISSION POWER AND PROTOCOL CONTROL BASED ON THE EXCHANGE OF CHARACTERISTICS, filed on Apr. 6, 2006, issued as U.S. Pat. No. 7,583,625, the contents of which are incorporated herein by reference thereto. TECHNICAL FIELD OF THE INVENTION This invention relates generally to wireless communication systems, and more particularly to transmit power control and protocol control of wireless communication devices within such wireless communication systems. BACKGROUND OF THE INVENTION Wireless communication systems are known to support wireless communications between wireless communication devices affiliated with the system. Such wireless communication systems range from national and/or international cellular telephone systems to point-to-point in-home wireless networks. Each type of wireless communication system is constructed, and hence operates, in accordance with one or more standards. Such wireless communication standards include, but are not limited to IEEE 802.11, Bluetooth, advanced mobile phone services (AMPS), digital AMPS, global system for mobile communications (GSM), code division multiple access (CDMA), wireless application protocols (WAP), local multi-point distribution services (LMDS), multi-channel multi-point distribution systems (MMDS), and/or variations thereof. An IEEE 802.11 compliant wireless communication system includes a plurality of client devices (e.g., laptops, personal computers, personal digital assistants, etc., coupled to a station) that communicate over a wireless link with one or more access points. The transmitting device (e.g., a client device or access point) transmits at a fixed power level regardless of the distance between the transmitting device and a targeted device (e.g., station or access point). Typically, the closer the transmitting device is to the targeted device, the less error there will be in the reception of the transmitted signal. However, as is generally understood in the art, wireless transmissions may include some error and still provide an accurate transmission. Thus, transmitting at power levels that provide too few errors is energy inefficient. As is also generally understood in the art, many wireless communications systems employ a carrier-sense multiple access (CSMA) protocol that allows multiple communication devices to share the same radio spectrum. Before a wireless communication device transmits, it “listens” to the wireless link to determine if the spectrum is in use by another station to avoid a potential data collision. At lower received power levels, this protocol can lead to a hidden terminal problem when two devices, generally spaced far apart, are both trying to communication with a third device in the middle. While the device in the middle can “hear” the two devices on the periphery, these two devices cannot hear one another—potentially creating data collisions with simultaneous transmissions destined for the middle device. Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of ordinary skill in the art through comparison of such systems with the present invention. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 presents a pictorial representation of a wireless network 10 in accordance with an embodiment of the present invention. FIG. 2 presents a timing diagram of transmissions by the access point 110 and the client devices 121 and 123 in accordance with an embodiment of the present invention. FIG. 3 presents a pictorial representation of a wireless network 10 that shows examples of client devices and various modes of connection between access points and packet switched backbone network 101 in accordance with an embodiment of the present invention. FIG. 4 presents a block diagram representation of an access point 300 that can be used in wireless network 10 in accordance with an embodiment of the present invention. FIG. 5 presents a block diagram representation of a client device 400 that can be used in wireless network 10 in accordance with an embodiment of the present invention. FIG. 6 presents a block diagram representation of a client device 400′ with optional GPS circuitry 416 and power source regulation circuitry 420 in accordance with an embodiment of the present invention. FIG. 7 presents a block diagram representation of an access point 300′ with optional AP assessment application 225 in accordance with an embodiment of the present invention. FIG. 8 presents a pictorial representation of a wireless network 10 in accordance with an embodiment of the present invention that provides a management application 225 in one of a plurality of terminals. FIG. 9 presents a flowchart representation of a method that can be used in a terminal, access point and/or an integrated circuit in accordance with an embodiment of the present invention. FIG. 10 presents a flowchart representation of a method that can be used in a terminal, client device and/or an integrated circuit in accordance with an embodiment of the present invention. SUMMARY OF THE INVENTION The present invention sets forth a wireless network, access point, client device, integrated circuit and methods that determine transmission power and protocol parameters based on received characteristics substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims that follow. DETAILED DESCRIPTION FIG. 1 presents a pictorial representation of a wireless network 10 in accordance with an embodiment of the present invention. A wireless network 10 includes an access point 110 that is coupled to packet switched backbone network 101. The access point 110 manages communication flow destined for and originating from each of client devices 121, 123, 125 and 127 over a wireless network 10. Via the access point 110, each of the client devices 121, 123, 125 and 127 can access service provider network 105 and Internet 103 to, for example, surf web-sites, download audio and/or video programming, send and receive messages such as text messages, voice messages and multimedia messages, access broadcast, stored or streaming audio, video or other multimedia content, play games, send and receive telephone calls, and perform any other activities, provided directly by access point 110 or indirectly through packet switched backbone network 101. The access point 110 is capable of transmitting high power transmissions 99 and reduced power level transmissions 98 at one or more reduced power levels, depending on the type of transmission, the characteristics of the particular client device to which the transmission is addressed and the characteristics of the other client devices that are associated with the access point 110. The access point 110 includes a management application 225, and each client devices 121, 123, 125 and 127 includes a client assessment application 404. The management application 225 and the client assessment applications 404 of each of the client devices 121, 123, 125 and 127 operate to select adequate transmission power settings that conserve battery power and limit unnecessary electromagnetic radiation. For example, as directed by a client assessment application 404, the client device 121 assesses transmissions from the access point 110 and the client devices 123, 125 and 127. The client device 121 generates reception characteristics based on the assessment. The client device 121 also gathers local status information, anticipated bandwidth utilization characteristics and mobility information, and, based thereon, generates status characteristics, utilization characteristics, and mobility characteristics. The client device 121 delivers the reception characteristics, status characteristics, utilization characteristics and mobility characteristics to the access point 110 for use by the management application 225. According to their client assessment applications 404, the other of the client devices 123, 125 and 127 similarly gather and deliver their local status characteristics, utilization characteristics and mobility characteristics along with reception characteristics relating to others of the client devices and the access point 110. The access point 110, in accordance with the management application 225, also generates its own reception characteristics and utilization characteristics. The management application 225 adjusts the access point's transmission power and controls the transmission power of each of the client devices 121, 123, 125 and 127 based on: 1) the reception characteristics received from each of the client devices 121, 123, 125 and 127 regarding others of the client devices and the access point; 2) locally generated reception characteristics and utilization characteristics regarding each of the client devices 121, 123, 125 and 127; 3) status characteristics from each of the client devices 121, 123, 125 and 127; 4) mobility characteristics from each of the client devices 121, 123, 125 and 127; and 5) utilization characteristics generated by each of the client devices 121, 123, 125 and 127. The access point 110 achieves such control by causing the access point 110 to deliver control instructions to each of the client devices 121, 123, 125 and 127 via the wireless network. Each of the client devices 121, 123, 125 and 127 respond to the control instructions by adjusting its transmit power. Such overall control takes advantage of particular, current circumstances, including current operational status, relative positions and properties of any the network nodes (e.g., the access point 110 and the client devices 121, 123, 125 and 127). As used herein, “reception characteristics” includes any data, generated based on received wireless transmissions, that rates or can be used to rate the quality, accuracy or strength of such received wireless transmissions. For example, reception characteristics might include any one or more of a Received Signal Strength Indication (RSSI), bit/packet error, current/historical error rates, multipath interference indications, Signal to Noise Ratio (SNR), fading indications, etc. Status characteristics includes any data relating to an underlying device's prior, current or anticipated readiness, abilities or capacity for participating on the wireless network. Status characteristics include, for example, the amount of power available, such as whether alternating current (AC) power is available or only battery power, and, if battery power, anticipated battery life at various transmission power levels and at various levels of participation, etc. Status characteristics also include whether a device is currently “sleeping” or inactive or in a low power idle state. It may also include historical information anticipating the current status duration and anticipated status characteristics changes. Status characteristics may also include status information relating to each underlying communication software application that runs on a client device. For example, on a single client device two communication applications might be present with one in an inactive state and the other actively communicating. Status characteristics would identify such activity and inactivity. Utilization characteristics include any parameter that indicates a prior, current or anticipated bandwidth requirement, usage or usage characteristic. Utilization characteristics might include anticipated QoS (Quality of Service) requirements, upstream/downstream bandwidth usage, bandwidth usage characteristics, idle versus active status characteristics, underlying data/media types (e.g., voice, video, images, files, database data/commands, etc.) and corresponding requirements, etc. Mobility characteristics include for example indications as to whether the underlying device is: 1) permanently stationary, e.g., a desktop client computer, game console, television, set top box or server; 2) capable of mobility, e.g., a cell phone or mobile VoIP (Voice over Internet Protocol) phone, PDA (Personal Digital Assistant), and palm, laptop or pad computer; and 3) currently moving, e.g., any one or more of current position and direction, velocity and acceleration information. In operation, the access point 110 is capable of transmitting at a selected power level that is based on factors such as the type of transmission, the reception characteristics, status characteristics, utilization characteristics, mobility characteristics, and the particular target device for the transmission. For instance, access point 110 can transmit periodic beacons at a high power level that include information relating to the access point 110 and the packet switched backbone network 101 such as a service set identifier (SSID) and network name. These beacons are used to support new associations with client devices 121, 123, 125 and 127 that enter the proximity of access point 110 or that otherwise become active within this proximity. Reception characteristics relating to how well the client devices 121, 123, 125 and 127 receive these beacon transmissions can be generated by the client assessment applications 404 of these client devices and transmitted back to the access point 110. In response, management application 225 determines a customized power level for the access point to transmit to each client device 121, 123, 125, and 127 that may be reduced from the maximum power output, but that provides sufficient power to be received by that particular client device. In addition, management application 225 determines an intermediate power level that is sufficient to be received by all of the client devices 121, 123, 125 and 127. Specific packets, such as all acknowledgements (ACKs), every other ACK, every nth ACK etc., all data packets, occasional data packets, etc. are transmitted by the access point 110 at the intermediate power level that will reach all of the client devices 121, 123, 125 and 127, with the remaining packets transmitted at the power level that is customized for the particular client device 121, 123, 125 or 127 to which the packets are addressed. Reducing the transmitted power of the access point, and of the client devices themselves, reduces the power consumption of these devices—potentially extending the life of the devices and the battery life for devices that are battery powered. In addition, the resulting wireless network 10 is more “transmission friendly” to neighboring networks. The transmission of beacons at high power promotes the association of new client devices to wireless network 10. The transmission of packets addressed to a particular client device 121, 123, 125 or 127, at a customized power level enhances the power efficiency of the network. The transmission of selected packets at the intermediate power level, that will reach all of the client devices 121, 123, 125 and 127 that are associated with access point 110, helps reduce hidden terminal problems by letting other client devices know that a device is transmitting. By way of example, the access point 110 may transmit at ten discrete power levels at 1 dB increments, say 10 through 1, with 10 corresponding to the full power transmission, 9 corresponding to a 1 dB reduction in transmitted power, 8 corresponding to a 2 dB reduction in power, etc. Based on reception characteristics received from client devices 121, 123, 125, and 127, management application 225 of access point 110 determines the following power levels are sufficient to be received by each client device: Client Device Power level 121 5 123 6 125 8 127 6 Access point 110 transmits beacons at a power level of 10. Access point 110 transmits every other ACK with a power level of 8, sufficient to be received by each client device 121, 123, 125 and 127. Other packets from access point 110 are transmitted at the power level assigned to the addressee client device. Packets addressed to client devices 123 or 127 are transmitted at power level 6, packets addressed to client device 121 are transmitted at power level 5, packets addressed to client device 125 are transmitted at power level 8. While the reception characteristics are described above as generated in response to access point beacons, the reception characteristics can also be collected by a given one of the client devices 121, 123, 125 and 127 through a test mode and through “sniffing”. In the test mode, the access point 110 directs each of the client devices to respond with reception characteristics in response to transmissions from the access point 110 at one or more transmission power levels. Also, in the test mode, the access point 110 directs one of the client devices 121, 123, 125 and 127 to transmit at one or more selected power levels and all others to generate and deliver reception characteristics in response. The access point 110 may similarly direct each of the others of the client devices 121, 123, 125 and 127 to send the test transmissions and correspondingly have the others respond by generating reception characteristics. Testing can be conducted periodically or whenever conditions indicate that transmission power adjustments may be needed. Devices that are mobile may undergo testing more often than those that are stationary. Collecting reception characteristics through sniffing involves a client device listening to ordinary (not test) transmissions from and to the access point 110. The access point 110 may request reception characteristics based on such sniffing or may be delivered same occasionally or periodically (e.g., as significant changes are detected) and without request by each client device. Similarly, without request, status characteristics, utilization characteristics and mobility characteristics may be reported as significant changes therein occur by a client device to the access point 110. Further, while the selected power levels used by access point 110 to transmit to each client device are described above as being determined based on reception characteristics, management application 225 can likewise use status characteristics, utilization characteristics and mobility characteristics and with periodic updates thereto, to determine the customized power levels for transmission to each client device 121, 123, 125, and 127 and the intermediate power level that will reach all client devices. For example, the client device 123 generates reception characteristics from transmissions between the client device 121 and the access point 110. The client device 123 delivers the reception characteristics generated to the access point 110. The client device 123, a stationary desktop computer, has access to AC power, and has a full-duplex, video streaming application running in an active communication state which requires significant bandwidth and QoS. The client device 123 communicates such corresponding status characteristics, utilization characteristics and mobility characteristics to the access point 110. The client device 125, a battery powered device with significant remaining battery life, is operating with little communication traffic either direction. The client device 125 generates reception characteristics for all communication exchanges. The client devices 121 and 127, portable communication devices with minimal power resources, both have one or more communication applications active that require light but continuous bandwidth demands. Both also generate reception characteristics regarding communication flowing in all directions. Such reception characteristics and underlying status characteristics, utilization characteristics and mobility characteristics are communicated to the access point 110. The management application 225 of the access point 110 considers all such received communications, and for example, may operate at the higher overall transmission power with protocol supported QoS and priority when transmitting to client device 123. When transmitting at the intermediate power level, all of the other client devices should receive the transmissions and attempt to avoid simultaneous, interfering transmissions. Further, the management application 225 may increase the power level for transmission to client device 125, given the mobility of this device and the potentially changing reception characteristics that this client device may experience. For transmission to the access point 110 from the client devices 121, 123, 125 and 127, the management application 225 can determine a transmission power level, based on the reception characteristics (including receptions by client devices 121, 123, 125 and 127 of transmissions from other client devices), status characteristics, utilization characteristics and mobility characteristics, that are transmitted by access point 110 to each respective client device. By way of further examples, the client devices 121 and 127 may each adequately receive transmissions from the access point 110. However, an analysis of their reception characteristics by access point 110 may reveal that client device 127 cannot detect transmissions from client device 121 and vice versa. In this scenario, the access point 110 may choose to boost the transmission power of one or both of the client devices 121 and 127 to avoid potential hidden terminal problems that could occur when client device 121 and 127 attempt to transmit to access point 110. An analysis of reception characteristics and status characteristics by access point 110 may also reveal that the client device 123 is easily detected by each of the other devices and that it is running low on battery power. In response, the access point 110 can select a reduced transmission power level for the client device 123 that extends its battery life. An analysis of reception characteristics and mobility characteristics by access point 110 may reveal that the client device 125 is highly mobile. Rather than relying solely on reception characteristics, the access point 110 selects a transmission power level for the client device 125 that takes into consideration its possible movement about the transmission range of the wireless network 10. Also to manage power and transmissions, the management application 225 is further operable to manage the protocol or protocols used in communicating between the access point 110 and the client devices 121, 123, 125 and 127 and power levels inherent in and associated therewith. In one mode of operation, management application 225 can selectively adjust one or more protocol parameters, such as the packet length, data rate, forward error correction, error detection, coding scheme, data payload length, contention period, and back-off parameters used by access point 110 in communication with one or more of the client devices 121, 123, 125 and 127, based on the analysis of the reception characteristics, status characteristics, utilization characteristics, and mobility characteristics. In this fashion, the protocol parameters can be adapted for power conservation and to minimize unnecessary transmission power utilization based on the conditions of the network. These conditions for example include not only the mobility, utilization, status, and reception characteristics of a particular device, but the mobility, utilization, status, and reception characteristics of a plurality of devices, and how well each client device receives other client devices. For example, in the event that a client device, such as client device 121, has difficulty detecting transmissions from client device 123, access point 110 can modify the protocol parameters so that transmissions by client device 123 include more aggressive error correcting codes, increased back-off times and/or smaller data payloads or packet length to increase the chances that a packet will be received in the event of contention by client device 121. In addition, decreasing the packet length can increase the frequency of acknowledgements transmitted by access point 110. These acknowledgements can be transmitted at a power level sufficient to be heard by client device 121. With increased back-off times, client device 121 has less opportunity to create a potential contention. In a further mode of operation, access point 110 and client devices 121, 123, 125 and 127 can operate using a plurality of different, and potentially complimentary, protocols having different protocol parameters. Access point 110 can likewise select a particular one of a plurality of protocols that suits the particular conditions present in the wireless network 10, as determined based on an assessment of utilization characteristics, status characteristics, mobility characteristics and/or reception characteristics. For instance, an access point can select from 802.11(n), 802.11(g) or 802.11(b) protocols having different protocol parameters, data rates, etc, based on the particular protocol best suited to accommodate the characteristics of the client devices 121, 123, 125 and 127 that are present. It should be noted that these examples are merely illustrative of the many functions and features presented in the various embodiments of the present invention set forth more fully in conjunction with the description and claims that follow. FIG. 2 presents a timing diagram of transmissions by the access point 110 and the client devices 121 and 123 in accordance with an embodiment of the present invention. In particular, FIG. 2 shows exchanges between access point 110 and client device 121 and exchanges between access point 110 and client device 123. While exchanges between the access point 110 and two client devices are shown, the invention herein likewise applies for use with a greater number of client devices. In this diagram, transmissions such as data packets, acknowledgements and beacons are represented by blocks whose relationship to the timing of other events can illustrate a mode of operation, however, the durations of these blocks are not shown to scale. The relative amplitude of these blocks represents the power level of a particular transmission, with taller blocks being transmitted at greater power and shorter blocks being transmitted at lower power. Prior to the beginning of the time shown by FIG. 2, client device 121 has generated first characteristics by evaluating transmissions, such as beacons, test transmissions or routine on-going transmissions, from both the access point 110 and other client devices, and further, by evaluating its own utilization, status and mobility. Likewise, client device 123 has generated second characteristics by evaluating transmissions from both the access point 110 and other client devices, and its own utilization, status and mobility. Client device 121 transmits, at a preset power level, transmission 130 to the access point 110 that includes the first characteristics. Access point generates an acknowledgement 132 in response at a first power level, such as a high or full power level. Client device 123 transmits, at a preset power level, transmission 134 to the access point 110 that includes the second characteristics. Access point generates an acknowledgement 136 in response at the high power level. The management application 225 of access point 110, having received the first characteristics from client device 121 and second characteristics from client device 123. assesses both the first characteristics and the second characteristics and, based on the assessment, selects both a second power level of the plurality of power levels for transmissions by the access point 110 to the client device 121 and a third power level of the plurality of power levels for transmissions by the access point 110 to the client device 123. Although not shown, the access point 110 may select an alternate protocol, based on such assessment, and coordinate switch-over from that currently being used to the alternate protocol. Assuming a protocol change is not warranted, the management application 225 determines a selected power level for transmissions by the client device 121 and a selected power level for transmissions by the client device 123 and other possible protocol parameters that are sent, respectively, to clients devices 121 and 123 in transmissions 140 and 144 that are acknowledged, respectively, by acknowledgements 142 and 146. After the transmission powers and protocol parameters for the access point 110 and the client devices 121 and 123 are established, the operating mode begins. In this example, the access point 110 transmits at a highest power level for the periodic beacons 140. Transmissions to client device 121, such as acknowledgement 154 are at a first reduced power level that is sufficient for reception by client device 121. Transmissions to client device 123, such as transmissions 160 are at a second reduced power level that is sufficient for reception by client device 123. Periodic acknowledgements, such as acknowledgements 152 and 156 are at a higher power level that can be heard by all of the client devices in the network. Transmissions 150 by client device 121 are at the power level selected by access point 110 for this device based on the characteristics of client device 121. Acknowledgements 162 by client device 123 are transmitted at the power level selected by access point 110 for client device 123 device based on the characteristics of this device. In this fashion, access point 110 transmits selected wireless transmissions, such as beacons 140 at a first power level, to reach both client devices 121 and 123 and potentially other devices that wish to associate with wireless network 10. Other wireless transmissions, such as periodic acknowledgements 152 and 156 by the access point 110, are sent at a second power level that is selected to support both delivery of the packets to the client device 121 and detection of these transmissions by the client device 123, the first power level being greater than the second power level. In addition, wireless transmissions, such as transmissions 160 are sent at a third power level selected to support receipt of the packets by client device 123 device, the second power level being greater than the third power level. Alternatively, if circumstances warrant, the access point 110 could choose all of its transmissions other than the highest power beacons to be tailored specifically for the client device 121 even though the client devices 123 cannot hear such transmissions. To combat such hidden terminal condition, the access point 110 commands the client device 121 to transmit at a power level sufficient for the client device 123 to detect. With a protocol that requires at least periodic confirmation by the client device 121 (e.g., interspersed acknowledge packets), even though the client device 121 cannot hear the access point 110, the client device 123 will hear the periodic confirmation transmissions (or payload transmissions from the client device 121), and thus determine that the access point 110 is engaged. At the same time, the access point 110 may determine that the client device 121 can hear transmissions by the access point 110 at power levels only great enough to adequately support the client device 123. Based on this determination, the access point 110 might direct the client device 123 to transmit at a power level only sufficient to adequately reach the access point 110 but not the client device 121. Of course, various other circumstances warrant various other transmission power and protocol configurations. For example, if the access point 110 determines that transmissions from and to the client device 121 can be selected such that they provide adequate performance yet not be heard by the client device 123, the access point 110 may adopt such power levels. Because the client device 123 has indicated an idle status, the access point 110 may accept any unexpected interference from the client device 123 as it exits the idle status to transmit during a communication exchange between the client device 121 and the access point 123. Thereafter, the access point 110 can change power levels to accommodate the both of the client devices 121 and 123 in their active states. Or, instead of merely tolerating such unexpected interference, the access point 110 may employ a different protocol operation or an entirely different protocol to accommodate such circumstances. An example of this would be for the access point 110 to command that the client device 123 only attempt transmissions from the idle state during a fixed period after a beacon and thereafter avoid communication exchanges with the client device 121 during such period. This change might be supported within the current protocol, or might require a change from the current protocol to another. Similarly, instead of switching protocols, the access point 110 may choose to operate two different protocols at the same time, by directing at least one of the two of the client devices 121 and 123 to switch. Further, if the access point 110 detects that the client device 123 is plugged into AC (Alternating Current) power, it may direct the client device 123 to always transmit at a higher or highest power, while directing the client device 121 (that may operate on limited battery power) to transmit at only that necessary to reach the access point 110. Many other circumstances and adaptation by the access point 110 to reduce overall unnecessary transmission power usage by one or more of the client devices 121 and 123 and the access point 110 itself are contemplated. FIG. 3 presents a pictorial representation of a wireless network 10 that shows examples of client devices and various modes of connection between access points and packet switched backbone network 101 in accordance with an embodiment of the present invention. Packet switched backbone network 101 includes wired data networks 230 such as a cable, fiber, or other wired or hybrid network for providing access, such as narrowband, broadband or enhanced broadband access to content that is local to wired data network 230 or is otherwise accessed through Internet backbone 217. In particular, examples of wired data networks 230 include a public switched telephone network (PSTN), cable television network or private network that provides traditional plain old telephone service, narrowband data service, broadband data service, voice over internet protocol (IP) telephony service, broadcast cable television service, video on demand service, IP television service, and/or other services. Packet switched backbone network 101 further includes a terrestrial wireless data network 232 that includes a cellular telephone network, personal communications service (PCS), general packet radio service (GPRS), global system for mobile communications (GSM), or integrated digital enhanced network (iDEN). These networks are capable of accessing wired data networks 230 through internet backbone 217 and for providing the many of the services discussed in conjunction wired data networks 230 in accordance with international wireless communications standards such as 2G, 2.5G and 3G. Packet switched backbone network 101 also includes satellite data network 234 for providing access to services such as satellite video services, satellite radio service, satellite telephone service and satellite data service. In addition, packet switched backbone network 101 includes other wireless data networks 236 such as a WiMAX network, ultra wideband network, edge network, Universal Mobile Telecommunication System, etc., for providing an alternate medium for accessing any of the services previously described. Access points 211-213 provide access to a switched backbone network 101, such as a wide area network or other network through a wired connection to wired data networks 230. In addition, access point 213 is capable of providing access to packet switched backbone network 101 through wireless data networks 236. Set top box (STB) 214 includes the functionality of access points 211, 212, and/or 213 while further including optional access to terrestrial wireless data network 232, and satellite data network 234. In particular, STB 214 optionally includes additional functions and features directed toward the selection and processing of video content such as satellite, cable or IP video content. While the term “access point” and “set top box” have been used separately in the context of this discussion, the term “access point” shall include both the functionality and structure associated with a set top box, including but not limited to, STB 214. A plurality of client devices are shown that include personal computers (PC) 203 and 206, wireless telephones 204 and 207, television (TV) 205, and wireless headphones 208. These client devices are merely examples of the wide range of client devices that can send data to and receive data from access points 211-213 and STB 214. While each of these client devices are shown pictorially as having integrated transceiver circuitry for accessing a corresponding access point, an separate wireless interface device may likewise be coupled to the client module via a port such as a Universal Serial Bus (USB) port, Personal Computer Memory Card International Association (PCMCIA) Institute of Electrical and Electronics Engineers (IEEE) 488 parallel port, IEEE 1394 (Firewire) port, Infrared Data Association (IrDA) port, etc. Access points 211-213 and STB 214 include a management application 225 and personal computers (PC) 203 and 206, wireless telephones 204 and 207, television (TV) 205, and wireless headphones 208, include client assessment application 404 that allow these devices to implement the power management method and structure in accordance with an embodiment of the present invention. Further discussion of these wireless networks, access points, client devices, including methods for use therewith will be set forth in association with FIGS. 3-9 and the appended claims. FIG. 4 presents a block diagram representation of an access point 300 that can be used in wireless network 10 in accordance with an embodiment of the present invention. In particular, access point 300, such as access point 110, 211-213, STB 214, is presented. Access point 300 includes a communication interface circuitry 308 for communicating with at least one packet switched backbone network 101. While a single connection is shown, in an embodiment of access point 300, such as access point 213 and/or STB 214, communication interface circuitry 308 provides a plurality of interfaces that communicatively couples with packet switched backbone network 101, such as the various networks shown in association with FIG. 2. Access point 300 further includes access point transceiver circuitry 302, operatively coupled to the communication interface circuitry 308, that manages communication by transmitting at a plurality of power levels and receives data over a wireless network 10, to and from a plurality of client devices, such as client devices 121, 123, 125, 127, PCs 203 and 206, wireless phones 204 and 207, TV 205 and wireless headphones 208. Access point 300 also includes memory circuitry 306, and processing circuitry 304 that controls communication flow between the communication interface circuitry 308 and the access point transceiver circuitry 302, and that implements management application 225. Management application 225 includes power logic 227 that selects the power level of the plurality of power levels for periodic transmissions such as beacons, the transmission of data packets and the transmission acknowledgements, based on the particular target or targets that access point 300 wishes to reach with a particular transmission. In addition, management application 225 includes protocol logic 229 that selects either particular protocol parameters, or particular protocols for use in communications with one or more of the client devices. These protocols, protocol parameters, client device power levels and transmission power levels for access point 300 are stored in memory circuitry 306 and retrieved by processing circuitry 304 as needed. The processing circuitry 304 may be a single processing device or a plurality of processing devices. Such a processing device may be, for example, any one or more of a microprocessor, microcontroller, digital signal processor, field programmable gate array, programmable logic device, logic circuitry, state machine, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on operational instructions. The memory circuitry 306 may be a single memory device or a plurality of memory devices. Such a memory device may be read-only memory, random access memory, volatile memory, non-volatile memory, flash memory, static memory, dynamic memory, optical or magnetic storage, and/or any device that stores digital information. Note that when the processing circuitry 304 implements one or more of its functions via a state machine, logic circuitry, analog circuitry, and/or digital circuitry, the memory storing the corresponding operational instructions may be embedded in the circuitry comprising the state machine, logic circuit, analog circuit, and/or digital circuit. In an embodiment of the present invention, wireless network 10 conforms to at least one industry standard communication protocol such as 802.11, 802.16, 802.15, Bluetooth, Advanced Mobile Phone Services (AMPS), Global System for Mobile Communication (GSM), and a General Packet Radio Service (GPRS). Other protocols, either standard or proprietary, may likewise be implemented within the scope of the present invention. In operation, the management application 225 receives reception characteristics, status characteristics, mobility characteristics and utilization characteristics from at least one of the plurality of client devices. The reception characteristics includes, for example, point to point reception parameters such as the strength of signals received by at least one of the plurality of client devices from other devices over the wireless link. Based on at least some of the reception characteristics, status characteristics, mobility characteristics and utilization characteristics, the management application 225 selects transmission power levels for itself and for each of the plurality of client devices, and transmits corresponding control signals to the plurality of client devices, directing transmission power adjustment to the selected power levels. Further details, including several optional features of management application 225 are presented in association with FIG. 6. Communication interface circuitry 308 and selected functions of AP transceiver circuitry 302 can be implemented in hardware, firmware or software. Other functions of transceiver circuitry 302 are implemented in analog RF (Radio Frequency) circuitry as will be understood by one skilled in the art when presented the disclosure herein. When implemented in software, the operational instructions used to implement the functions and features of these devices can also be implemented on processing circuitry 304 and stored in memory circuitry 306. In operation, access point 300 communicates with each client device in a point-to-point manner. To transmit data, access point 300 generates a data packet that is formatted based the selected protocol of wireless network 10. In particular, communication interface circuitry 308 produces data payloads based on data received from packet switched backbone network 101. Other control information and data including the selected power levels and protocol parameters destined for the client devices of wireless network 10 are derived from power the management application 225 of the processing circuitry 304. AP transceiver circuitry 302 modulates the data, up-converts the modulated data to produce an RF signal of the wireless network 10. In an embodiment of the present invention, the AP transceiver circuitry 302 transmits at one of a plurality of power levels, as determined by management application 225. As one of average skill in the art will appreciate, if the access point 300 operates based on a carrier sense multiple access with collision avoidance (CSMA/CA), when access point 300 transmits data, each client device in communication with wireless network 10 may receive the RF signal, but only the client that is addressed, i.e., a target client device, will process the RF signal to recapture the packet. AP transceiver circuitry 302 is further operable to receive signals from the plurality of client devices over wireless network 10. In this instance, transceiver circuitry 302 receives an RF signal, down-converts the RF signal to a base-band signal and demodulates the base-band signal to recapture a packet of data. In particular, data payloads destined for packet switched backbone network 101 are provided to communication interface circuitry 308 to be formatted in accordance with the protocol used by packet switched backbone network 101. Other control information and data including the selected reception characteristics received from the client devices of wireless network 10 are provided to management application 225 of processing circuitry 304. FIG. 5 presents a block diagram representation of a client device 400 that can be used in wireless network 10 in accordance with an embodiment of the present invention. A client device 400 is presented, such as client devices 121, 123, 125, 127, PCs 203 and 206, wireless phones 204 and 207, TV 205 and wireless headphones 208. In particular, client device 400 includes a client transceiver circuitry 402 that transmits and receives data over wireless network 10, that operates in a similar fashion to access point transceiver circuitry 402. However, client transceiver circuitry 402 is operable to transmit at a selected power level, received from access point 300. Client device 400 includes memory circuitry 408, and processing circuitry 406 that implements client assessment application 404 and client application 410. The processing circuitry 406 may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, microcontroller, digital signal processor, field programmable gate array, programmable logic device, logic circuitry, state machine, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on operational instructions. The memory circuitry 408 may be a single memory device or a plurality of memory devices. Such a memory device may be read-only memory, random access memory, volatile memory, non-volatile memory, flash memory, static memory, dynamic memory, and/or any device that stores digital information. Note that when the processing circuitry 406 implements one or more of its functions via a state machine, logic circuitry, analog circuitry, and/or digital circuitry, the memory storing the corresponding operational instruction will be embedded in the circuitry comprising the state machine, logic circuit, analog circuit, and/or digital circuit. Further, client device 400 includes a client assessment application 404, operably coupled to the client transceiver circuitry 402, that assesses signals received from other devices, including the access point and other client devices, over the wireless network 10. In response, client assessment application 404 generates reception characteristics and transmits the reception characteristics over the wireless link to access point 300. In operation, the client assessment application 404 includes operational instructions that cause processing circuitry 406 to transfer data and signals to and from client transceiver circuitry 402; to assess signals 438 received from other devices, including other client devices, over the wireless link; and to generate reception characteristics 436. In one mode of operation, client assessment application calculates a measure of signal strength, such as RSSI for each of the other devices and formats this information as reception characteristics 436 for transmission to management application 225. Further details, including several optional features of client assessment application 404 are presented in association with FIG. 5. Client application 410 includes the prime functions of the device itself, (e.g. a television, telephones, personal computer, headphones, etc.) Selected data packets transmitted to and wide area network originate 101 from data received from client application 410. In addition, data packets received from packet switched backbone network 101 are passed to client application 410. Selected functions of client transceiver circuitry 402 can be implemented in hardware, firmware or software. Other functions of client transceiver circuitry 402 are implemented in analog RF circuitry as will be understood by one skilled in the art when presented the disclosure herein. When implemented in software, the operation instructions used to implement the functions and features of these devices can be implemented on processing circuitry 406 and stored in memory circuitry 408. In an embodiment of the present invention, one or more components of client transceiver circuitry 402, processing circuitry 406 and memory circuitry 408 are implemented on an integrated circuit. FIG. 6 presents a block diagram representation of a client device 400′ with optional GPS circuitry 416 and power source regulation circuitry 420 in accordance with an embodiment of the present invention. Client device 400′ can be used in place of client device 400 in any of the applications disclosed herein. In particular, a client assessment application 404 includes operational instructions that cause processing circuitry 406 to support the management application 225 of the access point 300. In particular, the client assessment application 404 is operably coupled to power source regulation circuitry 420 to monitor the charging of optional battery pack 422, monitor the charge used by battery pack 422, to determine the remaining charge on battery pack 422 and whether the optional external power source 424 is currently connected. The client assessment application 404 includes operational instructions that cause processing circuitry 406 to generate battery life data 432 and transmit such status characteristics over the wireless network 10 via client transceiver circuitry 402. In one mode of operation, client assessment application 404 generates and transmits further status characteristics such as estimated remaining battery life. For instance, battery life data 432 can indicate the client device 400′ is coupled to external power source 424, an estimated battery life for one or more selected power levels, an estimated battery life for one or more coding schemes, an estimated battery life battery life for one or more possible data rates, an estimated battery life based on an estimated channel usage, an estimated battery life battery life based on an estimate of required deterministic bandwidth, and an estimated battery life based on an estimate of non-deterministic bandwidth, or other estimates of battery life based on further operational parameters of client device 400′. Also as mentioned previously, other types of status characteristics can be generated pursuant to the client assessment application 404 and communicated to the management application running on the access point device 110. Utilization characteristics can be similarly collected and communicated. For example, utilization characteristics may be retrieved directly from the current client application(s) or from the memory 408. Utilization characteristics retrieved from the memory may have originated, for example, based on: 1) prior interaction with or monitoring of the client application 410; 2) user input; and 3) preset values. The client assessment application 404 also causes the processing circuitry 406 to generate and transmit mobility characteristics 434 over the wireless link 434 via the client transceiver circuitry 402. GPS module 416 provides geographical data 418 such as GPS coordinates, scalar and/or vector velocities, accelerations, etc. In addition to such geographical coordinate data 418, mobility module can generate mobility characteristics 434 that includes a mobility factor indicative of whether the client device is in a stationary condition, the client device is in a low mobility condition such as a laptop computer that shifts slightly on a table in a coffee shop, or whether the client device is in a high mobility condition, such as in a car or other mobile environment. This additional mobility characteristic 434 can be associated with a type of a device, e.g. a laptop computer may have a low mobility rating, a wireless transceiver circuitry mounted in a vehicle may have a medium mobility rating, a desktop computer may have a stationary mobility rating, etc. Further the mobility factor can be user selected based on the particular conditions. In addition, the mobility factor can be derived based on assessing a scalar or vector velocity from GPS module 416 and/or changes in geographical coordinate data 418 over time, and comparing the velocity to one of a plurality of mobility thresholds. When generated and transmitted to management application 225, battery life data 432, utilization characteristics 439, mobility characteristics 434, and other status characteristics can further be used by management application 225 for determining a selected power level for client device 400′, for access point 300, and for other client devices of wireless network 10, and for determining either a particular protocol or protocol parameters used by client device 400′ in communications with access point 300. When received, selected power level 462 and protocol parameter 464 can be used to generate the transmissions by client device 400′ to access point 300. FIG. 7 presents a block diagram representation of an access point 300′ with optional AP assessment application 226 in accordance with an embodiment of the present invention. An access point 300′ is presented that includes many common elements of access point 300, referred to by common reference numerals. In addition, the access point 300′ includes an AP assessment application 226 that includes operational instructions, that cause the processing circuitry 304 to assess signals 438 received from the plurality of client devices, such as client device 400, via the wireless link 310. The assessed strength of signals 438 can also be used by management application 225 to determine the selected power level the plurality of client devices of wireless network 10. Access point 300′ may be used in any of the applications discussed in conjunction with access point 300. In particular, access point assessment application 226 assesses signals 438 received from the plurality of client devices based upon a signal strength criteria such as RSSI, a signal to noise ratio (SNR), a noise parameter, or an amount of bit errors, and a bit error rate (BER) of data received from the particular client device. In a test mode of operation, the access point assessment application 226 is operable to generate a test packet such as an echo packet that is transmitted to the client device where a reply packet is transmitted and received back by access point 300. The number of bit errors or the BER for this particular packet can be calculated by comparing the received data to the data that was transmitted. All other client devices that do not participate in the exchange, listen and generate reception characteristics for the access point assessment application 226. In a further “sniffing” mode of operation, the access point assessment application 226 receives reception characteristics generated by the various client devices based on normal, ongoing packets exchanges with the access point. For example, reception characteristics might comprise an error detecting code such as a linear block code, convolutional code or error correcting code can be used to determine the number of bit errors in the received data, within the coding limit of the particular code use. For instance, a (24,12) Golay code with optional CRC bit could detect up to 4 errors in a 24 bit coded word before the coding limit was reached. The management application 225 assesses the received reception characteristics 436, mobility characteristics 434, utilization characteristics 439 and battery life data 432. Optional assessed strength of signals are received from access point assessment application 226. Although not shown, other types of status characteristics and are also received and assessed by the management application 225. The management application 225 implements a plurality of power management rules, based on the reception characteristics 436 (including the assessed strength of signals), the mobility characteristics 434, utilization characteristics, battery life data 432 and other status characteristics. The power management rules generate a selected power level to be used by the access point 300 and a selected power level 462 to be used by one, all or a group of ones of a plurality of client devices, such as client device 400. Upon receiving a corresponding control instruction from the management application 225, any such client device responds adjusting the transmission power to that selected. In operation, the access point 300′, through transceiver circuitry 302, is capable of transmitting at a selected power level that is based on factors such as the type of transmission, the reception characteristics, status characteristics, utilization characteristics, mobility characteristics, and the particular target device for the transmission. For instance, access point 300′ can transmit periodic beacons at a high power level that include information such as a service set identifier (SSID) and network name. These beacons are used to support new associations with client devices that enter the proximity of access point 300′ or that otherwise become active within this proximity. Reception characteristics relating to how well client devices, such as the client devices 121, 123, 125, 127, 400 and 400′, receive these beacon transmissions can be generated by the client assessment applications 404 of these client devices and transmitted back to the access point. In response, management application 225 determines a customized power level for the access point to transmit to each client device that can be reduced from the maximum power output, but that provides sufficient power to be received by that particular client device. In addition, management application 225 determines an intermediate power level that is sufficient to be received by all of the client devices that are currently associated with access point 300′. Specific packets, such as all acknowledgements (ACKs), every other ACK, every nth ACK etc., all data packets, occasional data packets, etc. are transmitted by the access point 300′ at the intermediate power level that will reach all of the associated client devices, with the remaining packets transmitted at the power level that is customized for the particular client device 121, 123, 125, 127, 400 or 400′ to which the packets are addressed. By way of further example, the power level generation module can, through operation of the power management rules, determine which of the client devices 400 are not being heard by other client devices. In response, power level generation module can establish a selected power level 462 for such client devices 400 to optionally boost the transmission power so that they will be heard by some or all of the remaining client devices. In addition, power level generation module can reduce the power generated by a client device 400 that is generating a stronger than necessary signal for being heard by the remaining client devices. Management application 225 is further operable to manage the protocol or protocols used in communicating between the access point 300′ and the client devices associated with access point 300′ over wireless network 10. In one mode of operation, management application 225 can selectively adjust one or more protocol parameters, such as the packet length, data rate, forward error correction, error detection, coding scheme, data payload length, contention period, and back-off parameters used by access point 300′ in communication with one or more of the client devices 121, 123, 125, 127, 400 and/or 400′ based on the analysis of the reception characteristics, status characteristics, utilization characteristics, and mobility characteristics. In this fashion, the protocol parameters can optionally be adapted based on the conditions of the network, including not only the mobility, utilization, status, and reception characteristics of a particular device, but the mobility, utilization, status, and reception characteristics of a plurality of other devices, including how well each client device receives other client devices. For example, in the event that a first client device has difficulty detecting transmissions from a second client device, access point 300′ can modify the protocol parameters so that transmissions by the second client device include more aggressive error correcting codes, increased back-off times and/or smaller data payloads or packet length to increase the chances that a packet will be received in the event of contention by the first client device. In addition, decreasing the packet length can increase the frequency of acknowledgements transmitted by access point 300′. These acknowledgements can be transmitted at a power level sufficient to be heard by the first client device. With increased back-off times, first client device is less likely to create a potential contention. In a further mode of operation, access point 300′ and its associated client devices can operate using a plurality of different, and potentially complimentary, protocols having different protocol parameters. Access point 300′ can likewise select a particular one of a plurality of protocols that suits the particular conditions present in the wireless network 10, as determined based on an assessment of utilization characteristics, status characteristics, mobility characteristics and/or reception characteristics. For instance, an access point can select from 802.11(n), 802.11(g) or 802.11(b) protocols having different protocol parameters, data rates, etc, based on the particular protocol best suited to accommodate the characteristics of the client devices that are present. In an embodiment of the present invention, one or more components of communication interface circuitry 308, access point transceiver circuitry 302, memory circuitry 306 and processing circuitry 304 are implemented on an integrated circuit. FIG. 8 presents a pictorial representation of a wireless network 10 in accordance with an embodiment of the present invention that provides a management application 225 in one of a plurality of terminals. A wireless network 10 includes terminals 400, 401 and 402 that are each capable of sending and receiving data from the other terminals over a wireless link. Terminal 400 includes a management application 225 and terminals 400 and 402 include a client assessment application 404 that allows the selection of transmit power levels to promote effective communication, while reducing the power consumption of terminals. Each of the terminals 400, 401 and 402 are operable to assess the signals received from other devices over the wireless link. Terminals 401 and 402 generate data such as reception characteristics based on the assessed signals, battery life data based on estimates of power consumption, and other status, utilization and mobility characteristics based indicating how likely the signal strengths for a particular terminal may change due to movement, how it is being used and its other anticipated current, estimated or anticipated conditions. Terminals 401 and 402 transmit these data over the wireless link to terminal 400. Terminal 400, determines a selected power level and particular protocols or protocol parameters for itself and for each other terminal, based on the data that it receives for each device, and transmits the selected power levels and protocol parameter(s) back to each corresponding device. The terminals 401 and 402 can then transmit at a power level and with a protocol that takes advantage of their particular circumstances, including their status in the overall wireless network 10, and based on the positions and properties of the other terminals that are present. In operation, terminal 400, while not performing the specific functions of an access point, is capable of performing other features and functions of either access point 300 or access point 300′ discussed herein. In addition, terminals 401, while not necessarily performing the functions of a client application, are capable of performing other features and functions of either client device 400 or client device 400′ discussed herein. In another mode, all parameters are exchanged between every wireless terminal and the access point so that each can independently or cooperatively make transmission power control decisions. For instance, a communication network such as wireless network 10 can include a first device such as terminal 400, having a first wireless transceiver that transmits at a plurality of power levels, a second device, such as terminal 401 having a second wireless transceiver, and a third device, such as terminal 402 having a third wireless transceiver. The second device generates a first reception characteristic based on at least one transmission from the third wireless transceiver, and the second device transmits the first reception characteristic to the first wireless transceiver of the first device. The third device generates a second reception characteristic based on at least one transmission from the second wireless transceiver, and the third device transmits the second reception characteristic to the first wireless transceiver of the first device. The transmission from the third wireless transceiver can comprises either a portion of an ongoing data exchange or a portion of a test message. The first device, based on the first reception characteristic, selects a first power level of the plurality of power levels for transmissions by the first transceiver circuitry to the third transceiver circuitry. The first device, based on the second reception characteristic, selects a second power level of the plurality of power levels for transmissions by the first transceiver circuitry to the second transceiver circuitry, and the first power level is greater than the second power level. In another mode of operation, the first device is further operable to select a first protocol parameter for transmissions by the first wireless transceiver to the second device. The first device is further operable to select a second protocol parameter for transmissions by the first wireless transceiver to the third device. This allows the protocols as well as the power levels to be adapted to the particular conditions present in wireless network 10. In a further mode, the first and second devices transmit mobility characteristics, status characteristics, and utilization characteristics to the first device. The first device assesses at least a portion of the mobility, status and utilization characteristics along with the reception characteristic to generate the power levels for itself and for the second and third devices and for the protocol parameters used by these devices to format transmissions that are sent and to decode transmissions that are received. FIG. 9 presents a flowchart representation of a method that can be used in a terminal, access point and/or an integrated circuit in accordance with an embodiment of the present invention. In particular, a method is presented for use in conjunction with one or more features and functions presented in association with FIGS. 1-8. In step 500, reception characteristics, mobility characteristics, utilization characteristics, and status characteristics are received from one or more client devices over a wireless link. In step 502, the signals received from one or more client devices over the wireless link are assessed and local reception characteristics is generated. Such signals are either test signals or part of ongoing communication exchanges. In step 504, transmission power levels and protocol parameters are determined for each of the client devices and for local use based on any part or all of the locally generated reception characteristics and the received mobility, reception, utilization, and status characteristics. In step 506, the local transmission power and protocol is adjusted, if needed, and commands requesting transmission power and protocol adjustments are sent to each of the client devices as needed. This method is well suited for being implemented as operational instructions that are stored in a memory such as memory circuitry 306 and implemented using processing circuitry such as processing circuitry 304. For example, the status characteristics related to battery life might indicate one or more of the following: whether the client device is coupled to an external power source; the battery life for at least one selected power level; the battery life for at least one coding scheme; the battery life for at least one data rate; the battery life based on an estimated channel usage; the battery life based on an estimate of required deterministic bandwidth; and the battery life based on an estimate of non-deterministic bandwidth. The mobility characteristics might indicate, for example, one or more of the following: the client device is in a stationary condition; the client device is in a low mobility condition; the client device is in a high mobility condition; and a geographical coordinate of the client device. The reception characteristics such as the assessment signal strength might include, for example, one or more of: a received signal strength indicator (RSSI); a signal to noise ratio; a noise parameter; an amount of bit errors; and a bit error rate (BER). In one mode of operation, a test packet such as an echo packet is transmitted to the client device where a reply packet is transmitted and received back. The number of bit errors or the BER for this particular packet can be calculated by comparing the received data to the data that was transmitted. In further mode of operation, received data is assessed based on the payload of normal packets that are received. For instance, an error detecting code such as a linear block code, convolutional code or error correcting code can be used to determine the number of bit errors in the received data, within the coding limit of the particular code use. For instance, a (24,12) Golay code with optional CRC bit could detect up to 4 errors in a 24 bit coded word before the coding limit was reached. In one mode of operation, step 504 implements a plurality of power management rules, based on the reception characteristics, and optionally the mobility characteristics, battery life data and the assessed strength of signals. These power management rules generate a selected power level for an access point based on factors such as the type of transmission, the reception characteristics, status characteristics, utilization characteristics, mobility characteristics, and the particular target device for the transmission. For example, the access point can transmit periodic beacons at a high power level that include information such as a service set identifier (SSID) and network name. These beacons are used to support new associations with client devices that enter the proximity of the access point or that otherwise become active within this proximity. Reception characteristics relating to how well the client devices receive these beacon transmissions can be generated by the client devices and transmitted back to the access point. In response, the access point determines a customized power level for transmissions to each client device that can be reduced from the maximum power output, but that provides sufficient power to be received by that particular client device. In addition, the access point determines an intermediate power level that is sufficient to be received by all of the client devices that are currently associated with access point. Specific packets, such as all acknowledgements (ACKs), every other ACK, every nth ACK etc., all data packets, occasional data packets, etc. are transmitted by the access point at the intermediate power level that will reach all of the associated client devices, with the remaining packets transmitted at the power level that is customized for the particular client device to which the packets are addressed. In a further mode of operation, these power management rules establish a selected power level for a plurality of client devices, that are equipped to receive the selected power level and to set the selected power level accordingly. The selected power levels are transmitted to the corresponding client devices. The selected power level for each client device can be a discrete variable that takes on one of a finite number of values. For example, through operation of the power management rules, the method can determine which of the client devices are not being heard by other client devices. In response, a selected power level can be established for such client devices to optionally boost the transmission power so that they will be heard by some or all of the remaining client devices. In addition, power management rules can reduce the power generated by a client device that is generating a stronger than necessary signal for being heard by the remaining client devices. In a further example, an analysis of reception characteristics and battery life data may reveal that a client device is easily detected by each of the other devices and that it is running low on battery power. In response, a reduced power level can be selected for that device to extend its battery life. In another example, an analysis of reception characteristics and mobility characteristics may reveal that a client device is highly mobile. Rather than relying solely on reception characteristics, the power management rules select a power level for an access point or client device that takes into consideration the client device's possible movement. In addition, the protocol or protocols used in communicating between devices of the wireless network are adapted to the particular characteristics of the access point and the client devices. In one mode of operation, the method can selectively adjust one or more protocol parameters, such as the packet length, data rate, forward error correction, error detection, coding scheme, data payload length, contention period, and back-off parameters used in communication between devices, based on the analysis of information, such as the reception characteristics, status characteristics, utilization characteristics, and mobility characteristics of these devices. In this fashion, the protocol parameters can optionally be adapted based on the conditions of the network, including not only the mobility, utilization, status, and reception characteristics of a particular device, but the mobility, utilization, status, and reception characteristics of a plurality of devices, including how well each device receives transmissions from other devices. In this fashion, the method can include selecting a first power level of the plurality of power levels for periodic transmissions by an access point; receiving a first plurality of characteristics relating to an evaluation by a first client device of transmissions received by the first client device from both the access point and a second client device; receiving a second plurality of characteristics relating to an evaluation by the second client device of transmissions received by the second client device from both the access point and the first client device; and assessing both the first plurality of characteristics and the second plurality of characteristics and, based on the assessment, selecting both a second power level of the plurality of power levels for transmissions by the access point to the first client device and a third power level of the plurality of power levels for transmissions by the access point to the second client device, and the first power level is greater that the second power level, while the second power level is greater than the third power level. FIG. 10 presents a flowchart representation of a method that can be used in a terminal, client device and/or an integrated circuit in accordance with an embodiment of the present invention. In particular, a method is presented for use in conjunction with one or more features and functions presented in association with FIGS. 1-9. In step 600, signals received from other devices over a wireless link by a client device are gathered and assessed along with battery status, device operating status, client application status and anticipated communication requirements and mobility information. In step 602, based on such gathering and assessment, reception, status, utilization and mobility characteristics are generated. In step 604, such generated characteristics are transmitted over the wireless link. In step 606, in response to the transmission in step 604, a command requesting a transmission power level and protocol adjustment is received over the wireless link. In step 608, data is transmitted over the wireless link in accordance with the request at the selected power level and protocol. This method is well suited for being implemented as operational instructions that are stored in a memory such as memory circuitry 408 and implemented using processing circuitry such as processing circuitry 406. For example, the status characteristics such as battery life data can indicate one or more of the following: whether a device such as a client device is coupled to an external power source, the battery life for at least one selected power level, the battery life for at least one coding scheme, the battery life for at least one data rate, the battery life based on an estimated channel usage, the battery life based on an estimate of required deterministic bandwidth, and the battery life based on an estimate of non-deterministic bandwidth. The mobility characteristics can indicates one or more of the following: the client device is in a stationary condition, the client device is in a low mobility condition, the client device is in a high mobility condition, and a geographical coordinate of the client device. The assessment signal strength can include one or more of: a received signal strength indicator (RSSI), a signal to noise ratio, a noise parameter, an amount of bit errors, and a bit error rate (BER). In one mode of operation, a test packet such as an echo packet is transmitted to the client device where a reply packet is transmitted and received back. The number of bit errors or the BER for this particular packet can be calculated by comparing the received data to the data that was transmitted. In further mode of operation, received data is assessed based on the payload of normal packets that are received. For instance, an error detecting code such as a linear block code, convolutional code or error correcting code can be used to determine the number of bit errors in the received data, within the coding limit of the particular code use. For instance, a (24,12) Golay code with optional CRC bit could detect up to 4 errors in a 24 bit coded word before the coding limit was reached. In one mode of operation, a device, such as a client device, terminal or access point, implements a plurality power management rules, based on the reception characteristics, and optionally the mobility characteristics, battery life data and the assessed strength of signals. These power management rules generate a selected power level for the host terminal, access point of client device and for a plurality of client devices, that are equipped to receive a selected power level and to set the selected power level accordingly. The selected power levels are transmitted to the corresponding client devices. The selected power level for each client device can be a discrete variable that takes on one of a finite number of values. For example, through operation of the power management rules, the method can determine which of the client devices are not being heard by other client devices. In response, a selected power level can be established for such client devices to optionally boost the transmission power so that they will be heard by some or all of the remaining client devices. In addition, power management rules can reduce the power generated by a client device that is generating a stronger than necessary signal for being heard by the remaining client devices. In a further example, an analysis of reception characteristics and battery life data may reveal that a client device is easily detected by each of the other devices and that it is running low on battery power. In response, a reduced power level can be selected for that device to extend its battery life, with or without one or both of: a) switching the low power device to another protocol or otherwise adapting its current protocol in accommodation; and b) switching all other devices to another protocol or otherwise adapting their current protocol in accommodation In another example, an analysis of reception characteristics and mobility characteristics may reveal that a client device is highly mobile. Rather than relying solely on reception characteristics, the power management rules select a power level for this client device that takes into consideration its possible movement. In this fashion, the present invention can include a the method for use in a first client device that, along with at least a second client device, wirelessly communicates with and a packet switched backbone network via an access point. Periodic transmissions by the access point at first power level of the plurality of power levels are received. Transmissions received from both the access point and the second client device are evaluated and a first plurality of characteristics relating to the evaluation by the first client device are transmitted to the access point. A transmission is received from the access point at a second power level of the plurality of power levels that is based on an assessment of both the first plurality of characteristics and a second plurality of characteristics from the second client device, wherein the first power level is greater that the second power level, and the transmission contains a selected power level and one or more protocol parameters for transmissions by the first client device. In response the client device transmits at the selected power level and in accordance with the protocol parameter(s). As one of ordinary skill in the art will appreciate, the term “substantially” or “approximately”, as may be used herein, provides an industry-accepted tolerance to its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to twenty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences. As one of ordinary skill in the art will further appreciate, the term “operably coupled”, as may be used herein, includes direct coupling and indirect coupling via another component, element, circuit, or module where, for indirect coupling, the intervening component, element, circuit, or module does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As one of ordinary skill in the art will also appreciate, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two elements in the same manner as “operably coupled”. As one of ordinary skill in the art will further appreciate, the term “compares favorably”, as may be used herein, indicates that a comparison between two or more elements, items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1. In preferred embodiments, the various circuit components are implemented using 0.35 micron or smaller CMOS technology. Provided however that other circuit technologies including other transistor, diode and resistive logic, both integrated or non-integrated, may be used within the broad scope of the present invention Likewise, various embodiments described herein can also be implemented as software programs running on a computer processor. It should also be noted that the software implementations of the present invention can be stored on a tangible storage medium such as a magnetic or optical disk, read-only memory or random access memory and also be produced as an article of manufacture. As the term module is used in the description of the various embodiments of the present invention, a module includes a functional block that is implemented in hardware, software, and/or firmware that performs one or module functions such as the processing of an input signal to produce an output signal. As used herein, a module may contain submodules that themselves are modules. Thus, there has been described herein an apparatus and method, as well as several embodiments including a preferred embodiment, for implementing a wireless network, access point, client device, integrated circuit. Various embodiments of the present invention herein-described have features that distinguish the present invention from the prior art. It will be apparent to those skilled in the art that the disclosed invention may be modified in numerous ways and may assume many embodiments other than the preferred forms specifically set out and described above. Accordingly, it is intended by the appended claims to cover all modifications of the invention which fall within the true spirit and scope of the invention. 1. A method for use in an access point that wirelessly couples a first client device and a second client device to a backbone network, the method comprising: receiving a first plurality of characteristics from the first client device relating to transmissions received by the first client device from both the access point and the second client device; receiving a second plurality of characteristics from the second client device relating to transmissions received by the second client device from both the access point and the first client device; and assessing both the first plurality of characteristics and the second plurality of characteristics and, based on the assessment, selecting a first of a plurality of customized power levels for transmissions by the access point to the first client device and a second of a plurality of customized power levels for transmissions by the access point to the second client device. 2. The method of claim 1, wherein the transmissions evaluated by the first client device comprise at least a portion of an ongoing data exchange. 3. The method of claim 1, wherein the transmissions evaluated by the first client device comprise at least one test signal exchange. 4. The method of claim 1, wherein the first plurality of characteristics include mobility characteristics. 5. The method of claim 1, wherein the first plurality of characteristics include utilization characteristics. 6. The method of claim 1, wherein the first plurality of characteristics include status characteristics. 7. The method of claim 1, wherein the step of assessing both the first plurality of characteristics and the second plurality of characteristics further includes selecting a first protocol parameter for transmissions by the access point transceiver circuitry to the first client device. 8. A method for use in a first client device that, along with at least a second client device, wirelessly communicates with a backbone network via an access point, the method comprising: receiving transmissions from both the access point and the second client device; generating a first plurality of characteristics that are based on the transmissions received from both the access point and the second client device; transmitting the first plurality of characteristics to the access point; receiving a transmission from the access point that contains a selected power level for transmissions by the first client device, wherein the selected power level is generated based on an assessment by the access point of the first plurality of characteristics and a second plurality of characteristics received from the second client device relating to transmissions received by the second client device from both the access point and the first client device; and transmitting at the selected power level. 9. The method of claim 8, wherein the transmissions evaluated by the first client device comprise at least a portion of an ongoing data exchange. 10. The method of claim 8, wherein the transmissions evaluated by the first client device comprise at least one test signal exchange. 11. The method of claim 8, wherein the first plurality of characteristics include mobility characteristics. 12. The method of claim 8, wherein the first plurality of characteristics include utilization characteristics. 13. The method of claim 8, wherein the first plurality of characteristics include status characteristics. 14. The method of claim 8, wherein the step of receiving a transmission from the access point further includes receiving a first protocol parameter for transmissions received from the access point transceiver circuitry. 15. A method for use in an access point that wirelessly couples a first client device and a second client device to a backbone network, the method comprising: receiving a first plurality of characteristics from the first client device relating to transmissions received by the first client device from the access point, wherein the transmissions evaluated by the first client device comprise at least a portion of an ongoing data exchange between the access point and the first client device; receiving a second plurality of characteristics from the second client device relating to transmissions received by the second client device from the access point, wherein the transmissions evaluated by the second client device comprise at least a portion of an ongoing data exchange between the access point and the second client device; and assessing both the first plurality of characteristics and the second plurality of characteristics and, based on the assessment, and, based on the assessing: selecting a first of a plurality of customized power levels for transmissions by the access point to the first client device and a second of a plurality of customized power levels for transmissions by the access point to the second client device; selecting a first protocol parameter for transmissions by the access point transceiver circuitry to the first client device; and selecting a second protocol parameter for transmissions by the access point transceiver circuitry to the second client device. 16. The method of claim 15, wherein the first plurality of characteristics include mobility characteristics. 17. The method of claim 15, wherein the first plurality of characteristics include utilization characteristics. 18. The method of claim 15, wherein the first plurality of characteristics include status characteristics.

2012-04-02

en

2012-07-26

US-35286103-A

Communication control apparatus, terminal apparatus, communication control method, and communication system ABSTRACT A communication priority is set for each information providing site connected to the Internet. A database in which the degrees of communication priority for the individual sites are organized in table form is provided in a network. When an user makes a request for connection to any site, the database is searched for the communication priority for the site. Then, according to the retrieved degree of connection site, the connection state of the communication channel between the user and the information providing site is controlled. CROSS-REFERENCE TO RELATED APPLICATIONS [0001] This application is based upon and claims the benefit of priority from the prior Japanese Patent Application No. 2002-080065, filed Mar. 22, 2002, the entire contents of which are incorporated herein by reference. BACKGROUND OF THE INVENTION [0002] 1. Field of the Invention [0003] This invention relates to a communication control apparatus and a terminal apparatus connectable to an information providing site connected to the Internet and communication control method of the communication control apparatus. The Internet provides information when a request is made for search, browsing, or the like. A communication system related to the present invention provides a communication channel that enables access to the Internet by wireless or by wire, when the user makes a request for communication. [0004] 2. Description of the Related Art [0005] Nowadays, the number of users accessing the Internet from their offices or homes by use of personal computers is steadily increasing. The number of users accessing the Internet by use of a mobile phone or a PDA (Personal Digital Assistant) while moving from one place to another is also steadily increasing. Users access the Internet by use of information processing terminals, such as personal computers, mobile phones, or PDAs. Almost all the information processing terminals are used to carry out information processes, including information retrieval and mail reception. [0006] Presently, nearly ten million personal computers are sold a year even in Japan alone and more than half of the Japanese people have mobile phones. The Internet is being used as a means of providing various kinds of information in both quality and quantity. More and more home pages (sites) serving as information providing windows are being set up. Recently, there have appeared carriers that provide voice service (that is, telephone service) via the Internet. [0007] Normally, the Internet should be used as a means of offering information impartially. However, since a large number of users are using the Internet as a matter of course, the quality of information offered through the Internet is becoming important. [0008] The most tangible problem is a rapid increase in the number of “R-rated sites.” In the Internet, since information can be offered at private level (that is, in terms of taste and interest), it is very easy to set up an “R-rated site.” [0009] On the other hand, there are information offered to a large number of the general public free of charge by companies or the like and information offered to specific users with charge. In addition, there is information of great importance, urgency, and publicity, such as information offered to a large number of the general public by the government or a public organization. Such information is offered to users by an individual, a company, or the government via the Internet serving as a common base. Like the telephone service, services featuring the assurance of specific communication quality have started to be available. [0010] Currently, the kinds and amount of information offered are increasing and the quality of information is diversifying. As a result, the basic concept that the Internet is an impartial information providing place and an uncontrolled information place has begun to change. [0011] In the prior art, the order of priority of communication is not particularly set for each information providing site. Information sites unsuitable for browsing have only put up a warning notice by themselves or prevented the browsing by the filtering function based on connect destination IP addresses. Thus, an approach of controlling the communication on the basis of communication quality has not been provided. The reason for this is that access point operators and carriers cannot limit the users' requests for communication by themselves and prevent the users from finding private amusement. [0012] With the spread of the Internet, more and more information providing sites are becoming more versatile, important, public, and urgent in an ordinary and an objective sense. The number of those sites, however, is much smaller than the number of entertainment sites. Therefore, traffic to the users connecting to entertainment sites sometimes suppresses traffic to the users connecting to sites providing important information. [0013] With the instrumentation of ADSLs (Asymmetric Digital Subscriber Lines) realizing high-speed data communication, it is easily conceivable that the information provided by entertainment sites will become gigantic accordingly (for example, still-picture data will change to moving-picture data). Thus, it is urgent to realize the technique for controlling traffic according to the quality of the information provided. [0014] As described above, because the basic concept of the Internet, an impartial information providing place and an uncontrolled information providing place, is maintained, this tends to cause a delay in coping with the realities of the diversity of information, the increasing volume of information, and the diversity of quality. In the prior art, the priority of communication has not been particularly set for each information providing site and communication control, such as control of communication quality, has not been realized. This has caused the disadvantage that traffic to users accessing entertainment sites degrades the quality of communication for sites of great versatility, importance, publicity, or urgency to offer information to users. [0015] With the construction of a high-speed communication infrastructure, it is expected that the amount of information entertainment sites provide will become more enormous. Therefore, the realization of a suitable traffic control technique is a pressing need. BRIEF SUMMARY OF THE INVENTION [0016] The object of the present invention is to provide a communication control apparatus, a terminal apparatus, communication control method and communication system capable of securing communication quality suitably to enable sites providing information given priority to offer information to users in the Internet starting to be disordered. [0017] The foregoing object is accomplished by providing a communication control apparatus comprising: a priority database which stores a plurality of priorities corresponding to the sites, respectively; and control means for controlling communications between the sites and the terminal apparatuses on the basis of the priorities stored in the priority database. [0018] With this configuration, a communication is established between the terminal apparatus the user has and a site according the state corresponding to the priority of the site. Therefore, setting high the degrees of communication priority for sites that provide information of great urgency, importance, or publicity enables the sites to provide traffic of suitable quality, which makes it possible to offer reliable information to the user quickly. BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING [0019]FIG. 1 is a diagram to help explain an embodiment of the present invention, particularly the concept of the invention; [0020]FIG. 2 is a diagram to help explain an embodiment of the present invention, particularly the concept of communication procedure; [0021]FIG. 3 is a diagram to help explain FIGS. 1 and 2 in detail; [0022]FIG. 4 is a diagram to help explain a place where a priority database is installed in an embodiment of the present invention; [0023]FIG. 5 is a diagram to help explain another place where the priority database is installed in the embodiment; [0024]FIG. 6 is a diagram to help explain another place where the priority database is installed in the embodiment; [0025]FIG. 7 is a diagram to help explain another place where the priority database is installed in the embodiment; [0026]FIG. 8 shows an embodiment of information managed using a priority database according to the present invention; [0027]FIG. 9 is a flowchart for the communication procedure using a wireless channel in communication control method according to the present invention; [0028]FIG. 10 is a flowchart for an example of the process of updating the priority database according to an embodiment of the present invention; [0029]FIG. 11 is a flowchart for an example of the process of updating the priority database in communication control method according to the present invention; [0030]FIGS. 12A and 12B show examples of the contents of a priority database according to an embodiment of the present invention; [0031]FIG. 13 is a flowchart showing an embodiment of the procedure for informing the user of the communication priority of the site; [0032]FIG. 14 is a schematic diagram showing an embodiment of an approach of informing the user of the communication priority according to the present invention; [0033]FIG. 15 is a flowchart showing an example of the processing procedure when a plurality of users make a connection request; [0034]FIG. 16 is a flowchart showing another example of the processing procedure when a plurality of users make a connection request; and [0035]FIG. 17 is a flowchart showing still another example of the processing procedure when a plurality of users make a connection request. DETAILED DESCRIPTION OF THE INVENTION [0036] Hereinafter, referring to the accompanying drawings, an embodiment of the present invention will be explained. [0037]FIG. 1 is a diagram to help explain an embodiment of the present invention, particularly the concept of the invention. FIG. 1 shows the way an user terminal 11 connects to an information providing site (hereinafter, referred to as a site) 14 via a communication control apparatus 12 and the Internet 13. As everyone knows, the Internet 13 provides an information communication environment, using TCP/IP. The user terminal 11 is connected to the communication control apparatus 12 via a wireless or wire communication channel 101. The communication channel 101 may be prepared by an user himself or herself who has the user terminal 11 or provided by a carrier that manages and operates the communication control apparatus 12. [0038] The user terminal 11 sends a request for communication to the site 12 via the communication channel 101. Then, a communication channel control section 122 in the communication control apparatus 12 refers to a priority database 121 for a communication priority of the site 14, a connect destination. The communication channel control section 122 controls communication between the user terminal 11 and the site 14 according to the priority recorded in the priority database 121. [0039] Such a configuration and a series of processes realize communication priority control between the user terminal 11 and the site 14. That is, it is possible to perform communication control in which a communication priority is given to each of the sites to which users request to be connected. This enables sites of great urgency, importance, and publicity whose communication priority should be set high to provide the users with information of suitable quality reliably. [0040]FIG. 2 is a diagram to help explain the communication procedure in communication control method in the present invention. First, the user terminal 21 makes a request to the communication control apparatus 22 for communication to the site 24 (step 211). Then, the communication control apparatus 22 searches for the communication priority of the connect destination (step 212) and, on the basis of the result of the search, connects the channel to the site 24 (step 213). Then, the communication control apparatus 22 prepares the setting of a communication channel for the user terminal 21 (step 214) and informs the user terminal 21 of the setting of the communication channel (step 215). After the above procedure, the user terminal 21 starts to access the site 24 (step 216). The communication with the controlled channel is maintained until the delivery of the information to the user terminal 21 has been completed. [0041] By the series of processes, communication can be made to the sites connected to the Internet which are capable of providing information in information retrieval or browsing, according to the communication priority of each site to which the user wants to connect. Therefore, for example, an site of great urgency, importance, and publicity whose communication priority should be set high can provide information of suitable quality reliably. [0042]FIG. 3 is a diagram to help explain the details of FIGS. 1 and 2 in the communication system of the invention. [0043] A first user terminal 31 is an user terminal connected to a wire communication channel. The first user terminal 31 makes a request 311 to a control center 33 in the communication system via an access point 32 for communication to an site 39 with a URL (Uniform Resource Locater), such as “http://www.kinkyu.go.jp.”. The control center 33 makes a collate request 312 to a collate center 34 for search of the priority of the destination to which the first user 32 wants to connect. In the collate center 34, a degree-of-priority database 35 has been constructed. Receiving the collate request 312, the collate center 34 makes a search request 313 to the priority database 35. [0044] In the degree-of-priority database 35, the priority of the site 39 to which the first user terminal 31 wants to connect has been registered. The degree-of-priority database 35 returns the result of the search 314 to the collate center 34. The collate center 34 informs the control center 33 of the retrieved priority 315. Here, it is assumed that the priority of the site 39 is the third degree. The control center 33 controls the communication channel between the first user terminal 31 and the connect destination site 39 according to the notified priority 315 and establishes communication 316. [0045] A second user terminal 36 is an user terminal connected to a wireless communication channel. The second user terminal 36 makes a request 321 to the control center 33 in the communication system via an access point 37 for communication to an site 38 with a URL, such as “http://www.game.com.”. The control center 33 makes a collate request 322 to the collate center 34 for search of the priority of the destination to which the second user terminal 36 wants to connect. Receiving the collate request 322, the collate center 34 makes a search request 323 to the priority database 35. [0046] In the degree-of-priority database 35, the priority of the site 38 to which the second user 32 wants to connect has been registered. The degree-of-priority database 35 returns the result of the search 324 to the collate center 34. The collate center 34 informs the control center 33 of the retrieved priority 325. Here, it is assumed that the priority of the site 38 is the hundredth degree. The control center 33 controls the communication channel between the second user terminal 36 and the connect destination site 38 according to the notified priority 325 and establishes communication 326. [0047] The priority of communication 326 is lower than the priority of communication 316 already set between the first user terminal 31 and the site 39. Therefore, communication 326 may not be set, depending on the condition of communication on the Internet. [0048] By carrying out the series of processes for each user, communication can be made to the sites connected to the Internet which are capable of providing information in information retrieval or browsing, according to the communication priority of each site to which the user wants to connect. Therefore, for example, an site of great urgency, importance, and publicity whose communication priority should be set high can provide information of suitable quality reliably, giving priority to the relevant user over other users connected to the site. [0049] In the embodiment, the communication priority of each connect destination site shown in FIGS. 1 and 3 are managed by use of the degree-of-priority databases 121 and 35. This enables network operators, carriers, or users themselves to manage the databases intensively and easily. [0050]FIG. 4 shows an embodiment to help explain a place where a priority database is installed in a communication system according to the present invention. FIG. 4 shows the way an user terminal 41 connects to an site 44 by way of an access point 423 in a communication control apparatus 42 and the Internet 43. [0051] The priority database 45 is connected to a communication channel control section 422. The communication channel control section 422 is provided closer to the Internet than to the access point 423 in the communication control apparatus 42. When the user terminal 41 makes a request for communication to the site 44, the priority database 45 is referred to for the communication priority of the site 44. The communication channel control section 422 controls the communication channel according to the priority recorded in the priority database 45. [0052] As described above, providing the function of managing the priority by use of the database (DB) in the network enables the network operator or carrier to manage the database (DB) collectively. This has the merit of preventing irresponsible users from carrying out processes or making registrations illegally. [0053]FIG. 5 shows another embodiment related to an installation location for a priority database in the communication system according to the invention. FIG. 5 shows the way an user terminal 51 connects to an site 54 by way of an access point 523 in a communication control apparatus 52 and the Internet 53. [0054] When the user terminal 51 makes a request for communication to the site 54, a communication control section 522 in the communication control apparatus 52 refers to a priority database 55 connected to the Internet 53 for the communication priority of the connect destination site 54. Then, the communication channel control section 522 controls the communication channel according to the priority recorded in the priority database 55. [0055] As described above, providing the database (DB) for managing the priority on the network side enables the network operator or carrier to manage the database collectively. This has the merit of preventing malicious users from carrying out processes or making registrations illegally. Furthermore, the connect destination database may be shared by a plurality of carriers. [0056]FIG. 6 shows another embodiment related to an installation location for a priority database in the communication system according to the invention. FIG. 6 shows the way an user terminal 61 connects to an site 64 by way of an access point 623 in a communication control apparatus 62 and the Internet 63. [0057] In FIG. 6, a priority database 65 is provided in the user terminal 61 and is managed by the user. Before sending a request for communication to the site 64 to the communication control apparatus 62, the user terminal 61 accesses the priority database 65 and refers to the database 65 for the communication priority of the site 64. The priority database 65 retrieves the communication priority of the site 64 and returns the result of the retrieval to the user terminal 61. The user terminal 61 specifies the returned communication priority and makes a connection request to a communication channel control section 622 in the communication system via an access point 623 in the communication control apparatus 62. The communication channel control section 622 controls the communication channel with the site 64 according to the communication priority. [0058] As described above, providing the database on the user side enables the management burden on the network operator or carrier to be decreased. Furthermore, part of the work of updating the database can be shared by the user. It is desirable that information about the communication priority should be stored in the range that allows the user to manage the database privately. [0059]FIG. 7 shows another embodiment related to an installation location for a priority database in the communication system according to the invention. FIG. 7 shows a state where a priority database is provided on each of the network side and the user side. Particularly in the user terminal 61, the degree-of-priority database 65 is stored in a storage section 61 c, such as a semiconductor memory. [0060] With this configuration, the priority of communication to important sites of great publicity and urgency or sites of ordinary companies should be managed by use of the degree-of-priority database 55 on the network side. On the other hand, the priority of communication to personal sites or vulgar sites should be managed by use of the degree-of-priority database 65 on the user side. The degree-of-priority database 55 should be updated by the network operator or carrier. The degree-of-priority database 65 should be updated by the user terminal 61. [0061] The process of matching the contents of the degree-of-priority database 55 with the contents of the degree-of-priority database 65 may be carried out in, for example, software. When such a process is not carried out, the contents of the degree-of-priority database 55 should be allowed to take priority over the contents of the degree-of-priority database 65. [0062]FIG. 7 shows the configuration of a user terminal 61 for establishing a wireless channel 601 between an access point 623 and the user terminal 61. The user terminal 61 includes an input/output section 61 a, a wireless interface section 61 b, the storage section 61 c, and a control section 61 d. [0063] The input/output section 61 a includes a display and a keypad (which are not shown). The wireless interface section 61 b, which includes an antenna 67, establishes a wireless channel 601 with the access point 623. A system based on the wireless LAN standard for, for example, IEEE802. 11b or the same series is applied to the interface for the wireless section. The storage section 61 c stores the priority database 65. The control section 61 d includes a wireless communication processing section 66. The wireless communication processing section 66 does calculations for establishing the wireless channel 601 by, for example, carrying out a software process. [0064]FIG. 8 shows an embodiment of information managed by use of a priority database according to the present invention. In this embodiment, sites are divided into four categories differing in priority (73 to 76). The URLs for the sites are registered in each of the categories 73 to 76 of the priority database 71. [0065] Public sites of great publicity or urgency, such as “http://www.---.go.jp”, are registered in the category 73 with the highest priority. Sites for educational facilities, including university, or public corporations, such as “http://www.---.or.jp” or “http:www.---.ac.jp”, are registered in the category 74 with the second highest priority. [0066] Sites for ordinary corporations, such as “http://www.---.co.jp” or “http:www.---.com”, are registered in the category 75 with the third highest priority. Sites for individuals, such as “http:www.---.ne.jp”, are registered in the category 76 with the lowest priority. [0067] Furthermore, in the embodiment, a priority is determined for a URL in each of the categories 73 to 76. For example, the priority of “http://www.juyo.go.jp” is higher than “http://www.kokyo.go.jp”. As described above, when the degrees of communication priority are managed over two steps, a site providing information of greater importance or urgency has a higher priority. Since the priority of a site that provides important, urgent, public information is set high for a large number of the general public, users can receive information without stress if an emergency arises. [0068]FIG. 8 show the way an URL, one of the attributes of a site, is registered in the priority database 71. Instead of this, the Internet protocol (IP) address for the site may be registered in the priority database 71. Registering URLs or IP addresses in this way makes it easy to match the attribute of a connect destination with the priority of the destination when a Web browser sends a request for communication to the site. [0069]FIG. 9 is a flowchart for the communication procedure using a wireless channel in communication control method according to the present invention. FIG. 9 particularly shows an example of the procedure when the destination to which the user wants to connect has not been registered in a degree-of-priority database. [0070] When an user terminal 81 makes a request for communication to a site 86 (step 811), a connection request message 831 passes through an access point 82 and reaches a control center 83. Receiving the connection request message 831, the control center 83 makes an inquiry request 812 to a collate center 84. Receiving the inquiry request message 832 from the control center 83, the collate center 84 starts to search process in the priority database. [0071] If degree-of-priority information on the site 86 has been registered in the priority database, the priority based on the contents of the registration is the result 814 of the search (step 814). If degree-of-priority information on the site 86 has not been registered in the priority database, a previously defined reference value is set as the result 815 of the search (step 815). The collate center 84 informs the control center 83 of the result of the inquiry (step 816). [0072] Receiving the collation report message 833 from the collate center 84, the control center 83 sets the communication priority (step 817). The control center 83 starts to set the communication between the user terminal 81 and the site 86 according to the setting (step 818). [0073] The control center 83 may serve as if it were a proxy server. In this case, the control center 83 not only carries out a routing process by way of the Internet 85 to the site 86 (834) but also sends a connection setting notice 835 to the access point 82. [0074] The access point 82, receiving the connection setting notice 835, sets a wireless channel for the user terminal 81 (step 819) and sends a wireless channel setting message 836 to the user terminal 81. Receiving this message, the user terminal 81 carries out a channel connection process (step 821). At this time, the site 86 prepares for connection (step 820) and then carries out a connection process (step 822). By the above procedure, communication based on the communication priority can be made between the user terminal 81 and the site 86. [0075] Even if the user wants to connect to a site not registered in the priority database, it is possible to prevent the connection process from being delayed, since a reference value is set for the priority of communication to the site. Taking advantage of the opportunity to connect such an unregistered site, the priority of the unregistered connect destination may be registered in the database automatically or manually. [0076]FIG. 10 is a flowchart for the process of updating the priority database in communication control method according to the present invention. FIG. 10 particularly shows the procedure for updating the priority database automatically and regularly. [0077] When the updating process is started (step 901), a timer is started (step 902). The value of the timer is monitored and the arrival of the update time is determined (step 903). When the update time of the priority database has been reached, the presence or absence of a newly opened or updated site is checked (step 904). If the presence of a site whose registration needs updating is confirmed, the priority database is updated (step 905). [0078] In the above procedure, an unquestionable site with such a URL as “***.go.jp” (corresponding to a governmental site) or “***.gov” (corresponding to a nonprofit institution (or corporation)) is sensed automatically. Then, the registration of the site is updated. [0079] After step 905, it is determined whether the update process is continued (step 906). If the update process is continued, the processing procedure returns to step 902, where the timer is started again. [0080] By such the processing procedure, the database (DB) that manages the communication priority is updated regularly, with the result that the communication priority of the site newly opened or updated is updated timely. This prevents information from being offered with an unsuitable priority or unsuitable quality. [0081]FIG. 11 is a flowchart for the process of updating the priority database in communication control method according to the present invention. FIG. 11 particularly shows the procedure for carrying out the update process by using the updating or a new registration of a high priority site as a trigger. [0082] When the update process is started (step 1001), it is determined whether a high degree-of-priority site has made a request for updating the priority database (step 1002). If a high degree-of-priority site has made such an update request, the priority database is updated automatically (step 1003). [0083] If a high degree-of-priority site has not made such an update request, it is determined whether a high degree-of-priority site has made a new request for registering in the priority database (step 1004). As a result, if a high degree-of-priority site has made such a new request, the priority database is updated automatically (step 1003). [0084] If a high degree-of-priority site has not made such a new request, it is determined after step 1003 whether to carry out the update process continuously (step 1005). Then, the wait state lasts until an update request or a new registration request is made. [0085] By the above procedure, when a site that provides information of great importance, urgency, or publicity is opened or updated, the priority for the site is newly registered or updated. This process is carried out automatically. This prevents the work of registering in the priority database from becoming complicated, which improves the user's convenience. [0086] In the processes of FIGS. 10 and 11, the update process is carried out automatically and regularly. Instead of this, the priority database may be updated only when the user makes a request for updating the priority. [0087]FIGS. 12A and 12B show examples of the contents of a priority database according to the present invention. FIGS. 12A and 12B differ from FIG. 8 in that the contents of uncategorized database are shown. [0088] In FIGS. 12A and 12B, sites are registered in the contents 1102 of a priority database 1101 in descending order of the degree of communication priority. Each site has the priority ranging from S rank to E rank. In FIGS. 12A and 12B, a URL expressed using a wild card is registered with a low priority. For example, “http://*.com” and “http://*.ne.jp” are categorized as D rank and “http://*.*” is categorized as E rank. Expressing URL by a wild card enables a plurality of sites to be managed simultaneously. A URL expressed using a wild card means that the connect destination is particularly not limited. That is, it is possible to manage even a site whose connect destination is particularly not limited. [0089] In a table shown in FIG. 12A, a transmission speed (or band) is caused to correspond to each rank of priority. Reference numeral 1103 in the figure shows a transmission speed for each rank. Assuring the transmission speed for each rank of priority for sites makes it possible to make constant the speed at which information is obtained from the sites, which realizes a smooth acquisition of information. Allocating a high-speed transmission speed to a high-rank site enables the user to receive important information quickly without stress. [0090] In a table shown in FIG. 12B, QoS (Quality of Service) is caused to correspond to each rank of priority. Reference numeral 1104 in the figure shows QoS for each rank. Assuring QoS for each priority for sites makes it possible to maintain constant the quality of information acquired from the sites. Allocating a high QoS to a high-rank site enables a stable channel with a short delay and a small jitter characteristic to be used in browsing important information, which realizes the offering of information with a high communication quality. A low-rank site offers information inferior in quality with large variations. [0091]FIG. 13 is a flowchart to help explain an embodiment of the procedure for informing the user of the priority of a site according to the present invention. An user terminal 1201 makes a request 1210 to a communication control apparatus 1202 for communication to a site 1204, by way of the Internet 1203. The communication control apparatus 1202 searches for the communication priority of the site 1203 (step 1211). Then, the communication control apparatus 1202 connects a channel to the site 1204 with the priority according to the result of the search (step 1212) and notifies the communication priority to the user terminal 1201 (step 1213). The user terminal 1201 informs the user of the notice in an auditory or visual manner (step 1217). [0092] The communication control apparatus 1202 prepares for the setting of a communication channel for the user terminal 1201 (step 1214) and then informs the user terminal 1201 of the setting of the communication channel (1215). [0093] By the above processes, the user terminal 1201 can access the site 1204 by using the channel subjected to communication control (step 1216). This channel is maintained until the offering of information is completed. Informing the user of the communication priority enables the user to recognize what status communication has been set. [0094]FIG. 14 is a schematic diagram of an embodiment of a method of informing the user of the degree of communication priority. Reference numeral 1301 indicates a portable terminal the user has. In this embodiment, the priority 1303 of communication to a site is caused to appear on a display 1302 of the portable terminal 1301. This enables the user who has sent a connection request to recognize what status communication has been set. [0095]FIG. 15 is a flowchart for the processing procedure when a plurality of users make a connection request. It is assumed that the communication priority of a second user terminal 1402 is higher than that of a first user terminal 1401. [0096]FIG. 15 shows a state where the first user terminal 1401 and the second user terminal 1402 are under the control of the same access point 1403. Alternatively, the individual user terminals 1401, 1402 may pass through different access points. Although FIG. 15 shows a state where both of the user terminals 1401, 1402 are connected to the same site 1407, the same procedure holds true even when the individual user terminals 1401, 1402 are connected to different access points. [0097] It is assumed that the first user terminal 1401 has already communicated with the site 1407 according to the communication procedure shown in FIG. 9. In this state, when the second user terminal 1402 makes a request for communication to the site 1407 (step 1412), a connection request message 1413 passes through the access point 1403 and reaches the control center 1404. [0098] Receiving the connection request message 1413, the control center 1404 requests a collate center 1405 to inquire a priority (step 1414). The collate center 1405 receives a collate request message 1415 from the control center 1404. Then, the collate center 1405 searches the priority database 1416 for the communication priority of the site to which the second user terminal 1402 wants to connect (step 1417). After finishing the search, the collate center 1405 informs the control center 1404 of the result of the inquiry (step 1418). [0099] The control center 1404 receives an inquiry report message 1419 from the collate center 1405 and determines whether the priority of communication to the site to which the second user terminal 1402 wants to connect can be realized (step 1420). [0100] The communication priority of the second user terminal 1402 is higher than that of the first user terminal 1401. Therefore, if the communication priority were applied to the second user terminal 1402, the communication priority of the first user terminal 1401 who has already been communicating could not be fulfilled. To avoid this problem, the priority of the second user terminal 1402 is set first (step 1421) and then the priority of the first user terminal 1401 is set again (step 1422). After the priority for each user terminal set again, the communication of the first user terminal 1401 is set again (step 1423) and then the communication of the second user terminal 1402 is set (step 1424). [0101] The control center 1404 may be a proxy server. In this case, the control center 1404 not only carries out the process of taking its route to the site 1407 by way of the Internet 1406 (steps 1425, 1426) but also sends a connection resetting notice 1427 and a connection setting notice 1428 to the access point 1403. [0102] Receiving both of the notices 1427, 1428, the access point 1403 sets wireless channels for the first user terminal 1401 and second user terminal 1402 (step 1429). Then, the access point 1403 sends wireless channel setting messages 1430 and 1431 to the first user terminal 1401 and second user terminal 1402, respectively. [0103] The first user terminal 1401 receives the wireless channel setting message 1430 and carries out an update process related to resetting (step 1432). The second user terminal 1402 receives the wireless channel setting message 1431 and carries out a connection process (step 1433). The resetting of the wireless channel may not be needed when the priority of communication to the first user terminal 1401 is reset. In such a case, the wireless channel setting message 1430 is unnecessary. [0104] The site 1407 prepares for (updated/new) connection with the first user terminal 1401 and second user terminal 1402 (step 1434) and carries out a connection/update process (step 1435). [0105] By such processes, the communication of the first user terminal 1401 to the site 1407 is updated and the second user terminal 1402 is newly connected to the site 1407. A communication channel with the same communication priority as the allocated one is set for the second user terminal 1402. A communication cannel with a little lower communication priority than the allocated one is set for the first user terminal 1401. [0106] That is, when degrees of communication priority for a plurality of users concur, the communication channel for an user with a low priority is reset with a lower priority, which enables a plurality of users to connect to the sites. By doing this, the second user terminal 1402's request to receive information from a connect destination with a high communication priority can be satisfied. Although the first user terminal 1401 undergoes a little drop in the priority, the disconnection of the channel can be avoided. [0107]FIG. 16 is a flowchart for another processing procedure when a plurality of users make a connection request. In contrast with FIG. 15, it is assumed that the communication priority of the first user terminal 1401 is higher than that of the second user terminal 1402. In FIG. 16, the same procedures and messages as those in FIG. 15 are indicated by the same reference numerals and only the parts differing from those in FIG. 15 will be explained. [0108] In FIG. 16, the first user terminal 1401 has already been communicating. In this state, after the second user terminal 1402 makes a request for communication to the site 1407 (step 1412), an inquiry report message 1419 is given to the control center 1404 (step 1418). The control center 1404 determines whether the communication priority of the second user terminal 1402 can be set for the site 1407 (step 1420). [0109] The communication priority of the first user terminal 1401 is higher than that of the second user terminal 1402. Therefore, the communication priority of the first user terminal 1401 is maintained (step 1601) and the priority of the second user terminal 1402 is set (step 1421). The communication of the first user terminal 1401 is maintained, with the communication priority remaining unchanged (step 1602). The communication of the second user terminal 1402 is set according to the set communication priority (step 1424). [0110] The control center 1404 gives a connection maintaining notice 1603 and a connection setting notice 1428 to the access point 1403. [0111] Receiving the connection maintaining notice 1603 and connection setting notice 1428, the access point 1403 sets a wireless channel for the second user terminal 1402, while maintaining the wireless channel with the first user terminal 1401 (step 1429). The access point 1403 gives a wireless channel setting message 1431 to the second user terminal 1402 (step 1429). [0112] Receiving the wireless channel setting message 1431, the second user terminal 1402 connects a channel (step 1433). The site 1407 prepares for communication with the second user terminal 1402 (step 1604) and connect a channel (step 1605). [0113] By such processes, the second user terminal 1402 is newly connected to the site 1407, with the communication of the first user to the site 1407 maintained. The communication priority of the first user terminal 1401 is maintained at the same degree before the second user terminal 1402 is connected to the site 1407. This enables a connection request made by the second user terminal 1402 to be compatible with the communication of the first user terminal 1401 without the request being rejected. [0114]FIG. 17 is a flowchart for another processing procedure when a plurality of users make a connection request. In FIG. 17, the same procedures and messages as those in FIGS. 15 and 16 are indicated by the same reference numerals and only the parts differing from those in FIGS. 15 and 16 will be explained. [0115] In the procedure of FIG. 17, the communication of the user who has already been communicating is given priority, regardless of whether the communication priority of the first user terminal 1401 is higher than that of the first user terminal 1402 or vice versa. That is, when a plurality of users make a connection request, a connection request made later by an user is rejected. A case where the second user terminal 1402 makes a connection request in a state where the first user terminal 1401 has already been communicating will be explained. [0116] In step 1420 of FIG. 17, it is determined that the communication priority of the second user terminal 1402 is not set. According to the determination, the control center 1404 rejects the connect request made by the second user terminal 1402 (step 1701). In this step, the control center 1404 sends a connection refuse notice 1702 to the second user terminal 1402. As a result of this, the communication priority of the first user terminal 1401 that has already been communicating is maintained. [0117] The second user terminal 1402, receiving the connection refuse notice 1702, may make tries until communication is established (step 1703) or give up communication. When the communication priority of the second user terminal 1402 is high, it is determined in step 1420 that the communication of the second user terminal 1402 is possible and the same processing procedure as in FIG. 15 or 16 is carried out. [0118] By such processes, when the second user terminal 1402 (with a low degree of communication priority) makes a connection request in a state where the first user terminal 1401 (with a high degree of communication priority) is receiving information from the site 1407, a connection request made by the second user terminal 1402 is rejected. This prevents the communication state of the first user terminal 1401 from being suppressed, which prevents the quality of service to the first user terminal 1401 from deteriorating or becoming unstable. [0119] The present invention is not limited to the above embodiments. For instance, the way of categorizing sites as shown in FIG. 8 is one example and they are not necessarily categorized. Furthermore, while in FIGS. 9, 15, and 16, the user has used a wireless channel, a similar processing procedure may be applied to a case where a wire channel is used. [0120] Additional advantages and modifications will readily occur to those skilled in the art. Therefore, the invention in its broader aspects is not limited to the specific details and representative embodiments shown and described herein. Accordingly, various modifications may be made without departing from the spirit or scope of the general inventive concept as defined by the appended claims and their equivalents. What is claimed is: 1. A communication control apparatus provided between a communication network and a plurality of terminal apparatuses which access a plurality of sites connected to the communication network by sharing communication resources of the communication network, the communication control apparatus comprising: a priority database which stores a plurality of priorities corresponding to the sites, respectively; and control means for controlling communications between the sites and the terminal apparatuses on the basis of the priorities stored in the priority database. 2. The communication control apparatus according to claim 1, further comprising: an access point which provides the terminal apparatuses with a physical communication channel for communicating with the communication network, wherein the priority database is provided closer to the communication network than the access point. 3. The communication control apparatus according to claim 2, wherein the communication channel is a wireless channel. 4. The communication control apparatus according to claim 2, wherein the communication channel is a wire channel. 5. The communication control apparatus according to claim 1, wherein the priority database is provided in the terminal apparatuses. 6. The communication control apparatus according to claim 1, wherein the control means controls the transmission speed of the communications on the basis of the priority stored in the priority database. 7. The communication control apparatus according to claim 1, wherein the control means controls the QoS (Quality of Service) of the communications on the basis of the priority stored in the priority database. 8. The communication control apparatus according to claim 1, wherein the communication network provides an information communication environment using TCP/IP (transmission control protocol/internet protocol). 9. The communication control apparatus according to claim 1, wherein the priority are stored by the URL (Uniform Resource Locater) in the priority database. 10. The communication control apparatus according to claim 1, wherein the priority are stored by category in the priority database, the categories differing in the priority. 11. A terminal apparatus which access a plurality of sites connected to the communication network by sharing communication resources of the communication network, the terminal apparatus comprising: a priority database which stores a plurality of priorities corresponding to the sites, respectively; and sending means for sending a request for the connections with the sites on the basis of the priorities stored in the priority database. 12. The terminal apparatus according to claim 11, further comprising wireless communication means for, when an access point is provided between the communication network and a plurality of the terminal apparatus with a physical communication channel for communicating, establishing a wireless channel with the access point. 13. A communication control method used in communications between a communication network and a plurality of terminal apparatuses which access a plurality of sites connected to the communication network by sharing communication resources of the communication network, the communication control method comprising: a first step of, when any one of the plurality of terminal apparatuses requests to access any one of the plurality of sites, referring to a priority database for a priority of the site, the priority database storing a plurality of priorities corresponding to the sites, respectively; and a second step of controlling the communications between the plurality of sites and the plurality of terminal apparatuses, on the basis of the priority referred in the first step. 14. The communication control method according to claim 13, wherein the second step is a step of controlling the transmission speed of the communications on the basis of the priority referred in the first step. 15. The communication control method according to claim 13, wherein the second step is a step of controlling the QoS (Quality of Service) of the communications on the basis of the priority referred in the first step. 16. The communication control method according to claim 13, further comprising a third step of, when the terminal apparatus requests to access a site not stored in the priority database, setting a specified value as a priority for the site. 17. The communication control method according to claim 13, further comprising: a fourth step of monitoring the states of the plurality of sites; and a fifth step of updating the contents of the priority database according to the result of the monitoring in the fourth step. 18. The communication control method according to claim 13, further comprising a sixth step of informing the terminal apparatus which has requested the access of the priority referred in the first step. 19. The communication control method according to claim 13, further comprising: in a case where, when a second terminal apparatus requests to access a specific site, with a communication established between a first terminal apparatus and the specific site, the priority of the communication between the second terminal apparatus and the specific site is higher than the priority of the communication between the first terminal apparatus and the specific site, a seventh step of cutting off the communication between the first terminal apparatus and the specific site; an eighth step of setting a communication between the second terminal apparatus and the specific site with a priority higher than the priority of the communication between the first terminal apparatus and the specific site; and a ninth step of resetting a communication between the first terminal apparatus and the specific site with a priority lower than the priority between the second terminal apparatus and the specific site. 20. The communication control method according to claim 13, further comprising a tenth step of, when a second terminal apparatus requests to access a specific site, with a communication established between a first terminal apparatus and the specific site, rejecting the request. 21. A communication system comprising: a communication network; a plurality of sites connected to the communication network; a plurality of terminals which access the sites by sharing communication resources of the communication network; a priority database which stores a plurality of priorities set to the sites, respectively; and control means for controlling communications between the sites and the terminal apparatuses on the basis of the priorities stored in the priority database.

2003-01-29

en

2003-09-25

US-11621008-A

Portable personal computer and control method for the same ABSTRACT The invention relates to a portable personal computer that includes a first display, a second display, and an interconnection portion and a method for controlling the displays. The interconnection portion rotationally connects the first display to the second display. The portable personal computer generates corresponding sensor signals according to user-specific operation instructions, the first and second displays cooperatively display a joint image or separately display images according to the sensor signals and current display modes of the first and second displays. BACKGROUND 1. Field of the Invention The present invention generally relates to personal computers and control methods for the personal computers. 2. Description of Related Art Some portable computers, such as notebook and laptop computers, have small bodies to be conveniently carried and used anywhere. Other portable computers, such as personal digital assistants (PDAs) have rather smaller bodies that are even more convenient to move around. However, these smaller computers lack certain functions that can be accomplished by notebook and laptop computers. Ultra mobile personal computer (UMPC) typically have a 7-inch screen and a body smaller than notebook and laptop computers, while slightly larger than that of PDAs. On the other hand, hardware of the UMPC is similar to that of notebook and laptop computers. Therefore, the UMPC is capable of many functions found in notebook and laptop computers, while still maintaining the convenience and portability of PDAs. However, a typical UMPC has a rather large keyboard, which is one of its main disadvantages. SUMMARY In one embodiment, a portable personal computer is disclosed that includes a first display, a second display, and an interconnection portion. The interconnection portion rotationally connects the first display to the second display. The portable personal computer generates corresponding sensor signals according to user-specific operation instructions, the first and second displays cooperatively display a joint image or separate images according to the sensor signals and current display modes of the first and second displays. Other advantages and novel features of the portable personal computer and control method will become more apparent from the following detailed description of embodiments when taken in conjunction with the accompanying drawings, in which: BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is an isometric view of a portable personal computer in accordance with an exemplary embodiment, the portable personal computer including a first display and a second display; FIG. 2 is similar to FIG. 1, and shows an example of use; FIG. 3 is a flow diagram of a control method for the portable personal computer of FIG. 2; FIG. 4 is similar to FIG. 1, but viewed from another aspect and shows a second example of use; and FIG. 5 is a flow diagram of a control method for the portable personal computer of FIG. 4. DETAILED DESCRIPTION Referring to FIG. 1, a portable personal computer in accordance with an exemplary embodiment includes a first display 12, a second display 14, and an interconnection portion 16. The interconnection portion 16 rotationally connects the first display 12 and the second display 14. Therefore, the first display 12 can be folded with the second display 14 in order to save space. Referring to FIG. 2, the first and second displays 12, 14 are capable of generating separate displays. For example, the first display 12 can be used for displaying interfaces of operating systems and applications to users, while the second display 14 can be used for displaying a keyboard interface or providing a handwriting area for users to operate thereon. The second display 14 is capable of sensing operations and generating sensor signals accordingly. Therefore, the portable personal computer can be operated through the second display 14. In other embodiments, the first display 12 is capable of sensing user operations and generate the corresponding sensor signals accordingly, or the first and second displays 12, 14 are both capable of sensing operations and generating corresponding sensor signals. The displays capable of sensing user operations may have sensors therein for generating the sensor signals according to the received user operations. Referring to FIG. 3, a control method for controlling the portable personal computer of FIG. 2 in accordance with an exemplary embodiment includes the following steps: Step S302, the portable personal computer is powered on and the operating system is loaded, the first and second displays 12 and 14 display initial images, respectively. Step S304, the portable personal computer receives operation instructions from users, and generates corresponding sensor signals accordingly. The operations can be triggered by touching the first or second displays 12, 14, or pressing a particular key on the portable personal computer. Step S306, the portable personal computer determines whether the sensor signals are used for controlling the operation interface to be displayed or cleared. Step S308, if the sensor signals are not used for controlling the operation interface to be displayed or cleared, but used for other applications, the corresponding applications are operated. Step S310, if the sensor signals are used for controlling the operation interface to be displayed or cleared, a current display mode of the first or second displays 12, 14 are detected. Step S312, if the operation interface is currently displayed on the first or second displays 12, 14, the sensor signals trigger the displays to clear the operation interface from the first or second display 12 or 14. Step S314, if there is no operation interface displayed on the first or second display 12 or 14, the first or second display 12 or 14 loads initial settings for displaying the operation interface and starting up sensors (not shown) for receiving the operation instructions. Step S316, the first or second display 12 or 14 displays the operation interface, and starts up the sensors according to the initial settings that have been loaded. Therefore, users can operate on the displayed operation interface, and the first or second display 12 or 14 can generate corresponding sensor signals according to the operation instructions. Referring to FIG. 4, the first and second displays 12 and 14 are capable of collaboratively displaying a single image. For example, when the portable computer displays a slideshow or video, the first and second displays 12, 14 can be used together as one display to cooperatively display a joint image. Therefore, a rather large visual area can be obtained. A control method for controlling the displays 12 and 14 of FIG. 4 includes the steps illustrated in FIG. 5: Step S502, the portable personal computer is powered on and the operating system is loaded, the first and second displays 12 and 14 display initial images, respectively. Step S504, the portable personal computer receives operation instructions from users, and generates sensor signals accordingly. The operations can be triggered by touching the first or second display 12, 14, or by pressing a particular key on the portable personal computer. Step S506, the portable personal computer determines whether the sensor signals are used for controlling the displays 12 and 14 to cooperatively display a joint image or generate separate displays. Step S508, if the sensor signals are not used for controlling the displays 12 and 14 to display cooperatively, but used for other applications, the corresponding application is operated. Step S510, if the sensor signals are used for controlling the displays 12 and 14 to display cooperatively, current display modes of the first and second displays 12 and 14 are detected. Step S512, if the first and second displays 12 and 14 are displaying cooperatively, the portable personal computer generates a control signal according to the sensor signal to trigger the first and second displays 12 and 14 to display different images. Step S514, if the first and second displays 12 and 14 are displaying separately, the portable personal computer drives the displays 12 and 14 to display cooperatively. The embodiments were chosen and described in order to explain the principles of the invention and their practical application so as to enable others skilled in the art to utilize the invention and various embodiments and with various modifications as are suited to the particular use contemplated. Alternative embodiments will become apparent to those skilled in the art to which the present invention pertains without departing from its spirit and scope. Accordingly, the scope of the present invention is defined by the appended claims rather than the foregoing description and the exemplary embodiment described therein. 1. A portable personal computer comprising: a first display; a second display; an interconnection portion rotationally connects the first display to the second display; and wherein the portable personal computer is configured to generate sensor signals according to user-specific operation instructions, the first and second displays capable of cooperatively displaying a joint image or separate images according to the sensor signals and current display modes of the first and second displays. 2. The portable personal computer as describe in claim 1, wherein at least one of the first and second displays is capable of receiving the user-specific operation instructions, and generating corresponding sensor signals accordingly. 3. The portable personal computer as described in claim 2, wherein the sensor signals are generated according to the operations on the display which is capable of receiving the user-specific operation instructions. 4. The portable personal computer as described in claim 1, wherein the sensor signals are generated by triggering a particular key. 5. The portable personal computer as described in claim 1, further comprising a controller configured to drive the first and second displays to display separately according to the sensor signals, if the current display modes show that the first and second displays are displaying cooperatively. 6. The portable personal computer as described in claim 1, further comprising a controller configured to drive the first and second displays to display cooperatively according to the sensor signals, if the current display modes show that the first and second displays are displaying separately. 7. The portable personal computer as described in claim 6, wherein in the display mode that the first and second displays are displaying separately, an operation interface is displayed on one of the first and second displays. 8. A control method for controlling a portable personal computer comprising: providing a first display; providing a second display; receiving an operation instruction; generating a corresponding sensor signal according to the operation; detecting current display modes of the first and the second display; and shifting the display mode of the first and the second displays according to the sensor signal and the current display modes. 9. The control method as described in claim 8, wherein at least one of the first and second displays receives the operation instruction, and generates the sensor signal accordingly. 10. The control method as described in claim 9, wherein the sensor signal is generated according to the operation on the display that receives the operation instruction; wherein input is capable of being received by a user via the display. 11. The control method as described in claim 8, wherein the sensor signal is generated by triggering a particular key. 12. The control method as described in claim 11, wherein the first and second displays are driven to display separately upon the condition that the current display modes show that the first and second displays are displaying cooperatively. 13. The control method as described in claim 11, wherein the first and second displays are driven to display cooperatively upon the condition that the current display modes show that the first and second displays are displaying separately. 14. The control method as described in claim 13, wherein an operation area is displayed on at least one of the first and second displays according to the sensor signal.

2008-05-07

en

2009-09-17

US-201715481911-A

Compression bone screw ABSTRACT A compression bone screw and a method of use thereof including a shank having longitudinally opposing first and second shank portions. The first shank portion is externally threaded with a first shank thread. The compression bone screw also including a first element threadingly mounted on the first shank portion by way of a first element internal thread threadingly engaging the first shank thread. The first element is externally threaded with a first element external thread and a second element is integrally formed with and by an enlargement of the second shank portion. The second element is externally threaded with a second element external thread, and the second element external thread and the first element external thread are like-handed. TECHNICAL FIELD The present invention relates to the field of bone fixation in orthopaedic surgery and in particular relates to a compression bone screw. BACKGROUND OF THE INVENTION Compression bone screws are used in orthopaedic surgery for bone fixation, and in particular to fix two fragments of a fractured bone and for fixation of osteotomies and arthrodeses. Healing of fractured bones is greatly improved with the application of compression between the bone fragments. Various forms of compression bone screw have previously been proposed seeking to provide such compression between bone fragments. One form of known compression bone screw, known as the Herbert screw, utilises external leading and trailing threads on the screw for embedment within distal and proximal bone fragments. The leading and trailing external threads are like-handed, but are of unequal pitch, with a greater pitch on the leading thread. This advances the screw through the distal bone fragment at a greater rate than through the proximal bone fragment, thereby drawing the distal bone fragment towards the proximal bone fragment, providing a degree of compression between the bone fragments. The amount of compression provided, however, cannot be readily controlled and is entirely dependent upon the thread pitch differentiation and the depth to which the screw must be embedded to provide adequate purchase on the distal and proximal bone fragments. Another previously proposed form of compression bone screw utilises separate externally threaded leading and trailing elements for embedment within the distal and proximal bone fragments. The leading and trailing elements are rotatable independently of each other and configured such that they may be releasably fixed relative to each other such that they rotate in unison. Such screws are implanted by first fixing the leading and trailing elements and threadingly driving the screw into the proximal and distal bone fragments until the leading element is firmly embedded within the distal bone fragment and the trailing element is firmly embedded within the proximal bone fragment. The leading element is then unlocked from the trailing element and the leading element rotationally driven independent of the trailing element, tending to continue driving the leading element through the distal bone fragment. Given that the trailing element remains fixed in the proximal fragment, the rotation of the leading element results in the distal bone fragment being drawn back towards the proximal bone fragment, providing compression between the two bone fragments. With this arrangement, however, the second action, tending to continue driving the leading element through the distal fragment, may result in the leading element projecting from the distal surface of the distal bone fragment and reducing the degree of embedment of the leading element within the distal bone fragment. The typical coarse pitch thread, designed to cut into the bone material, may also result in failure in poor quality bone material when attempting to generate significant compression loads by driving the coarse steel thread further through the bone. The coarse thread also limits the degree of control of the amount of compression applied. OBJECT OF THE INVENTION It is an object of the present invention to substantially overcome or at least ameliorate at least one of the above disadvantages. SUMMARY OF THE INVENTION In a first aspect, the present invention provides a compression bone screw comprising: a shank having longitudinally opposing first and second shank portions, said first shank portion being externally threaded with a first shank thread; a first element threadingly mounted on said first shank portion by way of a first element internal thread threadingly engaging said first shank thread, said first element being externally threaded with a first element external thread; a second element mounted on, or integrally formed with, said second shank portion, said second element being externally threaded with a second element external thread, said second element external thread and said first element external thread being like-handed; and said first shank portion and said first element being configured to operate in a first mode of operation in which said shank and said first element are rotationally driven in unison and a second mode of operation in which said shank is rotationally driven independent of said first element, such that said first element moves along said first shank portion towards said second element; wherein a pitch of said first element external thread is substantially equal to a pitch of said second element external thread. In a preferred form, said first element external thread and said second element external thread are each self-tapping threads. In a preferred form, said second element external thread extends along substantially the entire length of said second element. Typically, said pitch of said first and second element external threads is coarser than the pitch of said first shank thread. In one or more preferred embodiments, said first shank portion is a trailing shank portion, said second shank portion is a leading shank portion, said first element is a trailing element and said second element is a leading element. In a first embodiment, said second element is fixedly mounted on, or integrally formed with, said second shank portion. In one or more embodiments, said first element external thread is opposite-handed to said first shank thread. In one form, an end face of said first shank portion is provided with a primary drive formation and an end face of said first element is provided with a secondary drive formation, said primary and secondary drive formations being engageable with a drive tool in said first mode of operation for rotationally driving said shank and said first element in unison, said primary drive formation being engageable with the drive tool in said second mode of operation for rotationally driving said shank independently of said first element. Typically, said primary drive formation is engageable with a primary drive head of the same drive tool in said first and second modes of operation, said secondary drive formation being engageable with a secondary drive head of the drive tool in said first mode of operation and disengageable from the secondary drive head in said second mode of operation. Alternatively, the primary drive head may be rotatable independently of the secondary drive head in the second mode of operation. In one form, said secondary drive formation is in the form of a plurality of slots formed in an end face of said first element. In one embodiment, in which said first element is a trailing element, said first element external thread has a first element external thread outer diameter that tapers towards a leading end of said first element. In at least one embodiment, in which said first element is a trailing element, at least a leading region of said first shank thread tapers towards a trailing end of said shank and at least a leading region of said first element is configured to radially expand upon engagement with said leading region of said first shank thread. Typically, at least a leading region of said first element is provided with one or more longitudinally extending slits to enable radial expansion of said leading region of said first element. Preferably, said compression bone screw further comprises a locking mechanism Configured to lock said first element relative to said first shank portion upon installation of said compression bone screw. In one form, said locking mechanism comprises a deformable detent secured to one of said first element and said first shank portion such that, upon installation of said compression bone screw, the other of said first element and said first shank portion engages and deforms said deformable detent to lock said first element to said first shank portion. In one form, the locking mechanism comprises a locking device configured to engage said end face of said first shank portion and said end face of said first element to lock said first element relative to said first shank portion upon installation of said compression bone screw. Typically, said locking device engages said primary drive formation and said secondary drive formation. In one form, said first shank portion and said first element are each configured to releasably engage a locking member to fix said first shank portion relative to said first element for said first mode of operation. In such a form, typically said first shank portion is provided with a longitudinally extending shank groove and said first element is provided with a first element groove, said shank grove and said first element groove co-operating to receive said locking member in use, The locking member will typically be in the form of an elongate pin or screw. In one or more embodiments: said second shank portion is externally threaded with a second shank thread, said second shank thread being opposite-handed to said first shank thread, said second element being threadingly mounted on said second shank portion by way of a second element internal thread threadingly engaging said second shank thread; and said second shank portion and said second element are configured to be rotationally driven in unison in said first mode of operation and such that said shank is rotationally driven independent of said second element in said second mode of operation such that said second element moves along said second shank portion towards said first element. In one form, said shank, said first element and said second element are each configured to releasably engage a locking member to fix said shank relative to said first element and said second element for said first mode of operation. In a preferred form, said locking member forms said locking mechanism. In a preferred form, said shank is provided with a shank groove longitudinally extending along said first and second shank portions, said first element is provided with a first element groove, and said second element is provided with a second element groove, said shank groove, said first element groove and said second element groove co-operating to receive said locking member in use, said locking member being in the form of an elongate pin. In at least one embodiment, first and second primary detents are provided at the end of said first and second shank portions respectively for engaging said first element and said second element respectively during said first mode of operation, thereby enabling said shank to be rotationally driven in unison with said first element and said second element in said first mode of operation, said second shank thread being opposite handed to said second element external thread. In one embodiment, first and second secondary detents are provided between said first and second shank portions for engaging said first element and said second element respectively upon completion of said second mode of operation, thereby limiting movement of said first element towards said second element. In a preferred form, said first and second secondary detents are configured such that, upon engagement with said first and second elements respectively, said shank does not longitudinally extend beyond said first element or said second element. In a second aspect, the present invention provides a compression bone screw comprising: a shank having longitudinally opposing first and second shank portions, said first shank portion being externally threaded with a first shank thread, said second shank portion being externally threaded with a second shank thread, said second shank thread being opposite-handed to said first shank thread; a first element threadingly mounted on said first shank portion by way of a first element internal thread threadingly engaging said first shank thread, said first element being externally threaded with a first element external thread; and a second element threadingly mounted on said second shank portion by way of a second element internal thread threadingly engaging said second shank thread, said second element being externally threaded with a second element external thread, said second element external thread and said first element external thread being like-handed; said shank, said first element and said second element being configured to operate in a first mode of operation in which said shank, said first element and said second element are rotationally driven in unison and a second mode of operation in which said shank is rotationally driven independent of said first element and said second element, such that said first element moves along said first shank portion towards said second element and said second element moves along said second shank portion towards said first element. In one form, said first shank portion is a trailing shank portion, said second shank portion is a leading shank portion, said first element is a trailing element and said second element is a leading element. In one specific embodiment, said first element external thread is configured to engage a mating thread of an aperture extending through a locking plate and said second element external thread is a self-tapping thread for engaging bone. In one form, said shank, said first element and said second element are each configured to releasably engage a locking member to fix said shank relative to said first element and said second element for said first mode of operation. In such a form, typically said shank is provided with a shank groove longitudinally extending along said first and second shank portions, said first element is provided with a first element groove, and said second element is provided with a second element groove, said shank groove, said first element groove and said second element groove co-operating to receive the locking member in use. The locking member will typically be in the form of an elongate pin or screw. In one form first and second primary detents are provided at the end of said first and second shank portions respectively for engaging said first element and said second element respectively during said first mode of operation, thereby enabling said shank to be rotationally driven in unison with said first element and said second element in said first mode of operation, said second shank thread being opposite handed to said second element external thread. In one form, first and second secondary detents are provided between said first and second shank portions for engaging said first element and said second element respectively upon completion of said second mode of operation, thereby limiting movement of said first element towards said second element. In a third aspect, the present invention provides a method of fixing a proximal bone fragment to a distal bone fragment, said method comprising the steps of: a) providing a compression bone screw comprising: (i) a shank having longitudinally opposing first and second shank portions, said first shank portion being externally threaded with a first shank thread; (ii) a first element threadingly mounted on said first shank portion by way of a first element internal thread threadingly engaging said first shank thread, said first element being externally threaded with a first element external thread; and (iii) a second element mounted on, or integrally formed with, said second shank portion, said second element being externally threaded with a second element external thread, said second element external thread and said first element external thread being like-handed; b) drilling a hole through said proximal bone fragment into said distal bone fragment; c) rotationally driving said screw into said hole with said second element leading, rotationally driving said first element, said second element and said shank in unison until said second element is embedded within said distal bone fragment and said first element is embedded in said proximal bone fragment; d) rotationally driving said shank independently of said first element in a direction tending to draw said first and second elements together. In one form, said second element is fixedly mounted on, or integrally formed with, said second shank portion, and in step (c) said shank is rotationally driven in unison with said second element. In an alternate form, said second shank portion is externally threaded with a second shank thread, said second shank thread being opposite-handed to said first shank thread, said second element being threadingly mounted on said second shank portion by way of a second element internal thread threadingly engaging said second shank thread and, in step (c) said shank is rotationally driven independently of said second element. Also disclosed is a method of fixing a proximal bone fragment to a distal bone fragment, said method comprising the steps of: a) drilling a hole through said proximal bone fragment into said distal bone fragment; b) securing a locking plate to an adjacent stable bone portion, aligning a threaded aperture extending through said locking plate with said hole; c) providing a compression bone screw comprising: (i) a shank having longitudinally opposing first and second shank portions, said first shank portion being externally threaded with a first shank thread, said second shank portion being externally threaded with a second shank thread, said second shank thread being opposite-handed to said first shank thread; (ii) a first element threadingly mounted on said first shank portion by way of a first element internal thread threadingly engaging said first shank thread, said first element being externally threaded with a first element external thread matching the thread of said threaded aperture; and (iii) a second element threadingly mounted on said second shank portion by way of a second element internal thread threadingly engaging said second shank thread, said second element being externally threaded with a second element external thread, said second element external thread and said first element external thread being like-handed; d) rotationally driving said screw through said threaded aperture into said hole with said second element leading, rotationally driving said first element, said second element and said shank in unison until said second element is embedded within said distal bone fragment and said first element is embedded within said threaded aperture; e) rotationally driving said shank independently of said first element in a direction tending to draw said first and second elements together. BRIEF DESCRIPTION OF THE DRAWINGS Preferred embodiments of the present invention will now be described, by way of example only, with reference to the accompanying drawings wherein: FIG. 1 is a front elevation view of a compression bone screw according to a first embodiment; FIG. 2 is an end elevation view of the compression bone screw of FIG. 1; FIG. 3 is an opposing end elevation view of the compression bone screw of FIG. 1; FIG. 4 is an isometric view of the compression bone screw of FIG. 1; FIG. 5 is a schematic cross-sectional view of the compression bone screw of FIG. 1; FIG. 6 is a partially cross-sectioned view of a drive tool for use with the compression bone screw of FIG. 1; FIG. 7 is a schematic view of a fractured bone with the compression bone screw of FIG. 1 partly implanted; FIG. 8 is a schematic view of the fractured bone of FIG. 7 with the compression screw of FIG. 1 fully implanted; FIG. 9 is a side elevation of a compression bone screw according to a third embodiment; FIG. 10 is an isometric view of the compression bone screw of FIG. 9; FIG. 11 is a further isometric view of the compression bone screw of FIG. 9; FIG. 12 is a schematic cross-sectional view of the compression bone screw of FIG. 9; FIG. 13 is a schematic cross-sectional view of the compression bone screw of FIG. 9 in an implanted configuration; FIG. 14 is a schematic view of an ankle arthrodesis with the compression bone screw of FIG. 9 partly implanted; FIG. 15 is a schematic view of the ankle arthrodesis of FIG. 14 with the compression bone screw of FIG. 9 fully implanted; FIG. 16 is a schematic perspective view of a trailing end portion of the compression bone screw of FIG. 9; FIG. 17 is a perspective view of a locking device for use with the compression bone screw of FIG. 9; DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A compression bone screw 100 according to a first embodiment is depicted in FIGS. 1 to 5. The compression bone screw 100 comprises a shank 110, a first element 120 and a second element 130. The shank 110 has longitudinally opposing first and second shank portions 111, 112. The first shank portion 111 is externally threaded with a first shank thread 113 that is here a left-handed thread. In the arrangement depicted, the shank 110 has an overall diameter of approximately 6 mm and the first shank thread 113 has a relatively fine pitch of approximately 1 mm. The first element 120 has a first element aperture 121 longitudinally extending therethrough and a first element internal thread 122 formed on the wall of the first element aperture 121, The first element 120 is threadingly mounted on the first shank portion 111 by way of the first element internal thread 122 threadingly engaging the first shank thread 113. Accordingly, the first element internal thread 122 and first shank thread 113 are matching and are here in the form of machine threads. The first element 120 is also externally threaded with a first element external thread 123. The first element external thread 123 will typically extend along substantially the entire length of the first element 120. In the arrangement depicted, the first element external thread 123 is opposite-handed to the first shank thread 113, being a right-handed thread. The first element external thread 123 here has a relatively course pitch of approximately 2 mm, (compared to a relatively finer 1 mm pitch of the first shank thread 113), a thread depth of approximately 1.5 mm, and is self-tapping for screwing into bone material. In the arrangement depicted, the first element 120 typically has an overall diameter of approximately 11 mm and a length of the order of 15 mm. In the first embodiment, the second element 130 is fixedly mounted on the second shank portion 112. The second element 130 could be fixed, typically by welding, to the end of the second shank portion 112 or alternatively the second shank portion 112 may project into a recess formed in the end of the second element 130 and be fixed thereto. It is also envisaged that the second element 130 might be integrally formed with the shank second portion 112, typically by machining, as a monoblock construction. The second element 130 is externally threaded with a second element external thread 133 that is like-handed to the first element external thread 123 (right-handed in the arrangement depicted) and an at least substantially identical pitch. The second element external thread 133 is again a self-tapping thread and will typically extend along substantially the entire length of the second element 130. The second element 130 has an equivalent length to that of the first element 120, being a length of approximately 15 mm and has a smaller overall diameter of approximately 10 mm, so that the first element external thread 123 is able to get a better purchase on the bone material after the second element external thread 133 has already passed therethrough. It is also envisaged, however, that the first and second elements 120, 130 may have the same overall diameter. It is further envisaged that the first and second elements 120, 130 may have differing lengths to suit applicability to different bones and clinical scenarios. To protect against loosening of the compression bone screw 100 after implantation, the compression bone screw 100 here further comprises a locking mechanism configured to lock the first element 120 relative to the first shank portion 111 upon installation of the screw 100. In the first embodiment, the locking mechanism comprises a deformable detent 160 secured to the interior of the first element 120. As depicted in FIG. 5, the detent 160 is here positioned adjacent the trailing first element end face 124 such that, as will be described below, upon installation of the compression bone screw 100 the first shank portion 111 engages the detent 160 and deforms the detent 160 so as to lock the first element 120 to the first shank portion 111. In the particular arrangement depicted, the deformable detent 160 is in the specific form of a collar insert which may be formed of nylon or another deformable material, in a similar manner to the nylon collar insert of a standard lock nut. Rather than being mounted internally on the first element 120, it is also envisaged that an equivalent deformable detent 160′, again as depicted in FIG. 5, could be mounted on the first shank portion 111, towards the second shank portion 112, so as to engage the first element 120 in a similar manner. In the arrangement depicted, the second element 130 is the leading element of the compression bone screw 100 intended to lead when screwed into a fractured bone and, accordingly, is provided with a tapered self-tapping point 134 for drilling into bone material. The first element 120 is thus the trailing element, the first shank portion 111 is the trailing shank portion and the second shank portion 112 is the leading shank portion. With the second element 130 being fixedly mounted on the second shank portion 112, the second element 130 rotates in unison with the shank 110 during use. The first shank portion 111 and first element 120 are configured to operate in a first mode of operation, as will be discussed below, in which the shank 110 and first element 120 are rotationally driven in unison and in a second mode of operation, as will again be discussed further below, in which the shank 110 is rotationally driven independent of the first element 120. In the first embodiment, these two modes of operation are provided for by way of primary and secondary drive formations provided on the first element 120 and the first shank portion 111 and an associated driving tool 150 depicted in FIG. 6. The first shank portion 111 has a first shank end face 114 provided with a primary drive formation, here in the form of a hexagonal drive socket 115 (see FIG. 3). The primary drive formation might, however, take any form of drive formation including a slot, Phillips head, star drive or other polygon drive form. The first element 120 has an annular trailing first element end face 124 that is provided with a secondary drive formation, here in the form of a plurality of slots 125, here configured as four equally spaced slots 125, formed in the first element end face 124. Again, the secondary drive formation may take any suitable drive formation form. The drive tool 150 is formed with a handle 151 and elongate shaft 152 on the end of which is formed a hexagonal primary drive head 153 that is configured to engage the hexagonal drive socket 115 of the first shank portion 111. The drive tool 150 is further provided with a sleeve 154 that is mounted on the shaft 152, here so as to be longitudinally displaceable along the shaft 152 by way of finger grips 155 formed on the trailing end of the sleeve 154 for activation by a user gripping the handle 151. At the leading end of the sleeve 154 is provided a secondary drive head comprising four lugs 156 configured to engage the slots 125 provided in the first element end face 124. With the hexagonal primary drive head 153 engaging the hexagonal drive socket 115, the sleeve 154 may be advanced such that the lugs 156 engage the slots 125, for the first mode of operation to rotationally drive the first element 120 and shank 110 in unison. The sleeve 154 may be retracted, with the hexagonal primary drive head 153 still engaging the hexagonal drive socket 115, such that the lugs 156 disengage the slots 125, thereby allowing the shank 110 to be rotationally driven independently of the first element 120 in the second mode of operation. Alternatively, the sleeve 154 could be non-retractable and held stationary in engagement with the lugs 156 whilst the primary drive head 153 drives the shank 110 in the second mode of operation. Rather than providing the secondary drive head lugs 156 on the end of a retractable sleeve 154, it is also envisaged that two separate drive tools might be utilised, one having a drive head for engaging the primary drive formation only for the first mode of operation and the other having either a single drive head configured to engage both the primary and secondary drive formations, or separate drive heads for engaging each of the primary and secondary drive formations for the second mode of operation. An alternate configuration is envisaged where the first element 120 forms the leading element and the second element 130 forms the trailing element. In such a configuration however, the first element 120, being the element threadingly mounted on the shank 110, would not be as accessible for access by a drive tool for driving the first element 120 in unison with the first shank portion 111. As an alternative, the first element 120 could be releasably fixed to the first shank portion 111 for the first mode of operation in a similar manner to that described below in relation to the second embodiment. The fixing of proximal and distal bone fragments 1, 2 of a fractured bone using the compression bone screw 100 of the first embodiment will now be described with reference to FIGS. 7 and 8. With the proximal and distal bone fragments 1, 2 appropriately positioned, a guide hole 3 with a diameter of approximately 8 mm for the arrangement depicted is first drilled through both the proximal and distal bone fragments 1, 2. The guide hole 3 may extend through the thickness of the distal fragment 2, or may be a blind hole as depicted. The guide hole 3 may then be pre-tapped, particularly if the bone material is particularly hard or if the first and second element external threads 123, 133 are not of a self-tapping configuration. The tapered point 134 of the second element 130 is then inserted into the guide hole 3 formed in the proximal bone fragment 1. The drive tool 150 is engaged with the compression bone screw 100, engaging the hexagonal primary drive head 153 with the hexagonal drive socket 115 formed in the end face 114 of the first shank portion 111 and the sleeve 154 of the drive tool 150 is advanced such that the lugs 156 engage the slots 125 formed in the end face 124 of the first element 120. The drive tool 150 is then rotationally driven by hand in a clockwise direction in the first mode of operation, thereby rotationally driving the first element 120 in unison with the shank 110 (and second element 130), advancing the entire compression bone screw 100 through the guide hole 3. With the pitch of the first element external thread 123 and second element external thread 133 being at least substantially identical, the first and second elements 120, 130, rotating in unison, will advance through the proximal and distal bone fragments 1, 2 respectively at at least a substantially equal rate so that the first mode of operation will not tend to either draw the proximal and distal bone fragments 1, 2 towards each either or drive them apart. The compression bone screw 100 is rotationally driven until the second element 130 is firmly embedded within the distal bone fragment 2 and the first element 120 is firmly embedded within the proximal bone fragment 1. At this point, the proximal and distal bone fragments 1, 2 will be firmly fixed in relation to each other, but without any compression being applied at the interface between the bone fragments 1, 2. The sleeve 154 is then retracted so as to disengage the lugs 156 from the slots 125 (or kept engaged with the lugs 156 but held stationary). The drive tool 150 is then further rotationally driven in the clockwise direction in the second mode of operation (or at least the shaft 152 rotationally driven). This results in rotation of the shank 110 together with the second element 130, independently of the first element 120 which remains stationary within its embedded position within the proximal bone fragment 1. The rotation of the second element 130 tends to advance the second element 130 deeper into the distal bone fragment 2 by virtue of the right-handed thread of the second element external thread 133, thereby effectively drawing the distal bone fragment 2 back toward the proximal bone fragment 1. At the same time, rotation of the shank 110 tends to retract the first shank portion 111 relative to the first element 120 by virtue of the opposite left-handed thread of the first shank thread 113. The first element 120 thus moves forward along the first shank portion 111 towards the second element 130. This draws the proximal bone fragment 1 toward the distal bone fragment 2, generating the desired compression between the bone fragments 1, 2, without displacement of the first element 120 within the proximal bone fragment 1. Having the first shank thread 113 and second element external thread 133 opposite-handed ensures that the relative motion of the proximal and distal bone fragments 1, 2 towards each other in a single revolution of the shank 110 is equal to the sum of the pitches of the two threads. Accordingly, a desired level of compression can be achieved through significantly less revolutions than is required with compression bone screws that rely on unequal pitched threads to achieve compression, Both the first and second element external threads 123, 133 being made with substantially the same coarse pitch, provide improved fixation in cancellous bone. When the first shank portion 111 is drawn sufficiently back into the first element 120 during the second mode of operation, the first shank portion 111 engages the deformable detent 160 to lock the first element 120 onto the first shank portion 111, thereby inhibiting loosening of the compression bone screw 100 after implementation which might otherwise result from micro-movement of the proximal and distal bone fragments 1, 2 during the healing process. The implantation of the compression bone screw 100 may be conducted with the assistance of a guide wire extended through the guide hole 3. Where a guide wire is to be utilised, a bore hole (not depicted) will extend through the centre of the shank 110 and the second element 130 for receipt of the guide wire 3. Similarly, a bore hole will extend through the centre of the drive tool 150. The drive tool 150 and compression bone screw 100 will thus be mounted on the guide wire throughout the implantation process. It is further envisaged that, in both embodiments described above, the first and second element external threads may be left-handed rather than right-handed, counter-clockwise driving of the drive tool would again be required and, in the first embodiment, the first shank thread would be right-handed. A compression bone screw 300 according to a third embodiment is depicted in FIGS. 12 to 16. The compression bone screw 300 is a modified version of the compression bone screw 100 of the first embodiment and shares the same basic configuration. Those features of the compression bone screw 300 of the third embodiment that are identical, or equivalent, to features of the compression bone screw 100 of the first embodiment are again provided with like reference numerals, here increased by 200. The compression bone screw 300 comprises a shank 310, a first element 320 and a second element 330. The shank 310, first element 320 and second element 330 may be formed of the same materials as per the first and second embodiments. In the arrangement depicted, the first element 320 is the trailing element, the first shank portion 311 is the trailing shank portion and the second shank portion 312 is the leading shank portion. The shank 310 has longitudinally opposing first and second shank portions 311, 312. The first shank portion 311 is externally threaded with a first shank thread 313 that is again a left-handed thread. A leading region 313 a of the first shank thread 313 is tapered, with the first shank thread 313 tapering in this region towards the first shank end face 314 at a taper angle that will typically be about 2 to 3 degrees. The taper angle may, however be larger, with angles up to at least 30 degrees being envisaged. Here the first shank thread 313 has an overall diameter of approximately 4.0 mm at its leading end adjacent the second shank portion 312, and an overall diameter of approximately 3.4 mm along the length of the trailing region of the first shank thread 313. As with the first embodiment, the first shank thread 313 here has a pitch of approximately 1 mm. The second shank portion 312 is here of a cylindrical non-threaded form. A central bore hole 341 sized to receive a guide wire is provided along the length of the shank 310, as would typically be the case with the compression bone screw 100 and 200 of the first and second embodiments (although not depicted). A first primary detent 318, in the form of an enlarged head, is formed at the trailing first shank end face 314. The first element 320 has a first element aperture 321 longitudinally extending therethrough and a first element internal thread 322 formed on the wall of the first element aperture 321. The first element 320 is threadingly mounted on the first shank portion 311 by way of the first element internal thread 322 threadingly engaging the first shank thread 313, as per the first embodiment. The first element 320 is externally threaded with a first element external thread 323 which again extends along substantially the entire length of the first element 320. In this embodiment, the first element external thread 323 is opposite-handed to the first shank thread 313, being a right-handed thread. The first element external thread 323 here has a relatively coarse pitch of approximately 2 mm and an overall diameter that tapers towards a leading end of the first element 320. To achieve this tapering of the first element thread overall diameter, the thread depth decreases towards the leading end of the first element 320, here decreasing from approximately 2.8 mm to approximately 1.5 min. The first element thread 323 is also self-tapping for screwing into bone material. The first element 320 typically has an overall diameter of approximately 10.5 mm its trailing end and a length of the order of 15 mm. The trailing first element end face 314 is provided with a first element recess 328 for receipt of the first primary detent 318. The base of the first element recess 328 forms an annular first element shoulder 329 which engages the first primary detent 318 at one end of the extent of travel of the first element 320 along the first shank portion 311, to retain the first element 320 on the first shank portion 311. Travel of the first element 320 along the first shank portion 311 in the opposing direction is limited by engagement of the leading end of the first element 320 with a first secondary detent 371 defined at the junction between the threaded first shank portion 311 and the non-threaded second shank portion 312. The first secondary detent is effectively defined by the runout of the first shank thread 313. The first element recess 328 has a length such that the first primary detent 318 does not project beyond the first element recess 328 at any point along the extent of travel of the first element 320, ensuring that there is no overhang of the shank 310 from the first element 320 upon implantation. Referring specifically to FIG. 9, the first element 320 is provided with one or more longitudinally extending slits 342 extending from the leading end of the first element 320, along about 30 to 50 percent of the length of the first element, to enable radial expansion of the leading region 320 a of the first element 320 as it is advanced along the tapered leading region 313 a of the first shank thread 313 during the second mode of operation of the compression bone screw 300 as will be discussed below. The second element 330 is fixed in relation to the shank 310, here specifically being integrally formed with the shank 310 such that the second element 330 and shank rotate in unison during use. The second element 330 is of the same general configuration as the second element 130 of the compression bone screw 100 of the first embodiment, being externally threaded with a second element external thread 333 that is like-handed to the first element external thread 323 (right-handed in the arrangement depicted) and which extends along substantially the entire length of the second element 330. The second element external thread 333 again typically has a substantially identical pitch to that of the first element external thread 323 and has a diameter slightly less than that of the leading end of the first element 320, so that the first element external thread 323 is able to get a better purchase on the bone material after the second element external thread 333 has already passed therethrough. Again as with the first embodiment, the first shank portion 311 and first element 320 are configured to operate in a first mode of operation in which the shank 310 and first element 320 are rotationally driven in unison and in a second mode of operation in which the shank 310 is rotationally driven independent of the first element 320. Again similar to the first embodiment, these two modes of operation are provided for by way of primary and secondary drive formations formed on the first element 320 and the first shank portion 311 respectively and an associated driving tool equivalent to that of the driving tool 150 depicted in FIG. 6. The first shank end face 314 is provided with a primary drive formation, shown in FIG. 23 in the form of a slot 315, for engaging a primary drive head in the form of a blade rather than the hexagonal drive head 153 of the drive tool 150. Again, any suitable form of primary drive formation might be provided on the first shank end face 314. The annular trailing first element end face 324 is provided with a secondary drive formation in the form of a plurality of slots 325 as per the first embodiment. The configuration of the first element 320 and first shank portion 311 of the third embodiment may also be applied to the first element 220 and first shank portion 211 of the compression bone screw 200 of the second embodiment, particularly in relation to the tapering aspects of the first element thread 323 and tapered leading region 313 a of the first shank thread 313 along with the slits 342 in the first element 320. The procedure for fixing proximal and distal bone fragments 1, 2 of a fractured bone using the compression bone screw 300 of the third embodiment is generally as per the above described procedure in relation to the compression bone screw 100 of the first embodiment, and will now be described in further detail with reference to FIGS. 14 and 15. As with the first embodiment, a guide hole 3 is first drilled through the proximal and distal bone fragments 1, 2 and the tapered self-tapping point 334 of the second element 330 inserted into the guide hole 3 formed in the proximal bone fragment 1. The drive tool 150 is engaged with the compression bone screw 300 engaging the primary slot 315 and secondary drive formation slots 325 and the drive tool 150 rotationally driven in a clockwise direction in the first mode of operation, thereby rotationally driving the first element 320 in unison with the shank 310 and second element 330, advancing the entire compression bone screw 300 through the guide hole 3. As with the procedure for the first embodiment, once the second element 330 is firmly embedded within the distal bone fragment 2 and the first element 320 is firmly embedded within the proximal bone fragment 1, the sleeve 154 of the drive tool 150 is retracted so as to disengage the lugs 156 from the secondary drive formation slots 125 and the drive tool is further rotationally driven in a clockwise direction in the second mode of operation. This results in rotation of the shank 310 together with the second element 330, independent of the first element 320 which remains stationary. Rotation of the second element 330 tends to advance the second element 330 deeper into the distal bone fragment 2, thereby effectively drawing the distal bone fragment 2 back towards the proximal bone fragment 1. At the same time, rotation of the shank 310 tends to retract the first shank portion 311 relative to the first element 320. The first element 320 thus moves forward along the first shank portion 311 towards the second element 330. This draws the proximal bone fragment 1 towards the distal bone fragment 2, generating the desired compression between the bone fragments 1, 2 without displacement of the first element 320 with any proximal bone fragments. At the same time, as the first element is drawn along the first shank portion 311, engaging the tapered leading region 313 a of the first shank thread 313, the leading region 320 a of the first element 320 radially expands, by expansion of the slits 342. This radial expansion provides a compressive preload between the first element 320 and bone increasing the pullout strength of the compression bone screw 300 in weaker, particularly osteoporotic, bone, thereby increasing the strength of the overall construct. A similar preload is applied in the trailing region of the first element 320 by virtue of the taper of the first element thread 323 as the first element 320 is advanced through the proximal bone fragment 1 during the first mode of operation. Once implantation of the compression bone screw 300 is complete, when the desired compression is achieved, the first element 320 may be locked in relation to the shank 311 by way of a locking mechanism in the form of a locking device 360 as depicted in FIG. 17. The locking device 360 has an elongate shaft 361 configured to extend into the bore hole 341 in the shank 310. The locking device also has a head 362, the leading face of which is provided with a primary locking structure, here in the form of an elongate rib 363, configured to engage the first shank end face 314, particularly the primary drive formation slot 315 of the first shank portion 311. The locking device body 362 is further provided with a secondary locking structure, here in the form of four radially projecting lugs 364, configured to engage the first element end face 324, particularly the secondary drive formation slots 325. Once in place, the locking device 360 prevents any relative rotation between the first element 320 and the first shank portion 311. An equivalent locking device may also be used with the compression bone screw 100 of the first embodiment. Each of the components of each of the compression bone screws described above may be formed of stainless steel, titanium or any other suitable biologically inert engineering material, including bioabsorbable materials such as polylactic acid or the like. The various dimensions of each of the components of each of the compression bone screws described above may also be adjusted to suit a particular intended application. A person of ordinary skill in the art will appreciate that various other modification and alterations of the compression screws described may be made without departing from the spirit of the invention. In particular, various other mechanisms may be utilised to provide for rotation of the shank with the first (and second) elements in the first mode of operation. 1. A compression bone screw, comprising: a shank having longitudinally opposing first and second shank portions, said first shank portion being externally threaded with a first shank thread; a first element threadingly mounted on said first shank portion by way of a first element internal thread threadingly engaging said first shank thread, said first element being externally threaded with a first element external thread; a second element integrally formed with said second shank portion, said second element being externally threaded with a second element external thread, said second element external thread and said first element external thread being like-handed; and said first shank portion and said first element being configured to operate in a first mode of operation in which said shank and said first element are rotationally driven in unison urging said first element and said second element axially in the same direction and at the same rate; and a second mode of operation in which said shank is rotationally driven independent of said first element, such that said first element moves axially along said first shank portion towards said second element; wherein a pitch of said first element external thread is substantially equal to a pitch of said second element external thread. 2. The screw of claim 1, wherein: said first element external thread and said second element external thread are each self-tapping threads. 3. The screw of claim 1, wherein: said pitch of said first and second element external threads is coarser than a pitch of said first shank thread. 4. The screw of claim 1, wherein: said first shank portion is a trailing shank portion, said second shank portion is a leading shank portion, said first element is a trailing element and said second element of said second shank portion is a leading element. 5. The screw of claim 4, wherein: said second element is formed as an enlarged diameter portion of the second shank portion. 6. The screw of claim 5, wherein: said first element external thread is opposite-handed to said first shank thread. 7. The screw of claim 5, wherein: an end face of said first shank portion is provided with a primary drive formation and an end face of said first element is provided with a secondary drive formation, said primary and secondary drive formations being engageable with a drive tool in said first mode of operation for rotationally driving said shank and said first element in unison, said primary drive formation being engageable with the drive tool in said second mode of operation for rotationally driving said shank independently of said first element so that the first element upon rotation of said shank moves axially relative to said first element. 8. The screw of claim 4, wherein: said first element external thread has a first element external thread outer diameter that tapers towards a leading end of said first element. 9. The screw of claim 4, wherein: at least a leading region of said first shank thread tapers towards a trailing end of said shank and at least a leading region of said first element is configured to radially expand upon engagement with said leading region of said first shank thread. 10. The screw of claim 9, wherein: at least a leading region of said first element is provided with one or more longitudinally extending slits to enable radial expansion of said leading region of said first element. 11. The screw of claim 5, wherein: said screw further comprises a locking mechanism configured to lock said first element relative to said first shank portion upon installation of said compression bone screw. 12. The screw of claim 11, wherein: said locking mechanism comprises a deformable detent secured to one of said first element and said first shank portion such that, upon installation of said compression bone screw, the other of said first element and said first shank portion engages and deforms said deformable detent to lock said first element to said first shank portion. 13. The screw of claim 11, wherein: said locking mechanism comprises a locking device configured to engage said end face of said first shank portion and said end face of said first element to lock said first element relative to said first shank portion upon installation of said compression bone screw. 14. The screw of claim 5, wherein: said first shank portion and said first element are each configured to releasably engage a locking member to fix said first shank portion relative to said first element for said first mode of operation. 15. The screw of claim 14, wherein: said first shank portion is provided with a longitudinally extending shank groove and said first element is provided with a first element groove, said shank grove and said first element groove co-operating to receive said locking member in use. 16. The screw of claim 16, wherein: first and second primary detents are provided at the end of said first and second shank portions respectively for engaging said first element and said second element respectively during said first mode of operation, thereby enabling said shank to be rotationally driven in unison with said first element and said second element in said first mode of operation, said second shank thread being opposite handed to said second element external thread. 17. A compression bone screw, comprising: a shank having longitudinally opposing first and second shank portions, said first shank portion being externally threaded with a first shank thread, said second shank portion being externally threaded with a second shank thread, said second shank thread being opposite-handed to said first shank thread; a first element threadingly mounted on said first shank portion by way of a first element internal thread threadingly engaging said first shank thread, said first element being externally threaded with a first element external thread; and a second element integral with and formed by an enlargement of the second shank portion by, said second element having an external thread, said second element external thread and said first element external thread being like-handed; said shank, said first element and said second element being configured to co-operate in a first mode of operation in which said shank, said first element and said second element are rotationally driven in unison such that each advance axially in the same direction and at the same rate upon application of said rotational drive and a second mode of operation in which said shank is rotationally driven distally independent of said first element, such that said first element moves along said first shank portion towards said second element. 18. The screw of claim 22, wherein: said first shank portion is a trailing shank portion, said second shank portion is a leading shank portion, said first element is a trailing element and said second element is a leading element. 19. A method of fixing a proximal bone fragment to a distal bone fragment, said method comprising the steps of: a) providing a compression bone screw comprising: (i) a shank having longitudinally opposing first and second shank portions, said first shank portion being externally threaded with a first shank thread; (ii) a first element threadingly mounted on said first shank portion by way of a first element internal thread threadingly engaging said first shank thread, said first element being externally threaded with a first element external thread; and (iii) a second element integrally formed with and by an enlargement of said second shank portion, said second element being externally threaded with a second element external thread, said second element external thread and said first element external thread being like-handed; b) drilling a hole through said proximal bone fragment into said distal bone fragment; c) rotationally driving said screw into said hole with said second element leading, rotationally driving said first element, said second element and said shank in unison until said second element is embedded within said distal bone fragment and said first element is embedded in said proximal bone fragment; d) rotationally driving said shank independently of said first element in a direction tending to draw said first and second elements together.

2017-04-07

en

2018-03-01

US-201515122873-A

A Container For Packaging Products, In Particular Food Products Such As Fresh Meat Products, As Well As A Method For Packaging Such Products ABSTRACT The invention relates to a container for packaging products, in particular fresh products such as meat products. The container comprises a container body with a product space for accommodating a product and a receiving space at least for receiving liquid, preferably liquid from the product. The container body according to the invention comprises partition means that separate the product space and the receiving space from each other. The partition means comprise at least one outlet opening configured to at least discharge liquid from the product space to the receiving space. The container is further provided with at least one resistance element extending into the receiving space, which resistance element surrounds the outlet opening in such a manner that the resistance element prevents the transport of liquid from the receiving space to the product space. The invention relates to a container for packaging products. The invention in particular relates to a container for packaging food products, such as perishable food products, which can exude a liquid. Examples of this include fresh meat products, such as red meat, poultry, but also fish, cheese and the like. Such a container is generally known in the form of prepackaged portion packages for fresh meat products, in particular raw meat, which packages are generally available in supermarkets and the like. The known container comprises a container body having an internal volume, which forms a product space in which the products, such as the meat products, are contained. In the container, an absorbent material is furthermore provided, which material absorbs liquid exuded from the product, such as meat juices, and retains said juices. The use of such an absorbent material is undesirable, inter alia for hygienic reasons. Relatively prolonged contact between liquid and food product leads to decay and bacterial growth, so that the standards of hygiene that apply to such containers cannot be complied with. It is an object of the present invention to provide an improved container in which the liquid from a product is discharged in an effective manner and kept separated from the product and which in addition can be produced in a relatively inexpensive and efficient manner. It is in particular an object of the invention to provide such a container which does not require any adaptation as regards the further packaging process at the meat/fresh fish producer and/or on the part of the consumer in comparison with the packaging process used with known containers. In order to achieve that object, the container according to the present invention comprises a container body with a product space for accommodating a product therein and a receiving space at least for receiving liquid therein, wherein the container comprises partition means that separate the product space and the receiving space from each other. In a normal position of the container, the product space is at least in part positioned above the receiving space. In a packaged condition, the product is in that case at least partially located above the receiving space. The partition means comprise at least one outlet opening configured to at least discharge liquid from the product space to the receiving space. As a result, liquid can flow from the product space to the receiving space, at least in the normal position of the container. The partition means ensure that the product to be packaged is stored spaced from the liquid contained in the receiving space. As a result there is no longer any contact between the liquid contained in the receiving space and the product to be stored, so that possible decay and bacterial growth are prevented. The container according to the present invention further comprises at least one resistance element. Said resistance element extends into the receiving space, surrounding the outlet opening in such a manner that the resistance element prevents the transport of liquid from the receiving space to the product space. This is in particular the case in a position different from the normal position of the container, for example an inclined position in which the receiving space is positioned beside the product space, in particular an upside-down position of the container, in which, quite the opposite, the receiving space is positioned above the product space. In such a position of the container the resistance element forms a barrier to liquid, so that liquid cannot reach the outlet opening, or at least to a reduced extent. In this way liquid is prevented from flowing back from the receiving space to the product space via the outlet opening. The liquid is thus discharged in a reliable manner and kept separated from the product. The container according to the present invention can be produced in a relatively inexpensive and simple manner as according to the invention the assembly of container body and the partition means is configured as an integral unit. The partition means in this case form an integral unit with the container body, in particular with a circumferential wall of the container body. This makes it possible to produce the container body in a single step, for example by thermoforming, injection-moulding or another suitable technique. An advantage of the container according to the present invention is furthermore the fact that it does not require any adaptation as regards the further packaging process at the meat/fresh fish producer. Adaptations as regards consumer behaviour are not required, either. In one embodiment, the assembly of container body and partition means is at least substantially made of PP (polypropylene). It is also conceivable that the assembly is at least substantially made of a APET (Amorphous Polyethylene Terephthalate/polyester). The above materials are very safe and hygienic materials for food products. The choice of this material (or these materials) provides an adequate protection of the packaged product until the date of expiry thereof. In addition, the materials have excellent transparency properties, which contributes to the sales-stimulating aspect of the package. The integral assembly can be formed in a simple, efficient and inexpensive manner by means of a thermoforming process. It is noted in this regard that the partition means according to the invention preferably keep the product space separated from the receiving space in such a manner that a liquid-tight separation between the product space and the receiving space is provided, wherein the transport of liquid is only possible via the outlet opening, or possibly via additional openings, such as further outlet openings. The partition means are in any case configured so that undesirable transport of liquid between the receiving space and the product space is to a large extent prevented. The skilled person will appreciate that the liquid that is discharged in the present invention is not limited to liquid from the food product, but that said liquid may also comprise other liquids, such as condensation or additives to the food products, for example, such as marinade or preservatives. In one embodiment, a part of the partition means that faces the receiving space comprises the resistance element. The resistance element forms part of the partition means, which makes the container relatively easy to produce. Because the resistance element forms part of the partition means, the resistance element and the part of the partition means that faces the receiving space form a collecting reservoir for liquid, at least in an inclined position or an upside-down position of the container. Liquid cannot flow over the resistance element in the direction of the outlet opening in that case, so that the transport of liquid from the receiving space to the product space is prevented. In a simple embodiment, the resistance element comprises a protrusion that extends toward the receiving space. Said protrusion can be formed in the partition means in a relatively simple manner. In one embodiment, a recess is provided in the part of the partition means that faces the product space so as to obtain a better discharge of liquid from the product. In this way liquid is kept apart from the product. It is preferable in that regard if the protrusion that extends towards the receiving space corresponds to the recess in the product space. The recess thus at the same time forms the protrusion in the receiving space, as it were. Such an embodiment is compact and easy to produce. If in one embodiment the outlet opening is provided in the recess, liquid from the product is carried to the receiving space in a simple manner via the recess and the outlet opening. If additionally the recess furthermore corresponds to the protrusion in the receiving space that forms the resistance element, as already described above, a very simple yet efficient embodiment of the container according to the present invention is obtained. It is preferable if the partition means comprise a partition or if the partition means are configured as a partition. In such an embodiment the partition can in particular have a substantially constant thickness. Such an embodiment is very easy to produce, making it possible to form the container and/or the partition means by means of a thermoforming and/or an injection-moulding process. In one embodiment, in order to further improve the separation between liquid and product, the part of the partition means that faces the product space defines a product support surface for the product. Furthermore, there is no absolute need for an additional wall functioning as a product support, which makes it easier to produce the container according to the present invention. The partition means may in that case comprise protrusions that extend toward the product space, with crests of said protrusions forming at least parts of the product support surface. The protrusions only support parts of the product, so that there are parts of the products which are not in contact with the partition means, and that in such a manner that said parts of the product are in contact with the atmosphere that prevails in the product space. This aspect of the protrusions can in principle be used with any container. According to one aspect, a container for packaging products is thus provided which comprises a container body with a product space for accommodating a product and a receiving space at least for receiving liquid, preferably from the product, wherein the container body comprises partition means that separate the product space and the receiving space from each other, which partition means comprise at least one outlet opening configured for at least discharging liquid from the product space to the receiving space, wherein the part of the partition means that faces the product space defines a product support surface for the product, wherein the partition means comprise protrusions that extend toward the product space, wherein crests of said protrusions form at least part of the product support surface. In one embodiment, the protrusions that extend toward the product space form a ribbed structure, so that the outlet opening(s) will remain open and the liquid from the product can thus be discharged to the underlying receiving space without impediment. The packaged product is thus not in contact with the liquid exuded from the product. The ribbed structure also ensures that the packaged product will not rest on a flat bottom, so that a gas that may be present in the product space can flow around the packaged product, which leads to an extended storage life of the product. A more optimum separation of liquid from the product is realised if the outlet opening is spaced from the product support surface, seen in a direction toward the receiving space. Liquid can in that case flow from the product to the outlet opening via the aforesaid recesses, which form gutter elements, for example, under the influence of the force of gravity. To ensure an adequate operation of the container, in particular in order to prevent the backflow of liquid from the receiving space to the product space, it is preferable if the outlet opening is provided near a central part of the container body. The outlet opening is in particular only provided near a central part of the container body, and the partition means are free from one or more outlet openings near a circumferential wall of the container body, for example. As a result, it is ensured that the backflow of liquid from the receiving space to the public space is prevented in all positions of the container, i.e. a normal position, an inclined position and even an upside-down position. In an embodiment which provides an adequate discharge of liquid, the container comprises a multitude of outlet openings. Preferably, the openings of said multitude of outlet openings are substantially evenly spaced. It is preferable in that regard if the openings of the multitude of openings lie in substantially the same plane. In this way an even discharge of liquid over the multitude of outlet openings becomes possible. In a special embodiment, the openings of said multitude of outlet openings are arranged in an arcuate pattern, in particular a circular pattern. In an alternative embodiment, which does not form part of the invention, it is conceivable that the container body and the partition means are made of at least two parts. This makes it possible to produce the partition means separate from the container body, as a result of which the partition means, for example comprising the resistance element, will be relatively easy to produce. Once produced, the at least two parts are preferably non-detachably interconnected so as to realise the liquid-separating effect of the partition means between the receiving space and the product space. In one embodiment, the receiving space is closed by a sealing element. In one embodiment, the sealing element is provided on a side of the container body remote from the partition means. The receiving space is thus at least partially bounded by the sealing element, the partition means and a circumferential wall of the container body. In a very efficient embodiment, the sealing element is a sealing film. Said sealing film is very easy to provide on the container, for example on the container body, for which purpose an application surface for the sealing element is provided in the container body, preferably on an underside of the container. The sealing film is preferably affixed in such a manner as to provide a non-detachable seal, thus preventing undesirable opening of the receiving space. Furthermore, it is preferable to use a relatively strong sealing film, thus preventing undesirable piercing of the sealing film and thus opening of the receiving space. In an alternative embodiment, the container body comprises a bottom with a circumferential wall, wherein the sealing element is at least partially formed by the bottom of the container body. The partition means are in that case placed in the container body, in the innermost part of the circumferential wall thereof, and in such a manner that the receiving space is at least in part bounded by the circumferential wall, the bottom and the partition means. In an efficient embodiment, the partition means are provided in the form of an insert in the container body and preferably non-detachably connected thereto. To realise an adequate collection of liquid in the receiving space, the at least one outlet opening and the resistance element are spaced from the sealing element. It is noted that according to the present invention there is no longer any need for unhygienic liquid-absorbing means, such as a liquid-absorbing layer of material. The product no longer needs to be in contact with such means. The product does not come into contact with the liquid contained in the receiving space, or at least only to a reduced extent. The receiving space can thus be free from liquid-absorbing means, in particular a liquid-absorbing layer of material. In one embodiment it is conceivable, however, to nevertheless provide the receiving space with absorbing means, such as an absorbing layer of material, so as to further reduce the risk of a backflow of liquid to the product space in this manner. In packaged condition the container comprises a product contained in the product space, in particular a food product such as a fresh meat product, wherein the product space is closed by means of a further sealing element, in particular a further sealing film. The further sealing film may be configured in a manner which is known to the skilled person, wherein said sealing film can be opened by a user from a corner point of the package, for example. According to one aspect, the invention provides a method for packaging products, in particular food products, such as fresh meat products, comprising the steps of: providing a container according to the invention; placing the product in the product space of the container; closing the product space with the product placed therein, using a further sealing element. Using the method according to the invention, a container in packaged condition is thus obtained, as described in the foregoing. To realise a longer storage life, the method comprises the step of providing a modified atmosphere in the container body so as to thus at least obtain a reduced oxygen concentration in comparison with the atmosphere. The step of providing a modified atmosphere is in particular carried out so as to obtain an increased nitrogen concentration in comparison with the atmosphere. The invention will now be explained in more detail with reference to a few exemplary embodiments in conjunction with the appended figures, in which: FIGS. 1a and 2b are schematic cross-sectional views of an embodiment of a container according to the present invention in a normal position and in an upside-down position; FIGS. 2a-2h are views of a container according to a first embodiment of the container of the present invention; FIGS. 3a-3h are views of a container according to a second embodiment of the container of the present invention; FIGS. 4a and 4b are views of a container according to a third embodiment of the container of the present invention; FIGS. 5a and 5b are schematic views of a fifth embodiment of the container of the present invention; FIGS. 6a and 6b are schematic views of a sixth embodiment of the container of the present invention; FIG. 7 is a schematic view of the sixth embodiment of the container of the present invention in an upside-down position; FIG. 8 is a schematic view of the sixth embodiment of FIG. 7, on which a sealing element is provided; FIGS. 9a and 9b are schematic views of a section of the sixth embodiment of the container of the present invention; FIG. 10 is a schematic side view of the sixth embodiment of the container of the present invention; FIG. 11 is a schematic top plan view of a seventh embodiment of the container of the present invention; FIGS. 12a and 12b are schematic perspective views of the seventh embodiment of the container of the present invention; FIGS. 13a and 13b are schematic views of a section of the seventh embodiment of the container of the present invention. In the description of the figures below, identical or similar parts will consistently be indicated by the same numerals. In spite of the fact that the same numerals are used, there may be differences between the various embodiments, which will become clear upon reading the description below. For a clear understanding of the invention, reference is first made to FIGS. 1a and 1 b. These figures show a schematic sectional view of an embodiment of a container 1 according to the invention in a normal position (FIG. 1a ) and in an upside-down (in comparison with the normal position) position (FIG. 1b ). Reference is first made to FIG. 1 a. The container 1 that is shown therein comprises a container body 2 made up of a few wall parts. At an upper side of the container body 2 a product space 4 is formed, in which a product 5, for example a piece of fresh meat 5, can be stored. At a bottom side of the container body 2, a receiving space 6 for liquid is formed, which space is configured to receive liquid from the product 5. The product space 4 and the receiving space 6 are separated from each other by partition means 8 in the form of a partition 16. The partition means 8, in this case the partition 16, form part of the container body 2. The partition means are designed so that the product 5 is retained in the product space 4 and will not come into contact with the receiving space 6. In this case it is ensured that the product can be hygienically stored in the product space. The receiving space 6 is closed on the bottom side by a sealing element 31, such that the receiving space is bounded on the bottom side and on the sides by the container body 2 and the sealing element 31. The product space 4 is closed on the upper side by a further sealing element 32, for example in the form of a sealing film. In this way a closed space 4, 6 is formed in the container 1, in this case consisting of the product space 4 and the receiving space 6. The atmosphere in the closed space 4, 6 may be modified in a manner which is known per se, for example for extending the storage life of the product. A outlet opening 11 for liquid is present in the partition means 8. The outlet opening 11 is provided more or less centrally in the container 1 and is configured so that liquid, for example from the product 5 or in the form of condensation, can flow from the product space 4 to the receiving space 6, via the outlet opening 11, under the influence of the force of gravity. To facilitate this, the partition 16 may be provided with recesses 14, such as gutters 14, which extend downward in the direction of the outlet opening 11, so that liquid can readily flow toward the outlet opening 11. The partition means 8 may further comprise a number of protrusions 19 (schematically indicated here), which extend upward, into the product space 4, and which are configured to at least partially form a product support surface 17, on which the product 5 is at least partially supported. By suitably configuring the protrusions 19, free space can be created at the bottom side of the product, which has an advantageous effect on the storage properties of the product 5. Furthermore, a flow resistance element 12, also referred to as resistance element 12, is provided in the receiving space 6. In the example that is shown here, the resistance element 12 forms part of the partition means 8 and is a part of the partition 16. The flow resistance element 12 extends into the receiving space 6, surrounding the outlet opening 11. This enables the resistance element to prevent or at least reduce the flow of liquid 7 from the receiving space 6 to the product space 4, in particular in the upside-down position shown in FIG. 1 b. As shown in FIG. 1b , an internal liquid container for liquid 7 is formed in the receiving space 6, as it were, which liquid container has a bottom formed by the partition means 8, in this case specifically the partition 16, and which has walls formed by a part of the walls of the container body 2 and by the resistance element 12. The internal liquid container is disposed spaced from the outlet opening 11, so that liquid present in the internal liquid container cannot directly flow to the outlet opening 11. The resistance element 12 is arranged to surround the outlet opening 11. The internal container functions to ensure that the liquid 7 is retained within the receiving space 6 in the upside-down position of the container 1 and that the liquid cannot flow back to the product space 4 via the outlet opening 11, or at least much less easily. According to the present invention, the container 1 is thus provided with at least one resistance element 12 extending into the receiving space 6, which resistance element surrounds the outlet opening 11 in such a manner that it prevents the flow of liquid 7 from the receiving space to the product space. The resistance element 12 in particular forms walls of an internal container, which functions as such in an upside-down (in comparison with the normal situation) position. The embodiment described above with reference to FIGS. 1a and 1b is illustrative of the invention and many variants can be realised by the skilled person having read the above general description, which variants all fall within the scope of the protection sought. Thus it is in general conceivable, for example, that the internal liquid container is made up only of the partition means, in which the resistance element is incorporated. A few variants and their advantages will be discussed hereinafter. It is furthermore noted that for the sake of clarity FIGS. 1a and 1b are not drawn to scale. The product space 4 is thus shown to be relatively small in comparison with the receiving space 6. Similarly, the outlet opening 11 is shown to be relatively large. The figures to be described hereinafter will provide a better insight into the proportions between the various parts of the container 1 according to the present invention. In FIGS. 1a and 1b , the outlet opening is placed near a central part of the container body. In this way a maximum protection against backflow is obtained in nearly all positions of the container (i.e. also a sloping position, or in other words, a position between the normal position and an upside-down position, for example a position of the container in which the product space is positioned laterally beside the receiving space). It is not necessary to place the outlet openings centrally, however; other positions are conceivable. FIGS. 2a-2h are views of a first embodiment of the container 1 according to the present invention. FIG. 2a is a perspective top plan view of the container 1. The container 1 comprises a container body 2, in this case formed by a circumferential wall 2 consisting of a few wall parts. In this way a product space 4 is formed in the container body 2. On the bottom side, the product space 4 is bounded by the partition means 8 in the form of a partition 16. The partition 16 is relatively flat on the side that faces the product space 4 and in this case forms the previously described product support surface 17 on which the product can be supported. The product can for that purpose be placed in the container 1 shown here, after which the upper side of the product space 4 is closed by means of a further sealing element (not shown), for example in the form of a sealing film, which can for example be affixed to a flanged edge 41 formed on the container body 2. In the partition 16 a few outlet openings are provided—near the central part schematically indicated by the circle lb—as will be explained hereinafter with reference to FIG. 2b . Drain gutters 14 in the form of recesses 14 in the partition 16 extend over the area of the partition 16 in the direction of the outlet openings in order to thus discharge liquid from the product space 4 in a simple and efficient manner. On an outer side of the partition 16, a recess 43 extending in the circumferential direction is provided, which recess forms a ring channel for retaining liquid that is present near the walls of the container body 2. FIG. 2b shows the encircled part lb of FIG. 2a in more detail. The drain gutters 14 are shown more clearly here, which drain gutters extend to the outlet openings 11, three of which are fully shown in FIG. 2b , whilst in total six outlet openings are provided. The outlet openings 11 are provided in the drain gutters 14, at a relatively lowermost part thereof. The outlet openings 11 are arranged in a circular pattern, substantially evenly spaced and substantially in one plane. In FIG. 2b the outlet openings 11 are surrounded by walls 12, which, as will become clearer with reference to FIG. 2h , form the resistance elements 12 that prevent the flow of liquid from the receiving space 6 to the product space 4. FIG. 2c is a top plan view of the container 1, showing the configuration of the product space 4 with the partition 16 that forms a product support surface 17, with drain gutters 14 and the central outlet openings 11 provided in a circular pattern. FIG. 2d is a bottom view of the container 1 showing the receiving space 4, which is closed by a sealing element 31 in the embodiment shown here, which sealing element closes the receiving space on the bottom side, therefore. FIGS. 2e and 2f are side views of the container 1 with the container body 2, which show that the container is rectangular in shape. FIG. 2g is a cross-sectional view of the container 1 along the line X-X in FIG. 2e . This figure clearly shows that the product space 4 is relatively large and that the receiving space 6 is relatively smaller. This is possible because the amount of liquid which comes from meat products, for example, is relatively small, for example in the order of a few to a few dozen millilitres. The receiving space 6 may of course be dimensioned so that it will be capable of receiving and retaining the amount of liquid that is to be expected. The partition means 8 in FIG. 2g comprise a partition 16 which slopes slightly upwards from a bottom part of the container and subsequently extends substantially parallel to the bottom formed by the sealing element 31. The receiving space 6 is thus bounded by the bottom 31 and the partition means 8 in the form of the partition 16, rather than in part by the walls of the container body 2, as is the case in FIGS. 1a and 1 b. In this way a ring channel 43 is formed at the edges of the container, between the bottom, the partition 16 and the walls of the container body 2, which ring channel is positioned lower than the product support surface 17, so that liquid is collected on the outer side as well. This liquid can flow back onto the product, however, which in principle is undesirable. FIG. 2h shows in detail the rectangular part of the bottom of the container 1 that is indicated by the letter Y in FIG. 2g . The figure shows a recess located spaced from the central part C, in this figure indicated by numeral 12, since this recess also forms the resistance element 12 in the receiving space 6. The resistance element 12 surrounds the outlet opening and extends into the receiving space 6 in the direction of the bottom 31 of the container 1. The outlet opening is not shown very clearly in this figure, since the sectional view concerns the part just before the outlet opening. An outlet opening 11 that is located a little further away is clearly visible, however; as shown, this outlet opening 11 is spaced from the sealing element 31 by some distance, such that liquid can flow from the product space 4 to the receiving space 6 in a proper manner. As already mentioned before, drain gutters 14 are for that purpose provided in the partition 16 on the side of the product space 4, a wall of which drain gutters on the side of the receiving space form a flow resistance, as is clearly shown here. A resistance element 12 is provided for every opening 11, which resistance elements are each configured and located so that they reduce and even prevent the flow of liquid from the receiving space 6 to the product space, at least in an upside-down position of the container (in which position the receiving space 6 is located above the product space 4). FIGS. 3a-3h show an alternative embodiment of the container 1 according to the present invention. The container is practically identical to the container described with reference to FIGS. 2a -2 h; for a description of the individual FIGS. 3a-3h reference is made to the description of those figures. The main differences will be explained below. In FIG. 3a , the ring channel 43 of FIG. 2a has been exchanged for only a few recesses 47, which no longer extend along the entire circumference. Because of this, the partition means 8 in the form of the partition 16 are no longer provided as elevations on the bottom, but they are in contact with the walls of the container body 2. Such a container is relatively easy to produce, as will be explained hereinafter. FIG. 3h furthermore shows the container, which is not provided with the sealing element yet. In this figure, too, the resistance elements 12 are shown again, which resistance elements form sheet pile walls of the internal container that retains liquid within the receiving space in an upside-down position of the container in that the resistance elements extend into the receiving space, surrounding the outlet openings 11. The resistance elements extend up to a point slightly lower than the outlet openings, so that there is some distance therebetween and liquid can readily flow into the receiving space. In the embodiment shown here, the receiving space is closed by means of a sealing element in the form of a sealing film, which can be affixed to the container body near the edges 47 and which extends over the bottom side of the container and may be in contact with the lower parts of the resistance elements. This makes it readily possible to form the receiving space 6, using a sealing film, whilst the outlet openings 11 cannot undesirably be closed. The container body shown in FIGS. 3a -3 h, without the sealing film 31 and the further sealing film, is easy to produce, for example by thermoforming and/or injection moulding. Because of these aspects this embodiment is relatively easy to produce and that at low cost. FIGS. 4a and 4b show another embodiment of the container 1 according to the present invention. The container is substantially similar to the container shown in FIGS. 2 and 3. The main differences will be explained below. FIG. 4a shows that the bottom of the product space 4, which is made up of the partition means 8 in the form of the partition 16, exhibits a double curvature, i.e. the centre, indicated by a circle C here, is located lower than a part of the partition closer to the walls of the container body 2. As a result, an adequate discharge of liquid to the outlet openings 11 located near the centre C is obtained. Ribs 19 are provided on the partition, crests of which ribs form a product support surface for the product 5. The addition of ribs results in an improved contact of the product with the atmosphere prevailing inside the container 1, so that there is a good contact between the product and a preserving agent, such as nitrogen gas, for example, that is provided in the container. Drain gutters 14 are furthermore provided in the partition 16, as already described before. FIG. 4b clearly shows how the ribs 19 and the drain gutters 14 extend radially from the central part of the partition means 8. The container shown in FIGS. 4a and 4b may be provided with a sealing element, preferably in the form of a sealing film, on the bottom side for forming a receiving space on said bottom side, as already described with reference to FIG. 3. FIGS. 5a and 5b show a relatively simple embodiment of the container according to the present invention which is made of two parts, viz. a first part 21 comprising the partition means, and a second part 22 comprising the container body with the bottom 31. The first part 21 is formed as an insert 21 and comprises a wall 16 which forms a product support surface 17 on an upper side and which is provided with an outlet opening 11. On the bottom side the resistance element 12 is formed. The second part 22 is a container body comprising a bottom 31 and a circumferential wall. The first part 21 can be placed in the second part 22 as an insert and be connected thereto, in such a manner that a container comprising a receiving space 6 and a product space 4 separated from each other by the partition means in the form of the first part 21 is formed. After the product has been placed in the product space, the upper side of the container can be closed for storing the product in this manner, in particular for sales purposes. According to an alternative way of producing the container according to the invention, the container body comprising the circumferential wall of the container is formed (preferably integrally) with the partition means, for example by thermoforming or injection-moulding. Subsequently, a bottom side of the container, i.e. that part of the container which is configured to form the receiving space, can be closed by means of a sealing element, in particular a sealing film. In this way a container according to the present invention can be produced in a very efficient, simple and inexpensive manner. FIGS. 6a and 6b schematically show in perspective view (FIG. 6a ) and detail view (FIG. 6b ) a sixth embodiment of the container 1 according to the present invention. The container 1 shown in FIGS. 6-9 is essentially identical to the container 1 of FIG. 4. The main differences will be explained below. FIG. 6a shows a multitude of outlet openings 11 in the partition means 8, which extend through the partition 16 toward the receiving space 6 located therebehind (not very well visible in this figure) for draining liquid thereto. The first difference between FIG. 6a and FIG. 4a is the recess 14. Whereas in FIG. 4a said recess 14 is provided as a downwardly extending gutter 14, in FIG. 6a the partition 16 is pyramidally curved such that liquid is discharged over the continuously downwardly extending partition 16 toward the outlet openings 11. The partition 16 consists of a multitude of adjoining funnel elements 14′, as it were, with an outlet opening 11 in the central part of each final element 14′. In FIG. 6a the partition 16 is shown to be divided into a multitude of funnel elements 14′ corresponding to the multitude of outlet openings 11. In order to form a substantially flat (i.e. horizontal in use) product support surface 17, the protrusions 19 are conical in shape in FIG. 6a . Each protrusion 19 in a funnel element 14′ in FIG. 6a narrows in radial direction from the outlet opening 11. By using essentially the entire area of the partition 16 as a recess 14, a quick and effective discharge of liquid from the product 5 is realised. The fact that the product 5 in the container 1 is supported by the protrusions 19 prevents the outlet openings 11 from being enclosed by the product 5. Liquid from the product 5 can thus be discharged without impediment to the underlying receiving space 6. The packaged product 5 is thus not in contact with the liquid from the product 5, which has a positive effect as regards hygiene and the storage life of the product 5. Another advantage of the protrusions 19 of this embodiment in particular, and of all embodiments in general, is that they form a relatively small contact area with the product 5. In the prior art containers known so far, the entire underside of the products is generally in contact with the product support surface. In the container 1 according to the present invention, the product support surface 17 is formed by the protrusions 19 and thus has an interrupted aspect, so that a relatively large part of the underside of the product 5 is freely accessible to the gas mixture present in the container 1. Because this gas mixture can move around the package product 5, the preserving action thereof is enhanced. The development of bacteria is thus prevented in an effective manner. It is noted in that regard that although elongate protrusions 19 are shown in FIG. 6a , other relief structures can also be used in a container according to the present invention. Finally, FIG. 6a is different from FIG. 4a in that a ring channel 43 is provided instead of a gutter 49. Said ring channel 43 is essentially identical to the ring channel of FIG. 2 a. FIG. 6b shows a larger-scale view of the side of the partition 16 that faces the receiving space 6. FIG. 6b thus shows the bottom side of the container 1 that is shown in FIG. 6a . FIG. 6b illustrates the tapered nature of the protrusions 19. As FIG. 6b shows, protrusions 19 that extend over several funnel elements 14′ are tapered at both ends. Because FIG. 6b shows the container 1 from the bottom side, the partition 16 is curved so that in the situation shown in FIG. 6b the outlet opening 11 is located at the highest point of the partition 16. In the position of use, liquid from the product can readily flow to the outlet opening 11, therefore, because the outlet opening will be located at the lowest point in that situation. In an upside-down position, on the contrary, liquid is prevented from flowing back to the product space. FIG. 7 is a schematic view of the sixth embodiment of the container 1 according to the present invention of FIG. 6 in upside-down position. The embodiment shown in FIG. 7 essentially corresponds to the embodiment of FIG. 4, with the above-mentioned differences. The upside-down position of the container 1 in FIG. 7 shows the structure of the partition 16 as discussed with reference to FIG. 6b . FIG. 7 in particular illustrates the course of the ring channel 43 which, in use, also forms the contact surface of the container 1 with a bottom surface. The bottom surface of the ring channel 43 of FIG. 7 is located higher than the partition 16. On its inner side (i.e. on the side of the partition 16) the ring channel 43 has a stepped configuration, so that an additional edge for affixing the sealing element 31 thereto is formed (see also FIG. 8). As a result of this stepped construction, the sealing element 31 is spaced, in use, from the bottom surface on which the container 1 is placed. FIG. 7 also shows that the shape of the container body 2 with the partition means 16 is such that it can be formed as an integral unit by thermoforming, for example from PP-based or APET-based materials. Other production methods and materials are also conceivable within the scope of the present invention. FIG. 8 is a schematic view of the sixth embodiment of FIG. 7, with a sealing element 31 provided thereon. The receiving space 6 in FIG. 7 is defined by the ring channel 43 and the partition 16. FIG. 8 shows that the receiving space 6 is closed by the sealing element 31. The structure of the sealing element 31 is adapted to the choice of the material of the container body 2. Preferably, the materials of the container body 2 and the sealing element 31 are selected so that there is compatibility between the outer side of the container body 2 and the sealing element 31 where the latter is affixed to the container body 2. Preferably, a molecular fusion during the sealing process ensures the permanent integrity of the seal by the sealing element 31. Furthermore, the perforation resistance of the sealing element 31 is equal to or higher than that of the further sealing element 32. The sealing element 31 preferably guarantees barrier properties equal to or higher than the thinnest part of the, preferably thermoformed, container body 2. The choice of materials thus guarantees a perfect protection of the packaged product 5 until the date of expiry thereof. FIGS. 9a and 9b are schematic views of a section of the sixth embodiment of the container 1 of the present invention shown in FIGS. 6-8. FIGS. 9a and 9b essentially correspond to FIGS. 3g and 3h , but are different therefrom as regards the aforementioned points. FIGS. 9a and 9b show how the curvature of the partition 16 extends, so that two adjoining funnel elements 14′ are formed. Each funnel element 14′ is curved so that the lowest point thereof terminates in the outlet opening 11. In addition to that, FIGS. 9a and 9b show in side view the tapered nature of the protrusions 19. FIG. 10 is a schematic side view of the sixth embodiment of the container 1 according to the present invention. In this view the further sealing element 31 in the form of an upper film 32 is affixed to the flanged edge 41. The provision of the sealing element 31 and the further sealing element 32 on the container body 2 makes it possible to confine a product 5 in a protective atmosphere within the container 1. The container 1 is preferably used in combination with a protective atmosphere (gas flushing), in particular in the case of meat or fish products (fresh meat and fish), as known to the skilled person. FIG. 10, like the other figures, demonstrates also the strong similarity between the container 1 and the generally known meat trays. The container 1 is formed so that in the case of a container 1 according to the present invention the packaging process does not require any adaptations on the part of the producer of fresh meat/fresh fish products, whilst any adaptations as regards consumer behaviour are not necessary, either. The handling of the container 1 at a fresh meat or fresh fish packaging company can be carried out with the already existing infrastructure. In other words: the introduction of the container 1 does not require an investment from the producer. In addition to that, the similarities between the container 1 and the generally known meat trays are so strong that the consumer who comes into contact with the container 1 can continue to deal with the generally known fresh meat/fresh fish tray in the familiar way. A special advantage is the fact that the changeover to the container 1 according to the present invention does not require any additional adaptations on the part of the producer. A detailed analysis has shown that no adaptations are required as regards the following points: I. “nesting” the containers 1; II. the packaging concept in which the containers 1 are delivered to the fresh meat & fresh fish industry; III. the setup of the containers 1 on the machine and coupled thereto 1. the automatic destacking of the containers 1; 2. the manual destacking of the containers 1; IV. the filling process of he containers 1; V. the conveyor belt transport of the containers 1 (before filling and after filling); VI. the gas flushing process; VII. the application of the further sealing element 31 (printed or unprinted film); VIII. the labelling the containers 1; IX. the repackaging of the filled containers 1: 1. both via an automated process; 2. and via a manual process; X. the transport of the containers 1 from the fresh meat & fresh fish packaging company to the market (hypermarket, supermarket, local shop, public market place). A detailed consumer analysis teaches us upon introduction of the container 1 according to the present invention no adaptations in consumer behaviour are required as regards the following points: I the presentation of the container 1 at the sales points; II the use of the container 1 (from the shopping bag/trolley to the kitchen counter); III the opening of the container 1; IV the disposal of the empty container. All the above advantages at least in part result from the inventor's insight to apply the sealing element in a recessed plane relative to the lowermost plane of the container 1 and to make use of the “inside cut seal” technology upon affixing the sealing element 31 to the (preferably thermoformed) container body 2. FIG. 11 is a schematic top plan view of a seventh embodiment of the container 1 according to the present invention. FIGS. 12a and 12b are both schematic, perspective views of the seventh embodiment of the container 1 according to the present invention. Seen in top plan view (FIG. 11) or in perspective top plan view (FIG. 12a ), the container body 2 in FIG. 11 is practically identical to the container 1 of FIGS. 6-10. FIG. 12b illustrates the difference with FIGS. 6-10, viz. that the partition 16 is provided with an additional resistance element 13 on the side remote from the product space 4, which resistance element surrounds the outlet opening 11. Said additional resistance element 13 extends from the partition 16 toward the sealing element 31, up to a position spaced from the sealing element 31. Liquid from the product 5 can thus flow via the outlet opening 11, through the additional resistance element 13, into the receiving space 6. In FIG. 12b the additional resistance element 13 is an elevated edge. This embodiment is very advantageous, because this additional resistance element additionally prevents the backflow of liquid into the product space 4. FIGS. 13a and 13b are schematic views of a section of the seventh embodiment of the container 1 according to the present invention as shown in FIG. 12. FIGS. 13a and 13b illustrate how the additional resistance element 13 extends from the partition 16 up to a position spaced from the sealing element 31. The distance between the end of the additional resistance element 13 and the sealing element 31 is sufficiently large for allowing the transport of liquid from the product space 4 so as to achieve an effective discharge of liquid. In the foregoing, the invention has been described with reference to a few exemplary embodiments. The skilled person will appreciate that many modifications and alternatives are possible within the scope of the invention. The invention is not limited to these exemplary embodiments, however. The scope of the protection sought is defined by the appended claims. LIST OF REFERENCE NUMERALS 1 container 2 container body 4 product space 5 product 6 receiving space 7 liquid 8 partition means 11 outlet opening 12 resistance element 13 additional resistance element 14 recess 14′ funnel element 16 partition 17 product support surface 19 protrusions 21,22 two parts 31 sealing element 32 further sealing element 41 flanged edge 43 ring channel 45 elevated edge 47 recesses 49 channel 1. A container for packaging products, comprising a container body with a product space for accommodating a product and a receiving space at least for receiving liquid, preferably liquid from the product, wherein the container body comprises partition means that separate the product space and the receiving space from each other, which partition means comprise at least one outlet opening configured to at least discharge liquid from the product space to the receiving space, wherein the container is provided with at least one resistance element extending into the receiving space, which resistance element surrounds the outlet opening in such a manner that the resistance element prevents the transport of liquid from the receiving space to the product space, characterised in that the container body and the partition means form an integral unit. 2. A container according to claim 1, wherein the receiving space is closed by a sealing element. 3. A container according to claim 1, wherein the sealing element is a sealing film. 4. A container according to claim 2, wherein the at least one outlet opening and the resistance element are spaced from the sealing element. 5. A container according to claim 1, wherein a part of the partition means that faces the receiving space comprises the resistance element. 6. A container according to claim 2, wherein the resistance element comprises a protrusion that extends toward the receiving space. 7. A container according to claim 1, wherein a recess is provided in the part of the partition means that faces the product space. 8. A container according to claim 6, wherein; the resistance element comprises a protrusion that extends toward the receiving space; and the protrusion corresponds to the recess (14). 9. A container according to claim 7, wherein the outlet opening is provided in the recess. 10. A container according to claim 1, wherein the partition means comprise a partition having a substantially constant thickness. 11. A container according to claim 1, wherein the part of the partition means that faces the product space defines a product support surface for the product. 12. A container according to claim 11, wherein the partition means comprise protrusions that extend toward the product space, with crests of said protrusions forming at least parts of the product support surface. 13. A container according to claim 11, wherein the outlet opening is spaced from the product support surface, seen in a direction toward the receiving space. 14. A container according to claim 1, wherein the outlet opening is provided near a central part of the container body. 15. A container according to claim 1, wherein the container comprises a plurality of outlet openings, wherein the openings of said plurality of outlet openings are substantially evenly spaced. 16. A container according to claim 15, wherein the openings of the plurality of outlet openings lie in substantially the same plane. 17. A container according to claim 15, wherein the openings of said plurality of outlet openings are arranged in an arcuate or a circular pattern. 18. A container according to claim 1, wherein the receiving space is free from liquid-absorbing means, in particular free from a liquid-absorbing layer of material. 19. A container according to claim 1, wherein a food product is contained in the product space, and wherein the product space is closed by means of a further sealing element, the further sealing element including a further sealing film. 20. A method for packaging food products, comprising the steps of: providing a container according to claim 1; placing the product in the product space; closing the product space with the product placed therein, using a further sealing element. 21. A method according to claim 20, comprising the step of providing a modified atmosphere in the container body so as to obtain a reduced oxygen concentration in comparison with the atmosphere. 22. A method according to claim 21, wherein the step of providing a modified atmosphere comprises providing an increased nitrogen concentration in comparison with the atmosphere.

2015-03-04

en

2017-03-16

US-58704605-A

Ultrathin Polymer Film Using Cucurbituril Derivative and Method of Forming the Same ABSTRACT Provided are an ultrathin polymer film formed by homopolymerization or copolymerization of a cucurbituril derivative with an organic monomer and a method of forming the same. The ultrathin polymer film has a thickness of 10 nm or less, and can retain its film shape even after being separated from a substrate. CROSS REFERENCE TO RELATED APPLICATION This application is a 35 U.S.C. § 371 National Phase Entry Application from PCT/KR2005/001141, filed Apr. 21, 2005, and designating the United States. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an ultrathin polymer film using a cucurbituril derivative and a method of forming the same. More particularly, the present invention relates to an ultrathin polymer film formed by homopolymerization or copolymerization of a cucurbituril derivative with an organic monomer, and a method of forming the same. 2. Description of the Related Art Generally, blown film extrusion, calendaring, and laminating techniques have been employed to produce polymer films. Polymer films thus produced have been widely used in various fields as anti-oxidation coatings, anti-smudgy coatings, UV shielding films, hydrophobic films, packing and adhesive films, etc. In order for polymer films to be used as low dielectric films, etching resistant films, or biosensors for nanoscale semiconductor devices that have received much interest for recent years, the thickness of the polymer films must be controlled to a nano-size range. However, the above-described polymer film production techniques cannot provide polymer films with a nanoscale thickness. In this regard, the scientific and practical interests in methods of forming polymer films with a nanoscale thickness have been increased and thus extensive studies have been carried out. Currently known methods for producing polymer films with a nanoscale thickness can be largely divided into two groups: introduction of a polymer solution obtained by dissolving a polymer material in a solvent onto a substrate; and polymerization of monomers on a surface of a substrate. According to the former methods, polymer films may be formed by dip-coating or spin-coating. However, these methods do not permit the polymer films to have a high crosslinkage and a sufficiently small thickness, i.e., about 100 nanometers or less. On the other hand, polymer films produced by the latter methods are easily ruptured when separated from substrates and are difficult to be controlled to a nanoscale thickness. Meanwhile, self-assembled monolayers generally refer to molecular assemblies formed by spontaneous adsorption of specific molecules on the surfaces of substrates. In particular, molecules constituting self-assembled monolayers enable the easy and uniform introduction of specific functional groups onto the surfaces of substrates due to their directionality. Therefore, self-assembled monolayers have been widely utilized in protection of substrates against chemical materials, or in detection and analysis of biological materials, such as proteins or DNAs, through appropriate selection of functional groups of molecules constituting the self-assembled monolayers. Many attempts to produce various types of polymer films based on the above-described characteristics of self-assembled monolayers have been made for recent years. In particular, many researchers have attempted to produce ultrathin polymer films with a thickness of 5 nm or less by synthesizing molecules with UV-induced polymerizable functional groups, forming self-assembled monolayers on surfaces of substrates using the molecules, and exposing the self-assembled monolayers to UV light [J. Am. Chem. Soc. 1995, 117, 5212, Langmuir 2003, 19, 2466]. However, most currently available ultrathin polymer films cannot be separated from the surfaces of substrates. Even when the separation of ultrathin polymer films from the surfaces of substrates is possible, the ultrathin polymer films cannot retain their film shapes after the separation, which considerably restricts the application of the ultrathin polymer films. SUMMARY OF THE INVENTION The present invention provides an ultrathin polymer film using a cucurbituril derivative and a method of forming the same. According to an aspect of the present invention, there is provided an ultrathin polymer film obtained by polymerization of a cucurbituril derivative represented by the following formula 1: wherein X is O, S, or NH; A1 and A2 are each independently OR, SR, or NHR where R is an unsubstituted or substituted alkenyl group of C2-C20 with an unsaturated bond end; and n is an integer from 4 to 20. The C═X group of the cucurbituril derivative binds with Y of a substrate represented by the following formula 2: wherein M is Au, Ag, SiO2, or SiOH; X's are each independently S, (CH3O)3—Si—, (CH3CH2)3—Si—, SO2—, or CO2—; Ys are each independently an alkyl group of C2-C30 end-substituted by —N+(R′)(R″)(R″) or —N(R′)(R″) where R′, R″, and R″ are each independently hydrogen or an alkyl group of C1-C20. According to another aspect of the present invention, there is provided an ultrathin polymer film obtained by copolymerization of a cucurbituril derivative represented by the following formula 1 and an organic monomer having a substituted or unsubstituted alkenyl group of C3-C30: wherein X is O, S, or NH; A1 and A2 are each independently OR, SR, or NHR where R is an unsubstituted or substituted alkenyl group of C2-C20 with an unsaturated bond end; and n is an integer from 4 to 20. According to yet another aspect of the present invention, there is provided a method of forming an ultrathin polymer film, including: (a) dissolving a cucurbituril derivative represented by the following formula 1 in an organic solvent to prepare a solution; (b) immersing a substrate with a self-assembled layer in the solution; and (c) polymerizing the resultant obtained by the step (b): wherein X is O, S, or NH; A1 and A2 are each independently OR, SR, or NHR where R is an unsubstituted or substituted alkenyl group of C2-C20 with an unsaturated bond end; and n is an integer from 4 to 20. The method may further include immersing the substrate in a solution obtained by dissolving an organic monomer with a substituted or unsubstituted alkenyl group of C3-C30 in an organic solvent before operation (c). Operation (c) may be performed in the presence of a polymerization catalyst. BRIEF DESCRIPTION OF THE DRAWINGS The above and other features and advantages of the present invention will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings in which: FIG. 1 is a diagram illustrating a process of forming an ultrathin polymer film according to an embodiment of the present invention; FIG. 2 is a scanning electron microscopic (SEM) image of an ultrathin polymer film obtained using allyloxycucurbit[6]uril according to Example 1 of the present invention; FIG. 3 is an enlarged SEM image of a region shown in FIG. 2; FIG. 4 is a SEM image of an ultrathin polymer film obtained using allyloxycucurbit[6]uril according to Example 2 of the present invention; and FIG. 5 is a SEM image of an ultrathin polymer film obtained using allyloxycucurbit[6]uril according to Example 3 of the present invention. DETAILED DESCRIPTION OF THE INVENTION Hereinafter, the present invention will be described in more detail. The present invention provides an ultrathin polymer film using a cucurbituril derivative represented by the following formula 1 and a method of forming the same. The ultrathin polymer film is obtained by polymerization of the cucurbituril derivative. A C═X group, e.g., a carbonyl group, of the cucurbituril derivative, binds with a carbonyl-reactive end functional group of a self-assembled monolayer on a substrate. The substrate may be a substrate represented by the following formula 2, and Y of the substrate binds with a carbonyl group of the cucurbituril derivative. wherein X is O, S, or NH; A1 and A2 are each independently OR, SR, or NHR where R is an unsubstituted or substituted alkenyl group of C2-C20 with an unsaturated bond end; and n is an integer from 4 to 20. Examples of OR include allyloxy, acryloxy, and alkenyloxy, examples of SR includes allylsulfido, acrylsulfido, and alkenylsulfido, and examples of NHR include allylamine, acrylamine, and alkenylamine. wherein M is Au, Ag, SiO2, or SiOH; X's are each independently S, (CH3O)3—Si—, (CH3CH2)3—Si—, SO2—, or CO2—; Ys are each independently an alkyl group of C2-C30 end-substituted by —N+(R′)(R″)(R″) or —N(R′)(R″) where R′, R″, and R″ are each independently hydrogen or an alkyl group of C1-C20. In the formula 2, examples of Y include alkyl ammonium, alkyl(monomethyl ammonium), alkyl(dimethyl ammonium), and alkyl(trimethyl ammonium). In the substrate represented by the formula 2, molecules represented by X′-Y form a self-assembled monolayer on the substrate. The thickness of an ultrathin polymer film formed according to the present invention is 50 nm or less, in particular 1 to 10 nm. Cucurbituril derivatives are macrocyclic compounds having a strong interaction with various compounds due to the presence of hydrophilic and hydrophobic cavities. In particular, the cucurbituril derivatives have carbonyl groups on the entrance of the cavities, and thus exhibit a strong interaction with various ionic compounds and high polarity compounds by charge-polarity interactions, polarity-polarity interactions, or hydrogen bonds. In particular, it is known that an ammonium functional group strongly interacts with the cavities of the cucurbituril derivatives. Therefore, the cucurbituril derivatives have retention capacity for various compounds, for example, organic compounds such as gaseous compounds, aliphatic compounds, and aromatic compounds, insecticides, herbicides, amino acids, nucleic acids, ionic compounds, metal ions, or organic metal ions. Examples of hydroxycucurbiturils and their parent cucurbiturils used as synthetic materials for the curcurbituril derivative of the formula 1 are disclosed together with their structural formulae and synthetic methods in Korean Patent Application Nos. 02-68362, 02-318, 01-57573, 01-39756, and 00-33026, filed by the present applicants, the disclosures of which are incorporated herein by reference in their entireties. FIG. 1 is a diagram illustrating a process of forming an ultrathin polymer film according to an embodiment of the present invention. Referring to FIG. 1, an Au substrate is immersed in a chloroform solution containing allyloxycucurbit[6]uril, followed by polymerization and separation from the substrate to obtain an ultrathin polymer film according to the present invention. The present invention also provides an ultrathin polymer film formed by copolymerization of a cucurbituril derivative and an organic monomer. The organic monomer may be an organic monomer with a substituted or unsubstituted alkenyl end group of C3-C30. Examples of the organic monomer include, but are not limited to, styrene, acrylic acid, methacrylic acid, vinylpyrrolidinone, alkyl acrylate (e.g., methyl acrylate, ethyl acrylate), divinylbenzene, acrylamide, mixtures and combinations thereof. The above-described ultrathin polymer films can be produced as follows. First, a cucurbituril derivative represented by the formula 1 is dissolved in an organic solvent to prepare a solution. At this time, it is preferable to adjust the concentration of the solution to a range from 0.0001 to 0.1 M, in particular about 0.001 M. The organic solvent may be a solvent capable of dissolving the cucurbituril derivative. For example, the organic solvent may be, but is not limited to, chloroform, dimethylsulfoxide, methanol, acetonitrile, or a combination thereof. Next, a substrate with a self-assembled monolayer, which is represented by the formula 2, is immersed in the cucurbituril derivative-containing solution. Preferably, the time required for the immersing may be 20 hours or longer, in particular 20 to 200 hours. Preferably, the substrate is washed several times with a organic solvent after being immersed in the solution for a predetermined time. At this time, the organic solvent may be the same organic solvent as used to dissolve the cucurbituril derivative. The resultant substrate thus obtained is immersed in a mixture of a catalyst and a solvent for polymerization. During this polymerization reaction, unsaturated groups in the cucurbituril derivative are polymerized. For example, when allyloxycucurbituril is used as the cucurbituril derivative, polymerization of allyl groups occurs. The temperature for the polymerization may vary according to the types of the catalyst and the cucurbituril derivative, but may be in the range from 10 to 40° C. Preferably, the time required for immersing the substrate in the catalyst-containing mixture may be 60 hours or longer, in particular 60 to 600 hours. After the immersion, it is preferable to wash the substrate with an organic solvent. Here, the solvent mixed with the catalyst and the organic solvent for washing may be toluene, benzene, xylene, or the like. The catalyst may be, but is not limited to, a Grubbs catalyst, a radical initiator, or a combination thereof. Examples of the radical initiator include, but are not limited to, AIBN (2,2′-azobisisobuyronitrile), K2S2O8, (NH4)2S2O8, benzoyl peroxide, and a combination thereof. When the radical initiator is used as the catalyst, the substrate is immersed in a catalyst solution, followed by UV irradiation for photopolymerization. The catalyst is used in an amount of 0.01 to 10 moles based on 1 mole of the cucurbituril derivative. If the content of the catalyst is less than 0.01 moles, the polymerization may be retarded. On the other hand, if it exceeds 10 moles, removal of the catalyst from an ultrathin polymer film may be difficult. Preferably, the concentration of the mixture of the catalyst and the solvent is in the range from 0.0001 to 0.1 M, in particular about 0.001 M. The thickness of the ultrathin polymer film formed on the substrate can be measured using an ellipsometer. Finally, a stripper is dropwise added onto the ultrathin polymer film formed on the substrate to separate the ultrathin polymer film from the substrate. Here, the stripper may be selected according to the type of an end functional group of the substrate. For example, the stripper may be an aqueous alkaline solution such as a 1N sodium hydroxide solution. The thus-separated ultrathin polymer film can be identified using a scanning electron microscope. When an ultrathin polymer film according to the present invention is formed by copolymerization of a cucurbituril derivative represented by the formula 1 and an organic monomer with a substituted or unsubstituted alkenyl end group of C3-C30, the above-described method may further include immersing the substrate in a solution (A) obtained by dissolving the organic monomer in an organic solvent prior to the immersing the substrate in the catalyst-solvent mixture. At this time, there is no limitation to the organic solvent provided that it can dissolve the organic monomer. For example, chloroform or acetonitrile may be used. Preferably, the concentration of the solution (A) may be in the range from 0.0001 to 0.1 M, in particular about 0.001 M. Preferably, the time required for immersing the substrate in the solution (A) may be 20 hours or longer, in particular 20 to 200 hours. The organic monomer with a substituted or unsubstituted alkenyl end group of C3-C30 may be used in an amount of 0.01 to 1,000 moles, preferably 1 to 120 moles based on 1 mole of the cucurbituril derivative of the formula 1. If the content of the organic monomer is outside the above range, effective synthesis of a copolymer may be difficult. After being immersed in the organic monomer-containing solution, the substrate is preferably washed with the same pure organic solvent as used to dissolve the organic monomer. Preferably, a copolymer obtained by copolymerization of a cucurbituril derivative represented by the formula 1 and an organic monomer with a substituted or unsubstituted alkenyl end group of C3-C30 may be represented by the following formula 3: wherein R is an alkyl group of C1-C20, an allyl group, or an aryl group of C6-C20, m is an integer from 1 to 10, and n is an integer from 10 to 1,000. A polymer constituting an ultrathin polymer film according to the present invention has a weight average molecular weight of 20,000 to 2,000,000, and a degree of polymerization of 10 to 1,000. Hereinafter, the present invention will be described more specifically with reference to the following examples. The following examples are for illustrative purposes and are not intended to limit the scope of the invention. EXAMPLE 1 Formation of Ultrathin Polymer Film by Polymerization of allyloxycucurbit[6]uril in the Presence of Grubbs Catalyst 20 mg of a cucurbituril derivative represented by the formula 1 where X is O, A1 and A2 are allyloxy, and n is 6 was dissolved in 10 ml of chloroform to prepare a cucurbituril derivative solution. A substrate (1 cm×2 cm in size) represented by the formula 2 where M is Au, X′ is S, and Y is ethyl ammonium was immersed in the cucurbituril derivative solution for 20 hours. Then, the substrate washed three times with 10 ml of chloroform, dried in vacuum, and immersed for 60 hours in a solution obtained by dissolving 1 mg of a Grubbs catalyst in 10 ml of toluene. Then, the substrate washed three times with 10 ml of toluene. The examination of a thus-formed ultrathin polymer film using external reflection infrared spectroscopy showed that the ultrathin polymer film was composed of the cucurbituril derivative. Further, the thickness of the ultrathin polymer film measured using an ellipsometer was about 2 nm (±0.5 nm). The optical microscopic image and SEM image showed that the ultrathin polymer film can retain its film shape even after being separated from the substrate treated with a 1N sodium hydroxide solution (see FIGS. 2 and 3). EXAMPLE 2 Formation of Ultrathin Polymer Film by Polymerization of allyloxycucurbit[6]uril in the Presence of Radical Initiator 20 mg of a cucurbituril derivative represented by the formula 1 where X is O, A1 and A2 are allyloxy, and n is 6 was dissolved in 10 ml of chloroform to prepare a cucurbituril derivative solution. A substrate (1 cm×2 cm in size) represented by the formula 2 where M is Au, X′ is S, and Y is ethyl ammonium was immersed in the cucurbituril derivative solution for 20 hours. Then, the substrate washed three times with 10 ml of chloroform, dried in vacuum, immersed in a solution obtained by dissolving 1 mg of AIBN in 10 ml of toluene, and exposed to UV for 12 hours. Then, the substrate washed three times with 10 ml of toluene. A 1N sodium hydroxide solution was dropwise added onto the resultant substrate to separate an ultrathin polymer film formed on the substrate. The ultrathin polymer film was identified using an optical microscope and a scanning electron microscope. The thickness of the ultrathin polymer film measured using an ellipsometer was about 2 nm (±0.5 nm). The optical microscopic image and SEM image showed that the ultrathin polymer film can retain its film shape even when being separated from the substrate treated with a 1N sodium hydroxide solution (see FIG. 4). EXAMPLE 3 Formation of Ultrathin Polymer Film by Copolymerization of allyloxycucurbit[6]uril and Acrylic Acid 20 mg of a cucurbituril derivative represented by the formula 1 where X is O, A1 and A2 are allyloxy, and n is 6 was dissolved in 10 ml of chloroform to prepare a cucurbituril derivative solution. A substrate (1 cm×2 cm in size) represented by the formula 2 where M is Au, X′ is S, and Y is ethyl ammonium was immersed in the cucurbituril derivative solution for 20 hours. The substrate washed three times with 10 ml of chloroform, dried in vacuum, and immersed for 30 hours in a 1M solution obtained by dissolving acrylic acid in chloroform. Then, the substrate washed three times with 10 ml of chloroform, dried in vacuum, immersed in a solution obtained by dissolving 1 mg of AIBN in 10 ml of toluene, and exposed to UV for 12 hours. Then, the substrate washed three times with 10 ml of toluene. A 1N sodium hydroxide solution was dropwise added onto the substrate to separate an ultrathin polymer film formed on the substrate. The ultrathin polymer film was identified using an optical microscope and a scanning electron microscope (see FIG. 5). As described above, an ultrathin polymer film according to the present invention is obtained by homopolymerization or copolymerization of a cucurbituril derivative with an organic monomer. The ultrathin polymer film has a thickness of 10 nm or less and can retain its film shape even after being separated from a substrate. Therefore, the ultrathin polymer film can be used in various fields. 1. An ultrathin polymer film obtained by polymerization of a cucurbituril derivative represented by the following formula 1: wherein X is O, S, or NH; A1 and A2 are each independently OR, SR, or NHR where R is an unsubstituted or substituted alkenyl group of C2-C20 with an unsaturated bond end; and n is an integer from 4 to 20. 2. The ultrathin polymer film of claim 1, wherein the C═X group of the cucurbituril derivative binds with Y of a substrate represented by the following formula 2: wherein M is Au, Ag, SiO2, or SiOH; X's are each independently S, (CH3O)3—Si—, (CH3CH2)3—Si—, SO2 −, or CO2 −; and Ys are each independently an alkyl group of C2-C30 end-substituted by —N+(R′)(R″)(R″) or —N(R′)(R″) where R′, R″, and R″ are each independently hydrogen or an alkyl group of C1-C20. 3. An ultrathin polymer film obtained by copolymerization of a cucurbituril derivative represented by the following formula 1 and an organic monomer with a substituted or unsubstituted alkenyl group of C3-C30: wherein X is O, S, or NH; A1 and A2 are each independently OR, SR, or NHR where R is an unsubstituted or substituted alkenyl group of C2-C20 with an unsaturated bond end; and n is an integer from 4 to 20. 4. The ultrathin polymer film of claim 3, wherein the organic monomer is used in an amount of 0.01 to 1,000 moles based on 1 mole of the cucurbituril derivative of the formula 1. 5. The ultrathin polymer film of claim 3, wherein the C═X group of the cucurbituril derivative binds with Y of a substrate represented by the following formula 2: wherein M is Au, Ag, SiO2, or SiOH; X's are each independently S, (CH3O)3—Si—, (CH3CH2)3—Si—, SO2 −, or CO2 −; and Ys are each independently an alkyl group of C2-C30 end-substituted by —N+(R′)(R″)(R″) or —N(R′)(R″) where R′, R″, and R″ are each independently hydrogen or an alkyl group of C1-C20. 6. The ultrathin polymer film of claim 1, wherein in the cucurbituril derivative, X is NH, A1 and A2 are each an allyloxy group, and n is 6. 7. The ultrathin polymer film of claim 1, which has a thickness of 10 nm or less. 8. The ultrathin polymer film of claim 3, wherein the organic monomer is styrene, acrylic acid, methacrylic acid, vinylpyrrolidinone, alkyl acrylate, divinylbenzene, acrylamide, a mixture or combination thereof. 9. A method of forming an ultrathin polymer film, comprising: (a) dissolving a cucurbituril derivative represented by the following formula 1 in an organic solvent to prepare a solution; (b) immersing a substrate with a self-assembled layer in the solution; and (c) polymerizing the resultant obtained by the step (b), wherein X is O, S, or NH; A1 and A2 are each independently OR, SR, or NHR where R is an unsubstituted or substituted alkenyl group of C2-C20 with an unsaturated bond end; and n is an integer from 4 to 20. 10. The method of claim 9, wherein the substrate with the self-assembled layer is represented by the following formula 2: wherein M is Au, Ag, SiO2, or SiOH; X's are each independently S, (CH30)3—Si—, (CH3CH2)3—Si—, SO2 −, or CO2 −; and Ys are each independently an alkyl group of C2-C30 end-substituted by —N+(R′)(R″)(R″) or —N(R′)(R″) where R′, R″, and R″ are each independently hydrogen or an alkyl group of C1-C20. 11. The method of claim 9, further comprising immersing the substrate in a solution obtained by dissolving an organic monomer with a substituted or unsubstituted alkenyl group of C3-C30 in an organic solvent before (c). 12. The method of claim 11, wherein the organic monomer is used in an amount of 0.01 to 1,000 moles based on 1 mole of the cucurbituril derivative of the formula 1. 13. The method of claim 11, wherein the organic solvent is at least one selected from the group consisting of chloroform and acetonitrile. 14. The method of claim 9, wherein (c) is performed in the presence of a polymerization catalyst. 15. The method of claim 14, wherein the polymerization catalyst is at least one selected from the group consisting of a Grubbs catalyst and a radical initiator. 16. The method of claim 15, wherein the radical initiator is at least one selected from the group consisting of AIBN, K2S2O8, (NH4)2S2O8, and benzoyl peroxide. 17. The method of claim 9, wherein the organic solvent is at least one selected from the group consisting of chloroform, dimethylsulfoxide, methanol, and acetonitrile. 18. The method of claim 10, wherein in the formula 2, M is Au, X is S, and Y is —CH2CH2NH4 + or —CH2 CH2CH2NH4 +.

2005-04-21

en

2007-09-27

US-201514746704-A

Biosynchronous transdermal drug delivery ABSTRACT Systems and methods for synchronizing the administration of compounds with the human body&#39;s natural circadian rhythms and addiction rhythms to counteract symptoms when they are likely to be at their worst by using an automated and pre programmable transdermal or other drug administration system. CROSS REFERENCE TO RELATED APPLICATIONS This application is a continuation of U.S. patent application Ser. No. 14/162,156 filed on Jan. 23, 2014, which is a continuation of U.S. patent application Ser. No. 11/162,517 filed on Sep. 13, 2005, now abandoned, which claims the benefit of U.S. Provisional Application No. 60/609,418 filed on Sep. 13, 2004 which are incorporated herein by reference. This application also relates to PCT application No. PCT/IB2004/002947 entitled Transdermal Drug Delivery Method and System filed on Sep. 13, 2004 which is incorporated herein by reference. FIELD OF THE INVENTION The present invention relates, in general, to controlled drug delivery methods and systems, and, more specifically, to systems and methods for bisynchronous transdermal drug delivery in which drugs, pharmaceuticals, and other bioactive substances are delivered transdermally into a body in a manner that is synchronized with biological processes and/or biological rhythms so as to improve performance of the substance in the body. RELEVANT BACKGROUND In the field of drug delivery, it is recognized that supplying the drug in a correct temporal pattern is an important attribute of any drug delivery methodology. Controlled release drug delivery systems are intended to improve response to a drug and/or lessen side effects of a drug. The term “controlled release” refers generally to delivery mechanisms that make an active ingredient available to the biological system of a host in a manner that supplies the drug according to a desired temporal pattern. Controlled release drug delivery may be implemented using instantaneous release systems, delayed release systems, and sustained release systems. In most cases, controlled release systems are designed to maintain a sustained plasma level of an active ingredient in a drug within a human or animal host over a period of time. Instantaneous release refers to systems that make the active ingredient available immediately after administration to the biosystem of the host. Instantaneous release systems include continuous or pulsed intravenous infusion or injections. Such systems provide a great deal of control because administration can be both instantaneously started and stopped and the delivery rate can be controlled with great precision. However, the administration is undesirably invasive as they involve administration via a puncture needle or catheter. ‘Delayed release’ refers to systems in which the active ingredient made available to the host at some time after administration. Such systems include oral as well as injectable drugs in which the active ingredient is coated or encapsulated with a substance that dissolves at a known rate so as to release the active ingredient after the delay. Unfortunately, it is often difficult to control the degradation of the coating or encapsulant after administration and the actual performance will vary from patient to patient. Sustained Release generally refers to release of active ingredient such that the level of active ingredient available to the host is maintained at some level over a period of time. Like delayed release systems, sustained release systems are difficult to control and exhibit variability from patient to patient. Due to the adsorption through the gastrointestinal tract, drug concentrations rise quickly in the body when taking a pill, but the decrease is dependent on excretion and metabolism, which cannot be controlled. In addition, the adsorption through the gastrointestinal tract in many cases leads to considerable side effects (such as ulcers), and can severely damage the liver. Transdermal drug delivery has developed primarily for sustained release of drugs in situations where oral sustained release systems are inadequate. In some cases, drugs cannot be effectively administered orally because the active ingredients are destroyed or altered by the gastrointestinal system. In other cases the drug may be physically or chemically incompatible with the coatings and/or chelating agents used to implement sustained release. In other cases a transdermal delivery system may provide sustained release over a period of days or weeks whereas orally administered drugs may offer sustained performance over only a few hours. A wide variety of active substances can be delivered through transdermal systems so long as the active substance can be provided in a form that can cross the skin barrier. In most cases transdermal delivery systems are passive, taking the form of a patch that is adhesively attached to the host. The patch includes a quantity of the active substance, along with a suitable carrier if need be, absorbed in a sponge or similar system. Once applied, the active ingredient diffuses into the host through the skin at a rate determined by the concentration of the active substance and the diffusivity of the active substance. However, a variety of physical and chemical processes at the skin/patch boundary affect the delivery rate and may eventually inhibit drug delivery altogether. Active transdermal delivery systems have been developed to help regulate the delivery rate by providing mechanisms to improve drug delivery over time by “pumping” the active ingredient. One such system is described in U.S. Pat. No. 5,370,635 entitled “DEVICE FOR DELIVERING A MEDICAMENT” which describes a system for delivering a medicament and dispensing it to an organism for a relatively long period of time, for example at least a few days. The device can be adapted for positioning on the surface of the skin of a human or possibly an animal body in order to apply a medicament thereto from the outer side thereof. Conventional transdermal systems circumvent the disadvantages of the adsorption through the gastrointestinal tract, but they do not optimize or tailor the dosing regiment to offset peak symptoms. In addition the constant transdermal delivery of a drug can lead to severe side effects, including debilitating sleep disorders and ever increasing tolerance. Timed delivery is most often used to maintain a sustained level of a drug in the body. A significant focus of current research in drug delivery has been to determine the influence of a patient's circadian or other biological rhythms on drug efficacy and efficiency. This research demonstrates that certain disease symptoms follow a daily pattern, with peak symptoms at certain times of the day. It has been widely acknowledged that hormones, neurotransmitters and other intra-body compounds are released in different amounts at different times of the day pursuant to daily patterns. The Wall Street Journal reported on May 27, 2003 that “Doctors are increasingly looking at the clock when it comes to prescribing medicine, instructing patients not only to what drug to use but also precisely when to take it. The new approach stems from a growing body of research that demonstrates that certain diseases tend to get worse at certain times of the day, By synchronizing medications with a patient's body clock, many physicians believe that the drugs will work more effectively and with fewer side effects. In some cases, the improvements have been so pronounced that doctors have been able to reduce dosages.” Similarly, American Pharmacy reports that “Circadian physiologic processes alter drug absorption, distribution, metabolism, and excretion. As a result, drug doses need to be adjusted to meet the differing needs of target organs or tissues at various times of the day.” See, L. Lamberg, American Pharmacy, 1991; N831(11): 20-23. Doctors have responded to this growing body of research by prescribing a carefully timed drug administration regimen to optimize treatment. Recently, an orally administered drug for arthritis treatment has suggested a chronotherepeutic approach using a delay release system where the delay is scheduled to release the active ingredient at the beginning of an interleukin 6 cascade that is believed to cause early morning stiffness in rheumatoid arthritis patients. By attempting to synchronize the drug delivery with a biological cycle it is believed that low doses may be used to achieve desired results. However, this system does not overcome the limitations of delayed release systems described above. Although it is possible to meet the requirements of chronopharmacology with pills, this requires an enormous amount of discipline by the patient to comply with the treatment regiment. As illustrated above, to achieve optimal results, many patients may need to wake up during the night to take their medication. Hence, what is needed is a reliable means of delivering multiple drugs in precisely timed and measured doses-without the inconvenience and hazard of injection, yet with improved performance as compared to orally-delivered drugs. Currently, patient compliance (taking the proper dosages at the prescribed times) is a critical problem facing caregivers and pharmaceutical firms alike. Studies show that only about half of patients take medications at the times and in the dosages directed by their physician. It is reported that each year, 125,000 deaths and up to 20% of all hospital and nursing home admissions result from patient non-compliance. It is estimated that non-compliance results in additional healthcare costs in excess of $100 billion per year in United States. These figures are even more pronounced for the elderly. Hence, a need exists for systems and methods that increase patient compliance for administration of a variety of drugs. Additional advantages and novel features of this invention shall be set forth in part in the description that follows, and in part will become apparent to those skilled in the art upon examination of the following specification or may be learned by the practice of the invention. The advantages of the invention may be realized and attained by means of the instrumentalities, combinations, compositions, and methods particularly pointed out in the appended claims. SUMMARY OF THE INVENTION Briefly stated, the present invention involves synchronizing the administration of compounds with the human body's natural circadian rhythms and addiction rhythms to counteract symptoms when they are likely to be at their worst by using an automated and pre programmable transdermal or other drug administration system. Specifically, this invention describes a method to maximize the efficiency of compound administration, decrease negative side effects and increase the efficacy of pharmacological therapy by synchronizing and tailoring the administration of certain compounds to match these circadian rhythms. Thus based on an analysis of the human body's circadian rhythms, the invention delivers varying dosages at varying times, pursuant to a pre-programmed dosage profile. This ensures that peak drug concentrations are present in the bloodstream to offset peak disease and addiction symptoms arising from variances and fluctuation in the body's natural circadian rhythms. Further, these methods ensure that less of a drug is in the bloodstream when disease and addiction symptoms are at their lowest. The present invention describes methods for treating diseases, addictions and disorders in humans. These methods involve synchronizing and tailoring the administration of compounds with the body's natural circadian rhythms to counteract symptoms when they are likely to be at their worst by using an automated and pre programmable transdermal drug administration system. More specifically, these methods synchronize and tailor drug administration to the human body's circadian rhythms to deliver varying dosages at varying times. This ensures that peak drug concentrations are present in the bloodstream to offset peak disease and addiction symptoms arising from variances and fluctuation in the body's natural circadian rhythms. Further, these methods ensure that less of a drug is in the bloodstream when disease and addiction symptoms are at their lowest. This minimizes negative side effects, and increases efficacy of the dosing regimen. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 shows an exemplary device useful for implementing the present invention; FIG. 2A and FIG. 2B illustrate comparative drug release profiles demonstrating operation of the present invention; FIG. 3 is a schematic illustration of a drug delivery device in accordance with the present invention; FIG. 4 is a schematic illustration of an alternative drug delivery device in accordance with the present invention FIG. 5 shows an exemplary administration profile for a stimulant delivery system; FIG. 6 shows an exemplary administration profile for a nicotine delivery system; FIG. 7 shows an exemplary administration profile for a nitroglycerine delivery system tailored to treat variant angina attacks; and FIG. 8 illustrates an exemplary administration profile for a nitroglycerine delivery system tailored to treat stress-induced angina attack. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The reality of circadian rhythms in animals including humans is well known. Biological rhythms are periodic fluctuations in biological characteristics over time, which also include circadian as well as seasonal variations. Circadian, or approximately 24-hour, rhythms include the production of biological molecules such as cortisol and adrenaline, the regulation of body temperature and heart rate, changes in characteristics of blood, such as stickiness, and behaviors such as wakefulness, sleep and periods of activity. Research demonstrates that certain disease symptoms follow a daily pattern, with peak symptoms at certain times of the day. It has been widely acknowledged that hormones, neurotransmitters and other intra-body compounds are released in different amounts at different times of the day pursuant to daily patterns. It is believed that the failure of current transdermal systems to synchronize drug administration with the body's natural rhythms often lead to (i) severe side effects, including debilitating sleep disorders (in the context of nighttime nicotine administration, for example), (ii) ever increasing tolerance (in the case of nitroglycerin and other pharmaceuticals for example), (iii) more expensive therapies, since more of a compound is needed since body rhythm tailored dosing is not implemented. In addition, many addictions follow a daily pattern consistent with one's circadian rhythms. For example, according to studies performed, immediately upon waking, smoker's have peak nicotine cravings. These peak cravings return after each meal, due to the interplay of serotonin release as a trained response to the culmination of a meal. Our methods precisely time the administration of drugs so that they reach peak levels when symptoms are likely to be at their worst, and efficacy is greatly improved. The present invention involves precisely timing the administration of drugs so that they reach peak levels in synchronization with times when symptoms are likely to be at their worst, or times at which the drugs are believed to be more effective in the body and/or better tolerated by the patient. The present invention is described in terms of a particular example drug delivery system that provides automated and precise control over dosing, with single-dose capability, (once while people sleep) or capability to administer separate and varying-sized doses many times throughout a multiple day period. The particular implementation is consistent with a commercial development of a miniaturized, automated and programmable non-invasive drug delivery system called the ChronoDose™ system being developed by the assignee of the present invention. The system enables controlling of the amount of drug exposed to the skin in a controlled time dependent way according to a programmed administration schedule that implements a desired dosage profile. In this manner the present invention enables one to precisely control and vary the time of drug release and the amount of each dose, pursuant to an easily set pre-programmed dosage profile. Research demonstrates that for certain symptoms, conditions and diseases, drug effects can be optimized when administered in a defined (and often varying) dosage at predefined times. This is known as Chrono-Pharmacology. To illustrate the importance of Chrono-Pharmacology consider the following facts: Asthma attacks are 100 times more likely between 4:00 and 6:00 AM. Heart attacks and strokes are most likely to occur around 6:00 AM. Variant Angina attacks occur 30 times more often in the middle of the night between 2:00 AM and 4:00 AM. Smokers experience the highest cravings immediately upon waking up. Lethargy and difficulty getting out of bed is highest immediately upon waking up early in the morning. Cold and flu symptoms peak during night time and early morning hours, when cold medications are wearing off. In accordance with the present invention, substances with proven or suspected chrono-pharmacological efficiency are integrated into a miniaturized, automated, programmable watch-like device, such as device 100 shown in FIG. 1. The delivery system 100 shown in FIG. 1 can be used for a variety of active compositions, and is small, fully automated and programmable. This system consists of a re-usable wristwatch-like device 101 to control the time and dosage of drug delivery; and a small, disposable, ‘reservoir’ 103, which is about the size of a quarter or ½ dollar coin in a particular example, that the user can simply pop-in to place on the watch-like platform. This reservoir patch lasts, for example, up to 72 hours, depending on the application. Shorter and longer reservoir lifetimes are contemplated. The device is readily adapted to be worn on the forearm, ankle, or other convenient body location. In a particular application the replaceable reservoir can include a description of an administration schedule that can be used to manually or automatically program device 100 with an administration schedule. For example, written schedule can be printed on or affixed to the reservoir 101 or electrically programmed using volatile or non-volatile memory. In this manner a dosing profile can be prescribed and filled by a pharmacy in much the same manner as a conventional drug prescription is handled today. An exemplary implementation shown in FIG. 3 comprises a collapsible drug reservoir, an expandable waste reservoir, a micro-pump, electronics for automation, a display, and a highly permeable membrane. An exemplary system is described in a PCT application No. PCT/IB2004/002947 entitled TRANSDERMAL DRUG DELIVERY METHOD AND SYSTEM filed on Sep. 13, 2004 which is incorporated herein by reference. The drug reservoir will contain about 3 ml of drug formulation. A tiny, miniaturized pump is activated at pre-programmed times and releases a pre-defined amount of drug formulation into the drug chamber, where the formulation comes into contact with highly permeable membrane. This membrane rests on the skin, and provides for even diffusion of the drug over the device's drug absorption surface area. This membrane works effectively with, and can be coated with, an adhesive. In operation, when the administration of the drug needs to be discontinued, the remaining drug formulation is either removed from the membrane area via a waste chamber, containing a hydrophilic substance (hydrogel) or the device is taken off. In an implementation shown in FIG. 4, a pressurized drug reservoir is used which minimizes or eliminates need for a micropump. Electronics control a valve that allows controlled quantities of the drug to be applied to the drug chamber where the formulation comes into contact with highly permeable membrane. The construction and use of transdermal patches for the delivery of pharmaceutical agents is known. See, for example, U.S. Pat. No. 5,370,635 entitled “DEVICE FOR DELIVERING A MEDICAMENT” the disclosure of which is incorporated herein by reference. Such patches may be constructed using a saturated media, pressurized reservoirs, or unpressurized reservoirs with micropumps for continuous, pulsatile, or on-demand delivery of an active material. For example, a pharmaceutically acceptable composition of an active material may be combined with skin penetration enhancers including, but not limited to, oleic acid, amino acids, oleyl alcohol, long chain fatty acids, propylene glycol, polyethylene glycol, isopropanol, ethoxydiglycol, sodium xylene sulfonate, ethanol, N-methylpyrrolidone, laurocapram, alkanecarboxylic acids, dimethylsulfoxide, polar lipids, N-methyl-2-pyrrolidone, and the like, which increase the permeability of the skin to the active material and permit the active material to penetrate through the skin and into the bloodstream. Pharmaceutically acceptable compositions may be combined with one or more agents including, but not limited to, alcohols, moisturizers, humectants, oils, emulsifiers, thickeners, thinners, surface active agents, fragrances, preservatives, antioxidants, vitamins, or minerals. Pharmaceutically acceptable compositions may also be combined with a polymeric substance including, but not limited to, ethylcellulose, hydroxypropyl cellulose, ethylene/vinylacetate, polyvinyl pyrrolidone, and the like, to provide the composition in gel form, which may be dissolved in solvent such as methylene chloride, evaporated to the desired viscosity, and then applied to backing material to provide a patch. The backing can be any of the conventional materials such as polyethylene, ethyl-vinyl acetate copolymer, polyurethane and the like. Example substances include caffeine and a variety of over-the-counter and prescription stimulants (for treating fatigue, sleep disorders, attention deficit disorders and a variety of other conditions), nicotine (for smoking cessation), nitroglycerin (for treating heart attack and strokes), fentanyl (for treating chronic pain), albutamol (for treating asthma), and selegiline (for treating depression, attention deficit disorder or Parkinson's disease). We have carefully identified these specific drugs and diseases because they have the following attributes: (i) Chrono-Pharmacology is critical to optimized dosing but is not being implemented because no automated transdermal system exists, and (ii) these drugs can be transdermally absorbed passively (i.e., without the need for ultrasound or electrical stimulation or other permeation enhancers). Exemplary chrono-pharmacological systems that can make use of the present invention are summarized in Table 1. DISEASES/CONDITION CHRONOPHARMACOLOGY Morning Lethargy Adrenaline is lowest in the morning, making waking uncomfortable and difficult for many people. This can be treated by administering OTC Stimulant before waking Smoking Cessation Nicotine at night creates sleeping disorders (nightmares), but cravings are the highest after waking up. This can be treated by administering Nicotine before waking up. Angina Angina (variant) attacks occur 30 (thirty) times more often between 2:00 a.m. and 4:00 a.m. This can be treated by administering larger nitroglycerin doses in early morning Asthma Asthma attacks are 100 times more likely between 4:00 a.m. and 6:00 a.m. Adrenaline and Cortisol are virtually absent at night. This can be treated by administering albutamol in early morning Colds and Flu Heaviest symptoms overnight and in the morning. This can be treated by administering Cold/Flu medicine during the night. Heart Attacks and Strokes Heart attacks and strokes are most likely between 6:00 a.m. and Noon. This can be treated by administering Anticoagulants before waking up. Pain Neurological pain is worst between 3 A.M and 8 A.M. This can be treated by administering pain medication during sleep. Depression Selegiline at night can create sleeping disorders (nightmares), but depression symptoms are high immediately upon waking up. This can be treated by administering Selegiline before waking up. Rheumatoid Arthritis Worst upon awakening. Cortisol and anti-inflammatory hormones are very low at night. This can be treated by administering medication delivered before waking up. Supplements Vitamins and supplements are best administered in low doses over the course of the day to be most effective. Using this system the present invention can pre-program the times and amount of each dosage by precisely controlling the amount of drug exposed to the skin during each dosing. This feature is advantageous when a drug is best administered during sleep, e.g., 1 to 2 hours before waking up. The present invention precisely counteracts peak disease symptoms and increase patient compliance. The present invention represents the first true non-invasive chrono-pharmacological drug delivery device. While current transdermal applications are restricted to the dosage profile shown in FIG. 2A, the automated implementation of the present invention can be programmed for a variety of drug delivery patterns to achieve customized patient dosing regiments for optimal therapy (FIG. 2B). There are many advantages for a controlled transdermal release of an active material such as a drug. As used herein, the term ‘controlled’ or ‘sustained’ release of an active material includes continuous or discontinuous, linear or non-linear release of the active material according to a programmed schedule. Among the advantages of controlled release are the convenience of a single application for the patient, avoidance of peaks and valleys in systemic concentration which can be associated with repeated injections, the potential to reduce the overall dosage of the active material, lower body stress, and the potential to enhance the pharmacological effects of the active material. A lower, sustained dose can also prevent adverse effects that are occasionally observed with infusion therapy. In addition to significantly reducing the cost of care, controlled release drug therapy can free the patient from repeated treatment or hospitalization, thus offering the patient greater flexibility and improving patient compliance. A controlled release formulation of certain drugs also provides an opportunity to use the drug in a manner not previously exploited or considered. The present invention is particularly advantageous when (i) known chrono-pharmacological information shows that a drug's effects can optimized when administered in a defined dosage at a predefined time or times, and/or (ii) patient compliance with the dosing regimen is greatly increased due to automation, (doses required at inopportune times, when sleeping, for example). A device according to the present invention in general comprises dispensing means, e.g. a pump, at least one drug reservoir, at least one administration element (patch reservoir, administration reservoir, administration compartment, administration chamber) and at least one solvent removal and/or recovery element and if necessary control means interconnected to each other. In a preferred embodiment of the invention the administration reservoir and the solvent recovery means are incorporated in an administration unit (patch). The at least one drug reservoir contains a sufficient amount of one or more active substance dissolved or dispersed at an appropriate concentration in a formulation which may contain a solvent or a solvent mixture that is volatile. If appropriate other excipients, for example tissue permeation promoters (enhancers), thickening substances, solubilizers, buffers, chemical stabilizers, preservatives are present too. The active substance may be any dispensable fluid (for example a liquid, gel or powder), although liquids are particularly of use in the dispensing unit. In some embodiments, at least one of the reservoirs may contain an active substance in powder or other dry form. The powder or other agent is dispensed from the reservoir, and may be combined with a solvent and/or another liquid such as a penetration enhancer. If appropriate the dispensing unit may allow chemical reactions to occur, e.g. in the administration reservoir, as well as phase changes to stabilize (such as a change from a solid to a liquid state). In operation the formulation contained in the at least one drug reservoir is dispensed by the dispensing unit into the at least one administration reservoir (patch reservoir). Volume and frequency of administration of the active substance are controlled by a control unit which preferably is freely programmable according to given needs. The solvent recovery means reclaim solvent that was dispensed together with the formulation into the patch reservoir and is not absorbed. The preferably volatile solvent evaporates from the interface continuously and is guided to the solvent recovery means. If appropriate a heating element or other helping means may be used for supporting evaporation of the solvent. However the temperature of the skin in general is sufficient. The solvent recovery means serve to remove depleted solvent from the interface such that, e.g. after repeated dispensing, active substance concentration maintains at a certain concentration and no unwanted substance is accumulated within the device. Upon quitting dispensing of formula, the residual solvent is recovered and dryness of the interface is achieved, which results in controlled termination of drug delivery. Alternatively or in addition depleted solvent may be discharged into environment only, e.g. by direct evaporation. In general the active substance is completely enclosed in the administration/patch reservoir and is not in contact with the environment or other components. The interface may comprise a membrane (polymer membrane) which may be lined with an absorbent material, such as blotting paper, suitable to receive active substance and facing inwards to the interior of the device. The membrane of the interface is in functional contact with the surface to be treated. The drug formulation is dispensed onto the interface by the dispensing unit which is interconnected to the drug reservoir. The solvent recovery means are normally arranged at a certain distance from the absorbent material preventing uncontrolled absorption of solvent. The volume and frequency of dispensing are freely programmable and are used to control the delivery rate and the time pattern of delivery of the drug. Drug is delivered from the interface primarily by diffusion. The solvent recovery element reclaims the solvent that was dispensed with the formulation onto the interface and was not absorbed otherwise. The solvent recovery element preferably is located within the device and comprises one or more desiccants and/or general adsorbents such as silica gel, molecular sieves or active carbon. These materials are normally arranged within a bag consisting of non-wettable but vapor permeable material e.g. such as GoreTex®. In a preferred embodiment the solvent recovery element is arranged close to but in non-contact with the interface. The volatile solvent evaporates from the interface continuously under the influence of body heat and the vapors are trapped in the solvent recovery element. The solvent recovery element serves the purpose of removing depleted solvent from the interface so that, after repeated dispensing, drug concentration maintains its highest value and no freely moving liquid is formed within the device. Upon quitting dispensing of drug formula, the residual solvent is recovered and dryness of the interface is achieved, which brings about stoppage of drug delivery. The solvent recovery element is contained in a non-wettable material in order to avoid uptake of drug formula and consequent loss of drug. Several parameters are relevant for the amount of active substance absorbed by the surface to be treated such as concentration of the active substance in the solvent, the repetition-rate of supply and the volume supplied. These parameters are controllable by the described invention. Solvent that is not absorbed by the skin in a sufficient way is carried off in another way than by absorption through the skin, e.g. by evaporation into the environment and/or by absorption by another means, e.g. absorbing substance such as silica gel. By this it is possible to avoid negative decrease of the concentration of active substance due to accumulation of the solvent which would impact the diffusion rate through the skin. Especially solvents based on water and/or alcohol are having at temperatures nearby the temperature of skin a vapor pressure which is sufficiently high to carry off the solvent by evaporation. However, the carrying off and/or diffusion rate of the solvent preferably is adjusted to the diffusion rate of the active substance through the skin to avoid accumulation of the solvent or precipitation of the active substance on the skin in a negative way. The described invention offers the opportunity to precisely control the rate and the time pattern of systemic drug delivery. It can be applied to the delivery of drug into and/or across the skin. With the methodology according to the present invention the amount of active substance delivered per unit of time can be adjusted to values ranging between zero and a known maximum, the moments of time can be defined at which the delivery rate is set to a predetermined value and the delivery of drug over time spanning hours or days can be regulated in a programmed manner, e.g. using real time control. A device suitable to carry out the described technology offers the opportunity of fully automated transdermal drug delivery. The method most widely used in prior art for automated controlled transdermal delivery is iontophoresis. With this method control of delivery of a drug is achieved by an electric current which is applied to the skin. By adjusting the current the delivery rate of the drug is regulated. Advantages of the present invention over iontophoresis are the ability to completely turn off delivery or reduce the delivery rate below a minimal value corresponding to passive skin permeation, the absence of skin irritation that the electric current may cause when applied to the skin and the low energy consumption compared to iontophoresis because normally no high currents are needed for extensive periods of time. Conventional patch based delivery systems as known from prior art comprising a patch and a therewith interconnected dispensing unit are more or less suitable to administrate a chemical substance under a specific time regime, where the quantity of the specific dose delivered to the patch can be predetermined more or less accurate and each time period of dispensing the substance can be predetermined as well. However, turning delivery to a patch as known from prior art on and off causes uncontrolled time lag in the delivery rate to or through the skin. The delivery systems known from prior art often lead to a constantly diminishing dispensing rate. These problems are avoided by the present invention. The disclosed invention offers a combination of formula dispensing with an on- and off-turning delivery of the formula and a simultaneous solvent recovery for the purpose of maintaining a constant and high drug delivery rate. The achievable delivery rate and the time lag due to on- and off-events result from the interplay between the rate of formula dispensing and the rate of solvent recovery. The former is preferably controlled by a freely programmable pump and the latter by amount and quality of the material of the solvent recovery element. Precise control of delivery of the active substance is very important. Related thereto is the precise control of the solvent. The solvent may be controlled by additional means e.g. as described as follows. A solvent removal system comprises a waste reservoir which is interconnected by a waste valve, e.g. a pinch valve, and/or a waste pump to the administration reservoir. In the case of a pin valve the waste valve preferably is driven by utilizing a wire made out of Shape-Memory-Alloy (SMA) or an alternative device pursuant to a preprogrammed regimen. In a given example the waste valve is opened or the waste pump is turned on such that the solvent is removed and e.g. brought in contact to a desiccant such that the solvent is safely absorbed. Proper administration may be achieved by opening and closing the connection to the waste reservoir by an appropriate time regime. In certain applications it is helpful to switch the connection to the waste reservoir with a certain delay with respect to the administration of the active substance. Instead or in addition to a pinch valve a micro pump may be appropriate to pump excessive solvent into a waste reservoir. In a further embodiment the tubing e.g. for depletion of solvent can comprise absorbent material which thereby is brought into direct contact with depleted carrier solution. It is possible to remove depleted fluid either pursuant to a preprogrammed profile or systematically, e.g. depleted fluid is brought into contact every 20 minutes with desiccant, by using a small lever or arm, or otherwise made to come into direct contact with the depleted carrier solution, resulting in absorption of the depleted carrier solution. Alternatively, a waste reservoir, e.g. a sponge, is lowered by a small lever or arm or otherwise to come into direct contact with the depleted carrier solution, resulting in immediate absorption of the depleted carrier solution. In a different embodiment a selectively permeable membrane surrounds a sponge or absorbent material, and the selectively permeable membrane primarily allows the solvent to pass through it (whether due to electric charge of the molecule or molecular size or acidity of the solvent vs. the drug or some other regulating means) and this semi permeable membrane either remains in constant contact with the diffusion surface or is periodically brought in to contact with the diffusion surface using an above described method. In a further embodiment a sponge or an absorbent material is in contact with the diffusion surface and a pre-tested and timed capillary action of the sponge is such that depleted carrier solution is absorbed at the right time and in proper amounts as to assist with the achievement of preprogrammed dosage profiles, i.e. even though much active substance may be absorbed along with the carrier solution still sufficient drug is present to achieve the objectives. Modulated dispensing of drug formula brings about a significant increase of delivery rate over the one-time addition of formula at equal drug concentration. Thus, maximization of drug delivery rate is achieved. This is because the removal of solvent from the relatively small dispensed volume creates in situ an increase of drug concentration with subsequent saturation and precipitation of drug in the interface in immediate contact with the skin as evidenced by dryness of the interface. By the herein described method it is possible that the delivery rate of the active substance can be adjusted using the same drug solution by changing the dispensed volume of solution. Depending on the field of application it was found that about 2 gram of desiccant are sufficient for trapping solvent over at least 9 hours when e.g. dispensing 40 μl/hr of a given drug formula. It was found that increase of drug concentration in the formula causes a corresponding increase of delivery rate for dispensing of e.g. 40 μl/hr but not for e.g. 15 μl/hr. Apparently, dryness of the interface for the latter dispensing volume is achieved far before each consecutive dispensing step, thus hampering drug permeation. Depending on the field of application, solvent removal means may be for example: a desiccant in a bag, any other absorbent material in a bag, a desiccant/absorbent connected to the interface by a tube, a desiccant/absorbent connected to the interface by a tube which comprises a valve, a compartment connected to the environment for evaporation, a compartment through which gas is guided to promote evaporation, an absorbent sponge, an absorbent sponge attached to an arm that moves it to and away from the interface, an absorbent sponge with a gas blowing device for drying. The material surrounding the solvent removal means preferably is made out of tissue, cloth, membrane, etc. The administration device (compartment) may comprise, if appropriate, at least one sensor, e.g. a humidity sensor for feedback control to the dispenser. The solvent recovery means serves to remove depleted solvent from the active area of the administration reservoir such that the active substance concentration is maintained at a certain concentration and no unwanted substance is accumulated within the administration device. Upon quitting dispensing of formula into the administration device, the residual solvent is recovered and dryness of the interface is achieved, which results in controlled termination of drug delivery into skin. Normally the temperature of skin is sufficient to evaporate and discharge the solvent. However, a heating element or other helping means may be used for supporting evaporation. The solvent recovery means are normally arranged at a certain distance from the interface, the administration reservoir respectively, is preventing uncontrolled absorption of solvent. The separation layer may e.g. comprise or consist of an inert foam or an appropriate cellular material or honeycomb. The solvent recovery means are preferably located within the administrative device and preferably comprise one or more desiccants and/or general or selective adsorbents such as silica gel, molecular sieves or active carbon preferably surrounded by a non-wettable material permeable for the vapors of solvent, e.g. such as Gore-Tex®. Subsequent the method will be described in a general manner: The drug formulation is dispensed into the administration reservoir by the dispensing system. The volume and frequency of dispensing are freely programmable and are used to control the delivery rate and the time pattern of delivery of the chemical substance into the skin. The chemical substance is delivered from the administration reservoir by diffusion in the skin or onto the surface of the skin. The solvent recovery element reclaims solvent that was dispensed with the formulation into the administration reservoir. The solvent recovery element is in close vicinity to but in general not in direct contact with the administration reservoir to avoid uncontrolled absorption of solvent. The volatile solvent evaporates from the interface under the influence of body heat and the vapors are trapped by the solvent recovery means, e.g. a chamber filled with absorbing material. The solvent recovery element serves the purpose of removing depleted solvent from the patch reservoir so that, after repeated dispensing, drug concentration maintains its highest value and no detrimental fluid (liquid) is accumulated within the administrating device. Upon quitting dispensing of drug formula, the residual solvent is recovered and dryness of the interface is achieved, which brings about stoppage of drug delivery. Applications—ArisePatch™ A contemplated consumer product is the ArisePatch™. Most people experience difficulty and discomfort when waking early in the morning. According to a 2002 National Sleep Foundation poll 49% of US adults age 18-29 have trouble waking in the morning and 41% of US adults age 30-64 have trouble waking in the morning. There are 165,000,000 adults in the US alone age 18-64, meaning approximately 74,250,000 US adults age 18-64 have trouble waking in the morning. The ArisePatch implementation of the present invention allows individuals, while asleep, to have an over-the-counter (OTC) or prescription stimulant automatically administered during a 1-2 hour pre-wake-up period. FIG. 5 illustrates an exemplary stimulant administration profile showing a blood plasma level of ephedrine in nanograms per milliliter on the vertical axis, with time on the horizontal axis. Stimulant concentrations will reach peak levels immediately prior to having to wake. Immediately upon waking up the individual will be alert and feel well rested. The ArisePatch™ will eliminate the typical discomfort or difficulty associated with getting up early. This functionality is attractive to employed people getting up for work to ensure punctuality, and just about anyone who wants to offset morning discomfort associated with a late night, jet lag, or sickness. Applications—Smoking Cessation Nicotine replacement has been the most frequently used therapy to support smokers in their effort to quit. Smokers report that the craving for a cigarette is greatest immediately upon waking in the morning. The time elapsed between wakening and the first cigarette is the best indicator of addiction. For most smokers this time only a few minutes. Current nicotine patches cause severe sleep disturbances by releasing nicotine steadily throughout the night to ensure sufficient morning nicotine levels to offset the strong morning craving. It is widely accepted that current nicotine patches have a detrimental and common side effect-sleeping disorders, and insomnia, including persistent nightmares. Therefore, users are often forced to remove the patch in the evening before they go to bed. This eliminates sleep disturbances, but results in nicotine levels that are insufficient to offset the strong morning craving. This is a major drawback to current nicotine patches and many users relapse, resulting in a less efficient smoking cessation therapy. Current patches present the user with a difficult decision, choosing between nightmares and relief from the strong morning cravings. An exemplary product contemplated by the present invention is called Nicotine ChronoDose™ system. In accordance with the present invention, the system can begin to administer nicotine (or nicotine analogs or any other smoking cessation compound including but not limited to Zyban) automatically during a one hour period immediately prior to waking. This will relieve the smoker's peak craving upon waking without causing nightmares and insomnia. We believe that this system clearly provides a superior method for smoking cessation. A more advanced nicotine replacement system than that described above is worn for three days at a time and is programmed to release nicotine in a daily rhythmic pattern such as shown in FIG. 6 to offset peaks in a smoker's cravings. FIG. 6 illustrates an exemplary nicotine administration profile showing a blood plasma level of nicotine in nanograms per milliliter on the vertical axis, with time on the horizontal axis. This implementation will reduce nicotine dependency by administering pre-programmed levels of nicotine pursuant to typical smoking patterns. For instance many smokers report that cravings for a cigarette are greatest upon waking up, after lunch, midafternoon, after dinner and before bedtime. This implementation of the present invention will automatically release larger doses of nicotine to offset peak cravings and no nicotine when cravings are typically at a minimum. The present invention may be delivered in a pre-programmed manner for each treatment regimen. The only involvement by the user will be the replacement of the ‘reservoir’ every three days, and the replacement of the platform housing as needed. This implementation represents a tremendous move forward in nicotine replacement therapy, and is far superior to the old-technology systems that simply release the same amount of nicotine all day and night. With the present invention, one can systematically decrease a smoker's tolerance without increasing dependence (the result of a constant flow) and better wean a smoker off nicotine. This will allow the smoker to better ‘tailor-down’ and decrease the amount of nicotine he needs to quit. Modern smoking cessation is much more than nicotine replacement therapy. Programs also include weight control, diet and psychological support. The present invention fits well into these programs, since it addresses the key component of being able to quit smoking by efficiently countering the withdrawal symptoms while doing away with the negative side effects of current nicotine replacement therapy systems, namely sleep disturbance. Applications—Cold and Flu Treatment Cold and flu symptoms are worst from midnight until the early morning because the concentration of cortisol is lowest at that time. Current night time cold and flu medication end up losing efficacy by early morning when cold and flu symptoms are highest. Therefore people suffering from a cold or flu are often unpleasantly awoken by an increase in symptoms, cutting sleep short. Set and put on before bedtime, the present invention will automatically deliver a larger dose of medication and immuno-boosters in the early morning hours to more effectively combat the peak cold and flu symptoms that occur in the morning. Users will experience less severe cold and flu symptoms during the morning hours, will not have their sleep cycle cut short, and will wake up feeling symptom-free. This implementation uses prescription or OTC cold medicine alone or optionally in combination with certain transdermally efficacious vitamins and immune system boosters to provide a total solution to cold and flu ailments. This is the first cold therapy that combines OTC medicine with supplemental immuno-boosters in a comprehensive and automated manner. Our system will treat the cold symptoms directly and boost the body's immune system to help it heal naturally. In a particular application, the Cold and Flu automated transdermal drug delivery system utilizes OTC cold medicine, Vitamin C, Echinacea, and Zinc to provide a total solution to cold and flu ailments, and all while you sleep. Cold and flu symptoms are worst in the middle of the night and early morning because the hormone cortisol, a key inflammation fighter, is missing at that time. Cold and flu symptoms are worst from midnight until the early morning because the concentration of cortisol is lowest at that time. Current night time cold and flu medication end up losing efficacy by early morning when cold and flu symptoms are highest. Therefore people suffering from a cold or flu are often unpleasantly awoken by an increase in symptoms, cutting sleep short Set and put on before bedtime, the Cold and Flu automated transdermal drug delivery system utilizes our proprietary technology to automatically deliver a larger dose of medication and immuno-boosters in the early morning hours to more effectively combat the peak cold and flu symptoms that occur in the morning. Users will experience less severe cold and flu symptoms during the morning hours, will not have their sleep cycle cut short, and will wake up feeling symptom-free. Our system not only combats statistically proven peak nighttime and early morning cold symptoms by releasing OTC cold medicine, but actually helps your body to heal by boosting its immune system through Vitamin C, Echinacea and Zinc supplementation in small but distinct doses all night long. Our Cold/Flu system releases these combination of compounds every 2 hours throughout the night, with a higher dosage of compounds being released in the morning to combat these proven middle of the night and early morning symptoms, which are the worst of the day. Cold and flu symptoms are worst in the middle of the night and early morning because the hormone cortisol, a key inflammation fighter, is missing at that time. Our system utilizes its core competitive advantage by pre-programming our System to release more medicaments precisely at that time to offset these peak symptoms. Current cold and flu medications end up losing efficacy by early morning when cold symptoms peak, so the user either has sleep cut short due to the onset of these symptoms, or wakes up out of slumber feeling sick with peak symptoms. Our system will ensure that a while a person is actually sleeping, a sufficient dose of cold and flu medicine is freshly delivered to offset these peak morning symptoms. Applications—Weight Control, Vitamin and Herbal Supplementation In yet another application, a series of weight loss vitamins and supplements is administered in small distinct doses many times over a multiple day period. Vitamins and supplements are absorbed by the body in small dosages. Contrary to popular belief, once-a-day products are not maximally effective because excess dosages are excreted unused. This implementation of the present invention precisely controls the timing and dosage of small but distinct amounts of vitamins and supplements during a 24 hour period to ensure that vitamins and supplements are constantly bio-available for optimal absorption and cellular function. Greater doses are automatically released prior to mealtimes to counter appetite cravings, resulting in a much more effective diet program. Applications—Angina Research shows that variant angina occurs 30 times more often between 2:00 a.m. and 4:00 a.m. (‘critical angina phase’) than at any other time of the day. Nitroglycerin effectively combats angina attacks, if administered in optimal doses. Current nitroglycerin patches exist, but they can only release a constant amount of nitroglycerine steadily over time. Current patches cannot tailor the release of nitroglycerine to optimize treatment by releasing more nitroglycerine precisely during the critical angina phase to offset these peak symptoms. In addition, nitroglycerine loses its effectiveness and requires higher and higher dosages when administered constantly. Our bodies become tolerant to it. Current systems cannot stop or decrease the release of nitroglycerine when disease symptoms are lowest. Thus, these current ‘dumb’ patches cannot offset the critical angina phase by releasing more of the drug, nor can they shut down or stop nitroglycerine administration when the body doesn't need it. It is a ‘one dose fits all’ type of scenario once each “dumb” patch is applied to the patient. The method in accordance with the present invention utilizes an automated transdermal system in order to transdermally administer more nitroglycerine during the critical angina phase to ensure adequate offset of these symptoms and less nitroglycerine when it is not needed so that no tolerance builds up. Our method utilizes a ‘smart’ patch medicine system at this time to offset these peak critical phases in the disease cycle arising due to the human body's circadian rhythm. The preprogrammable automated transdermal system is worn around the wrist like a watch (or the forearm arm or ankle) and releases nitroglycerine in optimal dosages at times that are optimally synchronized. This is pursuant to a pre-programmed and tailored dosage profile. Current nitroglycerin patches only have the capability to release a constant dose of nitroglycerin over a period of time. Current nitroglycerin patches simply cannot alter or vary dosages to increase dosages at different times of the day, and decrease dosages at other times of the day. The nitroglycerin system in accordance with the present invention has three primary advantages over current nitroglycerin patches. First, the system utilizes its core competitive advantage to automatically and precisely release nitroglycerin in peak amounts to offset the peak symptoms of morning attacks occurring during the critical angina phase. Current nitroglycerine patches have release rates that stay constant and do not increase to offset critical phases, and do not decrease as symptoms decrease. Second, our system solves the tolerance issue by releasing less (or no) nitroglycerin in off-peak hours, and then releasing nitroglycerin at just the right time so that it is present during critical periods, without increasing tolerance. Third, our system accomplishes 1 and 2 above automatically, without the need for a patient to wake up to take a drug at this critical phase, which does away with the need for any increased patient compliance. As a result we believe that our nitroglycerin system represents an ideal delivery system for patients who use nitroglycerin regularly for the treatment and/or the prevention of heart attacks and strokes. Patient compliance regarding the timing and dose of heart attack medication is crucial. Patient non-compliance with physician's instructions for this is often a cause of re-hospitalization, according to the US Department of Health and Human Services. The system solves this problem, and will decrease the need for re-hospitalization by dramatically increasing patient compliance. This system can be either an ‘wear each night and remove in the morning’ system, whereby it only releases nitroglycerine automatically to offset the critical angina phase in the morning, or a ‘total solution’ system, that is worn for a period of 24 hours to several days, and that administers nitroglycerine in tailored amounts and at tailored times as synchronized with the body's circadian rhythm (and conveniently taken off while showering or swimming). The system is an innovative new drug therapy for angina. With its superior advantage of optimized and automated time and dose administration synchronized with our circadian rhythms, the system in accordance with the present invention ensures that nitroglycerin will circulate in the bloodstream exactly when the patient needs it, and without any build up tolerance. For these reasons, our system is superior to current steady release nicotine patches. Our system's increased advantages are extremely relevant for those patients with moderate to severe angina. FIG. 7 shows an exemplary administration profile for a nitroglycerine delivery system tailored to treat variant angina attacks or angina pectoris. This type of angina attack has a peak frequency in many patients between the hours of 2:00 and 4:00 AM. This is a particularly difficult time to wake up to take a drug such as nitroglycerine. In accordance with the present invention an administration profile substantially like that shown in FIG. 7 is automatically administered. In FIG. 7 the vertical axis indicates blood plasma level in nanograms per milliliter, and the horizontal axis indicates time from 10:00 PM through the night to 8:00 AM. FIG. 8 illustrates an exemplary administration profile for a nitroglycerine delivery system tailored to treat stress-induced angina attack. In FIG. 8 the vertical axis indicates blood plasma level in nanograms per milliliter, and the horizontal axis indicates time from 12:00 AM through the day until about 4:00 PM. The administration profile shown in FIG. 8 provides a high blood plasma concentration throughout the waking hours of a day when stress is likely occur. Applications—Asthma The automated transdermal asthma system automatically administers a morning dose of albuterol, tolobuterol, salmeterol, beta 2 agonist or any other antiarrhythmic drug (an ‘Asthma drug’) to combat the peak symptom of morning asthma attacks known as the ‘morning dip’. Asthma attacks occur 100 (one hundred) times more often between the hours 4 A.M. and 6 A.M., when most people are asleep. This is due to the early morning deterioration of respiratory function known as ‘morning dip’, which is the time of day that respiratory function is at its lowest. These early morning asthma attacks cause great distress to sufferers and care providers. The morning dip represents the dip in respiratory function at this time when asthma attacks are 100 times more likely to occur. Our system effectively combats the morning dip by releasing more Asthma drug at this time to offset this peak morning symptom. In other words, our ‘smart’ patch varies the level of drug in the bloodstream so that drug concentrations are highest when respiratory function is at its lowest. Current ‘dumb’ asthma patches exist, but they can only release a constant amount of drug steadily over time. Current patches cannot tailor the release of drug to optimize treatment by releasing more drug precisely during the morning dip to offset these peak critical symptoms. The Asthma system has two primary advantages over current patches. First, the system of the present invention utilizes its core competitive advantage to automatically and precisely release albuterol or other asthma drugs in peak amounts to offset the peak symptoms associated with the morning dip. Current patches have release rates that stay constant and do not increase to offset this peak critical phases, and do not decrease as symptoms decrease. Second, our system accomplishes 1 and 2 above automatically, without the need for a patient to wake up to take a drug at this critical phase, which does away with the need for any increased patient compliance. The automated transdermal system for Asthma is worn around the wrist like a watch (or the forearm arm or ankle) and releases albuterol or other Asthma drugs in optimal dosages at times that are optimally synchronized, especially to offset the morning dip, pursuant to a pre-programmed and tailored dosage profile. Current Asthma patches only have the capability to release a constant dose over a period of time. Current Asthma patches simply cannot alter or vary dosages to increase dosages at different times of the day, and decrease dosages at other times of the day. The system is an innovative new drug therapy for asthma. With its superior advantage of optimized and automated time and dose administration synchronized with our circadian rhythms, our system ensures that albuterol or another asthma drug will circulate in increased amounts in the bloodstream exactly when the patient needs it. For these reasons, our system is superior to current steady release patches. Our system's increased advantages are extremely relevant for those patients with moderate to severe asthma. Applications—Hypertension The clondine automated transdermal system utilizes clondine, (or another hypertension drug) an effective drug that combats high blood pressure. The clondine automated transdermal drug delivery system has an automated morning release of clondine to combat the peak symptom of morning heart attacks. Blood pressure differs at different times of the day. Blood pressure surges upon waking, and is lower by 20 to 30 percent while sleeping. Our preprogrammed automatic transdermal system utilizes its core competitive advantage by releasing clondine in a tailored fashion to counter high blood pressure when symptoms are highest, while releasing less clondine when symptoms are less severe. Current clondine patches release the drug consistently over time. It cannot release more of the drug when symptoms are worst. People die most when the symptoms peak. Having the advantage of administering more of the drug when a patient needs it the most can mean the difference between life and death, especially in patients with moderate to severe high blood pressure. The automated transdermal system for hypertension has two primary advantages over current patches. First, our system utilizes its core competitive advantage to automatically and precisely release clondine or other hypertension drugs in peak amounts to offset the peak symptoms associated with the dangerous morning symptoms. Current hypertension patches have release rates that stay constant and do not increase to offset this peak critical phases, and do not decrease as symptoms decrease. Second, our system accomplishes 1 and 2 above automatically, without the need for a patient to wake up to take a drug at this critical phase, which does away with the need for any increased patient compliance. Applications—Depression, Alzheimer's, Attention Deficit The selegiline automated transdermal system utilizes selegiline, an effective MAO inhibitor for the treatment of depression, Alzheimer's and Attention Deficit Disorder. The selegiline automated transdermal drug delivery system gives an automated morning release of selegiline to combat the peak symptom of morning depression without the side effect of sleep disturbances. The system in accordance with the present invention is applied before bed. It does not release the drug until an hour or 2 before morning, so symptom of morning depression would be corrected by our system without subjecting the patient to sleep disturbances. Primary negative side effects of the selegiline patches are abnormal dreams, insomnia, and difficulty sleeping. We believe that by specifically refraining from administering selegiline at night, and utilizing our system's core competitive advantage to turn it on an hour or so before waking, we can do away with this negative side effect and still offset the critical phase of morning symptoms of depression. It has been reported that patients have increased symptoms of depression upon waking if the critical amount of Selegiline is not circulating through their system. Our system utilizes its core competitive advantage to provide a compelling solution to this problem. Our system is applied before bed, it would not release the drug until an hour or two before morning, so symptom of morning depression would be corrected by our system without subjecting the patient to sleep disturbances Current Oral Selegiline produces horrible side effects. There is a new Selegiline patch coming out on the market, but it to produces sleep disturbances. It is believed that the system in accordance with the present invention would be superior to conventional Selegiline product delivery systems. Applications—In General The present invention is particularly useful in applications in which it is necessary and/or desirable to start the administration of a drug, stop the administration of a drug, and/or increase/decrease the dosage of a drug at a time when it is inconvenient or impossible for a patient to initiate the necessary actions. This is particularly useful for a wide variety of drug administration applications that benefit when administration is started, stopped, or changed while a person is sleeping. As chronotherapy knowledge increases, it is contemplated that a wide variety of applications will be discovered in which benefit is realized by starting, stopping and/or changing the drug administration while a patient sleeps. In each of the examples, treatment is continued as needed to provide superior symptomatic relief, prevent exacerbation of symptoms, and/or prevent and/or delay progression of the disease state or condition in the patient, or until it is no longer well tolerated by the patient, or until a physician terminates treatment. For example, a physician may monitor one or more symptoms and/or serum levels of active material and/or metabolic by-product(s) in a patient being treated according to this invention and, upon observing attenuation of one or more symptoms for a period of time, conclude that the patient can sustain the positive effects of the above-described treatment without further administration for a period of time. When necessary, the patient may then return at a later point in time for additional treatment as needed. As used herein, ‘day’ means a 24-hour period. Thus, for example, ‘for at least three consecutive days’ means for at least a 72-hour period. During or after the treatment, a physician may monitor one or more symptoms and/or serum levels in the patient and, upon observing an improvement in one or more of the parameters for a period of time, conclude that the patient can sustain the positive effects of the treatment without further administration of the active material for a period of time. In order to use an active material for therapeutic treatment (including prophylactic treatment) of mammals including humans according to the methods of this invention, the active material is normally formulated in accordance with standard pharmaceutical practice as a pharmaceutical composition. According to this aspect of the invention there is provided a pharmaceutical composition comprising an active material in association with a pharmaceutically acceptable diluting substance or carrier, wherein the active material is present in an amount for effective treating or preventing a particular condition. While individual needs may vary, determination of optimal ranges for effective amounts of an active ingredient (alone or in combination with other drugs) within the ranges disclosed herein is within the expertise of those skilled in the art. Accordingly, ‘effective amounts’ of each component for purposes herein are determined by such considerations and are amounts that improve one or more active ingredient functions and/or ameliorate on or more deleterious conditions in patients and/or improve the quality of life in patients. The present invention also provides pharmaceutical kits for treating a particular symptom, condition and/or disease and/or improving a particular biological function, comprising one or more containers comprising one or more active compositions in accordance with this invention. Such kits can also include additional drugs or therapeutics for co-use with the active composition for treatment or prevention of a particular symptom, condition and/or disease and/or improving a particular biological function. In this embodiment, the active composition and the drug can be formulated in admixture in one container, or can be contained in separate containers for simultaneous or separate administration. The kit can further comprise a device(s) for administering the compounds and/or compositions, such as device 100 shown in FIG. 1, and written instructions in a form prescribed by a governmental agency regulating the manufacture, use or sale of pharmaceuticals or biological products, which instructions can also reflect approval by the agency of manufacture, use or sale for human administration. Although the invention has been described and illustrated with a certain degree of particularity, it is understood that the present disclosure has been made only by way of example, and that numerous changes in the dosages, administration profiles, timing, as well as the combination and arrangement of parts can be resorted to by those skilled in the art without departing from the spirit and scope of the invention, as hereinafter claimed. What is claimed is: 1. A method for delivering an active substance and a carrier to a user, the method comprising: placing a delivery device in contact with the user's skin, the dispensing device comprising a reservoir, a skin interface, a programmable dosage controller configured to control the time and dosage of the active substance according to a dosage profile corresponding to a circadian rhythm of the user, and a carrier removal element; dispensing a first portion of the active substance and carrier from the reservoir to the skin interface according to the dosage profile; removing a portion of the carrier from the skin interface into the carrier removal element according to the dosage profile; and delivering the active substance through the skin interface to the skin. 2. The method of claim 1, wherein the skin interface comprises a highly permeable membrane. 3. The method of claim 2, further comprising diffusing the active substance across a surface area of the highly permeable membrane. 4. The method of claim 3, wherein delivering the active substance through the skin interface includes delivering the active substance across a surface area of the highly permeable membrane to the skin. 5. The method of claim 1, wherein the programmable dosage controller is configured to control a valve in fluid communication with the reservoir. 6. The method of claim 1, wherein the delivery device is adhesively attached to the skin. 7. The method of claim 1, wherein the programmable dosage controller comprises timing routines corresponding to the circadian rhythm. 8. The method of claim 7, wherein the timing routines are selected to deliver the active substance at a time, rate, sequence and/or cycle corresponding to the circadian rhythm. 9. The method of claim 1, wherein the active substance comprises nicotine and the dosage profile is configured to deliver the nicotine at times that are associated with nicotine cravings. 10. The method of claim 9, wherein at least one of the times corresponds to a time at which the user experiences a morning nicotine craving. 11. The method of claim 1, further comprising: removing the delivery device after contacting the skin for greater than 24 hours. 12. The method of claim 1, further comprising: removing the delivery device after contacting the skin for greater than 72 hours. 13. The method of claim 1, wherein the reservoir contains the active substance and carrier. 14. The method of claim 13, further comprising: replacing the reservoir with a second reservoir containing an active substance and a carrier. 15. The method of claim 13, further comprising: using the delivery device with the second reservoir for greater than 72 hours. 16. The method of claim 1, wherein the carrier removal element is a waste reservoir. 17. The method of claim 1, wherein the active substance comprises a stimulant and the dosage profile is configured to deliver the stimulant during a 1-2 hour pre-wake-up period. 18. The method of claim 1, wherein the active substance comprises cold medicine and the dosage profile is configured to deliver the cold medicine while the user sleeps. 19. The method of claim 18, further comprising dispensing vitamins and/or minerals to the skin interface while the user sleeps. 20. The method of claim 1, wherein the active substance comprises nitroglycerine and the dosage profile is configured to deliver the nitroglycerine while the user sleeps in first amount in a first time period and in a second amount higher than the first amount in a second time period. 21. The method of claim 1, wherein the active substance is an asthma drug and the dosage profile is configured to deliver the asthma drug while the user sleeps. 22. The method of claim 1, wherein the active substance is a hypertension drug and the dosage profile is configured to deliver the hypertension drug while the user sleeps. 23. The method of claim 1, wherein the active substance is selegiline and the dosage profile is configured to deliver the selegiline while the user sleeps. 24. A method for delivering an active substance and a carrier to a user, the method comprising: placing a delivery device in contact with the user's skin, the dispensing device comprising a reservoir, a skin interface, a programmable dosage controller configured to control the time and dosage of the active substance according to a dosage profile and a carrier removal element; dispensing a first portion of the active substance and carrier from the reservoir to the skin interface according to the dosage profile; removing a portion of the carrier from the skin interface into the carrier removal element according to the dosage profile; and delivering the vitamins/minerals through the skin interface to the skin in discreet doses over a 24 hour period to ensure consistent bioavailability. 25. A method for delivering an active substance and a carrier to a user, the method comprising: placing a delivery device in contact with the user's skin, the dispensing device comprising a reservoir, a skin interface, a programmable dosage controller configured to control the time and dosage of the active substance according to a dosage profile and a carrier removal element; dispensing a first portion of the active substance and carrier from the reservoir to the skin interface according to the dosage profile; removing a portion of the carrier from the skin interface into the carrier removal element according to the dosage profile; and delivering the vitamins/minerals through the skin interface to the skin in in greater amounts upon wake up and at meal times to assist with weight loss.

2015-06-22

en

2015-10-08

US-201514621796-A

Hatch with Thermally Broken Frame ABSTRACT A roof access hatch, which utilizes thermal breaks is disclosed. This roof access hatch has a cover with a first metallic exterior surface spaced from a first metallic interior surface by at least a first insulation layer, where the first metallic exterior surface is thermally isolated from the first metallic interior surface. A first thermal break spans the insulation layer and is in contact with both the metallic exterior surface and the metallic interior surface. A frame supports the cover. This frame has a second metallic exterior surface separated from a second metallic interior surface by at least a second insulation layer, where the second metallic exterior surface is thermally isolated from the second metallic interior surface by a thermal break component. A non-metallic, thermally insulating gasket is disposed between the cover and the frame. CROSS REFERENCE TO RELATED APPLICATION N.A. U.S. GOVERNMENT RIGHTS N.A. BACKGROUND 1. Field Disclosed herein is a hatch to be used to provide access to a flat or slightly sloped roof. More particularly, the hatch includes a plurality of thermal breaks effective to decrease the loss of heat through the hatch. 2. Description of the Related Art Thermal breaks are commonly used in the frames of windows and doors because a thermal break interrupts the flow of heat thereby providing improved thermal insulation. Thermal breaks are disclosed in United States patent application publication number US 2009/0226660 A1, titled, “Heat Insulating Body for Forming Sections for Thermal Break Door and Window Frames.” The thermal breaks are described as having a first aluminum part exposed externally that is separated from a second aluminum part that is exposed internally by a heat-insulating material. Generally, this heat-insulating material is a plastic, typically, a polyamide. The gap between the first aluminum part and the second aluminum part interrupts the conduction of heat between the outer part and inner part and provides the frame with a high heat-insulating power. US 2009/0226660 A1 is incorporated by reference herein in its entirety. EP 2519702 B1, titled “Panel Assembly Comprising a Panel and a Frame” discloses a roof hatch intended to allow access to a roof. The transfer of heat between the inside of a building and outside the building is reduced by including a thermal separation between outward facing parts of the roof hatch and inward facing parts of the roof hatch. The thermal separation is a strip of insulation disposed between edges of the inner facing and outer facing parts of the roof hatch. There remains, however, a need for more energy efficient roof hatches. BRIEF SUMMARY OF THE DISCLOSURE In one embodiment, a compound thermal break component is disclosed. This compound thermal break includes a first thermal break component that has a first metallic heat conducting portion and a second metallic heat conducting portion separated by at least one thermally insulating portion. The first metallic heat conducting portion and the second metallic heat conducting portion are generally parallel to each other in the direction of a first length-wise axis. The compound thermal break also includes a second thermal break component having a third metallic heat conducting portion and a fourth metallic heat conducting portion separated by at least one thermally insulating portion wherein the third metallic heat conducting portion and the fourth metallic heat conducting portion are generally parallel to each other in the direction of a second length-wise axis. The first length-wise axis is perpendicular to the second length-wise axis. In a second embodiment, a roof access hatch, which utilizes thermal breaks is disclosed. This roof access hatch has a cover with a first metallic exterior surface spaced from a first metallic interior surface by at least a first insulation layer, where the first metallic exterior surface is thermally isolated from the first metallic interior surface. A first thermal break spans the insulation layer and is in contact with both the metallic exterior surface and the metallic interior surface. A frame supports the cover. This frame has a second metallic exterior surface separated from a second metallic interior surface by at least a second insulation layer, where the second metallic exterior surface is thermally isolated from the second metallic interior surface. A non-metallic, thermally insulating gasket is disposed between the second metallic interior and exterior surfaces and the first metallic interior section. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a cross-sectional view of a thermal break component for use with the roof hatch described herein. FIG. 2 illustrates the thermal break component of FIG. 1 in front planar view. FIG. 3 is a cross-sectional view of a portion of a roof hatch as described herein. FIG. 4 is a side planar view of a thermal break used to provide hardware mounting to the roof hatch of FIG. 3. FIG. 5 is a bottom planar view of a first embodiment of a cover portion of the roof hatch showing thermal break components that provide hardware mounting sites preferably for use with a smaller size hatch. FIG. 6 is a broken perspective view of a roof hatch showing thermal break components used for mounting hardware. FIG. 7 is a perspective view of the roof hatch as described herein. FIG. 8 is a perspective view of a thermal break component having a hole for mounting hardware. FIG. 9 is a bottom planar view of a second embodiment of a cover portion of the roof hatch showing thermal break components that provide structural support for stiffening, preferably for use with a larger size hatch. FIG. 10 is a side perspective view of a frame utilizing a thermal break component to provide structural support for stiffening and to support flashing. Like reference numbers and designations in the various drawings indicated like elements. DETAILED DESCRIPTION FIG. 1 is a cross-sectional view of a thermal break component 10 for use with a roof hatch as described herein. The thermal break component 10 has two parallel metallic heat conducting portions 12 a, 12 b separated by thermally insulating portions 14 a, 14 b. Preferably, the two metallic heat conducting portions 12 a, 12 b are formed from aluminum or an aluminum alloy, such as aluminum alloy 6063T5 (nominal composition, by weight, 0.7 Mg, 0.4 Si and the balance aluminum). As shown in FIGS. 1 and 2, the heat conducting portions 12 a, 12 b are preferably rectangular in cross-section to facilitate extrusion and attachment to roof hatch components. The heat conducting portions 12 a, 12 b have a thickness, t, which is sufficient to receive a hole, as seen in FIG. 8. With reference back to FIG. 1, this thickness, t, is at a minimum 0.1 inch and is preferably from 0.15 inch to 0.25 inch and most preferably is from 0.175 inch to 0.20 inch. The hole is useful to replace nuts and cover spacers when hardware is attached to the roof hatch. The heat conducting portions 12 a, 12 b have a nominal width, w, of one inch. The thermal break component has a nominal total thickness, T, of 0.75 inch. Referring to FIG. 2, the extruded length, L, of a thermal break component 10 may be any desired length up to the full width of a roof hatch portion. The thermally insulating portions 14 a, 14 b are typically formed from a rigid polymer such as polyimide, for example, polyimide GF25. FIG. 3 is a cross-sectional representation of a corner of the roof hatch illustrating a cover 16 and a frame 18 both including at least one thermal break component. As illustrated in FIG. 7, the frame 18 supports the cover 16. Hinges 50 are adjacent a first edge of the cover 16 and pivotally join the cover 16 to the frame 18. Locking handle 46 is located at an opposing second edge of the cover 16. Referring back to FIG. 3, the cover 16 has an exterior surface 20 and an interior surface 22 both made from a thin sheet of metal. The exterior surface 20 may be formed from 11 gauge (0.090 inch thick) aluminum alloy, for example, aluminum alloy 3003 (nominal composition by weight of 1.2% Mn, 0.12% Cu and the balance Al) and the interior surface may be formed form 0.04 inch thick aluminum alloy 3003. The exterior surface 20 and the interior surface 22 are separated by insulation, such as by a first insulation layer 24 and a second insulation layer 26. The cover is designed to withstand a force of 40 lbs./ft2 or higher. To increase the strength of the exterior surface 20, a preferred option is to include one or more compound thermal break components 30 that span the thicknesses of the first 24 and second 26 insulation layers contacting and supporting the exterior surface 20 and interior surface 22. With reference to FIG. 4, a compound thermal break component 30 is formed by joining a first thermal break component 10 to a second thermal break component 32 in an orientation such that metallic heat conducting portions 12 a, 12 b and 34 a, 34 b do not form a continuous, uninterrupted metallic path between exterior surface 20 and interior surface 22 (FIG. 3). As shown in FIG. 4, this is accomplished by having the length-wise axis 36 of the first thermal break component 10 be perpendicular to the length-wise axis 38 of the second thermal break component 32. When the heat conducting portions are formed from an aluminum-base alloy, joining may be by a weld 40. The length of the second thermal break component 32 is that necessary for the compound thermal break component 30 to span the distance between exterior surface 20 and interior surface 22. In this way, metallic heat conducting portion 12 b abuts the interior surface 22. This metallic heat conducting portion 12 b may then be provided with a hole for mounting hardware as best shown in FIG. 6. Any number of compound thermal break components 30 may be attached to the insulation-facing sides of the cover 16. As shown in FIG. 5, these compound thermal break components may receive mounting supports 39 for attachment of hardware, such as locking handles, attached in the cover 16. With reference to FIG. 8, holes 41 are formed in one of the metallic heat contacting portions 12 b of the first thermal break component 10. With reference to FIG. 6, if the fastener 42 is a screw, the walls circumscribing the holes 41 may be threaded to engage the threads of the screw or smooth and slightly smaller than the diameter of a self-threading screw. If the fastener 42 is a bolt or a rivet, the holes 41 may be smooth and enable the bolt or rivet to pass through. Fasteners 42 join hardware 44, such as locking handle 46 to the cover 16 without creating a thermal path from the exterior surface 20 to the interior surface 22. The exterior handle 47 may be rubber coated to prevent the flow of heat through the handle hardware. FIG. 7 shows exemplary hardware that may be fastened to a first thermal break component 10, 10′ (FIG. 3) located in either the cover 16 or the frame 18. For example, lock 46, compression spring 48, hinge 50, and cover support mechanism 52 (to hold the cover open). The first thermal break component 10′ is useful to replace weld nuts and back plate for mounting hardware on the frame. FIG. 9 shows a second cover 70 in an embodiment typically for use with larger covers. Thermal break components 130 extend for an extended length along the insulation-facing side of exterior surface 20. Any number of, preferably parallel running, thermal break components 130 may be utilized. Second thermal breaks 132 are attached to span the thickness of the insulation and contact the interior surface (not shown in FIG. 9). A mounting fixture 72, such as a U-shaped sheet of an aluminum alloy may be attached to select thermal break components 130 to receive holes for the mounting of hardware. With reference back to FIG. 3, gap 55 is a thermal break between exterior surface 20 and interior surface 22 creating a thermal break without extra parts. Also, a thermally isolating elastomeric gasket 56 provides an air tight seal between the frame 18 and cover 16. Gap 54 and gap 58 thermally isolate flashing 60 from the interior surface 62 of the frame 18. Thermal break component 10′ may be used to attach hardware. While use of the thermal break components has been described in relation to the cover, these components 10′, 10″ may also be used to support and stiffen, and provide sites for hardware mounting, to the frame 18. They may also be used to support flashing 60 as shown in FIG. 10. EXAMPLES The following example further illustrates the thermal transmittance of the roof access hatch described herein. The thermal transmittance of a roof access hatch of the type described in EP 2519702 (“Prior Art Hatch”) was compared to the thermal transmittance of the roof access hatch disclosed herein (“Disclosed Herein Hatch”). An NPL (National Physical Laboratory—United Kingdom) rotatable wall-guarded hot-box which conforms to the requirements of BS EN ISO 8990:1996 was used. Measurement equipment with calibration traceable to National Standards (UK) was used with the measurement procedures defined in BS EN ISO 12567-2. This is an air-to-air method requiring no surface measurement of the structure being tested. The overall measurement uncertainty was estimated to be within ±6.5% providing a level of confidence of approximately 95%. Thermal transmittance measurements were made in an NPL Rotatable Wall-Guarded Hot-Box described in NPL Report CBTLM 25. Main features of this equipment are: Interior dimensions of hot-box—2.4 m×2.4 m; All surfaces “seen” by the test element are matte black; There are twenty five air temperature sensors, 75 mm from the holder panel face, positioned at the centers of squares of equal areas in both the hot and cold boxes; and The heat flow direction is vertically up. Both the Prior Art Hatch and the Disclosed Herein Hatch utilized aluminum-base alloys for metallic components and were installed in the test apparatus to replicate thermal performance when installed on a roof in the “curb” mounting configuration. In that configuration, the entire roof hatch was above the surround panel surface—which is representative of an installation where the product is above the building envelope insulation. Prior Art Hatch Disclosed Herein Hatch Height of Aperture (m) 0.902 0.902 Width of Aperture (m) 0.702 0.702 Internal Depth (m) 0.289 0.326 Utilizing the data from Table 1 below, the following thermal transmittance values were determined: Environmental Thermal Temperature Transmittance ° C. W/(m2 · K) Prior Art Hatch 11.58 3.9 Disclosed Herein Hatch 11.62 3.7 The above thermal transmittance data indicates that the thermal transmittance of the Disclosed Hatch is lower (better) than that of the Prior Art Hatch. The U-value of a projecting product such as a roof access hatch is calculated by dividing the heat transfer across the system (measured in Watts) by the environmental temperature difference across the test element (measured in degrees K) multiplied by the area of the opening in the building envelope (measured in m2). If the total surface area of the product (called the developed area) is used, rather than the area of the opening, a Ud value is obtained. The Ud value is a good indication of the thermal performance of the individual components that make up the product. The following Ud values were obtained: Prior Art Disclosed Herein Hatch Hatch Developed Internal Area 1.5601 m2 1.6788 m2 Power Through 47.7830 W 44.97 W Roof Hatch System Environmental 19.22° C. 19.28° C. Temp. Difference Ud-Value 1.59 W/m2 · K 1.39 W/m2 · K The difference in Ud—Value indicates that the Ud—Value of the Disclosed Hatch is lower (12.6% better for heat insulation) than that of the Prior Art Hatch. The following measured/calculated data was obtained per the above described methods used to calculate the above values: TABLE 1 Prior Art Disclosed Herein Hatch Hatch Test Element Dimensions (m) Aperture Height 0.902 0.902 Aperture Width 0.702 0.702 Internal Depth 0.289 0.326 Measured Values (° C.) Mean Warm Air Temperature 21.83 21.85 Mean Warm Baffle Temperature 21.17 21.33 Mean Hot Reveal Temperature 18.62 18.62 Mean Cold Air Temperature 1.96 1.97 Mean Cold Baffle Temperature 2.03 2.02 Measured Values Power to Hot Box 71.124 W   68.265 W   Air Flow Rate in Cold Box 1.35 m/s 1.32 m/s Air Flow Rate in Hot Box 0.32 m/s 0.34 m/s Calculated Values Heat Flux Density 75.477 W/m2 71.034 W/m2 Warm Side Convective Fraction 0.453 0.447 Cold Side Convective Fraction 0.851 0.846 Warm Side Environmental Temp. 21.18° C. 21.26° C. Cold Side Environmental Temp.  1.97° C.  1.98° C. Environmental Temp. Difference 19.22° C. 19.28° C. Environmental Temp. Mean 11.58° C. 11.62° C. Measured Thermal Transmittance 3.928 W/(m2 · K) 3.684 W/(m2 · K) One or more embodiments of the present invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims. What is claimed is: 1. A compound thermal break component, comprising: a first thermal break component having a first metallic heat conducting portion and a second metallic heat conducting portion separated by at least one thermally insulating portion wherein the first metallic heat conducting portion and the second metallic heat conducting portion are generally parallel to each other in the direction of a first length-wise axis; and a second thermal break component having a third metallic heat conducting portion and a fourth metallic heat conducting portion separated by at least one thermally insulating portion wherein the third metallic heat conducting portion and the fourth metallic heat conducting portion are generally parallel to each other in the direction of a second length-wise axis; wherein the first length-wise axis is perpendicular to said second length-wise axis. 2. The compound thermal break component of claim 1 wherein the third metallic heat conducting portion and the fourth metallic heat conducting portion are attached to the first metallic heat conducting portion and thermally isolated from the second metallic heat conducting portion. 3. The compound thermal break component of claim 2 wherein said second metallic heat conducting portion includes a hole. 4. The compound thermal break component of claim 3 wherein walls circumscribing said hole are threaded. 5. A roof access hatch, comprising: a cover having a first metallic exterior surface spaced from a first metallic interior surface by at least a first insulation layer, wherein the first metallic exterior surface is thermally isolated from the first metallic interior surface; at least a first thermal break spanning the insulation layer and in contact with both said metallic exterior surface and said metallic interior surface; a frame supporting the cover, the frame having a second metallic exterior surface separated from a second metallic interior surface by at least a second insulation layer, wherein the second metallic exterior surface is thermally isolated from the second metallic interior surface; and a non-metallic, thermally insulating gasket disposed between the second metallic interior and exterior surfaces and the first metallic interior section. 6. The roof access hatch of claim 5 wherein the first thermal break has a first metallic heat conducting portion and a second metallic heat conducting portion separated by at least one thermally insulating portion wherein the first metallic heat conducting portion and the second metallic heat conducting portion are generally parallel to each other in the direction of a first length-wise axis; and a second thermal break component having a third metallic heat conducting portion and a fourth metallic heat conducting portion separated by at least one thermally insulating portion wherein the third metallic heat conducting portion and the fourth metallic heat conducting portion are generally parallel to each other in the direction of a second length-wise axis; wherein the first length-wise axis is perpendicular said second length-wise axis. 7. The roof access hatch of claim 6 wherein the third metallic heat conducting portion and the fourth metallic heat conducting portion are attached to the first metallic heat conducting portion and thermally isolated from the second metallic heat conducting portion. 8. The roof access hatch of claim 7 wherein said second metallic heat conducting portion is adjacent the first metallic interior surface and includes a hole. 9. The roof access hatch of claim 8 wherein walls circumscribing said hole are threaded. 10. The roof access hatch of claim 8 wherein hardware mounted to the first metallic interior surface is attached via the hole. 11. The roof access hatch of claim 10 wherein the hardware includes a handle lock adjacent a first edge of the cover and a hinge adjacent an opposing second edge of the cover. 12. The roof access hatch of claim 5 wherein a second thermal break component is disposed between the second metallic exterior surface and the second metallic interior surface adjacent said thermally insulating gasket. 13. The roof access hatch of claim 12 wherein said fourth metallic heat conducting portion is adjacent the second metallic interior surface. 14. The roof access hatch of claim 13 wherein the fourth metallic heat conducting portion includes a hole. 15. The roof access hatch of claim 14 wherein walls circumscribing said hole are threaded. 16. The roof access hatch of claim 9 wherein a plurality of generally parallel first thermal breaks span the first insulation layer and contact both the first metallic exterior surface and the first metallic exterior surface.

2015-02-13

en

2016-08-18

US-47868704-A

Sulfonamide derivatives ABSTRACT A medicament for enhancing an effect of a cancer therapy based on a mode of action of DNA injury, which comprises as an active ingredient a compound represented by the general formula (I) or a physiologically acceptable salt thereof: wherein R represents an aryl-substituted alkyl group, an heteroaryl-substituted alkyl group, a cycloalkyl-substituted alkyl group, or a cyclic hydrocarbon group wherein said cyclic hydrocarbon group may be saturated, partly saturated, or aromatic; or Z may bind to R to form a cyclic structure, Z represents a hydrogen atom or a C 1 to C 6 alkyl group. The medicament enhanced the effect of the cancer therapy and decreases a dose of an anticancer agent and/or radiation, and therefore, can reduce side effects resulting from the cancer therapy. FIELD OF INVENTION [0001] The present invention relates to medicaments for enhancing the effect of cancer therapy on the basis of mechanism of inuring DNA, and novel compounds useful as active ingredients of said medicament. BACKGROUND ART [0002] Anticancer agents are administered in treatments of cancer patients at present. However, their-life-prolongation rates are undesirably low, and moreover, cancer patients administered with an anticancer agent are forced to tolerate severe side effects such as fever, nausea, epilation, chill, fatigue, immune malfunction, gastrointestinal disorder, liver disorder, and kidney disorder, which becomes a cause of significant deterioration of the QOL (Quality of Life) of the cancer patients. Furthermore, reduction of sensitivity of cancer cells to anticancer agents, caused by the use of the anticancer agents, may lead to prolonged administration period of administration of the anticancer agents and increase of doses, and as a result, deaths resulting from side effects of the anticancer agents are often observed. Therefore, the administration of anticancer agents may spoil advantages of patients, as well as significantly diminish social and economic benefits. This is caused by the fact that anticancer agents, which are expectedly used to exhibit selective cytotoxicity to cancer cells that disorderly divide and proliferate, actually act cytotoxically on normal cells, particularly on cells in the intestine and marrow. [0003] In recent years, reports have been made on caffeine which is a low molecule organic compound and UCN-01(7-hydroxy staurosporine) having actions to enhance radiation susceptibility of cancer cells which are radiation resistant (J. Biol. Chem., 275, 6600-6605, 2000; J. Biol. Chem., 276, 17693-17698, 2001). Cancer therapy by radiation is also based on the mode of action of artificial injury of DNAs, and is considered to be basically equivalent, to anticancer agents such as bleomycin based on the mode of action of DNA injury. Accordingly, it is believed that a drug that enhances selective toxicity to cancer cells can be developed even for anticancer agents based on the mode of action of DNA injury which are available at present. [0004] In fact, it is reported that caffeine increases the actions of anticancer agents such as adriamycin, cisplatin, cyclophosphamide, and mitomycinC based on the mode of action of DNA injury (Jpn. J. Cancer. Res., 80, 83-88, 1989). However, potency remains insufficient, and separation from toxicity is unsatisfactory. UCN-01 is also reported to enhance actions of several kinds of anticancer agents based on the mode of action of DNA injury (Invest. New-Drugs, 18, 95-107, 2000). [0005] As for the mode of action of the potentiation of anticancer agents, the action is presumed to be based on a destruction of a certain part of the cell cycle (for example, G1 period and G2 period: Cancer Res., 60, 2108-2112, 2000; Cancer Res., 59, 4375-4882(1999), since caffeine and UCN-01 inhibit protein kinases involved in a control of a cell cycle (J. Biol. Chem., 275, 10342-10348, 2000; Cancer Res., 61, 1065-1072, 2001). However, no conclusive evidence has been obtained. In addition, since caffeine and UNC-01 as a staurosporin derivative have inhibitory actions against multiple kinds of protein kinases (Biochem. Biophys. Res. Commun., 219, 778-783, 1996; Acta Pharmacol. Sin., 21, 85-40, 2000), a possibility of involvement of a mechanism other than the destruction of the cell cycle can not be denied. Accordingly, a clear mode of action remains unidentified, Furthermore, there is a high possibility that these agents have inhibitory actions also against protein kinases participating in intracellular signal transduction, which is considered to be a possible cause of inducing serious side effects. [0006] As explained above, no effective means is available at present to solve various problems caused by the cancer therapies based on the mode of action of DNA injury. Developments of new drugs or therapies, that potentiate the effects of available anticancer agents and radiation therapy based on the mode of action of DNA injury and that enhance selectivity to cancer cells to decrease side effects, will contribute to increase the QOL and advantages of cancer patients as well as social and economic benefits. DISCLOSURE OF THE INVENTION [0007] An object of the present invention is to provide medicaments for enhancing the effect of cancer therapy based on the mode of action of DNA injury. More specifically, an object of the present invention is to provide medicaments which, per se, have weak anticancer activity (cytotoxicity), but in combination of an anticancer agent based on the mode of action of DNA injury or a therapy such as radiation which gives artificial injuries to DNA, can selectively damage or kill cancer cells at a lower dose of anticancer agent or a lower radiation dose so as to significantly reduce affects on normal cells. Furthermore, another object of the present invention is to provide medicaments to reduce side effects resulting from cancer therapy by potentiation of the effects of the above cancer therapy and by reduction of a dose of the anticancer agent and/or radiation dose. Still further object of the present invention is to provide novel compounds which are useful as active ingredients of the above medicaments. [0008] The inventors of the present invention focused on protein kinase inhibitors to solve the aforementioned objects, and carried out search for compounds having desired pharmacological activities by using computerized molecular design technology as a means to discover candidate compounds. The inventors carried out an automatic search program of a ligand from a three-dimensional compound database based on the three-dimensional structure of the protein by using the ATP binding regions of several kinds of protein kinases whose structures are registered in PDB (Protein Data Bank), and by virtual screenings, they selected compounds having potentials as protein kinase inhibitors from compounds registered in databases of commercial compounds. The inventors classified the resulting compounds on the basis of their skeletons, and by using several typical compounds, they carried out tests of combined effects with bleomycin on cancer cells and normal cells and tests of cytotoxicity to cancer cells and normal cells when the compounds are used alone. The inventors selected compounds having strong and desired pharmacological activities, and further prepared their derivatives to achieve the present invention. [0009] The present invention thus provides a medicament for enhancing an effect of a cancer therapy based on a mode of action of DNA injury which comprises as an active ingredient a compound represented by the general formula (I) or a physiologically acceptable salt thereof: [0010] wherein R represents an aryl-subustituted alkyl group which may be substituted, an heteroaryl-substituted alkyl group which may be substituted, a cycloalkyl-substituted alkyl group which may be substituted, or a cyclic hydrocarbon group which may be substituted (said cyclic hydrocarbon group may be saturated, partly saturated or aromatic); or Z may be bound to R to form a cyclic structure (the formed ring may be substituted), Z represents a hydrogen atom or a C1 to C6 alkyl group. [0011] According to preferred embodiments of the present invention, provided are the aforementioned medicament wherein the cancer therapy based on the mode of action of DNA injury is carried out by administration of an anticancer agent and/or radiation; the aforementioned medicament wherein the anticancer agent is selected from a group consisting of bleomycin, adriamycin, cisplatin, cyclophosphamide, mitomycinC, and their derivatives; and the aforementioned medicament which is a specific inhibitor against a protein kinase and/or its analogous enzyme. [0012] From another aspect, the present invention provides a medicament for reducing a side effect resulting from a cancer therapy based on the mode of action of DNA injury which comprises as an active ingredient a compound represented by the aforementioned general formula (I) or a physiologically acceptable salt thereof. [0013] From further another aspect, the present Invention provides use of the compound represented by the aforementioned general formula (I) or the physiologically acceptable salt thereof for manufacture of the aforementioned medicament; a method of enhancing an effect of cancer therapy based on the mode of action of DNA injury in a mammal including a human, which comprises the step of applying a cancer therapy based on the mode of action of DNA injury to a cancer patient, and the step of administering the compound represented by the aforementioned general formula (I) or the physiologically acceptable salt thereof at a dose sufficient to potentiate the effect of the aforementioned cancer therapy; a method of reducing a side effect resulting from a cancer therapy based on the mode of action of DNA injury in a mammal including a human, which comprises the step of applying a cancer therapy based on the mode of action of DNA injury to a cancer patient, and the step of administering the compound represented by the aforementioned general formula (I) or the physiologically acceptable salt thereof at a dose sufficient to reduce the side effect of the aforementioned cancer therapy. [0014] Furthermore, the present invention provides, a compound represented by the general formula (II) or a salt thereof. [0015] wherein A represents a C3 to C6 cycloalkyl group which may be substituted, a C6 to C10 aryl group which may be substituted, or a 4 to 10-membered monocyclic or bicyclic unsaturated, partly saturated or saturated heterocyclic group (said heterocyclic group may be substituted) which comprises 1 to 4 hetero atoms selected from the group consisting of nitrogen atom, oxygen atom, and sulfur atom; B represents a single bond or a methylene group which may be substituted; and W and X independently represent a hydrogen atom or a C1 to C6 alkyl group which may be-substituted, or W may combine with a substituent of A to represent a C1 to C4 alkylene group (said alkylene group may be substituted); Y represents a hydrogen atom or a C1 to C6 alkyl group which may be substituted, or Y may combine with a substituent of A to represent a C1 to C4 alkylene group (said alkylene group may be substituted); and n represents 0 or 1. [0016] Furthermore, the present invention provides a medicament comprising as an active ingredient a compound represented by the aforementioned general formula (II) or a physiologically acceptable salt thereof. This medicament can be used as a medicament to potentiate the effect of cancer therapy based on the mode of action of DNA injury. According to preferred embodiments of the present invention, provided are the aforementioned medicament wherein the cancer therapy based on the mode of action of DNA injury is carried out by the administration of an anticancer agent and/or radiation; the aforementioned medicament wherein the anticancer agent is selected from the group consisting of bleomycin, adriamycin, cisplatin, cyclophosphamide, mitomycinC, and their derivatives; and the aforementioned medicament which is a specific inhibitor of a protein kinase and/or analogous enzyme thereof. [0017] From another aspect, the present invention provides a medicament which comprises the compound represented by the aforementioned general formula (II) or the physiologically acceptable salt thereof as an active ingredient, and which reduces a side effect resulting from a cancer therapy based on the mode of action of DNA injury. [0018] From further another aspect, the present invention provides use of the compound represented by the aforementioned general formula (II) or the physiologically acceptable salt thereof for manufacture of the aforementioned medicament; a method of enhancing the effect of a cancer therapy based on the mode of action of DNA injury in a mammal including a human, which comprises the step of applying a cancer therapy based on the mode of action of DNA injury to a cancer patient and the step of administering the compound represented by the aforementioned general formula (II) or the physiologically acceptable salt thereof at a dose sufficient to potentiate the effect of the aforementioned cancer therapy; a method of reducing a side effect resulting from a cancer therapy based on the mode of action of DNA injury in a mammal including a human, which comprises the step of applying a cancer therapy based on the mode of action of DNA injury to a cancer patient and the step of administering the compound represented by the aforementioned general formula (II) or the physiologically acceptable salt thereof at a dose sufficient to potentiate the effect of the aforementioned cancer therapy. BEST MODE FOR CARRYING OUT THE INVENTION [0019] The terms used in the present specification have the following meanings. [0020] The alkyl group may be straight chain, branched chain, cyclic, and combination of these unless otherwise specifically mentioned. More specifically, examples include methyl group, ethyl group, n-propyl group, isopropyl group, cyclopropyl group, n-butyl group, isobutyl group, sec-butyl group, tert-butyl group, cyclobutyl group, cyclopropylmethyl group, n-pentyl group, isopentyl group, neopentyl group, tert-pentyl group, cyclopentyl group, n-hexyl group, cyclohexyl group, 3,3-dimethylbutyl group, 2-ethylbutyl group, 2-methylpentyl group, 3-methylpentyl group, or 4-methylpentyl group. An alkyl moiety of other substituents containing the alkyl moiety have the same meaning. The alkylene group may either be a straight chain or a branched chain. [0021] Where a cycloalkyl group is specifically referred to, for example, a 4 to 8-membered, particularly a 5 to 7-membered cycloalkyl group is preferred. The cycloalkyl group may either be monocyclic or polycyclic, however, a monocyclic cycloalkyl group is preferable. A cycloalkyl moiety of other substituents (for example, cycloalkyl-substituted alkyl group) containing the cycloalkyl moiety has the same meaning. In the cycloalkyl-substituted alkyl group, an alkyl moiety bonding to the cycloalkyl group is preferably either a straight chain or a branched chain, and preferred examples include a C1 to C4 alkyl group. Preferably, methyl group or ethyl group, and most preferably methyl group is used. [0022] For the aryl group, any monocyclic or polycyclic aryl group may be used. For example, phenyl group, naphthyl group, or anthryl group may be suitably used, and it is more preferable to use phenyl group or naphthyl group. An aryl moiety of other substituents containing the aryl moiety (for example, aryl-substituted alkyl group) has the same meaning. [0023] A type of a heteroatom contained as a ring-constituting atom in a heteroaryl group that constitutes a heteroaryl-substituted alkyl group is not particularly limited. The heteroatom may preferably be one or two or more heteroatoms selected from the group consisting of oxygen atom, nitrogen atom, and sulfur atom. An aromatic heterocycles that constitutes a heteroaryl group may either be monocyclic or polycyclic. [0024] An alkyl moiety constituting an aryl-substituted alkyl group or a heteroaryl-substituted alkyl group may-preferably be either a straight chain or a branched chain. For example, a C1 to C4 alkyl group may be suitably used. Preferably, methyl group or ethyl group, most preferably methyl group is used. [0025] A cyclic hydrocarbon group may either be monocyclic or polycyclic. Furthermore, the cyclic hydrocarbon group may be saturated, partly saturated, or completely saturated. Examples include any of an aryl group or a cycloalkyl group, or a partly saturated aryl group (for example, 1,2,3,4-tetrahydro-1-naphthyl group). A cyclic structure formed by biding of Z to R may be either monocyclic or polycyclic. Preferably, the cyclic structure may be a polycyclic ring structure, more preferably, a bicyclic ring structure. [0026] A type of a 4 to 10-membered monocyclic or bicyclic, and unsaturated, partly saturated, or completely saturated heterocyclic group is not particularly limited. Examples include thienyl group, furyl group, pyrrolyl group, oxazolyl group, isoxazolyl group, thiazolyl group, imidazolyl group, pyrazolyl group, benzothiophenyl group, benzofuranyl group, isobenzothiophenyl group, isobenzofuranyl group, indolyl group, isoindolyl group, indolizinyl group, 1H-indazolyl group, purinyl group, benzothiazolyl group, benzoxazolyl group, benzimidazolyl group, 1,2,3-thiadiazolyl group, 1,2,4-thiadiazolyl group, 1,8,4-thiadiazolyl group, 1,3,4-oxadiazolyl group, 1,2,3-triazolyl group, 1,2,4-triazolyl group, tetrazolyl group, chromenyl group, pyridyl group, pyridazinyl group, pyrimidinyl group, pyrazinyl group, quinolizinyl group, quinolyl group, isoquinolyl group, phthalazinyl group, naphthyridinyl group, quinoxalinyl group, quinazolinyl group, cinnolinyl group, pteridinyl group, 1,2,4-triazinyl group, chromanyl group, isochromanyl group, azetidinyl group, 2-oxoazetidinyl group, pyrrolidinyl group, pyrrolinyl group, imidazolidinyl group, imidazolinyl group, pyrazolidinyl group, pyrazolinyl group, piperidyl group, piperazinyl group, morpholino group, morpholinyl group, thiomorpholino group, thiomorpholinyl group, indolinyl group, isoindolinyl group, 1,2,3,4-tetrahydroquinolyl group, quinuclidinyl group, and methylenedioxyphenyl group. [0027] In the present specification, when a certain functional group is defined as “which may be substituted”, kinds, numbers, and positions of substituents existing in the functional groups are not particularly limited. Examples of these substituents include halogen atoms (any of fluorine atom, chlorine atom, bromine atom, or iodine atom is acceptable), hydroxy group, a C1 to C6 alkyl group, a C2 to C6 alkenyl group, a C2 to Co alkynyl group, a C6 to C10 aryl group, a C7 to C12 aralkyl group, a C1 to C8 hydroxyalkyl group, trifluoromethoxy group, a C1 to C6 alkoxy group, a C2 to C6 alkenyloxy group, a C2 to C6 alkynyloxy group, a C6 to C10 aryloxy group, a C7 to C1-2 aralkyloxy group, a C1 to C6 hydroxyalkyloxy group, a C1 to C6 alkanoyl group, a C6 to C10 aroyl group, carboxy group, a C1 to C6 alkoxycarbonyl group, carbamoyl group, thiol group, a C1 to C6 alkylthio group, a C6 to C10 arylthio group, a C7 to C1-2 aralkylthio group, a C1 to C6 hydroxyalkylthio group, sulfonic acid group, a C1 to C6 alkylsulfonyl group, a C6 to C10 arylsulfonyl group, sulfamoyl group, formyl group, hydroxyimino group, a C1 to C6 alkoxyimino group, phenoxyimino group, cyano group, nitro group, amino group, formylamino group, a C1 to C6 alkanoylamino group, a C6 to C10 aroylamino group, a C1 to C6 alkoxycarbonylamino group, a C1 to C6 alkylsulfonylamino group, a C6 to C10 arylsulfonylamino group, amidino group, guanidino group, silyl group, stannyl group, and a heterocyclic group. These substituents may further be substituted with the aforementioned substituents. Examples include a halogenated alkyl group, a halogenated alkoxy group, a carboxy-substituted alkyl group, and an alkyl-substituted amino group. Furthermore, two or more substituents of the aforementioned substituents may form a ring together with the atoms to which they bind (carbon atom, nitrogen atom, boron atom, and the like). In these rings, one or more hetero atoms selected from the group consisting of nitrogen atom, oxygen atom, and sulfur atom may be included as ring-constituting atoms, and one or more substituents may exist on the ring, The ring may either be monocyclic or fused cyclic, or may be unsaturated, partly saturated, or completely saturated. [0028] In the general formula (I), preferable examples of an aryl-substituted alkyl group represented by R include benzyl group, 1-phenethyl group, 2-phenethyl group, 2-phenylpropan-2-yl group, 1-naphthylmethyl group, 2-naphthylmethyl group, and 1-(1-naphthyl)ethyl group. When said aryl-substituted alkyl group has one or more substituents on the aryl ring, kinds of substituents, substituting positions, and numbers of the substituents are not limited. Examples of the substituents include halogen atoms (chlorine atom or fluorine atom), a C1 to C4 alkyl group, a C1 to C4 halogenated alkyl group (such as trifluoromethyl group), a C1 to C4 alkoxy group, phenyl group, a substituted phenyl group (such as tolyl group), methylenedioxy group, an aralkyl group (such as benzyl group), an aralkyloxy group (such as benzyloxy group), hydroxy group, nitro group, amino group, a substituted-amino group (such as dimethylamino group), sulfonamide group, a substituted-sulfonamide group, carboxyl group, an alkylsulfonyl group, or sulfamoyl group. However, the substituents on the aryl ring are not limited to those examples. One to three of these substituents may exist on the aryl ring, and when two or more substituents exist, they may be the same or different. [0029] Examples of a heteroaryl group constituting a heteroaryl-substituted alkyl group represented by R include, but not limited thereto, pyridyl group, furyl group, thienyl group, benzimidazolyl group, and quinolyl group. An example of a cycloalkyl group constituting a cycloalkyl-substituted alkyl group represented by R includes cyclohexyl group. Examples of a cyclic hydrocarbon group represented by R include phenyl group, naphthyl group, indanyl group, 1,2,3,4-tetrahydro-1-naphthyl group, and cyclohexyl group. Examples of a ring formed by Z binding to R include 1,3-dihydro-2-isoindolyl group, and 1,2,3,4-tetrahydroisoquinolynyl group. The compounds wherein R is, benzyl group are particularly preferable. Z may preferably be a hydrogen atom. [0030] The compounds represented by the general formula (I) may form salts. Kinds of salts are not particularly limited. When acidic groups exist, examples include metal salts such as lithium salt, sodium salt, potassium salt, magnesium salt, and calcium salt, or ammonium salts such as ammonium-salt, methylammonium salt, dimethylammonium salt, trimethylammonium salt, and dicyclohexylammonium salt, and when basic groups exist, examples include mineral acid salts such as hydrochloride, hydrobromide, sulfate, nitrate, and phosphate, or organic acid salts such as methane sulfonate, benzene sulfonate, para-toluene sulfonate, acetate, propionate, tartrate, fumarate, maleate, malate, oxalate, succinate, citrate, benzoate, mandelate, cinnamate, and lactate. Salts may sometimes be formed with amino acids such as glycine. As active ingredients of the medicaments of the present invention, pharmacologically acceptable salts are suitable. [0031] The compounds or salts thereof represented by the general formula (I) may exist as hydrates or solvates. Furthermore, the compounds represented by the general formula (I) may sometimes have one or more asymmetric carbons, and may exist as stereoisomers such as optically active isomers and diastereomers. As active ingredients of the medicaments of the present invention, a pure form of a stereoisomer, any mixture of enantiomers or diastereomers, a racemate or the like may be used. [0032] Furthermore, when the compounds represented by the general formula (I) have an olefinic double bond, its configuration may be in either E or Z. As an active ingredient of the medicament of the present invention., a geometrical isomer in either of the configurations or a mixture thereof may be used. [0033] Examples of a class of compounds suitable as the active ingredients of the medicaments of the present invention include the compounds represented by the general formula (II). The compounds represented by the general formula (II) may form salts, and examples include those salts exemplified for the compounds represented by the general formula (I). The compounds or salts thereof represented by the general formula (II) may exist as hydrates or solvates. Any of these substances fall within the scope of the present invention. Furthermore, the compounds represented by the general formula (II) may sometimes have one or more asymmetric carbon atoms, and may exist as stereoisomers such as optically active isomers and diastereomers. A pure form of the stereoisomer, any mixture of the enantiomers or diastereomers, a racemate and the like all fall within the scope of the present invention. Furthermore, when the compounds represented by the general formula (II) have an olefinic double bond, its configuration may be in either E or Z. A geometrical isomer in either of the configurations or a mixture thereof falls within the scope of the present invention. [0034] In the compounds represented by the general formula (II), n may preferably be 1. When n is 0, it is preferable that B is a single bond and A is an aryl group. In the compounds represented by the general formula (II), examples of the moiety represented by —(C(W)(X))n-B-A are similar to those explained for R in the above general formula (I). [0035] Examples of the compounds included in the general formula (II) are shown in the following. However, the compounds of the present invention are not limited to the following compounds. Compound Number Q 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 [0036] The compounds represented by the general formula (II) of the present invention can be prepared, for example, by a method described in the reaction scheme 1. [0037] As for 5-(acetylamino)-1-naphthalenesulfonyl chloride (1), methods for preparation of the compound are already disclosed in the U.S. Pat. No. 5,378,715 and the Japanese Patent No.2628451. As for the amine (2) wherein A, B, W, X, and Y have the same meanings as those defined in the general formula (II), most of the amines in the free form or acid addition salts are widely available in the market, and the commercial products can be obtained and directly used. Furthermore, the amine (2) wherein A, B, W, X, and Y have the same meanings as those defined in the general formula (II) can also be prepared by methods readily understandable by those skilled in the art (for example, reduction of a corresponding nitro compound, reduction of a cyano compound, reduction of a carbamoyl compound and the like), and it is also understandable that the resulting amine can be used for preparation of the compounds of the present invention. [0038] By reacting 5-(acetylamino)-1-naphthalenesulfonyl chloride (1) with the amine (2) wherein A, B, W, X, and Y have the same meanings as those defined in the general formula (II), the compound of the formula (3) wherein A, B, W, X, and Y have the same meanings as those defined in the general formula (II) can be obtained, This reaction is carried out in the presence or absence of a base and/or a catalyst, with or without a solvent, at a reaction temperature of −30° C. to a refluxing temperature of a solvent used. [0039] Examples of the bases include inorganic bases such as sodium hydroxide, potassium hydroxide, sodium carbonate, potassium carbonate, and sodium hydrogencarbonate, or organic bases such as pyridine, triethylamine, ethyldiisopropylamine, and N,N-diethylaniline. Examples of the catalysts include 4-dimethylaminopyridine and tetrabutylammoniumbromide. Any solvent can be used as long as it does not inhibit the reaction, and examples include ethyl acetate, dichloromethane, dichloroethane, chloroform, tetrahydrofuran, 1,2-dimethoxyethane, 1,4-dioxane, benzene, toluene, monochlorobenzene, 1,2-dichlorobenzene, N,N-dimethylformamide, N-methylpyrrolidone, methanol, ethanol, 1-propanol, 2-propanol, acetone, 2-butanone, and water. These solvents can be used alone or as a mixture, or as two phase solvents. [0040] The acetyl group of the resulting compound of the formula (8) wherein A, B, W, X, and Y have the same meanings as those defined in the general formula (II) is then hydrolyzed to prepare the compounds represented by the general formula (II). This reaction is carried out in the presence of an acid or a base, with or without a solvent, at a reaction temperature of from −0° C. to a refluxing temperature of a solvent. [0041] Examples of the acids include mineral acids such as hydrochloric acid and sulfuric acid, and Lewis acids such as triethyloxonium tetrafluoroborate. Examples of the bases include inorganic bases such as sodium hydroxide, potassium hydroxide, and metallic sodium, or organic bases such as hydrazine. Any solvent can be used as long as it does not inhibit the reaction. Examples include tetrahydrofuran, 1,2-dimethoxyethane, 1,4-dioxane, methanol, ethanol, 1-propanol, 2-propanol, water, and acetic acid, and these solvents can be used alone or as a mixed solvent. [0042] Examples of preparation methods of the salts of the compounds represented by the general formula (II) include a direct preparation of salts by a hydrolysis of the acetyl group of the compounds of the aforementioned formula (8) wherein A, B, W, X, and Y have the same meanings as those defined in the general formula (II), and a preparation wherein the free form of the compounds represented by the general formula (II) is first prepared by the above hydrolysis, and then the free form is converted to salts. These methods are easily understood by those skilled in the art. [0043] In the examples of the specification, methods for preparation of typical compounds falling within the general formula (II) are explained in detail. Accordingly, those skilled in the art can prepare any compound encompassed within the general formula (II) by referring to the general explanations of the aforementioned preparation methods and specific explanations of the preparation methods of the examples, and by choosing appropriate starting materials, reagents, and reaction conditions and by adding appropriate modification and alteration to these methods, if necessary. [0044] Medicaments of the present invention can be used to enhance the effect of cancer therapy based on the mode of action of DNA injury, including cancer chemotherapies by using anticancer agents and radiation therapies of cancer that induce DNA injury. Typical examples of anticancer agents that induces DNA injury include bleomycin, adriamycin, cisplatin, cyclophosphamide, and mitomycinC. Besides these derivatives, any of anticancer agents involving the mode of action of DNA injury can be targets of the medicaments of the present invention. The medicaments of the present invention may be used where either of a cancer chemotherapy using anticancer agents or a radiation therapy of cancer that induce DNA injury is solely carried out, or in a cancer therapy where a combination of these therapies is carried out. [0045] Although it is not intended to be bound by any specific theory, the medicament of the present invention can bind to a protein kinase or its analogous enzyme that is activated after DNA injury, and terminate the functions of the enzyme to kill cancer cells. As a result, the medicaments can enhance the effect of the cancer therapy and can lower a dose of the anticancer agent and/or radiation for the cancer therapy, thereby reduce side effects resulting from the cancer therapy. [0046] As the active ingredient of the medicament of the present invention, a hydrate or a solvate of the compounds represented by the aforementioned general formulas (I) or (II) or physiologically acceptable salts thereof may be used. Furthermore, when the compound contains one or more asymmetric carbon atoms, any of a pure form of optically active compound or any mixture of optically active compounds, or a racemate may be used. As the active ingredient of the medicament of the present invention, one or more kinds of substances selected from the group consisting of the aforementioned compound and a physiologically acceptable salt thereof, and a hydrate thereof and a solvate thereof may be used. [0047] As the medicament of the present invention, the aforementioned substance, per se, may be administered., Preferably, the medicament may be administered as a pharmaceutical composition for oral or parenteral administration that may be prepared by methods well known to those skilled in the art. Examples of pharmaceutical compositions suitable for oral administration include tablets, capsules, powders, subtilized granules, granules, solution, and syrup, and examples of pharmaceutical compositions suitable for parenteral administration include Injections, suppositories, inhalants, instillations, nasal drops, ointments, percutaneous absorbents, transmucosal absorptions, cream, and plaster. [0048] The aforementioned pharmaceutical compositions can be prepared by adding pharmacologically and pharmaceutically acceptable additives. Examples of pharmacologically and pharmaceutically acceptable additives include excipients, disintegrators or disintegration aids, binders, lubricants, coating agents, colorants, diluents, base materials, dissolving aids or dissolution adjuvants, isotonizing agents, pH modifiers, stabilizers, propellants, and adhesives. One or more kinds of anticancer agents based on the mode of action of DNA injury may be added to the aforementioned pharmaceutical compositions. [0049] A dose of the medicament of the present invention is not particularly limited. The dose may be selected appropriately depending on a kind of the active ingredient and a kind of a cancer therapy. Further, the dose may be appropriately increased or decreased depending on various factors that should be generally considered such as the weight and age of a patient, a kind and symptom of a disorder, and an administration route. Generally, for an oral administration, the medicament may be used in a range of 0.01 to 1,000 mg for an adult per day. EXAMPLES [0050] The present invention will be explained more specifically with reference to the following examples. However the scope of the present invention is not limited to the following examples. Example 1 Preparation of 5-amino-N-[(1-naphthalenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No, 1). [0051] (1) Preparation of N-[5-[[[(1-naphthalenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0052] 1-Naphthylmethylamine (174 mg, 1.1 mmol) was dissolved in tetrahydrofuran (10 ml), and 5-(acetylamino)-1-naphthalenesulfonyl chloride (284 mg, 1 mmol) was added under ice cooling and stirring. Then, triethylamine (0.17 mL, 1.2 mmol) was added and the mixture was stirred at room temperature for 1 hour. The reaction mixture was poured into diluted hydrochloric acid and extracted with ethyl acetate. The ethyl acetate layer was washed successively with aqueous sodium hydrogen carbonate, water, and saturated brine, and after the layer was dried over anhydrous sodium sulfate, the residue obtained by evaporation of the solvent under reduced pressure was crystallized by a mixed solvent of ethyl acetate/diisopropyl ether to give the title compound as a light brown crystal (325 mg, 80.4%). [0053]1H-NMR(DMSO-d6, δ): 2.21(3H, s), 4.45(21, d, J=5.7 Hz), 7.73-7.41(5H, m), 7.44-7.49(1H, m), 7.65(2H, dd, J=8.1, 7.8 Hz), 7.76(1H, d, J=7.5 Hz), 7.80(1H, d, J=7.5 Hz), 7.87-7,91(2H, m), 8.20(1H, dd, J=7.5, 0.9 Hz), 8.35(1H, d, J=8.7 Hz), 8.54-8.57(2H, m), 10.09(1H, s). [0054] (2) Preparation of 5-amino-N-[(1-naphthalenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0055] N-[5-[[[(1-naphthalenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide (226 mg, 0.56 mmol) was suspended in a mixed solution of 1-propanol (8 ml), concentrated hydrochloric acid (1 ml) and water (1 ml), and the mixture was refluxed for 1 hour. The crystal precipitated by cooling of the reaction mixture to room temperature was filtered and washed with the mixed solvent of 1-propanol/diisopropyl ether under reflux to give the title compound an a white crystal (201 mg, 90.8%). [0056]1H-NMR(DMSO-d6, δ): 4.33-4.44(2H, m), 7.09-7,21(1H, m), 7.88-7.41(3H, m), 7.45-7.50(2H, m), 7.54-7.61(1H, m), 7.80(1H, dd, J=8.1, 1.8 Hz), 7.87-7.98(2H, m), 8.15(1H, d, J=7.2 Hz), 8.35(1H, d, J=8.7 Hz), 8.42-8.51(1H, m). [0057] The compounds from Example 2 to Example 66 were prepared in the same manner as the method of Example 1. The yield and the physical properties data are described below. Details of preparation are also described for examples carried out under different conditions. Example 2 Preparation of 5-amino-N-[(2-naphthalenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 2) [0058] (1) Preparation of N-[5-[[[(2-naphthalenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0059] Yield: 76% [0060]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.21(2H, d, J=6.0 Hz), 7.29(1H, dd, J=8.4, 1.5 Hz), 7.45(2H, dt, J=9.3, 3.3 Hz), 7.61(2H, dd, J=8.4, 7.5 Hz), 7.73(4H, m), 8.17(1H, d, J=6.6 Hz), 8.31(1H, d, J=8.4 Hz), 8.58(1H, d, J=8.4 Hz), 8.65(1H, t, J=6.0 Hz), 10.05(1H, s). [0061] (2) Preparation of 5-amino-N-[(2-naphthalenyl)methyl)-1-naphthalenesulfonamide hydrochloride. [0062] Yield: 92% [0063]1H-NMR(DMSO-d 6, δ): 4.12(2H, d, J=6.0 Hz), 7.29(1H, dd, J=8.4, 1.8 Hz), 7.45(5H, m), 7.66(5H, m), 7.72(1H, m), 7.75(1H, d, J=8.4 Hz), 7.88(1H, m), 8.18(1H, dd, J=7.6, 0.9 Hz), 8.86(1H, d, J=8.4 Hz), 8.40(1H, d, J=8.7 Hz), 8;66(1H, t, J=6.0 Hz). Example 3 Preparation of 5-amino-N-[(2-chlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 3) [0064] (1) Preparation of N-[5-[[[(2-chlorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0065] Yield: 74.2% [0066]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.13(2H, s), 7.13-7.23(2H, m), 7.28-7.37(2H, m), 7.61-7.71(2H, m), 7.76(1H, d, J=7.2 Hz), 8.14(1H, dd, J=7.5, 1.2 Hz), 8.32(1H, d, J=8.4 Hz), 8.52(1H, d, J=8.7 Hz), 8.60(1H, s), 10.07(1H, s). [0067] (2) Preparation of 5-amino-N-[(2-chlorophenyl)methyl]-1-naphthalene sulfonamide hydrochloride. [0068] Yield: 79.1% [0069]1H-NMR(DMSO-d6, δ): 4.11(2H, d, J=6.0 Hz), 7.14-7.23(2H, m), 7.28-7.31(1H, m), 7.34-7.37(2H, m), 7.56-7.65(2H, m), 8.14(1H, d, J=8.1 Hz), 8.32(2H, t, J=8.4 Hz), 8.61(1H, t, J=6.0 Hz). Example 4 Preparation of 5-amino-N-[(3-chlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 4) [0070] (1) Preparation of N-(5-[[[(3-chlorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0071] Yield: 71.6% [0072]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.06(2H, d, J=60.5 Hz), 7.07-7.12(1H, m), 7.18-7.20(2H, m), 7.60-7.71(2H, m), 7.76(1H, d, J=7.2 Hz), 8.13(1H, dd, J=7.2, 1.2 Hz), 8.93(1H, d, J=8:7 Hz), 8.50(1H, d, J=8.4 Hz), 8.62(1H, d, J=6.8 Hz), 10.0(1H, s). [0073] (2) Preparation of 5-amino-N-[(3-chlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0074] Yield: 82.8% [0075]1H-NMR(DMSO-d6, δ): 4.05(2H, d, J=6.3 Hz), 7.06-7.11(1H, m), 7.16-7.21(3H, m), 7.43(1H, d, J=7.5 Hz), 7.66-7.67(2H, m), 8.14(1H, d, J=8.4 Hz), 8.34(2H, d, J=8.7 Hz), 8.64(1H, t, J=6.3 Hz). Example 5 Preparation of 5-amino-N-[(4-chlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 6) [0076] (1) Preparation of N-[5-[[[(4-chlorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0077] Yield: 72.9% [0078]1H-NMR(DMSO-d6, δ): 2.20(3H, S), 4.02(2H, d, J=6.0 Hz), 7.17(2H, d, J=8.4 Hz), 7.25(2H, d, J=8.7 Hz), 7.61-7.71(2H, m), 7.77(1H, d, J=7.6 Hz), 8.13(1H, dd, J=7.5, 1.2 Hz), 8.34(1H, d, J=9.0 Hz), 8.50(1H, d, J=8.4 Hz), 8.59(1H, t, J=6.0 Hz), 10.08(1H, 8). [0079] (2) 5-Amino-N-[(4-chlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0080] Yield: 77.8% [0081]1H-NMR(DMSO-d6, δ): 4.01(2H, d, J=6.0 Hz), 7.18(2H, d, J=8.4 Hz), 7.26(2H, d, J=8.4 Hz), 7.38(1H, d, J=7.5 Hz), 7.59(1H, t, J=8.4 Hz), 7.64(1H, t, J=8.4 Hz), 8.12(1H, d, J=7.5 Hz), 8.30(1H, d, J=8.4 Hz), 8.85(1H, d, J=8.4 Hz), 8.58(1H, t, J=6.3 Hz). Example 6 Preparation of 5-amino-N-[(2,4-dichlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 6) [0082] (1) Preparation of N-[5-[[[(2,4-dichlorophenyl)methyl]amino]sulfonyl-1-naphthalenyl]acetamide. [0083] Yield: 76.5% [0084]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.10(2H, s), 7.26(1H, dd, J=8.4, 1.2 Hz), 7.36(11H, d, J=8.7 Hz), 7.44(1H, d, J=2.1 Hz), 7.60-7.71(2H, m), 7.78(1H, d, J=7.5 Hz), 8.12(1H, dd, J=7.5, 1.2 Hz), 8.34(1H, d, J=8.4 Hz), 8.49(1H, d, J=8.4 Hz), 8.66(1H, 9), 10.07(1H, s). [0085] (2) Preparation of 5-amino-N-[(2,4-chlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0086] Yield: 70.4% [0087]1H-NMR(DMSO-d6, δ): 4.08(2H, d, J=6.0 Hz), 7.25-7.29(2H, m), 7.37(1H, d, J=8.4 Hz), 7.45(1H, d, J=1.8 Hz), 7.55(1H, t, J=8.4 Hz), 7.59(1H, t, J=8.4 Hz), 8.10(1H, d, J=7.2 Hz), 8.20(1H, d, J=8.7 Hz), 8.95(1H, d, J=9.0 Hz), 8.62(1H, t, J=6.0 Hz). Example 7 Preparation of 5-amino-N-[(3,4-dichlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 7) [0088] (1) Preparation of N-6-[[[(3,4-dichlorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0089] Yield: 71.1% [0090]1H-NMR(DMSO-d6, δ): 2.20(8H, s), 4.06(1H, d, J=6.0 Hz), 7.11(1H, dd, J=8.4, 2.1 Hz), 7.82(1H, d, J=1.5 Hz), 7.41(1H, d, J=8.4 Hz), 7.56-7.71(2H, m), 7.78(1H, d, J=7.5 Hz), 8.12(1H, d, J=6.3 Hz), 8.34(1H, d, J=8.7 Hz), 8.48(1H, d, J=8.7 Hz), 8.64(1H, t, J=6.0 Hz), 10.05(1H, s). [0091] (2) Preparation of 5-amino-N-[(3,4-dichlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0092] Yield: 87.8% [0093]1H-NMR(DMSO-d6, δ): 4.04(2H, d, J=6.6 Hz), 7.11(1H, dd, J=8.4, 1.2 Hz), 7.33(1H, d, J=2.1 Hz), 7.36(1H, d, J=7.5 Hz), 7.42(1H, d, J=8.4 Hz), 7.57-7.66(2H, m), 8.12(1H, d, J=7.5 Hz), 8.27(1H, d, J=8.4 Hz), 8.85(1H, d, J=8.4 Hz), 8.64(1H, t, J=6.3 Hz). Example 8 Preparation of 5-amino-N-[(3,5-dichlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 8) [0094] (1) Preparation of N-[5-[[[(3,5-dichlorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0095] Yield: 77% [0096]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.08(2H, d, J=6.3 Hz), 7.12(2H, d, J=1.8 Hz), 7.31(1H, dd, J=1.8, 1.5 Hz), 7.63(1H, dd, J=8.4, 7.5 Hz), 7.69(1H, dd, J=8.4, 7.6 Hz), 7.77(1H, d, J=7.2 Hz), 8.12(1H, dd, J=7.2, 0.9 Hz), 8.33(1H, d, J=8.4 Hz), 8.47(1H, d, J=8.4 Hz), 8.67(1H, t, J=6.3 Hz), 10.05(1H, s). [0097] (2) Preparation of 5-amino-N-[(3,5-dichlorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0098] Yield: 90% [0099]1H-NMR(DMSO-d6, δ): 4.07(2H, d, J=6.3 Hz), 7.12(2H, d, J=1.5 Hz), 7.32(1H, dd, J=1.8, 1.5 Hz), 7.37(1H, d, J=7.5 Hz), 7.61(2H, ddd, J=8.4, 7.5, 2.1 Hz), 8.12(1H, d, J=7.2 Hz), 8.27(1H, d, J=8.7 Hz), 8.84(1H, d, J=8.4 Hz), 8.68(1H, t, J=60.5 Hz). Example 9 Preparation of 5-amino-N-[(2-fluorophenyl)methyl-1-naphthalenesulfonamide hydrochloride (Compound No. 9) [0100] (1) Preparation of N-[5-[[[(2-fluorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0101] Yield: 75% [0102]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.09(2H, d, J=6.0 Hz), 7.00(2H, m), 7.21(2H, m), 7.62(1H, dd, J=8.4, 7.5 Hz), 7.66(1H, dd, J=8.1, 7.8 Hz), 7.75(1H, d, J=7.5 Hz), 8.13(1H, dd, J=7.6, 0.9 Hz), 8.32(1H; d, J=8.4 Hz), 8.50(1H, d, J=8.4 Hz), 8.56(1H, t, J=6.0 Hz), 10.05(1H, s). [0103] (2) Preparation of 5-amino-N-[(2-fluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0104] Yield: 69% [0105]1H-NMR(DMSO-d6, δ): 4.08(2H, d, J=6.0 Hz), 6.97(1H, d, J=8.1 Hz), 7.00(1H, m), 7.21(2H, m), 7.44(1H, d, J=7.5 Hz), 7.61(1H, dd, J=8.4, 7.8 Hz), 7.64(1H, dd, J=8.7, 7.5 Hz), 8.14(1H, dd, J=7.2, 0.6 Hz), 8.33(1H, d, J=8.1 Hz), 8.36(1H, d, J=8.1 Hz), 8.68(1H, t, J=6.0 Hz). Example 10 Preparation of 5-amino-N-[(3-fluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 10) [0106] (1) Preparation of [0107] N-(5-[[[(3-fluorophenyl)methyl]amino]sulfonyl)-1-naphthalenyl]acetamide. [0108] Yield: 77.2% [0109]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.06(2H, d, J=6.3 Hz), 6.94-6.99(5H, m), 7.17-7.25(1H, m), 7.63(1H, dd, J=8.4, 7.2 Hz), 7.66-7.71(1H, m), 7.76(1H, d, J=6.9 Hz), 8.13(1H, dd, J=8.4, 1.2 Hz), 8.33(1H, 4, J=8.4 Hz), 8.51(1H, d, J=8.4 Hz), 8.61(1H, t, J=6.3 Hz), 10.06(1H, s). [0110] (2) Preparation of 5-amino-N-[(3-fluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride [0111] Yield: 86.8% [0112]1H-NMR(CD3OD, δ): 4.14(2H, s), 6.78-8.84(3H, m), 7.03-7.10(1H, m), 7.70-7.80(5H, m), 8.18(1H, dt, J=8.7, 0.9 Hz), 8.32(1H, dd, J=7.5, 1.2 Hz), 8.82(1H, dt, J=8.7, 0.9 Hz). Example 11 Preparation of 5-amino-N-[(4-fluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 11) [0113] (1) Preparation of N-(5-[[[(4-fluorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0114] Yield: 78.7% [0115]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.01(2H, d, J=6.0 Hz), 6.96-7.04(2H, m), 7.14-7.21(2H, m), 7.63(1H, dd, J=8.4, 7.6 Hz), 7.67(1H, t, J=8.4 Hz), 7.76(1H, d, J=7.5 Hz), 8.12(1H, dd, J=7.5, 1.2 Hz), 8.33(1H, d, J=8.7 Hz), 8.50(1H, d, J=8.7 Hz), 8.55(1H, t, J=6.0 Hz), 10.07(1H, s). [0116] (2) Preparation of 5-amino-N-[(4-fluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0117] Yield: 90.4% [0118]1H-NMR(CD3OD, δ): 4.10(2H, s), 6.73-6.80(2H, m), 6.99-7.06(2H, m), 7.71-7.79(3H, m), 8.19(1H, d, J=8.4 Hz), 8.30(1H, dd, J=7.5, 1.2 Hz), 8.81(1H, d, J=7.8 Hz). Example 12 Preparation of 5-amino-N-[(2,6-difluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 12) [0119] (1) Preparation of N-[6-[[[(2,6-difluorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0120] Yield: 75.9% [0121]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.07(2H, d, J=5.7 Hz), 6.79-6.87(2H, m), 7.21(tt, J=8.4, 6.6 Hz), 7.58-7.65(2H, m), 7.74(1H, d, J=7.2 Hz), 8.11(1H, d, J=7.2 Hz), 8.80(1H, d, J=8.4 Hz), 8.45(1H, d, J=8.7 Hz), 8.66(1H, t, J=5.7 Hz), 10.04(1H, s). [0122] (2) Preparation of 5-amino-N-[(2,6-difluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0123] Yield: 79.5% [0124]1H-NMR(CD3OD, δ): 4.28(2H, s), 6.50-6.58(2H, m), 7.02(1H, tt, J=8.4, 6.6 Hz), 7.66(3H, m), 8.14(1H, dt, J=8.4, 1.2 Hz), 8.32(1H, dd, J=8.4, 1.2 Hz), 8.75(1H, ddd, J=7.8, 2.1, 1.2 Hz). Example 13 Preparation of 5-amino-N-[(8,4-difluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 13) [0125] (1) Preparation of N-[6-[[[(3,4-difluorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0126] Yield: 71% [0127]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.04(2H, d, J=6.0 Hz), 6.97(1H, m), 7.18(2H, m), 7.63(1H, dd, J=8.4, 7.8 Hz), 7.68(1H, dd, J=8.4, 8.1 Hz), 7.77(1H, d, J=7, 5 Hz), 8.12(1H, d, J=7.5 Hz), 8.33(1H, d, J=8.4 Hz), 8.49(1H, d, J=8.4 Hz), 8.32(1H, t, J=66.0 Hz), 10.06(1H, s). [0128] (2) Preparation of 5 amino-N-[(8,4-difluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0129] Yield: 59% [0130]1H-NMR(DMSO-d6, δ): 4.02(2H, d, J=6.0 Hz), 6.95(1H, m), 7.18(2H, m), 7.38(1H, d, J=7, 2 Hz), 7.60(1H, t, J=7.5 Hz), 7.63(1H, dd, J=8.4, 7.5 Hz), 8.12(1H, d, J=7.2 Hz), 8.29(1H, d, J=8.7 Hz), 8.34(1H, d, J=8.4 Hz), 8.68(1H, t, J=6.0 Hz). Example 14 Preparation of 5-amino-N-[(3,5-difluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 14) [0131] (1) Preparation of N-[5-[[[(3,5-difluorophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0132] Yield: 75.9% [0133]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.08(2H, d, J=60.5 Hz), 6.80-6.86(2H, m), 6.96(1H, tt, J=9.3, 2.4 Hz), 7.63(1H, dd, J=8.4, 7.5 Hz), 7.66-7.72(1H, m), 7.77(1H, d, J=7.5 Hz), 8.18(1H, dd, J=7.2, 1.2 Hz), 8.33(1H, d, J=8.4 Hz), 8.48(1H, d, J=8.4 Hz), 8.68(1H, t, J=6.8 Hz), 10.06(1H, s). [0134] (2) Preparation of 5-amino-N-[(3,5-difluorophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0135] Yield: 76.9% [0136]1H-NMR(CD3OD, δ): 4.88(2H, s), 8.59-6.65(3H, m), 7.73-7.82(8H, m), 8.20(1H, dt, J=8.7, 1.2 Hz), 8.33(1H, dd, J=7.6, 1.2 Hz), 8.33(1H, dt, J=8.4, 1.2 Hz). Example 15 Preparation of 5-amino-N-[(2-methylphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 15) [0137] (1) Preparation of N-[6-[[[(2-methylphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0138] Yield: 74% [0139]1H-NMR(DMSO-d6, δ): 2.10(3H, s), 2.20(3H, s), 3.99(2H, 8), 7.01(5H, m), 7;16(1H, d, J=7.2 Hz), 7.62(1H, dd, J=8.4, 7.5 Hz), 7.67(1H, t, J=8.4 Hz), 7.76(1H, d, J=7.5H), 8.14(1H, d, J=7.2 Hz), 8.93(1H, d, J=8.4 Hz), 8.37(1H, brs), 8.56(1H, d, J=8.4 Hz), 10.07(1H, s). [0140] (2) Preparation of 5-amino-N-[(2-methylphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0141] Yield: 88% [0142]1H-NMR(DMSO-d6, 6): 2.09(3H, s), 3.99(2H, d, J=4.8 Hz), 7.05(3H, m), 7.15(1H, d, J=7.5 Hz), 7.41(1H, d, J=7.8 Hz), 7.60(1H, ddd, J=8.1, 7.8, 1.5 Hz), 7.65(1H, ddd, J=7.5, 7.2, 1.8 Hz), 8.15(1H, dd, J=7.6, 1.2 Hz), 8.36(3H, m). Example 16 Preparation of 5-amino-N-[(3-methylphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 16). [0143] (1) Preparation of N-[5-[[[(3-methylphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0144] Yield: 82.4% [0145]1H-NMR(DMSO-d6, 6): 2.10(8H, s), 2.20(3H, s), 4.00(2H, d, J=6.0 Hz), 6.86(1H, 2), 6.90-6.95(2H, m), 7.05(1H, t, J=7.5 Hz), 7.59-7.70(2H, m), 7.76(1H, d, J=7.2 Hz), 8.12(1H, dd, J=7.6, 1.2 Hz), 8.32(1H, d, J=8.4 Hz), 8.48-8.53(2H, m), 10.06(1H, s). [0146] (2) Preparation of 5-amino-N-[(9-methylphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0147] Yield: 86.9% [0148]1H-NMR(DMSO-d6, δ): 2.11(3H, s), 3.99(2H, d, J=6.0 Hz), 6.86(1H, s), 6.92(2H, t, J=8.4 Hz), 7.05(1H, t, J=7.8 Hz), 7.36(1H, d, J=7.2 Hz), 7.56-7.64(2H, in), 8.12(1H, d, J=7.5 Hz), 8.31(1H, d, J=6.9 Hz), 8.33(1H, d, J=7.8 Hz), 8.48(1H, t, J=6.0 Hz). Example 17 Preparation of 5-amino-N-[(4-methylphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 17) [0149] (1) Preparation of N-[6-[[[(4-methylphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0150] Yield: 45.0% [0151]1H-NMR(DMSO-d6, δ): 2.20(8H, s), 2.21(3H, s), 3.97(2H, d, J=6.0 Hz), 6.97-7.06(3H, m), 7.61-7,69(2H, m), 7.58(1H, d, J=7.5 Hz), 8.13(1H, dd, J=7.5, 1.2 Hz), 8.93(1H, d, J=8.7 Hz), 8.47(1H, t, J=6.0 Hz), 8.52(1H, d, J=8.7 Hz), 10.06(1H, s). [0152] (2) Preparation of 5-amino-N-[(4-methylphenyl)methyl]-1-naphthalene sulfonamide hydrochloride. [0153] Yield: 74.4% [0154]1H-NMR(DMSO-d6, δ): 2.22(9H, s), 3.96(2H, d, J=6.0 Hz), 6.98-7.04(3H, m), 7.30-7.36(1H, m), 7.56-7.65(2H, m), 8.12(1H, dd, J=7.2, 10.9 Hz), 8.28-8.31(1H, m), 8.35(1H, d, J=8.4 Hz), 8.45(1H, t, J=6.0 Hz). Example 18 Preparation of 5-amino-N-[[4-(1,1-dimethylethyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 18) [0155] (1) Preparation of N-[5-[[[[4-(1,1-dimethylethyl)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0156] Yield: 78.1% [0157]1H-NMR(CDCl3, δ): 1.25(9H, s), 2.36(3H, brs), 4.04(2H, d, J=5.7 Hz), 4.82(1H, t, J=6.7 Hz), 7.02(2H, d, J=8.4 Hz), 7.22(2H, d, J=8.7 Hz), 7.51-7.65(3H, m), 7.84(1H, d, J=7.2 Hz), 8.12(1H, d, J=8.4 Hz), 8.28(1H, d, J=7.2 Hz), 8.51(1H, d, J=8.7 Hz). [0158] (2) Preparation of 5-amino-N-[[4-(1,1-dimethylethyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0159] Yield: 81.6% [0160]1H-NMR(DMSO-d6, δ): 1.22(9H, s), 3.94(2H, d, J=6.0 Hz), 7.01(1H, d, J=7.5 Hz), 7.07(2H, d, J=8.4 Hz), 7.21(2H, d, J=8, 1 Hz), 7.46(1H, t, J=8.1 Hz), 7.50(1H, t, J=8.4 Hz), 8.01(1H, t, J=9.0 Hz), 8.06(1H, d, J=6.6 Hz), 8.31-8.36(2H, m). Example 19 Preparation of 5-amino-N-[[2-(trifluoromethyl)phenyl]methyl-1-naphthalenesulfonamide hydrochloride (Compound No. 19) [0161] (1) Preparation of N-[5-[[[[[2(trifluoromethyl)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0162] Yield: 47% [0163]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.21(2H, d, J=6.0 Hz), 7.39(1H, dd, J=7.8, 7.2 Hz), 7.48(1H, dd, J=8.1, 6.9 Hz), 7.62(3H, m), 7.70(1H, dd, J=8.4, 7.5 Hz), 7.80(1H, d, J=7.5 Hz), 8.12(1H, dd, J=7.2, 0.9 Hz), 8.33(1H, d, J=8.4 Hz), 8.64(1H, d, J=8.4 Hz), 8.74(1H, t, J=6.0 Hz), 10.07(1H, s). [0164] (2) Preparation of 5-amino-N-[(2-(trifluoromethyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0165] Yield: 67% [0166]1H-NMR(DMSO-d6, δ): 4.20(2H, d, J=6.0 Hz), 7.39(1H, dd, J=7.8, 7.6 Hz), 7.46(1H, dd, J=8.7, 8.1 Hz), 7.49(1H, dd, J=8.7, 6.9 Hz), 7.62(4H, m), 8.13(1H, dd, J=7.5, 0.9 Hz), 8.35(1H, d, J=8.4 Hz), 8.38(1H, d, J=9.0 Hz), 8.77(1H, t, J=6.0 Hz). Example 20 Preparation of 5-amino-N-[[3-(trifluoromethyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 20) [0167] (1) Preparation of N-[5-[[[[3-(trifluoromethyl)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0168] Yield: 71.5% [0169]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.15(2H, d, J=6.9 Hz), 7.37-7.49(4H, m), 7.62(1H, dd, J=8.4, 7.5 Hz), 7.65-7.71(1H, m), 7.76(1H, d, J=7.5 Hz), 8.13(1H, dd, J=7.5, 0.9 Hz), 8.32(1H, d, J=8.4 Hz), 8.49(1H, d, J=8.4 Hz), 8.68(1H, t, J=6.3 Hz), 10.06(1H, s). [0170] (2) Preparation of 5-amino-N-[[3-(trifluoromethyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0171] Yield: 74.0% [0172]1H-NMR(CD3OD, δ): 4.23(2H, s), 7.21-7.36(4H, m), 7.69-7.80(3H, m), 8.16(1H, dt, J=8.7, 1.2 Hz), 8.32(1H, dd, J=7.5, 1.2 Hz), 8.82(1H, dt, J=8.7, 1.2 Hz). Example 21 Preparation of 5-amino-N-[[4-(trifluoromethyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 21) [0173] (1) Preparation of N-[5-[[[[4-(trifluoromethyl)phenyl]methyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0174] Yield: 63.8% [0175]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.18(2H, d, J=6.3 Hz), 7.39(2H, d, J=7.8 Hz), 7.66(2H, d, J=8.4 Hz), 7.61-7.72(2H, m), 7.78(1H, d, J=7.2 Hz), 8.13(1H, dd, J=7.5, 1.2 Hz), 8.34(1H, d, J=8.7 Hz), 8.50(1H, d, J=8.1 Hz), 8.68(1H, t, J=60.5 Hz), 10.07(1H, s). [0176] (2) Preparation of 5-amino-N-[[4-(trifluoromethyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0177] Yield: 79.8% [0178]1H-NMR(CD3OD, δ): 4.20(2H, s), 7.24(2H, d, J=8.1 Hz), 7.39(2H, d, J=8.4 Hz), 7.70-7.80(3H, m), 8.21(1H, dt, J=9.0, 1.2 Hz), 8.82(1H, dd, J=7.2, 1.2 Hz), 8.82(1H, dt, J=8.4, 1.2 Hz). Example 22 Preparation of 5-amino-N-[[[1,1′-biphenyl]-4-yl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 22) [0179] (1) Preparation of N-[6-[[[[[1,1′-biphenyl]-4-yl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0180] Yield: 76.3% [0181]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.08(2H, d, J=6.3 Hz), 7.24(2H, d, J=8.1 Hz), 7.32-7.87(1H, m), 7.41-7.49(4H, m), 7.67-7.66(3H, m), 7.70(1H, d, J=8.7 Hz), 7.79(1H, d, J=7.5 Hz), 8.15(1H, dd, J=7.5, 1.2 Hz), 8.33(1H, d, J=8.4 Hz), 8.53-8.59(2H, m), 10.04(1H, B). [0182] (2) Preparation of 5-amino-N-[[1,1′-biphenyl]-4-yl]methyl]-1-naphthalenesulfonamide hydrochloride. [0183] Yield: 82.5% [0184]1H-NMR(DMSO-d6, δ): 4.07(2H, d, J=6.0 Hz), 7.25(2H, d, J=8.1 Hz), 7.32-7.52(6H, m), 7.59-7.68(4H, m), 8.17(1H, d, J=7.2 Hz), 8.36(2H, d, J=8.4 Hz), 8.57(1H, d, J=6.0 Hz). Example 23 Preparation of 5-amino-N-[[[4′-methyl-1,1′-biphenyl]-2-yl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 23) [0185] (1) Preparation of N-[6-[[[[4′-methyl-1,1′-biphenyl]-2-yl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0186] Yield: 67% [0187]1H-NMR(DMSO-d6, δ): 2.20(8H, s), 2.26(3H, s), 3.90(2H, d, J=6.1 Hz), 7.01(4H, m), 7.09(1H, m), 7.22(2H, m), 7.87(1H, m), 7.56(1H, dd, J=8.4, 7.5 Hz), 7.67(1H, dd, J=8.7, 7.5 Hz), 7.78(1H, d, J=7.6 Hz), 7.97(1H, d, J=7.2 Hz), 8.81(1H, d, J=8.4 Hz), 8.43(1H, t, J=5.1 Hz), 8.61(1H, d, J=8.4 Hz), 10.06(1H, s). [0188] (2) Preparation of 5-amino-N-[[[4′-methyl-1,1′-biphenyl]-2-yl]methyl]-1-naphthalenesulfonamide hydrochloride. [0189] Yield: 76% [0190]1H-NMR(DMSO-d6, δ): 2.29(3H, s), 3.91(2H, d, J=6.7 Hz), 7.06(5H, m), 7.18-7.27(2H, m), 7.37(2H, m), 7.55(1H, dd, J=8.1, 7.6 Hz), 7.57(1H, dd, J=8.1, 7.5 Hz), 7.97(1H, dd, J=7.2, 0.9 Hz), 8.80(1H, d, J=9.9 Hz), 8.38(1H, d, J=8.4 Hz), 8.42(1H, t, J=5.7 Hz). Example 24 Preparation of 5-amino-N-[(2-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 24) [0191] (1) Preparation of N-[5-[[[(2-methoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0192] Yield: 42.8% [0193]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.50(3H, S), 4.00(2H, d, J=6.0 Hz), 6.74-6.79(2H, m), 7.10-7.18(2H, m), 7.58-7.68(2H, m), 7.75(2H, d, J=7.5 Hz), 8.10(1H, dd, J=7.5, 0.9 Hz), 8.26-8.82(2H, m), 8.52(1H, d, J=8.7 Hz), 10.05(1H, s). [0194] (2) Preparation of 5-amino-N-[(2-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0195] Yield: 60.0% [0196]1H-NMR(DMSO-d6, δ): 3.52(3H, S), 3.98(2H, d, J=6.9 Hz), 6.74-6.79(2H, m), 7.11-7.18(2H, m), 7.27-7.80(1H, m), 7.52-7.61(2H, m), 8.08(1H, d, J=6.9 Hz), 8.21-8.27(2H, m), 8.32(1H, d, J=8.7 Hz). Example 25 Preparation of 5-amino-N-[(3-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 25) [0197] (1) Preparation of N-[5-[[[(3-methoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0198] Yield: 75.9% [0199]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 8.34(8H, s), 4.03(2H, d, J=6.0 Hz), 6.64-6.73(3H, m), 7.09(1H, t, J=7.8 Hz), 7.60-7.77(3H, m), 8.13(1H, dd, J=7.6, 1.2 Hz), 8.33(1H, d, J=8.7 Hz), 8.52-8.67(2H, m), 10.07(1H, s). [0200] (2) Preparation of 5-amino-N-[(3-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0201] Yield: 81.6% [0202]1H-NMR(CD3OD, δ): 8.55(8H, s), 4.10(2H, s), 6.55-6.61(3H, m), 6.94(1H, t, J=8.1 Hz), 7.64-7.79(3H, m), 8.17(1H, dt, J=8.4, 1.2 Hz), 8.31(1H, dd, J=7.5, 1.2 Hz), 8.84(1H, dt, J=8.4, 1.2 Hz). Example 26 Preparation of 5-amino-N-[(4-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 26) [0203] (1) Preparation of N-[5-[[[(4-methoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0204] Yield: 49.6% [0205]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 8.68(3H, s), 3.96(2H, d, J=6.0 Hz), 6.72-6.76(2H, d, J=8.4 Hz), 7.05(2H, d, J=8.4 Hz), 7.64(1H, t, J=8.7 Hz), 7.66(1H, t, J=9.0 Hz), 7.76(1H, d, J=7.5 Hz), 8.13(1H, dd, J=7.5, 1.2 Hz), 8.33(1H, d, J=8.7 Hz), 8.44(1H, t, J=6.0 Hz), 8.51(1H, d, J=8.1 Hz), 10.06(1H, s). [0206] (2) Preparation of 5-amino-N-[(4-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0207] Yield: 76.6% [0208]1H-NMR(DMSO-d6, δ): 3.69(3H, s), 3.98(2H, d, J=6.0 Hz), 6.75(2H, d, J=8.7 Hz), 7.06(2H, d, J=8.4 Hz), 7.19(1H, d, J=7.2 Hz), 7.52(1H, t, J=8.4 Hz), 7.57(1H, t, J=8.4 Hz), 8.10(1H, d, J=7.5 Hz), 8.17(1H, d, J=8.7 Hz), 8.34(1H, d, J=8.4 Hz), 8.36(1H, t, J=5.7 Hz). Example 27 Preparation of 5-amino-N-[(3,4-methylenedioxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 27) [0209] (1) Preparation of N-[5-[[[(3,4-methylenedioxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0210] Yield: 81.4% [0211]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.94(2H, s), 5.91(2H, s), 6.58(1H, dd, J=7.8, 1.2 Hz), 6.66(1H, s), 6.68(1H, d, J=8.1 Hz), 7.63(1H, t, J=7.8 Hz), 7.67(1H, t, J=7.8 Hz), 7.76(1H, d, J=7.5 Hz), 8.12(1H, d, J=6.9 Hz), 8.33(1H, d, J=8.4 Hz), 8.49(1H, d, J=8.4 Hz), 10.08(1H, s). [0212] (2) Preparation of 5-amino-N-[(3,4-methylenedioxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0213] Yield: 67.1% [0214]1H-NMR(DMSO-d6, δ): 3.93(2H, d, J=6.3 Hz), 5.92(2H, s), 6.57(1H, dd, J=8.1, 1.5 Hz), 6.64(1H, d, J=1.2 Hz), 6.68(1H, d, J=7.5 Hz), 7.34(1H, d, J=7.5 Hz), 7.55-7.64(2H, m), 8.10(1H, dd, J=7.5, 0.9 Hz), 8.27(1H, d, J=8.4 Hz), 8.33(1H, d, J=8.4 Hz), 8.44(1 Hz, t, J=6.3 Hz). Example 28 Preparation of 5-amino-N-[(2,3-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 28) [0215] (1) Preparation of N-[5-[[[(2,3-dimethoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0216] Yield: 75.8% [0217]1H-NMR(DMSO-d6, δ): 2.20(8H, s), 3.56(3H, s), 3.74(3H, 9), 4.02(2H, s), 6.79-6.84(1H, m), 6.87-6.94(2H, m), 7.63-7.70(2H, m), 7.76(1H, d, J=7.2 Hz), 8.16(1H, dd, J=7.5, 1.2 Hz), 8.34(1H, d, J=8.7 Hz), 8.38(1H, s), 8.54(1H, d, J=8.4 Hz), 10.08(1H, s). [0218] (2) Preparation of 5-amino-N-[(2,3-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0219] Yield: 70.9% [0220]1H-NMR(DMSO-d6, δ): 3.56(3H, s), 3.74(3H, s), 4.08(2H, d, J=6.0 Hz), 6.79-6.90(3H, m), 7.28(1H, d, J=7.8 Hz), 7.66(1H, t, J=8.4 Hz), 7.62(1H, t, J=8.4 Hz), 8.13(1H, d, J=7.2 Hz), 8.26(1H, d, J=8.1 Hz), 8.33-8.86(2H, m). Example 29 Preparation of 5-amino-N-[(2,4-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 29) [0221] (1) Preparation of N-[6-[[[(2,4-dimethoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0222] Yield: 79% [0223]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 8.42(3H, s), 3.68(3H, s), 8.91(2H, d, J=5.7 Hz), 6.28(1H, d, J=2.4 Hz), 6.32(1H, dd, J=8.1, 2.4 Hz), 7.03(1H, d, J=8.1 Hz), 7.60(1H, dd, J=8.4, 7.5 Hz), 7.64(1H, dd, J=8.1, 7.8 Hz), 7.75(1H, d, J=7.5 Hz), 8.06(1H, d, J=7.5 Hz), 8.16(1H, t, J=5.7 Hz), 8.30(1H, d, J=8.4 Hz), 8.50(1H, d, J=8.4 Hz), 10.04(1H, s). [0224] (2) Preparation of 5-amino-N-[(2,4-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0225] Yield: 66% [0226]1H-NMR(DMSO-d6(80° C.), δ): 3.51(5H, s), 3.59(8H, 9), 3.73(2H, s), 6.06(1H, m), 6.51(2H, m), 7.07(1H, d, J=7.8 Hz), 7.43(1H, dd, J=8.7, 7.5 Hz), 7.50(1H, brs), 7.52(1H, dd, J=8.4, 7.5 Hz), 8.07(1H, d, J=8.7 Hz), 8.12(1H, d, J=7.5 Hz), 8.32(1H, d, J=8.4 Hz). Example 30 Preparation of 5-amino-N-[(3,4-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 30) [0227] (1) Preparation of N-[5-[[[(3,4-dimethoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0228] Yield: 78.7% [0229]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.39(3H, s), 3.66(5H, s), 3.98(2H, s), 6.53(1H, d, J=2.1 Hz), 6.65(1H, dd, J=8-1, 2.1 Hz), 6.73(1H, d, J=8.1 Hz), 7.69-7.70(2H, m), 7.76(1H, d, J=7.2 Hz), 8.12(1H, dd, J=7.2, 1.2 Hz), 8.32(1H, d, J=8.4 Hz), 8.43(1H, brs), 8.64(1H, d, J=8.4 Hz), 10.06(1H, s). [0230] (2) Preparation of 5-amino-N-[(3,4-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0231] Yield: 54.0% [0232]1H-NMR(DMSO-d6, δ): 3.43(8H, s), 9.66(3H, 5), 3.98(2H, d, J=6.0 Hz), 6.57(1H, d, J=2.1 Hz), 6.64(1H, dd, J=8.4, 2.1 Hz), 6.73(1H, d, J=7.8 Hz), 7.40(1H, d, J=7.5 Hz), 7.67-7.65(2H, m), 8.13(1H, d, J=7.2 Hz), 8.34(1H, d, J=8.7 Hz), 8.36(1H, d, J=8.4 Hz), 8.46(1H, t, J=6.0 Hz). Example 31 Preparation of 5-amino-N-[(3,5-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 31) [0233] (1) Preparation of N-[5-[[[(3,5-dimethoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0234] Yield: 73.3% [0235]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.50(6H, s), 4.00-4.01(2H, m), 6.23(1H, s), 6.23(2H, e), 7.60-7.77(3H, m), 8.13(1H, d, J=7.2 Hz), 8.32(1H, d, J=8.4 Hz), 8.54(2H, d, J=8.1 Hz), 10.07(1H, s). [0236] (2) Preparation of 5-amino-N-[(3,5-dimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0237] Yield: 73.3% [0238]1H-NMR(CD3OD, δ): 3.58(6H, 9), 4.09(2H, s), 6.11-6.16(3H, m), 7.01-7.80(3H, m), 8.17(1H, dt, J=8.4, 1.2 Hz), 8.31(1H, dd, J=8.4, 1.2 Hz), 8.55(1H, dt, J=8.4, 1.2 Hz). Example 82 Preparation of 5-amino-N-[(2,4,6-trimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 32) [0239] (1) Preparation of N-[5-[[[(2,4,6-trimethoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0240] Yield: 56.1% [0241]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.43(6H, s), 3.66(3H, s), 3.92(2H, d, J=5.1 Hz), 6.91(2H, s), 7.53-7.64(3H, m), 7.73(1H, d, J=7.5 Hz), 8.09(1H, dd, J=7.5, 1.2 Hz), 8.29(1H, d, J=8.4 Hz), 8.46(1H, d, J=8.7 Hz), 10.01(1H, s). [0242] (2) Preparation of 5-amino-N-[(2,4,6-trimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0243] Yield: 73.3% [0244]1H-NMR(DMSO-d6, δ): 8.79(6H, s), 3.85(3H, s), 3.85(2H, s), 6.30(2H, S), 7.06(1H, d, J=9.0 Hz), 7.45(2H, brs), 7.50(1H, dd, J=8.1, 7.5 Hz), 7.84(1H, d, J=9.0 Hz), 8.01(1H, d, J=6.9 Hz), 8.39(1H, d, J=8.4 Hz). Example 33 Preparation of 5-amino-N-[(8,4,5-trimethoxyphenyl)methyl)-1-naphthalenesulfonamide hydrochloride (Compound No. 38). [0245] (1) Preparation of N-[5-[[[(3,4,5-trimethoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0246] Yield: 68.6% [0247]1H-NMR(DMSO-d6, δ): 2.19(3H, s), 3.44(6H, s), 3.50(3H, s), 4.03(2H, d, J=6.0 Hz), 6.27(2H, s), 7.60(1H, dd, J=8.1, 7.5 Hz), 7.68(1H, t, J=8.1 Hz), 7.76(1H, d, J=7.2 Hz), 8.12(1H, dd, J=7.2, 1.2 Hz), 8.31(1H, d, J=8.7 Hz), 8.51-8.55(2H, m), 10.04(1H, s). [0248] (2) Preparation of 5-amino-N-[(3,4,6-trimethoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0249] Yield: 62.3% [0250]1H-NMR(DMSO-d6, δ): 9.45(6H, s), 8.52(8H, s), 4.02(2H, d, J=6.0 Hz), 6.31(2H, s), 7.36(1H, d, J=6.9 Hz), 7.56-7.68(2H, m), 8.12(1H, dd, J=7.5, 0.9 Hz), 8.32(1H, d, J=8.4 Hz), 8.34(1H, d, J=8.4 Hz), 8.51(1H, t, J=6.0 Hz). Example 84 Preparation of 5-amino-N-[(2-ethoxyphenyl)methyl]-1-naphthalenesulfonamide (Compound No. 34). [0251] (1) Preparation of N-[5-[[[(2-ethoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0252] Yield: 75% [0253]1H-NMR(DMSO-d6, δ): 1.16(3H, t, J=6.9 Hz), 2.20(3H, s), 3.82(2H, q, J=6.9 Hz), 4.02(2H, d, J=5.7 Hz), 6.76(2H, m), 7.12(1H, dd, J=8.1, 7.8 Hz), 7.18(1H, d, J=7.2 Hz), 7.61(1H, dd, J=8.4, 7.2 Hz), 7.65(1H, dd, J=8.1, 7.8 Hz), 7.76(1H, d, J=7.5 Hz), 8.09(1H, d, J=7.5 Hz), 8.27(1H, t, J=5.7 Hz), 8.54(1H, d, J=8.4 Hz), 10.06(1H, 8). [0254] (2) Preparation of 5-amino-N-[(2-ethoxyphenyl)methyl]-1-naphthalenesulfonamide. [0255] Preparation was carried out by in the same manner as the method of Example 1(2). However the compound was isolated as a free form without being converted to hydrochloride. [0256] Yield: 68% [0257]1H-NMR(DMSO-d6, δ): 1.19 (3H, t, J=6.9 Hz), 3.86(2H, q, J=6.9 Hz), 3.97(2H, d, J=6.0 Hz), 6.95(2H, s), 6.77(1H, m), 6.78(1H, d, J=7.5 Hz), 6.81(1H, d, J=6.6 Hz), 7.13(1H, ddd, J=8.1, 7.5, 1.8 Hz), 7.21(1H, dd, J=7.5, 1.5 Hz), 7.36(1H, dd, J=8.4, 8.1 Hz), 7.41(1H, dd, J=8.4, 7.5 Hz), 7.84(1H, d, J=8.4 Hz), 8.00(1H, d, J=6.9 Hz), 8.05(1H, t, J=6.0 Hz), 8.34(1H, d, J=8.4 Hz). Example 35 Preparation of o-amino-N-[[3-(phenylmethoxy)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 35) [0258] (1) Preparation of N-(5-[[[[3-(phenylmethoxy)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0259] Yield: 73.0% [0260]1H-NMR(DMSO-d6, δ): 2.19(3H, s), 4.02(2H, d, J=6.3 Hz), 4.87(2H, s), 6.72-6.79(3H, m), 7.09(1H, dd, J=8.7, 7.5 Hz), 7.31-7.39(5H, m), 7.60-7.71(2H, m), 7.77(1H, d, J=17.2 Hz), 8.13(1H, dd, J=7.6, 0.9 Hz), 8.52-8.56(2H, m), 10.05(1H, 8). [0261] (2) Preparation of 5-amino-N-[[S-(phenylmethoxy)phenyl]methyl)-1-naphthalenesulfonamide hydrochloride. [0262] Preparation was carried out in the same manner as the method of Example 1(2), except that the reaction time was 20 minutes. [0263] Yield: 68.9% [0264]1H-NMR(DMSO-d6, δ): 4.00(2H, d, J=6.3 Hz), 4.86(2H, s), 6.73(1H, d, J=7.2 Hz), 6.76-6.78(2H, m), 7.09(2H, dd, J=8.7, 7.5 Hz), 7.31-7.40(6H, m), 7.51(2H, q, J=8.4 Hz), 8.08(1H, d, J=7.2 Hz), 8.12(1H, d, J=8.7 Hz), 8.84(1H, d, J=8.7 Hz), 8.44(1H, t, J=6.8 Hz). Example 36 Preparation of 5-amino-N-[[4-(phenylmethoxy)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 36) [0265] (1) Preparation of N-[5-[[[[4-(phenylmethoxy)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0266] Yield: 72.5% [0267]1H-NMR(DMSO-d6, δ): 2.19(8H, s), 8.95(2H, d, J=6.0 Hz), 6.08(2H, s), 6.82(2H, d, J=8.7 Hz), 7.05(2H, d, J=8.7 Hz), 7.31-7.43(5H, m), 7.60-7.69(2H, m), 7.76(1H, d, J=7.5 Hz), 8.12(1H, dd, J=7.5, 1.2 Hz), 8.33(1H, d, J=8.7 Hz), 8.43(1H, t, J=6.0 Hz), 8.51(1H, d, J=8.7 Hz), 10.06(1H, 9). [0268] (2) Preparation of 5-amino-N-[[4-(phenylmethoxy)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0269] Yield: 66.7% [0270]1H-NMR(DMSO-d6, δ): 3.93(2H, d, J=6.0 Hz), 5.04(2H, s), 6.88(2H, dt, J=9.0, 2.7 Hz), 7.06(2H, dt, J=8.7, 2.4 Hz), 7.2(11H, d, J=7.8 Hz), 7.29-7.44(6H, m), 7.53(1H, dd, J=8.7, 7.8 Hz), 7.58(1H, dd, J=8.4, 7.2 Hz), 8.10(1H, dd, J=7.5, 1.2 Hz), 8.20(1H, d, J=9.0 Hz), 8.33-8.39(2H, m). Example 37 Preparation of 5-amino-N-[(6-methoxy-2-naphthalenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 37). [0271] (1) Preparation of N-[5—([[(6-methoxy-2-naphthalenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0272] Yield: 87% [0273]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.86(3H, 9), 4.15(2H, d, J=6.0 Hz), 7.10(1H, dd, J=8.7, 2.4 Hz), 7.24(1H, dd, J=8.7, 1.2 Hz), 7.52(1H, s), 7.63(3H, m), 7.70(1H, dd, J=8.1, 7.8 Hz), 7.78(1H, d, J=7.5 Hz), 8.17(1H, d, J=7.2 Hz), 8.31(1H, d, J=8.4 Hz), 8.57(1H, d, J=8.7 Hz), 8.60(1H, t, J=6.0 Hz), 10.06(1H, s). [0274] (2) Preparation of 5-amino-N-[(6-methoxy-2-naphthalenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0275] Yield: 83% [0276]1H-NMR(DMSO-d6, δ): 3.85(3H, o), 4.14(2H, d, J=6.0 Hz), 7.11(1H, d, J=8.7, 2.4 Hz), 7.24(2H, m), 7.31(1H, d, J=7.8 Hz), 7.59(3H, m), 7.65(1H, d, J=8.7 Hz), 8.16(1H, dd, J=7.2, 0.9 Hz), 8.31(1H, d, J=7.8 Hz), 8.34(1H, d, J=8.4 Hz), 8.57(1H, t, J=6.0 Hz). Example 38 Preparation of 5-amino-N-[(3-hydroxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 88) [0277] Preparation was carried out in the same manner as the method of Example 1(2) using N-[5-[[[[3-(phenylmethoxy)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide (compound of Example 86(1)), provided that the reaction time was 8.5 hours. [0278] Yield: 83.6% [0279]1H-NMR(DMSO-d6, δ): 3.91(2H, d, J=6.0 Hz), 6.56-6.61(2H, m), 6.67-6.69(1H, m), 7.00(1H, t, J=7.8 Hz), 7.28(1H, d, J=7.8 Hz), 7.56(1H, t, J=7.8 Hz), 7.62(1H, t, J=7.8 Hz), 8.12(1H, d, J=7.5 Hz), 8.25(1H, d, J=8.7 Hz), 8.35(1H, d, J=8.4 Hz), 8.43(1H, t, J=6.0 Hz). Example 39 Preparation of 5-amino-N-[(3,4-dihydroxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 39) [0280] (1) Preparation of N-[5-[[[(3,4-dihydroxyphenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0281] Yield: 43.5% [0282]1H-NMR(DMSO-d6, δ): 2.20(8H, s), 3.83(2H, d, J=6.0 Hz), 6.41(1H, dd, J=7.8, 1.8 Hz), 6.57(1H, d, J=7.8 Hz), 6.66(1H, d, J=1.8 Hz), 7.63-7.70(2H, m), 7.76(1H, d, J=7.5 Hz), 8.14(1H, dd, J=7.5, 1.2 Hz), 8.33-8.38(2H, m), 8.63(1H, d, J=8.7 Hz), 8.74(1H, s), 8.82(1H, s), 10.07(1H, s). [0283] (2) Preparation of 5-amino-N-[(3,4-dihydroxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0284] Yield: 28.3% [0285]1H-NMR(CD3OD, δ): 3.95(2H, s), 6.30(1H, dd, J=8.1, 2.1 Hz), 6.40-6.43(2H, m), 7.66-7.76(8H, m), 8.18(1H, dt, J=8.4, 1.2 Hz), 8.27(1H, dd, J=7.5, 1.2 Hz), 8.79(1H, dd, J=8.4, 0.9 Hz). Example 40 Preparation of 5-amino-N-[(4-hydroxy-8-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 40). [0286] (1) Preparation of N-5-[[[(4-hydroxy-3-methoxyphenyl)methyl]amino]sulfonyl]-1-naphthalenesulfonamide. [0287] Yield: 66.3% [0288]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.94(2H, d, J=6.0 Hz), 6.51-6.69(3H, m), 7.60-7.71(2H, m), 7.66(1H, d, J=7.2 Hz), 8.13(1H, d, J=7.5 Hz), 8.83(1H, d, J=8.4 Hz), 8.41(1H, t, J=6.0 Hz), 8.55(1H, d, J=8.4 Hz), 8.77(1H, brs), 10.06(1H, s). [0289] (2) Preparation of 5-amino-N-[(4-hydroxy-3-methoxyphenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0290] Yield: 27.6% [0291]1H-NMR(DMSO-d6, δ): 3.46(3H, s), 3.92(2H, d, J=6.0 Hz), 6.51-6.59(3H, m), 7.18(1H, d, J=6.9 Hz), 7.49-7.61(2H, m), 8.10(1H, dd, J=7.2, 0.9 Hz), 8.19(1H, d, J=7.8 Hz), 8.31-8.85(2H, m). Example 41 Preparation of 5-amino-N-[(3 nitrophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 41) [0292] (1) Preparation of N-[5-[[[(3-nitrophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0293] Yield: 75.1% [0294]1H-NMR(DMSO-d6, δ): 2.18(3H, s), 4.18(2H, d, J=6.0 Hz), 7.37(1H, t, J=7.8 Hz), 7.51(1H, d, J=7.8 Hz), 7.58(1H, dd, J=8.7, 7.5 Hz), 7.65(1H, t, J=7.5 Hz), 7.68-7.71(1H, m), 7.91-7.97(2H, m), 8.11(1H, dd, J=7.5, 0.9 Hz), 8.25(1H, d, J=8.4 Hz), 8.44(1H, d, J=8.1 Hz), 8.76(1H, t, J=6.3 Hz), 10.05(1H, s). [0295] (2) Preparation of 5-amino-N-[(3-nitrophenyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0296] Yield: 76.4% [0297]1H-NMR(CD3OD, δ): 4.29(2H, s), 7.27(1H, t, J=8.1 Hz), 7.89-7.42(1H, m), 7.66-7.79(4 Hr, m), 7.87(1H, ddd, J=8.1, 2.4, 1.2 Hz), 8.12(1H, dt, J=8.7, 0.9 Hz), 8.30(1H, dd, J=7.5, 1.2 Hz), 8.79(1H, dt, J=8.4, 1.2 Hz). Example 42 Preparation of 5-amino-N-[(4-nitrophenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 42) [0298] (1) Preparation of N-[5-[[[(4-nitrophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0299] Yield: 73.6% [0300]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.18(2H, d, J=6.7 Hz), 7.44(2H, d, J=9.0 Hz), 7.61-7.78(8H, m), 8.05(2H, d, J=8.7 Hz), 8.14(1H, dd, J=7.5, 0.9 Hz), 8.33(1H, d, J=8.4 Hz), 8.50(1H, d, J=8.4 Hz), 8.75(1H, t, J=60.5 Hz), 10.05(1H, s). [0301] (2) Preparation of 5-amino-N-[(4-nitrophenyl)methyl)]-1-naphthalenesulfonamide hydrochloride. [0302] Yield: 84.7% [0303]1H-NMR(DMSO-d6, δ): 4.16(2H, d, J=6.3 Hz), 7.80(1H, d, J=7.5 Hz), 7.41-7.45(2H, m), 7.55-7.63(2H, m), 8.01-8.06(2H, m), 8.12(1H, dd, J=7.5, 1.2 Hz), 8.28(1H, d, J=8.1 Hz), 8.34(1H, d, J=8.7 Hz), 8.72(1H, t, J=6.3 Hz). Example 43 Preparation of 5-amino-N-[(2-aminophenyl)methyl]-1-naphthalenesulfonamide dihydrochloride (Compound No. 43) [0304] (1) Preparation of N-(5-[[[(2-aminophenyl)methyl]amino]sulfonyl-1-naphthalenyl]acetamide. [0305] Yield: 72.0% [0306]1H-NMR(DMSO-d6, δ): 2.2.0(3H, s), 8.84(2H, s), 4.89(2H, s), 6.44(1H, td, J=7.5, 1.2 Hz), 6.57-6.60(1H, m), 6.91-6.97(2H, m), 7.64-7.71(2H, m), 7.77(1H, d, J=7.2 Hz), 8.18(1H, dd, J=7.0, 1.2 Hz), 8.35(1H, d, J=8.4 Hz), 8.55(1H, d, J=8.4 Hz), 10.08(1H, s). [0307] (2) Preparation of 5-amino-N-[(2-aminophenyl)methyl]-1-naphthalenesulfonamide dihydrochloride. [0308] Yield: 82.6% [0309]1H-NMR(CD3OD, δ): 4.24(2H, 8), 7.27-7.31(2H, m), 7.34-7.43(2H, m), 7.71(1H, dd, J=7.8, 1.2 Hz), 7.77-7.84(2H, m), 8.29(1H, d, J=8.4 Hz), 8.38(1H, dd, J=7.5, 1.2 Hz), 8.81(1H, d, J=8.7 Hz). Example 44 Preparation of 5-amino-N-[(3-aminophenyl)methyl]-1-naphthalenesulfonamide dihydrochloride (Compound No. 44) [0310] (1) Preparation of N-[5-[[[(8-aminophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0311] Yield: 48.8% [0312]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.85(2H, 8), 4.97(2H, 9), 6.80(1H, d, J=7.8 Hz), 6.88-6.44(2H, m), 6.85(1H, t, J=7.8 Hz), 7.63-7.70(2H, m), 7.75(1H, d, J=7.2 Hz), 8.15(1H, dd, J=7.2, 0.9 Hz), 8.34(1H, d, J=8.7 Hz), 8.38-8.42(1H, m), 8.66(1H, d, J=8.4 Hz), 10.07(1H, s). [0313] (2) Preparation of 5-amino-N-[(8-aminophenyl)methyl]-1-naphthalenesulfonamide dihydrochloride. [0314] Yield: 86.1% [0315]1H-NMR(CD3OD, δ): 4.15(2H, 8), 7.20-7.26(2H, m), 7.31-7.39(2H, m), 7.71(1H, d, J=7.5 Hz), 7.77-7.83(2H, m), 8.26(1H, dt, J=8.7, 0.9 Hz), 8.35(1H, dd, J=7.5, 1.2 Hz), 8.81(1H, d, J=8.4 Hz). Example 45 Preparation of 5-amino-N-[(4-aminophenyl)methyl]-1-naphthalenesulfonamide dihydrochloride. (Compound No. 45) [0316] (1) Preparation of N-[5-[[[(4-aminophenyl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0317] Yield: 67.4% [0318]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 8.82(2H, d, J=6.0 Hz), 4.98(2H, s), 6.39(2H, d, J=8.4 Hz), 8.79(2H, d, J=8.4 Hz), 7.62-7.69(2H, m), 7.76(1H, d, J=7.2 Hz), 8.14(1H, dd, J=7.2, 0.9 Hz), 8.29(1H, t, J=6.0 Hz), 8.34(1H, d, J=8.4 Hz), 8.53(1H, d, J=8.4 Hz), 10.08(1H, S). [0319] (2) Preparation of 5-amino-N-[(4-aminophenyl)methyl]-1-naphthalenesulfonamide dihydrochloride. [0320] Yield: % [0321]1H-NMR(DMSO-d6, δ): 4.05(2H, d, J=6.0 Hz), 7.11(2H, d, J=8.7 Hz), 7.18(2H, d, J=8.4 Hz); 7.46(1H, d, J=6.9 Hz), 7.59-7.65(2H, m), 8.11(1H, d, J=7.2 Hz), 8.31-8.87(2H, m), 8.66(1H, t, J=6.0 Hz). Example 46 Preparation of 5-amino-N-[[[3-(methylsulfonyl)amino]phenyl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 46) [0322] (1) Preparation of N-[5-[[[[[3-(methylsulfonyl)amino]phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0323] N-[5-[[[(3-Aminophenyl) methyl]amino]sulfonyl]-1-naphthalenyl]acetamide (compound of Example 44(1): 120 mg, 0.32 mmol) was dissolved in tetrahydrofuran (5 ml), and then triethylamine (0.06 ml, 0.39 mmol) and methanesulfonyl chloride (0.030 ml, 00.9 mmol) were added, and the mixture was stirred at room temperature for 2 days. The reaction mixture was poured into diluted hydrochloric acid and extracted with ethyl acetate, The ethyl acetate layer was washed with saturated brine, and after the layer was dried over anhydrous sodium sulfate, the residue obtained by evaporation of the solvent under reduced pressure was purified by column chromatography on silica gel (eluent: hexane/ethyl acetate=1/3→ethyl acetate) to give the title compound as a light brown gummy substance (98.4 mg, 68.7%). [0324]1H-NMR(CD3OD, δ): 2.29(3H, 5), 2.89(3H, s), 4.04(2H, s), 6.81(1H, d, J=7.5 Hz), 6.95-6.97(2H, m), 7.01-7.06(1H, m), 7.57(1H, dd, J=8.7, 7.5 Hz), 7.63-7.69(2H, m), 8.19(1H, dd, J=7.5, 1.2 Hz), 8.23(1H, d, J=8.4 Hz), 8.57-8.64(1H, m). [0325] (2) Preparation of 5-amino-N-[[[3-(methylsulfonyl)amino]phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0326] Yield: 81.1% [0327]1H-NMR(CD3OD, δ): 2.87(8H, s), 4.10(2H, s), 6.79(1H, dt, J=7.2, 1.2 Hz), 6.93-6.96(2H, m), 7.02(1H, dd, J=8.7, 7.5 Hz), 7.68(1H, dd, J=7.6, 1.2 Hz), 7.75(2H, dd, J=8.4, 7.5 Hz), 8.18(1H, dt, J=8.7, 1.2 Hz), 8.31(1H, dd, J=7.2, 1.2 Hz), 8.80(1H, dd, J=8.4, 1.2 Hz). Example 47 Preparation of 5-amino-N-[[4-(dimethylamino)phenyl]methyl)-1-naphthalenesulfonamide dihydrochloride (Compound No. 47). [0328] (1) Preparation of N-[5-([[[4-(dimethylamino)phenyl]methyl]amino-3-sulfonyl]-1-naphthalenyl]acetamide. [0329] Yield: 79% [0330]1H-NMR(DMSO-d6, δ): 2.20(5H, s), 2.81(5H, s), 3.89(2H, d, J=6.0 Hz), 6.55(2H, d, J=8.4 Hz), 6.95(2H, d, J=8.4 Hz), 7.64(1H, dd, J=8.4, 6.9 Hz), 7.67(1H, dd, J=8.4, 7.5 Hz), 7.76(1H, d, J=7.5 Hz), 8.18(1H, dd, J=7.5, 0.9 Hz), 8.32(1H, t, J=6.0 Hz), 8.38(1H, d, J=6.9 Hz), 8.53(1H, d, J=8.4 Hz), 10.06(1H, s), [0331] (2) Preparation of 5-amino-N-[[4-(dimethylamino)phenyl]methyl-1-naphthalenesulfonamide dihydrochloride. [0332] Yield: 56% [0333]1H-NMR(DMSO-d6, δ): 3.01(6H, s), 4.06(2H, d, J=6.0 Hz), 7.16(2H, d, J=8.4 Hz), 7.37(2H, d, J=8.4 Hz), 7.48(1H, d, J=7.5 Hz), 7.62(1H, dd, J=8.1, 7.8 Hz), 8.09(1H, d, J=7.5 Hz), 8.33(1H, d, J=8.4 Hz), 8.36(1H, d, J=8.4 Hz), 8.63(1H, t, J=6.0 Hz). Example 48 Preparation of 4-[[[(6-amino-1-naphthalenyl)sulfonyl]-amino]methyl]benzoic acid hydrochloride (Compound No. 48) [0334] (1) Preparation of 4-[[[(5-acetamido-1-naphthalenyl)sulfonyl]amino]methyl]benzoic acid. [0335] 4-(Aminomethyl)benzoic acid (726 mg, 4.8 mmol) and triethylamine (0.67 ml, 4.8 mmol) were dissolved in a mixed solution of 2N sodium hydroxide solution (2.4 ml, 4.8 mmol), dioxane (4.8 ml) and water (12 ml). A suspension of N-[5-(chlorosulfonyl)-1-naphthalenyl]acetamide (1.135 g, 4 mmol) in dioxane (4 ml) and methanol (12 ml) was added to the mixture under ice cooling and stirring, and the mixture was stirred at room temperature for 30 minutes. The reaction mixture was poured into diluted hydrochloric acid, and the precipitated solid was washed with water and dried under reduced pressure to give the title compound as a light brown crystal (1,361 g, 85.4%). [0336]1H-NMR(DMSO-d6, δ): 2.20(5H, s), 4.11(2H, d, J=6.0 Hz), 7.30(2H, d, J=8.1 Hz), 7.62-7.72(2H, m), 7.76-7.80(3H, m), 8.15(1H, dd, J=7.5, 0.9 Hz), 8.35(1H, d, J=8.4 Hz), 8.62(1H, d, J=8.7 Hz), 8.66(1H, t, J=6.0 Hz), 10.08(1H, 9). [0337] (2) Preparation of 4-[[[(5-amino-1-naphthalenyl)sulfonyl]amino]methyl]benzoic acid hydrochloride. [0338] Yield: 64.1% [0339]1H-NMR(CD3OD, δ): 4.21(2H, s), 7.11(1H, d, J=8.7 Hz), 7.17(1H, d, J=8.7 Hz), 7.67-7.78)6H, m), 8.20(1H, ddt, J=8.7, 6.0, 1.2 Hz), 8.31(1H, ddd, J=7.2, 6.0, 1.2 Hz), 8.81(1H, dt, J=8.4, 1.2 Hz). Example 49 Preparation of 5-amino-N-[[4-(methylsulfonyl)phenyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 49) [0340] (1) Preparation of N-[5-[[[[4-(methylsulfonyl)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0341] Yield: 91% [0342]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 3.14(3H, s), 4.15(2H, d, J=6.0 Hz), 7.43(2H, d, J=8.1 Hz), 7.69(1H, dd, J=8.4, 8.1 Hz), 7.69(1H, dd, J=9.0, 8.1 Hz), 7.78(2H, d, J=8.1 Hz), 7.65(1H, dd, J=9.0, 8.4 Hz), 8.13(1H, d, j=7.2 Hz), 8.35(1H, d, J=8.4 Hz), 8.51(1H, d, J=8.4 Hz), 8.73(1H, t, J=6.0 Hz), 10.11(1H, s). [0343] (2) Preparation of 5-amino-N-[(4-(methylsulfonyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0344] Yield: 84% [0345]1H-NMR(DMSO-d6, δ): 3.16(3H, s), 4.14(2H, d, J=6.3 Hz), 7.41(3H, d, J=8.1 Hz), 7.61(2H, dd, J=8.4, 7.6 Hz), 7.73(2H, d, J=8.1 Hz), 8.13(1H, d, J=6.9 Hz), 8.81(1H, d, J=8.4 Hz), 8.36(1H, d, J=8.4 Hz), 8.72(1H, t, J=6.8 Hz). Example 50 Preparation of 5-amino-N-[[4-(sulfamoyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 50) [0346] (1) Preparation of N-[5-[[[[4-(sulfamoyl)phenyl]methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0347] Yield: 33.4% [0348]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.10(2H, d, J=6.3 Hz), 7.29(2H, s), 7.36(2H, d, J=5.1 Hz), 7.63-7.79(6H, m), 8.16(1H, dd, J=8.4, 0.9 Hz), 8.86(1H, d, J=8.1 Hz), 8.52(1H, d, J=8.7 Hz), 8.66(1H, t, J=6.3 Hz), 10.08(1H, S). [0349] (2) Preparation of 5-amino-N-[[4-(sulfamoyl)phenyl]methyl]-1-naphthalenesulfonamide hydrochloride. [0350] Yield: 53.1% [0351]1H-NMR(DMSO-d6, δ): 4.09(2H, d, J=6.6 Hz), 7-0.33-7.35(6H, m), 7.67-7.67(4H, m), 8.13(1H, d, J=7.5 Hz), 8.29(1H, d, J=8.1 Hz), 8.36(1H, d, J=8.7 Hz), 8.64(1H, t, J=6.3 Hz). Example 51 Preparation of 5-amino-N-(2-furanylmethyl)-1-naphthalenesulfonamide hydrochloride (Compound No. 51). [0352] (1) Preparation of N-[5-([(2-furanylmethyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0353] Yield: 87.9% [0354]1H-NMR(DMSO-d6, δ): 2.19(3H, s), 4.06(2H, d, J=6.0 Hz), 6.08(1H, d, J=3.0 Hz), 6.20(1H, dd, J=3.0, 1.8 Hz), 7.36(1H, dd, J=1.8, 0.9 Hz), 7.60-7.68(2H, m), 7.74(1H, d, J=7.2 Hz), 8.10(1H, dd, J=7.6, 1.2 Hz), 8.32(1H, d, J=8.7 Hz), 8.48(1H, d, J=8.4 Hz), 8.54(1H, t, J=6.0 Hz), 10.06(1H, s). [0355] (2) Preparation of 5-amino-N-(2-furanylmethyl)-1-naphthalenesulfonamide hydrochloride. [0356] N-[5-[[(2-furanylmethyl)amino]sulfonyl]-1-naphthalenyl]acetamide (202 mg, 0.59 mmol) was suspended in a solution of sodium hydroxide (148 mg, 3.7 mmol) in 1-propanol (4 ml), and the mixture was refluxed for 5 hours. After the reaction mixture was concentrated, saturated brine was added and the mixture was extracted with ethyl acetate. The ethyl acetate layer was washed with saturated brine, and after the layer was dried over anhydrous sodium sulfate, the residue obtained by evaporation of the solvent under reduced pressure was purified by column chromatography on silica gel (eluent: ethyl acetate) to give a brown oil. This oil was dissolved in 1-propanol (1 ml), 2N hydrochloric acid (0.4 ml) was added thereto, and the mixture was stirred at room temperature for 20 minutes. The precipitated crystal was filtered, washed with 1-propanol and diisopropyl ether, and dried under vacuum to give the title compound as an ash white crystal (135 mg, 67.8%). [0357]1H-NMR(DMSO-d6, δ): 4.05(2H, d, J=5.7 Hz), 6.01(1H, d, J=3.3 Hz), 6.20(1H, dd, J=3.3, 1.5 Hz), 7.34-7.35(1H, m), 7.48(1H, d, J=7.5 Hz), 7.67-7.68(2H, m), 8.11(1H, d, J=7.2 Hz), 8.84(2H, d, J=8.7 Hz), 8.66(1H, t, J=5.7 Hz). Example 52 Preparation of 5-amino-N-[(5-methyl-2-furanyl)methyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 52) [0358] (1). Preparation of N-[5-[[[(5-methyl-2-furanyl)methyl]amino-3-sulfonyl]-1-naphthalenyl]acetamide. [0359] Yield: 87.6% [0360]1H-NMR(DMSO-d6, δ): 1.90(3H, s), 2.19(3H, s), 4.00(2H, d, J=5.7 Hz), 5.71-5.72(1H, m), 5.86(1H, d, J=3.0 Hz), 7.58-7.68(2H, m), 7.74(1H, d, J=6.9 Hz), 8.08(1H, dd, J=7.2, 0.9 Hz), 8.81(1H, d, J=8.4 Hz), 8.47(1H, d, J=9.0 Hz), 8.49(1H, t, J=5.7 Hz), 10.06(1H, s). [0361] (2) Preparation of 5-amino-N-[(5-methyl-2-furanyl)methyl]-1-naphthalenesulfonamide hydrochloride. [0362] Preparation was carried out in the same manner as the method of Example 51(2). [0363] Yield: 70.8% [0364]1H-NMR(CD3OD, δ): 1.81(3H, m), 4.10(2H, s), 5.61-5.52(1H, m), 6.68(1H, d, J=8.0 Hz), 7.67-7.79(3H, m), 8.18(1H, dt, J=8.4, 1.2 Hz), 8.29(1H, dd, J=7.5, 1.2 Hz), 8.78(1H, tt, J=8.1, 1.2 Hz). Example 693 Preparation of 5-amino-N-(2-pyridinylmethyl)-1-naphthalenesulfonamide dihydrochloride (Compound No. 53) [0365] (1) Preparation of N-[6-[[(2-pyridinylmethyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0366] Yield: 95.4% [0367]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.13(2H, d, J=6.0 Hz), 7.13-7.17(1H, m), 7.24(1H, d, J=7.8 Hz), 7.57-7.71(3H, m), 7.76(1H, d, J=7.5 Hz), 8.18(1H, dd, J=7.2, 1.2 Hz), 8.30-8.34(2H, m), 8.53(1H, d, J=8.1 Hz), 8.86(1H, t, J=6.0 Hz), 10.06(1H, s). [0368] (2) Preparation of 5-amino-N-(2-pyridinylmethyl)-1-naphthalenesulfonamide dihydrochloride. [0369] Yield: 82.6% [0370]1H-NMR(DMSO-d6, δ): 4.41(2H, d, J=6.0 Hz), 7.46(1H, d, J=7.6 Hz), 7.61-7.69(4H, m), 8.16-8.21(2H, m), 8.32(1H, d, J=8.7 Hz), 8.36(1H, d, J=8.7 Hz), 8.57(1H, dd, J=6.0, 1.5 Hz), 9.05(1H, t, J=6.0 Hz). Example 54 Preparation of 5-amino-N-[(1H-benzimidazol-2-yl)methyl]-1-naphthalenesulfonamide dihydrochloride (Compound No. 64) [0371] (1) Preparation of N-[5[[[(1H-benzimidazol-2-yl)methyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0372] Yield: 58.0% [0373]1H-NMR(DMSO-d6, δ): 2.20(3H, s), 4.21(2H, d, J=6.0 Hz), 7.12-7.18(2H, m), 7.45-7.50(2H, m), 7.66(1H, t, J=8.4 Hz), 7.76(1H, d, J=7.8 Hz), 8.19(1H, dd, J=7.5, 1.2 Hz), 8.35(1H, d, J=8.4 Hz), 8.54(1H, d, J=8.4 Hz), 8.74(1H, t, J=6.0 Hz), 10.08(1 H, s), 12.41(1H, br). [0374] (2) Preparation of 5-amino-N-[(1H-benzimidazol-2-yl)methyl]-1-naphthalenesulfonamide dihydrochloride. [0375] Yield: 73.1% [0376]1H-NMR(CD3OD, δ): 4.85(2H, s), 7.58-7.64(2H, m), 7.68-7.83(5H, m), 8.30(1H, dt, J=8.7, 1.2 Hz), 8.38(1H, dd, J=7.5, 1.2 Hz), 8.76(1H, dt, J=9.0, 1.2 Hz). Example 55 Preparation of 5-amino-N-(1-phenylethyl)-1-naphthalenesulfonamide (Compound No. 65) [0377] (1) Preparation of N-[5-[[(1-phenylethyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0378] Yield: 67.9% [0379]1H-NMR(DMSO-d6, δ): 1.16(3H, d, J=6.9 Hz), 2.19(5H, 9), 4.32(1H, m), 7.03-7.10(5H, m), 7.54(1H, dd, J=8.4, 7.2 Hz), 7.65(1H, dd, J=8.4, 7.8 Hz), 7.46(1H, d, J=6.9 Hz), 8.04(1H, dd, J=7.2, 0.9 Hz), 8.26(1H, d, J=8.4 Hz), 8.50(1H, dd, J=8.4, 5.1 Hz), 10.01(1H, s). Ps (2) Preparation of 5-amino-N-(1-phenylethyl)-1-naphthalenesulfonamide. [0380] Preparation was carried out in the same manner as the method of Example 1(2). (However the compound was isolated as a free form without converting to hydrochloride.) [0381] Yield: 27.9% [0382]1H-NMR(DMSO-d6, δ): 1.11(3H, d, J=6.6 Hz), 4.29(1H, m), 6.79(1H, d, J=7.5 Hz), 7.07-7.16(5H, m), 7.36(2H, m), 7.85(1H, d, J=8.4 Hz), 7.99(1H, dd, J=7.2, 0.9 Hz), 8.27-8.31(2H, m). Example 66 Preparation of 5-amino-N-[1-(1-naphthalenyl)ethyl]-1-naphthalenesulfonamide hydrochloride (Compound No. 56). [0383] (1) Preparation of N-[5-[[[1-(1-naphthalenyl)ethyl]amino]sulfonyl]-1-naphthalenyl]acetamide. [0384] Yield. 71.0% [0385]1H-NMR(DMSO-d6, δ): 1.29(8H, d, J=6.9 Hz), 5.19(1H, m), 7;17(1H, d, J=7.5 Hz), 7.38-7.46(4H, m), 7.62-7.69(2H, m), 7.50(1H, d, J=7.6 Hz), 7.81-7.84(1H, m), 7.94-8.00(2H, m), 8.20(1H, d, J=8.4 Hz), 8.56(1H, d, J=8.4 Hz), 8.70(1H, d, J=8.1 Hz), 9.99(1H, s). [0386] (2) Preparation of 5-amino-N-[1-(1-naphthalenyl)ethyl]-1-naphthalenesulfonamide hydrochloride. [0387] Yield: 80.2% [0388]1H-NMR(DMSO-d6, δ): 1.29(3H, d, J=6.6 Hz), 5.18(1H, m), 7.17(1H, t, J=7.5 Hz), 7.36-7.46(5H, m), 7.57(1H, t, J=7.8 Hz), 7.81-7.84(1H, m), 7.98-7.96(1H, m), 7.99(1H, d, J=7.5 Hz), 8.20(1H, d, J=8.7 Hz), 8.38(1H, d, J=8.7 Hz), 8.70(1H, d, J=8.1 Hz). Example 57 Preparation of 5-amino-N-(2,3-dihydro-1H-inden-1-yl)-1-naphthalenesulfonamide (Compound No. 57) [0389] (1) Preparation of N-[6-[[(2,3-dihydro-1H-inden-1-yl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0390] Yield: 91.8% [0391]1H-NMR(DMSO-d6, δ): 1.49-1.62(1H, m), 1.88-1.97(1H, m), 2.21(3H, s), 2.35-2.64(1H, m), 2.71-2.29(1H, m), 4.65(1H, q, J=8.1 Hz), 6.90(1H, d, J=7.5 Hz), 7.03-7.08(1H, m), 7.12-7.16(2H, m), 7.66-7.72(2H, m), 7.79(1H, d, J=7.2 Hz), 8.27(1H, dd, J=8.4, 0.9 Hz), 8.39(1H, d, J=8.7 Hz), 8.51(1H, d, J=9.0 Hz), 8.57(1H, d, J=8.4 Hz), 10.09(1H, s). [0392] (2) Preparation of 5-amino-N-(2,3-dihydro-1H-inden-1-yl)-1-naphthalenesulfonamide. [0393] Preparation was carried out in the same manner as the method of Example 51(2), provided that the compound was isolated as a free form without being converting to hydrochloride. [0394] Yield: 63.9% [0395]1H-NMR(DMSO-d6, δ): 1.50-1.63(1H, m), 1.87-1.97(1H, m), 2.59(1H, q, J=8.4 Hz), 2.74(1H, ddd, J=15.9, 8.7, 3.0 Hz), 4.59(1H, q, J=8.4 Hz), 5.99(2H, s), 6.81(1H, d, J=7.8 Hz), 6.91(1H, d, J=7.2 Hz), 7.02-7.07(1H, m), 7.11-7.15(2H, m), 7.37(1H, dd, J=8.4, 7.8 Hz), 7.48(1H, dd, J=8.1, 7.6 Hz), 7.88(1H, d, J=8.4 Hz), 8.16(1H, dd, J=7.2, 0.9 Hz), 8.82(1H, d, J=8.7 Hz), 8.41(1H, d, J=8.4 Hz). Example 58 Preparation of 5-amino-N-(1,2,3,4-tetrahydro-1-naphthalenyl)-1-naphthalenesulfonamide (Compound No. 58). [0396] (1) Preparation of N-[5-[[(1,2,3,4-tetrahydro-1-naphthalenyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0397] Yield: 93.8% [0398]1H-NMR(DMSO-d6, δ): 1.42-1.50(3H, m), 1.66-1.76(1H, m), 2.21(3H, s), 2.54-2.66(2H, m), 4.26-4.33(1H, m), 6.90-7.02(5H, m), 7.06-7.11(1H, m), 7.63-7.72(2H, m), 7.79(1H, d, J=7.5 Hz), 8.28(1H, dd, J=7.5, 1.2 Hz), 8.39(1H, d, J=8.7 Hz), 8.45(1H, d, J=9.0 Hz), 8.55(1H, d, J=8.4 Hz), 10.09(1H, 9). [0399] (2) Preparation of 5-amino-N-(1,2,3,4-tetrahydro-1-naphthalenyl)-1-naphthalenesulfonamide. [0400] Preparation was carried out in the same manner as the method of Example 51(2). (However the compound was isolated as a free form without converting to hydrochloride.) [0401] Yield: 84.4% [0402]1H-NMR(DMSO-d6, δ): 1.44(3H, bra), 1.65-1.76(1H, m), 2.54-2.66(2H, m), 4.23(1H, q, J=9.0 Hz), 5.98(2H, s), 6.81(1H, d, J=7.2 Hz), 6.92-7.10(4H, m), 7.35(1H, dd, J=8.4, 7.8 Hz), 7.48(1H, dd, J=8.4, 7.5 Hz), 7.86(1H, d, J=8.4 Hz), 8.17(1H, dd, J=7.6, 1.2 Hz), 8.25(1H, d, J=8.7 Hz), 8.41(1H, d, J=8.7 Hz). Example 59 Preparation of 5-amino-N-(2-phenylpropyl)-1-naphthalenesulfonamide (Compound No. 59) [0403] (1) Preparation of N-[5-[[(2-phenylpropyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0404] Yield: 70% [0405]1H-NMR(DMSO-d6, δ): 1.43(6H, s), 2.20(3H, s), 7.04(3H, m), 7.21(2H, m), 7.49(1H, dd, J=8.4, 7.5 Hz), 7.66(1H, dd, J=8.4, 7.5 Hz), 7.46(1H, d, J=7.5 Hz), 7.88(1H, dd, J=7.2, 1.2 Hz), 8.25(1H, d, J=8.4 Hz), 8.35(1H, s), 8.56(1H, d, J=8.4 Hz), 10.02(1H, s). [0406] (2) Preparation of 5-amino-N-(2-phenylpropyl)-1-naphthalenesulfonamide. [0407] Preparation was carried out in the same manner as the method of Example 51(2). (However the compound was isolated as a free form without converting to hydrochloride.) [0408] Yield: 79% [0409]1H-NMR(DMSO-d6, δ): 1.89(6H, s), 5.92(2H, brs), 6.78(1H, d, J=7.5 Hz), 7.08(3H, m), 7.25(2H, m), 7.31(1H, dd, J=8.4, 8.1 Hz), 7.36(1H, dd, J=8.1, 7.8 Hz), 7.83(1H, d, J=7.5 Hz), 7.87(1H, d, J=8.4 Hz), 8.15(1H, s), 8.29(1H, d, J=8.4 Hz). Example 60 Preparation of 5-amino-N-methyl-N-(phenylmethyl)-1-naphthalenesulfonamide hydrochloride (Compound No. 60). [0410] (1) Preparation of N-[5-[[[N-methyl-N-(phenylmethyl)]amino]sulfonyl]-1-naphthalenyl]acetamide. [0411] Yield: 80% [0412]1H-NMR(DMSO-d6, δ): 2.21(3H, s), 2.70(3H, d, J=0.9 Hz), 4.40(2H, s), 7.32(5H, m), 7.73(3H, m), 8.19(1H, dd, J=7.5, 1.2 Hz), 8.41(1H, dd, J=8.4, 0.9 Hz), 8.52(1H, d, J=8.1 Hz), 10.11(1H, s). [0413] (2) Preparation of 5-amino-N-methyl-N-(phenylmethyl)-1-naphthalenesulfonamide hydrochloride. [0414] Yield: 86% [0415]1H-NMR(DMSO-d6, δ): 2.68(3H, s), 4.38(2H, sa) 7.31(5H, m), 7.39(1H, d, J=8.1 Hz), 7.62(1H, dd, J=8.4, 7.8 Hz), 7.71(1H, dd, J=8.1, 7.8 Hz), 8.19(1H, d, J=7.2 Hz), 8.80(1H, d, J=8.4 Hz), 8.44(1H, d, J=8.4 Hz). Example 61 Preparation of 2-[(6-amino-1-naphthalenyl)sulfonyl]-2,3-dihydro-1H-isoindole hydrochloride (Compound No. 61) [0416] (1) Preparation of N-[5-[(2,3-dihydro-1H-isoindol-2-yl)sulfonyl]-1-naphthalenyl]acetamide. [0417] Yield: 88.7% [0418]1H-NMR(DMSO-d6, δ): 2.19(5H, s), 4.69(4H, s), 7.25-7.81(4H, in), 7.68-7.78(3H, m), 8.16(1H, d, J=7.2 Hz), 8.40(1H, d, J=8.4 Hz), 8.60(1H, d, J=8.1 Hz), 10.09(1H, 9). [0419] (2) Preparation of 2-[(5-amino-1-naphthalenyl)sulfonyl]-2,3-dihydro-1H-isoindole hydrochloride. [0420] Yield: 86.3% [0421]1H-NMR(CD3OD, δ): 4.73(4H, s), 7.21-7.27(4H, m), 7.72-7.83(2H, m), 7.86(1H, dd, J=8.7, 7.6 Hz), 8.28(1H, dt, J=8.4, 1.2 Hz), 8.35(1H, dd, J=7.2, 0.9 Hz), 9.02(1H, dt, J=8.4, 0.9 Hz). Example 62 Preparation of 2-[(5-amino-1-naphthalenyl)sulfonyl]-1,2,8,4-tetrahydroisoquinoline hydrochloride (Compound No. 62) [0422] (1) Preparation of N-[5-[(1,2,3,4-tetrahydroisoquinolin-2-yl)sulfonyl]-1-naphthalenyl]acetamide. [0423] Yield: 70.1% [0424]1H-NMR(DMSO-d6, δ): 2.19(3H, s), 2.82(2H, t, J=5.7 Hz), 3.54(2H, t, J=6.7 Hz), 4.41(2H, a), 7.09(4H, m), 7.66-7.76(3H, m), 8.25(1H, dd, J=7.2, 0.9 Hz), 8.40(1H, d, J=8.7 Hz), 8.50(1H, d, J=8.4 Hz), 10.08(1H, s). [0425] (2) Preparation of 2-[(5-amino-1-naphthalenyl)sulfonyl]-1,2,3,4-tetrahydroiaoquinoline hydrochloride. [0426] Yield: 69.9% [0427]1H-NMR(DMSO-d6, δ): 2.81(2H, t, J=5.7 Hz), 3.63(2H, t, J=6.0 Hz), 4.39(2H, s), 7.08-7.14(4H, m), 7.86(1H, d, J=7.5 Hz), 7.60(1H, t, J=7.8 Hz), 7.71(1H, t, J=7.8 Hz), 8.23-8.30(2H, m), 8.43(1H, d, J=8.4 Hz). Example 63 Preparation of 5-amino-N-cyclohexylmethyl-1-naphthalenesulfonamide hydrochloride (Compound No. 63) [0428] (1) Preparation of N-(5-([(cyclohexylmethyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0429] Yield: 95% [0430]1H-NMR(DMSO-d6, δ): 0.72(2H, m), 1.01(3H, m), 1.24(1H, m), 1.53(5H, m), 2.19(3H, s), 2.61(2H, t, J=6.3 Hz), 7.66(2H, ddd, J=8.7, 7.2, 1.5 Hz), 7.75(1H, d, J=7.2 Hz), 7.98(1H, t. J=6.0 Hz), 8.12(1H, dd, J=7.2, 0.9 Hz), 8.34(1H, d, J=8.7 Hz), 8.52(1H, d, J=8.4 Hz), 10.06(1H, 9). [0431] (2) Preparation of 5-amino-N-cyclohexylmethyl-1-naphthalenesulfonamide hydrochloride. [0432] Yield: 91% [0433]1H-NMR(DMSO-d6, δ): 0.72(2H, m), 1.02(3H, m), 1.25(1H, m), 1.53(5H, m), 2.60(2H, t, J=6.3 Hz), 7.48(1H, d, J=7.5 Hz), 7.61(1H, dd, J=8.1, 8.1 Hz), 7.68(1H, dd, J=8.4, 7.5 Hz), 7.94(1H, t, J=5.7 Hz), 8.13(1H, d, J=7.5 Hz), 8.36(1H, d, J=8.4 Hz), 8.37(1H, d, J=8.1 Hz). Example 64 Preparation of 5-amino-N-phenyl-1-naphthalenesulfonamide hydrochloride (Compound No. 64) [0434] (1) Preparation of N-[5-[(phenylamino)sulfonyl]-1-naphthalenyl]acetamide. [0435] Yield: 58.4% [0436]1H-NMR(DMSO-d6, δ): 2.17(3H, s), 6.89-6.96(1H, m), 6.99-7.03(2H, m), 7.11-7.14(2H, m), 7.63(1H, dd, J=8.4, 7.5 Hz), 7.67-7.72(1H, m), 7.76(1H, dd, J=6.9 Hz), 8.22(1H, dd, J=7.2, 0.9 Hz), 8.32(1H, d, J=8.4 Hz), 8.58(1H, d, J=8.4 Hz), 10.03(1H, s), 10.67(1H, s). [0437] (2) Preparation of 5-amino-N-phenyl-1-naphthalenesulfonamide hydrochloride [0438] Yield: 35.7% [0439]1H-NMR(CD3OD, δ): 6.91-6.99(3H, m), 7.05-7.11(2H, m), 7.69-7.80(3H, m), 8.19(1H, dt, J=8.4, 1.2 Hz), 8.36(1H, dd, J=7.5, 1.2 Hz), 8.90(1H, dt, J=8.4, 1.2 Hz). Example 66 Preparation of 5-amino-N-(2-phenylethyl)-1-naphthalenesulfonamide hydrochloride (Compound No. 65) [0440] (1) Preparation of N-[5-[[(2-phenylethyl)amino]sulfonyl]-1-naphthalenyl]acetamide. [0441] Yield: 83.6% [0442]1H-NMR(DMSO-d6, δ): 2.19(8H, 9), 2.61(2H, t, J=7.8 Hz), 2.98-3.05(2H, m), 7.03-7.05(2H, m), 7.10-7.21(3H, m), 7.63-7.69(2H, m), 7.75(1H, d, J=6.9 Hz), 8.10(1H, t, J=5.7 Hz), 8.12(1H, t, J=7.5 Hz), 8.34(1H, d, J=8.7 Hz), 8.49(1H, d, J=8.4 Hz), 10.07(1H, [0443] (2) Preparation of 5-amino-N-(2-phenylethyl)-1-naphthalenesulfonamide hydrochloride. [0444] Yield: 92.5% [0445]1H-NMR(CD3OD, δ): 2.61(2H, t, J=7.2 Hz), 3.14(2H, it, J=7.2 Hz), 6.91-6.94(2H, n), 7.01-7.10(3H, m), 7.64-7.68(1H, m), 7.71(1H, t, J=7.6 Hz), 7.79(1H, dd, J=8.4, 7.5 Hz), 8.22(1H, dt), J=8.7, 0.9 Hz), 8.33(1H, dd, J=7.5, 1.2 Hz), 8.72(1H, d, J=8.4 Hz). TEST EXAMPLE [0446] By using the compounds synthesized above, effects on proliferation of Jurkat cells by sole administration and inhibitory effects on cell proliferation by administration in combination with bleomycin were examined. Materials and methods are as follows. Jurkat cells obtained from Dainippon Pharmaceutical Co. Ltd. were inoculated at about 10,000 cells per well in a 96 well culture plate, and incubated in 10% bovine fetal serum (Irvine Scientific) supplemented with RPMI1640(ICN) medium in 5% CO2 incubator at 37° C. For the culture, each compound was added alone, or the culture was further added with bleomycin (Wako) to give a concentration of 5 μg/ml or 10 μg/ml. 36 hours after the incubation, the number of living cells was counted by the MTS method. [0447] More specifically, 20 μl of CellTiter96™ AQueous One Solution (Promega) was added per one well, and after the cells were incubated for additional one hour, an absorbance at 490 nm was measured by using a microplate reader. The same culture added with DMSO as a solvent at final concentration of 0.25% was used as a control. The number of cells in the control was considered as 100% survival rate, and for each compound, survival rates by sole administration or a combined administration were calculated. Treatments solely with bleomycin at 5 μg/ml or 10 μg/ml gave about 5 to 10% of decrease in the survival rates of the Jurkat cells. Whilst, when the compound of the present invention coexisted, the survival rates of the Jurkat cells by bleomycin at 5, μg/ml or 10 μg/ml were remarkably decreased. The results are shown in the following table. In the table, ++ indicates observation of remarkable enhancement, and + indicates moderated enhancement. Compound Number Activity 1 + 3 + 5 + 6 ++ 9 + 12 ++ 14 + 15 + 18 ++ 19 ++ 21 ++ 23 + 24 ++ 25 ++ 26 + 28 ++ 31 ++ 35 + 36 + 38 + 41 ++ 42 ++ 43 + 44 + 48 + 53 + 55 + 56 + 58 + 64 + INDUSTRIAL APPLICABILITY [0448] The medicaments of the present invention enhance the effect of a cancer therapy based on the mode of action of DNA injury and reduce a dose of an anticancer agent and/or radiation. Therefore, the medicaments can reduce side effects resulting from the cancer therapy. 1. A medicament for enhancing an effect of a cancer therapy based on a mode of action of DNA injury, which comprises as an active ingredient a compound represented by the general formula (I) or a physiologically acceptable salt thereof: wherein R represents an aryl-substituted alkyl group which may be substituted, an heteroaryl-substituted alkyl group which may be substituted, a cycloalkyl-substituted alkyl group which may be substituted, or a cyclic hydrocarbon group which may be substituted wherein said cyclic hydrocarbon group may be saturated, partly saturated, or aromatic; or Z may bind to R to form a cyclic structure wherein the ring formed may be substituted, Z represents a hydrogen atom or a C1 to C6 alkyl group. 2. The medicament according to claim 1, which is used, in a cancer therapy by an administration of an anticancer agent based on the mode of action of DNA injury and/or radiation, for a purpose of enhancing the effect(s) thereof. 3. The medicament according to claim 2, wherein the anticancer agent is selected from the group consisting of bleomycin, adriamycin, cisplatin, cyclophosphamide, mitomycinC, and a derivative thereof. 4. The medicament according to claim 1, which is a specific inhibitor of a protein kinase 1 and/or an analogous enzyme thereof. 5. The medicament for reducing a side effect resulting from a cancer therapy based on a mode of action of DNA injury, which comprises as an active ingredient a compound represented by the general formula (I) or a physiologically acceptable salt thereof according to claim 1. 6. A compound represented by the general formula (II) or a salt thereof: wherein A represents a C3 to C6 cycloalkyl group which may be substituted, a C6 to C10 aryl group which may be substituted, or a 4 to 10-membered monocyclic of bicyclic and unsaturated, partly saturated, or completely saturated heterocyclic group which may be substituted, wherein said heterocyclic group comprises 1 to 4 hetero atoms selected from the group consisting of nitrogen atom, oxygen atom, and sulfur atom; B represents a single bond or a methylene group which may be substituted; and W and X independently represent a hydrogen atom or a C1 to C6 alkyl group which may be substituted, or W may combine with a substituent of A to represent a C1 to C4 alkylene group wherein said alkylene group may be substituted; Y represents a hydrogen atom or a C1 to C6 alkyl group which may be substituted, or Y may combine with a substituent of A to represent a C1 to C4 alkylene group wherein said alkylene group may be substituted; and n represents 0 or 1. 7. A medicament which comprises as an active ingredient a compound represented by the aforementioned general formula (II) or a physiologically acceptable salt thereof according to claim 6. 8. A medicament according to claim 7, which is used for enhancing an effect of a cancer therapy based on a mode of action of DNA injury. 9. The medicament according to claim 2, which is a specific inhibitor of a protein kinase 1 and/or an analogous enzyme thereof. 10. The medicament according to claim 3, which is a specific inhibitor of a protein kinase 1 and/or an analogous enzyme thereof.

2002-06-07

en

2004-11-25

US-201816106581-A

Product runout tracking system and method ABSTRACT A product runout tracking system for an agricultural implement includes a controller having a memory and a processor, wherein the controller is configured to determine a distance remaining until a storage tank is empty of a product based at least in part on an amount of the product within the storage tank of the agricultural implement, a flow rate of the product from the agricultural implement, a ground speed of the agricultural implement, or any combination thereof. The controller is further configured to determine a product runout location of the product within the storage tank based at least in part on the determined distance remaining and a planned route of the agricultural implement, wherein the product runout location includes a location within the field in which the storage tank is estimated to be empty of the product, and output the product runout location to a user interface for display to an operator of the agricultural implement. BACKGROUND The disclosure relates generally to a product runout tracking system for an agricultural implement. Generally, an air cart is used to meter and deliver agricultural product (e.g., seeds, fertilizer) to a seeding implement. The air cart generally includes a storage tank (e.g., a pressurized tank), an air source (e.g., a blower), and a metering system. The product may be gravity fed from the storage tank to the metering system, which distributes a target volume of product into an air flow generated by the air source. The air flow carries the product to the row units via conduits extending between the air cart and the seeding implement. The metering system may include meter rollers that regulate the flow of product based on meter roller geometry and rotation rate. Through distribution of the product from the storage tank of the air cart to the seeding implement, the product stored in the storage tank will be depleted as the air cart and the implement move throughout the field. To continue the distribution operation, the storage tank of the air cart will need to be refilled with the product. It is now recognized that an indication of a location at which the storage tank will be empty may improve efficiency of the distribution operation. BRIEF DESCRIPTION In one embodiment, a product runout tracking system for an agricultural implement includes a controller having a memory and a processor, wherein the controller is configured to determine a distance remaining until a storage tank is empty of a product based at least in part on an amount of the product within the storage tank of the agricultural implement, a flow rate of the product from the agricultural implement, a ground speed of the agricultural implement, or any combination thereof. The controller is further configured to determine a product runout location of the product within the storage tank based at least in part on the determined distance remaining and a planned route of the agricultural implement, wherein the product runout location includes a location within the field in which the storage tank is estimated to be empty of the product, and output the product runout location to a user interface for display to an operator of the agricultural implement. In another embodiment, a product runout tracking system includes a product sensor configured to measure an amount of a product within a storage tank of an air cart, a flow sensor configured to measure a flow rate of distribution of the product from the air cart within an agricultural field, a ground speed sensor configured to measure a ground speed at which the air cart is moving through the agricultural field, and an air cart positioning system configured to determine a location of the air cart within the agricultural field. The product runout tracking system further includes a controller configured to receive one or more signals from the product sensor, one or more signals from the flow sensor, one or more signals from the ground speed sensor, and one or more signals from the air cart positioning system, and to determine a runout location of the product within the storage tank based at least in part on the amount of the product within the storage tank, the flow rate of the product from the air cart, the location of the air cart within the agricultural field, or any combination thereof, wherein the runout location includes a location within the agricultural field in which the storage tank is estimated to be empty of the product. The product runout tracking system further includes a user interface configured to receive the runout location from the controller and to display a runout map including the runout location. In a further embodiment, a method of tracking product runout for an air cart includes receiving, via a processor, a first signal indicative of an amount of product within a storage tank of the air cart from a product sensor, receiving, via the processor, a second signal indicative of a flow rate of the product from the air cart, receiving, via the processor, a third signal indicative of a ground speed of the air cart from a ground speed sensor, receiving, via the processor, a fourth signal indicative of a location of the air cart within a field from an air cart positioning system, determining, via the processor, a product runout location within the field of the product within the storage tank based at least in part on the first signal, the second signal, the third signal, the fourth signal, or any combination thereof, and displaying, via a user interface, the product runout location. DRAWINGS These and other features, aspects, and advantages of the present disclosure will become better understood when the following detailed description is read with reference to the accompanying drawings in which like characters represent like parts throughout the drawings, wherein: FIG. 1 is a side view of an embodiment of an air cart having a product runout tracking system, in accordance with an embodiment of the present disclosure; FIG. 2 is a schematic diagram of an embodiment of an agricultural field in which the air cart of FIG. 1 may be operated, in accordance with an embodiment of the present disclosure; FIG. 3 is a schematic diagram of an embodiment of the product runout tracking system of FIG. 1, in accordance with the present disclosure; FIG. 4 is front view of an embodiment of a user interface that may be employed within the product runout tracking system of FIG. 1; and FIG. 5 is a flow diagram of an embodiment of a method for tracking and displaying product runout of the air cart using the product runout tracking system of FIG. 1. DETAILED DESCRIPTION Turning now to the drawings, FIG. 1 is a side view of an embodiment of an air cart 10 having a product runout tracking system 12. In some embodiments, the air cart 10 may be coupled to another agricultural implement, such as a seed placement tool, and the air cart 10 and the implement may be towed behind a work vehicle (e.g., tractor). The air cart 10 may be used in conjunction with the implement to distribute the product throughout a field. It should be understood that the present embodiments are discussed within the context of an air cart, however the product runout tracking system 12 is also applicable to any other type of implements that are used to store and/or apply a product to a field, such as a seeding implement, a planter, or a sprayer. In the illustrated embodiment, the air cart 10 includes a storage tank 14, a frame 16, wheels 18, a metering system 20, and an air source 22. The storage tank 14 may contain a product 15 to be distributed throughout the field. The product 15 may be any type of solid or liquid agricultural product, such as seeds or fertilizer. In certain configurations, the storage tank 14 includes multiple compartments for storing various products 15 (e.g., flowable product materials). For example, one compartment may include seeds, such as canola or mustard, and another compartment may include a dry or liquid fertilizer. In such configurations, the air cart 10 is configured to deliver both the seeds and fertilizer to the implement. The frame 16 includes a towing hitch configured to couple to the implement or work vehicle. The product 15 within the storage tank 14 may be gravity fed into the metering system 20. The metering system 20 may include one or more meter rollers that regulate the flow of the product 15 from the storage tank 14 into an air flow provided by the air source 22. The air flow then carries the material to the implement via one or more pneumatic conduits 24. In this manner, the row units of the other implement may receive the product 15 for distribution into the field and/or deposition within the soil. The product runout tracking system 12 may be used to determine a location (e.g., product runout location) within the field at which the air cart 10 may be empty (e.g., the air cart 10 may be considered empty when the air cart 10 runs out of the product 15 within the storage tank 14 or reaches a low product level at which the storage tank 14 should be filled). This runout location determination may be used to determine when the air cart should stop at a fill truck to refill the storage tank 14 with the product 15. The product runout tracking system 12 includes a controller 26 (e.g., electronic controller). The controller 26 may be disposed at various locations on the air cart 10. Additionally, the product runout tracking system 12 includes one or more sensors, which may be disposed at various locations about the air cart 10 and may be used to monitor various operational parameters related to product distribution from the air cart 10. The one or more sensors may communicate wirelessly with the controller 26 of the product runout tracking system 12; however, wired control circuitry may be included. Thus, the one or more sensors may send signals to the controller 26 indicative of the various operational parameters. For example, as shown in the illustrated embodiment, the product runout tracking system 12 includes a product sensor(s) 28 that monitors an amount of the product 15 within the storage tank 14. The product sensor 28 may be located below, adjacent to, or within the storage tank 14, or at any other location suitable for monitoring weight of the product 15 or otherwise monitoring an amount of the product 15 remaining in the storage tank 14. The product sensor 28 may be a scale sensor (e.g., weight sensor or load cell), a level sensor, a mechanical sensor, an ultrasonic sensor, an optical sensor, or any other type of sensor suitable to monitor weight of the product 15 or otherwise monitor an amount of the product 15 remaining in the storage tank 14 throughout the product distribution operation. The product sensor 28 may output a signal or signals to the controller 26 indicative the amount of product 15 remaining in the storage tank 14. In some embodiments, the product sensor 28 may be a laser scanner that may measure a volume of the product 15 in the storage tank 14, and the controller 36 may use the measured volume and a weight per liter, or per bushel, of the product 15 to determine the amount of product 15 remaining in the storage tank 14. The controller 36 may utilize the signal(s) received from the product sensor 28 as an input, in conjunction with signals from other sensors of the product runout tracking system 12, to determine the product runout location within the field. In some embodiments, the product runout tracking system 12 includes a flow sensor(s) 30 that may be located along the pneumatic conduits 24 (e.g., one flow sensor per conduit) that carry the product 15 from the air cart 10 to the implement, or at any other location on the air cart 10 suitable for monitoring product flow characteristics from the storage tank 14 of the air cart 10. The flow sensor(s) 30 may determine product flow characteristics, such as a product flow rate and/or a product flow velocity. The flow sensor(s) 30 may output a signal or signals to the controller 26 indicative of the product flow characteristics of the product 15 from the storage tank 14. In some embodiments, product flow characteristics from the storage tank 14 of the air cart 10 may be determined based at least in part on calibration of the metering system 20. As discussed above, the metering system 20 may regulate the flow of the product 15 from the storage tank 14 into the air flow via the meter rollers, which may be set to rotate at a particular rotational speed to meter the product 15 at a particular flow rate by the controller 26 or another controller (e.g., air cart controller, work vehicle controller). As such, the controller 26 may determine the product flow characteristics based at least in part on the rotational speed of the meter rollers and calibration of the metering system 20 (e.g., an amount of the product 15 metered per minute, or other period of time, for a given rotational speed of the meter rollers). Further, the product runout tracking system 12 may include a ground speed sensor(s) 32 that may be located adjacent to one or more of the wheels 18 of the air cart 10, or at any other location about the air cart 10 suitable for monitoring a ground speed of the air cart 10. In some embodiments, if the air cart 10 is being towed, the ground speed sensor 32 may be located on the implement or the work vehicle towing the air cart 10. The ground speed sensor 32 may determine the speed at which the air cart 10 is moving through the field. The ground speed sensor 32 may output a signal or signals to the controller 26 indicative of the ground speed of the air cart 10. In some embodiments, the product runout tracking system 12 may receive and/or access a field map with a determined route (e.g., planned route, programmed route, recommended route) of the air cart 10 within the field. The field map may be generated by the controller 26 or other controller (e.g., air cart controller, work vehicle controller) based on inputs by an operator of the air cart 10 and/or other inputs regarding the field and/or the distribution operation. The field map may include field parameters, such as field size and boundaries, as well as the determined route, such as a number and location or rows, along which the air cart 10 will be driven or towed through the field during the distribution operation. As shown, the product runout tracking system 12 includes an air cart positioning system 34 (e.g., global positioning system [GPS]) that may be located at any position on the air cart 10, or an agricultural system including the air cart 10, suitable for monitoring a location (e.g., an absolute or relative location) of the air cart 10 within the field and along the planned route provided via the field map. That is, in some embodiments, the air cart positioning system 34 may be located on the air cart 10; however, in some embodiments, the air cart positioning system 34 may be located on another implement or the work vehicle used to tow the air cart 10. The air cart positioning system 34 may communicate wirelessly with the controller 26; however, wired control circuitry may be included. The air cart positioning system 34 may determine a current location of the air cart 10 within the field and output a signal or signals to the controller 26 indicative of the current location of the air cart 10. The air cart positioning system 34 may determine the current location of the air cart 10 within the field and/or along the planned route provided by the field map, as well as, in some embodiments, a direction of travel of the air cart 10. In some embodiments, the air cart 10 may be an auto-steering implement and the air cart 10 may be guided along a predetermined route based on the field map. As discussed in greater detail with reference to FIG. 3, the controller 36 may utilize the signal(s) received from the product sensor 28, the flow sensor 30, the ground speed sensor 32, the air cart positioning system 34, or any combination thereof, as inputs, along with the field map, to determine the product runout location within the field. The product runout location may be the location within the field that the controller 26 estimates that the air cart 10 will run out of the product 15. This product runout location may be based at least in part on the current amount of the product 15 within the storage tank 14, the rate at which the product 15 is being distributed from the air cart 10, the speed at which the air cart 10 is traveling through the field, the field map, the location of the air cart 10 within the field, the direction of travel of the air cart 10, or any combination thereof. As an example calculation of the product runout location, the product runout tracking system 12 may determine a time to runout based at least in part on the current amount of the product 15 within the storage tank and the rate at which the product 15 is being distributed from the air car 10 (e.g., the flow rate of the product 15). The product runout track system 12 may determine a distance until runout based at least in part on the time until runout and the current ground speed of the air cart 10. Then, the product runout tracking system 12 may determine the product runout location based at least in part on the distance until runout, the input field map (e.g., planned route), and the current location and direction of travel from the air cart positioning system 34. It should be appreciated that the flow rate of the product and the ground speed of the air cart 10 may be dependent on each other, or these parameters may be independent of one another. As such, the controller 26 may determine the product runout location, which may be used by the controller 26 or an operator to determine an efficient time to refill the storage tank 14 via a fill truck at a refill location (e.g., within or near the field). FIG. 2 a schematic diagram of an embodiment of an agricultural field 44 in which the air cart 10 may be operated. During a product distribution operation, the air cart 10 may travel throughout the field 44 in a direction of travel 46. Typically, the air cart 10 will travel back and forth in substantially parallel rows until the product 15 has been distributed throughout a target area of the field 44. In the illustrated embodiment, the rows 48 represent the rows along which the air cart 10 has distributed the product 15. As the air cart 10 travels back and forth along the rows 48 to distribute the product 15, the product 15 within the storage tank 14 of the air cart 10 will be depleted. When the storage tank 14 is sufficiently empty of the product 15, the storage tank 14 may be refilled with the product 15 via a fill truck 50 at a refill location 51. One or more fill trucks 50 may be utilized for refilling the air cart 10 within the field 44. The fill truck 50 may remain stationary at a predetermined refill location 51, or in some embodiments, the fill truck 50 may travel throughout or around the field. In embodiments where the fill truck 50 remains at the predetermined refill location 51 within the field 44, the fill truck 50 may be positioned adjacent to the ends of the rows 48 along which the air cart 10 is distributing the product 15, as shown in the illustrated embodiment, or at any other location in the field 44. The product runout tracking system 12 of the air cart 10 may provide the product runout location in the field 44 at which the storage tank 14 of the air cart 10 will run out of the product 15 that is being distributed. The product runout location may provide for increased efficiency of the product distribution operation by allowing the controller 26 and/or an operator of the air cart 10 to determine whether the air cart 10 is carrying enough of the product 15 to complete one or more additional rows 48 before the product 15 is depleted or whether the air cart 10 should be refilled at the fill truck 50 before starting the next row 48. This may allow for the distribution operation to be paused less for refilling and/or may allow for product distribution to be achieved without interruption along the whole of each row 48 the air cart 10 travels through the field 44. As previously discussed, the product runout tracking system 12 may determine the product runout location based at least in part on the current amount of the product 15 within the storage tank 14, the rate at which the product 15 is being distributed from the air cart 10, and/or the speed at which the air cart 10 is traveling through the field 44. Further, the product runout tracking system 12 may access the field map and may include the air cart positioning system 34 which, in conjunction with the product amount, the distribution rate, the speed of travel of the air cart 10, or a combination thereof, may allow the controller 26 of the product runout tracking system 12 to determine the product runout location within the field 44. Additionally, in some embodiments, the product runout tracking system 12 may include a fill truck positioning system 52 (e.g., GPS) that may be located at any position on the fill truck 50 suitable for monitoring a location of the fill truck 50 within the field 44. The fill truck positioning system 52 may determine a current location of the fill truck 50 within or relative to the field 44 and output a signal or signals to the controller 26 indicative of the current location of the fill truck 50. The fill truck positioning system 52 may communicate wirelessly with the controller 26 of the product runout tracking system 12. Additionally, in embodiments where the fill truck 50 does not remain stationary at a predetermined location relative to the field 44, the fill truck positioning system 52 may determine a direction of travel of the fill truck 50. The controller 26 of the product runout tracking system 12 may cause the determined product runout location, as well as the location of the fill truck 50, to be displayed to the operator, as discussed in greater detail with respect to FIGS. 3 and 4. Determination and/or display of the product runout location and the location of the fill truck 50 may allow the controller 26 and/or an operator of the air cart 10 to determine whether the air cart 10 is carrying enough of the product 15 to complete one or more additional rows 48 before the product 15 is depleted or whether the air cart 10 should be refilled at the fill truck 50 before starting the next row 48, thus increasing efficiency and productivity of the product distribution operation. FIG. 3 is a schematic diagram of an embodiment of the product runout tracking system 12 for tracking and determining the product runout location at which the storage tank 14 of the air cart 10 is predicted to be empty of the product 15. As previously discussed, the product runout tracking system 12 may include the controller 26, various sensors, including the product sensor 28, the flow sensor 30, the ground speed sensor 32, the air cart positioning system 34, and the fill truck positioning system 52, or any combination thereof. The controller 26 may include a memory 60 and a processor 62. In some embodiments, the memory 60 may include one or more tangible, non-transitory, computer-readable media that store instructions executable by the processor 62 and/or data (e.g., field maps) to be processed by the processor 62. For example, the memory 60 may include access memory (RAM), read only memory (ROM), rewritable non-volatile memory such as flash memory, hard drives, optical discs, and/or the like. Additionally, the processor 62 may include one or more general purpose microprocessors, one or more application specific processors (ASICs), one or more field programmable logic arrays (FPGAs), or any combination thereof. The controller 26 may be communicatively coupled to the product sensor 28, the flow sensor 30, and the ground speed sensor 32. In operation, the controller 26 may receive signals indicative of operational parameters of the air cart 10 from the product sensor 28, the flow sensor 30, the ground speed sensor 32, or any combination thereof at the processor 62. In some embodiments, more or fewer sensors may be included in the product runout tracking system 12. The controller 26 may utilize the signal(s) received from the product sensor 28, the flow sensor 30, and the ground speed sensor 32 individually or in various combinations to determine an amount of time and/or distance until the air cart 10 may run out of or be depleted of the product 15 within the storage tank 14. Additionally, the controller 26 may access the field map and may be communicatively coupled to the air cart positioning system 34 to receive a signal or signals indicative of a current location and/or direction of travel of the air cart 10 within the agricultural field 44. The controller 26 may utilize the field map, as well as the signal(s) received from the air cart positioning system 34, in conjunction with the signal(s) received from the product sensor 28, the flow sensor 30, the ground speed sensor 32, or any combination thereof to determine the product runout location within the agricultural field 44 at which the air cart 10 may runout of the product 15. The controller 26 may then output an instruction signal to cause display of the runout location to the operator via a user interface 64. The controller 26 may receive one or more signals indicative of an amount of the product 15 currently within the storage tank 14 of the air cart 10 via the product sensor 28. The controller 26 may receive one or more signals indicative of flow characteristics of the product 15 from the storage tank 14, such as a product flow rate and/or a product flow velocity via the flow sensor 30. Additionally, the controller 26 may receive one or more signals indicative of a speed at which the air cart 10 is traveling through the field 44 via the ground speed sensor 32. Based at least in part on the input signals received from the sensors, including the product sensor 28, the flow sensor 30, and/or the ground speed sensor 32, the controller 26 may determine a distance remaining until the air cart 10 is depleted of the product 15 within the storage tank 14. Additionally, based at least in part on the determined distance remaining until the air cart 10 is depleted of the product 15, the field map, and the input signals received from the air cart positioning system 34 indicative of the current location and/or direction of travel of the air cart 10, the controller 26 may determine the product runout location of the product 15 of the air cart 10 representative of the location within the agricultural field 44 that the air cart may be depleted of the product 15. The controller 26 may then output the determined product runout location to the user interface 64 for display to the operator. The user interface 64 may be located within the air cart 10, within a cabin of a work vehicle that may be towing the air cart 10, or at any other location suitable for display of the product runout location to the operator of the air cart 10. Determination and/or display of the product runout location of the product 15 within the storage tank 14 of the air cart may increase product utilization. Additionally, in some embodiments, the controller 26 may be communicatively coupled to the fill truck positioning system 52 of the fill truck 50. The controller 26 may receive one or more signals indicative of a current location of the fill truck 50, and in some embodiments a direction of travel of the fill truck 50, via the fill truck positioning system 52. The controller 26 may receive the one or more signals indicative of the current location of the fill truck 50 via the fill truck positioning system 52 directly, or indirectly via a fill truck controller 66. The controller 26 may then output the current location of the fill truck 50 to the user interface 64 and cause the current location of the fill tuck 50 to be displayed to the operator based at least in part on the one or more signals received via the fill truck positioning system 52. Additionally or alternatively, in some embodiments, the controller 26 may output the determined product runout location of the air cart 10 to the fill truck 50, which may be received via the fill truck controller 66. This may indicate to the fill truck 50 and/or an operator of the fill truck 50, via a display 68 of the fill truck, to meet the air cart 10 at the determined product runout location, or at a location near the determined product runout location, such as the end of the row 48 along which the air cart 10 is determined to run out of the product 15, thus further increasing utilization of the product 15 within the storage tank 14 of the air cart 10. In some embodiments, determination and/or display of the product runout location may be triggered when the product 15 reaches a particular level within the storage tank 14 of the air cart 10. For example, in some embodiments, the air cart 10 may include a low product sensor 70. The low product sensor 70 may be a scale sensor (e.g., weight sensor or load cell), a level sensor, a mechanical sensor, an ultrasonic sensor, or any other type of sensor suitable for measuring when the product 15 within the storage tank 14 of the air cart 10 reaches a particular level above empty. The low product sensor 70 may send one or more signals to the controller 26 indicative of whether the product 15 within the storage tank 14 has reached the particular level. Upon receiving (e.g., in response to receiving) the one or more signals from the low product sensor 70, the controller 26 may determine the product runout location and/or cause the determined product runout location to be displayed via the user interface 64. Thus, the low product sensor 70 in conjunction with the controller 26 may allow the product runout location of the product 15 to the determined and/or displayed in response to (e.g., only when) the product level within the storage tank 14 has reached or fallen below the particular level (e.g., a preset or predetermined threshold). Additionally or alternatively, the controller 26 may determine whether the product level within the storage tank 14 has reached or fallen below the level based at least in part on the signal(s) received from the product sensor 28. The controller 26 may compare the signal(s) received via the product sensor 28 indicative of the product weight or level within the storage tank 14 to the particular level. The controller 26 may then determine the product runout location and/or cause the product runout location to be displayed via the user interface 64 when it is determined that the product level within the storage tank 14 is at or below the particular level. The particular level may be stored in the memory 60. Such triggering of the determination and/or display of the product runout location may decrease information presented on the user interface 64 at other times and allow the product runout location to be hidden until the product runout location is approaching. In some embodiments, the format of the display of the product runout location may change in response to the product level being at or below the particular level. For example, a size, color, location, or other characteristic of the display of the product runout location may change. To illustrate the display of the product runout location determined by the controller 26, FIG. 4 is a front view of an embodiment the user interface 64. The user interface 64 may be located on the air cart 10 or at a remote location, such as within the cabin of the work vehicle if the air cart 10 is being towed by the work vehicle, or at any other location suitable for displaying the product runout location to the operator of the air cart 10. In some embodiments, the air cart 10 may be an auto-steering air cart in which the user interface 64 may be located remote from the air cart 10 and even remote from the field 44. On the user interface 64, a product runout location 78 within a representation of the field 44 may be displayed visually to the operator of the air cart 10 via a runout map 82. As previously discussed, in some embodiments, display of the runout map 82 and/or the product runout location 78 on the runout map 82 via the user interface 64 may be triggered by the low product sensor 70 or via the controller 26 when it is determined that the product level within the storage tank 14 of the air cart 10 is at or below the particular level. The runout map 82 may include a visual representation of the air cart 10 within the field 44 and a representation of rows 48 along which the air cart 10 has distributed the product 15. The shape of the representation of the air cart 10, such as the triangular shape or arrow in the illustrated embodiment, may indicate the direction of travel of the air cart 10. Further, the runout map 82 may show a representation of an amount or length of row(s) 88 along which the air cart 10 can still distribute the product 15 based at least in part on the product 15 remaining in the storage tank 14, the flow characteristics of the product 15 as it is distributed, and/or the ground speed of the air cart 10. The representation of the rows 48 and the row(s) 88 may be distinguished by different colors or patterns, such as dashed or solid lines, or in any other suitable visual technique that may distinguish the rows 48 representing where the air cart 10 has distributed the product 15 and the rows 88 representing the row(s) in which the air cart 10 may distribute product before the storage tank 14 is empty of the product 15. The row(s) 88 of the runout map 82 may end at the determined product runout location 78. The row(s) 48 and the row(s) 88 may be updated on the runout map 82 via the controller 26 as the air cart 10 moves through the field 44. The product runout location 78 may be represented as the end of the row(s) 88, as in the illustrated embodiment, and/or may be illustrated using a symbol, such as an “X”, a color, or any other suitable marking. As such, the runout map 82 displayed via the user interface 64 may allow visual indication of the location within the field 44 that the air cart 10 may run out of the product 15, and thus allow increased efficiency and product utilization during the product distribution process. Additionally, the runout map 82 may include a visual representation of the fill truck 50 illustrating the location of the fill truck 50 within the field 44. The fill truck 50 may be represented by a particular shape, such as a rectangle in the illustrated embodiment, a color, or any other suitable representation. As previously discussed, the controller 26 may determine the location of the fill truck 50 relative to the field 44 based at least in part on the signal(s) received from the fill truck positioning system 52. The controller 26 may update the display of the representation of the fill truck 50 in embodiments where the fill truck 50 moves throughout the field 44 and/or moves to the product runout location 78 or the end of a row when the product runout location 78 is determined and displayed. As such, the runout map 82 may allow visual representation of the location of the fill truck 50 within the field 44, thus further increasing efficiency and product utilization during the product distribution process. In some embodiments, the controller 26 may cause the user interface 64 to display a warning if it is determined that the air cart 10 may run out of product 15 before reaching the fill truck 50. The warning may be displayed on the runout map 82 or as an additional or alternative display on the user interface 64, such as a pop up display. Additionally, in some embodiments, the operator of the fill truck 50 may receive the runout map 82 and/or the product runout location 78 via the display 68 of the fill truck 50, thus allowing the fill truck 50 to meet the air cart 10 near or at the product runout location 78. In some embodiments, the controller 26 may provide a recommendation (e.g., an audible alarm or textual message via the user interface 64) to the air cart 10 and/or the operator of the air cart 10 via the runout map 82 and/or accompanying the product runout location 78. For example, if the fill truck 50 is stationary, the recommendation may include a recommendation for the air cart 10 to travel to the fill truck 50 at the end of a row without beginning the next row. If the fill truck 50 moves throughout the field 44, the recommendation may include a recommendation to meet the fill truck 50 at a particular location within the field 44 at a particular time (e.g., drive along the path to the end of a row where the air cart 10 can stop and refill). This type of recommendation may additionally be provided to the operator of the fill truck 50 via the runout map 82 and/or accompanying the product runout location 78, such that the fill truck 50 may meet the air cart 10 at the particular location at the particular time. For example, the controller 26 may determine and provide a recommendation, via the display 64 and/or the display 68, to refill at the end of a row without beginning a next row. Additionally, the controller my update the runout map 82 after refill and as operational parameters change as the air cart 10 travels through the field 44. While the product runout location 78 and other elements of the product runout tracking system 12, such as the air cart 84 and the fill truck 90, are illustrated as displayed on the runout map 82, the visual representation of the product runout location 78 and the other elements may be displayed using any other suitable visual representation. FIG. 5 is a flow diagram of an embodiment of a method 100 for determining and displaying the product runout location 78 of the product 15 within the storage tank 14 of the air cart 10 using the product runout tracking system 12. At step 102, the controller 26 of the product runout tracking system 12 may receive one or more signals indicative of the amount (e.g., weight or level) of the product 15 remaining in the storage tank 14 of the air cart 10 via the product sensor 28. At step 104, the controller 26 may receive one or more signals indicative of product flow characteristics, such as the flow rate or velocity of the product 15, via the flow sensor 30. At step 106, the controller 26 may receive one or more signals indicative of the ground speed of the air cart 10 via the ground speed sensor 32. The signals at steps 102, 104, and 106 may be received in any order and may be received continuously throughout the distribution process. At step 108, the controller 26 may determine a distance remaining until the product 15 is emptied from the storage tank 14 of the air cart 10 based at least in part on the product amount the product flow characteristics, the ground speed of the air cart, or any combination thereof. In some embodiments, the determination at step 108 may be triggered in response to the controller 26 determining that the amount of the product 15 is at or below the particular level (e.g., predetermined low product threshold) at step 110. The determination at step 108 may be triggered by the low product sensor 70. Next, at step 112, the controller 26 may receive one or more signals indicative of the current location and, in some embodiments, a direction of travel of the air cart 10 via the air cart positioning system 34. Next, at step 114, the controller 26 may access the field map and may determine the product runout location 78 within the field 44 of the product 15 based at least in part on the field map, the determined distance until the storage tank 14 is empty of the product 15, and the location and/or direction of travel of the air cart 10. As such, the controller 26 may determine the particular location within the field 44 at which the storage tank 14 of the air cart 10 may run out of the product 15. In some embodiments, the one or more signals received at step 112 may be received at the controller 26 at the same time as the signals received at steps 102, 104, and/or 106. As such the determinations at steps 108 and 114 may be combined such that the controller 26 may determine the product runout location 78 based at least in part on the product amount, the product flow characteristics, the ground speed of the air cart, the field map, the current location and/or direction of travel of the air cart 10, or any combination thereof. Next, at step 116, the controller 26 may output the determined product runout location 78 and cause display of the runout map 82, including the product runout location 78 and the visual representation of the air cart 84, via the user interface 64 for display to the operator of the air cart 10. Additionally, the runout map 82 may include the visual representation 90 of the location of the fill truck 50. As such, at step 118, the controller 26 may receive one or more signals indicative of the location of the fill truck 50 via the fill truck positioning system 52. Therefore, at step 116, the controller 26 may additionally output and cause the user interface 64 to display the location of the fill truck 50 on the runout map 82. In some embodiments, such as if the fill truck 50 does not remain stationary in the field 44, at step 120, the controller 26 may output one or more signals to the fill truck 50 indicative of the product runout location 78, which may be received via the fill truck controller 66. The fill truck controller 66 or the controller 26 may cause the product runout location to be displayed via the display 68 of the fill truck 50 indicating to the fill truck 50 and/or the operator of the fill truck 50 to meet the air cart 10 at the product runout location, or at a location near the product runout location. The determination and display of the product runout location 78 in the field 44 at which the air cart 10 may run out of the product 15 within the storage tank 14 may allow visual indication of the location within the field 44 that the air cart 10 may run out of product 15, and thus may provide increased efficiency and product utilization during the product distribution process. As noted above, the controller 26 may output a recommendation at the air cart 10 and/or the fill truck 50. While only certain features of the disclosure have been illustrated and described herein, many modifications and changes will occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the disclosure. 1. A product runout tracking system for an agricultural implement, comprising a controller comprising a memory and a processor, wherein the controller is configured to: determine a distance remaining until a storage tank of the agricultural implement is predicted to reach an empty level at which the storage tank should be refilled based at least in part on an amount of a product within the storage tank of the agricultural implement, a flow rate of the product from the agricultural implement, and a ground speed of the agricultural implement; predict a product runout location of the product within the storage tank based at least in part on the determined distance remaining, a current location of the agricultural implement within a field, and a planned route of the agricultural implement through the field, wherein the product runout location comprises a location within the field and not yet reached by the agricultural implement and at which the storage tank is predicted to reach the empty level at which the storage tank should be refilled; and output the product runout location to a user interface for display to an operator of the agricultural implement. 2. The product runout tracking system of claim 1, wherein the controller is configured to output the product runout location to the user interface via outputting a signal indicative of an instruction to display, via the user interface, a runout map of the field comprising a visual representation of the predicted product runout location. 3. The product runout tracking system of claim 1, wherein the controller is configured to: compare the amount of the product within the storage tank to a low product threshold; and output, in response to a determination that the amount of the product is at or below the low product threshold, the product runout location to the user interface for display. 4. The product runout tracking system of claim 1, wherein the controller is configured to provide a recommendation to the user interface for display to the operator, wherein the recommendation advises the operator to refill the agricultural implement at an end of a current row. 5. The product runout tracking system of claim 1, wherein the controller is configured to: receive the amount of the product within the storage tank of the agricultural implement via a product sensor, as the agricultural implement dispenses the product from the storage tank to the field via a metering system as the agricultural implement travels through the field; receive the flow rate of the product from the agricultural implement via a flow sensor, as the agricultural implement dispenses the product from the storage tank to the field via the metering system as the agricultural implement travels through the field; receive the ground speed of the agricultural implement via a ground speed sensor, as the agricultural implement dispenses the product from the storage tank to the field via the metering system as the agricultural implement travels through the field; and receive or generate a field map comprising the planned route of the agricultural implement through the field; wherein the product runout location is within the field along the planned route, and the current location of the agricultural implement and the product runout location are separated by the determined distance remaining. 6. The product runout tracking system of claim 1, wherein the controller is configured to receive a refill location within the field, wherein the refill location comprises a respective current location of a fill truck used to refill the storage tank of the agricultural implement, and wherein the controller is configured to output the product runout location to the user interface via outputting a signal indicative of an instruction to display visual representations of the product runout location, the current location of the agricultural implement, and the refill location via the user interface. 7. (canceled) 8. The product runout tracking system of claim 6, wherein the controller is configured to output the product runout location to a display of the fill truck for display to an operator of the fill truck. 9. A product runout tracking system, comprising: a product sensor configured to measure an amount of a product within a storage tank of an air cart; a flow sensor configured to measure a flow rate of distribution of the product from the air cart within an agricultural field; a ground speed sensor configured to measure a ground speed at which the air cart is moving through the agricultural field; an air cart positioning system configured to determine a current location of the air cart within the agricultural field; a controller configured to receive one or more signals from the product sensor, one or more signals from the flow sensor, one or more signals from the ground speed sensor, and one or more signals from the air cart positioning system, and to predict a runout location of the product within the storage tank based at least in part on the amount of the product within the storage tank, the flow rate of the product from the air cart, and the current location of the air cart within the agricultural field, wherein the runout location comprises a location not yet reached by the air cart within the agricultural field and at which the product in the storage tank is predicted to reach an empty level at which the storage tank should be refilled; and a user interface configured to receive the runout location from the controller and to display a runout map comprising the runout location. 10. The product runout tracking system of claim 9, wherein the controller is configured to receive or to generate a planned route of the agricultural implement, and to use the planned route to predict the runout location. 11. The product runout tracking system of claim 9, comprising a fill truck positioning system configured to determine a refill location within or relative to the agricultural field, wherein the refill location comprises a respective current location of a fill truck used to refill the storage tank of the air cart, and wherein the controller is configured to receive the refill location from the fill truck positioning system, and wherein the runout map displayed via the user interface comprises the refill location. 12. (canceled) 13. The product runout tracking system of claim 11, wherein the controller is configured to output the runout location to a display of the fill truck. 14. The product runout tracking system of claim 9, wherein the controller is configured to compare the amount of the product within the storage tank to a predetermined low product threshold, and to instruct the user interface to display the runout map in response to a determination that the amount of the product is at or below the predetermined low product threshold. 15. The product runout tracking system of claim 9, comprising the air cart, wherein the product sensor and the flow sensor are disposed on the air cart, and wherein the user interface is disposed remote from the air cart. 16. The product runout tracking system of claim 9, wherein the controller is configured to output a recommendation in response to predicting the product runout location, and the recommendation advises an operator of the air cart to drive the air cart to a particular location in the field at a particular time to meet a fill truck, and wherein the user interface is configured to display the recommendation. 17. A method of tracking product runout for an air cart, comprising: receiving, via a processor, a first signal indicative of an amount of product within a storage tank of the air cart from a product sensor; receiving, via the processor, a second signal indicative of a flow rate of the product from the air cart; receiving, via the processor, a third signal indicative of a ground speed of the air cart from a ground speed sensor; receiving, via the processor, a fourth signal indicative of a current location of the air cart within a field from an air cart positioning system; predicting, via the processor, a product runout location within the field of the product within the storage tank based at least in part on the first signal, the second signal, the third signal, and the fourth signal, wherein the product runout location comprises a location not yet reached by the air cart and at which the storage tank is predicted to reach a first predetermined threshold level at which the storage tank should be refilled; and displaying, via a user interface, the product runout location. 18. The method of claim 17, wherein predicting the product runout location comprises: determining, via the processor, a distance remaining until the storage tank is empty of the product based at least in part on the first signal, the second signal, the third signal, or a combination thereof; and determining, via the processor, the product runout location based at least in part on the distance remaining until the storage tank is empty of the product, a planned route of the air cart, and the fourth signal. 19. The method of claim 17, wherein displaying the product runout location comprises displaying, via the user interface, a runout map comprising a visual representation of the product runout location, and a visual representation of the location of the air cart within the field. 20. The method of claim 19, comprising receiving, via the processor, a fifth signal indicative of a fill truck location within or relative to the field from a fill truck positioning system, and wherein displaying the product runout location comprises displaying, via the user interface, the runout map comprising a visual representation of the product runout location, a visual representation of the current location of the air cart within the field, and a visual representation of the fill truck location within the field. 21. The method of claim 17, comprising: determining, using the processor, the amount of product within the storage tank based at least in part on the first signal; and triggering, using the processor, the display of the product runout location via the user interface in response to the amount of product within the storage tank being below a second predetermined threshold level that is greater than the first predetermined threshold level. 22. The method of claim 17, comprising dispensing the product from the storage tank into a metering system of the air cart, and operating one or more meter rollers of the metering system to regulate the flow rate of the product from the air cart to an agricultural implement for deposition in the field as the air cart and the agricultural implement travel through the field.

2018-08-21

en

2020-02-27

US-202318221867-A

System for medical treatment recommendation and predictive model thereof ABSTRACT A method for adherence prediction, comprising the steps of isolating a training dataset and a test dataset from the full dataset; splitting the training dataset into training folds and a validation fold; training, over a plurality of trials, one or more models on each of the training folds for each of one or more parameter configurations correlated to said model, each of the models configured to classify a target variable as an indicator of whether a patient will complete a treatment; validating, for each of the one or more models for a given trial of the plurality of trials, a given model of the one or more models on the validation fold; recording classifications scores for each of the one or more models; selecting a model from the one or more models, the selected model having a top classification score; and retraining the selected model on the full dataset. CROSS-REFERENCE TO RELATED APPLICATIONS The present application claims the benefit of U.S. Patent Application No. 63/388,966 for SYSTEM FOR MEDICAL TREATMENT RECOMMENDATION AND PREDICTIVE MODEL THEREOF, filed Jul. 13, 2022, the entire contents of which are incorporated herein by reference in their entirety. FIELD OF THE INVENTION The present disclosure relates to systems and methods for evaluating treatment efficacy. Specifically, the present disclosure relates to systems and method for determining likelihood of IV ketamine treatment adherence. Introduction Currently, clinical depression is one of the most common and costly health problems in the world. However, the most popular evidence-based treatments for depression do not produce lasting benefits in roughly 30% of the patients who receive them. Recently, intravenous (IV) ketamine has emerged as a viable option for treatment of depression, especially in cases when other treatments have failed. Clinical studies have demonstrated IV ketamine typically produces rapid and large reductions in depression when patients receive a full initial course of treatment, i.e., 4-8 infusions within 28 days (the “induction treatment”). Nevertheless, nearly half of patients who receive IV ketamine treatment do not adhere to the prescribed visit routine for the induction treatment. This is problematic for both clinicians and patients. Data shows that patients who are adherent to the prescribed regimen have better outcomes than those who stop treatment prematurely or do not receive induction treatment. Clinicians lack data-driven tools to know when to offer IV ketamine treatment versus alternative treatments. Often patients invest significant financial resources and time into IV ketamine treatment that ultimately may not work for them. Such an issue is exacerbated because ketamine for depression is typically not covered by health insurance. In the current state of IV ketamine clinical practice, a clinician typically conducts an initial baseline evaluation or consultation. After this consultation, the clinician and patient must make an informed decision on whether to begin a course of IV ketamine treatment. To make this decision, clinicians may rely on such factors as whether the patient has uncontrolled hypertension or other neurological or cardiac conditions that could be aggravated by elevated blood pressure, which is a common side-effect of ketamine. Liver enzymes that are three times more prevalent than that of normal levels are a relative contraindication. In terms of psychiatric conditions, psychosis is typically the only condition that is contraindicated. Additionally, patients cannot be pregnant or breastfeeding. Cost is often a prohibitive factor and ketamine IV treatment (“KIT”) may be relatively contraindicated if another treatment is available and the patient can get reimbursed for care. An important factor that would incline a clinician to choose KIT over transcranial magnetic stimulation (“TMS”) or esketamine would be the presence of suicidal ideation as KIT is the most rapid acting of these treatments, potentially bringing relief within weeks. Traditionally, some clinicians may be aware of individual factors linked to IV ketamine outcomes and may make high-level assumptions of treatment success. However, human clinicians lack the decision-making capacity to weigh multiple factors simultaneously and assign the appropriate weight to each individual factor in an algorithmic manner. It would be desirable to provide a system configured to predict treatment adherence and/or compliance. It would further be desirable to provide a system to evaluate likelihood of treatment adherence in view of patient characteristics extracted before prescription of said treatment. It would yet be further desirable to perform such a prognostication utilizing standard patient intake data. SUMMARY In an aspect, a computer-implemented method for treatment adherence prediction, may comprise the steps of receiving a full dataset; isolating a training dataset and a test dataset from the full dataset; splitting the training dataset into one or more training folds and a validation fold; and training, over a plurality of trials, one or more models on each of the one or more training folds for each of one or more parameter configurations correlated to said one or more models, each of the one or more models configured to classify a target variable, wherein the target variable is an indicator of whether a patient will complete a treatment. In a further embodiment, the method may comprise the steps of validating, for each of the one or more models for a given trial of the plurality of trials, a given model of the one or more models on the validation fold; comparing a training score with a validation score, wherein the training score is based on the training of the one or more models over the one or more training folds, and wherein the validation score is based on the validating of the given model on the validation fold; and recording classifications scores for each of the one or more models, the classifications scores based on the training score and the validation score for each of the one or more models. In yet a further embodiment, the method may comprise the steps of selecting a selected model from the one or more models, the selected model having a top classification score; retraining the selected model on the full dataset; and generating adherence predictions for the test dataset. In an embodiment, the treatment comprises intravenous (IV) ketamine infusions. In one embodiment, the completeness of the treatment is defined as the patient completing at least four IV ketamine infusions within twenty-eight days from an intake evaluation. The one or more parameter configurations may be based on a list of settings associated with each of the one or more models. In an embodiment, the one or more models are selected from a group of classifier types comprising Bayesian linear models, hierarchical models, naive Bayes classifiers, and kernel-based methods. At least one of the one or more models may be an ensemble model. In an embodiment, at least the training dataset comprises a plurality of variables, wherein each of the one or more models is configured to classify a target variable based on each of the plurality of variables. The plurality of variables may comprise one or more continuous variables and one or more binary variables, wherein each of the one or more continuous variables is an integer or real number, and wherein each of the one or more binary variables is encoded as 1 if true, −1 if false, and 0 if missing. As a non-limiting example, the plurality of variables comprises a normalized population density of a resident zip code, a normalized median income of a resident zip code, a normalized median home price of a resident zip code, a normalized number of total ICD-10 diagnoses, and a normalized number of ICD-10 diagnoses considered as psychiatric conditions. As a non-limiting example, the plurality of variables comprises a normalized number of prior patients treated by a clinic with KIT, a normalized proportion of prior patients at the clinic that met a threshold for adherence to KIT, the patient's age at first infusion, the patient's BMI, and a normalized number of days patient had been associated with the clinic prior to their first KIT treatment. The plurality of variables may comprise a normalized GAD7 composite score and a normalized PHQ9 composite score. In an embodiment, the plurality of variables comprises a GAD-7 Item 1 Score, a GAD-7 Item 2 Score, a GAD-7 Item 3 Score, a GAD-7 Item 4 Score, a GAD-7 Item 5 Score, a GAD-7 Item 6 Score, a GAD-7 Item 7 Score, a PHQ-9 Item 1 Score, a PHQ-9 Item 2 Score, a PHQ-9 Item 3 Score, a PHQ-9 Item 4 Score, a PHQ-9 Item 5 Score, a PHQ-9 Item 6 Score, a PHQ-9 Item 7 Score, a PHQ-9 Item 8 Score, and a PHQ-9 Item 9 Score. In a further embodiment, the one or more continuous variables comprises sex, relationship status, completion status of intake form, mood disorder diagnosis, anxiety disorder diagnosis, attention disorder diagnosis, pre-visit status, and provider physician status. In an embodiment, if the sex is male, said variable value is 1, if relationship status is positive, said variable value is 1, if the completion status of intake form is completed, said variable value is 1, if mood disorder diagnosis is positive, said variable value is 1, if anxiety disorder diagnosis is positive, said variable value is 1, if attention disorder diagnosis is positive, said variable value is 1, if pre-visit status is positive, said variable value is 1, and if provider physician status is positive, said variable value is 1. In an embodiment, for the one or more continuous variables, outliers are removed using a kernel density estimation approach. In an embodiment, for the one or more continuous variables, outliers are removed by removing variables having a probability density lower than a predetermined percentage of a maximum density. In an embodiment, the plurality of trials includes all permutations for the one or more models and the one or more parameter configurations. Provided may be a non-transitory computer readable medium having a set of instructions stored thereon that, when executed by a processing device, cause the processing device to carry out an operation of treatment adherence prediction, the operation comprising receiving a full dataset; isolating a training dataset and a test dataset from the full dataset; splitting the training dataset into one or more training folds and a validation fold; training, over a plurality of trials, one or more models on each of the one or more training folds for each of one or more parameter configurations correlated to said one or more models, each of the one or more models configured to classify a target variable, wherein the target variable is an indicator of whether a patient will complete a treatment; validating, for each of the one or more models for a given trial of the plurality of trials, a given model of the one or more models on the validation fold; comparing a training score with a validation score, wherein the training score is based on the training of the one or more models over the one or more training folds, and wherein the validation score is based on the validating of the given model on the validation fold; recording classifications scores for each of the one or more models, the classifications scores based on the training score and the validation score for each of the one or more models; selecting a selected model from the one or more models, the selected model having a top classification score; retraining the selected model on the full dataset; and generating adherence predictions for the test dataset. Provided may be a system for treatment adherence prediction, the system comprising a server comprising at least one server processor, at least one server database, at least one server memory comprising a set of computer-executable server instructions which, when executed by the at least one server processor, cause the server to receive a full dataset; isolate a training dataset and a test dataset from the full dataset; split the training dataset into one or more training folds and a validation fold; train, over a plurality of trials, one or more models on each of the one or more training folds for each of one or more parameter configurations correlated to said one or more models, each of the one or more models configured to classify a target variable, wherein the target variable is an indicator of whether a patient will complete a treatment; validate, for each of the one or more models for a given trial of the plurality of trials, a given model of the one or more models on the validation fold; compare a training score with a validation score, wherein the training score is based on the training of the one or more models over the one or more training folds, and wherein the validation score is based on the validating of the given model on the validation fold; record classifications scores for each of the one or more models, the classifications scores based on the training score and the validation score for each of the one or more models; select a selected model from the one or more models, the selected model having a top classification score; retrain the selected model on the full dataset; and generate adherence predictions for the test dataset. In an aspect of the present disclosure, the system may utilize an algorithm. The algorithm may be configured to receive patient data (for example, demographic information or other identifying data derived from patient intake). The algorithm may then transform raw values to rescaled values (for example, “normalizing” the raw data). In such an embodiment, after the raw values have been rescaled, model weights may be applied to each of the scaled values. Thus, once the model weights are applied to the scaled values, a probability prediction may be generated. In an embodiment, the probability prediction may be utilized to determine the likelihood that a particular patient will complete a predetermined portion of a treatment or drug regimen. Accordingly, using data collected as part of a standard intake evaluation, the algorithm may provide clinicians with rapid and accurate predictions to forecast the likelihood that a patient will complete said portion of treatment. These and other aspects, features, and advantages of the present invention will become more readily apparent from the following drawings and the detailed description of the preferred embodiments. BRIEF DESCRIPTION OF THE DRAWINGS The incorporated drawings, which are incorporated in and constitute a part of this specification exemplify the aspects of the present disclosure and, together with the description, explain and illustrate principles of this disclosure. FIG. 1 is an illustrative block diagram of a system based on a computer configured to execute one or more elements of the systems and methods described herein. FIG. 2 is an illustration of a computing machine configured to execute one or more elements of the systems and methods described herein. FIG. 3A is an illustration of an embodiment of algorithm development. FIG. 3B is a workflow depicting an embodiment of the process of algorithm development. FIG. 4 is a workflow depicting an embodiment of the algorithm. FIG. 5 is a depiction of experimental results and performance of an embodiment of the algorithm. FIG. 6 is a workflow depicting an embodiment of the process of algorithm development. DETAILED DESCRIPTION In the following detailed description, reference will be made to the accompanying drawing(s), in which identical functional elements are designated with like numerals. The aforementioned accompanying drawings show by way of illustration, and not by way of limitation, specific aspects, and implementations consistent with principles of this disclosure. These implementations are described in sufficient detail to enable those skilled in the art to practice the disclosure and it is to be understood that other implementations may be utilized and that structural changes and/or substitutions of various elements may be made without departing from the scope and spirit of this disclosure. The following detailed description is, therefore, not to be construed in a limited sense. FIG. 1 illustrates components of one embodiment of an environment in which the invention may be practiced. Not all of the components may be required to practice the invention, and variations in the arrangement and type of the components may be made without departing from the spirit or scope of the invention. As shown, the system 100 includes one or more Local Area Networks (“LANs”)/Wide Area Networks (“WANs”) 112, one or more wireless networks 110, one or more wired or wireless client devices 106, mobile or other wireless client devices 102-105, servers 107-109, and may include or communicate with one or more data stores or databases. Various of the client devices 102-106 may include, for example, desktop computers, laptop computers, set top boxes, tablets, cell phones, smart phones, smart speakers, wearable devices (such as the Apple Watch) and the like. Servers 107-109 can include, for example, one or more application servers, content servers, search servers, and the like. FIG. 1 also illustrates application hosting server 113. FIG. 2 illustrates a block diagram of an electronic device 200 that can implement one or more aspects of an apparatus, system and method for increasing mobile application user engagement (the “Engine”) according to one embodiment of the invention. Instances of the electronic device 200 may include servers, e.g., servers 107-109, and client devices, e.g., client devices 102-106. In general, the electronic device 200 can include a processor/CPU 202, memory 230, a power supply 206, and input/output (I/O) components/devices 240, e.g., microphones, speakers, displays, touchscreens, keyboards, mice, keypads, microscopes, GPS components, cameras, heart rate sensors, light sensors, accelerometers, targeted biometric sensors, etc., which may be operable, for example, to provide graphical user interfaces or text user interfaces. The system described herein may utilize said component/devices 240 (e.g., biometric sensors) to capture relevant information for the EHRs and/or predictive algorithm described below. Accordingly, the aforementioned data sources (e.g., biometric sensors) may be considered one or more external sources. The biometric sensors (also referred to as digital biomarker-capturing devices) may be configured to capture one or more digital biomarkers from the patient. In an embodiment, the biometric sensors may be separate from the client device. In another embodiment, the biometric sensors may be integrated within the client device. Accordingly, information collected by the biometric sensors may be imported to the EHR described below and/or the treatment adherence algorithm described below. Thus, in an embodiment, the treatment adherence prediction may be based, at least partially, on the data collected by biometric sensors. Yet further, data retrieved from any smart phone, wearable, or other device and/or components thereof (e.g., microphones, touchscreens, keyboards, mice, GPS components, cameras, light sensors, accelerometers, etc.) may be implemented in the predictive algorithm described below. In an embodiment, the utilization of biometric sensors and other peripherals may allow the system to readily update the predicted treatment adherence with data retrieved “on the fly.” A user may provide input via a touchscreen of an electronic device 200. A touchscreen may determine whether a user is providing input by, for example, determining whether the user is touching the touchscreen with a part of the user's body such as his or her fingers. The electronic device 200 can also include a communications bus 204 that connects the aforementioned elements of the electronic device 200. Network interfaces 214 can include a receiver and a transmitter (or transceiver), and one or more antennas for wireless communications. The processor 202 can include one or more of any type of processing device, e.g., a Central Processing Unit (CPU), and a Graphics Processing Unit (GPU). Also, for example, the processor can be central processing logic, or other logic, may include hardware, firmware, software, or combinations thereof, to perform one or more functions or actions, or to cause one or more functions or actions from one or more other components. Also, based on a desired application or need, central processing logic, or other logic, may include, for example, a software-controlled microprocessor, discrete logic, e.g., an Application Specific Integrated Circuit (ASIC), a programmable/programmed logic device, memory device containing instructions, etc., or combinatorial logic embodied in hardware. Furthermore, logic may also be fully embodied as software. The memory 230, which can include Random Access Memory (RAM) 212 and Read Only Memory (ROM) 232, can be enabled by one or more of any type of memory device, e.g., a primary (directly accessible by the CPU) or secondary (indirectly accessible by the CPU) storage device (e.g., flash memory, magnetic disk, optical disk, and the like). The RAM can include an operating system 221, data storage 224, which may include one or more databases, and programs and/or applications 222, which can include, for example, software aspects of the program 223. The ROM 232 can also include Basic Input/Output System (BIOS) 220 of the electronic device. Software aspects of the program 223 are intended to broadly include or represent all programming, applications, algorithms, models, software and other tools necessary to implement or facilitate methods and systems according to embodiments of the invention. The elements may exist on a single computer or be distributed among multiple computers, servers, devices or entities. The power supply 206 contains one or more power components, and facilitates supply and management of power to the electronic device 200. The input/output components, including Input/Output (I/O) interfaces 240, can include, for example, any interfaces for facilitating communication between any components of the electronic device 200, components of external devices (e.g., components of other devices of the network or system 100), and end users. For example, such components can include a network card that may be an integration of a receiver, a transmitter, a transceiver, and one or more input/output interfaces. A network card, for example, can facilitate wired or wireless communication with other devices of a network. In cases of wireless communication, an antenna can facilitate such communication. Also, some of the input/output interfaces 240 and the bus 204 can facilitate communication between components of the electronic device 200, and in an example can ease processing performed by the processor 202. Where the electronic device 200 is a server, it can include a computing device that can be capable of sending or receiving signals, e.g., via a wired or wireless network, or may be capable of processing or storing signals, e.g., in memory as physical memory states. The server may be an application server that includes a configuration to provide one or more applications, e.g., aspects of the Engine, via a network to another device. Also, an application server may, for example, host a web site that can provide a user interface for administration of example aspects of the Engine. Any computing device capable of sending, receiving, and processing data over a wired and/or a wireless network may act as a server, such as in facilitating aspects of implementations of the Engine. Thus, devices acting as a server may include devices such as dedicated rack-mounted servers, desktop computers, laptop computers, set top boxes, integrated devices combining one or more of the preceding devices, and the like. Servers may vary widely in configuration and capabilities, but they generally include one or more central processing units, memory, mass data storage, a power supply, wired or wireless network interfaces, input/output interfaces, and an operating system such as Windows Server, Mac OS X, Unix, Linux, FreeBSD, and the like. A server may include, for example, a device that is configured, or includes a configuration, to provide data or content via one or more networks to another device, such as in facilitating aspects of an example apparatus, system and method of the Engine. One or more servers may, for example, be used in hosting a Web site, such as the web site www.microsoft.com. One or more servers may host a variety of sites, such as, for example, business sites, informational sites, social networking sites, educational sites, wikis, financial sites, government sites, personal sites, and the like. Servers may also, for example, provide a variety of services, such as Web services, third-party services, audio services, video services, email services, HTTP or HTTPS services, Instant Messaging (IM) services, Short Message Service (SMS) services, Multimedia Messaging Service (MMS) services, File Transfer Protocol (FTP) services, Voice Over IP (VOIP) services, calendaring services, phone services, and the like, all of which may work in conjunction with example aspects of an example systems and methods for the apparatus, system and method embodying the Engine. Content may include, for example, text, images, audio, video, and the like. In example aspects of the apparatus, system and method embodying the Engine, client devices may include, for example, any computing device capable of sending and receiving data over a wired and/or a wireless network. Such client devices may include desktop computers as well as portable devices such as cellular telephones, smart phones, display pagers, Radio Frequency (RF) devices, Infrared (IR) devices, Personal Digital Assistants (PDAs), handheld computers, GPS-enabled devices tablet computers, sensor-equipped devices, laptop computers, set top boxes, wearable computers such as the Apple Watch and Fitbit, integrated devices combining one or more of the preceding devices, and the like. Client devices such as client devices 102-106, as may be used in an example apparatus, system and method embodying the Engine, may range widely in terms of capabilities and features. For example, a cell phone, smart phone or tablet may have a numeric keypad and a few lines of monochrome Liquid-Crystal Display (LCD) display on which only text may be displayed. In another example, a Web-enabled client device may have a physical or virtual keyboard, data storage (such as flash memory or SD cards), accelerometers, gyroscopes, respiration sensors, body movement sensors, proximity sensors, motion sensors, ambient light sensors, moisture sensors, temperature sensors, compass, barometer, fingerprint sensor, face identification sensor using the camera, pulse sensors, heart rate variability (HRV) sensors, beats per minute (BPM) heart rate sensors, microphones (sound sensors), speakers, GPS or other location-aware capability, and a 2D or 3D touch-sensitive color screen on which both text and graphics may be displayed. In some embodiments multiple client devices may be used to collect a combination of data. For example, a smart phone may be used to collect movement data via an accelerometer and/or gyroscope and a smart watch (such as the Apple Watch) may be used to collect heart rate data. The multiple client devices (such as a smart phone and a smart watch) may be communicatively coupled. Client devices, such as client devices 102-106, for example, as may be used in an example apparatus, system and method implementing the Engine, may run a variety of operating systems, including personal computer operating systems such as Windows, iOS or Linux, and mobile operating systems such as iOS, Android, Windows Mobile, and the like. Client devices may be used to run one or more applications that are configured to send or receive data from another computing device. Client applications may provide and receive textual content, multimedia information, and the like. Client applications may perform actions such as browsing webpages, using a web search engine, interacting with various apps stored on a smart phone, sending and receiving messages via email, SMS, or MIMS, playing games (such as fantasy sports leagues), receiving advertising, watching locally stored or streamed video, or participating in social networks. In example aspects of the apparatus, system and method implementing the Engine, one or more networks, such as networks 110 or 112, for example, may couple servers and client devices with other computing devices, including through wireless network to client devices. A network may be enabled to employ any form of computer readable media for communicating information from one electronic device to another. The computer readable media may be non-transitory. A network may include the Internet in addition to Local Area Networks (LANs), Wide Area Networks (WANs), direct connections, such as through a Universal Serial Bus (USB) port, other forms of computer-readable media (computer-readable memories), or any combination thereof. On an interconnected set of LANs, including those based on differing architectures and protocols, a router acts as a link between LANs, enabling data to be sent from one to another. Communication links within LANs may include twisted wire pair or coaxial cable, while communication links between networks may utilize analog telephone lines, cable lines, optical lines, full or fractional dedicated digital lines including T1, T2, T3, and T4, Integrated Services Digital Networks (ISDNs), Digital Subscriber Lines (DSLs), wireless links including satellite links, optic fiber links, or other communications links known to those skilled in the art. Furthermore, remote computers and other related electronic devices could be remotely connected to either LANs or WANs via a modem and a telephone link. A wireless network, such as wireless network 110, as in an example apparatus, system and method implementing the Engine, may couple devices with a network. A wireless network may employ stand-alone ad-hoc networks, mesh networks, Wireless LAN (WLAN) networks, cellular networks, and the like. A wireless network may further include an autonomous system of terminals, gateways, routers, or the like connected by wireless radio links, or the like. These connectors may be configured to move freely and randomly and organize themselves arbitrarily, such that the topology of wireless network may change rapidly. A wireless network may further employ a plurality of access technologies including 2nd (2G), 3rd (3G), 4th (4G) generation, Long Term Evolution (LTE) radio access for cellular systems, WLAN, Wireless Router (WR) mesh, and the like. Access technologies such as 2G, 2.5G, 3G, 4G, and future access networks may enable wide area coverage for client devices, such as client devices with various degrees of mobility. For example, a wireless network may enable a radio connection through a radio network access technology such as Global System for Mobile communication (GSM), Universal Mobile Telecommunications System (UMTS), General Packet Radio Services (GPRS), Enhanced Data GSM Environment (EDGE), 3GPP Long Term Evolution (LTE), LTE Advanced, Wideband Code Division Multiple Access (WCDMA), Bluetooth, 802.11b/g/n, and the like. A wireless network may include virtually any wireless communication mechanism by which information may travel between client devices and another computing device, network, and the like. Internet Protocol (IP) may be used for transmitting data communication packets over a network of participating digital communication networks, and may include protocols such as TCP/IP, UDP, DECnet, NetBEUI, IPX, Appletalk, and the like. Versions of the Internet Protocol include IPv4 and IPv6. The Internet includes local area networks (LANs), Wide Area Networks (WANs), wireless networks, and long-haul public networks that may allow packets to be communicated between the local area networks. The packets may be transmitted between nodes in the network to sites each of which has a unique local network address. A data communication packet may be sent through the Internet from a user site via an access node connected to the Internet. The packet may be forwarded through the network nodes to any target site connected to the network provided that the site address of the target site is included in a header of the packet. Each packet communicated over the Internet may be routed via a path determined by gateways and servers that switch the packet according to the target address and the availability of a network path to connect to the target site. The header of the packet may include, for example, the source port (16 bits), destination port (16 bits), sequence number (32 bits), acknowledgement number (32 bits), data offset (4 bits), reserved (6 bits), checksum (16 bits), urgent pointer (16 bits), options (variable number of bits in multiple of 8 bits in length), padding (may be composed of all zeros and includes a number of bits such that the header ends on a 32 bit boundary). The number of bits for each of the above may also be higher or lower. A “content delivery network” or “content distribution network” (CDN), as may be used in an example apparatus, system and method implementing the Engine, generally refers to a distributed computer system that comprises a collection of autonomous computers linked by a network or networks, together with the software, systems, protocols and techniques designed to facilitate various services, such as the storage, caching, or transmission of content, streaming media and applications on behalf of content providers. Such services may make use of ancillary technologies including, but not limited to, “cloud computing,” distributed storage, DNS request handling, provisioning, data monitoring and reporting, content targeting, personalization, and business intelligence. A CDN may also enable an entity to operate and/or manage a third party's web site infrastructure, in whole or in part, on the third party's behalf. A Peer-to-Peer (or P2P) computer network relies primarily on the computing power and bandwidth of the participants in the network rather than concentrating it in a given set of dedicated servers. P2P networks are typically used for connecting nodes via largely ad hoc connections. A pure peer-to-peer network does not have a notion of clients or servers, but only equal peer nodes that simultaneously function as both “clients” and “servers” to the other nodes on the network. Embodiments of the present invention include apparatuses, systems, and methods implementing the Engine. Embodiments of the present invention may be implemented on one or more of client devices 102-106, which are communicatively coupled to servers including servers 107-109. Moreover, client devices 102-106 may be communicatively (wirelessly or wired) coupled to one another. In particular, software aspects of the Engine may be implemented in the program 223. The program 223 may be implemented on one or more client devices 102-106, one or more servers 107-109, and 113, or a combination of one or more client devices 102-106, and one or more servers 107-109 and 113. As noted above, embodiments of the present invention may relate to apparatuses, methods, and systems for forecasting treatment adherence based on data retrieved during patient intake. The embodiments may be referred to as the likelihood of treatment adherence system or simply, the “System.” The System may utilize the computerized elements as described above and as illustrated in FIGS. 1-2 . Accordingly, the System may include hardware and software elements configured to execute the features of the algorithm described herein. The algorithm described herein may be developed in view of a large sample of patients and may be improved and/or accurized via suitable statistical methods. In effect, the System and the algorithm thereof may employ evidence-based medicine as informed by large samples of patients and valid statistical analysis. In an embodiment, the algorithm weighs all the inputs for each patient to arrive at a single personalized outcome prediction. In such an embodiment, the System, via the algorithm, may calculate and/or distribute an easily interpreted probability estimate. Such an estimate may be used to create a software feature in any suitable electronic health record (EHR) platform. However, the System may calculate and/or deliver the estimate absent an EHR platform. The estimate (also referred to herein as the probability estimate, probability, treatment adherence probability, and the like) determined herein may enable clinicians to make a data-driven decision on whether to offer a treatment (for example, including administration of ketamine) to a particular patient. The System described herein provides improvements to the technology of treatment adherence prediction systems by increasing the breadth of input data available for training the model(s), wherein said input data covers a diverse set of personal and clinical background information. Further, the System described herein improves upon the technology of treatment adherence prediction systems by increasing the predictive precision by training the model(s) on the large geographically diverse samples available through the platform described herein. Accordingly, in an embodiment, the treatment adherence probability is calculated with algorithms (e.g., classifier models) that have previously been trained on highly-relevant data with parameter settings that have been tailored to manifest accurate results. In an embodiment, the System is configured to generate predictions based on standard intake data. For example, multiple data points may be collected during a standard intake examination. Such data points may be combined and converted into a single probability estimate. Predictions may be generated based on standard intake data and/or additional types of data. For example, such additional types of data include, but are not limited to, intake data, clinical notes, patient reported outcomes, demographics, psychiatric history, medical history, social history, family history, medication history, diagnoses, and allergies. In various embodiments, one or more of the aforementioned additional types of data are included in a standard intake, while some others are generated during a clinical encounter rather than the intake process. As a non-limiting example, during a routine visit the clinician could ask the patient about their family history and input that data, rather than having that information already input during the intake. In an embodiment, the System described herein may utilize the categories of input data described in the feature list below. However, in further embodiments, the System may be configured to receive and analyze additional input data points. As a non-limiting example, such additional input data points may be provided electronically or verbally (for example, via a microphone embedded within the user's device) by the patient and may be entered into the electronic health record corresponding to said patient. As another non-limiting example, additional input data points may be measured from passive-sensing (e.g., a patient may connect their smart device or wearable to the System, wherein the smart device or wearable may upload activity history and utilize such data as an additional input). Moreover, as described in further detail below, the System is operable if individual data fields are missing. The System described herein may be adapted to be agnostic to all data intakes and/or may be configured for use with a universal data intake. The System may include a dedicated intake module configured to perform intake within the platform used to collect some of the input data. In an embodiment, the probability estimate ranges from 0 to 1 (non-inclusive), however, the probability estimates may be represented in percentages, fractions, ratios, or other suitable forms. The probability estimate may indicate the likelihood that an individual patient will complete a predetermined treatment threshold. The predetermined treatment threshold may be determined experimentally and/or may be set by a System administrator. However, the predetermined treatment threshold may be modified and/or otherwise altered during System operation and/or between instances of use. Further, the predetermined treatment threshold may be specific to a particular type of treatment and/or a particular patient or class of patients. As a non-limiting example, the predetermined treatment threshold may include at least 4 infusions of IV ketamine within 28 days of the intake examination. However, the predetermined treatment threshold may be any measure of the completeness of a particular treatment regimen. Thus, as an example, the predetermined treatment threshold may be represented as a sufficient dosage or duration of treatment relative to the preferred dosage or duration of treatment. In an alternate embodiment, the predetermined treatment threshold may be a range of values (e.g., 4-8 infusions of IV ketamine within 28 days). The algorithm and the host System may utilize data retrieved from clinical trials, studies, patient intake, and/or other sources of experimental data. As non-limiting examples, sources of data available to the System include, but are not limited to, data retrieved via a patient-mobile application, data stored within a provider electronic health record application, data captured via a patient electronic intake survey, or data from an electronic-prescribing platform. In an embodiment, the System may retrieve third-party data from pharmacies and other electronic health records available through health informatics exchanges. Accordingly, such expanded datasets may provide for improved algorithm development. In one embodiment, the data may be retrieved from various locations, for example, to develop an algorithm based on both a diversity of locale and diversity of patient. The sources of the data may either have dispensed or observed administration of the target treatment and/or drug and thus correlate to the patients thereof. For example, the dataset may include a number of individuals who have completed an initial consultation for IV ketamine treatment for depression. Therefore, the dataset may include both the initially received data (e.g., standard intake data) and compliance/adherence data relative to the target treatment and/or drug. The data utilized by the algorithm may be retrieved from clinical measures or processes known to persons of ordinary skill in the art. However, the data may be retrieved from any suitable measures or processes. As a non-limiting example, such data retrieval may include, but is not limited to, Quick Inventory of Depressive Symptomatology (QIDS-SR16, hereafter referred to as “QIDS”); Generalized Anxiety Disorder-7 (“GAD-7”); Psychiatric evaluation for ICD-10 diagnoses of mood and anxiety disorders; and/or demographic assessment of age, race, ethnicity, and/or sex. Accordingly, as to decrease required deviation from standard clinical procedures, each measure may be a standard assessment that a clinician may perform when conducting an intake evaluation for treatment of the target condition (e.g., depression). Therefore, the data points generated by these measures and used by the algorithm may include, but are not limited to, the QIDS total score; the GAD-7 total score; for demographics, 4 variables with the default value of 0 (for example, values are 1 if patient is: 1. male sex, 2. missing sex data, 3. Caucasian, 4. not Caucasian); age; for ICD-10 diagnoses, 4 variables with the default value of 0 (for example, values are 1 if patient has a diagnosis of: 1. major depression, 2. an anxiety disorder other than post-traumatic stress disorder [PTSD], 3. PTSD, 4. bipolar disorder); and a count of the number of different ICD-10 diagnoses a patient has. However, the aforementioned measures should not be viewed as limiting, the metrics analyzed by the algorithm may include any number or combination of variables set to any suitable default values or thresholds. In further embodiments, data retrieved from intake may include the patient's history of motion sickness and/or vertigo (for example, as a predictor of noxious side-effects during KIT). In an embodiment, historical variables may include those computed from the provider entity/clinic-side data, such as indicators of the clinic's historical experience with delivery of intravenous ketamine treatments or other relevant treatments. Accordingly, one or more data points may be correlated to the clinic(s) offering the relevant treatment. Thus, the algorithm, and resulting predicted treatment adherence, may be a function of the patient's clinic's history and other characteristics. As a non-limiting example, if a particular patient is enrolling in a particular clinic that has shown substantial treatment adherence, the algorithm may provide a greater probability to said patient's success versus a patient enrolled in a subpar clinic. However, the data retrieved from intake may include any data points, variables, and/or may illuminate any such connections between intake data and the underlying treatment. As described above, each treatment may include a corresponding target variable (e.g., a predetermined treatment threshold). For the purposes of IV ketamine infusions, the desired target variable for the corresponding dataset may be an indicator of whether a patient completed the prescribed minimum initial course (induction) of IV ketamine infusions. In such an embodiment, the minimum initial course is defined as completing at least 4 infusions within 28 days from the intake evaluation. However, the target variable (predetermined treatment threshold) may be any measure of completeness, such as full course completion, completion of an initial course, or completion of a desired percentage or stage of the treatment regimen. Thus, for the purpose of training statistical models to predict said target variable, patients who completed the minimum course may be assigned a value of 1 and the remaining patients may be assigned a value of 0. However, the patients may be assigned any value between 0 and 1 correlating to their associated treatment completion status, or any numerical value representing a measure of the desired level of treatment adherence. As a non-limiting example, after an initial intensive 4-week long “induction” phase, some patients continue receiving maintenance infusions for an extended period of time. Accordingly, in such a non-limiting example, a tailored algorithm could be developed to predict this type of long-term continuation of treatment. Additional target variables for development may be defined by the degree of patient clinical response to said treatment and/or the clinical response or adherence to other treatments. Thus, in an embodiment where the System contemplates multiple target variables, the System could increase clinical value by predicting differently-defined target variables. As a further non-limiting example, alternative models may be configured to predict a number outside the range of 0 to 1. Moreover, any suitable statistical analysis metrics and methods may be utilized. As described above, any target variable and appropriate completion metric may be established for a particular treatment. The System described herein may be utilized for predicting the adherence to any treatment, wherein said treatment may have a completion metric defined, for example, by the System administrator. In an embodiment, the target variable may be an induction course, an initial schedule of medication, the complete treatment regimen, or any other suitable duration or treatment goal. The ability to define the target variable may allow the algorithm to be tailored to any treatment. The System may utilize one or more statistical models used to separate units into “classes,” such as “treatment dropout” and “treatment completer,” which may be referred to as classifiers (also referred to herein as “classifier model”). In effect, a classifier model may be selected based on the data stream such that the classifier most accurately predicts the target. In an embodiment, experiments are executed to produce a classifier to exhibit increased accuracy when generating predictions for future patients with data that was not used to train the model. In an embodiment, a “test set” may be created by removing a predetermined percentage (for example, 30%) of the sample and saving the test set for validation after training of multiple candidate models for selection. Thus, the “training set” may comprise the remaining percentage (e.g., 70%) of data. A sequence of model training trials may be executed utilizing the training set. Each trial may test a unique combination of parameters including, but not limited to the type of classifier (for example, Lasso Logistic Regression and/or Ridge Logistic Regression); the value of the regularization strength of the classifier (for example, controlling how strongly the model fits to individual data points); and the probability threshold for predicting a patient as a “completer” (for example, with 4 values tested). Accordingly, the parameters (including those parameters known as hyperparameters) may be modified or tuned for each trial. Thus, the parameters may be dependent on the type of model being implemented. For example, for a Logistic Regression model, the solver and/or the regularization may be tune. As another example, for a K-Nearest Neighbors model, the number of neighbors, the distance metric, and/or the weight contributions from neighbors may be tuned. However, each type of model may have the corresponding parameters tuned and none of the examples described herein should be interpreted as limiting. For each of the trials, the classifier may be “fit” to the training data. For example, the classifier may attempt to learn the mathematical relationship between the inputs and the target variable. In each trial, the unique combination of parameters (described above) may impact how the model fits to the training data. Consequently, the fitted models from each of the trials may differ from one another. In an embodiment, multiple trials may be repeated utilizing different parameters as to discover the combination of parameters that produce the most accurate predictions for “out-of-sample” data (for example, data that the model did not use for fitting). In an embodiment, to assess outcomes in adherent versus non-adherent patients, the non-limiting procedure below may be utilized. First, in such a non-limiting example, gather all questionnaires (or other data) from a predetermined period of time (e.g., 30 days) prior to the first treatment date to a predetermined period of time (e.g., 180 days) after the first treatment. Next, in such a non-limiting example, within patients, take the average of all questionnaires (or other data) in the following time bins: (i.) baseline: [−30, 0] from first treatment; (ii.) weekly from (0, 28] days from first treatment (for example, for visualization only, these bins may not be included in the models); and (iii.) monthly from (28, 180) days from first treatment (for example, the first month may include days 29-60, all other months may include 30 days). In a further embodiment, for each questionnaire (or other data), utilize a linear mixed effects model with the following predictors: (i.) intercept (the baseline outcome) with separate intercepts for each patient; (ii.) time bins where each time bin is treated independently, such that the model estimates a coefficient representing the average difference from baseline to each time bin, manifesting a separate effect of time bin for each patient; (iii.) “time bin x adherence interaction,” representing the difference between adherent and non-adherent groups at each timepoint (for example, including the baseline timepoint); and (iv.) the number of maintenance infusions during that month. In an embodiment, including random (i.e., individual) effects of the intercept (baseline outcome) and effect of time bins may be important to account for error in model predictions due to repeated measures (e.g., that patients with a higher baseline may be more likely to have higher scores at later timepoints or that patients with higher baseline scores are more likely to have a greater reduction due to treatment). In an embodiment, to test for differences in the number of maintenance treatment components (for example, scheduled medications) on a month-by-month basis (the same time bins in which outcomes may be analyzed), the non-limiting procedure below may be used. First, in such a non-limiting procedure, calculate the empirical cumulative distribution (ECDF) function at each time point for adherent and non-adherent patients. Next, in such a non-limiting procedure, test for differences at any point along the ECDF using a Kolmogorov-Smirnov (KS) test. Further, in such a non-limiting procedure, adjust p-values for multiple comparisons using Bonferroni correction. Such a procedure may determine that a greater proportion of adherent patients receive more treatment components than non-adherent patients at all time points tested. In such an instance, although the clinical difference may be small, the sample size may be large enough to determine that there is a statistical difference between groups. Provided below is a non-limiting example of a model selection procedure. In such a non-limiting procedure, using the same set of features, 4 different machine learning techniques may be evaluated: (i.) (Regularized) logistic regression; (ii.) Bayesian logistic regression; (iii.) Random forest classification; and (iv.) Naive bayes classifier. Models may be compared via their cross-validated log likelihood score, calculated only using the “Training Set,” wherein the “Training Set” may be split into 5 folds, wherein each model may be estimated on 4 of the folds and evaluated on the 5th, and wherein this procedure may be repeated such that each fold is held out once. In a further embodiment, the logistic regression and random forest models have hyperparameters that define the complexity of the model. In an embodiment, for these models, nested cross-validation was used, wherein cross-validation may be performed on the 4 training folds to determine the optimal hyperparameters for that data, wherein the model may be fit to the 4 training folds using the optimal hyperparameters, and wherein this model may be used to generate predictions for the left out fold. As a non-limiting example, hyperparameter values tested for Logistic regression may include, (i.) penalty value: [0.001, 0.01, 0.1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512], and (ii.) 11 ratio (for elasticnet penalty): [0, 0.1, . . . , 0.9, 1]. As a non-limiting example, hyperparameter values tested for Random forest may include, (i.) number of trees: [2, 4, 8, 16, 32, 64, 128, 256, 512, 1024], (ii.) max tree depth: [1, 2, . . . , 6, 7], and (iii.) criterion function: [Gini impurity, Shannon information gain]. As shown in FIG. 3A, from all of the models that are tested, the best model may be selected according to a set of scores collected for each trial. In an embodiment, scores may be generated using a process of “cross-validation.” For example, for each trial, the model may be configured to fit data comprising most of the training set (for example, an 70% subset of the training set), and the fitted model may be utilized to predict the validation fold (for example, the remaining 30% of the training set). In each trial, this process may repeat for a number of iterations (for example, five, corresponding to one iteration each for prediction of each 30% validation fold). The process may repeat once for each sector of training data, with predictions made for the remaining 30%. The resulting predictions may be stored for each trial and each trial iteration. In an embodiment, these predictions are then compared to the true values in order to compute a set of scores for each trial. Following the cross-validation process, a model may be fit to the entirety of the training set and may be utilized to generate a probability prediction of the test set. Such a procedure may produce estimates of future “out-of-sample” performance, providing insight to a reproducible selection of parameters for implementation. FIG. 3A displays a non-limiting exemplary sample size of n=2,350, however, any suitable sample size may be used and the test data, training data, training folds, and/or validation folds may be any suitable subsets thereof. In sum, as shown in FIG. 3A, algorithm development may include the processes of splitting initial data into test data and training data, wherein the training data is utilized in a cross-validation process. For example, the training data may be further split into one or more training folds and one or more validation folds. In one embodiment, the model may be fitted on data from four folds and the fitted model may predict the fifth fold. Such a process may be repeated a selected number of times (for example, four times) to get predictions for each fold. Therefore, the “cross-validated” predictions may be collected, and predictions may be compared to their true target values. The trials may be repeated with different model parameters and models to determine those that are most accurate and/or deliver a model best-equipped to predict treatment adherence likelihood. Classification scores may be determined for all trials and model parameters. Therefore, the model with the highest classification score may be selected and such a model may be utilized in future instances. In such an embodiment, said model may be utilized to generate predictions for the held-out test set data (for example, previously split from the initial full data set). Accordingly, the test set predictions may be evaluated for final classification scores. In sum, referring to FIG. 3B, the process of algorithm development and execution may being with, step 302, cross-validation via splitting the training data into training folds and validation fold(s). At step 304, the trials may be repeated for each permutation of different model and parameter. Accordingly, at step 304, each trial may represent an attempt at producing the most accurate results with a model by utilizing a uniquely tuned model parameter schema. At step 306, the model that has performed with the highest classification score may be selected. At step 308, the selected model may be retrained on the full training data, allowing the selected model to be further fine-tuned. At step 310, predictions may be generated with the selected model for the held-out test set. Ultimately, the model defined by the aforementioned process may be tuned to classify treatment adherence for a particular treatment. In various embodiments, the aforementioned process may be utilized to train and tune models for any treatment. In an embodiment, for each type of classifier, there may be a list of settings that can be altered. Said list may depend on the structure of the classifier. Accordingly, a system developer may select a list of values to try for each setting. For example, such a setting test could be devised as a finite list of specific values (“grid search”) or it could be devised as a range within which to test a specified amount of randomly selected values (“random search”). In such an example, once the list of values to try for each setting is determined, each “trial” may fit the model to the data using a unique combination of values across all the settings for that classifier type. In the non-limiting example where a classifier has two specified values for both of two settings, four total trials would be run, one for each unique combination of values. Accordingly, after running a series of trials and inspecting the results, another series of trials may be run using a different set of values to maximize classifier performance on the cross-validated predictions. In such an example, each iteration seeks to identify the combination of settings from early runs with the best performance, eliminate values with worse performance, and improve the performance on cross-validated predictions on subsequent runs. As an example, the mathematical relationship between the inputs and the estimated probability of IV ketamine adherence may be represented, in part, by a probability function p(x), where p (x) is defined as the probability that a given patient will complete at least 4 sessions of IV ketamine treatment. However, the p(x) function may be altered and/or otherwise modified to determine the probability of completion of any portion or milestone of any treatment and/or drug regimen. Thus, the p(x) function should not be viewed as limited to the example of IV ketamine treatment. The algorithm may utilize: wherein f is a linear formula defined by one constant intercept and 37 multiplicative coefficients applied to 37 measured variables as such: f=β 0+β1 x 1+β2 x 2+β3 x 3 . . . +β37 x 37 wherein β0 is a constant value and β1 . . . 13 are coefficients. The 37 variables in f may be defined as such: x1 Normalized population density of patient's resident zip code x2 Normalized median income of patient's resident zip code x3 Normalized median home of patient's resident zip code x4 Normalized number of total ICD-10 diagnoses x5 Normalized number of ICD-10 diagnoses considered as psychiatric conditions x6 Normalized number of patients clinic has previously treated with KIT x7 Normalized proportion of prior patients at the clinic that met the threshold for adherence to KIT x8 Normalized patient's age at first infusion x9 Normalized patient's BMI x10 Normalized number of days patient had been associated with the clinic prior to their first KIT treatment x11 Normalized GAD7 Composite Score x12 Normalized PHQ9 Composite Score x13 GAD-7 Item 1 Score x14 GAD-7 Item 2 Score x15 GAD-7 Item 3 Score x16 GAD-7 Item 4 Score x17 GAD-7 Item 5 Score x18 GAD-7 Item 6 Score x19 GAD-7 Item 7 Score x20 PHQ-9 Item 1 Score x21 PHQ-9 Item 2 Score x22 PHQ-9 Item 3 Score x23 PHQ-9 Item 4 Score x24 PHQ-9 Item 5 Score x25 PHQ-9 Item 6 Score x26 PHQ-9 Item 7 Score x27 PHQ-9 Item 8 Score x28 PHQ-9 Item 9 Score x29 1 if patient is male, 0 otherwise x30 1 if patient is in relationship, 0 otherwise x31 1 if patient filled out an intake form for the clinic, 0 otherwise x32 1 if patient is diagnosed with a mood disorder, 0 otherwise x33 1 if patient is diagnosed with an anxiety disorder, 0 otherwise x34 1 if patient is diagnosed with an attention disorder, 0 otherwise x35 1 if patient had a visit at the clinic prior to their first KIT treatment, 0 otherwise x36 1 if patient's provider is a physician, 0 otherwise x37 1 if patient's provider has an advanced nurse or nurse practitioner credential 0 otherwise However, the 37 variables in f may be defined as any suitable measures or metrics derived from patient intake data. Additionally, f may include any suitable number and/or combination of variables. As a non-limiting example, the normalization formula for numeric variables may be defined as: x i=(x raw −x min)÷(x max −x min) wherein terms may be defined as: xi=Value of x input to algorithm xraw=Original measured value of x xmax=Sample maximum value of x xmin=Sample minimum value of x. In an embodiment, the normalization approach is dependent on whether the variable is a continuous variable or a binary variable. In an embodiment, for continuous variables (i.e., variables whose values are integers or real numbers and not a simple true or false), outliers values may be removed, for example, using a kernel density estimation approach. Accordingly, the probability density function of the variable may be estimated, any variables with a probability density lower than a predetermined percentage of the maximum density may be removed. A power transformation may be applied to reshape the distribution of values to be approximately Gaussian (xt=transform(x)). In an embodiment, missing variables may be ignored during the reshaping of distributions. The values may be scaled using a z-transformation, for example: xz=(xt−mean(xt))/st_dev(xt). Missing values may be ignored during the z-transformation. Missing values may be “imputed,” wherein a value of 0 may be inserted for all unknown values or values that were removed as outliers earlier. In an embodiment, for binary variables, variables may be coded as 1 if true, −1 if false, and/or 0 if missing. Although the above means of normalization may be utilized for one or more of the models described herein, some classifiers may utilize additional normalization steps, which are contemplated below. In sum, as shown in FIG. 4 , at step 402, the algorithm may first receive patient data (for example, demographic information or other data derived from patient intake). The algorithm may then, at step 404, transform raw values to rescaled values (for example, as described herein as “scaling” and/or “normalizing”). After the raw values have been rescaled, at step 406, model weights, as described herein, may be applied to each of the scaled values. Thus, once the model weights are applied to the scaled values, at step 408, a probability prediction may be generated via the probability function. The steps of normalizing, weighting scaled values, and calculating a probability prediction via the probability function may be implemented via the computerized components and networks as disclosed above and in FIGS. 1-2 . The architecture of the algorithm may not reside on a single server, but rather a container that may be deployed on-demand across one of many servers (i.e., AWS servers). However, in an alternate embodiment, the architecture of the algorithm may reside on a single server. FIG. 5 displays metrics of classifier accuracy generated from out-of-sample predictions of the selected algorithm. These metrics and similar metrics may be a source of evidence that the selected algorithm accomplished the desired technical solution. In alternate embodiments, different data points may be used as inputs to the algorithm, (either by removing a number of inputs, adding new inputs, or replacing a number of inputs with others). As a non-limiting example, the PHQ-9 depression measurement may be replaced and/or supplemented with a different measurement metric, such as QIDS. Accordingly, modification of the inputs may alter the algorithm. The algorithm may assign different weights to existing inputs if other inputs were added or were removed, and any replacement inputs may also have a different weight assigned to them. In another alternate embodiment, a different type of classifier may be implemented. The classifier may be a “linear” model, wherein the form of the algorithm is restricted to a linear formula. However, the classifier may be nonlinear in nature, such as decision tree models or K-Nearest Neighbors models. The classifier may also be characterized as an “ensemble” model, wherein the function of the classifier may be generated by a combination of multiple individual classifiers. Such an ensemble model may not be sufficiently described in a single formula as displayed above. “Ensemble” may refer to any type of model where multiple individual models (aka “base estimators”) contribute to the predictions. As a non-limiting example, two distinct types of models (e.g., logistic regression and naive Bayes) could be developed using the same features dataset and target. In one such instance, the first model type predicts a positive class probability of 0.80, the second model type predicts a positive class probability of 0.60, and the ensemble algorithm may average both probabilities to produce a final probability of 0.70. As a further non-limiting example, the System may be equipped to utilize algorithms commonly implemented as ensembles in standard machine learning software packages (e.g., a random forest model, which is an ensemble of decision trees, where the predictions of tens, hundreds, or even thousands of decision trees can be averaged to arrive at the final prediction). The classifier may also be characterized as a “black box” model, wherein the transformations applied to the data inputs may occur in a process comprising multiple individual steps that are dynamic and interdependent. Similarly, such a black box model may not be sufficiently described in a single formula as displayed above. Further, such a black box model may be applied through application of a trained model directly in software. In an alternate embodiment, the System may include “stacked” implementations of algorithms, wherein the output(s) of one algorithm may be fed as inputs to one or more additional algorithms to produce the final predictions. Additional classifiers may include: Bayesian linear models (which may be similar to linear models, but estimate the uncertainty in the relationships between model variables and outcomes); hierarchical models (which model parameters may have different values based on their relationships with other variables. For example, the “weight” for PHQ-9 scores may be different for patients who are treated by a physician vs. patients who are treated by a provider with an advanced nursing credential); naive Bayes classifiers (which leverage Bayes Theorem to estimate how likely a set of variables is to appear in one “class” vs. another); and/or kernel-based methods, including but not limited to Support Vector Machines, Relevance Vector Machines, and Gaussian Process Classification, which use linear methods on data that is transformed to a high-dimensional, non-linear space. In further embodiments, to improve the algorithm performance, additional data points may be included to provide new inputs to the model. There may be additional explanatory variables that, when included, aid in error correction and/or improve overall classification performance. The present disclosure contemplates the possibility that derivations of existing input data may improve performance when added to the feature set. For example, additional new variables computed from diagnostic data or multiplicative combinations of features may add additional explanatory power to predictive models. Additionally, data integrated with smartphones and/or biotech assessments (e.g., brain electrical activity measures) may be utilized. Such additional inputs may be derivatives of the included inputs (for example, the product of two or more inputs or the squared value of a single input). Alternatively, such additional inputs may be derived from new measures and data points not included in the initial inputs. In one embodiment, inputs may be removed to improve performance of the algorithm. Further, as described above, any suitable classifier may be implemented. In another embodiment, the initial sample size of data may be increased as to better fit the algorithm. For example, an increase in the sample size of the data may be utilized to accurize the classifiers for training. Further, the System may be configured for updating the model's predictions in “real-time” as a patient progresses through the course of treatment. For example, an algorithm trained on the set of patients who have completed a particular milestone (for example, at least 1 ketamine infusion) may be utilized to illuminate evaluation at that point in the course of treatment (for example, as compared to the predictions served after the patient's initial evaluation). The algorithm as described herein may be modified by alteration of the target variable. As a non-limiting example, instead of training the model on treatment adherence, the algorithm may be trained to predict whether a patient has remission from depression after IV ketamine treatment. The algorithm described herein may be configured to make accurate predictions on out-of-sample data. Accordingly, the algorithm may be adapted to utilize a machine learning framework in conjunction with readily acquired standard patient intake data to predict likelihood of adherence to prescribed IV ketamine treatment for a particular patient. The algorithm may include transforming the raw values of clinical measures (for example, QIDS, GAD-7) into rescaled values. This step, often referred to as “Scaling” or “Normalizing” the data, may be taken both when fitting the model to training data in the data experimentation workflow outlined in FIG. 3A and when the model is implemented in software for making predictions on new samples. This step may improve both the data experimentation workflow and the software implementation. Accordingly, normalizing the data increases accuracy of predictions because, for some inputs, the algorithm's weights may be either much too small or too large for the unscaled data. The algorithm described herein may be executed and/or used in connection with any suitable machine learning, artificial intelligence, and/or neural network methods. For example, the machine learning models may be one or more classifiers and/or neural networks. However, any type of models may be utilized, including regression models, reinforcement learning models, vector machines, clustering models, decision trees, random forest models, Bayesian models, and/or Gaussian mixture models. In addition to machine learning models, any suitable statistical models and/or rule-based models may be used. In an embodiment, the desired target variable for a dataset may be an indicator of whether a patient completed the prescribed full initial course (induction) of the particular treatment (e.g., IV ketamine infusions). The full initial course may be defined as completing a predetermined portion of the treatment (e.g., at least 4 infusions within 28 days from the intake evaluation). In an embodiment, patients who completed the full course may be assigned a 1 and all other patients may be assigned a 0, for the purpose of training statistical models to predict said target. The algorithm and underlying classifier may be determined by seeking a classifier that predicts the target as accurately as possible. More specifically, methods (for example, as shown in FIG. 3A) may be executed to produce a classifier to be as accurate when making predictions for future patients with data that was not used to train the model. Accordingly, a “test set” may be created by removing a predetermined portion of the sample and holding it out for later testing. The remaining portion of data (the “training set”) may be utilized for a sequence of model training trials. Each trial may test a unique combination of each of the parameters. Parameters may include the type of classifier, the value of regularization strength of the classifier (for example, with a predetermined number of options tested), the probability threshold for predicting a patient as a “completer” (for example, a predetermined number of values tested). For each of the trials, the classifier may be “fit” to the training data. For example, in “fitting” the classifier attempts to learn the mathematical relationship between the inputs and the target variable. In an embodiment, for each trial, the unique combination of parameters may impact how the model fits to the training data. In such an embodiment, as a result, the fitted models from all the trials may differ from each other, even when all are using the same data for model fitting. The purpose of repeating multiple trials with different parameters may be to discover the combination of parameters that produce the most accurate predictions for “out-of-sample” data (data that the model did not use for fitting). From the models that were tested, the best model may be selected according to a set of scores collected for each trial. In an embodiment, scores are generated using a process of “cross-validation”. For each trial, the model may fit to a subset of the training data, and the fitted model may be used to predict the remaining portion. On each trial, this process repeats a predetermined number of times (once for each unique portion of training data, with predictions made for the remaining portion), and all predictions may be stored. These predictions may then be compared to the true values to compute a set of scores for each trial. In an embodiment, the data inputs for the algorithm may be entered into a patient mobile or web application and/or a provider web application. All inputs may be stored in an electronic health record database. In an embodiment, a separate software “container” holds all the necessary programming to convert the raw data stored in the database to the patient's estimated probability of treatment completion. In an embodiment, this conversion follows a sequence of the following steps: each raw data point is converted into a rescaled value; according to the formula provided by the trained algorithm, a multiplier or “weight” is assigned to each input data point to calculate the change in probability associated with that specific input; and all inputs are summed to generate the final probability prediction. In an embodiment, the algorithm software container stores the probability value in the electronic health record database and then the probability value may be made visible in the patient's chart in the web application of the electronic health record platform. FIG. 6 is a workflow depicting an embodiment of the process of algorithm development. Referring to FIG. 6 , the System may include a computer-implemented method. In an embodiment, said method may, at step 602, receive a full dataset, wherein the full dataset may be comprised of patient data. Further, the computer-implemented method may, at step 604, isolate at least a training dataset and a test dataset from the full dataset. Further, at step 606, the training dataset may be split into one or more training folds and/or a validation fold. Moreover, at step 608, the method may include training, over a plurality of trials, one or more models on at least the one or more training folds for each of one or more parameter configurations. In an embodiment, at step 610, the model may be validated on the validation fold. Said parameter configurations may be correlated to the one or more models. In an embodiment, the one or more models are configured to classify a target variable, wherein the target variable is an indicator of whether a patient will complete a treatment. The computer-implemented method may validate a given model of the one or more models for each of the said models. In a further embodiment, at step 612, the method may compare a training score against a validation score, wherein the training score is based on the training of the one or more models, and wherein the validation score is based on the validating of the given model. Additionally, the method may, at step 614, record classifications scores for each of the one or more models, wherein the classifications scores are based on at least one of the training score and the validation score. In an embodiment, at step 616, the method may select a selected model from the one or more models, wherein the selected model has a top classification score. In yet a further embodiment, at step 618, the method may retrain the selected model on the full dataset, wherein said retraining may, at step 620, generate an adherence prediction for the test dataset. Various elements, which are described herein in the context of one or more embodiments, may be provided separately or in any suitable subcombination. Further, the processes described herein are not limited to the specific embodiments described. For example, the processes described herein are not limited to the specific processing order described herein and, rather, process blocks may be re-ordered, combined, removed, or performed in parallel or in serial, as necessary, to achieve the results set forth herein. It will be further understood that various changes in the details, materials, and arrangements of the parts that have been described and illustrated herein may be made by those skilled in the art without departing from the scope of the following claims. All references, patents and patent applications and publications that are cited or referred to in this application are incorporated in their entirety herein by reference. Finally, other implementations of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the claims. 1. A computer-implemented method for treatment adherence prediction, comprising the steps of: receiving a full dataset; isolating a training dataset and a test dataset from the full dataset; splitting the training dataset into one or more training folds and a validation fold; training, over a plurality of trials, one or more models on each of the one or more training folds for each of one or more parameter configurations correlated to said one or more models, each of the one or more models configured to classify a target variable, wherein the target variable is an indicator of whether a patient will complete a treatment; validating, for each of the one or more models for a given trial of the plurality of trials, a given model of the one or more models on the validation fold; comparing a training score with a validation score, wherein the training score is based on the training of the one or more models over the one or more training folds, and wherein the validation score is based on the validating of the given model on the validation fold; recording classifications scores for each of the one or more models, the classifications scores based on the training score and the validation score for each of the one or more models; selecting a selected model from the one or more models, the selected model having a top classification score; retraining the selected model on the full dataset; and generating adherence predictions for the test dataset. 2. The computer-implemented method of claim 1, wherein the treatment comprises intravenous (IV) ketamine infusions. 3. The computer-implemented method of claim 2, wherein the completeness of the treatment is defined as the patient completing at least four IV ketamine infusions within twenty-eight days from an intake evaluation. 4. The computer-implemented method of claim 1, wherein the one or more parameter configurations are based on a list of settings associated with each of the one or more models. 5. The computer-implemented method of claim 1, wherein the one or more models are selected from a group of classifier types comprising Bayesian linear models, hierarchical models, naive Bayes classifiers, and kernel-based methods. 6. The computer-implemented method of claim 1, wherein at least one of the one or more model is an ensemble model. 7. The computer-implemented method of claim 1, wherein at least the training dataset comprises a plurality of variables, wherein each of the one or more models is configured to classify a target variable based on each of the plurality of variables. 8. The computer-implemented method of claim 7, wherein the plurality of variables comprises one or more continuous variables and one or more binary variables, wherein each of the one or more continuous variables is an integer or real number, and wherein each of the one or more binary variables is encoded as 1 if true, −1 if false, and 0 if missing. 9. The computer-implemented method of claim 7, wherein the plurality of variables comprises a normalized population density of a resident zip code, a normalized median income of a resident zip code, a normalized median home price of a resident zip code, a normalized number of total ICD-10 diagnoses, and a normalized number of ICD-10 diagnoses considered as psychiatric conditions. 10. The computer-implemented method of claim 9, wherein the plurality of variables comprises a normalized number of prior patients treated by a clinic with KIT, a normalized proportion of prior patients at the clinic that met a threshold for adherence to KIT, the patient's age at first infusion, the patient's BMI, and a normalized number of days patient had been associated with the clinic prior to their first KIT treatment. 11. The computer-implemented method of claim 10, wherein the plurality of variables comprises a normalized GAD7 composite score and a normalized PHQ9 composite score. 12. The computer-implemented method of claim 10, wherein the plurality of variables comprises a GAD-7 Item 1 Score, a GAD-7 Item 2 Score, a GAD-7 Item 3 Score, a GAD-7 Item 4 Score, a GAD-7 Item 5 Score, a GAD-7 Item 6 Score, a GAD-7 Item 7 Score, a PHQ-9 Item 1 Score, a PHQ-9 Item 2 Score, a PHQ-9 Item 3 Score, a PHQ-9 Item 4 Score, a PHQ-9 Item 5 Score, a PHQ-9 Item 6 Score, a PHQ-9 Item 7 Score, a PHQ-9 Item 8 Score, and a PHQ-9 Item 9 Score. 13. The computer-implemented method of claim 8, wherein the one or more continuous variables comprises sex, relationship status, completion status of intake form, mood disorder diagnosis, anxiety disorder diagnosis, attention disorder diagnosis, pre-visit status, and provider physician status. 14. The computer-implemented method of claim 13, wherein if the sex is male, said variable value is 1, if the relationship status is positive, said variable value is 1, if the completion status of intake form is completed, said variable value is 1, if the mood disorder diagnosis is positive, said variable value is 1, if the anxiety disorder diagnosis is positive, said variable value is 1, if the attention disorder diagnosis is positive, said variable value is 1, if the pre-visit status is positive, said variable value is 1, and if the provider physician status is positive, said variable value is 1. 15. The computer-implemented method of claim 8, wherein, for the one or more continuous variables, outliers are removed using a kernel density estimation approach. 16. The computer-implemented method of claim 8, wherein, for the one or more continuous variables, outliers are removed by removing variables having a probability density lower than a predetermined percentage of a maximum density. 17. The computer-implemented method of claim 1, wherein the plurality of trials includes all permutations for the one or more models and the one or more parameter configurations. 18. A non-transitory computer readable medium having a set of instructions stored thereon that, when executed by a processing device, cause the processing device to carry out an operation of treatment adherence prediction, the operation comprising: receiving a full dataset; isolating a training dataset and a test dataset from the full dataset; splitting the training dataset into one or more training folds and a validation fold; training, over a plurality of trials, one or more models on each of the one or more training folds for each of one or more parameter configurations correlated to said one or more models, each of the one or more models configured to classify a target variable, wherein the target variable is an indicator of whether a patient will complete a treatment; validating, for each of the one or more models for a given trial of the plurality of trials, a given model of the one or more models on the validation fold; comparing a training score with a validation score, wherein the training score is based on the training of the one or more models over the one or more training folds, and wherein the validation score is based on the validating of the given model on the validation fold; recording classifications scores for each of the one or more models, the classifications scores based on the training score and the validation score for each of the one or more models; selecting a selected model from the one or more models, the selected model having a top classification score; retraining the selected model on the full dataset; and generating adherence predictions for the test dataset. 19. A system for treatment adherence prediction, the system comprising a server comprising at least one server processor, at least one server database, at least one server memory comprising a set of computer-executable server instructions which, when executed by the at least one server processor, cause the server to: receive a full dataset; isolate a training dataset and a test dataset from the full dataset; split the training dataset into one or more training folds and a validation fold; train, over a plurality of trials, one or more models on each of the one or more training folds for each of one or more parameter configurations correlated to said one or more models, each of the one or more models configured to classify a target variable, wherein the target variable is an indicator of whether a patient will complete a treatment; validate, for each of the one or more models for a given trial of the plurality of trials, a given model of the one or more models on the validation fold; compare a training score with a validation score, wherein the training score is based on the training of the one or more models over the one or more training folds, and wherein the validation score is based on the validating of the given model on the validation fold; record classifications scores for each of the one or more models, the classifications scores based on the training score and the validation score for each of the one or more models; select a selected model from the one or more models, the selected model having a top classification score; retrain the selected model on the full dataset; and generate adherence predictions for the test dataset.

2023-07-13

en

2024-01-18

US-201816016920-A

Structures, methods and applications for electrical pulse anneal processes ABSTRACT Structures and methods are provided for nanosecond electrical pulse anneal processes. The method of forming an electrostatic discharge (ESD) N+/P+ structure includes forming an cathode on a substrate and a anode on the substrate. The anode is in electrical contact with the cathode. The method further includes forming a device between the cathode and the anode. A method of annealing a structure or material includes applying an electrical pulse across an electrostatic discharge (ESD) N+/P+ structure for a plurality of nanoseconds. FIELD OF THE INVENTION The invention relates to structures and methods for electrical pulse anneal processes and, more particularly, to structures and methods for nanosecond electrical pulse anneal processes. BACKGROUND An annealing process is a heat treatment of a wafer in order to modify properties of materials/structures processed on its surface or in the bulk. For example, annealing is performed on the wafer in order to activate certain species (dopants) of a device such as, for example, associated with a transistor. Depending on the structures or dopants to be annealed, the temperatures necessary for such annealing process can range upwards of 1000° K in some applications and much lower temperatures in other applications. Annealing can be performed by many different processes. For example, a rapid thermal annealing (RTA) of a wafer can be performed in an oven at high temperatures. In such applications, the entire structure and all materials on the surface are subject to an anneal at the same temperature. However, the anneal temperature for one device or structure may not be applicable for another device or structure, resulting in damage to some devices or structures. This process also has a large temperature ramp up time which increases processing times and costs. Another annealing process is a laser anneal. In this process, for example, an excimer laser is used to anneal structures/materials on the wafer. This annealing process has a large temperature ramp up time and duration and a non-uniform temperature distribution, which causes limitations for species activation/device performance. For example, the laser has a large beam resolution on the order of about 500 μm2 which makes it impractical for use with smaller areas requiring an anneal. As such, using a laser annealing process may damage structures close to the anneal. Also, as the beam is known to diverge due to reflection, it is possible to cause a non-uniform anneal. In yet another annealing process, it is possible to place a resistor on a back end of line (BEOL) device in order to anneal a front end of line (FEOL) device. In such applications, though, it is difficult to control the heating and, as a result, it is possible to damage the FEOL device during the annealing process. Typically, such annealing method is only good for large FEOL devices. Accordingly, there exists a need in the art to overcome the deficiencies and limitations described hereinabove. SUMMARY In a first aspect of the invention, a method of forming an electrostatic discharge (ESD) N+/P+ structure comprises forming an N+ diffusion on a substrate and a P+ diffusion on the substrate. The P+ diffusion is in electrical contact with the N+ diffusion. The method further comprises forming a device between the N+ diffusion and the P+ diffusion. In another aspect of the invention, a method of annealing a structure or material comprises applying an electrical pulse across an electrostatic discharge (ESD) N+/P+ structure for a plurality of nanoseconds. In yet another aspect of the invention, an electrostatic discharge (ESD) N+/P+ structure comprises an N+ diffusion on a substrate and a P+ diffusion on the substrate which is in electrical contact with the N+ diffusion. The structure further includes a device between the N+ diffusion and the P+ diffusion. In another aspect of the invention, there is a design structure tangibly embodied in a machine readable medium used for designing, manufacturing, or testing an integrated circuit. The design structure includes the method steps and/or structure of the present invention. BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS The present invention is described in the detailed description which follows, in reference to the noted plurality of drawings by way of non-limiting examples of exemplary embodiments of the present invention. FIG. 1 shows a cross sectional view of a structure in accordance with aspects of the invention; FIG. 2 shows a top view of the structure of FIG. 1; FIGS. 3a and 3b show a temperature profile and related temperature graph for the structure of FIG. 1; FIG. 4 shows a voltage vs. temperature transient simulation graph for the structure of FIG. 1; FIG. 5 shows a cross sectional view of a ring structure in accordance with aspects of the invention; FIG. 6 shows a top view of the ring structure of FIG. 5; FIGS. 7a and 7b show a temperature profile and related temperature graph for the structure of FIG. 5; FIG. 8 shows a voltage vs. temperature transient simulation graph for the structure of FIG. 5; and FIG. 9 is a flow diagram of a design process used in semiconductor design, manufacture, and/or test. DETAILED DESCRIPTION The invention relates to structures and methods for electrical pulse anneal processes and, more particularly, to structures and methods for nanosecond electrical pulse anneal processes. In embodiments, the present invention includes, for example, an electric static discharge (ESD) device which is capable of generating heat for annealing processes. Advantageously, upon the application of an electric pulse, the ESD device can generate localized heat (e.g., about 500° K to 1200° K) to a particular feature of a device for annealing processes. In embodiments, the heat is uniform and can be generated at a small, localized area of about 50 to 100 μm2. In this way, advantageously, the present invention provides structures and methods that can focus heat on a localized area for annealing processes, without damaging surrounding structures. The devices that can benefit from the present invention include all active and passive devices in FEOL, BEOL and the substrate, for example. FIG. 1 shows a structure in accordance with an aspect of the invention. More particularly, the structure 10 is an ESD body diode structure. In embodiments, the structure 10 includes, for example, a BOX (buried oxide) layer 14 formed on a substrate 12. An N+ diffusion 16 and a P+ diffusion 18 are formed in the BOX layer 14 using conventional processes and dopants such that no further explanation is required herein for an understanding of the invention. After the implantation process, the structure can undergo a well stabilization process, e.g., an anneal at about 500° K to 600° K. In the structure of FIG. 1, the N+ diffusion 16 will act as a cathode and the P+ diffusion 18 will act as an anode. In embodiments, the ESD diode will be formed between the N+ diffusion 16 and the P+ diffusion. In embodiments, contacts 16 a and 18 a are formed in electrical contact with the N+ diffusion 16 and P+ diffusion 18, respectively. The contacts 16 a and 18 a can be formed, for example, using a conventional in-sitsu doped poly deposition process. As should be understood, the contacts 16 a and 18 a are used for supplying an electrical pulse to generate heat across an active region. More specifically, the contact 18 a will allow an electric pulse to flow through the anode (P+ diffusion 18) of the structure 10; whereas, the contact 16 a will allow the electric pulse to flow out of the cathode (N+ diffusion 16). In an optional step, a metal deposition process (removable) can be performed on the structure. Still referring to FIG. 1, a front end of the line (FEOL) active or passive device 20 is formed in electrical contact with the N+ diffusion 16 and P+ diffusion 18, respectively. The active or passive device 20 can be formed using any conventional process for the particular device. In embodiments, the device 20 can be any desired device such as, for example, a small circuit for a phase-locked loop or phase lock loop (PLL), a ring oscillator or voltage controlled oscillator (VCO), etc. An optional block 22 may be formed on the device 20 using a conventional blocking process such as, for example, a CVD (chemical vapor deposition) process. As should now be understood by those of skill in the art, the N+ diffusion 16, active device 20 and the P+ diffusion 18 form an ESD N+/P+ body diode structure. FIG. 2 shows a top view of the ESD body diode structure 10 of FIG. 1. In embodiments, the active area 20 (e.g., active or passive device 20) is positioned between the N+ diffusion 16 and the P+ diffusion 18. Also, in embodiments, the active area is about 50 to 100 μm2; however, other dimensions are also contemplated by the present invention (e.g., including larger than about 50 to 100 μm2). The active area 20 is in electrical contact with the N+ diffusion 16 and the P+ diffusion 18, thereby forming the ESD N+/P+ body diode structure 10. In operation, an electrical pulse is applied to the contact 18 a of the structure which, in turn, will very quickly produce heat across the ESD N+/P+ body diode structure 10. More particularly, an electrical pulse of about 100 ns to about 500 ns can be applied across the ESD N+/P+ body diode structure 10 in order to generate a localized heat on the order of about, for example, 500° K to about 1200° K, depending on the area of the active area 20 and the duration of the electrical pulse. In embodiments, the electrical pulse is capable of generating a uniform, localized heat to a very precise location, e.g., within an area of 50 to 100 μm2. The localized heat will anneal a very small area, e.g. a doped region to activate dopants, which would not otherwise be possible with laser anneal or back end of line (BEOL) devices. Also, as the heat is very localized, other regions of the substrate will not be exposed to more than a maximum allowable temperature (e.g., a temperature lower than the annealing temperature) during the entire processing of the wafer, thus ensuring that no damage will be sustained to other devices or regions of the device. FIG. 3a shows a two-dimensional temperature profile and FIG. 3b shows a one dimensional temperature graph of the structure shown in FIG. 1. As shown in FIG. 3b , the “y” axis is temperature, in degrees Kelvin, and the “x” axis is distance across the device as measured in microns (e.g., in the “y” direction). As noted in the corresponding graphs, at a duration of about 100 nanoseconds (with a rise and fall time of about 7 nanoseconds), an electrical pulse of about 250 milliamps can apply a peak temperature of about 950° K for a 10 micron by 10 micron structure. The graphs further show a uniform, local temperature of about 700° K across a “y” cross section of the active area (e.g., about 8 to 10 microns). Accordingly, it is shown that an electrical pulse is capable of generating a uniform, localized heat to a very precise location, e.g., within an area of 50 to 100 μm2, while not damaging other regions of the device. In further examples, a 25 milliamps electrical pulse can be applied to a 100 micron by 10 micron device. Also, in still a further example, 2.5 milliamps electrical pulse can be applied to a 100 micron by 100 micron device. Further examples are also contemplated by the present invention, depending on the particular area of the device. The present invention can also be applied for FEOL or BEOL structures. In any of these illustrative examples, the electrical pulse can have a duration of about 100 ns to about 500 ns, and results in a uniform, localized anneal. FIG. 4 shows a voltage vs. temperature transient simulation graph for the structure of FIG. 1. As shown in FIG. 4, the temperature rise, upon an application of an electrical pulse, is very fast. Also, as shown in the peak of the voltage line, voltage is very contained and, as such, will not cause any damage to other structures (devices) on the wafer. FIG. 5 shows a cross sectional view of a ring structure in accordance with aspects of the invention and FIG. 6 shows a top view of the ring structure of FIG. 5. A shown in these figures, the structure 11 is an ESD N+/P+ body diode structure. In embodiments, the structure 11 includes, for example, a BOX layer 14 formed on a substrate 12. An N+ diffusion 16 and a P+ diffusion 18 are formed in a closed or ring shape on the BOX layer 14 using conventional processes and dopants as discussed above. In embodiments, the N+ diffusion 16 is the outer structure and the P+ diffusion 18 is in the inner structure. In this embodiment, the N+ diffusion 16 and the P+ diffusion 18 are formed in electrical contact, with the N+ diffusion 16 as a cathode and the P+ diffusion 18 as an anode. In embodiments, the ESD diode will be formed between the N+ diffusion 16 and the P+ diffusion. In embodiments, contacts 16 a and 18 a are formed in electrical contact with the N+ diffusion 16 and P+ diffusion 18, respectively. The contacts 16 a and 18 a can be formed, for example, using a conventional in-sitsu doped poly deposition process as discussed above. As should be understood, the contacts 16 a and 18 a are used for supplying an electrical pulse to generate heat across an active region. More specifically, the contact 18 a will allow an electric pulse to flow through the anode (P+ diffusion 18) of the structure 10; whereas, the contact 16 a will allow the electric pulse to flow out of the cathode (N+ diffusion 16). In an optional step, a metal deposition process (removable) can be performed on the structure. As should now be understood by those of skill in the art, the N+ diffusion 16 and the P+ diffusion 18 form an ESD N+/P+ body diode structure. Still referring to FIGS. 5 and 6, a front end of the line (FEOL) active or passive device 20 is formed within the area formed by the rings of the N+ diffusion 16 and P+ diffusion 18, respectively. The active or passive device 20 can be formed using any conventional process for the particular device. In embodiments, the device 20 can include any desired device such as, for example, a small circuit for a phase-locked loop or phase lock loop (PLL), ring oscillator, VCO, etc. An optional block 22 may be formed on the device 20 using a conventional blocking process such as, for example, a CVD process. FIG. 6 shows a top view of the ESD N+/P+ body diode structure 10 of FIG. 1. In embodiments, the active area 20 (e.g., active or passive device 20) is about 50 to 100 μm2; however, other dimensions are also contemplated by the present invention (e.g., including larger than about 50 to 100 μm2). The active area 20 is surrounded by the N+ diffusion 16 and the P+ diffusion 18 and, in this embodiment, is not part of the ESD device. Similar to the structure of FIG. 1, in operation of the structure of FIG. 5 an electrical pulse is applied to the contact 18 a which, in turn, will very quickly produce heat across the ESD N+/P+ body diode structure 10. More particularly, an electrical pulse of about 100 ns to about 500 ns can be applied across the ESD N+/P+ body diode structure 10 in order to generate a localized heat on the order of about, for example, 500° K to about 1200° K, depending on the area of the active area 20 and the duration of the electrical pulse. In embodiments, the electrical pulse is capable of generating a uniform, localized heat to a very precise location, e.g., within the active area of about 50 to 100 μm2, to anneal a very small area. Also, as the heat is very localized, other regions of the substrate will not be exposed to more than a maximum allowable temperature (e.g., a temperature lower than the annealing temperature) during the entire processing of the wafer, thus ensuring that no damage will be sustained to other devices or regions of the device. FIG. 7a shows a two-dimensional temperature profile and FIG. 7b shows a one dimensional temperature graph of the embodiment of FIG. 5. As shown in FIG. 7b , the “y” axis is temperature, in degrees Kelvin, and the “x” axis is distance across the device as measured in microns (e.g., in the “y” direction). As noted in the corresponding graphs, at a duration of about 100 nanoseconds (with a rise and fall time of about 7 nanoseconds), an electrical pulse of about 250 milliamps can apply a peak temperature of about 1200° K. The graphs further show a uniform, local temperature of about 550° K across a “y” cross section of the active area (e.g., about 8 to 10 microns). Accordingly, it is shown that an electrical pulse is capable of generating a uniform, localized heat to a very precise location, e.g., within an area of 50 to 100 μm2, while not damaging other regions of the device. The plot of FIGS. 7a and 7b will be substantially the same in all cross sections of the device shown in FIGS. 5 and 6. FIG. 8 shows a voltage vs. temperature transient simulation graph for the structure of FIG. 5. As shown in FIG. 8, the temperature rise, upon an application of an electrical pulse, is very fast. Also, as shown in the peak of the voltage line, voltage is very contained and, as such, will not cause any damage to other structures (devices) on the structure. Also, in comparison to the plot of FIG. 4, the voltage drop for the structure of FIG. 5 is smaller than that shown in FIG. 4 (for the structure of FIG. 1). This is due to the diode being smaller for the structure of FIG. 5, for example. FIG. 9 shows a block diagram of an exemplary design flow 900 used for example, in semiconductor IC logic design, simulation, test, layout, and manufacture. Design flow 900 includes processes, machines and/or mechanisms for processing design structures or devices to generate logically or otherwise functionally equivalent representations of the design structures and/or devices described above and shown in FIGS. 1 and 5, for example. The design structures processed and/or generated by design flow 900 may be encoded on machine-readable transmission or storage media to include data and/or instructions that when executed or otherwise processed on a data processing system generate a logically, structurally, mechanically, or otherwise functionally equivalent representation of hardware components, circuits, devices, or systems. Machines include, but are not limited to, any machine used in an IC design process, such as designing, manufacturing, or simulating a circuit, component, device, or system. For example, machines may include: lithography machines, machines and/or equipment for generating masks (e.g. e-beam writers), computers or equipment for simulating design structures, any apparatus used in the manufacturing or test process, or any machines for programming functionally equivalent representations of the design structures into any medium (e.g. a machine for programming a programmable gate array). Design flow 900 may vary depending on the type of representation being designed. For example, a design flow 900 for building an application specific IC (ASIC) may differ from a design flow 900 for designing a standard component or from a design flow 900 for instantiating the design into a programmable array, for example a programmable gate array (PGA) or a field programmable gate array (FPGA) offered by Altera® Inc. or Xilinx® Inc. FIG. 9 illustrates multiple such design structures including an input design structure 920 that is preferably processed by a design process 910. Design structure 920 may be a logical simulation design structure generated and processed by design process 910 to produce a logically equivalent functional representation of a hardware device. Design structure 920 may also or alternatively comprise data and/or program instructions that when processed by design process 910, generate a functional representation of the physical structure of a hardware device. Whether representing functional and/or structural design features, design structure 920 may be generated using electronic computer-aided design (ECAD) such as implemented by a core developer/designer. When encoded on a machine-readable data transmission, gate array, or storage medium, design structure 920 may be accessed and processed by one or more hardware and/or software modules within design process 910 to simulate or otherwise functionally represent an electronic component, circuit, electronic or logic module, apparatus, device, or system such as those shown in FIGS. 1 and 5, for example. As such, design structure 920 may comprise files or other data structures including human and/or machine-readable source code, compiled structures, and computer-executable code structures that when processed by a design or simulation data processing system, functionally simulate or otherwise represent circuits or other levels of hardware logic design. Such data structures may include hardware-description language (HDL) design entities or other data structures conforming to and/or compatible with lower-level HDL design languages such as Verilog and VHDL (VHSIC Hardware Description Language), and/or higher level design languages such as C or C++. Design process 910 preferably employs and incorporates hardware and/or software modules for synthesizing, translating, or otherwise processing a design/simulation functional equivalent of the components, circuits, devices, or logic structures shown in FIGS. 1 and 5, for example, to generate a netlist 980 which may contain design structures such as design structure 920. Netlist 980 may comprise, for example, compiled or otherwise processed data structures representing a list of wires, discrete components, logic gates, control circuits, I/O (Input/Output) devices, models, etc. that describes the connections to other elements and circuits in an integrated circuit design. Netlist 980 may be synthesized using an iterative process in which netlist 980 is resynthesized one or more times depending on design specifications and parameters for the device. As with other design structure types described herein, netlist 980 may be recorded on a machine-readable data storage medium or programmed into a programmable gate array. The medium may be a non-volatile storage medium such as a magnetic or optical disk drive, a programmable gate array, a compact flash, or other flash memory. Additionally, or in the alternative, the medium may be a system or cache memory, buffer space, or electrically or optically conductive devices and materials on which data packets may be transmitted and intermediately stored via the Internet, or other networking suitable means. Design process 910 may include hardware and software modules for processing a variety of input data structure types including netlist 980. Such data structure types may reside, for example, within library elements 930 and include a set of commonly used elements, circuits, and devices, including models, layouts, and symbolic representations, for a given manufacturing technology (e.g., different technology nodes, 32 nm, 45 nm, 90 nm, etc.). The data structure types may further include design specifications 940, characterization data 950, verification data 960, design rules 970, and test data files 985 which may include input test patterns, output test results, and other testing information. Design process 910 may further include, for example, standard mechanical design processes such as stress analysis, thermal analysis, mechanical event simulation, process simulation for operations such as casting, molding, and die press forming, etc. One of ordinary skill in the art of mechanical design can appreciate the extent of possible mechanical design tools and applications used in design process 910 without deviating from the scope and spirit of the invention. Design process 910 may also include modules for performing standard circuit design processes such as timing analysis, verification, design rule checking, place and route operations, etc. Design process 910 employs and incorporates logic and physical design tools such as HDL compilers and simulation model build tools to process design structure 920 together with some or all of the depicted supporting data structures along with any additional mechanical design or data (if applicable), to generate a second design structure 990. Design structure 990 resides on a storage medium or programmable gate array in a data format used for the exchange of data of mechanical devices and structures. Similar to design structure 920, design structure 990 preferably comprises one or more files, data structures, or other computer-encoded data or instructions that reside on transmission or data storage media and that when processed by an ECAD system generate a logically or otherwise functionally equivalent form of one or more of the embodiments of the invention shown in FIGS. 1 and 5, for example. In one embodiment, design structure 990 may comprise a compiled, executable HDL simulation model that functionally simulates the devices shown in FIGS. 1 and 5, for example. Design structure 990 may also employ a data format used for the exchange of layout data of integrated circuits and/or symbolic data format. Design structure 990 may comprise information such as, for example, symbolic data, map files, test data files, design content files, manufacturing data, layout parameters, wires, levels of metal, vias, shapes, data for routing through the manufacturing line, and any other data required by a manufacturer or other designer/developer to produce a device or structure as described above and shown in FIGS. 1 and 5, for example. Design structure 990 may then proceed to a stage 995 where, for example, design structure 990: proceeds to tape-out, is released to manufacturing, is released to a mask house, is sent to another design house, is sent back to the customer, etc. The method as described above is used in the fabrication of integrated circuit chips. The resulting integrated circuit chips can be distributed by the fabricator in raw wafer form (that is, as a single wafer that has multiple unpackaged chips), as a bare die, or in a packaged form. In the latter case the chip is mounted in a single chip package (such as a plastic carrier, with leads that are affixed to a motherboard or other higher level carrier) or in a multichip package (such as a ceramic carrier that has either or both surface interconnections or buried interconnections). In any case the chip is then integrated with other chips, discrete circuit elements, and/or other signal processing devices as part of either (a) an intermediate product, such as a motherboard, or (b) an end product. The end product can be any product that includes integrated circuit chips, ranging from toys and other low-end applications to advanced computer products having a display, a keyboard or other input device, and a central processor. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below, where applicable, are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated. Accordingly, while the invention has been described in terms of embodiments, those of skill in the art will recognize that the invention can be practiced with modifications and in the spirit and scope of the appended claims. What is claimed: 1. A method of making a semiconductor structure, comprising: forming a cathode on and in direct contact with a buried oxide (BOX) layer, wherein the BOX layer is on a substrate; forming an anode on and in direct contact with the BOX layer and in direct contact with the N+ diffusion; and wherein the anode forms an inner ring structure surrounding a device on the BOX layer, and the cathode forms an outer ring structure surrounding the anode. 2. The method of making the semiconductor structure of claim 1, wherein the anode and the cathode form an ESD diode. 3. The method of making the semiconductor structure of claim 1, wherein the anode directly contacts the device. 4. The method of making the semiconductor structure of claim 1, further comprising forming a first electrical contact on the anode and a second electrical contact on the cathode to provide an electrical pulse to the anode and allow the electrical pulse to flow out of the cathode, respectively. 5. The method of making the semiconductor structure of claim 1, wherein the device is an active device. 6. The method of making the semiconductor structure of claim 1, wherein the active device is about 50 μm2 to 100 μm2. 7. The method of making the semiconductor structure of claim 1, further comprising: forming a first electrical contact on the cathode; and forming a second electrical contact on the anode, wherein each of the first electrical contact and the second electrical contact are located outside a perimeter of the device when the semiconductor structure is viewed from a top view. 8. The method of making the semiconductor structure of claim 7, wherein the first electrical contact and the second electrical contact are located on opposite sides of the device when the semiconductor structure is viewed from a side view. 9. The method of making the semiconductor structure of claim 8, further comprising forming a block on the device, the block terminating at an interface between the device and the anode. 10. A method of making an electrostatic discharge (ESD) N+/P+ structure, comprising: forming an ESD diode comprising a cathode and an anode on a buried oxide (BOX) layer on a substrate; and forming a device between the cathode and the anode, wherein the anode directly contacts the device. 11. The method of making the electrostatic discharge (ESD) N+/P+ structure of claim 10, wherein both the cathode and the anode are formed as respective ring structures surrounding the device. 12. The method of making the electrostatic discharge (ESD) N+/P+ structure of claim 11, wherein the cathode is formed as an outer ring and the anode is formed as an inner ring of the respective ring structures. 13. The method of making the electrostatic discharge (ESD) N+/P+ structure of claim 10, further comprising: forming a first electrical contact on the cathode; and forming a second electrical contact on the anode, wherein each of the first electrical contact and the second electrical contact are located outside a perimeter of the device when the ESD N+/P+ structure is viewed from a top view. 14. The method of making the semiconductor structure of claim 13, wherein the first electrical contact and the second electrical contact are located on opposite sides of the device when the ESD N+/P+ structure is viewed from a side view. 15. The method of making the semiconductor structure of claim 14, further comprising forming a block on the device, the block terminating at an interface between the device and the anode.

2018-06-25

en

2018-10-25

US-87767507-A

Software Pipelining Using One or More Vector Registers ABSTRACT A method for managing multiple values assigned to a variable during various stages of a software pipelined process executed in a computing environment. The method comprises allocating two or more slots in a vector register to two or more values associated with said variable during two or more stages of a pipeline process; and rotating values in each slot responsive to an instruction. COPYRIGHT & TRADEMARK NOTICES A portion of the disclosure of this patent document contains material, which is subject to copyright protection. The owner has no objection to the facsimile reproduction by any one of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyrights whatsoever. Certain marks referenced herein may be common law or registered trademarks of third parties affiliated or unaffiliated with the applicant or the assignee. Use of these marks is for providing an enabling disclosure by way of example and shall not be construed to limit the scope of this invention to material associated with such marks. FIELD OF INVENTION The present invention relates generally to multiprocessing computing environments and, more particularly, to a system and method for using vector registers to store values associated with a variable during various software pipeline stages. BACKGROUND Software pipelining refers to a method for changing the order of instructions in a logical loop in a program code executed in a computing environment, to optimize the total execution process. The software pipelining method applies instruction scheduling techniques to efficiently overlap successive iterations of logical loops in the program code and execute them in parallel in a multiprocessing computing environment. A software pipelining scheme may be used to execute series of instructions in the loop where possible in advance, while other series of instructions belonging to a previous phase of the pipeline are being concurrently executed. The pipelining allows for look-ahead processing of certain values for a future stage of the loop, while processing certain values for a current stage of the loop. When a compiler software pipelines a loop, some variables typically need to be assigned to several distinct registers to initiate and support the pipelining process. Since values for a single variable (e.g., variable X) are being calculated concurrently by instructions at different stages of the loop, several registers (as opposed to a single register) need to be allocated to the same variable. The number of registers that are allocated to a variable may be determined in advance by reviewing the logic code for the loop. Two problems may arise in software pipelining. First, the system may run out of available registers. Second, the need to access distinct registers explicitly requires inserting register copy instructions or unrolling of the loop, or specially designated hardware, which can be costly in terms of the associated overhead as provided in more detail below. For example, one method for managing and allocating the various registers is to use multiple scalar registers (e.g., 32-bit wide registers) to store the different values of a variable at different stages. If the value for a variable X is being concurrently calculated for various stages of the pipeline, then multiple scalar registers may be used to maintain the various values. Referring to FIG. 1( a), for example, four scalar registers SR1 through SR4 are illustrated, wherein each scalar register is respectively allocated to hold one of the four values for variable X (i.e., X1, X2, X3, X4) at each stage of a pipeline. In this example, since the loop may be executed more than four iterations, the four registers need to be updated in a rotating scheme, such that the oldest value is discarded from SR1 at each iteration and the value stored in the remaining registers (i.e., SR2, SR3 and SR4) is moved over to the next register. Referring to FIG. 1( b), the value in SR2 is moved to SR1 thereby deleting the value X1, the value in SR3 is moved to SR2, the value in SR4 is moved to SR3, so that the last register SR4 is available for a newly calculated value for X (e.g., X5). As shown, X2, X3, X4, X5 represents the respective values for X as stored in registers SR1 through SR4, after the four separate instructions MOVE, MOVE, MOVE, and COPY are executed to shift and copy the respective values among the registers. Referring to FIG. 1( c), another set of four separate instructions (i.e., MOVE, MOVE, MOVE, COPY) need to be executed to store the values for X in the next pipeline stage in registers SR1 through SR4. As shown, after said four separate instructions are executed, the values for X are shifted to the left by one to allow a new value X6 to be stored in SR4; oldest value for X (i.e., X2) is discarded to make the shift to the left possible. Unfortunately, the above shifting scheme using series of scalar registers is undesirable. Such shifting scheme results in substantial overhead in memory management and execution resources since it requires maintaining multiple scalar registers for each value and multiple instructions will have to be executed for shifting/rotating the values among the registers at each iteration. Rotating register files may be implemented in hardware. However, not all processors support rotating register files in hardware, as it may not be cost-effective overall. As such, the current schemes (e.g., loop unrolling and a hardware implementation of the rotating scheme) have drawbacks and disadvantages in that they either result in an increase in code size or a reduction in performance, or increased hardware complexity. Methods and systems are needed that can overcome the aforementioned shortcomings. SUMMARY The present disclosure is directed to systems, methods and corresponding products that facilitate software pipelining a loop. For purposes of summarizing, certain aspects, advantages, and novel features of the invention have been described herein. It is to be understood that not all such advantages may be achieved in accordance with any one particular embodiment of the invention. Thus, the invention may be embodied or carried out in a manner that achieves or optimizes one advantage or group of advantages without achieving all advantages as may be taught or suggested herein. In accordance with one embodiment, a method for a method for managing multiple values assigned to a variable during various stages of a software pipelined process executed in a computing environment is provided. The method comprises allocating two or more slots in a vector register to two or more values associated with said variable during two or more stages of a pipeline process; and rotating values in each slot responsive to an instruction. Rotating the values comprises sequentially moving a value stored in a first slot to a second slot in the vector register. The first slot may be adjacent to the second slot. In some embodiments, a new value is stored in a slot of the vector register, when an old value in said slot is moved to another slot, in response to the rotating. Storing the new value in said slot and the rotating of values in each slot takes place responsive to a single instruction or a single execution cycle. In accordance with one aspect of the invention, a system comprising one or more logic units is provided. The one or more logic units are configured to perform the functions and operations associated with the above-disclosed methods. In yet another embodiment, a computer program product comprising a computer useable medium having a computer readable program is provided. The computer readable program when executed on a computer causes the computer to perform the functions and operations associated with the above-disclosed methods. One or more of the above-disclosed embodiments in addition to certain alternatives are provided in further detail below with reference to the attached figures. The invention is not, however, limited to any particular embodiment disclosed. BRIEF DESCRIPTION OF THE DRAWINGS Embodiments of the present invention are understood by referring to the figures in the attached drawings, as provided below. FIG. 1 illustrates a block diagram of a series of scalar registers allocated to hold values assigned to a variable during various stages of a pipeline. FIG. 2 is an exemplary representation of a single loop where a temporary name (TN) represents a variant for values calculated or a variable in a loop, in accordance with one embodiment. FIG. 3 is a block diagram of a vector register allocated to hold values assigned to a variable during various stages of a pipeline, in accordance with one or more embodiments. FIGS. 4 and 5 are block diagrams of hardware and software environments in which a system of the present invention may operate, in accordance with one or more embodiments. Features, elements, and aspects of the invention that are referenced by the same numerals in different figures represent the same, equivalent, or similar features, elements, or aspects, in accordance with one or more embodiments. DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS The present disclosure is directed to systems and corresponding methods that facilitate software pipelining a loop in a code processing environment. In the following, numerous specific details are set forth to provide a thorough description of various embodiments of the invention. Certain embodiments of the invention may be practiced without these specific details or with some variations in detail. In some instances, certain features are described in less detail so as not to obscure other aspects of the invention. The level of detail associated with each of the elements or features should not be construed to qualify the novelty or importance of one feature over the others. In accordance with one embodiment, during a modulo scheduling process that software pipelines a loop, instances of an operation from successive iterations are scheduled with an initiation interval (II) of T cycles. The total schedule length l is defined as the execution time of one complete iteration. Each iteration may be composed of S=[l/T] number of stages, with each stage taking T cycles. Note that [ ] rounds up if l does not divide by T (also known as ‘ceiling’). The schedule may comprise of three phases: the prolog to fill the pipeline, the kernel to be executed multiple times, and the epilog to drain the pipeline. FIG. 2( a) shows an example intermediate representation of a single loop, in accordance with one embodiment, where a temporary name (TN) represents a variant. If a TN value is used i iterations after where it is produced, it has a live-in distance equal to i. The TN value is annotated with the live-in distance. For example, TN{1} refers to the TN value defined in the previous loop iteration, with the live-in distance being 1. In an embodiment with two function units and operations, for example, a, b and c have a latency of 5, 1, and 1 cycles, respectively. An exemplary modulo schedule is shown in FIG. 2( b), in accordance with one embodiment, where T=2, 1=6, and S=3. As provided in more detail below, in one embodiment, a cell synergistic processor unit (SPU) architecture may be utilized in which vector registers are used to store scalar values in a preferred slot, in addition to their primary role of storing vector values. An exemplary cell SPU processor may be implemented using a single instruction multiple data (SIMD) architecture with 32 bit wide instructions encoding a 3-operand instruction format, for example. SIMD helps achieve data level parallelism, using a vector or array processor. In one exemplary embodiment, an instruction set architecture (ISA) is implemented that streamlines the instruction side, and provides 7-bit register operand specifiers to preferably directly address 128 registers from one or more instructions using a single pervasive SIMD computation approach for scalar or vector data. In this approach, a unified 128 entry 128 bit SIMD register file may provide scalar, condition and address operands, such as for conditional operations, branches, and memory accesses. In accordance with one embodiment, the result of a scalar operation in a software pipelined loop may be stored inside an appropriate slot of a vector register. Depending on implementation, the contents of the vector register may be rotated. In this manner, consecutive values of a variable across consecutive iterations of a loop may be stored and rotated efficiently, as provided in more detail below, without inserting many register copy instructions, or unrolling the loop, or relying on costly hardware implementations. Referring to FIG. 3, in one embodiment, instead of using several scalar registers (e.g., as shown in FIG. 1), at least one vector register VR1 is utilized to store one or more values for X. A vector register is a large register (e.g., 128-256 bits wide) in comparison to a scalar register (e.g., 32-bits) and can be used to hold several values. A vector register may have one or more bits (e.g., the left most bit, or the most significant bit) designated as a preferred slot (PS). The PS may be used to support standard scalar operations operating on single scalar data elements, where SIMD parallelism is not used. As shown in FIG. 3( a), for example, VR1 may comprise five slots, the left most slot being allocated as the PS and the rest of the slots allocated to various values for a variable X, wherein said values are generated in various pipeline stages during the iteration of a loop. In accordance with one embodiment, a certain instruction (e.g., a permute instruction) can be used to rotate the values among the slots, so that the values X1 through X4 are shifted from right to left, for example, and preferably introduce a new element to the rightmost slot. In accordance with one embodiment, scalar code using one or more scalar registers or the PS slots of vector registers may be transformed to use additional vacant slots in vector registers, so that when the permute instruction is executed, the values stored in the other slots are shifted/rotated. Thus, in contrast to the related art scalar registers shown in FIG. 1, where execution of at least four sets of instructions (i.e., MOVE, MOVE, MOVE, COPY) is necessary to accomplish the needed rotation, in the exemplary embodiment illustrated in FIG. 3( a) a single permute instruction can accomplish the same. Advantageously, use of a single associated instruction for a vector register allows the shift in values to be performed during a single execution cycle. Furthermore, the volume of code associated for performing this shift is substantially smaller since execution of a single instruction (instead of multiple instructions) accomplishes the intended result. As shown in FIGS. 3( a) through 3(c), after execution of the first permute instruction the values stored in VR1 slots are shifted (e.g., from X1, X2, X3, X4 to X2, X3, X4, X5). In one embodiment, the permute instruction accepts a parameter, such that a new value (e.g., X5) can be designated to be stored in the empty slot created when the value stored in the right most slot (e.g., X4) is shifted to the left, for example. As shown in FIGS. 3( b) and 3(c), the values stored in each slot can be shifted each time the permute instruction is executed. In the foregoing one or more exemplary embodiments are disclosed as applicable to a vector register with four slots and a permute instruction for moving the values stored in each slot to the left. It is noteworthy, however, that the above exemplary embodiments should not be construed as limiting the scope of the invention to said particular implementations. That is, in other embodiments, another type of register having a different number of slots and other associated instruction(s) may be utilized to shift the values in the same or other direction. In summary, in one or more embodiments, loops amenable to software pipelining that contain scalar variables are identified. For each such loop, the scalar variables which are defined or used inside a loop that have life ranges (LR) longer than the initiation interval (II) of the loop are identified. Where vector size (VS—the number of slots of relevant size in a vector register) is greater than or equal to [LR/II] (where [ ] stands for rounding-up) for every scalar variable, a single vector register is assigned to each scalar variable for holding all its values, provided that there are enough available vector registers. An associated instruction defining such a scalar variable will rotate the vector register and place the new value at the appropriate position, according to LR/II. In certain embodiments, the rotation and placement can be performed by preferably a single instruction (permute instruction), as provided earlier. In one embodiment, one or more instructions using such a scalar variable may access the appropriate element. In embodiments that implement a preferred slot (e.g., an embodiment utilizing a Cell Broadband Engine), the oldest element may be positioned at the preferred slot so that instructions accessing it suffer no overhead. In some embodiments, instructions may be utilized that use a single rotate instruction to align the desired data. In embodiments where [LR/II] is greater than VS, the schedule of the loop may be modified to reduce LR/II (e.g., by increasing II and rescheduling, or backtracking). In some embodiments, more than a single vector register may be assigned to a live range, analogous to the use of multiple scalar registers. Live range refers to the number of cycles starting from the time a value is defined and ending at the time it is last used. Preferably, the value in a designated register is stored for this duration. The latter may increase the demand for vector registers and may involve additional rotate instructions. In certain embodiments, each vector register may hold a LIFO queue (last-in first-out). The following is an exemplary modulo scheduled loop in accordance with one embodiment: tb0 = MEM(b, i) tc0 = MEM(c, i)   tb1 = MEM(b+4, i)   tc1 = MEM(c+4, i)     tb2 = MEM(b+8, i)     tc2 = MEM(c+8, i) ----------------------------------------------------------------- t = t + tb0*tc0 tb0 = tb1; tb1 = tb2; tb2 = tb3 tc0 = tc1; tc1 = tc2; tc2 = tc3 tb3 =MEM(b+12, i) tc3 =MEM(b+12, i) -----------------------------------------------------------------   t = t + tb1*tc1     t = t + tb2*tc2       t = t + tb3 * tc3 In the above exemplary process, inside the loop kernel, variables tb and tc are used 3 iterations after they are defined. Vector registers are allocated to these variables to hold the values of these variables across 3 consecutive iterations. The output is a vector-register allocation to variables tb and tc of the following form: R0=R0+R1 [0]*R2[0] R3[0]=MEM(b+12, i) R4[0]=MEM(b+12, i) R1=R1<<1|R3[0] R2=R2<<1|R4[0] If R1 is a vector register holding [e0|e1|e2|e3], then after R1=R1<<1|R3[0] vector register R1 will hold [e1|e2|e3|R3[0]]. R1<<1 will produce [e1|e2|e3|−], and then R3[0] will be placed as the fourth element of R1. This can be accomplished in some embodiment using a single permute instruction. In different embodiments, the invention can be implemented either entirely in the form of hardware or entirely in the form of software, or a combination of both hardware and software elements. For example, a computing system in accordance with one embodiment may comprise a controlled computing system environment that can be presented largely in terms of hardware components and software code executed to perform processes that achieve the results contemplated by the system of the present invention. Referring to FIGS. 4 and 5, a computing system environment in accordance with an exemplary embodiment is composed of a hardware environment 400 and a software environment 500. The hardware environment 400 comprises the machinery and equipment that provide an execution environment for the software; and the software provides the execution instructions for the hardware as provided below. As provided here, the software elements that are executed on the illustrated hardware elements are described in terms of specific logical/functional relationships. It should be noted, however, that the respective methods implemented in software may be also implemented in hardware by way of configured and programmed processors, ASICs (application specific integrated circuits), FPGAs (Field Programmable Gate Arrays) and DSPs (digital signal processors), for example. Software environment 500 is divided into two major classes comprising system software 502 and application software 504. System software 502 comprises control programs, such as the operating system (OS) and information management systems that instruct the hardware how to function and process information. In one embodiment, a software pipelining process may be implemented as system software 502 and application software 504 executed on one or more hardware environments. Application software 504 may comprise but is not limited to program code, data structures, firmware, resident software, microcode or any other form of information or routine that may be read, analyzed or executed by a microcontroller. In an alternative embodiment, the invention may be implemented as computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer-readable medium can be any apparatus that can contain, store, communicate, propagate or transport the program for use by or in connection with the instruction execution system, apparatus or device. The computer-readable medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk read only memory (CD-ROM), compact disk read/write (CD-R/W) and digital videodisk (DVD). Referring to FIG. 4, an embodiment of the system software 502 or application software 504 can be implemented as computer software in the form of computer readable code executed on a data processing system such as hardware environment 400 that comprises a processor 402 coupled to one or more computer readable media or memory elements by way of a system bus 404. The computer readable media or the memory elements, for example, can comprise local memory 406, storage media 408, and cache memory 410. Processor 402 loads executable code from storage media 408 to local memory 406. Cache memory 410 provides temporary storage to reduce the number of times code is loaded from storage media 408 for execution. A user interface device 412 (e.g., keyboard, pointing device, etc.) and a display screen 414 can be coupled to the computing system either directly or through an intervening I/O controller 416, for example. A communication interface unit 418, such as a network adapter, may be also coupled to the computing system to enable the data processing system to communicate with other data processing systems or remote printers or storage devices through intervening private or public networks. Wired or wireless modems and Ethernet cards are a few of the exemplary types of network adapters. In one or more embodiments, hardware environment 400 may not include all the above components, or may comprise other components for additional functionality or utility. For example, hardware environment 400 may be a laptop computer or other portable computing device embodied in an embedded system such as a set-top box, a personal data assistant (PDA), a mobile communication unit (e.g., a wireless phone), or other similar hardware platforms that have information processing and/or data storage and communication capabilities. In certain embodiments of the system, communication interface 418 communicates with other systems by sending and receiving electrical, electromagnetic or optical signals that carry digital data streams representing various types of information including program code. The communication may be established by way of a remote network (e.g., the Internet), or alternatively by way of transmission over a carrier wave. Referring to FIG. 5, system software 502 and application software 504 can comprise one or more computer programs that are executed on top of operating system 112 after being loaded from storage media 408 into local memory 406. In a client-server architecture, application software 504 may comprise client software and server software. For example, in one embodiment of the invention, client software is executed on computing systems 110 or 120 and server software is executed on a server system (not shown). Software environment 500 may also comprise browser software 508 for accessing data available over local or remote computing networks. Further, software environment 500 may comprise a user interface 506 (e.g., a Graphical User Interface (GUI)) for receiving user commands and data. Please note that the hardware and software architectures and environments described above are for purposes of example, and one or more embodiments of the invention may be implemented over any type of system architecture or processing environment. It should also be understood that the logic code, programs, modules, processes, methods and the order in which the respective steps of each method are performed are purely exemplary. Depending on implementations, the steps may be performed in any order or in parallel, unless indicated other in the present disclosure. Further, the logic code is not related, or limited to any particular programming related, or limited to any particular programming language, and may comprise of one or more modules that execute on one or more processors in a distributed, non-distributed or multiprocessing environment. Therefore, it should be understood that the invention can be practiced with modification and alteration within the spirit and scope of the appended claims, The description is not intended to be exhaustive or to limit the invention to the precise form disclosed. These and various other adaptions and combinations of the embodiments disclosed are within the scope of the invention and are further defined by the claims and their full scope of equivalents. 1. A method for managing multiple values assigned to a variable during various stages of a software pipelined process executed in a computing environment, the method comprising: allocating two or more slots in a vector register to two or more values associated with said variable during two or more stages of a pipeline process; and rotating values in each slot responsive to an instruction. 2. The method of claim 1, wherein rotating the values comprises sequentially moving a value stored in a first slot to a second slot in the vector register. 3. The method of claim 1, wherein the first slot is adjacent to the second slot. 4. The method of claim 1, further comprising storing a new value in a slot of the vector register, when an old value in said slot is moved to another slot, in response to the rotating. 5. The method of claim 4, wherein storing the new value in said slot and the rotating of values in each slot takes place responsive to a single instruction. 6. The method of claim 1, wherein a modulo-scheduling scheme is utilized to software pipeline the process executed in the computing environment. 7. The method of claim 1, wherein the rotating of the values stored in all slots of the vector register takes place during a single execution cycle. 8. A system for managing multiple values assigned to a variable during various stages of a software pipelined process executed in a computing environment, the system comprising: a logic unit for allocating two or more slots in a vector register to two or more values associated with said variable during two or more stages of a pipeline process; and a logic unit for rotating values in each slot responsive to an instruction. 9. The system of claim 8, wherein rotating the values comprises sequentially moving a value stored in a first slot to a second slot in the vector register. 10. The system of claim 8, wherein the first slot is adjacent to the second slot. 11. The system of claim 8, further comprising storing a new value in a slot of the vector register, when an old value in said slot is moved to another slot, in response to the rotating. 12. The system of claim 11, wherein storing the new value in said slot and the rotating of values in each slot takes place responsive to a single instruction. 13. The system of claim 8, wherein a modulo-scheduling scheme is utilized to software pipeline the process executed in the computing environment. 14. The system of claim 8, wherein the rotating of the values stored in all slots of the vector register takes place during a single execution cycle. 15. A computer program product comprising a computer useable medium having a computer readable program, wherein the computer readable program when executed on a computer causes the computer to: allocate two or more slots in a vector register to two or more values associated with said variable during two or more stages of a pipeline process; and rotate values in each slot responsive to an instruction. 16. The computer program product of claim 15, wherein rotating the values comprises sequentially moving a value stored in a first slot to a second slot in the vector register. 17. The computer program product of claim 151, wherein the first slot is adjacent to the second slot. 18. The computer program product of claim 15, further comprising storing a new value in a slot of the vector register, when an old value in said slot is moved to another slot, in response to the rotating. 19. The computer program product of claim 18, wherein storing the new value in said slot and the rotating of values in each slot takes place responsive to a single instruction. 20. The computer program product of claim 15, wherein a modulo-scheduling scheme is utilized to software pipeline the process executed in the computing environment.

2007-10-24

en

2009-04-30

US-201314017631-A

Breathing assistance device comprising a gas regulating valve and associated breathing assistance method ABSTRACT The invention relates to a breathing assistance device for a patient, the device including: a source of respiratory pressurised gas; a gas transmission duct comprising a distal end coupled to said source and a proximal end coupled to the patient; a gas regulating valve interposed in the gas transmission duct at a proximal location, comprising a leakage orifice and an obstruction means capable of varying the opening of the leakage orifice upon signal of controlling means and allowing a bidirectional gas flow through the leakage orifice in both expiration and inspiration phases. CROSS-REFERENCE TO RELATED APPLICATIONS The present application is a continuation of U.S. patent application Ser. No. 11/919,463, filed on Jun. 16, 2009, which application is a national phase entry under 35 U.S.C. §371 of International Application No. PCT/EP2006/061989 filed May 2, 2006, which claims priority from PCT/IB2005/001454 filed May 2, 2005, all of which are hereby incorporated herein by reference. FIELD OF THE INVENTION The present invention relates to a breathing assistance device for a patient. More precisely, the invention relates to a breathing assistance device for a patient breathing in successive respiratory cycles, each respiratory cycle being defined by at least an inspiration phase and at least an expiration phase. BACKGROUND OF THE INVENTION A variety of breathing assistance devices, which we will also generally refer to as “respirators” in this text, are available today. These respirators are equipped with a source of respiratory pressurised gas. They are qualified as “autonomous” as an external pressurised gas feeding is not required to operate them. These devices provide the patient, at each inspiration, with a respiratory gas (typically ambient air to which a complementary gas such as oxygen can be added). Different types of respirators are known. These different types of respirators can be classified e.g. according to their size. Indeed, the size of these devices is an important parameter: it is generally desirable to minimize this size, in order to facilitate the operation of a same and single device in varied places and circumstances (e.g. home, as well as hospital), and in order to increase the mobility of the patient. Non-Transportable Devices A first type of respirators relates to the ones qualified as being non-transportable. This first type is schematically illustrated in FIGS. 1 a to 1 d. Such devices are generally equipped with a respiratory gas source S1 having a very large size and/or weight. This gas source can be internal to the device, located in this case in a central unit 10, as the non-transportable respirator described hereinafter and illustrated in FIGS. 1 a to 1 d. The gas source can also be external to the device. In these devices, the source of gas is coupled to the patient P through two ducts, an inspiration duct 11 dedicated to the inspiration phase and through which the patient P inspires the pressurised gas from the source of gas, and an expiration duct 12 dedicated to the expiration phase and through which the patient can exhale expiratory gases, such as carbon dioxide. These non-transportable respirators are further provided with an inspiratory valve 13 and an expiratory valve 14. These two valves are located close to the gas source S1, respectively on the inspiration duct 11 and on the expiration duct 12. The inspiratory valve 13 allows controlling the flux of the pressurised gas transmitted to the patient during the respiratory phases. The expiratory valve 14 allows the expiratory gases of the patient to pass out of the expiratory duct 12, in the surrounding atmosphere. For this purpose, the expiratory valve can further be controlled with a PEP (Positive Expiratory Pressure). Most of the operating modes of the respirators require a monitoring of the expiratory gas flow and/or expiratory pressure. Therefore sensor(s) 19 for sensing the gas flow and/or pressure have to be provided in the respirator. Each sensor usually needs to be connected to the central unit 10 of the respirator by at least three wires, in order to be supplied with power and to convey data. Therefore the sensors 19 are generally located near the gas source S1 in order to avoid further increasing the complexity of the already quite complex and large double transmission circuit by the addition of sensors and wires. If it is desired that the sensors 19 are located in the vicinity of the expiratory valve, said expiratory valve 14 has thus to be located close to the gas source S1. Both the inspiratory and expiratory valves require specific and often complex controlling means 15, i.e. controller 15, in order to be operated properly. The non-transportable respirators are generally provided with relatively long ducts, of about 150 to 180 cm. This configuration results in a high breathing resistance which increases the work of breathing of the patient. Indeed, if the expiratory valve 14 is located at the end of the expiration duct 12 near the gas source S1 (distal end), and the expiration duct 12 being relatively long, the patient P will need to “push” his expiration through the expiration duct 12 until the expired air reaches the expiration valve to be vented to the atmosphere. Transportable Respirators A second type of respirators can be referred to as transportable respirators, as schematically illustrated in FIGS. 2 a to 2 d. This type of transportable respirator is provided with a central unit 20 comprising an internal respiratory gas source S2. The gas source S2 may be a small turbine or blower, having optimised characteristics in order to limit the volume occupied by the device. A further way to limit the volume of these devices is to use a single gas transmission duct 21 between the source S2 and the patient P, in contrast with devices having two ducts (an inspiration duct and an expiration duct). The operation principle of these respirators is based on the use of an expiratory valve 22 located on the single duct 21, near the patient P (i.e. at the proximal end of the duct). Such proximal localisation of this expiratory valve 22 allows, in particular during the expiratory phase, to avoid the breathing resistance phenomenon which would be caused by the length of the duct used for expiration if the expiratory valve was located at the distal end of the duct. In the known transportable respirators, such as represented in FIGS. 2 a to 2 d, this expiratory valve 22 is a pneumatic valve being operated thanks to a pressurised air feeding conduit 23, coupled with the respiratory gas source S2 (or to another source of pressure such as an independent microblower), and which inflates an obstructing cuff 24 of the expiratory valve 22. Such control of the expiratory valve thus requires a specific conduit 23, which limits the miniaturization of the respirator. During the expiration phase, the expiratory valve 24 is either opened or partially closed in order to establish a positive expiratory pressure (PEP) in the gas transmission duct to balance the residual overpressure in the patient lungs. In order to establish such a PEP, it is necessary to control very precisely the pneumatic inflating pressure of the cuff 24 of the expiratory valve 22. This increases the complexity of the controller 25 of the respirator. In some respiratory modes, the expiratory valve has to be operated as much as possible in real time, which is quite difficult in such expiratory valves because of the pneumatic inertias which are associated with them. Moreover the configuration of such a known respirator imposes a limitation of the value of the PEP at around 20 mBar, while some respiratory modes would need a higher value of the PEP (e.g. 40 mBar or even more). For the same reason as for non-transportable respirators, the expiratory gas flow and/or expiratory pressure may have to be controlled and gas flow and/or pressure sensors 29 have therefore to be provided near the expiratory valve 22. Here again this requires providing wires along the gas transmission duct 21 between the central unit 20 containing the gas source S2 and the patient P (namely three wires—two for power supply and one for data transmission—for each pressure sensor, and two power supply wires for each gas flow sensor). Since expiratory gas flow and pressure generally have to be measured, a connection cable 26 of at least five wires is thus required between the central unit 20 and the expiratory valve 22 at the proximal end of the device. Comment on Situation of Disabled Control of the Expiratory Valve In order for the patient to safely use a respirator, the latter being transportable or not, this device must of course allow the patient to breathe in any situation, including if the pressurised gas source is disabled (breakdown or other). There are therefore safety standards to fulfil so that the breathing assistance device can work even if the gas source is disabled. Thus, with a respirator having a single gas transmission duct 21 as described before and a specific conduit 23 for pneumatic control of the expiratory valve 22, the patient P can always expires through the pneumatic expiratory valve 22, even if the pneumatic feeding of the expiratory valve 22 is disabled, as shown in FIG. 2 d. Indeed, if the pneumatic feeding of the expiratory valve is disabled, (this being the case when the gas source is disabled, if the source provides the control of the valve), the cuff 24 of the expiratory valve 22 will not be fed anymore, preventing therefore the PEP control, but still allowing the patient P to reject the expiratory gases E.sub.P through the expiratory valve 22. In such case, it will however be impossible for the patient P to inspire through this pneumatic expiratory valve 22, since the cuff 24 shall obstruct the passage between the inside and the outside of the transmission duct 21, because of the patient inspiration IP. Consequently, transportable respirators as illustrated in FIGS. 2 a to 2 d comprise a safety back flow stop valve 27 near the gas source S2. As represented in FIG. 2 a, this safety valve will normally be closed under the effect of the pressure feeding GS coming from the gas source S2, but if the latter is disabled, the pressure of the patient inspiration IP will open the safety valve 27, allowing the patient P to inspire air from outside, as illustrated in FIG. 2 c. The disabling of the gas source S2 corresponds to a particular case of disabling of the pneumatic control of the expiratory valve 22. It is specified that in this text such disabling of the gas source S2 is understood as more generally referring to a disabling of the pneumatic control of the expiratory valve 22. In order to allow a safe inspiration through the safety valve 27 and the whole length of the duct 21, the diameter of the duct will have to be large. It is specified in this respect that there are generally pressure loss standard requirements to fulfil for addressing this issue of safety. For example, the French standards state that the maximum pressure loss between the source and the patient must not exceed 6 hPa for 1 litre.second for an adult and 6 hPa for 0.5 litre.second for a child. And in order to fulfil such requirements, the transmission duct of known devices such as illustrated in FIGS. 2 a to 2 d must have a minimum diameter of 22 mm for an adult and a minimum diameter of 15 mm for a child. Such large diameter of the duct is of course an obstacle to miniaturization of the device. For a non transportable respirator (see FIGS. 1 a to 1 d), the patient P will always be able to expire through the expiration duct 12, even if the gas source S1 is disabled, as shown in FIG. 1 d. If the gas source S1 is disabled, as illustrated in FIG. 1 c, the inspiration phase is made possible through a safety back flow stop valve 16 located on the inspiration duct 11, near the gas source S1. This safety back flow stop valve 16 is not located on the expiration duct 12 as it would be dangerous for the patient P to inspire through the expiratory duct 12 which contains a plug of carbon dioxide. For the same reasons as for the transportable respirators, the diameters of the duct must be relatively large to fulfil the pressure loss requirements, that is a least 15 mm for children and 22 mm for adults, in order to allow a safe inspiration through the safety valve 16. And here again, such large diameter is an obstacle to miniaturization. Comment on Ability to Operate According to Different Modes In addition, it is to be noted that the pathologies and diseases to be treated by the respirators are varied, and the breathing assistance devices can therefore be of different types, such as pressure-controlled or volumetric-controlled, and be operated according to different operating modes. Each operating mode is defined by particular setting and checking variables but also by a particular type of material. Some devices, which can be referred to as hybrid, are able to work according to several operating modes. However their material configuration, in particular the accessories (as the type of ducts between the gas source and the patient, the presence or not of an expiratory valve, the use of a mask with apertures, etc.), must be adapted to the chosen operating mode. And it would be desirable to operate a same and single device according to a large variety of modes, without requiring adapting the device (i.e. adapting its ducts, accessories, etc.). Generally, it is an object of the invention to address one or more of the limitations and drawbacks mentioned above in this text. BRIEF SUMMARY OF THE INVENTION A first aspect of the invention is to allow miniaturization of a respirator device. In one form of the invention the diameter of a duct between a source and a patient is reduced, while fully respecting the safety requirements. It is a further aspect to provide a simple configuration. In one form the number of wires between the central unit of the respirator and the proximal end of the duct is reduced. Another aspect is to allow real-time control of the device. In one form of the invention real-time control of a gas regulation valve of a device is provided. A further aspect of the invention is to allow multiple operating modes within a single respiratory device, without requiring adaptation of the device. In one form the invention relates to a breathing assistance device as recited in claim 1. In particular, the invention concerns a breathing assistance device for a patient breathing in successive cycles, each cycle being defined by at least an inspiration phase and at least an expiration phase, said breathing assistance device including: a source of respiratory pressurised gas, a gas transmission duct comprising a distal end coupled to said source and a proximal end coupled to said patient, a gas regulating valve comprising at least a leakage orifice between the inside and outside of said duct, and an obstruction element capable of varying the opening of said leakage orifice upon signal of a controller, characterised in that the gas regulating valve is interposed in said duct at a proximal location, and that the obstruction element is capable of allowing a bidirectional gas flow through said leakage orifice in both expiration and inspiration phases. Preferred but not limited aspects of such a breathing assistance device are the following: the obstruction element is electrically controlled, and the obstruction element may be an electromagnetic obstruction element; the obstruction element includes a return so that the leakage orifice remains at least partially opened in the absence of signal from the controller; the return is a magnetic equator; the electromagnetic obstruction element includes a metallic sheath wherein a coil is fixed, said coil being controllable by the controller and surrounding a movable magnetic element, the metallic sheath and the movable magnetic element defining the magnetic equator; the magnetic element comprises a toric magnet, a first polar piece and a second polar piece, said first and second polar pieces being coaxially fixed on either side of the toric magnet and being of different polarities, and said second polar piece comprising an obstruction piece being capable of obstructing the leakage orifice. The magnetic element is translatable along an axis of revolution of the toric magnet; the electromagnetic obstruction element may include two coaxial coils controllable by the controller, the first coil substantially surrounding the toric magnet and the first polar piece, and the second coil substantially surrounding the toric magnet and the second polar piece; the electromagnetic obstruction element is mounted coaxially relative to the gas transmission duct; the return is a compression spring; the electromagnetic obstruction element includes an armature surrounded by a coil, said coil being controllable by the controller, and said armature comprising an inner toric space wherein a magnetic element is translatable; the magnetic element is capable of obstructing the leakage orifice; the magnetic element is constraint by the compression spring; the magnetic element comprises a toric magnet and a magnet guide; the electromagnetic obstruction element is mounted transversally relative to the gas transmission duct. the return is a rubber membrane; the rubber membrane comprises a bellows designed for maintaining the obstruction element in a position where the leakage orifice is at least partially opened; the bellows is designed for enhancing the returning function if gas pressure within the valve increases; the bellows has a convex curvature oriented towards walls of the valve; the obstruction element is at least partially confined within an independent space from the duct. Another aspect of the invention concerns a breathing assistance method for assisting a patient with a breathing assistance device of the invention, as defined in claim 17. In particular, it concerns a breathing assistance method for assisting a patient with a breathing assistance device according to the invention, characterised in that the leakage orifice is at least partially opened in the absence of signal from the controller. Preferable but not limited aspects of such a breathing assistance method are the following: the leakage orifice is totally obstructed during inspiration phases whereas it is a least partially opened during expiration phases; the leakage orifice, during expiration phases, is opened so that positive expiratory pressure (PEP) remains equal to expiration pressure of the patient; the leakage orifice is totally opened in case of breakdown of the source of respiratory pressurised gas. The invention further relates to a gas regulating valve for a breathing assistance device, as recited in claim 25. In particular, it relates to a gas regulating valve for a breathing assistance device, being interposed in a gas (transmission duct of said breathing assistance device at a proximal location, and comprising at least a leakage orifice between the inside and outside of said duct, and an obstruction element capable of varying the opening of said leakage orifice upon signal of a controller, characterised in that the gas regulating valve is capable of allowing both an inward or an outward gas flow in both expiration and inspiration phases. Preferable but not limited aspects of such a gas regulating valve are the following: the obstruction element includes a return so that the leakage orifice remains at least partially opened in the absence of signal from the controller; the obstruction element is an electromagnetic obstruction element including a metallic sheath wherein a coil is fixed, said coil being controllable by the controller and surrounding a translatable magnetic element, the magnetic element comprising a toric magnet, a first polar piece and a second polar piece, said first and second polar pieces being coaxially fixed on either side of the toric magnet and being of different polarities, and said second polar piece comprising an obstruction piece being capable of obstructing the leakage orifice; the obstruction element is an electromagnetic obstruction element including an armature surrounded by a coil, said coil being controllable by the controller, and said armature comprising an inner toric space wherein a magnetic element is translatable, the magnetic element being capable of obstructing the leakage orifice and being constraint by a compression spring. The invention further relates to a gas regulating valve for a breathing assistance device, as recited in claim 29. In particular, it relates to a gas regulating valve for a breathing regulating device, comprising at least a leakage orifice to the atmosphere and an obstruction element capable of varying the opening of said leakage orifice upon signal of a controller, and passage means between the valve and a pressurized gas source, characterised in that said obstruction element can be moved between a position where it closes said passage means and a position where it closes said leakage orifice. The invention further relates to a gas regulating valve for a breathing assistance device, as recited in claims 30 and 31. In particular, it relates to a gas regulating valve for a breathing assistance device, comprising a casing provided with at least a leakage orifice, an obstruction element capable of varying the opening of said leakage orifice upon signal of a controller, and a processing portion (104) for connecting measurement means to the controller (35), characterised in that the processing portion is designed for being removably connected to the casing. The processing portion may namely comprise a clip designed for surrounding the casing so that processing portion may be removably clipped on the casing. BRIEF DESCRIPTION OF THE DRAWINGS Other features and advantages of the invention will become clear from the following description which is only given for illustrative purposes and is in no way limitating and should be read with reference to the attached drawings on which, in addition to FIGS. 1 a to 1 d and 2 a to 2 d which have already been commented above: FIG. 3 is a schematic representation of a breathing assistance device according to the invention; FIG. 4 a is a three-dimensional exploded view of a gas regulating valve according to a first embodiment of the invention; FIG. 4 b is a plan exploded view of the gas regulating valve of FIG. 4 a; FIG. 4 c is a side view of the gas regulating valve of FIG. 4 a; FIG. 4 d is a sectional view of the gas regulating valve of FIG. 4 a with a closed leakage orifice; FIG. 4 e is a sectional view of the gas regulating valve of FIG. 4 a with an opened leakage orifice; FIG. 5 a is a three-dimensional exploded view of a gas regulating valve according to a second embodiment of the invention; FIG. 5 b is a plan exploded view of the gas regulating valve of FIG. 5 a; FIG. 5 c is a side view of the gas regulating valve of FIG. 5 a; FIG. 5 d is a sectional view of the gas regulating valve of FIG. 5 a with a closed leakage orifice; FIG. 5 e is a sectional view of the gas regulating valve of FIG. 5 a with an opened leakage orifice; FIG. 6 a is a three-dimensional exploded view of a gas regulating valve according to a third embodiment of the invention; FIG. 6 b is a exploded plan view of the gas regulating valve of FIG. 6 a; FIG. 6 c is a side view of the gas regulating valve of FIG. 6 a; FIG. 6 d is a sectional view of the gas regulating valve of FIG. 6 a with a closed leakage orifice; FIG. 6 e is a sectional view of the gas regulating valve of FIG. 6 a with an opened leakage orifice; FIG. 6 f is an exploded sectional view of the gas regulating valve of FIG. 6 a; FIG. 7 a is a schematic representation of a gas regulating valve according to the first and second embodiments of the invention, in normal operation, during the inspiration phase; FIG. 7 b is a schematic representation of a gas regulating valve according to the first and second embodiments of the invention, in normal operation, during the expiration phase; FIG. 7 c is a schematic representation of a gas regulating valve according to the first and second embodiments of the invention, when the controller is disabled; FIG. 8 a is a schematic representation of a gas regulating valve according to the third embodiment of the invention, in normal operation, during the inspiration phase; FIG. 8 b is a schematic representation of a gas regulating valve according to the third embodiment of the invention, in normal operation, during the expiration phase. FIG. 9 a is a three-dimensional exploded view of a gas regulating valve according to a fourth embodiment of the invention; FIG. 9 b is another three-dimensional exploded view of the gas regulating valve of FIG. 9 a; FIG. 9 c is a exploded plan view of the gas regulating valve of FIG. 9 a; FIG. 9 d is a sectional view of the gas regulating valve of FIG. 9 a with an opened leakage orifice; FIG. 9 e is a partial sectional view of the return of the gas regulating valve of FIG. 9 a; FIG. 10 a is a three-dimensional exploded view of a gas regulating valve according to a fourth embodiment of the invention; FIG. 10 b is another three-dimensional exploded view of the gas regulating valve of FIG. 10 a; FIG. 10 c is a exploded plan view of the gas regulating valve of FIG. 10 a; FIG. 10 d is a sectional view of the gas regulating valve of FIG. 10 a with an opened leakage orifice; FIGS. 11 a-11 f are different views of all or part of a regulating valve arrangement (herein called “active valve”) which can be said be incorporated in a breathing assistance device as mentioned above and illustrated in the preceding figures, but which is not limited to such device. DETAILED DESCRIPTION Structure General Structure of the Device We shall first describe the general structure of a device (respirator) according to the invention. With reference to FIG. 3, a breathing assistance device according to the invention is shown in a schematic manner. This device comprises a central unit 30, which itself includes an internal gas source S for supplying a patient P with respiratory pressurised gas. The gas source S is typically a small blower. The breathing assistance device further comprises a gas transmission circuit between the central unit 30 and the patient P, so as to allow the patient P to inspire and expire. A gas regulating valve 32 is interposed in said gas transmission circuit at a proximal location. By proximal location, it has to be understood that the gas regulating valve 32 is located near (i.e. typically a few centimetres) the end of the gas transmission circuit coupled to the patient P. As shall be described further in this text, the regulating valve can be made according to different embodiments (and it can furthermore comprise a specific valve arrangement described in the “active valve” section). The gas source S will preferably be capable of operating according to several respiratory modes. This gas source is connected to an air inlet 33 a for collecting ambient air to be provided to the patient P. An additional inlet 33 b may also be provided for a secondary respiratory gas such as oxygen, in order to enrich the ambient air. The gas source S is powered through a power supply means, i.e. a power supply 37. This power supply 37 means may be an internal battery or an external power supply. The gas transmission circuit may be composed of one or more gas transmission ducts. As shown in FIG. 3, the breathing assistance device of the invention preferably includes a gas transmission circuit consisting of a single gas transmission duct 31. This gas transmission duct 31 comprises a distal end 31 d coupled to the source S and a proximal end 31 p coupled to the patient P. The proximal end 31 p of the transmission duct 31 is connected to the patient P through a connecting means, i.e. a patient interface 36. This patient interface 36 may be e.g. a device adapted for tracheotomy or a mask. The breathing assistance device further includes a controller 35 for controlling the gas regulating valve 32 via a connection link 39 (for data transmission and power supply). This connection link 39 can be a connection cable 39. The controller 35 is associated to measurement means, i.e. sensors 34 (in particular a gas flow sensor and a pressure sensor). More precisely, “associated to” means that the controller 35 either includes such sensors 34, or is connected to them via a connection link. Part or all of these sensor(s) can indeed be located proximally, that is located near the gas regulating valve 32. It is also possible that part or all of these sensor(s) are located on the rest of the gas transmission duct 31, such as near its distal end 31 d. The controller 35 further includes data processing means, i.e. data processors, in particular to enable processing of the signals coming from the different sensor(s). The data processors of the controller 35 are generally all located at a distal position, that is on the gas source S. However, a data processor 38 may be located at a proximal position, that is near the patient P. Indeed, the more sensors there will be near the gas regulating valve 32, the more wires there will have to be in the connection cable 39 along the gas transmission duct 31, in order to power supply these sensors but also to collect the different emitted signals. It is therefore interesting to provide a proximal data processor 38 so that the different signals from the sensor can be processed to be transmitted to distal data processor of the controller 35 through a single data transmission wire. Such a configuration of the data processor will therefore emphasize the miniaturization process, the connection cable 39 between the distal data processing device and the proximal sensor needing only three wires, i.e. one data transmission wire and two power supply wires. The gas transmission duct 31 may be of different diameters. In particular, this gas transmission duct 31 may have a smaller diameter than the ducts used in the known breathing assistance devices as those represented in FIGS. 1 a through 1 d and 2 a through 2 d. The particular gas regulating valve 32 of the invention, interposed in the gas transmission duct 31, enables namely to fulfil the pressure loss and safety standards without needing a minimal diameter duct. It is therefore possible for the gas transmission duct 31 to have a diameter smaller than 22 mm for adults and 15 mm for children. The gas regulating valve 32 has indeed a structure that emphasizes the miniaturization of the breathing assistance device. In fact, the gas regulating valve 32 is electrically controlled no air feeding conduit is required leading thus to a more compact device. Further, as explained above, the gas transmission duct may be smaller than the usual ones. Finally, miniaturization of the breathing assistance device is increased when using a data processor located on the gas regulating valve, i.e. proximally. As exposed further in this text, the breathing assistance device remains also highly safe and reliable. First Embodiment of the Invention The breathing assistance device according to a first embodiment of the invention comprises a gas regulating valve as represented in FIGS. 4 a to 4 e. The gas regulating valve 40 according to this embodiment of the invention is mounted coaxially relative to the gas transmission duct 31. The gas regulating valve 40 includes a casing made of three hollow portions, namely a distal portion 41, a central portion 42 and a proximal portion 43. The three portions are coaxially connected together so as to form an integral casing. Each portion is formed so that the casing comprises a passage through which the pressurised gas can circulate form the gas source S to the patient P and vice-versa. The distal portion 41 and proximal portion 43 are formed to be connected to the gas transmission duct 31, respectively in direction of the source S and the patient P. The proximal portion 43 is provided with an aperture 431 so as to form a leakage orifice between the inside and the outside of the gas regulating valve 40. Gas may therefore leak from the gas transmission circuit to the atmosphere and vice-versa. It is preferred that this aperture is as wide as possible, that is the aperture covers most of the circumference of the proximal portion 43. The gas regulating valve 40 further includes an obstruction means, i.e. an obstruction element 44 in order to vary the opening of the leakage orifice. The obstruction element 44 is preferably an electromagnetic obstruction element. The obstruction element 44 includes a metallic toric sheath 441, preferably made of soft iron, wherein a coil 442 is fixed. This assembly is fixed around the proximal portion 43 and is surrounded by the central portion 42 of the casing. The coil 442 may be a single toric coil but it is preferable to use two coaxial toric coils, both surrounded by the toric sheath 441. The coil 442 is powered by the controller 35 via the connection cable 39. The obstruction element 44 further includes a magnetic element comprising a toric magnet 444, a first polar piece 443 and a second polar piece 445. The polar pieces are coaxially fixed on either side of the toric magnet 444, and are of different polarities. The polar pieces have a rotational symmetry relative to the axis of revolution of the toric magnet 444 and include a passage through which gas can circulate from the source S to the patient P and vice-versa. This magnetic element is arranged within the proximal portion 43 and is at least partially surrounded by the coil 442. The magnetic element is movable within the proximal portion 43, it is namely translatable along the axis of revolution of the toric magnet 444. This translation movement is at least partially confined within the coil 442, the two extreme positions being defined by abutments provided in the inner side of the casing. The magnetic element is provided with an obstruction piece 446 capable of obstructing the leakage orifice 431 of the proximal portion 43. This obstruction piece 446 is fixed on a polar piece of the magnetic element and follows therefore the translation movement of the magnetic element. Dimension and shape of the obstruction piece 446 depend on the characteristics of the leakage orifice 431 and the magnetic element. The obstruction element 44 must namely be dimensioned so that the obstruction piece 446 totally closes the leakage orifice 431 when the magnetic element is positioned in one of its two extreme positions. The obstruction piece 446 is also preferably made of a hard material. The magnetic element is therefore composed of different pieces, whose shapes and configuration allow a passage, through which gas can circulate form the gas source S to the patient P and vice-versa. Another arrangement of this embodiment of the invention would be to have an obstruction element including a fixed magnetic element, that is at least a fixed magnet, and a movable coil, said movable coil being provided with an obstruction piece so as to be capable of obstructing the leakage orifice of the proximal portion. Such arrangement may take the form of the fourth embodiment described below. Second Embodiment of the Invention Another embodiment of a breathing assistance device according to the invention comprises a gas regulating valve as represented in FIGS. 5 a to 5 e. The gas regulating valve 50 of this second embodiment is very similar to the gas regulating valve 40 according to a first embodiment of the invention. The gas regulating valve 50 of the second embodiment has namely the same structure as the gas regulating valve 40 according to a first embodiment of the invention, in particular concerning the obstruction element. However, the gas regulating valve 50 comprises a proximal portion 53 being provided with a housing 532 for sensor(s) connected to the controller 35 via the connection cable 39. There is for example provided a gas flow pressure sensor (such as a hot wire sensor) and a pressure sensor. In this case the connection cable 39 comprises at least seven wires. There will namely be needed two power supply wires for the flow pressure sensor, two power supply wires and a data transmission wire for the pressure sensor, and two additional wires to power supply the magnetic mechanism of the gas regulating valve 50. Third Embodiment of the Invention A third embodiment of a breathing assistance device according to the invention comprises a gas regulating valve as represented in FIGS. 6 a to 6 f. The gas regulating valve 60 according to this embodiment of the invention is mounted transversally relative to the gas transmission duct 31. The gas regulating valve 60 comprises a casing 61 having a distal end 611 and a proximal end 612, the distal end 611 being coupled to the gas transmission duct 31 in direction of the source S and the proximal end 612 being coupled to the gas transmission duct 31 in direction of the patient P. The casing 61 has a shape very similar to a duct except the fact that it also includes a housing 613 for receiving an obstruction element 62. A first aperture 614 is provided between the duct 616 of the casing 61 and a first zone 6131 of the housing 613. A second aperture 615 is provided in the first zone 6131 of the housing 613, so that a gas flow may circulate between the inside of the casing 61 and the outside. The first and second apertures (614,615) thus define a leakage orifice 617. Gas may circulate through this leakage orifice 617 from the gas transmission circuit to the atmosphere and vice-versa. A cover 63 is foreseen to close the housing 613 and protect the obstruction element 62 disposed in a second zone 6132 of said housing 613. The obstruction element 62 is preferably an electromagnetic obstruction element. The obstruction element 62 comprises a metallic armature 622 which is fixed in the second zone 6132 of the housing 613. This armature 622 may be made of soft iron. The armature 622 comprises a cylindrical passage 6221 whose axis of revolution is perpendicular to the duct 616 of the casing 61. The armature 622 is preferably a revolution solid whose axis of revolution corresponds to the axis of revolution of the cylindrical passage 6221. The armature 622 comprises a bottom disc 6222 having a circular opening at its centre and a top disc 6223 having a circular opening at its centre, the diameters of the bottom disc 6222 and of the circular opening of the bottom disc 6222 being respectively larger than the diameters of the top disc 6223 and of the circular opening of the top disc 6223. Bottom and top discs (6222,6223) are coaxially coupled together through a peripheral coaxial cylindrical portion 6224 having the same diameter as the one of the bottom disc's circular opening. A central coaxial cylindrical portion 6225 is provided in the armature 622, between the bottom disc 6222 and the top disc 6223. This central coaxial cylindrical portion 6225 has the same diameter as the one of the top disc's circular opening, and has an end fixed to the top disc 6223. A central disc 6226 having the same diameter as the one of the central coaxial cylindrical portion 6225 is coaxially fixed to the other end of the central coaxial cylindrical portion 6225. This central disc 6226 is provided with a circular opening at its centre. In this configuration, the peripheral and central coaxial cylindrical portions (6224, 6225) of the armature 622 define a toric space 6227. The obstruction element 62 further comprises a coil 621 that surrounds the first cylindrical portion of the armature 622. This configuration creates therefore an air-gap in the toric space 6227, between the coil 621 and the central coaxial cylindrical portion 6225 of the metallic armature 622, which is closed at one end with the top disc 6223 of the armature 622. The obstruction element 62 also includes a magnetic element, the magnetic element comprising a toric magnet 624 and a magnet guide 623. The magnet guide 623 is a revolution solid comprising a bottom disc 6231 and a top disc 6232 of a larger diameter, the top disc 6232 having a circular opening at its centre, the diameter of this opening being the same as the diameter of the top disc. The bottom and top discs (6231,6232) are coaxially coupled through a peripheral coaxial cylindrical portion 6233 having a diameter identical to the diameter of the bottom disc 6231. A central coaxial cylindrical portion 6234 having a smaller diameter is provided on the bottom disc 6231, between the top and bottom discs (6232,6231). The toric magnet 624 has an inner diameter similar to the diameter of the first cylindrical portion 6233 of the magnet guide 623, so that the magnet guide 623 is inserted within the toric magnet 624. The outer diameter of the toric magnet 624 is similar to the inner diameter of the peripheral coaxial cylindrical portion 6224 of the armature 622. The diameter of the circular opening of the top disc 6232 of the magnet guide 623 is similar to the outer diameter of the central coaxial cylindrical portion 6225 of the armature 622. The central coaxial cylindrical portion 6234 of the magnet guide 623 has an outer diameter similar to the diameter of the circular opening of the central disc 6226 of the armature 622. Therefore the magnetic element can be coaxially inserted within the toric space 6227 defined by the peripheral and central coaxial cylindrical portions (6224,6225) of the armature 622. The magnetic element is movable, it is namely translatable along the axis of revolution of the armature 622, within the toric space 6227 defined by the peripheral and central coaxial cylindrical portions (6224,6225) of the armature 622. An annular ridge 6141 is provided within the housing 613 on the periphery of the first aperture 614. The outer diameter of the toric magnet 624 is larger than the diameter of the first aperture 614. Therefore the translation movement of the magnetic element is confined between the armature 622 and the first aperture 614. More precisely the magnetic element abuts against the armature 622 in a first extreme position (see FIG. 6 e) and against the annular ridge 6141 of the first aperture 614 in a second extreme position (see FIG. 6 d). In the second extreme position (see FIG. 6 d), the magnetic element of the obstruction element 62 totally closes the first aperture 614 and thus prevents any gas flow between the duct 616 of the gas regulating valve 60 and the housing 613. As a consequence, in this second extreme position, no gas can circulate between the inside and the outside of the gas regulating valve 60. In this configuration of the obstruction element 62, the magnetic element translates within the toric space 6227 depending on the state of the coils 621 controlled by the controller 35. The obstruction element 62 further comprises a spring 626 having an outer diameter similar to the inner diameter of the central coaxial cylindrical portion 6225 of the armature 622, and which is inserted within said central coaxial cylindrical portion 6225 of the armature 622. The spring 626 is preferably a compression spring. The spring 626 is maintained within the central coaxial cylindrical portion 6225 of the armature 622 with a screw 627 which is screwed within the central coaxial cylindrical portion 6225 of the magnet guide 623. The spring 626 has namely an end abutting against the head of the screw 627 and another end abutting against the central disc 6226 of the armature 622. The gas regulating valve 60 may comprise a protection element 625 within the housing 613 of the casing 61. This protection element 625 delimits the first and second zones within the housing 613, the first zone 6131 wherein the first and second apertures (614,615) are located and the second zone 6132 containing the obstruction element 62. The protection element 625 is gas impermeable and prevents therefore gas within the duct of the gas regulating valve 61 from polluting the obstruction element 62. The protection element 625 may be a rubber membrane. This membrane is a revolution solid comprising a central disc 6251, this central disc 6251 having a relatively large peripheral and circular groove 6252. The peripheral edge of the protection element 625 is pressed by the armature 622 against a circular abutment between the first and the second zone of the housing 613. The annular ridge 6228 of the armature 622 prevents the peripheral edge of the protection means 625 from moving. Another arrangement of this embodiment of the invention resides in an obstruction element comprising a magnetic element being fixed, that is at least a magnet being fixed, and a movable coil, said movable coil allowing the obstruction of the leakage orifice. The housing 613 may comprise a third zone 6133 for receiving sensor(s) 65 such as gas flow and/or pressure sensors for measuring gas flow and/or pressure in the duct of the gas regulating valve 60. The sensor(s) 65 may be directly connected to the controller 35 located on the source S, via the connection cable 26. In this case, the connection cable 39 is provided with a least seven wires (two power supply wires for the flow pressure sensor, two power supply wires and a data transmission wire for the pressure sensor, and two additional wires to power supply the magnetic mechanism of the gas regulating valve). Therefore, a processing means 64 is preferably provided between the sensor(s) 65 and the connection cable 39. This processing means 64 is located within the housing 613 and lies on both the sensor(s) 65 and the obstruction element 62. The processing means 64 is connected to both the sensor(s) 65 and the obstruction element 62. Thus the processing means 64 allows the sensor(s) 65 and the obstruction element 62 to be power supplied. Moreover the processing means 64 is capable of managing the data from the sensor(s) 65 in order to precisely control the obstruction element 62. The processing means 64 is capable of controlling the PEP, in processing the data from the sensor(s) 65 and operating the obstruction element 62 in consequence. The connection cable 39 between the processing means and the controller 35 is also much simpler, being provided only with three wires, i.e. two power supply wires and one data wire. The control of the gas regulating valve 60 being totally operated by the processing means 64, the controller 35 located in the central unit 30 may also be simplified, if not totally removed. This thus contributes to the miniaturization of the breathing assistance device. Fourth Embodiment of the Invention A fourth embodiment of a breathing assistance device according to the invention shall now be described. In this embodiment, the regulating valve is—like in all other embodiments—in a proximal location near the patient. In addition to the advantages already exposed about the invention, this embodiment allows in particular: offering particular high performance for avoiding leakage of gas (e.g. between internal walls of inner elements of the valve), while at the same time allowing a coaxial configuration, where the main elements of the valve are aligned around the longitudinal axis of the duct (this type of configuration tends to decrease the size of the valve and hence increase capacity), allowing excellent performance in terms of control of the valve—in particular real-time control—since in the specific configuration of such valve the moving parts have less inertia and their quick and accurate displacement is facilitated, furthermore allowing smooth operation of the valve with the use of an elastic membrane having among its functions a function of smoothly restoring a reference position of the moving parts of the valve. This fourth embodiment comprises a gas regulating valve as represented in FIGS. 9 a to 9 e. The gas regulating valve according to this embodiment of the invention is mounted coaxially relative to the gas transmission duct 31. According to this embodiment of the invention the obstruction element includes a fixed magnetic element with a fixed magnet, and a movable coil, said movable coil being provided with an obstruction piece so as to be capable of obstructing a leakage orifice provided in a proximal portion of the expiratory valve. The gas regulating valve 90 includes a casing made of two hollow portions, namely a distal portion 91, and a proximal portion 93 (as illustrated in particular on FIG. 9 c). These two portions are coaxially connected together so as to form an integral casing. Each portion is formed so that the casing comprises a passage through which the pressurised gas can circulate form the gas source S to the patient P and vice-versa. The distal portion 91 and proximal portion 93 are formed to be connected to the gas transmission duct 31, respectively in direction of the source S and the patient P. The proximal portion 93 is provided with an aperture 931 so as to form a leakage orifice between the inside and the outside of the gas regulating valve 90. Gas may therefore leak from the gas transmission circuit to the atmosphere and vice-versa. It is preferred that this aperture is as wide as possible, that is the aperture covers most of the circumference of the proximal portion 93. The gas regulating valve 90 further includes an obstruction element 92 in order to vary the opening of the leakage orifice. The obstruction element 92 is preferably an electromagnetic obstruction element. In the example illustrated in FIG. 9, the obstruction element 92 comprises a metallic armature 922 which is fixed coaxially within the distal portion 91. This armature 922 may be made of soft iron. The armature 922 is preferably a revolution solid whose axis of revolution corresponds to the axis of revolution of both proximal 93 and distal 91 portions. The armature 922 comprises two coaxial cylindrical portions, namely an inner cylindrical portion 9221 having a smaller diameter than an outer cylindrical portion 9222. These two cylindrical portions 9221 and 9222 are coupled together with an annular portion 9223 located on the proximal side of the armature. The annular portion 9223 is provided with a plurality of apertures, each aperture having preferably the form of a curved slot. The proximal end of the outer cylindrical portion 9222 may be provided with an annular ridge 9224 for maintaining the obstruction piece (925,926,927) of the obstruction element 92 (described below) pressed between the armature 922 and the proximal portion 93. The obstruction element 92 further includes a magnetic element comprising a toric magnet 924 and a toric metallic piece 923. Both the toric magnet 924 and the toric metallic piece 923 have an inner diameter similar to the outer diameter of the inner cylindrical portion 9221. The toric magnet 924 and the toric metallic piece 923 both surround the inner cylindrical portion 9221 of the armature 922, in a fixed manner. The outer diameter of the toric magnet 924 and the toric metallic piece 923 is smaller than the inner diameter of the outer cylindrical portion 9222, thus creating a toric space 9225 within the armature 922. There is therefore an air-gap within the toric space 9225, between the toric magnet 924 and the outer cylindrical portion 9222 of the metallic armature 922, which is closed at one end with the annular portion 9223 of the armature 922. The obstruction element 92 further includes a movable coil 921 adapted to be inserted within the toric space 9225, and to be coaxially translatable therein. The movable coil 921 is preferably a revolution solid whose axis of revolution corresponds to the axis of revolution of the armature 922. The movable coil 921 comprises a bottom disc 9211 having a circular opening at its centre and a top disc 9212 having a circular opening at its centre. The diameters of the circular opening of the bottom 9211 and top 9212 discs are both similar to the outer diameter of the toric magnet 924. The outer diameter of the top disc 9212 is similar to the inner diameter of the outer cylindrical portion 9222 of the armature 922, so that the top disc 9212 can translate within the toric space 9225. The outer diameter of the bottom disc 9211 is larger than the inner diameter of the outer cylindrical portion 9222 of the armature 922, so that the bottom disc 9212 may abut against the armature 922 to limit the translation movement of the coil 921. Bottom 9211 and top 9212 discs are coaxially coupled together through a coaxial cylindrical portion 9213 having the same diameter as the circular openings of the discs. Top disc 9212 is provided with a plurality of projecting portions 9214 around its circular opening. Each projecting portion 9214 is substantially flat and curved with the same curvature as the cylindrical portion 9213 so as to lengthen this latter. Further, each projecting portion 9214 is provided with a ridge 9215 at its proximal end, this ridge 9215 enabling coupling of the movable coil 921 with the obstruction piece (925,926,927). The obstruction piece comprises an elastic membrane 925 (made of rubber or silicone for example) and a pusher element 927 that is adapted for deforming the membrane 925 depending on the translation of the coil 921 within the toric space 9225. The membrane 925 is relatively resilient and is adapted to obstruct the leakage orifice 931 of the proximal portion 93 when the coil 921 is translated towards the proximal portion. The membrane 925 may be a revolution solid comprising an annular portion 9251, this annular portion 9251 having a relatively large peripheral and circular groove 9252, which is oriented proximally. The peripheral edge of the annular portion 9251 is maintained pressed between the proximal portion 93 and the outer cylindrical portion 9222 of the armature 922. The membrane 925 is further provided with a cylindrical portion 9253 having a similar diameter to the inner diameter of the annular portion 9251. This cylindrical portion 9253 is provided with an annular ridge 9254 for coupling the pusher element 927 to the membrane 925. Finally the membrane 925 comprises a bellows 9255 extending from the cylindrical portion 9253 and comprising an annular ridge 9256 (not visible in FIG. 9 e). This annular ridge 9256 enables the inner edge of the membrane 925 to be maintained on the armature 922 with a toric element 926 for example. Using such a rubber membrane 925 allows absorption of the shocks that the gas regulating valve may undergo while the obstruction piece is moving. Further, the particular form of the membrane 925, and in particular of the bellows 9255, in addition to its resilience, implies that the membrane 925 works as a return means, i.e. a return, for the coil 921. In particular, as will be explained in detail below, the membrane 925 will prevent the leakage orifice 931 to be obstructed in case operation of the coil 921 is not working correctly. Such a membrane could also be used for other embodiments, such as a transversally mounted gas regulating valve similar to the third embodiment. Indeed, this specific membrane could be used as a return instead of the spring. As described above, the pusher element 927 is adapted for deforming the membrane 925 on translation of the coil 921. Preferably, the pusher element 927 comprises an annular flat portion 9271 with a curved peripheral edge 9272. The curved peripheral edge 9272 is adapted to cooperate with the ridges 9215 of the projecting portions 9214 of the coil 921 so that the pusher element 927 is engaged with the coil 921. The annular flat portion 9271 is adapted to cooperate with the annular portion 9251 of the membrane 925. More precisely it enables deformation of the membrane 925, and particularly of the groove 9252 and of the bellows 9255, upon movement of the coil 921 within the toric space 9225. This particular embodiment of the valve, and in particular the arrangement of the obstruction element within the valve, increases its reliability. Indeed, the movable coil is confined within a dedicated space which is separated from the passage of the valve through which pressurised gas circulates from the source to the patient. Therefore, this arrangement prevents undesired leakages which might happen between the movable element and the inner wall of the passage if the movable element were located inside the passage. The gas regulating valve may further be adapted for receiving sensor(s) 95 such as gas flow and/or pressure sensors for measuring gas flow and/or pressure in the duct of the gas regulating valve 90. To this end the distal portion 91 is provided with an external chamber 912 provided with apertures through which the sensor(s) 95 may be plugged. The active portion of the sensor is thus located within the gas duct of the valve. The sensor(s) 95 may then be directly connected to the controller 35 located on the source S. However, similarly to the third embodiment, a processing means 94 is preferably provided between the sensor(s) 95 and the connection cable 39. To this end, the distal portion 91 is further designed to receive the processing means 94. In this case the distal portion 91 will need to be larger to be able to receive the processing means 94. A cover 911 is in this case foreseen to close the distal portion 91 and protect both the sensor(s) 95 and the processing means 94. Fifth Embodiment of the Invention A variant of the invention shall now be described, in particular as an evolution of the valve described above in reference to FIG. 9. This variant is presented as a separate—and thus fifth—embodiment of the invention since it implies a particular configuration of the valve assembly as a modular assembly made of distinct modules. This modular configuration can also be used with a valve different from the valve more specifically illustrated in FIG. 10, and this configuration provides by itself a number of specific advantages which shall be mentioned in the present section. For providing the gas regulating valve 90 with a processing means such as means 94 of FIG. 9 it is indeed possible to use an independent processing module 104, as illustrated more specifically in FIG. 10 c. FIGS. 10 a to 10 d represent a gas regulating valve 100 according to a fifth embodiment of the invention, this valve having an obstruction element similar to the obstruction element of the expiratory valve 90 but which is enclosed in a modular casing. Similarly to the fourth embodiment, the gas regulating valve 100 includes a casing made of two hollow portions, namely a distal portion 101, and a proximal portion 103. Again, these two portions are coaxially connected together so as to form an integral casing. Each portion is formed so that the casing comprises a passage through which the pressurised gas can circulate form the gas source S to the patient P and vice-versa. However, contrary to the fourth embodiment, the distal portion 101 is more compact. Indeed, the distal portion 101 is designed to receive only the obstruction element 102. If the sensor 105 may be plugged on the distal portion 101, there is no space provided for receiving connections to the controller 35, or any processing means. Therefore, if no measurement is needed, the gas regulating valve remains very compact and reliable. In case measurements of the gas flow and/or pressure in the duct of the gas regulating valve are needed, an independent processing module 104 may be connected to the valve. This processing module is designed to be removably connected on the casing, that is the processing module is an independent module that may be mounted directly and easily on the casing if measurements are needed. The processing module may for example be designed to be clipped on the distal portion 101 for example. The processing module 104 may comprise a support means 1041 provided with clipping means 1042 designed for surrounding the distal portion 101 and maintained the processing module engaged around the distal portion 101. The support means 1041 is further adapted for supporting a processing means 1044 thereon. An aperture 1043 through the support means 1041 is also foreseen so that the processing means 1044 may be connected to the sensor 105 plugged on the distal portion 101. Finally, a cover 1045 encloses the processing means 1044 on the support means 1041 to protect it. An aperture is also provided through the cover 1045 to connect the processing means 1044 to the controller 35. Not only this gas regulating valve has the advantage of being compact, the modular arrangement is also very advantageous in terms of maintenance. The valve being intended to be used mostly for medical applications, the valve must be adapted for sterilisation processes, with an autoclave for example. More precisely, each element that may have been polluted by the gas flow must be adapted for sterilisation. This is the case of the distal portion 101, the obstruction element 102, the proximal portion 103, and eventually the sensor 105. Indeed, the processing module 104 is completely independent from the gas flow passage which means that it does not need to be autoclaved contrary to the other elements. This is particularly advantageous as it would be particularly difficult and expensive to manufacture an autoclavable processing module 104, and more particularly an autoclavable processing means 1044. It would namely be expensive to have a processing means 1044 with autoclavable components. Further, the connections and particularly the connection between the processing means 1044 and the controller 35 may not withstand an autoclave curing. A further advantage of having an independent processing module is that it may be removed from the valve as a single unit, thus preventing any damages of the processing module 1044 or of the connections. Sixth Embodiment of the Invention In reference now to FIGS. 11 a to 11 f, a valve arrangement which can be used in accordance with the invention shall now be described. This valve arrangement can in particular be used in a regulating valve in a breathing assistance device as mentioned above and generally illustrated in FIG. 3. However such valve arrangement constitutes in itself a specific feature which can be used in different valve and/or device configurations. An example of a very compact breathing assistance device 110 is illustrated in FIG. 11 f, with: a blower 111 (in fact a compressor blower, but generally called a “blower”) for feeding a patient with compressed air (the blower being possibly provided with an inlet for a secondary gas such as oxygen), a valve housing 112, sealingly attached to the outlet 1110 of the blower by its first end 1121, a valve 113, arranged into the valve housing and having an outlet 1131 which can be directly put in contact with the patient (i.e. the patient breathes directly at outlet 1131). FIG. 11 a illustrates in an exploded view the elements of the valve 113. These elements are arranged coaxially, aligned around the axis A of the valve housing 112 (which is typically itself aligned with the outlet of the blower). On the exploded view of FIG. 11 a, these elements are, from the proximal end of the valve (side opposed to the valve housing) to its distal end (side close to the valve housing): the outlet 1131 which is on a hollow valve body 1132, the valve body 1132 has two stages of coil 11321 and 11322 aligned in sequence along the axis A a spring 1133, a cylinder 1134, made of a material such a plastic, adapted to be light (since this cylinder has to be easily moved), adapted to be engaged in the central cavity of the valve body, another cylinder 1135 in a material such as iron, and having an inner diameter corresponding to the outer diameter of the valve body 1132 with its coils, an assembly 1136 made of a permanent magnet 11360 axially surrounded by two iron cylinders 11361 and 11362, all three items forming a single assembly 1136 made of one piece. This assembly is hollow and has the general shape of a ring since all its components have a central axial hole, an O-ring 1137, a ring 1138 called a flow-path ring, since it is provided with holes 13380 disposed regularly around its central axis, for letting the flow of gas circulate through, (these holes 11380 are separated by radial arms which join a central part of the flow-path ring 11381 to its periphery 11382—these arms are not visible on the figure). The number of holes can be adapted (e.g. two, three, or more holes disposed regularly around the periphery of the central part—or even a single hole), the outer diameter of the central part of the flow-path ring corresponds to the inner diameter of the assembly, with a tolerance allowing relative movement of these two elements along the axis A, and the distal end of the assembly 1136 has a width which is adapted to close the holes 11380 of this flow-path ring, more precisely, once the elements are mounted together, the flow-path ring 1138 is sealingly mounted inside the distal end of the valve body, so as to define an inner channel 11350 having the shape of a ring in regard of the holes 11380, said channel being between the inner wall of the valve body and the outer wall of the central part of the flow path ring (see FIG. 11 b), and the width of the assembly 1136 is the same as the width of the channel 11350, with a tolerance to allow longitudinal sliding of said assembly into this channel, a sensor 11385 for sensing flow and/or pressure, e.g. a hot-wire sensor. This sensor is disposed on an axial arm attached to the proximal end of the central part 11381 of the flow-path ring, so as to be placed on the axis A when the device is mounted. FIG. 11 b shows that these elements form two main parts once they are mounted together: a fixed part comprising: the valve body with its coils, said coils being surrounded by the iron cylinder 1135, the flow path ring 1138 with its arm and sensor 11381, said flow path ring being mounted at the distal end of the valve body so that when said valve body is mounted inside the valve housing 112, any air coming from and going to the blower has to flow through the holes 11380, said flow path ring 1138 being furthermore provided with a distal deflector for smoothly deflecting the air from the blower towards the holes 11380, and a moving part comprising the following elements attached together: the assembly 1136 (adapted as mentioned above to axially slide inside the channel 11350 so as to sealingly close this channel), the cylinder 1134, the spring 1133 said spring being is designed to abut against an inner shoulder 11323 of the valve body so as to push the moving part towards the distal end of the fixed part when said spring is compressed because the moving part has been displaced towards the proximal end of said fixed part. Operation of the Device The breathing assistance device according to the invention is capable of being operated even if the gas source S and/or the controller 35 are disabled (e.g. in case of a breakdown). We shall describe the operation of the breathing assistance device in different cases, as illustrated in FIGS. 7 a to 7 c and FIGS. 8 a to 8 b. Normal Operation The normal operation of the device corresponds to the case when both the gas sources S and the controller 35 operate normally. During the inspiration phase, the obstruction element (72;82) of the gas regulating valve is an extreme position so that the leakage orifice (71;81) of the gas regulating valve is totally obstructed, as illustrated in FIGS. 7 a and 8 a. As a consequence, when the patient P inspires, the pressurised gas GS coming from the gas source S is transmitted to the patient P. The leakage orifice (71;81) of the gas regulating valve being namely closed, the pressurised gas GS can circulate in the gas transmission duct until the patient P. FIGS. 4 d and 5 d represent the gas regulating valve (40;50) according to the first and second embodiments of the invention during the inspiration phase, that is when the leakage orifice (431;531) is totally closed. In this case, the controller 35 operates the coil (442;542) of the obstruction element (44;54) so that the magnetic element translates within the proximal portion (43;53) of the gas regulating valve (40;50) and abuts against an abutment provided within the proximal portion (43;53) of the gas regulating valve (40;50). Therefore the obstruction piece (446;546) of the magnetic element totally closes the leakage orifice (431;531). The passage between the inside and the outside of a gas regulating valve (40;50) is thus closed and the pressurised gas coming from the gas source S only circulates from the distal portion (41;51) to the proximal portion (43;53) and then to the patient P. Operation of the gas regulating valve according to the fourth and fifth embodiments is similar. The difference resides in the location of the obstruction element and particularly of the movable element which moves in a separate space. FIG. 6 d illustrates the gas regulating valve 60 according to the third embodiment of the invention during the inspiration phase, that is when the leakage orifice 617 is totally closed. In this case the controller 35 operates the coil 621 of the obstruction element 62 so that the magnetic element translates until it abuts against the annular ridge 6141 of the housing 613. Therefore the leakage orifice 617 is closed and no gas can circulate between the inside and the outside of the gas regulating valve 60. The magnetic element namely obstructs the passage provided through the first aperture 614 of the housing 613. In this situation, the pressurised gas GS coming from the gas source S has no other way but to reach the patient P. During the expiration phase as illustrated in FIGS. 7 b and 8 b, the leakage orifice (71;81) is at least partially opened. The obstruction element (72;82) has namely a position so that the gas flow can circulate between the inside and the outside of the gas regulating valve through the leakage orifice (71;81). In this case, the patient P rejects expiratory gases Ep that have to be evacuated. The leakage orifice (71;81) of the gas regulating valve allows such an evacuation of the expiratory gases. Controlling the opening of the leakage orifice (71;81) with the obstruction element (72;82) of the gas regulating valve is also a way of controlling the PEP. The PEP in the gas transmission duct is namely important for the patient P to expire correctly, as the PEP is a way to balance the residual overpressure in the patient lungs. The obstruction element being electrically controlled, the control of the opening of the leakage orifice is a real time process. FIGS. 4 e and 5 e illustrate the gas expiratory valve (40;50) according to the first and second embodiments of the invention, during the expiration phase. These figures namely show gas regulating valves having a leakage orifice (431;531) totally opened. The obstruction element (44;54) has indeed been operated by the controller 35 through the coil (442;542) so as to translate until an abutment provided on the distal portion (41;51) of the gas regulating valve (40;50). Operation of the gas regulating valve according to the fourth and fifth embodiments is similar. FIG. 6 e illustrates a gas regulating valve 60 according to the third embodiment of the invention during the expiration phase. This figure namely shows a leakage orifice being totally opened. In fact, the magnetic element of the obstruction element 62 has been operated by the controller 35 through the coil 621 in order to translate until abutting against the armature 622. In this position, the first aperture 614 between the duct 616 and the housing 613 of the gas regulating valve is wildly opened. A gas flow can therefore circulate between the duct 616 of the gas regulating valve 60 and the housing 613, this gas flow being then able to circulate from the first zone of the housing 613 to the outside of the gas regulating valve 60 through the leakage orifice 617. It is to be noticed that the opening of the first aperture 614 between the duct 616 and the housing 613 of the gas regulating valve 60 can be precisely controlled in translating the magnetic element of the obstruction element 62. Operation of the valve arrangement of the sixth embodiment described in reference to FIGS. 11 a-11 f is more particularly illustrated in reference to FIGS. 11 c-11 e. FIG. 11 c illustrates the operation of the valve arrangement during expiration of the patient. Such valve arrangement can be controlled with a device (e.g. as illustrated in FIG. 11 f, or more generally in a schematic manner in FIG. 3, or even more generally in any type of breathing assistance device with control means for controlling the operation of the valve through an adapted electric powering of the coils 11321, 11322). During such expiration phase, the coils are controlled so as to bring the moving part of the valve arrangement (by attraction of the magnet 11360) in an axial position which closes the holes 11380—thus preventing air to flow through the channels 11350. In such position of this moving part, the blower cannot send any air to (or receive any air from) the patient. On the other hand, the proximal end of the valve housing 112 is provided with apertures 1121 which allow the flow expired by the patient to exit to the atmosphere in this position of the moving part. Indeed, in this position the moving part is blocking the communication between the gas source (blower) and the patient but still allows expiration through the apertures of the valve housing. In this position the air expired by the patient cannot flow towards the gas source (blower) and thus there is no risk of pollution of the blower elements (or of the duct if there is any between the valve and the gas source). It is also to be noted that this allows using a blower which is operated in a constant mode (i.e. the rotor of the blower turns at a constant speed). This can be advantageous because it can be desired in some configurations to have a blower operated in such constant mode—which keeps the operation of the blower very simple—while regulating the flow only with the valve (instead of varying the speed of the rotor of the blower). This also allows avoiding “losing” gas from the blower since no gas can flow through the valve from the blower. And if there is a secondary gas such as oxygen this reveals advantageous since it is economical. This position of the moving part also corresponds to a reference position of this moving part submitted only to the action of the spring 1133 (i.e. when the coils are not powered). In FIG. 11 d, the moving part is controlled (always by the selective electric alimentation of the coils) so as to: keep the gas source isolated from the patient (the holes 11380 are liberated but the channel 11350 remains blocked), while also blocking the evacuation of air through the apertures 1121. This is obtained by the controlled position of the moving part (along the longitudinal axis A). In this mode, the moving part can be translated by selective alimentation of the coils so as to selectively allow a controlled leakage through the apertures 1121 (i.e. by moving the moving part towards the distal end of the valve—towards the right-hand side of FIG. 11—so as to open in a controlled manner the leakage apertures 1121). During such controlled opening of the apertures 1121 the channel 11350 remain blocked and a PEP regulation is provided through the controlled leakage through the apertures 1121. FIG. 11 e illustrates a configuration where the position of the moving part is selectively controlled so as to open the channel therefore allowing gas flowing from the blower to the patient through the inner space of the valve. In this configuration the apertures 1121 are also closed. It is possible to finely control the position of the moving part of such valve arrangement, in, real time, so as to adapt at any time the air communication between the gas source and the patient through the channel 11350, with the opening of the proximal outlet 11351 of the channel 11350. Operation of the Device when the Gas Source is Disabled When the gas source S is disabled, e.g. when it breakdowns, the patient P must however be able to breathe. The gas regulating valve according to the invention allows the patient P to breathe normally in such a case. The controller of the breathing assistance device will namely operate the gas regulating valve so that the leakage orifice remains opened or at least partially opened during both inspiration and expiration phases. During the expiration phase, the patient P will namely be able to expire through the gas regulating valve as in normal operation of the breathing assistance device. Indeed, during expiration phases the pressurised gas, coming from the gas source, has only a role for controlling the PEP. However the controller allows a very precise and real time control of the opening of the leakage orifice through the control of the obstruction element. Therefore the absence of pressurised gas coming from the gas source can be counterbalanced in specifically operating the opening of the leakage orifice. The inspiration phase is also possible as the leakage orifice of the gas regulating valve is opened and allows a gas flow between the inside and the outside of the gas regulating valve. Therefore the patient P will be able to inspire air from the atmosphere through the leakage orifice of the gas regulating valve. Operation of the Device when the Controller is Disabled When the controller is disabled, e.g. when the controller breakdowns, the obstruction means cannot be controlled anymore. Therefore a return is provided within the gas regulating valve so that the leakage orifice remains opened in the absence of signal from the controller. The leakage orifice of the gas regulating valve remaining opened when the controller is disabled, the patient P can both inspire and expire through the leakage orifice of the gas regulating valve. However, the opening of the leakage orifice being not controllable, it will not be possible to control the PEP anymore. The gas regulating valve (40;50) of the first and second embodiments comprise a return that consists in the metallic toric sheath (441,541) and the toric magnet (444,544). The toric magnet (444,544) being coaxially disposed within the metallic toric sheath (441,541), this naturally defines a magnetic equator ME. Indeed, as illustrated in FIG. 7 c, the toric magnet 73, in the absence of signal from the controller, remains located in the centre of the metallic toric sheath 74 because of the magnetic forces operating between the toric magnet 73 and the metallic toric sheath 74. The plan defined by the position of the toric magnet 73 is the magnetic equator ME. The obstruction element 72 of the gas regulating valve is preferably shaped so that the leakage orifice 71 is widely opened when the controller is disabled, that is when the toric magnet 73 of the obstruction element 72 is located on the magnetic equator ME. The gas regulating valve 60 of the third embodiment of the invention also comprises a return. This return comprises the spring 626 and the screw 627. As illustrated in FIGS. 6 d and 6 e, the spring 626 is a compression spring. This compression spring 626 is compressed when the controller controls the coil 621 so that the magnetic element abuts against the circular ridge of the first aperture 614, that is when the leakage orifice is closed (as illustrated in FIG. 6 d). If the controller is disabled, the magnetic element will not be constraint by the coil 621 anymore and is therefore able to translate freely in the toric space 6227. The magnetic element being however coupled with the compression spring 626 via the magnet guide 623, the compression spring 626 draws the magnetic element against the top disc of the armature 622. In case the controller is disabled, the compression spring 626 will translate the magnetic element of the obstruction element 62, having therefore a leakage orifice widely opened (as illustrated in FIG. 6 e). Finally, as already explained, a return means is also foreseen within the gas regulating valve according to the fourth and fifth embodiments, this return being embodied by the membrane 925. Indeed, the membrane 925 is made in a material with a high resilience. The specific form of the membrane 925, and in particular the use of a bellows 9255 having a convex curvature oriented towards the walls of the valve. Indeed, if the controller 35 are disabled, the coil 921 is not constraint anymore, but the natural resilience of the material in addition to the specific form of the membrane 925 will cause the pusher element 927 and the coil 921 attached therewith to move back to a position where the leakage orifice 931 are not obstructed anymore. Once again, the patient P will thus be able to breathe freely through the valve. Further, the pressure within the duct enhances the returns function of the membrane 925 because of its particular design. Indeed, the inner pressure, and more particularly the inspiratory pressure, deforms the membrane 925 in a way that further maintains the coil 921 in its position where the leakage orifice 931 is opened. The bellows 9255 are more precisely deformed in a way that draws the cylindrical portion 9253 and the annular portion 9251, so that the pusher element 927 is further maintained in the open position. In the case of the valve arrangement of FIG. 11 the moving part comes in the reference position illustrated in FIG. 11 c when the coils are not powered. Operation of the Device when Both the Gas Source and the Controller are Disabled In this case, the patient P will be able to breathe thanks to the return provided in the gas regulating valve. Indeed it has been seen above that the gas source S does not provide a solution for the breathing assistance device to be operated when the controller is disabled. Therefore, when both the gas source and the controller are disabled, the breathing assistance device according to the invention is operated in the same way as when only the controller is disabled. The reader will have understood that many modifications may be made without going beyond the new information and the advantages described herein. Consequently, all modifications of this type shall be within the scope of breathing assistance device and methods as defined in the attached claims. 1. A gas regulating valve for use with a breathing assistance device, adapted to be interposed in a gas transmission duct of the breathing assistance device at a location proximal to a patient, and comprising: a casing having a proximal portion and a distal portion that are coaxially coupled together and comprise a passage therethrough to allow a supply of pressurized gas to circulate from a gas source to a patient in use; a leakage orifice to atmosphere formed in the proximal portion; an obstruction element including a movable element coupled to an obstructing piece capable of varying the opening of the leakage orifice; and a controller to control the movement of the obstruction element, wherein, the movable element surrounds the passage and is constructed to be sealingly separated from the supply of pressurised gas in the passage during use. 2. The valve according to claim 1, wherein the obstructing piece is an elastic membrane. 3. The valve according to claim 2 wherein the elastic membrane is made from rubber or silicone. 4. The valve according to claim 2, wherein the elastic membrane seals the movable element from the passage. 5. The valve according to claim 1 wherein the obstruction element is an electromagnetic obstruction element. 6. The valve according to claim 5, wherein the obstruction element further includes a magnetic element and the movable element is a coil and the coil surrounds the magnetic element. 7. The valve according to claim 6, wherein the obstruction element comprises a metallic armature that is fixed coaxially within the distal portion. 8. The valve according to claim 7 wherein the armature comprises an inner cylindrical portion and an outer cylindrical portion coupled together by an annular portion, the inner cylindrical portion having a diameter smaller than the outer cylindrical portion. 9. The valve according to claim 8, wherein the movable element is located within the outer cylindrical portion of the armature and translatable therein. 10. The valve according to claim 8, wherein a magnetic element is fixed to the inner cylindrical portion of the armature and is configured to control the movement of the moveable element. 11. The valve according to claim 8, wherein the inner cylindrical portion of the armature formed part of the passage for the supply of the pressurized gas. 12. The valve according to claim 8 wherein the proximal end of the outer cylindrical portion includes an annular ridge adapted to couple to the obstruction piece. 13. The valve according to claim 2, wherein the obstructing piece includes a pusher element adapted to deform the membrane to vary the opening of the leakage orifice. 14. The valve according to claim 1 further comprising at least one sensor for sensing flow and/or pressure in the gas passage, the sensor being associated with the controller. 15. The valve according to claim 14, wherein the distal portion includes an external chamber adapted to receive the at least one sensor. 16. The valve according to claim 15, further comprising a processing module configured to connect the sensor to the controller. 17. The valve according to claim 16, wherein the processing module is removably connected to the casing. 18. The valve according to claim 17, wherein the processing module includes a clip for removably coupling the processing module to the casing. 19. The valve according to claim 1 further comprising a breathing assistance device for a patient breathing is successive cycles, each cycle being defined by at least an inspiration phase and at least an expiration phase, said breathing assistance device comprising: a gas source of respiratory pressurized gas; a patient interface device; a gas transmission duct comprising a distal end coupled to said gas source and a proximal end adapted to couple to the patient interface device; a controller to control the operation of the device; wherein the gas regulating valve is interposed in the gas transmission duct near the proximal end of the gas transmission duct. 20. A gas regulating valve for use with a breathing assistance device, adapted to be interposed in a gas transmission duct of the breathing assistance device at a location proximal to a patient, and comprising: a casing including a gas flow duct and a housing; a leakage orifice to atmosphere formed in the housing; an obstruction element within the housing; a protection element within the housing between the leakage orifice and the obstruction element and the obstruction element being adapted to move in response to control by a controller, wherein the gas flow duct includes a proximal end adapted to couple to the transmission duct in the direction of a patient and a distal end adapted to couple to the transmission duct in the direction of a gas source, the gas flow duct configured to receive a flow of breathable gas between the gas source and the patient; wherein a first side of the housing is in communication with the gas flow duct; and wherein, the obstruction element includes a movable element, the movable element acting on the protection element to vary the opening of the leakage orifice in response to a signal from the controller, the protection element isolating the obstruction element from the gas flow duct. 21. The valve according to claim 20, wherein the protection element is a membrane. 22. The valve according to claim 21, wherein the membrane is made from rubber or silicone. 23. The valve according to claim 22, wherein the housing is mounted transversally relative to the gas transmission duct. 24. The valve according to claim 21, wherein the obstruction element is an electromagnetic obstruction element. 25. The valve according to claim 24, wherein obstruction element further comprises a coil that surrounds the movable element and the movable element includes a magnetic element. 26. The valve according to claim 25, wherein the obstruction element comprises a metallic armature that is fixed within the housing. 27. The valve according to claim 26 wherein the armature comprises a top disc having a top circular opening; a bottom disc having a larger bottom circular opening, the top disc and bottom disc being coaxially coupled together by a peripheral coaxial cylindrical portion having the same diameter as the bottom circular opening; an inner cylindrical passage extending into the bottom circular opening; and a toric space between the inner cylindrical passage and peripheral coaxial cylindrical portion. 28. The valve according to claim 27, wherein the movable element is located within toric space of the armature and translatable therein. 29. The valve according to claim 27, wherein the coil is fixed in a position surrounding the armature to control the movement of the magnetic element. 30. The valve according to claim 27, wherein a peripheral edge of the protection element is coupled to the armature. 31. The valve according to claim 20, wherein the obstruction element further comprises a return means to ensure the leakage orifice is opened in the absence of the signal from the controller. 32. The valve according to claim 31, wherein the return means is a compression spring. 33. The valve according to claim 20 further comprising at least one sensor for sensing flow and/or pressure in the gas passage, the sensor being located in the housing and associated with the controller. 34. The valve according to claim 33, further comprising a processing module configured to connect the sensor to the controller. 35. The valve according to claim 20, further comprising a housing cover coupled to a second side of the housing. 36. The valve according to claim 20 further comprising a breathing assistance device for a patient breathing is successive cycles, each cycle being defined by at least an inspiration phase and at least an expiration phase, said breathing assistance device comprising: a gas source of respiratory pressurized gas; a patient interface device; a gas transmission duct comprising a distal end coupled to said gas source and a proximal end adapted to couple to the patient interface device; a controller to control the operation of the device; and wherein the gas regulating valve is interposed in the gas transmission duct near the proximal end of the gas transmission duct.

2013-09-04

en

2014-02-13

US-201414654531-A

Adaptive communication method among components based on Linux ABSTRACT An adaptive communication method among components based on Linux, related to a technical field of network communication in a distributed environment, includes steps of: creating a unidirection persistent connection between each two communication hosts with a service program; generating a component address list after a distributed component is launched; during communication, packaging a message into a JSON format, searching the address list to find an address, and sending the message to a target component via a Linux local socket or the created unidirection persistent connection according to a location relationship; and, when the component stops, deleting information about the component from the component address list. CROSS REFERENCE OF RELATED APPLICATION This is a U.S. National Stage under 35 U.S.C. 371 of the International Application PCT/CN2014/094327, filed Dec. 19, 2014, which claims priority under 35 U.S.C. 119(a-d) to CN 201310714380.0, filed Dec. 20, 2013. BACKGROUND OF THE PRESENT INVENTION 1. Field of Invention The present invention relates to a technical field of network communication in a distributed environment, and more particularly to an adaptive communication method among components based on Linux. 2. Description of Related Arts In the distributed environment, particularly in the cloud computing environment, due to the large number of the network components which need to communicate with each other and the great amount of communication data, it seems quite important to reduce the network cost and enhance the real time communication. Because of the convenience in usage of the Web Service protocol and the firewall transversal of the http protocol, the distributed communication usually employs the mode of Web Service on http for the communication among the components. However, in the situation of the frequent communication and the great amount of communication data, the mode usually causes the following problems. Firstly, the mode results in the big redundancy of messages. The Web Service employs the message format of XML. During the communication, the payload of the messages is relatively small. In other words, the Web Service requires a relatively large amount of messages for bearing information to transmit the same amount of information, which impairs the real time performance of the communication under the constant bandwidth. Secondly, the mode has the high system cost. The http “request-response” mode creates and closes the connection every time, which brings the high costs to the operating system. When the components frequently communicate with each other, the performance of the operating system is severely impaired, so as to further weaken the performance of the whole distributed application and reduce the real time performance of the communication. Thirdly, the using manner of the mode lacks flexibility. The http protocol rules that only the client is able to initiate the connection to the server to communicate, not the other way around. Therefore, the two parties involved in the communication are required to both have the programs of the server and the client so that the two parties are both able to initiate the communication. SUMMARY OF THE PRESENT INVENTION An object of the present invention is to provide an adaptive communication method among components based on Linux, for overcoming a low efficiency, a high cost and a poor real time performance in communication within a distributed environment, where components communicate frequently and where a great amount of communication data exist. Accordingly, in order to accomplish the above objects, the present invention provides an adaptive communication method among components based on Linux, comprising steps of: (1) developing a service program on each host, wherein distributed components on the host communicate by calling the service program; (2) creating, by at least two hosts which need to communicate, a unidirection persistent connection between each two of the hosts with the service program; (3) after a first distributed component on a first host is launched, sending a launching message into the service program of the first host; sending the launching message to the service program of a second host through each the unidirection persistent connection, by the service program of the first host, and receiving the launching message which is sent from the service program of the second host, by the service program of the first host, so as to form a component address list; (4) when the first distributed component needs to send a message to a target component, packaging the message into a JSON format by the service program of the first host and providing the service program of the first host with a name of the target component; (5) according the name of the target component, searching the component address list by the service program of the first host to find an address of the target component; if the target component is on the first host, directly sending the message to the target component through a Linux local socket; if the target component is on the second host, sending the message to the second host through the unidirection persistent connection which is created between the first host and the second host, and then sending the message to the target component by the service program of the second host; and (6) when the first distributed component on the first host stops, sending a stopping message to the service program of the first host; sending the stopping message to the service program of the second host through each the unidirection persistent connection, and deleting information about the first distributed component from the component address list, by the service program of the first host; deleting the information about the first distributed component from the component address list by the service program of the second host. Each distributed component is a process which runs independently. The distributed component obtains input and sends output by exchanging the message with the other distributed component. The service program is a Linux auto-start service process. The distributed components and the service program on the same host communicate in a manner of Linux pipe. The component address list comprises the name of each the component and an address of the host where the component is located. The “adaptive” refers to an adaptive ability of the service program which is able to automatically select the local socket or the unidirection persistent connection, according to the address of the target component, for sending the message. The JSON format of the message is: #ctrl: {,=============================> header  src:gtclient_desktop,-------- >>source  dst:gtclient_laptop,--------- >>destination  dataDesc:test,--------------- >>data description } #data: {,=============================> payload  key:whatthehell,------------- >>data }. The method, provided by the present invention, is for the adaptive communication among the components based on Linux. The method of the present invention has a low communication frequency and a small amount of communication data, so as to effectively improve the communication efficiency, reduce the cost and improve the real time performance. BRIEF DESCRIPTION OF THE DRAWINGS The present invention is further illustrated by the accompanying drawings. FIG. 1 is a flow chart of an adaptive communication method among components based on Linux according to a first preferred embodiment of the present invention. FIG. 2 is a sketch view of a structure of the adaptive communication method among components based on Linux according to a second preferred embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT Referring to FIG. 1 of the drawings, according to a first preferred embodiment of the present invention, an adaptive communication method among components based on Linux comprises steps of: (1) developing a service program on each host, wherein distributed components on the host communicate by calling the service program; (2) creating, by at least two hosts which need to communicate, a unidirection persistent connection between each two of the hosts with the service program; (3) after a first distributed component on a first host is launched, sending a launching message into the service program of the first host; sending the launching message to the service program of a second host through each the unidirection persistent connection, by the service program of the first host, and receiving the launching message which is sent from the service program of the second host, by the service program of the first host, so as to form a component address list; (4) when the first distributed component needs to send a message to a target component, packaging the message into a JSON format by the service program of the first host and providing the service program of the first host with a name of the target component; (5) according the name of the target component, searching the component address list by the service program of the first host to find an address of the target component; if the target component is on the first host, directly sending the message to the target component through a Linux local socket; if the target component is on the second host, sending the message to the second host through the unidirection persistent connection which is created between the first host and the second host, and then sending the message to the target component by the service program of the second host; and (6) when the first distributed component on the first host stops, sending a stopping message to the service program of the first host; sending the stopping message to the service program of the second host through each the unidirection persistent connection, and deleting information about the first distributed component from the component address list, by the service program of the first host; deleting the information about the first distributed component from the component address list by the service program of the second host; wherein each distributed component is a process which runs independently; the distributed component obtains input and sends output by exchanging the message with the other distributed component; the service program is a Linux auto-start service process; the distributed components and the service program on the same host communicate in a manner of Linux pipe; and wherein the component address list comprises the name of each the component and an address of the host where the component is located; the “adaptive” refers to an adaptive ability of the service program which is able to automatically select the local socket or the unidirection persistent connection, according to the address of the target component, for sending the message. The JSON format of the message is: #ctrl: {,=============================> header  src:gtclient_desktop,-------- >>source  dst:gtclient_laptop,--------- >>destination  dataDesc:test,--------------- >>data description } #data: {,=============================> payload  key:whatthehell,------------- >>data }. Referring to FIG. 2, an implementation of the adaptive communication method among components based on Linux requires an implementation of receiving and sending messages between the service program and the distributed component. In the second preferred embodiment, the adaptive communication method among components based on Linux is implemented by C++ Programming Language. Firstly, a service program is developed for running on two hosts which need to communicate. The hosts are responsible for receiving and sending messages, wherein four threads are respectively for receiving and sending local and remote messages. class gtController { public:  //control starting/ending of the threads  bool thread_control(THREAD_T thread, bool enable=false);  //thread for receiving the message from a local component  void local_recv_thread(void);  //transferring the message to the local component  void local_listen_thread(void);  //thread for receiving the message from the other host  void remote_accept_thread(void);  //thread for sending the message to the other host  void remote_listen_thread(void);  bool start(void); Secondly, a unidirection persistent connection is created between the two hosts which need to communicate with the service program. foreach(listenMap,itrt) {   //creating a socket connection   SOCKET inetListen = connector.inet_listen_create(itrt->first,   itrt->second);   if (inetListen > 0) {    g_pdata->addListenSocket(itrt->first, itrt->second, inetListen);   }   else{    logDebug(“Inet listen socket create failed, gTunnel exit”);    return −1;   } } Thirdly, after the component is launches, a launching message is sent to the service program.      int Register( )      {      int ret;      char buf[1024];      int i;      //static struct sockaddr_un srv_addr;      memset(buf,0,1024);       char     *packetRegist            = packetRegistConstruct(g_szClientName,g_szClientName,0);       CtrlSend(packetRegist,strlen(packetRegist),0,0);       free(packetRegist);       return 0;      } Fourthly, the service program receives the message and then updates a component address list.      bool gtProcessor::ctrl_packet_process(string& ctrlpack,      SOCKET fd)      {       list<string> key;       key.push_back(SRC);       key.push_back(PACKTYPE);       key.push_back(DATADESC);       key.push_back(UUID);       map<string, string> packtype;       handler->packet_get_values(ctrlpack, CTRL_ITEM, key,       packtype);       if (packtype[PACKTYPE] != PACKTYPE_CTRL) { // wrong        return false;       }       //process after receiving the launching message, adding one line to the component address list       if (packtype[DATADESC] == DATADESC_CLIENTREG)        return clientreg_process(packtype[SRC], packtype[UUID],        fd);       //process upon a stopping message, deleting the corresponding line from the component address list       else if (packtype[DATADESC] ==       DATADESC_CLIENTUREG)        return clientunreg_process(packtype[SRC]);       else if (packtype[DATADESC] ==       DATADESC_CLIENTLIST)        return true;       return false;      } Fifthly, the service program obtains an address to which the message is to be sent, and decides to send the message via a network or locally.    //dstfd is the address to which the message is to be sent    foreach(dstfd, fd) {     sendable.clear( );     sendlist.clear( );     sendlist.push_back(*fd);     connector->write_check(sendlist, sendable, 100); // 100ms is mercy enough     if (! sendable.empty( )) {      lite = find(lfds.begin( ), lfds.end( ), *fd);      if (lite == lfds.end( ))       sendpacket = full_packet;      else {       sendpacket = packet;      }     //sending the message     int32_t sendnum = send(*fd, sendpacket.c_str( ),          sendpacket.length( ), MSG_DONTWAIT);     if (sendnum < 0) {       logError(PROCESSOR“send packet to fd(%d) failed: %s”,         *fd, strerror(errno));       retval = false;       continue;     }     else if ((uint32_t)sendnum != sendpacket.length( )) {       logError(PROCESSOR“send packet but send size %d not ”         “equal packet size %d”,         sendnum, sendpacket.length( ));       retval = false;       continue;     }     else {       logDebug(PROCESSOR“send packet done”);     }    }    else {     logWarn(“what a amazing the fd [%d] is not writable !!     ignore ...”, *fd);    }    } One skilled in the art will understand that the embodiment of the present invention as shown in the drawings and described above is exemplary only and not intended to be limiting. It will thus be seen that the objects of the present invention have been fully and effectively accomplished. Its embodiments have been shown and described for the purposes of illustrating the functional and structural principles of the present invention and is subject to change without departure from such principles. Therefore, this invention includes all modifications encompassed within the spirit and scope of the following claims. 1-7. (canceled) 8. An adaptive communication method among components based on Linux, comprising steps of: (1) developing a service program on each host, wherein distributed components on the host communicate by calling the service program; (2) creating, by at least two hosts which need to communicate, a unidirection persistent connection between each two of the hosts with the service program; (3) after a first distributed component on a first host is launched, sending a launching message into the service program of the first host; sending the launching message to the service program of a second host through each the unidirection persistent connection, by the service program of the first host, and receiving the launching message which is sent from the service program of the second host, by the service program of the first host, so as to form a component address list; (4) when the first distributed component needs to send a message to a target component, packaging the message into a JSON format by the service program of the first host and providing the service program of the first host with a name of the target component; (5) according the name of the target component, searching the component address list by the service program of the first host to find an address of the target component; if the target component is on the first host, directly sending the message to the target component through a Linux local socket; if the target component is on the second host, sending the message to the second host through the unidirection persistent connection which is created between the first host and the second host, and then sending the message to the target component by the service program of the second host; and (6) when the first distributed component on the first host stops, sending a stopping message to the service program of the first host; sending the stopping message to the service program of the second host through each the unidirection persistent connection, and deleting information about the first distributed component from the component address list, by the service program of the first host; deleting the information about the first distributed component from the component address list by the service program of the second host. 9. The adaptive communication method among components based on Linux, as recited in claim 8, wherein each of the distributed components is a process which runs independently; the distributed components respectively obtain input and send output by exchanging the messages with each other; the service program is a Linux auto-start service process; and the distributed components and the service program on the same host communicate in a manner of Linux pipe. 10. The adaptive communication method among components based on Linux, as recited in claim 8, wherein the component address list comprises the name of each the component and an address of the host where the component is located. 11. The adaptive communication method among components based on Linux, as recited in claim 9, wherein the component address list comprises the name of each the component and an address of the host where the component is located. 12. The adaptive communication method among components based on Linux, as recited in claim 8, wherein the service program automatically selects a local socket or the unidirection persistent connection, according to the address of the target component, for sending the message. 13. The adaptive communication method among components based on Linux, as recited in claim 9, wherein the service program automatically selects a local socket or the unidirection persistent connection, according to the address of the target component, for sending the message. 14. The adaptive communication method among components based on Linux, as recited in claim 10, wherein the service program automatically selects a local socket or the unidirection persistent connection, according to the address of the target component, for sending the message. 15. The adaptive communication method among components based on Linux, as recited in claim 11, wherein the service program automatically selects a local socket or the unidirection persistent connection, according to the address of the target component, for sending the message. 16. The adaptive communication method among components based on Linux, as recited in claim 8, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,-------- >>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data }. 17. The adaptive communication method among components based on Linux, as recited in claim 9, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,-------- >>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data }. 18. The adaptive communication method among components based on Linux, as recited in claim 10, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,-------- >>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data }. 19. The adaptive communication method among components based on Linux, as recited in claim 11, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,-------- >>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data }. 20. The adaptive communication method among components based on Linux, as recited in claim 12, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,------>>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data } #  <<PacketTail  #. 21. The adaptive communication method among components based on Linux, as recited in claim 13, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,------>>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data } #  <<PacketTail  #. 22. The adaptive communication method among components based on Linux, as recited in claim 14, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,------>>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data } #  <<PacketTail  #. 23. The adaptive communication method among components based on Linux, as recited in claim 15, wherein the JSON format of the message is: #ctrl: {,=============================> header   src:gtclient_desktop,------>>source   dst:gtclient_laptop,--------- >>destination   dataDesc:test,--------------- >>data description } #data: {,=============================> payload   key:whatthehell,------------- >>data } #  <<Packet Tail  #.

2014-12-19

en

2016-09-08

US-201816179585-A

Fuel cell heater system ABSTRACT A heater is described. The heater includes a fuel cell to produce heated air, electricity and water vapor. The heater further includes a heating element operatively coupled to the fuel cell to convert the electricity to heat and a control system operatively coupled to the fuel cell and the heating element, the control system being configured to monitor and control the fuel cell and heating element. CROSS REFERENCE TO RELATED APPLICATIONS This application claims the benefit of U.S. Provisional Patent Application No. 62/582,139, filed on Nov. 6, 2017, which is hereby incorporated by reference in its entirety. TECHNICAL FIELD Aspects and implementations of the present disclosure relate to fuel cell heater systems. BACKGROUND Fuel cells are electrochemical cells that convert energy from a fuel into electricity. The fuel cell converts energy from the fuel through an electrochemical reaction of the fuel with oxygen or another oxidizing agent. The fuel cell can include an anode, an electrolyte and a cathode. At the anode a catalyst oxidizes the fuel, turning the fuel into positively charged ions and negatively charged electrons. The positively charged ions pass through the electrolyte, while the negatively charged electrons cannot pass through the electrolyte. The negatively charged electrons travel through a wire to create electric current. The negatively charged electrons are then reunited with the positively charged ions at the cathode. BRIEF DESCRIPTION OF THE DRAWINGS Embodiments and implementations of the present disclosure will be understood more fully from the detailed description given below and from the accompanying drawings of various aspects and implementations of the disclosure, which, however, should not be taken to limit the disclosure to the specific embodiments or implementations, but are for explanation and understanding only. FIG. 1 illustrates a configuration of a fuel cell heater in accordance with embodiments of the present disclosure. FIG. 2 illustrates a configuration of a fuel cell heater system in accordance with one embodiment of the present disclosure. FIG. 3 depicts a flow diagram of a method for utilizing a fuel cell heater in accordance with one implementation of the present disclosure. FIG. 4 depicts a flow diagram of a method for controlling a fuel cell heater system in accordance with implementations of the present disclosure. FIG. 5 is a block diagram illustrating an example computer system, in accordance with one embodiment of the present disclosure. DETAILED DESCRIPTION Aspects and implementations of the present disclosure are directed to a fuel cell heater. Fuel cells are electrochemical cells that convert energy from a fuel into electricity. The electricity generated by a fuel cell may be used in a heater system. In some embodiments, the fuel cell heater system may be a flameless heater system that includes a heating element that converts the electricity generated by the fuel cell into heat. Flameless heaters are used to provide heat in harsh and potentially hazardous environments, such as oil fields or grain drying. Flameless heaters operate in environments that include volatile gasses that may be ignited by an ignition source, such as a spark or an open flame. The use of flameless heaters in such environments reduce the risk of explosions or uncontrolled fires by providing heat without the use of an ignition source. One example of a conventional flameless heater system utilizes a turbine engine. The turbine engine is used to generate high volumes of heated air without an ignition source. However, turbine engines generate unsafe levels of noise. Furthermore, if the intake air for the turbine engine is contaminated with dust or debris, the turbine engine may shut down. Additionally, the complexity and cost of maintenance of a turbine engine is high compared to other heat sources. Another example of a conventional flameless heater system utilizes an internal combustion engine to drive a fluid based heat generator. The heat generator shears a fluid, causing the fluid to heat. The heated fluid is then circulated through hoses using an engine-driven pump to a storage tank. The heated fluid is then transferred from the storage tank to a fluid-to-air heat exchanger, where the heat is extracted from the heated fluid. However, the lifespan of many of the components, such as the heat generator, pumps, hoses, seals, etc., of the heater system are relatively short. Furthermore, the cost of the fluids used in the shearing process is relatively high and harmful to the environment in the event of a leak or spill. Additionally, such a conventional system has difficulties operating in warm ambient conditions as the shearing fluid may overheat and cause system faults or shutdowns. A third example of a conventional flameless heater system utilizes an internal combustion engine to drive a fan while moving magnets to create heat. Typically, the conventional flameless heater system utilizes a diesel engine to drive the fan. However, diesel engines have wear items, such as belts, alternators and batteries, which often need to be replaced. Furthermore, the conventional flameless heater system is unable to operate for extended periods of time since the engine requires shutdown for oil changes and lubrication. Additionally, to operate within emission standards, a diesel engine may require expensive air, oil and particulate filters, increasing the cost of operation. Embodiments of the present disclosure address the issues of noise, reliability, complexity and environmental issues of the conventional designs by eliminating the engine. By replacing either the turbine engine or the internal combustion engine with a fuel cell, the issues experienced by conventional flameless heater systems are eliminated. The resulting flameless heater system may operate more safely, quietly and reliably in any environmental condition when compared to conventional flameless heater systems. A further advantage of the fuel cell heater is the variety of the fuel that may be used in the flameless heater. For example, while prior designs were highly limited to the type and quality of fuel consumed (turbine engines require jet fuel, diesel engines require purified diesel fuel), a flameless heater using certain types of fuel cells may utilize many available fuel sources, such as diesel, gasoline, jet fuel, natural gas, methanol and propane. Another advantage of the fuel cell heater is the byproduct of the reaction within a fuel cell is water, reducing the environmental impact of operating the fuel cell heater. FIG. 1 illustrates a configuration of a fuel cell heater 100 in accordance with embodiments of the present disclosure. The fuel cell heater 100 may include a fuel source 105, a fuel cell 120, a heating element 150 and a control system 160. The control system 160 may be operatively coupled to the fuel source 105, the fuel cell 120 and the heating element 150. The control system 160 may also be operatively coupled to one or more sensors (not shown) that gather data on various parameters of fuel cell heater 100. The control system 160 includes a processing device configured to monitor the various parameters of fuel cell heater 100 and control various operations of fuel cell heater 100. For example, the control system 160 may monitor the heat output of heating element 150, the fuel level of fuel source 105, the power output of fuel cell 120, etc. The fuel cell 120 converts energy from a fuel into electricity. The fuel cell converts energy from the fuel through an electrochemical reaction of the fuel with oxygen or another oxidizing agent. The fuel cell can include an anode, an electrolyte and a cathode. At the anode a catalyst oxidizes the fuel, turning the fuel into positively charged ions and negatively charged electrons. The positively charged ions pass through the electrolyte, while the negatively charged electrons cannot pass through the electrolyte. The negatively charged electrons travel through a wire to create electric current. The negatively charged electrons are then reunited with the positively charged ions at the cathode, where the negatively charged electrons react with the positively charges ions to produce water vapor and heat. Various types of fuel cells may be used in various embodiments of the present disclosure depending on a type of fuel of the fuel source. Examples of types of fuel cells that may be used include, but are not limited to, proton exchange membrane fuel cells (PEMFCs), phosphoric acid fuel cells (PAFCs), solid acid fuel cells (SAFCs), alkaline fuel cells (AFC), solid oxide fuel cells (SOFCs), molten carbonate fuel cells (MCFCs) and electric storage fuel cells. The fuel source 105 is a storage system for the fuel 110 that is to be provided to fuel cell 120. Examples of fuel sources may include, but are not limited to, storage tanks, containers, bladders, reservoirs and the like. As previously described, various types of fuel 110 may be used in fuel cell heater 100 depending on the type of fuel cell 120 used in fuel cell heater 100. Examples of fuel 110 that may be used by fuel cell heater 100 include, but are not limited to, hydrogen, carbon monoxide, methanol, methane, gasoline, diesel, jet fuel and other hydrocarbon fuels. The fuel source 105 is operatively coupled to fuel cell 120 to provide fuel 110 from fuel source 105 to fuel cell 120. For example, one or more hoses or tubes may be coupled between the fuel source 105 and the fuel cell 120 to provide the fuel 110 to fuel cell 120. In embodiments, one or more pumps may be utilized to move the fuel 110 from the fuel source 105 to the fuel cell 120. Upon receipt of the fuel 110, the fuel cell 120 converts the fuel 110 into electricity 125, as previously described. The electricity 125 generated by the fuel cell 120 may be provided to a heating element 150 that is operatively coupled to the fuel cell 120. For example, the heating element 150 may be coupled to the fuel cell 120 via one or more wires to provide electricity 125 to the heating element 150. The heating element 150 may be configured to convert the electricity 125 received from fuel cell 120 into thermal energy (e.g., heat). In embodiments, the heating element 150 may be a radiant heater that emits infrared radiation. In an embodiment, the heating element 150 may be a convection heater that utilizes a heating element to heat the air in contact with the heating element by thermal conduction. In some embodiments, the heating element 150 may be a heat pump that utilizes an electrically driven compressor to operate a refrigeration cycle that extracts heat energy from outdoor air, the ground or ground water, and moves the heat into the space to be warmed. In embodiments, the heating element 150 may be an electrical resistance heating element. In an embodiment, the heating element 150 may be any device that converts electricity 125 generated by fuel cell 120 into thermal energy. FIG. 2 illustrates a configuration of a fuel cell heater system 200 in accordance with one embodiment of the present disclosure. The fuel cell heater system 200 includes fuel source 105, fuel cell 120, heating element 150 and control system 160, as previously described at FIG. 1. For illustrative purposes, fuel cell heater system 200 will be described with fuel source 105 storing methanol as the fuel type. However, embodiments of the disclosure may use any fuel types. A reformer 210 may be operatively coupled to fuel source 105. The reformer 210 may be configured to extract hydrogen from the methanol fuel provided by fuel source 105. An example reformer 210 may be a steam reformer that is configured to cause a reaction between steam at a high temperature and pressure with a hydrocarbon fuel source, such as methanol, in the presence of a nickel catalyst. In embodiments, other types of reformers 210 may be used to extract hydrogen from a hydrocarbon fuel source. Upon extraction of the hydrogen from the methanol fuel by the reformer 210, the extracted hydrogen may be provided to a low pressure storage 215 that is operatively coupled to the reformer 210. Low pressure storage 215 may be a storage system, such as a storage tank or container, which is configured to store the extracted hydrogen at low pressures of approximately one atmosphere. The low pressure storage 215 may provide additional advantages to the fuel cell heater system 200 since storing the extracted hydrogen at a low pressure greatly reduces the risk of explosion and, in the event that the low pressure storage 215 is ruptured, the hydrogen will be released at a much slower rate than a pressurized hydrogen storage system. In some embodiments, rather than storing the extracted hydrogen at the low pressure storage 215, the extracted hydrogen may be provided directly from reformer 210 to fuel cell 120. The low pressure storage system 215 may be operatively coupled to the fuel cell 120 to provide the extracted hydrogen stored at the low pressure storage system 215 to the fuel cell 120. The fuel cell 120 may generate electricity 125 using the extracted hydrogen, as previously described. Other byproducts of the reaction within the fuel cell 120 may include water vapor 225 and thermal energy (e.g., heated air 230). Embodiments of the disclosure may capture and utilize these byproducts, providing further advantages over a conventional heater system. In embodiments, a water storage system 240 may be operatively coupled to fuel cell 120. Water vapor 225 that is the result of the reaction that takes place in the fuel cell 120 to generate electricity 125 may be provided from the fuel cell 120 to the water storage system 240. The water storage system 240 may be a liquid storage system, such as a storage tank, bladder, container, reservoir or the like, for storing the water vapor 225. The water vapor 225 may be stored by the water storage system 240 and subsequently utilized for various purposes. In some embodiments, the heated air 230 generated by the reaction that takes place in the fuel cell 120 to generate electricity 125 may also be used as a heat source to supplement the heat generated by heating element 150. The heated air 230 may be provided to a heat transfer system 245 operatively coupled to the fuel cell 120. The heat transfer system 245 may be configured to move the heated air 230 from the fuel cell 120 to a desired location. In an embodiment, the heat transfer system 245 may include one or more fans that are configured to move the heated air 230. In embodiments, the heat transfer system 245 may include one or more pumps that are configured to move the heated air 230. In some embodiments, the heat transfer system 245 may include a radiator that is configured to transfer the thermal energy of the heated air produced by the fuel cell to a desired location. In embodiments, electricity 125 generated by the fuel cell 120 may be provided to the heat transfer system 245 to power various components of the heat transfer system 245. For example, the electricity 125 may be used to power the fans, pumps, etc. of the heat transfer system 245. In some embodiments, the heated air 230 moved by the heat transfer system may be combined with the heat generated by heating element 150. The electricity 125 generated by fuel cell 120 may be provided to a heating element 150 that is operatively coupled to the fuel cell 120, as previously described. In embodiments, an alternating current to direct current (AC/DC) converter 255 may be operatively coupled to the fuel cell 120. When a fuel cell 120 generates electricity 125, the electricity 125 is direct current. The AC/DC converter 255 may receive the electricity 125 and convert the electricity from direct current to alternating current. Once converted to alternating current, the electricity 125 may be used to power various ancillary devices. Fuel cell heater system 200 may include one or more temperature sensors 265. In embodiments, the temperature sensor 265 may be configured to measure a temperature of a volume of space being heated by the fuel cell heater system 200. The temperature sensor 265 may be operatively coupled to the control system 160 to provide the measured temperatures to the control system 160. The control system 160 may utilize the measured temperatures to adjust parameters and/or operations of the fuel cell heater system 200, as will be described in further detail below. FIG. 3 depicts a flow diagram of a method 300 for utilizing a fuel cell heater in accordance with one implementation of the present disclosure. In embodiments, various portions of method 300 may be performed by fuel cell heater 100 and/or fuel cell heater system 200 of FIGS. 1 and 2, respectively. With reference to FIG. 3, method 300 illustrates example functions used by various embodiments. Although specific function blocks (“blocks”) are disclosed in method 300, such blocks are examples. That is, embodiments are well suited to performing various other blocks or variations of the blocks recited in method 300. It is appreciated that the blocks in method 300 may be performed in an order different than presented, and that not all of the blocks in method 300 may be performed. At block 310, a fuel source provides fuel to a fuel cell of a fuel cell heater. In embodiments, the fuel cell heater may be a flameless fuel cell heater. In some embodiments, prior to providing the fuel to the fuel cell, hydrogen may be extracted from the fuel stored at the fuel source by a reformer. In embodiments, the extracted hydrogen may be stored at a low pressure storage prior to providing the extracted hydrogen to the fuel cell. At block 320, the fuel cell generates heated air, electricity and water vapor using the fuel from the fuel source, as previously described. At block 330, the fuel cell provides the generated electricity to a heating element that is operatively coupled to the fuel cell. The heating element may convert the electricity generated by the fuel cell into thermal energy. In embodiments, the heated air generated by the fuel cell may be moved by a heat transfer system and combined with the thermal energy of the heating element. In an embodiment, the electricity generated by the fuel cell may be provided to components of the heat transfer system to power the components. In some embodiments, the electricity generated by the fuel cell may be provided to an AC/DC converter, which converts the electricity from direct current to alternating current to power ancillary devices. In embodiments, the water vapor generated by the fuel cell may be provided to a water storage system. FIG. 4 depicts a flow diagram of a method 400 for controlling a fuel cell heater system in accordance with implementations of the present disclosure. In embodiments, various portions of method 400 may be performed by control system 160 of FIGS. 1 and 2. With reference to FIG. 4, method 400 illustrates example functions used by various embodiments. Although specific function blocks (“blocks”) are disclosed in method 400, such blocks are examples. That is, embodiments are well suited to performing various other blocks or variations of the blocks recited in method 400. It is appreciated that the blocks in method 400 may be performed in an order different than presented, and that not all of the blocks in method 400 may be performed. At block 410, a control system (e.g., processing device 502) receives a temperature associated with a fuel cell heater. In embodiments, the control system may receive the temperature from one or more temperature sensors of a fuel cell heater system. In an embodiment, the temperature may correspond to a temperature of a volume of space that is being heated by the fuel cell heater system. For example, the temperature may correspond to the temperature of a room being heated by the fuel cell heater system. At block 420, the control system determines if the temperature received at block 410 satisfies a threshold. The threshold may correspond to a temperature value. In embodiments, the temperature may satisfy the threshold if the temperature is greater than or equal to the threshold. For example, if the threshold is 72 degrees and the temperature received at block 410 is 75 degrees, then the temperature satisfies the threshold. In some embodiments, the temperature may satisfy the threshold if the temperature is less than or equal to the threshold. For example, if the threshold is 72 degrees and the temperature received at block 410 is 68 degrees, then the temperature satisfies the threshold. In an embodiment, multiple thresholds may be used to create a range of temperatures. For example, a first threshold may be used that specifies a temperature less than or equal to 65 degrees satisfies the first threshold and a second threshold may be used that specifies a temperature greater than or equal to 75 degrees satisfies the second threshold. Accordingly, if the received temperature is outside of the specified temperature range (e.g., is less than or equal to 65 degrees or greater than or equal to 75 degrees), then the temperature satisfies the threshold. In embodiments, the threshold may be provided via a user interface of the control system. In some embodiments, the threshold may be provided via a temperature regulating device, such as a thermostat. If the temperature satisfies the threshold, at block 430 the control system adjusts the heat output of a heating element of the fuel cell heater. In embodiments, the control system may adjust the heat output of the heating element by adjusting the amount of fuel provided to the fuel cell, thereby adjusting the amount of electricity generated by the fuel cell that is provided to the heating element. Since the heating element converts the electricity provided by the fuel cell into heat, adjusting the amount of electricity produced by the fuel cell also adjusts the heat output of the heating element. For example, if the temperature received at block 410 is too high (e.g., is greater than the threshold at block 420), then the control system may decrease the amount of fuel provided to the fuel cell such that less electricity is generated by the fuel cell and provided to the heating element, reducing the heat output of the heating element. In another example, if the temperature received at block 420 is too low (e.g., is less than the threshold at block 420), then the control system may increase the amount of fuel provided to the fuel sell such that more electricity is generated by the fuel cell and provided to the heating element, increasing the heat output of the heating element. In some embodiments, the control system may adjust the heat output of the heating element by adjusting the current of the electricity provided to the heating element from the fuel cell. For example, if the temperature received at block 410 is too high, then the control system may decrease the current of the electricity provided to the heating element, which decreases the heat output of the heating element. In another example, if the temperature received at block 410 is too low, then the control system may increase the current of the electricity provided to the heating element, which increases the heat output of the heating element. In embodiments, the control system may adjust the current of the electricity using a voltage regulator operatively coupled between the fuel cell and the heating element. In some embodiments, the control system may determine to not adjust the amount of fuel and/or current of electricity above and/or below a specified value. For example, the control system may identify a maximum amount of fuel that may be provided to a fuel cell of a fuel cell heater and determine to not adjust the amount of fuel above the maximum amount. In another example, the control system may identify a maximum current that may be provided to a heating element and determine to not adjust the current of the electricity provided to the heating element to exceed the identified value. If the control system determines the temperature does not satisfy the threshold, at block 440 the control system determines to not adjust the heat output of the heating element of the fuel cell heater. FIG. 5 illustrates a diagrammatic representation of a machine in the example form of a computer system 500 within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed. In alternative embodiments, the machine may be connected (e.g., networked) to other machines in a local area network (LAN), an intranet, an extranet, or the Internet. The machine may operate in the capacity of a server or a client machine in a client-server network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a personal computer (PC), a tablet PC, a web appliance, a server, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein. In one embodiment, computer system 500 may be representative of a server configured to control the operations of fuel cell heater 100 and/or fuel cell heater system 200. The exemplary computer system 500 includes a processing device 502, a user interface display 513, a main memory 504 (e.g., read-only memory (ROM), flash memory, dynamic random access memory (DRAM), a static memory 506 (e.g., flash memory, static random access memory (SRAM), etc.), and a data storage device 518, which communicate with each other via a bus 530. Any of the signals provided over various buses described herein may be time multiplexed with other signals and provided over one or more common buses. Additionally, the interconnection between circuit components or blocks may be shown as buses or as single signal lines. Each of the buses may alternatively be one or more single signal lines and each of the single signal lines may alternatively be buses. Processing device 502 represents one or more general-purpose processing devices such as a microprocessor, central processing unit, or the like. More particularly, the processing device may be complex instruction set computing (CISC) microprocessor, reduced instruction set computer (RISC) microprocessor, very long instruction word (VLIW) microprocessor, or processor implementing other instruction sets, or processors implementing a combination of instruction sets. Processing device 502 may also be one or more special-purpose processing devices such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), network processor, or the like. The processing device 502 is configured to execute processing logic 526, which may be one example of systems 100 and 200 shown in FIGS. 1 and 2, for performing the operations and blocks discussed herein. The data storage device 518 may include a machine-readable storage medium 528, on which is stored one or more set of instructions 522 (e.g., software) embodying any one or more of the methodologies of functions described herein, including instructions to cause the processing device 502 to execute a control system (e.g., control system 160). The instructions 522 may also reside, completely or at least partially, within the main memory 504 or within the processing device 502 during execution thereof by the computer system 500; the main memory 504 and the processing device 502 also constituting machine-readable storage media. The instructions 522 may further be transmitted or received over a network 520 via the network interface device 508. The machine-readable storage medium 528 may also be used to store instructions to perform a method for device identification, as described herein. While the machine-readable storage medium 528 is shown in an exemplary embodiment to be a single medium, the term “machine-readable storage medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, or associated caches and servers) that store the one or more sets of instructions. A machine-readable medium includes any mechanism for storing information in a form (e.g., software, processing application) readable by a machine (e.g., a computer). The machine-readable medium may include, but is not limited to, magnetic storage medium (e.g., floppy diskette); optical storage medium (e.g., CD-ROM); magneto-optical storage medium; read-only memory (ROM); random-access memory (RAM); erasable programmable memory (e.g., EPROM and EEPROM); flash memory; or another type of medium suitable for storing electronic instructions. The preceding description sets forth numerous specific details such as examples of specific systems, components, methods, and so forth, in order to provide a good understanding of several embodiments of the present disclosure. It will be apparent to one skilled in the art, however, that at least some embodiments of the present disclosure may be practiced without these specific details. In other instances, well-known components or methods are not described in detail or are presented in simple block diagram format in order to avoid unnecessarily obscuring the present disclosure. Thus, the specific details set forth are merely exemplary. Particular embodiments may vary from these exemplary details and still be contemplated to be within the scope of the present disclosure. Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments included in at least one embodiment. Thus, the appearances of the phrase “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” Additionally, some embodiments may be practiced in distributed computing environments where the machine-readable medium is stored on and or executed by more than one computer system. In addition, the information transferred between computer systems may either be pulled or pushed across the communication medium connecting the computer systems. Embodiments of the claimed subject matter include, but are not limited to, various operations described herein. These operations may be performed by hardware components, software, firmware, or a combination thereof. Although the operations of the methods herein are shown and described in a particular order, the order of the operations of each method may be altered so that certain operations may be performed in an inverse order or so that certain operation may be performed, at least in part, concurrently with other operations. In another embodiment, instructions or sub-operations of distinct operations may be in an intermittent or alternating manner. The above description of illustrated implementations of the invention, including what is described in the Abstract, is not intended to be exhaustive or to limit the invention to the precise forms disclosed. While specific implementations of, and examples for, the invention are described herein for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. The words “example” or “exemplary” are used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as “example” or “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs. Rather, use of the words “example” or “exemplary” is intended to present concepts in a concrete fashion. As used in this application, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise, or clear from context, “X includes A or B” is intended to mean any of the natural inclusive permutations. That is, if X includes A; X includes B; or X includes both A and B, then “X includes A or B” is satisfied under any of the foregoing instances. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form. Moreover, use of the term “an embodiment” or “one embodiment” or “an implementation” or “one implementation” throughout is not intended to mean the same embodiment or implementation unless described as such. Furthermore, the terms “first,” “second,” “third,” “fourth,” etc. as used herein are meant as labels to distinguish among different elements and may not necessarily have an ordinal meaning according to their numerical designation. What is claimed is: 1. A heater comprising: a fuel cell to produce heated air, electricity and water vapor; a heating element operatively coupled to the fuel cell to convert the electricity to heat; and a control system operatively coupled to the fuel cell and the heating element, the control system being configured to monitor and control the fuel cell and heating element. 2. The heater of claim 1, further comprising: a fan system operatively coupled to the fuel cell, the fan system being configured to move the heated air produced by the fuel cell. 3. The heater of claim 1, further comprising: a pump system operatively coupled to the fuel cell, the pump system being configured to move the heated air produced by the fuel cell. 4. The heater of claim 1, further comprising: a fuel source operatively coupled to the fuel cell, the fuel source being configured to provide fuel to the fuel cell. 5. The heater of claim 4, wherein the fuel source comprises hydrocarbon fuel. 6. The heater of claim 5, further comprising: a reformer operatively coupled to the fuel source and the fuel cell, the reformer being configured to extract hydrogen from the hydrocarbon fuel and provide the extracted hydrogen to the fuel cell. 7. The heater of claim 1, further comprising: an alternating current to direct current (AC/DC) converter operatively coupled to the fuel cell, the AC/DC converter being configured to convert the electricity produced by the fuel cell from direct current to alternating current. 8. The heater of claim 7, wherein the AC/DC converter is operatively coupled to a heat transfer system to provide electricity to components of the heat transfer system. 9. The heater of claim 1, wherein the heater comprises a flameless heater. 10. The heater of claim 1, further comprising: a radiator operatively coupled to the fuel cell, the radiator being configured to transfer thermal energy of the heated air produced by the fuel cell. 11. The heater of claim 1, further comprising: a water storage system operatively coupled to the fuel cell to store the water vapor produced by the fuel cell. 12. The heater of claim 1, further comprising: a temperature sensor operatively coupled to the control system, the temperature sensor being configured to monitor a temperature associated with the heater. 13. A method comprising: providing, to a fuel cell of a fuel cell heater, fuel from a fuel source; generating, by the fuel cell using the fuel from the fuel source, heated air, electricity and water vapor; and providing, to a heating element operatively coupled to the fuel cell, the generated electricity of the fuel cell. 14. The method of claim 13, further comprising: receiving, by a control system of the fuel cell heater, a temperature associated with the fuel cell heater; determining, by the control system, whether the temperature associated with the fuel cell heater satisfies a threshold; and in response to determining that the temperature satisfies the threshold, adjusting heat output of the heating element of the fuel cell heater. 15. The method of claim 14, wherein adjusting the heat output by the heating element of the fuel cell heater comprises at least one of: adjusting an amount of the fuel provided to the fuel cell from the fuel source, or adjusting a current of the generated electricity provided to the heating element from the fuel cell. 16. The method of claim 13, wherein the fuel cell heater system comprises a flameless fuel cell heater. 17. The method of claim 13, further comprising: providing the electricity generated by the fuel cell to a heat transfer system; and moving the heated air generated by the fuel cell using the heat transfer system. 18. The method of claim 13, wherein the fuel source comprises hydrocarbon fuel. 19. The method of claim 17, further comprising: providing the hydrocarbon fuel source to a reformer of the fuel cell heater, the reformer being configured to extract hydrogen from the hydrocarbon fuel and provide the extracted hydrogen to the fuel cell. 20. The method of claim 13, further comprising: providing the water vapor generated by the fuel cell to a water storage system.

2018-11-02

en

2019-05-09

US-201113981018-A

Method for monitoring the posture of a motorcyclist ABSTRACT A method for improving the safety of motorcycling. With the aid of a sensor system, it is monitored if a motorcyclist assumes a predefined posture. Using an algorithm on a control unit, if it is detected that the motorcyclist deviates from the predefined posture for longer than a predetermined period of time, a signal transmitter is activated. FIELD The present invention relates to a method for improving the safety of motorcycling. BACKGROUND INFORMATION In road traffic, accidents are caused over and over again by a rider's inattentiveness or lack of fitness to drive. Typical reasons for such accidents include, for example, serious fatigue all the way up to microsleep, a health problem such as hypoglycemia, or high emotional stress of the rider. Motorcyclists are put at a particularly high risk by overtiredness or lack of attention. In motorcycling, apart from the physical state of the rider, the correct posture is also important. If the rider abandons a posture suitable for traffic and rides, for example, with no hands, he may endanger himself and other road users. SUMMARY Therefore, an object of the present invention is to provide a system, by which the safety of motorcycling may be improved. In accordance with the present invention, a sensor system is used to monitor if a motorcyclist assumes a predefined posture. If it is determined that the motorcyclist deviates from the predefined posture for longer than a predetermined period of time, a signal transmitter is activated in order to warn the rider. Indeed, experience has shown that in response to symptoms of fatigue, motorcyclists occasionally carry out tension-reducing movements, such as standing up during the drive, shifting one's weight on the seat, driving with one hand or no hands, stretching out the legs, or shifting the feet away from the designated foot rests. In these phases, the ability to control the motorcycle and, therefore, the driving safety, as well, are reduced. By monitoring the posture and signaling when the correct posture has been abandoned, the motorcyclist is made aware that he is deviating from a posture that is safe in traffic. In this case, he may reassume the posture that is safe in traffic or take a break, if he wishes. According to a preferred, specific embodiment of the present invention, a contact and/or force sensor system is used as a sensor system. This sensor system may be installed or mounted very easily at different spots on the motorcycle or the equipment of the motorcyclist. In addition, with the aid of this sensor system, it may be determined very easily if the rider is assuming a posture that is safe in traffic. In principle, the predefined posture is a position in which the rider has effective control over the motorcycle and can react rapidly. It may be characterized, for example, by at least one of the following features: a particular sitting position of the rider, a predefined, uniform weight distribution on the seat, one hand or both hands of the rider are situated on the grips of the handlebars, one foot or both feet of the rider are in contact with the foot rests of the motorcycle, and/or the rider is not in contact with specified locations on the motorcycle. However, postures other than the desired posture may be selected. According to a preferred, specific embodiment, the signal transmitter outputs an optical and/or acoustic and/or haptically perceptible signal to the rider. For example, the signal transmitter may generate vibrations at a motorcycle component or at the motorcycle equipment of the rider, such as the motorcycle riding suit. Alternatively, or in addition, a light-emitting element may output an optical signal. For example, the light-emitting element may be attached to the cockpit of the motorcycle, to the helmet of the rider, or to another component of the motorcycle or the equipment of the motorcyclist. An alternative or additional option is to output a signal over a loudspeaker, which may be situated, e.g., in the helmet of the rider, may be part of handsfree conversing equipment, and/or may be mounted to a different component of the motorcycle or the accessories. Consequently, the form of the signal output may be adapted to different individual needs and different motorcycles and motorcycle equipment. According to a preferred specific embodiment, vibrations are generated at the throttle grip, at the brake handle, at the foot rests, at the seat, in the motorcycle gloves, at the motorcycle riding suit and/or at the helmet of the motorcyclist. Vibration mechanisms may be integrated at both the motorcycle and the accessories. In particular, when it is attached to the helmet or the clothing, the signal transmitter is preferably activated via an air interface, such as Bluetooth. The above-mentioned period of time, for which the rider may deviate from the predefined posture before a warning signal is generated, may vary as a function of the type of deviation. For example, a time period of between 0 s and several seconds may be allowed. According to a specific embodiment of the present invention, it may be provided, e.g., that the rider may remove his hand from the left hand grip for a maximum of 3 s, but only 1 s long from the brake handle (right hand grip), before the signal transmitter is activated, while the removal of both hands from the handlebars immediately results in the activation of the signal transmitter. The predefined period of time may also be a function of different operating variables of the motorcycle, such as the traveling speed, data regarding the traffic, the weather, and/or the route lying ahead, which the motorcycle will travel. In this manner, for example, the predetermined period of time may be set lower for a higher traveling speed than for a low speed. The warning system may be deactivated when the motorcycle is at a dead stop. For example, if the rider is stopped in front of a red light with the motorcycle, he may remove both hands from the handlebars without activating the signal transmitter. A device according to the present invention preferably includes a control unit having an algorithm for monitoring the posture of a motorcyclist. The algorithm processes the signals of a corresponding sensor system, and, from them, it determines whether the motorcyclist is assuming the predefined posture. If the algorithm determines that the motorcyclist deviates from the predefined posture during a predetermined period of time, a signal transmitter is activated. In the following, the present invention is explained in greater detail by way of example, with reference to the FIGURE. BRIEF DESCRIPTION OF THE DRAWING FIG. 1 shows a schematic block diagram of a method for monitoring a predefined posture of a motorcyclist. DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS FIG. 1 shows a schematic representation of a system for monitoring a predefined posture of a motorcyclist. The system includes a sensor system 2 for monitoring if the motorcyclist assumes a predefined posture, a control unit 1 which is connected to it and includes an algorithm 4, and a signal transmitter 3. The sensor signals of sensor system 2 are processed and evaluated by algorithm 4. If it is determined that the motorcyclist deviates from a predefined posture longer than a predetermined period of time, control unit 1 activates signal transmitter 3 via a data connection 10. In the example shown, sensor system 2 includes several pressure or force sensors 5, which are situated at the seat of the motorcycle, contact sensors 6 at the grips of the handlebars, and contact sensors 7 at the foot rests of the motorcycle. At various positions on the seat, force sensors 5 measure the force which is applied to the seat at the respective position. In this manner, the sitting position or a change in the weight distribution may be detected. Contact sensors 6 detect if the hands of the rider are on the grips. The contact sensors 7 at the foot rests detect whether or not the feet of the rider are placed on the foot rests. The data ascertained by sensor system 2 are transmitted to control unit 1 via a data connection 8. In the exemplary embodiment shown, signal transmitter 3 includes a vibration module 11 at the foot rests and/or a vibration module 12 at the seat, as well as a light-emitting element 13 in the helmet of the motorcyclist. In principle, more or fewer signal transmitters 11 through 13 may also be provided. In the following, the function of the system represented in FIG. 1 is explained again in light of different examples. For example, if the motorcyclist stretches both legs out and, as a result, no longer touches the foot rests, then, e.g., the vibration module 12 at the seat and the light-emitting element 13 in the helmet of the motorcyclist are activated. If the motorcyclist stands up during the trip and remains standing several seconds, then, e.g., vibration module 11 at the foot rests and light-emitting element 13 in the helmet of the motorcyclist are activated. The period of time mentioned at the outset, for which the rider may deviate from the predefined posture, may be a function of an operating variable of the motorcycle, e.g., the speed. In this case, the speed is ascertained from the signal of a wheel speed sensor 9. If the rider removes a hand from the handlebars while the motorcycle is traveling, e.g., 25 km/h, signal transmitter 3 is first activated after 4 s, whereas at 60 km/h, it is already activated after 2 s. 1-10. (canceled) 11. A method for improving the safety of motorcycling, comprising: monitoring, using a sensor system, if a motorcyclist on a motorcycle assumes a predefined posture; and activating a signal transmitter when it is determined that the motorcyclist deviates from the predefined posture for longer than a predetermined period of time. 12. The method as recited in claim 11, wherein the sensor system includes at least one of a contact sensor and a force sensor. 13. The method as recited in claim 11, wherein the predefined posture is characterized by at least one of the following features: a predefined sitting position of the motorcyclist, a predefined weight distribution on a seat of the motorcycle, one hand or both hands of the motorcyclist are situated at grips of handlebars of the motorcycle, one foot or both feet of the rider are in contact with foot rests of the motorcycle, the motorcyclist is not in contact with specified locations on the motorcycle, and legs of the motorcyclist assume a predefined position. 14. The method as recited in claim 11, wherein the signal transmitter outputs at least one of a haptic, an optical and an acoustic signal to the motorcyclist. 15. The method as recited in claim 11, wherein the signal transmitter outputs at least one of: i) vibrations at at least one of a component of the motorcycle, at motorcycle equipment of the motorcyclist, ii) an optical signal in a cockpit, another component of the motorcycle, or at the equipment of the rider, and iii) an acoustic signal in the helmet, via handsfree conversing equipment, or another component of the motorcycle. 16. The method as recited in claim 11, wherein the signal transmitter generates vibrations at least one of: i) at a throttle grip, ii) at a brake handle, iii) at foot rests, iv) at the seat, v) in motorcycle gloves, vi) at the motorcycle riding suit, and vii) at a helmet. 17. The method as recited in claim 11, wherein the signal transmitter is activated via an air interface. 18. The method as recited in claim 17, wherein the signal transmitter is actuated via Bluetooth. 19. The method as recited in claim 11, wherein the predetermined period of time for a maximum deviation from different features of the predefined posture vary. 20. The method as recited in claim 11, wherein the predetermined period of time is a function of at least one of: i) an operating variable of the motorcycle, ii) traffic data, iii) weather data, and iv) data regarding a route lying ahead. 21. A control unit which processes signals of a sensor system of a motorcycle, determines if a motorcyclist assumes a predefined posture, and activates a signal transmitter when the control unit determines that the motorcyclist abandoned the predefined posture for longer than a predetermined period of time.

2011-12-05

en

2014-01-16

US-201615298521-A

Ambient-Light-Corrected Display Management for High Dynamic Range Images ABSTRACT Methods are disclosed for adaptive display management using one or more viewing environment parameters. Given the one or more viewing environment parameters, an effective luminance range for a target display, and an input image, a tone-mapped image is generated based on a tone-mapping curve, an original PQ luminance mapping function, and the effective luminance range of the display. A corrected PQ (PQ′) luminance mapping function is generated according to the viewing environment parameters. A PQ-to-PQ′ mapping is generated, wherein codewords in the original PQ luminance mapping function are mapped to codewords in the corrected (PQ′) luminance mapping function, and an adjusted tone-mapped image is generated based on the PQ-to-PQ′ mapping. CROSS-REFERENCE TO RELATED APPLICATIONS This application claims the benefit of priority to U.S. Provisional Patent Application Ser. No. 62/245,023, filed on Oct. 22, 2015, which is hereby incorporated herein by reference in its entirety. TECHNOLOGY The present invention relates generally to images. More particularly, an embodiment of the present invention relates to ambient-light-corrected display management for high dynamic range (HDR) images. BACKGROUND As used herein, the terms “display management” or “display mapping” denote the processing (e.g., tone and gamut mapping) required to map an input video signal of a first dynamic range (e.g., 1000 nits) to a display of a second dynamic range (e.g., 500 nits). Examples of display management processes can be found in WIPO Publication Ser. No. WO2014/130343 (to be referred to as the '343 publication), “Display Management for High Dynamic Range Video,” and U.S. Provisional Application Ser. No. 62/105,139, (to be referred as the '139 Application), filed on Jan. 19, 2015, each of which is incorporated herein by reference in its entirety. As used herein, the term ‘dynamic range’ (DR) may relate to a capability of the human visual system (HVS) to perceive a range of light intensity (e.g., luminance, luma) in an image, e.g., from darkest blacks (darks) to brightest whites (highlights). In this sense, DR relates to a ‘scene-referred’ light intensity. DR may also relate to the ability of a display device to adequately or approximately render an intensity range of a particular breadth. In this sense, DR relates to a ‘display-referred’ intensity. Unless a particular sense is explicitly specified to have particular significance at any point in the description herein, it should be inferred that the term may be used in either sense, e.g., interchangeably. A reference electro-optical transfer function (EOTF) for a given display characterizes the relationship between color values (e.g., luminance) of an input video signal to output screen color values (e.g., screen luminance) produced by the display. For example, ITU Rec. ITU-R BT. 1886, “Reference electro-optical transfer function for flat panel displays used in HDTV studio production,” (03/2011), which is incorporated herein by reference in its entity, defines the reference EOTF for flat panel displays based on measured characteristics of the Cathode Ray Tube (CRT). Given a video stream, any ancillary information is typically embedded in the bit stream as metadata. As used herein, the term “metadata” relates to any auxiliary information that is transmitted as part of the coded bitstream and assists a decoder to render a decoded image. Such metadata may include, but are not limited to, color space or gamut information, reference display parameters, and auxiliary signal parameters, as those described herein. Most consumer HDTVs range from 300 to 500 nits peak luminance with new models reaching 1000 nits (cd/m2). As the availability of HDR content grows due to advances in both capture equipment (e.g., cameras) and displays (e.g., the PRM-4200 professional reference monitor from Dolby Laboratories), HDR content may be color graded and displayed on displays that support higher dynamic ranges (e.g., from 1,000 nits to 5,000 nits or more). Such displays may be defined using alternative EOTFs that support high luminance capability (e.g., 0 to 10,000 nits). An example of such an EOTF is defined in SMPTE ST 2084:2014 “High Dynamic Range EOTF of Mastering Reference Displays,” which is incorporated herein by reference in its entirety. In general, without limitation, the methods of the present disclosure were designed primarily for any dynamic range higher than SDR. However, the general methods could be applied to dynamic ranges lower than SDR, such as would occur with either high ambient or lower dynamic range displays, and still result in improvement over doing no compensation. As appreciated by the inventors here, improved techniques for the display of high-dynamic range images, especially as they relate to a changing viewing environment, are desired. The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section. Similarly, issues identified with respect to one or more approaches should not assume to have been recognized in any prior art on the basis of this section, unless otherwise indicated. BRIEF DESCRIPTION OF THE DRAWINGS An embodiment of the present invention is illustrated by way of example, and not in way by limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which: FIG. 1 depicts an example process for backlight control and display management according to an embodiment of this invention; FIG. 2 depicts an example process for display management according to an embodiment of this invention; FIG. 3 depicts examples of ambient-light-corrected perceptual quantization curves computed according to an embodiment of this invention; FIG. 4 depicts an example of PQ to PQ′ mapping for a given ambient light and display characteristics according to an embodiment of this invention; and FIG. 5A and FIG. 5B depict an example process for a display management process optimized for a specific viewing environment according to embodiments of this invention. DESCRIPTION OF EXAMPLE EMBODIMENTS Techniques for ambient-light-corrected display management or mapping of high dynamic range (HDR) images are described herein. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are not described in exhaustive detail, in order to avoid unnecessarily occluding, obscuring, or obfuscating the present invention. Overview Example embodiments described herein relate to the display management of HDR images under changing viewing environments (e.g., a change of the viewing ambient light). Given: one or more viewing environment parameters, an effective luminance dynamic range for a target display, and an input image, then a tone-mapped image is generated based on a tone-mapping curve, an original PQ luminance mapping function, and the effective luminance dynamic range of the display. A corrected PQ (PQ′) luminance mapping function is generated according to the viewing environment parameters. A PQ-to-PQ′ mapping is generated, wherein codewords in the original PQ luminance mapping function are mapped to codewords in the corrected (PQ′) luminance mapping function, and an adjusted tone-mapped image is generated based on the PQ-to-PQ′ mapping. Example Display Control and Display Management FIG. 1 depicts an example process (100) for display control and display management according to an embodiment. Input signal (102) is to be displayed on display (120). Input signal may represent a single image frame, a collection of images, or a video signal. Image signal (102) represents a desired image on some source display typically defined by a signal EOTF, such as ITU-R BT. 1886 or SMPTE ST 2084, which describes the relationship between color values (e.g., luminance) of the input video signal to output screen color values (e.g., screen luminance) produced by the target display (120). The display may be a movie projector, a television set, a monitor, and the like, or may be part of another device, such as a tablet or a smart phone. Process (100) may be part of the functionality of a receiver or media player connected to a display (e.g., a cinema projector, a television set, a set-top box, a tablet, a smart-phone, a gaming console, and the like), where content is consumed, or it may be part of a content-creation system, where, for example, input (102) is mapped from one color grade and dynamic range to a target dynamic range suitable for a target family of displays (e.g., televisions with standard or high dynamic range, movie theater projectors, and the like). In some embodiments, input signal (102) may also include metadata (104). These can be signal metadata, characterizing properties of the signal itself, or source metadata, characterizing properties of the environment used to color grade and process the input signal (e.g., source display properties, ambient light, coding metadata, and the like). In some embodiments (e.g., during content creation), process (100) may also generate metadata which are embedded into the generated tone-mapped output signal. A target display (120) may have a different EOTF than the source display. A receiver needs to account for the EOTF differences between the source and target displays to accurate display the input image, so that it is perceived as the best match possible to the source image displayed on the source display. In an embodiment, image analysis (105) block may compute characteristics of the input signal (102), such as its minimum (min), average (mid), and peak (max) luminance values, to be used in the rest of the processing pipeline. For example, given min, mid, and max luminance source data (107 or 104), image processing block (110) may compute the display parameters (e.g., the preferred backlight level for display (120)) that will allow for the best possible environment for displaying the input video. Display management (115) is the process that maps the input image into the target display (120) by taking into account the two EOTFs as well as the fact that the source and target displays may have different capabilities (e.g., in terms of dynamic range.) In some embodiments, the dynamic range of the input (102) may be lower than the dynamic range of the display (120). For example, an input with maximum luminance of 100 nits in a Rec. 709 format may need to be color graded and displayed on a display with maximum luminance of 1,000 nits. In other embodiments, the dynamic range of input (102) may be the same or higher than the dynamic range of the display. For example, input (102) may be color graded at a maximum luminance of 5,000 nits while the target display (120) may have a maximum luminance of 1,500 nits. In an embodiment, display (120) is controlled by display controller (130). Display controller (130) provides display-related data (134) to the display mapping process (115) (such as: minimum and maximum luminance of the display, color gamut information, and the like) and control data (132) for the display, such as control signals to modulate the backlight or other parameters of the display for either global or local dimming. In an embodiment, display controller (130) may receive information (106) about the viewing environment, such as the intensity of the ambient light. This information can be derived from measurements from one or more sensors attached to the device, user input, location data, default values, or other data. For example, even without a sensor, a user could select a viewing environment from a menu, such as “Dark”, “Normal”, “Bright,” and “Very bright,” where each entry in the menu is associated with a predefined luminance value selected by the device manufacturer. Signal 106 may also include estimates of the screen reflections in the viewing environment. Such estimates may be derived from a model of the screen reflectivity of the display (120) and measurements of the ambient light in the viewing environment. Typically, sensors are in the front of the display, and measure the illumination on the display screen, which is the ambient component that elevates the black level as a function of reflectivity. Viewing environment information (106) may also be communicated to display management unit (115) via interface 134. Displays using global or local backlight modulation techniques adjust the backlight based on information from input frames of the image content and/or information received by local ambient light sensors. For example, for relatively dark images, the display controller (130) may dim the backlight of the display to enhance the blacks. Similarly, for relatively bright images, the display controller may increase the backlight of the display to enhance the highlights of the image, as well as elevate the dark region luminances since they would fall below threshold contrasts for a high ambient environment. As described in WO2014/130343, and depicted in FIG. 2, given an input (112), the display characteristics of a target display (120), and metadata (104), the display management process (115) may be sub-divided into the following main steps: a) Step (200)—Optional input color conversions, say from RGB or YCbCr to IPT-PQ b) Step (205)—Determining the optimum color volume for the target display, including tone mapping and saturation adjustments c) Step (210)—Performing the optimum color gamut mapping (CGM) for the target display d) Step (215)—Output color transforms (say, from IPT-PQ to whatever color format is needed for the target display or other post-processing) As used herein, the term “color volume space” denotes the 3D volume of colors that can be represented in a video signal and/or can be represented in display. Thus, a color volume space characterizes both luminance and color/chroma characteristics. For example, a first color volume “A” may be characterized by: 400 nits of peak luminance, 0.4 nits of minimum luminance, and Rec. 709 color primaries. Similarly, a second color volume “B” may be characterized by: 4,000 nits of peak luminance, 0.1 nits of minimum luminance, and Rec. 709 primaries. In an embodiment, as noted earlier, color volume determination (205) may include the following steps: a) applying a tone curve to remap the intensity channel (I) of the input video according to the display characteristics of the target display, and b) applying a saturation adjustment to the tone-curve mapping step to account for the adjustments in the intensity channel. The saturation adjustment may be dependent on the luminance level of the pixel or its surrounding region. The initial color volume determination (205) may result in colors outside of the target display gamut. During color gamut mapping (210), a 3D color gamut look-up table (LUT) may be computed and applied to adjust the color gamut so that out of gamut pixels are brought inside or closer to the color volume of the target display. In some embodiments, an optional color transformation step (215) may also be used to translate the output of CGM (212) (say, RGB) to a color representation suitable for display or additional processing (say, YCbCr), according to the display's EOTF. As mentioned earlier, in a preferred embodiment, color volume determination may be performed in the IPT-PQ color space. The term “PQ” as used herein refers to perceptual quantization. The human visual system responds to increasing light levels in a very non-linear way. A human's ability to see a stimulus is affected by the luminance of that stimulus, the size of the stimulus, the spatial frequency(ies) making up the stimulus, and the luminance level that the eyes have adapted to at the particular moment one is viewing the stimulus. In a preferred embodiment, a perceptual quantizer function maps linear input gray levels to output gray levels that better match the contrast sensitivity thresholds in the human visual system than traditional gamma functions. An example of a PQ mapping function is described in the SMPTE ST 2084 specification, where given a fixed stimulus size, for every luminance level (i.e., the stimulus level), a minimum visible contrast step at that luminance level is selected according to the most sensitive adaptation level and the most sensitive spatial frequency (according to HVS Contrast Sensitivity Function (CSF) models, which are analogous to spatial MTFs). Compared to the traditional gamma curve, which represents the response curve of a physical cathode ray tube (CRT) device and coincidentally may have a very rough similarity to the way the human visual system responds but only for limited dynamic ranges of less than 2 log 10 units, a PQ curve imitates the true visual response of the human visual system using a relatively simple functional model. Further, it more accurate over a much larger dynamic range. The IPT-PQ color space, as also described in the '343 publication, combines a PQ mapping with the IPT color space as described in “Development and testing of a color space (ipt) with improved hue uniformity,” Proc. 6th Color Imaging Conference: Color Science, Systems, and Applications, IS&T, Scottsdale, Ariz., November 1998, pp. 8-13, by F. Ebner and M. D. Fairchild, which is incorporated herein by reference in its entirety. IPT is like the YCbCr or CIE-Lab color spaces; however, it has been shown in some scientific studies to better mimic human visual processing than these spaces, because the I is a better model of spatial vision than the Y, or L* used in these other models. An example of such a study is the work by J. Froehlich et al. “Encoding color difference signals for high dynamic range and wide gamut imagery,” Color and Imaging Conference, Vol. 2015, No. 1, October 2015, pp. 240-247(8), Society for Image Science and Technology. The display management process (115), which typically does not use signal 106, works well under the assumption of a reference dim viewing environment. Since many viewers watch content in a non-reference viewing environment, as appreciated by the inventors, it would be desirable to adjust the display management process according to changes in the viewing conditions. In an embodiment, two additional steps may be incorporated to the steps described earlier: a) during color volume determination (205), applying a tone curve to remap the intensity channel to account for the difference between a reference dark viewing environment and the actual viewing environment; and b) before the output color transformations (215), taking into consideration and subtracting the estimated reflected light from the screen. Each of these steps is discussed in more detail next. Ambient-Light-Corrected Perceptual Quantization The PQ mapping function adopted in the SMPTE ST 2084 specification is based on work done by J. S. Miller et al., as presented in U.S. Pat. No. 9,099,994, “Device and method of improving the perceptual luminance nonlinearity-based image data exchange across different display capabilities,” which is incorporated herein by reference in its entirety. That mapping function was derived for a viewing environment with minimal ambient surround light, such as a completely dark room. Hence, it is desirable to compute alternative PQ mapping functions, to be referred to as PQ′, by taking into consideration the viewing conditions, and in particular, the intensity of the ambient light. For example, taking into consideration the ambient light ensures that details in the dark areas of the image do not become uniformly black when the scene is viewed in a brighter environment. Following the same approach as Miller et al., the steps of a PQ′ mapping may be derived iteratively. In an embodiment, for Lo at about 10−6 nits, where Lk denotes the k-th step and mt denotes a detection threshold, which is the lowest increase of luminance an average human can detect at luminance Lk. Multiplying mt by 0.9 ensures the increment will not be visible. In an embodiment, mt is determined as a function of a contrast sensitivity function (S(L)) at the spatial frequency where the sensitivity is the highest for luminance L and an ambient-light factor (A(La)) at ambient (surround) luminance La, as Without limitation, examples of S(L) and A(Lα) functions are presented by P. G. J. Barten, “Formula for the contrast sensitivity of the human eye,” in Image quality and system performance, edited by Y. Miyake and D. R. Rasmussen, Proc. Of SPIE-IS&T Electronic Imaging, SPIE Vol. 5294, 2004, pp. 231-238, (e.g., see equations 11 and 13), which is incorporated herein by reference in its entirety. Examples of PQ′ curves (310, 315, 320, 325) computed at various levels of ambient light ranging from 0.1 to 600 nits, for a 12-bit input, are shown in FIG. 3. The original PQ curve (305) is also depicted. The ambient-light-corrected curves generally require a higher dynamic range to offer the same number of distinct code words as the original PQ curve. PQ to PQ′ Mapping Adjustment As discussed earlier, in an embodiment, the display management process (115) is performed in the IPT-PQ domain. Incoming signals (say RGB in BT1866), before any processing, are de-linearized and converter to IPT-PQ (e.g., in 200). Then, as part of color volume determination (e.g., in 205), the intensity component of the input (say, Iin) is remapped to new intensity values (say, Iout) according to the characteristics of the target display, such as, its minimum and maximum luminance (405 and 410). The input color transformation (say, from RGB to IPT) assumes an original PQ curve (305) computed under the assumption of a dark environment. As an example, FIG. 4 depicts the original PQ curve for 12 bits. It also depicts the minimum and maximum luminance levels of a target display, to be denoted as TMin (405) and TMax (410). As can be seen in FIG. 4, given TMin and TMax, only a part of the available code words will be used, say from CMin (425) to CMax (415), where PQ(CMin)=TMin and PQ(CMax)=TMax. The goal of a PQ to PQ′ mapping adjustment is to map incoming intensity (I) values to new intensity values (I′) by taking into consideration both the ambient light and the luminance characteristics of the target display Consider now, as an example, an ambient light causing surround luminances measured, without limitation, at La nits (e.g., La=600). As depicted in FIG. 4, the PQ′La mapping function (325) for La=600 nits, representing the ambient-light-adjusted PQ mapping, typically allows a different number of code words to be used, say from CMin′ (not shown for clarity) to CMax′ (420), where PQ′La(CMin′)=TMin and PQ′La(CMax′)=TMax. In an embodiment, to preserve the appearance of the original image viewed at a different ambient light, the first step in the PQ to PQ′ mapping is to map values of the original curve (say, PQ(Ci), for Ci=CMin to CMax) to corresponding values in the adjusted curve (say, PQ′La(Cj), for Cj=CMin′ to CMax′). As an example, as depicted in FIG. 4, at about Ci=2,000, PQ(Ci)=A is mapped to PQ′La(Cj)=B. In an embodiment, this mapping is performed by preserving image contrast, as measured in units of JNDs, in terms of the position of the original intensity value relatively to the total number of PQ steps offered by the display. That is, if a codeword (Ci) lies at say 1/n of the full PQ range (CMin to CMax), the corresponding codeword (Cj) in PQ′ should also lie at 1/n of the full PQ′ range (CMin′ to CMax′). Assuming, with no limitation, a linear interpolation mapping, this can be expressed as: This provides a similar proportional placement of the code values in each of the ranges resulting from the different ambient conditions. In other embodiments, other linear or non-linear mappings may also be employed. For example, given approximate values extracted from FIG. 4, say CMax=2,850, CMin=62, CMax′=1800, and CMin′=40, for Ci=2,000, from equation (3), Cj=1,263. In summary, given an input codeword I=Ci mapped according to PQ(Ci), its luminance should be adjusted to correspond to the same luminance as mapped for PQ′La(Cj). Given now the PQ′La(Cj) values, using the original PQ curve, one can identify the codeword Ck in the input stream for which PQ(Ck)=PQ′La(Cj). In other words: if PQ(Ci) is mapped to PQ′ La(Cj) then codeword Ci is mapped to codeword Ck so that PQ(Ck)=PQ′ La(Cj).  (4) Hence, each original PQ codeword Ci, for Ci in CMin to CMax, may be mapped to its corresponding PQ codeword Ck. In other words, given input pixel In, its remapped output In′ due to ambient light adjustments will be: if (I n ==Ci) then I n ′=Ck.  (5) In some embodiments, the input may be expressed as a normalized value in (0,1). Then if the PQ and PQ′ curves are computed for B bits of precision, equation (5) can be expressed as The proposed mapping allows the remapped intensity data (e.g., In′) to be displayed on the target display at the adjusted luminance which is best suited for the viewing environment. FIG. 5A depicts an example process for performing ambient-light-corrected display management according to an embodiment. As depicted in FIG. 5A, steps 515, 520 and 535 represent the traditional display management process, for example, as discussed in the '343 publication and/or the '139 Application. The remaining steps represent additional representative steps for a display management process that can be adapted for a specific viewing environment. The tone curve is applied only to the luminance intensity channel (I) because the ambient model predicts perception changes in the luminance domain only. An accurate prediction of these changes requires the information about the absolute luminance levels of the displayed image, so the processing should preferably be conducted in a color space that facilitates an easy conversion to linear luminance, which the RGB space does not. The method does not explicitly process chrominance, it is instead assumed that the saturation mapping step (e.g., as performed after tone-mapping) can accurately predict the change in saturation caused by the luminance change during the PQ to PQ′ mapping and compensate for it. In step 505, as described earlier (e.g., via signal 106), the process determines whether the default display management process needs to be adjusted according to user or sensor input reflecting the actual viewing environment. For example, any of the known methods in the art can be used to provide an estimate of the surrounding ambient light. Optionally, in step 510, the process may also take into consideration screen reflections. For example, a measure of screen reflections may be estimated based on a model of the screen reflectivity of the display and the viewing parameters of step 505. A key component of display management is determining the luminance characteristics of the target display (e.g., minimum, medium or average, and maximum luminance). In some embodiments, these parameters are fixed, but in some other embodiments (e.g., with displays supporting a dynamic backlight), they may be adjusted according to the luminance characteristics of the input video and/or the viewing environment. In an embodiment, the effective range of a target display may be adjusted according to the screen reflection measure computed in step 510. For example, if the target display range is 0.005 nits to 600 nits in a dark environment, and the screen reflections are estimated at 0.1 nits, then the effective display range could be defined to be 0.105 to 600.1 nits. More generally, given an effective dynamic range for a target display (e.g., TMin and TMax), and given a measure Lr of the screen reflectivity, one may adjust the effective display range to be TMin′=TMin+Lr, TMax′=TMax+Lr.  (7) Then CMin′ and CMax′ may be determined so that TMin′=PQ′(CMin′) and TMax′=PQ′(CMax′). In step 520, as described in the '343 publication and/or the '139 Application, the dynamic range of an input image (507) is mapped to the target display range using a tone mapping curve. This steps assumes a default PQ curve (e.g., as defined in ST 2084), computed for a nearly dark environment. Its output will be intensity samples (In) in a tone-mapped image (522). Given a measure of ambient light (La), as determined in step 505, in step 525 a new ambient-light-corrected PQ curve (PQ′La) is computed, for example using equations (1-2). Given PQ, PQ′La, and the output of the tone-mapping step (520), step 530 computes new intensity values In′ as described in equations (3-6). These steps, as described earlier and also depicted in FIG. 5B, include: Determine CMin, CMax, CMin′, and CMax′ based on (TMin, TMax) or (TMin′, TMax′), and the PQ functions PQ( ) and PQ′La( ) (Step 530-a) Map each input codeword Ci in PQ( ) to a codeword Cj in PQ′La( ) according to a mapping criterion, e.g., to preserve image contrast according to equation (3) (Step 530-b) Determine PQ′La(Cj)=B (Step 530-c) Determine a new codeword Ck such that PQ(Ck)=PQ′La(Cj)=B (Step 530-d) if (In==Ci) then In′=Ck (Step 530-e) Given the new intensity values for a corrected tone-mapped image (532), the display management process (500) may continue as described in the '343 publication and/or the '139 Application, with such steps as: saturation adjustment (where the P and T components of the input signal are suitable adjusted), color gamut mapping (210), and color transformations (215). If screen reflectivity (Lr) was taken into consideration for the Ci to Ck codeword mapping, then in an embodiment, before displaying the image onto the target display, one should subtract the estimated screen reflectivity, otherwise the actual screen reflectivity will be added twice (first by equation (7), and second by the actual light on the display). This can be expressed as follows: Let, (e.g., after color gamut mapping (210)), under reflective light adjustment Lr, codeword Cm to be mapped to PQ(Cm); then Find codeword Cn such that PQ(Cn)=PQ(Cm)−Lr if (Io==Cm) then Io′=Cn, where Io denotes the output (212) of color gamut mapping and Io′ the adjusted output for screen reflectivity Lr under ambient light La. The ambient light corrected curve can be calculated using the steps described previously, or it can be calculated as a 2D LUT, with inputs being ambient light (505) and the original tone mapping curve (522). Alternately, a functional approximation of the ambient correction curve may be used, for example a cubic Hermite spline or polynomial approximation. Alternately, the parameters controlling the original curve can be modified to simultaneously perform the original tone mapping (507) and ambient corrected tone mapping (525) in a single step. In some embodiments, the ambient environment for generating the source image may also be known, in which case, one may perform a first PQ to PQ′ mapping for the source image and source viewing environment, then a second PQ to PQ′ mapping for the target image and target viewing environment. Example Computer System Implementation Embodiments of the present invention may be implemented with a computer system, systems configured in electronic circuitry and components, an integrated circuit (IC) device such as a microcontroller, a field programmable gate array (FPGA), or another configurable or programmable logic device (PLD), a discrete time or digital signal processor (DSP), an application specific IC (ASIC), and/or apparatus that includes one or more of such systems, devices or components. The computer and/or IC may perform, control, or execute instructions relating to ambient-light-corrected display management processes, such as those described herein. The computer and/or IC may compute any of a variety of parameters or values that relate to ambient-light-corrected display management processes described herein. The image and video embodiments may be implemented in hardware, software, firmware and various combinations thereof. Certain implementations of the invention comprise computer processors which execute software instructions which cause the processors to perform a method of the invention. For example, one or more processors in a display, an encoder, a set top box, a transcoder or the like may implement methods related to ambient-light-corrected display management processes as described above by executing software instructions in a program memory accessible to the processors. The invention may also be provided in the form of a program product. The program product may comprise any non-transitory medium which carries a set of computer-readable signals comprising instructions which, when executed by a data processor, cause the data processor to execute a method of the invention. Program products according to the invention may be in any of a wide variety of forms. The program product may comprise, for example, physical media such as magnetic data storage media including floppy diskettes, hard disk drives, optical data storage media including CD ROMs, DVDs, electronic data storage media including ROMs, flash RAM, or the like. The computer-readable signals on the program product may optionally be compressed or encrypted. Where a component (e.g. a software module, processor, assembly, device, circuit, etc.) is referred to above, unless otherwise indicated, reference to that component (including a reference to a “means”) should be interpreted as including as equivalents of that component any component which performs the function of the described component (e.g., that is functionally equivalent), including components which are not structurally equivalent to the disclosed structure which performs the function in the illustrated example embodiments of the invention. EQUIVALENTS, EXTENSIONS, ALTERNATIVES AND MISCELLANEOUS Example embodiments that relate to efficient ambient-light-corrected display management processes are thus described. In the foregoing specification, embodiments of the present invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. What is claimed is: 1. A method for adaptive display management with a computer, the method comprising: receiving one or more viewing environment parameters (505); receiving an effective luminance range for a target display (515); receiving an input image (507) comprising pixel values; generating a tone-mapped image (522) by mapping (520) with the computer intensity pixel values of the input image pixel values to intensity pixel values in the tone-mapped image, wherein generating the tone-mapped image is based on an original perceptually quantized (PQ) luminance mapping function and the effective luminance range of the display; generating a corrected PQ (PQ′) luminance mapping function (525) based on the one or more viewing environment parameters; generating a PQ-to-PQ′ mapping wherein a first codeword in the original PQ luminance mapping function is mapped to a second codeword in the corrected (PQ′) luminance mapping function according to the effective luminance range of the target display; generating an adjusted tone-mapped image (532) by mapping intensity values in the tone-mapped image (522) to intensity values in the adjusted tone-mapped image, wherein generating the adjusted tone-mapped image is based on the PQ-to-PQ′ mapping. 2. The method of claim 1, wherein the one or more viewing environment parameters comprise an ambient light luminance value; 3. The method of claim 1, wherein the one or more viewing environment parameters comprise an estimate of light reflectivity on the target display. 4. The method of claim 1, wherein the original PQ luminance mapping function comprises a function computed according to the SMPTE ST 2084 specification. 5. The method of claim 1, wherein the effective luminance range for the target display comprises a minimum display luminance value (TMin) and a maximum display luminance value (TMax). 6. The method of claim 1, wherein generating the corrected PQ (PQ′) luminance mapping function (525) based on the one or more viewing environment parameters comprises computing where Lk denotes the k-th step and mt denotes a detection threshold. 7. The method of claim 6, wherein Lo is approximately 10−6 nits and wherein S(L) denotes a contrast sensitivity function and A(La) is an ambient factor for an ambient light luminance value La. 8. The method of claim 1, wherein generating the PQ-to-PQ′ mapping comprises generating a mapping preserving the relative position of the first codeword within the effective luminance range for the target display. 9. The method of claim 8, wherein preserving the relative position of the first codeword within the effective just noticeable difference (JND) range for the target display comprises mapping the first codeword (Ci) to the second codeword (Cj) using linear interpolation. 10. The method of claim 9, wherein the PQ-to-PQ′ mapping comprises computing where Ci denotes the first codewod, Cj denotes the second codeword, CMin and CMax are based on the effective luminance of the target display under the original PQ luminance mapping and CMin′ and CMax′ are based on the effective luminance range of the target display under the corrected PQ luminance mapping. 11. The method of claim 10, wherein CMin, CMax, CMin′, and CMax′, are determined so that PQ(CMin)=PQ′(CMin)=TMin and PQ(CMax)=PQ′(CMax′)=TMax, wherein TMin and TMax denote respectively a minimum and a maximum display luminance value. 12. The method of claim 1, wherein generating the adjusted tone-mapped image comprises computing: if PQ(Ci) is mapped to PQ′(Cj) according to the PQ-to-PQ′ mapping, then codeword Ci is mapped to codeword Ck so that PQ(Ck)=PQ′(Cj); and if (In==Ci) then In′=Ck, where PQ(Ci) denotes the output of the original PQ luminance mapping function for the first codeword (Ci), PQ′(Cj) denotes the output of the corrected PQ mapping function for the second codeword (Cj), In denotes an intensity pixel value in the tone-mapped image, and In′ denotes a corresponding intensity pixel value in the adjusted tone-mapped image. 13. An apparatus comprising a processor and configured to perform the method recited in claim 1. 14. A non-transitory computer-readable storage medium having stored thereon computer-executable instruction for executing a method in accordance with claim 1.

2016-10-20

en

2017-04-27

US-201916654059-A

Back end of the line metal structure and method ABSTRACT Disclosed are embodiments of a back end of the line (BEOL) metal structure that includes, within a metal level, a metal via, which has at least eight sides and all interior angles at 135° or more, and a metal wire thereon. The metal wire and via include respective portions of a continuous conformal metal layer. A passivation layer coats the top surface of the metal layer. The metal via and the metal wire thereon can be in an upper metal level and can be made of one metal (e.g., aluminum or an aluminum alloy). The upper metal level can be above a lower metal level that similarly includes a metal via and metal wire thereon, but the metal used can be different (e.g., copper) and/or the shape of the via can be different (e.g., four-sided). Also disclosed herein are method embodiments for forming the above-described BEOL metal structure. BACKGROUND Field of the Invention The present invention relates to back end of the line (BEOL) metal structures and, more particularly, to embodiments of a BEOL metal structure including a metal wire and robust metal via and a method of forming the metal structure. Description of Related Art In conventional back end of the line (BEOL) processing, multiple metal levels (e.g., M0 to Mx) are formed on a semiconductor wafer above an active device layer (e.g., a semiconductor layer, such as a silicon layer). Each metal level includes one or more layers of interlayer dielectric (ILD) material and metal structures embedded within the ILD material. The metal structures can include, but are not limited to, passive metal devices (e.g., resistors and capacitors) and metal interconnect structures. The metal interconnect structures provide the electrical connections between on-chip devices and from on-chip devices to off-chip components (e.g., through input/output pins). The metal interconnect structures can include metal wires (also referred to herein as metal lines), which are oriented essentially parallel to the wafer surface (i.e., horizontally). The metal interconnect structures can also include metal vias, which are oriented essentially perpendicular to the wafer surface (i.e., vertically), are typically drawn square in shape (as viewed in a horizontal cross-section), and extend from the bottom of one metal line downward through ILD material layer(s) to the top of another metal line. Various different metal materials are known in the art for use in these BEOL interconnect structures including, but not limited to, copper and aluminum. Those skilled in the art will recognize that the deposition techniques employed during formation of such BEOL interconnect structures will vary depending upon the type of metal materials used. For example, the optimal technique currently employed for copper deposition is electroplating, whereas the optimal technique currently employed for aluminum deposition is a conformal deposition process. The different deposition techniques pose different challenges during manufacturing. SUMMARY Disclosed herein are embodiments of a back end of the line (BEOL) metal structure. The BEOL metal structure can include a BEOL metal level and, within the BEOL metal level, a metal via, which has at least eight sides and all interior angles at 135° or more, and a metal wire thereon. The metal via and the metal wire can include respective portions of the same continuous conformal metal layer. A passivation layer can coat the top surface of the metal layer. In some embodiments, this metal via and the metal wire thereon can be in an upper BEOL metal level and can be made of one type of metal (e.g., aluminum or an aluminum alloy). In some embodiments, the upper BEOL metal level can be above a lower BEOL metal level that similarly includes a metal via with eight or more sides and a metal wire thereon, but the metal used can be different (e.g., copper as opposed to aluminum or an aluminum alloy) and/or the shape of the via can be different (e.g., a four-sided metal via as opposed to an eight or more sided metal via). Also disclosed herein are method embodiments for forming the above-described BEOL metal structure. Specifically, disclosed herein are embodiments of a BEOL metal structure that includes a BEOL metal level. The BEOL metal level can include a dielectric layer (e.g., a single layer or multiple layers of interlayer dielectric (ILD) material). The dielectric layer can have a first surface and a second surface opposite the first surface. A metal via can extend through the dielectric layer from the second surface down to the first surface. The metal via can have at least eight sides and, more particularly, can have a shape with at least eight sides, where each interior angle at each junction between adjacent sides is at least 135°. For example, the shape of the metal via could be an octagon, a nonagon, a decagon, etc. A metal wire can be on the second surface of the dielectric layer and electrically connected to the metal via. As discussed in greater detail below with regard to the method embodiments, one or more of the process steps used to form the metal via and the metal wire can be performed concurrently including, but not limited to, a conformal metal deposition process. Thus, the metal via and the metal wire can have a shared metal layer and, more particularly, can include respective portions of a continuous conformal metal layer. That is, a first portion of the metal layer for the metal via with eight or more sides can line a via opening (which has eight or more sides, where each interior angle at each junction between adjacent sides is at least 135°) and a second portion of the metal layer for the metal wire can be above the second surface of the dielectric layer. A passivation layer can coat the top surface of the metal layer. Also disclosed herein are embodiments of a BEOL metal structure that includes multiple BEOL metal levels. The multiple BEOL metal levels can include a lower BEOL metal level and an upper BEOL metal level above the lower BEOL level. The lower BEOL metal level can include a lower dielectric layer (e.g., a single layer or multiple layers of ILD material) and, embedded in the lower dielectric layer, a first metal via having a first shape (e.g., a four-sided shape, such as a square shape or a rectangle shape; a round shape; etc.) and a first metal wire thereon. The first metal via and the first metal wire can be made with a first metal material (e.g., copper). The upper BEOL metal level can include an upper dielectric layer (e.g., a single layer or multiple layers of interlayer dielectric (ILD) material). The upper dielectric layer can have a first surface and a second surface opposite the first surface. The upper BEOL metal level can further include a second metal via with a second shape that is different from the first shape and that has at least eight sides, wherein each interior angle at each junction between adjacent sides is at least 135°. For example, the second shape of the second metal via can be an octagon shape, a nonagon shape, a decagon shape, etc. The second metal via can extend through the upper dielectric layer from the second surface down to the first surface. A second metal wire can be on the second surface of the upper dielectric layer and electrically connected to the second metal via. The second metal via and the second metal wire can have a shared metal layer and, more particularly, can include respective portions of a continuous conformal metal layer. The conformal metal layer can be a second metal material (e.g., aluminum or an aluminum alloy) that is different from the first metal material. Thus, the first metal via and first metal wire in the lower BEOL metal level are made of a different metal than the second metal via and the second metal wire of the upper BEOL metal level. A passivation layer can coat the top surface of the conformal metal layer in the upper BEOL metal level. Also disclosed herein are method embodiments for forming the above-described BEOL metal structure embodiments. The method can include forming a BEOL metal level. To form the BEOL metal level, a dielectric layer (e.g., a single layer or multiple layers of interlayer dielectric (ILD) material) can be formed. The dielectric layer can have a first surface and a second surface opposite the first surface. A via opening can be formed in the dielectric layer such that it extends from the second surface down to the first surface and such that it has a shape with at least eight sides, where each interior angle at each junction between adjacent sides is at least 135°. A metal via can be formed within this eight or more sided via opening and a metal wire can be formed on the second surface of the dielectric layer and electrically connected to the metal via. One or more of the process steps used to form the metal via and the metal wire can be performed concurrently including, but not limited to, a conformal metal deposition process (e.g., physical vapor deposition (PVD)) such that the metal via and the metal wire include respective portions of a continuous conformal metal layer. A passivation layer can subsequently be formed (e.g., by chemical vapor deposition (CVD)) so as to coat exposed surfaces of the metal layer. BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS The present invention will be better understood from the following detailed description with reference to the drawings, which are not necessarily drawn to scale and in which: FIGS. 1A and 1B are cross-section diagrams illustrating a prior art BEOL metal structure and FIG. 1C is a perspective diagram showing the relative locations of the different vertical cross-sections A-A and B-B and the shape of the metal via therein; FIGS. 2A and 2B are cross-section diagrams illustrating an embodiment of a BEOL metal structure 200; FIG. 2C is a perspective diagram showing an exemplary octagon shaped metal via within the BEOL metal structure of FIGS. 2A and 2B; FIG. 2D is a perspective diagram showing an optional square shaped metal via within the BEOL metal structure of FIGS. 2A and 2B; FIGS. 3A and 3B are cross-section diagrams illustrating another embodiment of a BEOL metal structure 300; FIG. 3C is a perspective diagram showing another exemplary octagon shaped metal via within the BEOL metal structure of FIGS. 3A and 3B; FIG. 3D is a perspective diagram showing an optional square shaped metal via within the BEOL metal structure of FIGS. 3A and 3B; FIG. 4 is a flow diagram illustrating method embodiments for forming BEOL metal structures; FIG. 5 is a cross-section diagram of a partially completed BEOL metal structure formed according to the flow diagram of FIG. 4; FIGS. 6A and 6B are cross-section diagrams illustrating a partially completed BEOL structure formed according to the flow diagram of FIG. 4 when forming the structure shown in FIGS. 2A-2C and FIG. 6C is a perspective diagram showing the relative locations of the different vertical cross-sections A-A and B-B and the shape of the via opening therein; FIGS. 7A and 7B are cross-section diagrams illustrating a partially completed BEOL structure formed according to the flow diagram of FIG. 4 when forming the structure shown in FIGS. 3A-3C and FIG. 7C is a perspective diagram showing the relative locations of the different vertical cross-sections A-A and B-B and the shape of the via opening therein; FIGS. 8A and 8B are cross-section diagrams illustrating a partially completed BEOL structure formed according to the flow diagram of FIG. 4 when forming the structure shown in FIGS. 2A-2C; FIGS. 9A and 9B are cross-section diagrams illustrating a partially completed BEOL structure formed according to the flow diagram of FIG. 4 when forming the structure shown in FIGS. 3A-3C; FIG. 10 is a cross-section diagram illustrating the BEOL metal structure 200 (or 300) wherein the conformal metal layer is thicker than the height of the metal layer; and FIGS. 11A-11C are horizontal cross-sections of alternative via shapes that could be incorporated into the disclosed BEOL metal structure and method embodiments. DETAILED DESCRIPTION As mentioned above, in conventional back end of the line (BEOL) processing, multiple metal levels (e.g., M0 to Mx) are formed on a semiconductor wafer above an active device layer (e.g., a semiconductor layer, such as a silicon layer). Each metal level includes one or more layers of interlayer dielectric (ILD) material and metal structures embedded within the ILD material. The metal structures can include, but are not limited to, passive metal devices (e.g., resistors and capacitors) and metal interconnect structures. The metal interconnect structures provide the electrical connections between on-chip devices and from on-chip devices to off-chip components (e.g., through input/output pins). The metal interconnect structures can include metal wires (also referred to herein as metal lines), which are oriented essentially parallel to the wafer surface (i.e., horizontally). The metal interconnect structures can also include metal vias, which are oriented essentially perpendicular to the wafer surface (i.e., vertically), are typically drawn square in shape (as viewed in a horizontal cross-section), and extend from the bottom of one metal line downward through ILD material layer(s) to the top of another metal line. Those skilled in the art will recognize that typically the dimensions (e.g., height and width) of the metal wires and the dimensions (e.g., height, width and depth) of the metal vias are generally smaller in lower metal levels than they are in the upper metal levels. Furthermore, due to optical proximity correction (OPC) processing, smaller vias (e.g., vias having a width that is less than 1 μm) in the lower metal levels often become rounded; however, this rounding effect disappears in larger vias (e.g., vias having a width that is greater than 1 μm) and the vias retain the square shape. Various different metal materials are known in the art for use in these BEOL interconnect structures including, but not limited to, copper and aluminum. Those skilled in the art will recognize that the deposition techniques employed during formation of such BEOL interconnect structures will vary depending upon the type of metal materials used. For example, the optimal technique currently employed for copper deposition is electroplating, whereas the optimal technique currently employed for aluminum deposition is a conformal deposition process. The different deposition techniques pose different challenges during manufacturing. For example, a metal material, such as aluminum, that is conformally deposited into a rectangular or square shaped via opening may bulge in the corners of that via opening. This bulging of the metal material can be the source of defects (e.g., pin holes) within passivation material that is subsequently deposited onto the metal. Pin holes in the passivation material allow for surface corrosion attacks on the metal to occur, thereby leading to defects that can result in yield loss and reliability issues for critical applications. More specifically, rectangular or square-shaped via opening(s) can be lithographically patterned and etched in the ILD material of a given BEOL metal level. Then, a thick conformal metal layer (e.g., a thick conformal aluminum or aluminum alloy layer) can be deposited over the ILD material such that each via opening is filled, thereby forming the metal via(s). Next, metal wire(s) can be formed by lithographically patterning and etching that portion of the conformal metal layer remaining on the top surface of the ILD material. One or more passivation layers can be formed over the metal wire(s) and additional ILD material can be deposited on the uppermost passivation layer, thereby completing the BEOL metal level and the metal interconnect structures therein. FIGS. 1A and 1B are different vertical cross-section diagrams A-A and B-B, respectively, illustrating an exemplary BEOL metal structure 100 formed using the above-described technique. FIG. 1C is a perspective diagram showing the relative locations of the different vertical cross-sections A-A and B-B. Referring to FIGS. 1A-1C in combination, the BEOL metal structure 100 includes a BEOL metal level and, within the BEOL metal level, a metal wire 115 and a metal via 110. The metal via 110 fills a via opening that extends essentially vertically downward from the bottom of the metal wire 115 through ILD material 101 (e.g., to another metal wire in a lower metal level below (not shown)). The metal wire 115 and metal via 110 include respective portions of a continuous conformal metal layer 116 (e.g., an aluminum or an aluminum alloy layer). One or more conformal passivation layers 117 is/are on the top surface of the conformal metal layer 116. Additional ILD material 101 (e.g., for the next metal level) is on the uppermost passivation layer 117. In this exemplary BEOL metal structure 100, the via opening has four sides 111, which are all of equal length (i.e., width (w)=depth (d)), and four 90° corners 112, as illustrated in FIG. 1C. That is, the via opening is essentially square in shape when viewed in a horizontal cross-section or top down. As mentioned above, smaller vias (e.g., vias having a width that is less than 1 μm) in the lower metal levels may become rounded during processing; however, larger vias (e.g., vias having a width that is greater than 1 μm) typically retain their square shape. In this exemplary BEOL metal structure 100, the conformal metal layer 116 has a thickness (t) that is approximately equal to or greater than the height (h) of the via opening. In this exemplary BEOL metal structure 100, each conformal passivation layer 117 is relatively thin as compared to the conformal metal layer 116, as illustrated in FIG. 1A. However, with this configuration, conformal deposition of the metal material for the conformal metal layer 116 can result in bulges (i.e., overhangs) 126 of metal material around the upper edges of the via opening primarily at the corners 112 where adjacent sides 111 meet and, as a result, divots 125 in the metal material (i.e., relatively thin portions of the metal material) in the corners below the bulges 126, respectively. Unfortunately, when the passivation layer(s) 117 are conformally deposited (e.g., by chemical vapor deposition (CVD)), full/uniform coverage of exposed surfaces of the conformal metal layer 116 within the divots 125 is difficult and pin hole(s) 127 may exist in the passivation material leaving some of the metal material exposed. If the surface of the conformal metal layer 116 is exposed by pin holes 127 during subsequent processing, surface corrosion can occur. The resulting metal via 110 will be prone to defects caused by surface corrosion and formation of metal vias with such defects can result in yield loss for critical applications. In view of the foregoing, disclosed herein are embodiments of a back end of the line (BEOL) metal structure. The BEOL metal structure can include a BEOL metal level and, within the BEOL metal level, a metal via with at least eight sides in a dielectric layer and a metal wire thereon. The metal via and the metal wire can include respective portions of the same continuous conformal metal layer. A passivation layer can completely coat the top surface of the metal layer. In some embodiments, this metal via with at least eight sides and the metal wire thereon can be in an upper BEOL metal level and can be made of one type of metal (e.g., aluminum or an aluminum alloy). In some embodiments, the upper BEOL metal level can be above a lower BEOL metal level that similarly includes a metal via and a metal wire thereon, but the metal used can be different (e.g., copper as opposed to aluminum or an aluminum alloy) and/or the shape of the via can be different (e.g., a via with four sides as opposed to a via with eight or more sides). Also disclosed herein are method embodiments for forming the above-described BEOL metal structure. Specifically, referring to FIGS. 2A-2D and 3A-3D, disclosed herein are embodiments of a BEOL metal structure 200 and 300, respectively. Each embodiment of the BEOL metal structure includes at least one BEOL metal level. For purposes of illustration, two BEOL metal levels are shown including a lower BEOL metal level (Ml) and an upper BEOL metal level (Mu) above the lower metal level. It should, however, be understood that the figures are not intended to be limiting. That is, embodiments of the BEOL metal structure can include one or more BEOL metal levels. Those skilled in the art will recognize that modern IC chips often include five or more BEOL metal levels. Each BEOL metal level can include a dielectric layer (e.g., a lower dielectric layer for the lower metal level (Ml) and an upper dielectric layer for the upper metal level (Mu)). The dielectric layer can include a single layer or multiple layers of interlayer dielectric material (ILD) 201, 301. This ILD material can be, for example, silicon oxide or any other suitable ILD material (e.g., borophosphosilicate glass (BPSG), tetraethyl orthosilicate (TEOS), fluorinated tetraethyl orthosilicate (FTEOS), etc.). Each BEOL metal level can further include metal interconnect structures embedded within the ILD material 201, 301. The metal interconnect structures can provide the electrical connections between on-chip devices and from on-chip devices to off-chip components (e.g., through input/output pins). The metal interconnect structures can include metal wires (also referred to herein as metal lines), which are oriented essentially parallel to the wafer surface (i.e., horizontally). The metal interconnect structures can also include metal vias, which are oriented essentially perpendicular to the wafer surface (i.e., vertically), and extend from the bottom of one metal line downward through ILD material to the top of another metal line. For example, see the first metal via 297, 397 and the first metal wire 298, 398 thereon in the lower BEOL metal level (Ml); see also the second metal via 210, 310 and the second metal wire 215, 315 thereon in the upper BEOL metal level (Mu). More specifically, at least one BEOL metal level (e.g., see the upper BEOL metal level (Mu)) can include a dielectric layer (e.g., one or more layers of ILD material 201, 301). The dielectric layer can have a first surface and a second surface opposite the first surface. The first surface can be the bottom surface of the dielectric layer and the second surface can be the top surface of the dielectric layer or, alternatively, the bottom surface of a wire trench within an upper portion of the dielectric layer (depending upon whether single damascene or, alternatively, dual damascene techniques are employed during processing, see detailed discussion below with regard to the method embodiments). In any case, a metal via 210, 310 can extend essentially vertically through the entire thickness of dielectric layer from the second surface down to the first surface and a metal wire 215, 315 can be on the second surface and electrically connected to the metal via 210, 310. The metal via 210, 310 can have at least eight sides (also referred to herein as sidewalls), where each interior angle (a) at each junction between adjacent sides is at least 135°. For example, the shape of the metal via 210, 310 when viewed from a horizontal cross-section could be an octagon (as illustrated in FIGS. 2C and 3C-2D), a nonagon, a decagon, etc. and this shape will be defined by the shape of a patterned via opening within which the metal via 210, 310 is formed during processing. It should be understood that for purposes of this disclosure, the width (w), the depth (d) and the dimension (c) of a metal via (or via opening) are all measured parallel to the first and second surfaces of the dielectric layer (i.e., parallel to the bottom of the substrate) with the width (w) being essentially perpendicular to the depth (d). The lengths of the sides of the metal via (or via opening) are also measured parallel to the first and second surfaces of the dielectric layer. Furthermore, the height (h) of a metal via (or via opening) is measured in a direction that is approximately perpendicular (e.g., plus or minus 10 degrees) to the first and second surfaces of the dielectric layer. Furthermore, each side of the via opening (and metal via therein) is an essentially planar (e.g., essentially flat) surface that lies (or “runs” or “extends”) in a plane that is approximately perpendicular (e.g., plus or minus 10 degrees) to the first and second surfaces of the dielectric layer through which the metal via extends. In other words, the sides of the metal via (or via opening) extend through the dielectric layer from one surface to the other in an essentially perpendicular direction to the dielectric layer. Generally, the embodiments of the BEOL metal structure 200 shown in FIGS. 2A-2D and the embodiments of the BEOL metal structure 300 shown in FIGS. 3A-3D both include a metal via with an octagonal shape. They different with respect to the type of octagonal shape, as discussed below. Specifically, the metal via 210 has a regular octagon shape, as illustrated in FIG. 2C. Thus, the lengths (l) of all sides 211 are equal. Given the equal lengths of the sides, the angle (α) at the junction between any two adjacent sides 211 is also equal and, more particularly, 135°. Thus, there are no sharp corners (e.g., no corners that are less than 135°) within the metal via 210. Furthermore, the distance between any two opposing sides 211 is equal such that the width (w), the depth (d) and a dimension (c) (which is in the direction of the cross-section B-B) of the metal via 210 are all equal. The metal via 310 has an isogonal octagon shape, as illustrated in FIG. 3C. In this case, the metal via 310 has alternating first sides 311 and second sides 312, where the first sides 311 have the same first length (l1) and the second sides 312 have the same second length (l2) that is less than the first length (l1). Such a metal via 310 resembles a square via except that the corners are chamfered (i.e., cropped or beveled). The angle (a) at the junction between any two adjacent sides 311-312 is equal (i.e., 135°). Thus, there are no sharp corners (e.g., corners that are less than 135°) within the metal via 310. Furthermore, the distance between any two opposing first sides 311 is equal and the distance between any two opposing second sides 312 is also be equal. Thus, the width (w) and the depth (d) of the metal via 310 are equal. However, given the different lengths l1 and l2 of the first and second sides, the dimension (c) of the metal via 310 (in the direction of the cross-section B-B) is greater than the width (w) and depth (d). In the disclosed BEOL metal structures, the width (w) and depth (d) of the metal via 210, 310 can each be at least four times its height (h). For example, the width (w) and depth (d) of the metal via 210, 310 can each be five times its height (h). Thus, the metal via 210, 310 has a relatively low aspect ratio of 1 to at least 4. Furthermore, in those embodiments where the metal via 310 has alternating first sides 311 with a first length (l1) and second sides 312 with a second length (l2) that is less than the first length (l1) (e.g., as shown in FIGS. 3A-3D), the second length (l2) of the second sides 312 of the metal via 310 can be equal to or greater than one-third the height (h) of the metal via 310. Optionally, the metal via 210, 310 can be tapered from the second surface of the dielectric layer down to the first surface (not shown). As mentioned above, the metal wire 215, 315 can be on the second surface of the dielectric layer 201, 301 and electrically connected to the metal via 210, 310. As discussed in greater detail below with regard to the method embodiments, one or more of the process steps used to form the metal via 210, 310 and the metal wire 215, 315 can be performed concurrently including, but not limited to, a conformal metal deposition process (e.g., a physical vapor deposition (PVD) process). Thus, the metal via 210, 310 and the metal wire 215, 315 can have a shared metal layer and, more particularly, can include respective portions of a continuous conformal metal layer 216, 316. That is, a first portion 216 a, 316 a of the metal layer 216, 316 for the metal via 210, 310 can line the via opening and a second portion 216 b, 316 b of the metal layer 216, 316 for the metal wire 215, 315 can be above the second surface of the dielectric layer. The metal layer 216, 316 can have a thickness (t), which is essentially uniform and which ranges between ⅓ the height (h) of the metal via 210, 310 and 5 times the height (h) of the metal via 210, 310. For example, in some embodiments, the metal layer 216, 316 can have a thickness (t) ranging from approximately 1 μm to approximately 3 μm. Additionally, in some embodiments, the metal via 210, 310 can have a height (h) ranging from approximately 700 nm to approximately 1600 nm. Thus, it should be understood that, although the thickness (t) of the metal layer 216, 316 is shown in FIGS. 2A-2B and 3A-3B as being less than the height (h) of the metal via 210, 310, the thickness (t) of the metal layer 216, 316 could, alternatively, be greater than the height (h) of the metal via 210, 310. In preferred embodiments, the thickness (t) of the metal layer 216, 316 is at least two-thirds the height of the metal via 210, 310. The metal layer 216, 316 can be, for example, aluminum or an aluminum alloy. For example, the metal layer can be an aluminum layer, an aluminum copper alloy layer, an aluminum silicon alloy layer, an aluminum silicon copper alloy layer, or any other suitable aluminum alloy layer. One or more passivation layers 217, 317 can completely coat at least the top surface 219, 319 of the metal layer 216, 316. For purposes of this disclosure, the “top surface” 219, 319 of the metal layer 216, 316 has horizontal portions above the second surface of the dielectric layer and bottom of the via opening and vertical portions connecting them. The passivation layer(s) 217, 317 can also coat sidewalls of the metal wire (not shown, for further details see the discussion of the method below). In any case, the passivation layers 217, 317 can include, for example, a silicon dioxide layer immediately adjacent to the top surface of the metal layer 216, 316 and a silicon nitride layer on the silicon dioxide layer. Although two passivation layers are shown in the drawings for the BEOL metal structures 200, 300, it should be understood that the figures are not intended to be limiting. Alternatively, the BEOL metal structures 200, 300 could include a single passivation layer or three or more passivation layers. It should be noted that, given the dimensions of the metal via 210, 310 (as defined by the via opening with eight or more sides within which the metal via is formed during processing and including the low aspect ratio, the avoidance of sharp corners, and the lengths of the sides relative to the height), given the thickness of the metal layer 216, 316 relative to the height of that via opening, and further given the metal layer deposition technique employed during processing (e.g., PVD), the metal layer 216, 316 in the BEOL metal structure 200, 300 is devoid of significant bulges (i.e., overhangs) around the upper edges of the metal via and, thus, is devoid of any divots (i.e., thin portions that are overshadowed by bulging or overhanging metal material) and, as a result, the passivation layers 217, 317 are deposited such that they completely cover the top surface of the metal layer 216, 316 and the metal layer 216, 316 is protected against surface corrosion. As mentioned above, optionally, the lower BEOL metal level (Ml) can include a first metal via 297, 397 and a first metal wire 298, 398 thereon and the upper BEOL metal level (Mu) can be above the lower BEOL metal level (Ml) can include a second metal via 210, 310 (which has at least eight sides, where each interior angle at each junction between adjacent sides is at least 135°) and a second metal wire 215, 315 thereon. For example, the second metal via 210, 310 can extend essentially vertically between and can electrically connect the second metal wire 215, 315 and the first metal wire 298, 398, as illustrated. Optionally, the first metal via 297, 397 and first metal wire 298, 398 can be configured essentially the same as the second metal via 210, 310 and second metal wire 215, 315, respectively. Alternatively, the first metal via 297, 397 and first metal wire 298, 398 can be configured differently than the second metal via 210, 310 and second metal wire 215, 315, respectively. For example, the first metal via 297, 397 and first metal wire 298, 398 can be made of a first metal material (e.g., copper) and the second metal via 210, 310 and second metal wire 215, 315 can be made of a second metal material that is different from the first metal material (e.g., aluminum or an aluminum alloy, such as an aluminum copper alloy, an aluminum silicon alloy or an aluminum silicon copper alloy). Additionally or alternatively, the first metal via 297, 397 may have a first shape and the second metal via 210, 310 may have a second shape, which is different from the first shape. For example, the first shape of the first metal via 297, 397 may have four sides such that it has a rectangular or square shape (e.g., see the horizontal cross-sections shown in FIGS. 2D and 3D). Alternatively, the first shape of the first metal via 297, 397 may have four sides with rounded corners, may be round, may be oval, etc. (not shown). The second shape of the second metal via 210, 310 can, as discussed above, have at least eight sides, where each interior angle (a) at each junction between adjacent sides is at least 135°. For example, as illustrated, the second shape can be an octagon shape. It should be noted that BEOL metal structure 200, 300 can further include additional layers, which are not shown in the figures in order to avoid clutter and to allow the reader to focus on the salient aspects of the disclosed structure embodiments. The additional layers can include, but are not limited to, diffusion barrier and/or adhesion layers that physically separate the metal vias and metal wires from adjacent dielectric surfaces. For example, the diffusion barrier and/or adhesion layers can line the via openings and cover the top surface of the dielectric layers containing the via openings. For aluminum or aluminum alloy metal vias and metal wires, the diffusion barrier and adhesion layers can include, for example, thin layers of titanium and titanium nitride or any other suitable diffusion barrier and adhesion layers. For copper metal vias and metal wires, the diffusion barrier and adhesion layers can include, for example, thin layers of tantalum nitride and tantalum or any other suitable diffusion barrier and adhesion layers. Referring to the flow diagram of FIG. 4, disclosed herein are method embodiments for forming BEOL metal structures, such as the BEOL metal structure 200 of FIGS. 2A-2D or 300 of FIGS. 3A-3D. The method embodiments can include forming a BEOL metal level (e.g., an upper BEOL metal level (Mu)). This BEOL metal level can be formed, for example, over a previously formed lower BEOL metal level (Ml). To form the BEOL metal level, a dielectric layer (e.g., a single layer or multiple layers of interlayer dielectric (ILD) material 201, 301) can be formed (e.g., on the lower BEOL metal level (Ml)) (see FIG. 5 and process step 402 of FIG. 4). The dielectric layer can have a first surface adjacent to the lower BEOL metal level and a second surface opposite the first surface. Single damascene processing (or, alternatively, dual damascene processing) can be performed in order to form a metal via 210, 310 in the dielectric layer and a metal wire 215, 315 thereon. For purposes of illustration, the method embodiments are described herein and illustrated in the drawings with respect to single damascene processing. Specifically, a via opening 610, 710 can be patterned (e.g., lithographically or otherwise) and etched into the dielectric layer such that it extends essentially vertically from the second surface down to the first surface (see FIGS. 6A-6C or, alternatively, FIGS. 7A-7C and process step 404). In the disclosed method embodiments, the via opening 610 can be patterned and etched at process step 404 so as to have a shape with at least eight sides, where each interior angle (a) at each junction between adjacent sides is at least 135° (e.g., an octagonal shape (as shown), a nonagon shape, a decagon shape, etc.). It should be understood that FIGS. 7A-7C differ from FIGS. 6A-6C only with respect to the different octagonal shapes of the via openings 610, 710. For example, the via opening 610 can be patterned and etched at process step 404 so as to have a regular octagon shape, as illustrated in FIG. 6C. In this case, the lengths (1) of all sides 611 of the via opening 610 are equal. Given the equal lengths of the sides 611, the angle (a) at the junction between any two adjacent sides 611 are also equal and, more particularly, are 135°. Thus, there are no sharp corners (e.g., no corners that are less than 135°) within the via opening. Furthermore, the distance between any two opposing sides 611 are equal such that the width (w), the depth (d) and a dimension (c) (which is in the direction of the cross-section B-B) of the via opening 610 are all equal. Alternatively, the via opening 710 can be patterned and etched at process step 404 so as to have an isogonal octagon shape, as illustrated in FIG. 7C. That is, the via opening 710 has alternating first sides 711 and second sides 712, where the first sides 711 have the same first length (0 and the second sides 712 have the same second length (l2) that is less than the first length (h). Such a via opening 710 resembles a square via opening except that the corners are chamfered (i.e., cropped or beveled). The angle (a) at the junction between any two adjacent sides 711-712 is equal (i.e., 135°). Thus, there are no sharp corners (e.g., corners that are less than 135°) within the via opening 710. Furthermore, the distance between any two opposing first sides 711 is equal and the distance between any two opposing second sides 712 is also equal. Thus, the width (w) and the depth (d) of the via opening 710 are equal. However, given the different lengths l1 and l2 of the first and second sides, the dimension (c) of the via opening 710 (in the direction of the cross-section B-B) is greater than the width (w) and depth (d). In any case, the via opening 610, 710 can be patterned and etched at process step 404 such that the width (w) and depth (d) of the via opening 610, 710 are each at least four times its height (h). For example, in some embodiments, the via opening 610, 710 can be patterned and etched so that the width (w) and depth (d) are each five times the height (h). Thus, the via opening 610, 710 has a relatively low aspect ratio of 1 to at least 4. Furthermore, in those embodiments where the via opening 710 has been patterned and etched so as to have alternating first sides 711 with a first length (l1) and second sides 712 with a second length (l2) that is less than the first length (l1) (e.g., as shown in FIGS. 3A-3D), the second length (l2) of the second sides 712 of the via opening 710 can be equal to or greater than one-third the height (h) of the via opening 710. Optionally, the via opening 610, 710 can be etched such that it is tapered from the second surface of the dielectric layer down to the first surface (not shown). It should be understood that for purposes of this disclosure, the width (w), the depth (d) and the dimension (c) of the via opening 610, 710 are all measured parallel to the first and second surfaces of the dielectric layer (i.e., parallel to the bottom of the substrate) with the width (w) being essentially perpendicular to the depth (d). The lengths of the sides of the via opening are also measured parallel to the first and second surfaces of the dielectric layer. Furthermore, the height (h) of the via opening is measured in a direction that is approximately perpendicular (e.g., plus or minus 10 degrees) to the first and second surfaces of the dielectric layer. Furthermore, each side of the via opening can be an essentially planar (e.g., essentially flat) surface that lies (or “runs” or “extends”) in a plane that is approximately perpendicular (e.g., plus or minus 10 degrees) to the first and second surfaces of the dielectric layer through which the metal via extends. In other words, the sides of the metal via (or via opening) extend through the dielectric layer from one surface to the other in a perpendicular direction to the dielectric layer. Furthermore, after the via opening 610, 710 is formed, diffusion barrier and/or adhesion layers (not shown) can optionally be deposited onto the second surface of the dielectric layer and further lining the via opening (see process step 406). Those skilled in the art will recognize that the optimal diffusion barrier and/or adhesion layers will vary depending upon the metal material that will subsequently be deposited at process step 408. For example, for aluminum or aluminum alloy metal vias and metal wires, the diffusion barrier and adhesion layers can include, for example, thin layers of titanium and titanium nitride or any other suitable diffusion barrier and adhesion layers. Next, a conformal metal deposition process can be performed so as to deposit a conformal metal layer 216, 316 on the diffusion barrier and/adhesion layers (if present) adjacent to the second surface of the dielectric layer and further lining the via opening 610, 710 (see FIGS. 8A-8B or, alternatively, FIGS. 9A-9B and process step 408). The process of lining the eight-sided via opening 610, 710 with a portion of the metal layer 216, 316 effectively forms an eight-sided metal via 210, 310. It should be understood that FIGS. 9A-9B differ from FIGS. 8A-8B only with respect to the different octagonal shapes of the via openings 610, 710. In any case, the conformal metal layer 216, 316 can be deposited at process step 408 such that it has a thickness (t) that is ⅓ to five times the height (h) of the via opening 610, 710 and, preferably, at least ⅔ or more times the height (h) of the via opening 610, 710. For example, in some embodiments, the ILD material 201, 301 can have a thickness (t) that ranges from approximately 700 nm to approximately 1600 nm such that the via opening etched there through at process 404 has a height (h) ranging from approximately 700 nm to approximately 1600 nm. Additionally, in some embodiments, the metal layer 216, 316 can be deposited at process step 408 so as to have a thickness (t) ranging from approximately 1 μm to approximately 3 μm. Thus, it should be understood that, although the thickness (t) of the metal layer 216, 316 is shown in FIGS. 8A-8B and 9A-9B as being less than the height (h) of the metal via 210, 310, the thickness (t) of the metal layer 216, 316 could, alternatively, be greater than the height (h) of the metal via 210, 310. The conformal metal layer 216, 316 can be deposited at process step 408 by, for example, physical vapor deposition (PVD). The conformal metal layer 216, 316 that is deposited at process step 408 can be an aluminum layer or, alternatively, an aluminum alloy layer (e.g., an aluminum copper alloy layer, an aluminum silicon alloy layer or an aluminum silicon copper alloy layer). It should be noted that, given the dimensions of the eight-sided via opening 610, 710 (including the low aspect ratio, the avoidance of sharp corners, and the lengths of the sides relative to the height), given the thickness of the metal layer 216, 316 relative to the height (h) of the via opening 610, 710, and further given the metal layer deposition technique employed during processing (e.g., PVD), the metal layer 216, 316 in the partially completed structure following process step 408 will be devoid of significant bulges (i.e., overhangs) extending around the upper edges of the via opening and, thus, devoid of divots that are overshadowed by bulging metal material. Following metal layer deposition at process step 408, the portion of the metal layer 216, 316 on the second surface of the dielectric layer can be patterned (e.g., lithographically or otherwise) and etched to form a metal wire 215, 315 that is electrically connected to the metal via 210, 310 (see process step 410). Thus, the metal via 210, 310 and the metal wire 215, 315 include respective portions of a continuous conformal metal layer 216, 316. Those skilled in the art will recognize that, alternatively, dual damascene processing can be performed. In this case, both a wire trench and a via opening can be lithographically patterned and etched into the dielectric layer. The dimensions of the via opening can be essentially the same as those described above and illustrated in the drawings. In this case, metal layer deposition concurrently forms a metal via in the via opening and a metal wire in the wire trench and a chemical mechanical polishing (i.e., CMP) process can be performed in order to remove any metal material that remains outside the wire trench and via opening. Thus, the lithographic patterning and etch processes performed at process step. Next, one or more passivation layers 217, 317 can be conformally deposited so as to coat exposed surfaces of the metal layer 216, 316 (see process step 412 and FIGS. 2A-2D or 3A-3D). The passivation layers 217, 317 can be deposited one after the other (e.g., by CVD) and can include, for example, a silicon dioxide layer immediately adjacent to the exposed surfaces (including the exposed top surface including exposed horizontal surfaces as well as any exposed essentially vertical surfaces created conformal deposition into the via opening and, if applicable, any exposed sidewalls of the metal layer 216, 316 following wire patterning) and a silicon nitride layer on the silicon dioxide layer. Although two passivation layers are shown in the drawings as being deposited at process step 412, it should be understood that the figures are not intended to be limiting. Alternatively, a single passivation layer or three or more passivation layers could be deposited onto the metal layer at process step 412. It should be noted that because the metal layer 216, 316 is devoid of bulges (i.e., overhangs) around the upper edges of the octagon-shaped via opening, the passivation layers 217, 317 can be deposited such that they completely cover the exposed surfaces of the metal layer 216, 316. In other words, the passivation layer(s) can be deposited without the formation of pinholes therein that would leave surfaces of the metal exposed. Thus, the method forms a BEOL metal structure 200, 300 where the metal layer 216, 316 of the metal via 210, 310 and metal wire 215, 315 thereon are fully protected against surface corrosion. Following formation of the passivation layer(s) 217, 317, an additional dielectric layer (e.g., a single layer or multiple layers of ILD material 201, 301) can be deposited onto the uppermost passivation layer 217, 317 (see process step 414 and FIGS. 2A-2D or 3A-3D). As mentioned above, the BEOL metal level with the eight or more sided metal via 210, 310 and metal wire 215, 315 thereon can be an upper BEOL metal level (Mu) that is formed, for example, over a previously formed lower BEOL metal level (Ml). Thus, the method can also include, before forming the upper BEOL metal level (Mu), forming the lower BEOL metal level (Ml). Forming the lower BEOL metal level (Ml) can include forming a metal via 297, 397 and a metal wire 298, 398 thereon. The metal via 297, 397 and metal wire 298, 398 of the lower BEOL metal level can be formed in the same manner as described above with respect to the metal via 210, 310 and metal wire 215, 315, respectively, of the upper BEOL metal level. Alternatively, the metal via 297, 397 and metal wire 298, 398 can be formed differently. That is, the metal via 297, 397 and metal wire 298, 398 of the lower BEOL metal level can be formed using a different metal than that used in the upper BEOL metal level (e.g., copper as opposed to aluminum or an aluminum alloy). Additionally or alternatively, the metal via 297, 397 and metal wire 298, 398 of the lower BEOL metal level can be made using a different metal deposition technique than that used in the upper BEOL metal level (e.g., electroplating as opposed to PVD). Additionally or alternatively, the metal via 297, 397 can be formed so as to have a different shape than the metal via 210, 310. For example, the first shape of the first metal via 297, 397 may have four sides such that it has a rectangular or square shape (e.g., see the horizontal cross-sections shown in FIGS. 2D and 3D). Alternatively, the first shape of the first metal via 297, 397 may have four sides with rounded corners, may be round, may be oval, etc. (not shown). As mentioned above, the metal layer 216, 316 in the disclosed structure and method is shown as having a thickness (t) that is less than the height (h) of the metal via 210, 310; however, it is anticipated that the thickness (t) can range between ⅓ and 5 times the height (h) of the metal via 210, 310. FIG. 10 is a cross-section diagram illustrating the BEOL metal structure 200 (or, alternatively, 300) if/when when a relatively thick metal layer 216, 316 is used. As illustrated, even with the relatively thick metal layer 216, 316, given the dimensions of the eight-sided via opening (including the low aspect ratio, the avoidance of sharp corners, and the lengths of the sides relative to the height), given the thickness of the metal layer 216, 316 relative to the height (h) of the via opening, and further given the metal layer deposition technique employed during processing the upper edges of the via opening and, thus, devoid of divots (i.e., thin portions that are overshadowed by bulging or overhanging metal material) and, as a result, the passivation layers 217, 317 are deposited such that they completely cover the top surface of the metal layer 216, 316 and the metal layer 216, 316 is protected against surface corrosion. It should be noted that in the disclosed BEOL metal structure and method embodiments, which are described above and illustrated in drawings, the via opening is patterned and etched so as to have an octagon shape (when viewed in horizontal cross-section) such that the resulting metal via 210, 310, which is formed in the via opening, has the same octagon shape. However, as mentioned above, in the disclosed BEOL metal structure and method embodiments, the via opening (and, thereby the metal via) could have any suitable shape that has at least eight sides, where the interior angle (α) at each junction between adjacent sides is at least 135°. Thus, for example, other BEOL metal structure and method embodiments could include a via opening (and thereby a metal via) with an octagon shape (i.e., an eight-sided shape) where the width and depth are different such that a horizontal cross-section of the via opening resembles an elongated rectangle with chamfered corners (see FIG. 11A). Other BEOL metal structure and method embodiments could include a via opening (and thereby a metal via) with more than eight sides. For example, the via opening (and thereby the metal via) could have a nonagon shape, where each interior angle (α) at each junction between adjacent sides is 140°, as shown in FIG. 11B; the via opening (and thereby the metal via) could have a decagon shape, where each interior angle (α) at each junction between adjacent sides is is 144°, as shown in FIG. 11C; etc. It should be understood that the terminology used herein is for the purpose of describing the disclosed structures and methods and is not intended to be limiting. For example, as used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. Additionally, as used herein, the terms “comprises” “comprising”, “includes” and/or “including” specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Furthermore, as used herein, terms such as “right”, “left”, “vertical”, “horizontal”, “top”, “bottom”, “upper”, “lower”, “under”, “below”, “underlying”, “over”, “overlying”, “parallel”, “perpendicular”, etc., are intended to describe relative locations as they are oriented and illustrated in the drawings (unless otherwise indicated) and terms such as “touching”, “in direct contact”, “abutting”, “directly adjacent to”, “immediately adjacent to”, etc., are intended to indicate that at least one element physically contacts another element (without other elements separating the described elements). The term “laterally” is used herein to describe the relative locations of elements and, more particularly, to indicate that an element is positioned to the side of another element as opposed to above or below the other element, as those elements are oriented and illustrated in the drawings. For example, an element that is positioned laterally adjacent to another element will be beside the other element, an element that is positioned laterally immediately adjacent to another element will be directly beside the other element, and an element that laterally surrounds another element will be adjacent to and border the outer sidewalls of the other element. The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. 1. A structure comprising: a dielectric layer; and a metal level comprising a metal via that extends through the dielectric layer and has a shape with at least eight sides, wherein within the shape each interior angle at a junction between adjacent sides is at least 135°; a metal wire on the dielectric layer and electrically connected to the metal via, wherein the metal wire and the metal via comprise respective portions of a continuous metal layer above the dielectric layer and further lining a via opening in the dielectric layer; and at least one passivation layer coating a top surface the metal layer, wherein each passivation layer is thinner than the metal layer. 2. The structure of claim 1, wherein the dielectric layer has a first thickness and the metal layer has a second thickness that is less than the first thickness, wherein the dielectric layer has a first surface and a second surface opposite the first surface, and wherein the metal layer is devoid of bulges around edges of the via opening at the second surface of the dielectric layer such that the at least one passivation layer completely coats a top surface of the metal layer both above the dielectric layer and within the via opening. 3. The structure of claim 1, wherein all of the at least eight sides of the metal via have equal lengths. 4. The structure of claim 1, wherein the at least eight sides comprise alternating first sides and second sides, and wherein the first sides have a first length and the second sides have a second length that is less than the first length. 5. The structure of claim 4, wherein the second length is at least one-third a height of the metal via. 6. The structure of claim 1, wherein the metal via has an aspect ratio of one to at least four. 7. The structure of claim 1, wherein the dielectric layer comprises interlayer dielectric material comprising any of borophosphosilicate glass, tetraethyl orthosilicate, and fluorinated tetraethyl orthosilicate, and wherein the metal layer comprises any of aluminum and an aluminum alloy. 8. A structure comprising: interlayer dielectric material; and multiple metal levels comprising metal interconnect structures embedded in the interlayer dielectric material, wherein the metal levels comprise at least: a lower metal level comprising a first metal via and a first metal wire on the first metal via, wherein the first metal via has a first shape; and an upper metal level above the lower metal level and comprising: a dielectric layer of the interlayer dielectric material, wherein the dielectric layer has a first thickness, a first surface immediately adjacent to the first metal wire, and a second surface opposite the first surface; a second metal via extending through the dielectric layer from the second surface to the first surface and in contact with the first metal wire, wherein the second metal via has a second shape that is different from the first shape, wherein the second shape has at least eight sides, and wherein within the second shape, each interior angle at a junction between adjacent sides is at least 135°; a second metal wire on the second surface of the dielectric layer and electrically connected to the second metal via, wherein the second metal wire and the second metal via comprise respective portions of a continuous metal layer above the dielectric layer and lining a via opening in the dielectric layer, wherein the continuous metal layer has a second thickness that is less than the first thickness, and wherein the first metal via and the first metal wire in the lower metal level comprise a first metal material and the second metal via and the second metal wire in the upper metal level comprise a second metal material that is different from the first metal material; a first passivation layer coating a top surface of the metal layer both above the dielectric layer and within the via opening; and a second passivation layer on the first passivation layer, wherein the first passivation layer and the second passivation layer are each thinner than the metal layer and wherein another dielectric layer of the interlayer dielectric material is on the second passivation layer. 9. The structure of claim 8, wherein the metal layer is devoid of bulges around edges of the via opening at the second surface of the dielectric layer such that the first passivation layer completely coats the top surface of the metal layer. 10. The structure of claim 8, wherein the at least eight sides of the second metal via have equal lengths. 11. The structure of claim 8, wherein the at least eight sides of the second metal via comprise alternating first sides and second sides, and wherein the first sides have a first length and the second sides have a second length that is less than the first length. 12. The structure of claim 11, wherein the second length is at least one-third a height of the second metal via. 13. The structure of claim 8, wherein the second metal via has an aspect ratio of 1 to at least four. 14. The structure of claim 8, wherein the interlayer dielectric material comprising any of borophosphosilicate glass, tetraethyl orthosilicate, and fluorinated tetraethyl orthosilicate, wherein the first passivation layer comprises silicon dioxide layer, wherein the second passivation layer comprises silicon nitride, and wherein the first metal material comprises copper and the second metal material comprises any of aluminum and an aluminum alloy. 15. A method comprising: forming multiple metal levels comprising metal interconnect structures embedded in interlayer dielectric material, wherein the forming of the multiple metal levels comprises: forming a lower metal level comprising a first metal via and a first metal wire on the first metal via, wherein the first metal via has a first shape; and forming an upper metal level above the lower metal level, wherein the upper metal level comprises: a dielectric layer of the interlayer dielectric material, wherein the dielectric layer has a first thickness, a first surface immediately adjacent to the first metal wire, and a second surface opposite the first surface; a second metal via extending through the dielectric layer from the second surface to the first surface and in contact with the first metal wire, wherein the second metal via has a second shape that is different from the first shape, wherein the second shape has at least eight sides, and wherein, within the second shape, each interior angle at a junction between adjacent sides is at least 135°; a second metal wire on the second surface of the dielectric layer and electrically connected to the second metal via, wherein the second metal wire and the second metal via comprise respective portions of a continuous metal layer above the dielectric layer and lining a via opening in the dielectric layer, wherein the continuous metal layer has a second thickness that is less than the first thickness, and wherein the first metal via and the first metal wire in the lower metal level comprise a first metal material and the second metal via and the second metal wire in the upper metal level comprise a second metal material that is different from the first metal material; a first passivation layer coating a top surface of the metal layer both above the dielectric layer and within the via opening; and a second passivation layer on the first passivation layer, wherein the first passivation layer and the second passivation layer are each thinner than the metal layer and wherein another dielectric layer of the interlayer dielectric material is on the second passivation layer. 16. The method of claim 15, wherein the forming of the upper metal level comprises forming the via opening in the dielectric layer and wherein the forming of the via opening comprises forming the via opening with eight sides and such that all sides having equal lengths. 17. The method of claim 15, wherein the forming of the upper metal level comprises forming the via opening in the dielectric layer and wherein the forming of the via opening comprises forming the via opening with eight sides, with alternating first sides with a first length and second sides with a second length that is less than the first length, and wherein the second length is at least one-third a height of the metal via. 18. The method of claim 15, wherein the forming of the upper metal level comprises forming the via opening in the dielectric layer and wherein the forming of the via opening is performed such that the via opening has an aspect ratio of one to at least four. 19. The method of claim 18, wherein the metal layer is conformally deposited by physical vapor deposition so as to be devoid of bulges around edges of the via opening at the second surface of the dielectric layer and the first passivation layer is formed by chemical vapor deposition so as to completely coat the top surface of the metal layer. 20. The method of claim 15, wherein the interlayer dielectric material comprising any of borophosphosilicate glass, tetraethyl orthosilicate, and fluorinated tetraethyl orthosilicate, wherein the first passivation layer comprises silicon dioxide layer, wherein the second passivation layer comprises silicon nitride layer, and wherein the first metal material comprises copper and the second metal material comprises any of aluminum and an aluminum alloy.

2019-10-16

en

2021-04-22

US-201816121154-A

Permeable surface covering units and permeable surface covering ABSTRACT A permeable surface covering unit comprises a top surface and at least two pairs of irregularly shaped mating sides, one or more passageways extending downwardly from the top surface, and at least one under channel connected to the passageways for retaining liquid, such as storm water. The sides of the unit preferably define an irregular rotational tessellation element. The passageways may comprise gaps or side cavities between units and/or core cavities or other passageways within the unit. Optional undercuts may be provided in the core cavities. Pervious material plugs are cast into the cavities extending into the channel or undercut. Thereby the plug is locked into the cavity like a rivet and resists being dislodged by mechanical or hydraulic forces. A permeable surface embodiment comprises a combination of pervious and impervious units, wherein the ratio of permeable to impermeable units and resulting surface absorption rate may be adjusted. PRIORITY CLAIM This application is a continuation of U.S. Ser. No. 15/443,105, filed Feb. 27, 2017, which is a divisional application of U.S. Ser. No. 14/105,679, filed Dec. 13, 2013, which claims priority of U.S. Provisional Application Ser. No. 61/737,452, filed Dec. 14, 2012. FIELD OF THE INVENTION The subject disclosure relates to permeable and pervious pavers, patio stones, and other building unit blocks for covering a surface that permit a movement of liquid, such as rain water, through and/or around the blocks of the surface. BACKGROUND OF THE INVENTION It is well known to construct permeable or pervious surface coverings to provide a solid ground surface and yet allow water to filter through the surface covering into the ground or into a sub-base water storage, retention, or drainage system. Pervious surface coverings and structures are conventionally constructed of manufactured pavers, bricks or other similar units. Manufactured units are typically provided in various geometric shapes, such as squares and rectangles. Surfaces covered with the manufactured units typically are laid in repeating and easily recognizable patterns. Some pervious surfaces coverings, such as parking lots and the like are required to withstand mechanical forces from vehicular traffic and snow plows, and/or hydraulic forces such as water pressure. Conventional permeable surface coverings have achieved varying degrees of success in terms of water retention capacity, structural integrity, durability and aesthetic appeal. SUMMARY OF THE INVENTION An embodiment of the invention provides a permeable surface covering unit that comprises a top surface, at least two pairs of irregularly shaped mating sides, at least one channel for retaining liquid, and at least one passageway for conveying liquid from the unit top surface to the channel. The channel is preferably located on the bottom of the unit. The passageway in one embodiment is defined between spacers on the sides of the unit. The sides of the unit preferably define a rotational tessellation element, but other forms of tessellations, including glides and combination glides and rotations can be used. In another embodiment of the invention, a permeable surface covering unit comprises a top surface, a bottom surface and at least two pairs of sides. The unit includes at least one core cavity having side walls and extending from the unit top surface to the unit bottom surface. At least one channel is provided in the bottom of the unit or alternatively an undercut is formed in at least one of the side walls of the cavity. A pervious material plug is cast into and at least partially fills the cavity and slumps into the channel or undercut. Thereby the plug is locked into the cavity like a rivet, and thereby resists being dislodged by mechanical or hydraulic forces. A permeable surface covering embodiment is provided comprising a plurality of units, each unit having top surface and at least two pairs of irregularly shaped sides. The irregularly shaped sides of adjacent units in the surface covering engage and interlock with each other. At least a portion of the units have at least one cavity, preferably plural side cavities. The side cavities of adjacent units in the surface covering align to form larger cavities. Pervious material plugs are secured within at least a portion of the cavities in the surface covering. In a preferred surface covering embodiment, at least a portion of the units include a bottom channel extending from side to side of the unit and intersecting with the side cavities. In a more preferred embodiment the bottom channels in a plurality of adjacent units align with one another such that liquid can be conveyed through the aligned channels below the surface to a cistern, storm drain or other sub-surface water storage/conveyance system. Optionally, the side channels can include locking slots, and stakes or rods may be driven through the slots to laterally secure the units in position. The embodiments of the invention provide an improved permeable surface covering units and permeable surface covering systems achieving one or more of the objects of enhanced water retention capacity, structural integrity, durability and aesthetic appeal. The foregoing and other aspects and features of the disclosure will become apparent to those of reasonable skill in the art from the following detailed description, as considered in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1A is a perspective view of a first embodiment of a permeable surface covering unit. FIG. 1B is a top plan view thereof. FIG. 2A is a side view thereof. FIG. 2B is side view of showing an alternate channel configuration. FIG. 3A is a plan view of a partial permeable surface covering of the first embodiment. FIG. 3B shows a mold box for manufacturing units of the first embodiment. FIG. 4A is a plan view of an alternate version of a permeable surface covering of the first embodiment. FIG. 4B shows a mold box for manufacturing units shown in FIG. 4A. FIG. 5A is a plan view of a partial permeable surface covering of the second embodiment. FIG. 5B shows a mold box for manufacturing units shown in FIG. 5A. FIG. 6 is a partial cross-section taken along line 6-6 of FIG. 5A. FIG. 7 is a plan view of a permeable surface covering of a third embodiment. FIG. 8 is a partial cross-section taken along line 8-8 of FIG. 7. FIG. 9 is a plan view of a permeable surface covering of a fourth embodiment. FIG. 10 is an exploded partial perspective view of a locking slot of the fourth embodiment. FIG. 11 is a partial cross-section taken along line 11-11 of FIG. 9. FIG. 12 is a perspective view of a fifth embodiment of a permeable surface covering unit. FIG. 13 is a cross-section taken along line 13-13 of FIG. 12. FIG. 14 is a perspective view of an alternate version of the fifth embodiment of a permeable surface covering unit showing the unit without a pervious plug. FIG. 15 is a cross-section of the unit of FIG. 14 but with the pervious plug in place. FIG. 16 is a surface covering of the fifth embodiment. FIG. 17A is a perspective view of a sixth embodiment of a permeable surface covering unit. FIG. 17B is a surface covering of the sixth embodiment. FIG. 18 is a perspective view of a seventh embodiment of a permeable surface covering unit. FIG. 19 is a cross-section taken along line 19-19 of FIG. 18. FIG. 20 is a cross-section taken along line 20-20 of FIG. 18. FIG. 21 is a top plan view of the seventh embodiment of a permeable surface covering unit. FIG. 22 is a partial perspective view of an alternative, key-hole shaped locking slot. FIG. 23 is a partial perspective view of an alternative, “T” shaped locking slot. FIG. 24A is a perspective view of an eighth embodiment of a permeable surface covering unit without a pervious plug. FIG. 24B is a transverse cross-sectional view of the eighth embodiment of a permeable surface covering unit with a pervious plug. FIG. 25 is a cross-sectional view of a molding apparatus. FIG. 26 is a detailed perspective view of a pendulum device of the molding apparatus shown in FIG. 25. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS The following is a detailed description of certain embodiments of the invention presently deemed by the inventors to be the best mode of carrying out their invention. The invention as defined by the appended claims is not limited to these embodiments, and additional embodiments of the claimed inventive concept will undoubtedly be apparent to those skilled in the art. Referring now to the drawings, FIGS. 1-4 illustrate a first embodiment of a paving or surface covering unit 10 in accordance with the present disclosure. The unit can be molded of pervious, partially pervious or substantially impervious material, e.g., concrete. The exterior configuration the unit is preferably an irregular tessellation as shown and described for example in U.S. Pat. No. D661,409 issued Jun. 5, 2012 and U.S. Pat. No. 7,393,155 issued Jul. 1, 2008, which are hereby incorporated by reference. Specifically, in the first embodiment, unit 10 has four sides, 12, 14, 16 and 18, all of which have the same general shape or configuration in plan view. Sides 12 and 14 are rotational images of one another, rotated 90 degrees about vertex 20. Similarly, sides 16 and 18 are rotational images of one another, rotated 90 degrees about vertex 22. Further, sides 14 and 18 can be generally viewed as concave, whereas sides 12 and 16 can be viewed as convex. The convex sides of any unit 10 will mate with any concave side of another unit 10, and vice versa, as illustrated in FIG. 3A. The irregularly shaped mating sides provide interlocking engagement for improved structural integrity to the surface and an attractive, natural appearance. As shown in FIG. 1A, the sides and upper surface of the unit 10 may optionally be sculpted to provide for one or more stone, cobble or slab elements 24 separated by false joints 26. The number, size and configuration of the stone or cobble elements are matters of design choice and may vary from unit to unit. The edges 28 of the elements many be drawn inwardly from the unit sides 12-18, and the distance from the element edges 28 to the unit side edges may vary within a given unit as shown and from unit to unit. Similarly, the false joints 26 can vary in number, configuration, width and depth in different units. The combination of sculpted side and top surfaces, natural stone or cobble elements, false joints and irregularly shaped sides add to the natural appearance of a surface covering assembled with units 10 of the invention. As used herein, the term “units” refers to pavers, concrete masonry units, bricks, blocks, stones or tiles that can be used in the construction of roads, driveways, walkways, parking lots, patios, revetments, floors, and other surface covering structures, including interior as well as exterior surface coverings, and including load bearing and non-load bearing structures. By the terms “irregularly shaped” and “irregular configuration” it is meant that the side appears jagged or rough hewn and lacks formal symmetry such that the side has the appearance of natural stone. Although a side comprising a single straight line or a single smooth curve is not “irregular” as that term is used herein, an irregularly shaped side can comprise a series of straight-line segments or a series of curved segments or a combination thereof, such that the overall appearance of the side is irregular. Surface coverings assembled with units having irregular sides have a natural appearance such that a regular geometric pattern is not readily apparent. Although in the preferred embodiments all sides of the units have irregular sides, one or more sides optionally can consist of or include a straight segment or a regular geometric curve. Other embodiments have regular sides as described below. Turning now to FIG. 3A, a surface covering 30 can be constructed of multiple units 10 to collect, retain and/or convey liquids, such as storm water, snow melt, pressure washing solutions, etc. More specifically, unit 10 includes one or more spacers 32 on the sides of the unit adapted to form gaps 34 between units to convey liquid to one or more under chambers or cavities channels, 36. Water or other liquids can be retained in the under channels. Spacers 32 can be any length, height or shape. In the first embodiment, plural spacers are provided on each side, each spacer being recessed somewhat from the visible top surface 11 of the unit so they are not apparent in a finished surface covering. A single under channel 36 can be provided, as shown in FIG. 2A, but multiple channels can be provided. As used herein the terms “channel” and “under channel” refer to any channel, cavity or chamber below the top surface of the unit configured to capture, retain or covey liquid. The under channel or channels can have any desired shape such as the arch-shaped channel 36 shown in FIG. 2A. FIG. 2B shows an alternate channel having planar side walls and semi-arch top wall. Other shapes can be used, including but not limited to an omega Ω shape and irregular shapes. The channel of the first embodiment extends longitudinally from side to side of the unit. However, in other embodiments the channel may extend only to one side, or any number of sides. Although not preferred, the channel could be internal of the unit sides. In addition to conveying liquid through gaps 34 between units, passageways 38 may be optionally provided within the unit 10. In particular, sections of the false joints 26 can extend downwardly through the unit to form a drainage passageway 38, as best shown in FIG. 1B. Passageways 38 preferably connect to under channel 36, but it not required that every passageway directly connects to a channel. The passageways can be open, or can be filled with pervious materials as described herein below. False joints 26 also function to channel water to the gaps and passageways to facilitate drainage. In one example embodiment, the general dimensions of a paver unit made in accordance with the invention are 13″×11″×5.625″ and provides 140 cubic inches of water storage capacity in channel 36. Accordingly, approximate 0.1 cubic feet of water can be retained per square foot of surface. Alternate paver embodiments can be configured to retain between 0.05 and 0.15 cubic feet of liquid storage capacity per square foot of surface area. FIG. 3A is a top plan view of an exemplary, partial surface covering 30 comprised of multiple units 10. As shown, gaps 34 between units facilitate water drainage. The gaps can be filled with pervious material. The pervious material may include a binder, such as a polymer resin, or may be binder free, such as sand. FIG. 3B is a top plan view of an exemplary mold box 40 for manufacturing surface covering units 10 from dry cast concrete. Reciprocating core pullers 42 are used to form channels 36 in two units per cycle, as is well known in the art. FIG. 4A illustrates an alternate surface covering embodiment 44. In one portion of the units 10 a, channels 36 extend in a longitudinal direction of the unit, and in another portion of the units 10 b, channels 36 extend in a transverse direction. Thereby, when assembled, channels 36 align as shown in FIG. 4A. Alignment of the channels allows water to be conveyed beneath the surface, rather than merely retaining water. The aligned channels can convey water or other liquid to a cistern, storm drain or other sub-surface water storage/conveyance system. FIG. 4B illustrates a mold box 40 and core pullers 42 configured to produce units 10 a and 10 b in pairs. FIGS. 5A, 5B and 6 illustrate a second paver unit 110 embodiment of the invention. Unit 110 is an irregular rotational tessellation unit configured substantially in accordance with U.S. Pat. No. 7,393,155, FIG. 17 embodiment. More specifically, unit 110 has three pairs of irregular sides that extend from first 120, second 121 and third 122 vertices, respectively. The sides in each pair of sides are substantially rotational images of one another, rotated at angles 90, 180 and 90 degrees about vertices 120, 121 and 122, respectively. Each pair of sides has a different length as configuration as compared to the other pairs. Although the unit 110 has six irregular sides, it can be viewed as being generally triangular having three major or long sides 112, 114 and 116 (side 112 is actually 2 sides rotated 180 degrees about vertex 121). In surface covering 130, structural connections between units 110 are made at corners 113. At the corners, the spacing between units, especially the lower or base portion of the units is minimal or touching to provide structural integrity to the surface covering, especially if the surface is subject to torque or other forces exerted by road traffic. Intermediate the corners, side cavities or recesses 115 are provided in the major sides for liquid retention and conveyance. The side cavities can be stepped or may extend substantially vertical, i.e., without a step. The side cavities can be regularly shaped, such as an oval, but more preferably are irregularly shaped. The terms “cavity” and “side cavity” as used herein mean a recess or pocket formed into the side of the unit such that when multiple units are assembled a cavity is defined between units having an appreciable volume, substantially greater than that of a typical joint or gap between units. The area in plan view of the side cavities is in the range of 3 to 15 percent of the total area of the unit, more preferably in the range of 5 to 10 percent of the unit area. In some embodiments the side cavities are filled with pervious polymer matrix having sufficient structural strength that the area of the side cavities can be expanded to as much as 40 percent of the total unit surface area. The term “passageway” as used herein means any cavity, gap, channel or conduit by which water or other liquid may be conveyed. The units of the first and second embodiments can be classified as an irregular, rotational tessellations as disclosed in U.S. Pat. No. 7,393,155. However, it should be understood that the present disclosure is not limited to rotational tessellations. Other tessellation forms may be advantageously employed, including glides and glide-rotation combinations. Units 110 optionally include under cannels or cavities 136, as described above relative the first embodiment. In lieu of the under channel, the bottom edge of the unit adjacent the side channel can be provided with an undercut as described below in reference to the eighth embodiment herein below. Side cavities 115 can be filed with pervious material 117, such as sand, and preferably includes a binder, such as a polymer resin. As illustrated in FIG. 5A side cavities 115 intersect with under cavities 136, whereby liquid, e.g., storm water, conveyed via cavities 115 to the under cannels 136 to increase water retention capacity. Surface covering 130 is constructed by first laying the units 110 on the ground or prepared subsurface. The subsurface can be substantially impermeable, but preferably is permeable. Subsequently, side cavities 115 are filled with pervious material 117, e.g., a mixture of an aggregate and a polymer resin or other binding or cementitious material. The pervious material is poured to fill the side cavities and is allowed to slump 119 into the under channel 136 (or undercut) as shown in FIG. 6. When the resin or other cementitious material cures, a pervious matrix or plug 152 is formed that is locked in under the unit 110. The combination of interlocking units having irregularly shaped sides, positive structural connection at the corners, and pervious material plugs locked into the under channel provides a permeable surface covering with superior structural integrity. The irregular shape also provides a natural, non-geometric appearance to the surface covering. FIG. 5B is a plan view of an exemplary mold box 140 layout showing units 110 having side cavities 115 and an under channel 136. The under channel is formed by a core puller 142 as shown. The under channel can have any shape. FIGS. 7 and 8 illustrate a third embodiment of the invention. Multiple units 210 are assembled to form a surface covering 230. As with the first and second embodiment, units 210 have irregularly shaped sides 212, 214, 216 and 218 that provide interlocking, structural integrity to the surface covering. The surface covering includes passageways or gaps 234 between units. Gaps 234 can be formed by providing spacers on the sides of units as described above in reference to the first embodiment, recessing portions of the sides as discussed above in reference to the second embodiment, or merely by varying the side configurations slightly such that adjacent units mate less than perfectly. Units 230 further include side cavities or side channels 215. Gaps 234 function to permit drainage of liquid between units into cavities 215 for below surface retention and/or conveyance. Gaps 234 and cavities 215 can be wholly or partially filled with pervious material or left wholly or partially open. Under side cavities 215 may be aligned in a surface covering for sub-surface water conveyance as described above in reference to the FIG. 4A embodiment. FIGS. 9-11 illustrate a fourth embodiment of the invention. Multiple units 310 are assembled to form a surface covering 330. Units 310 have a regular, rectangular configuration with antiqued, roughened or natural rock-like sides 312, 314, 316 and 318. In other embodiments the sides can be irregularly shaped. Optionally, units 310 have an under channel 336, which if employed can run either longitudinally or transversely of the unit, or can run on the lower sides of the unit as shown in FIG. 8. Optionally, the unit may include one or more stone or cobble elements 324 separated by one or more false joints 326. The cobble elements are preferably irregularly shaped. Similarly, the false joints 326 may vary in number, configuration and width to lend a natural appearance to the surface covering. At least one, preferably plural sides are provided with one or more side cavities 315, at least some of which intersect the under cavity (if provided). The configuration of the side cavities in plan view are preferably irregularly shaped, but geometric shapes are contemplated. A portion of the side cavities 349 can extend vertically downward to intersect the under channel 336. Passageways or cavities 350 can also be formed between the corners of the units. One or preferably plural side cavities 315 are stepped as shown in FIG. 10 and include a locking slot 346. The sides of cavities 315 are preferably sculpted in an irregular configuration. Locking slots 346 can be key-hole shaped as shown. Other locking slot shapes can be used, however, as shown for example in FIGS. 21 and 23. Locking slots of adjacent units optionally align in the surface covering as shown in FIG. 9. On the margins of a surface covering, such as a patio, rods, pins or stakes 348 can be driven through the locking slots to laterally secure the units in position on the ground or foundational base material layer. Thereby, it may be possible to dispense with costly edge restraining devices. Stakes can also be driven in interior areas of the surface covering as may be desired. The stakes can be straight as shown, or may be inverted “J” or “U” shapes to engage and interlock adjacent units. The stakes can be fabricated from plastic, metal or other suitable materials. The side cavities 315, 349, corner cavities 350 and locking slots 346 can be filled with pervious material that preferably includes a binder, as described above. The shape of the slot facilitates locking in pervious material. The cured pervious plug 352 encapsulates the top portion of the stakes 348 and forms a link between adjacent units to tie the surface structure together and enhance the structural integrity of the surface, as shown in FIG. 11. Inverted “J” or “U” shaped stakes can also be used to mechanically tie adjacent units together. FIGS. 12-16 illustrate a fifth embodiment of unit 410. Referring to FIGS. 12 and 13, unit 410 has the same basic configuration as unit 10 of the first embodiment, including irregularly shaped, sculpted sides; one or more stone, cobble or slab elements 424 separated by false joints 426; and one or more under channels 436. In lieu of an under channel an undercut can be provided as discussed in greater detail relative to the eighth embodiment herein below. As shown, unit 410 does not include spacers, but optionally spacers can be provided. Unit 410 includes at least one core 450 that intersects under channel 436. The core is preferably drafted as shown best in FIG. 13. The area, configuration and location of the cavity can be varied from unit to unit. The area in plan view of the core cavities can be in the range of about 3 to 40 percent of the total area of the unit, more preferably in the range of 5 to 20 percent of the unit area. The core 450 is filled with pervious material preferably including a binder. The permeability of the core material can be adjusted based on the selection of aggregate, binders and other additives. The pervious material provides a drainage path or passageway from the top of the unit to the under channel or cavity. Pervious material is poured into the core and allowed to slump into the under channel. When the resin or other binder cures, a pervious plug 452 is formed. The combination of a drafted core and a plug that includes a portion 454 extending into the under channel, locks the plug into place within the unit like a rivet, i.e., the plug is at least partially converging and diverging in the vertical direction. The shape of the plug resists dislodgement due to mechanical forces such a vehicular traffic or hydraulic forces such as water pressure. The plug may be cast in the unit as a part of the manufacturing process, or more preferably can be poured in situ after the basic units 410 are assembled into a surface covering. As shown in FIG. 13 a rim 453 extends around the top edge of the plug 452. However, the rim can be segmented or removed in part(s) so as to connect the false joints 426 to the pervious plug 452 to promote drainage. FIGS. 14 and 15 illustrate a unit 410 a that is a variation of unit 410 that does not include a rim. Unit 410 a has a pervious plug 452 the top surface of which is at substantially the same depth as the bottom of false joints 426. Thereby the false joints can channel liquid such as storm water into the pervious plug and thereby enhance drainage. The pervious material can optionally extend into the false joints. FIG. 16 illustrates an exemplary surface covering 430 which may be comprised of units 410, or units 410 a, or a combination thereof. The surface covering is preferably formed by laying precast, unfilled units on a properly prepared bed. After the units have been laid, pervious material plugs can be poured in situ. Optionally, gaps (not shown) between units can be filled with the same cemented pervious material. Alternatively the gaps between units can be subsequently filled with another pervious material, which may or may not contain a binder. To add to the natural appearance of a surface covering, the location, size and configuration of the cores and plugs can be varied from unit to unit. Further, the surface covering can include units 410 b that have the same overall shape and configuration as unit 410, but without a core or pervious plug. As a further option, side cavities can be provided on a plurality of units as discussed above in connection with the second embodiment. The mix of pervious units 410, 410 a and impervious units 410 b and resulting absorption rate can be varied per design or randomly mixed. The FIG. 16 embodiment shows a mix of about one pervious unit 410 per 4 impervious units, resulting in a surface that is approximately 4% pervious material. The conditions of a particular site may call for greater drainage in some areas and less in others. In the landscape system of the fifth embodiment the ratio of pervious units to impervious units may be adjusted accordingly. Further, units with larger pervious plugs may be selected for areas calling for enhanced drainage. In this way, the ratio of the pervious area to total surface area may be adjusted within a range of about 3% to about 50%. FIGS. 17A and 17B illustrate a sixth embodiment of unit 510. Unit 510 has the same basic configuration as unit 10 of the first embodiment, including irregularly shaped, sculpted sides; one or more stone, cobble or slab elements 524 separated by false joints 526; and an optional under channel or cavity 536. Unit 510 optionally can include spacers (not shown in FIG. 17A). Unit 510 includes a conventional substantially impervious portion 556 and a pervious portion 558. The impervious portion 556 can be made of concrete. The pervious portion 558 is comprised of a mixture of an aggregate and binder, such as a polymeric resin. The pervious and impervious portions can be manufactured together, such as by co-molding. Alternatively they may be separately molded. For example, the pervious portion may be first molded and cured, and then inserted into the mold for unit 510 wherein the impervious material is placed and molded. The pervious piece can be co-molded with the substantially impervious unit. Alternatively, the pervious piece can be formed separately from the main unit for assembly either before or after the main units are laid to form a surface covering. Finally, the pervious portion can be poured in situ. In a preferred embodiment, pervious portion 558 at least partially intersects with cavity 536. Turning now to FIG. 17B, a surface covering 530 comprises a combination of pervious units 510 and impervious units 510 b. Impervious units 510 b have the same configuration as units 510 but lack a pervious portion 558. As with the surface covering 430 of the FIG. 16 embodiment, fewer or greater numbers of pervious units relative to imperious units may be provided depending on the localized drainage requirements. The FIG. 17B embodiment, for example, shows a mix of about one pervious unit 510 per 3 impervious units 510 b that results in a surface that is approximately 6% pervious. As with the FIG. 16 embodiment, the ratio of the pervious area to total surface area may be adjusted within a range of about 3% to about 50%. FIGS. 18-23 show a seventh embodiment of the unit 610 of the invention. The outer configuration of unit 610 is a basic rectangular shaped paver, which is well known in the art. Other unit configurations, including irregular configurations are contemplated. Unit 610 includes a core cavity 650 and optional bottom channel 636 and that intersects the core cavity. The core cavity is preferably drafted, i.e., tapering from top to bottom as shown in FIGS. 19-21. However, one or more sides can be substantially vertical. The core cavity includes at least one, preferable plural slots 660 that form locking points positioned on the inner walls of core cavity 650. The core cavity 650 is configured and adapted to be filled with a pervious material including a binder to form a pervious plug (not shown) as discussed above relative to the fifth embodiment. If an under channel 636 is provided, the pervious material poured into the core cavity is allowed to slump into the under channel 636 thereby locking the plug into the core. Pervious material will also extend into slots 660 to provide enhanced structural connection between the plug and unit. If the optional under channel is not provided, the locking slots function to resist dislodgement of the plug due to mechanical forces, such as torque and traffic loads, and hydraulic forces. Different shaped slots may be used, including but not limited to a dovetail slot 660 as shown in FIGS. 19-21. Alternate slot shapes can be used, including but not limited to a key-hole slot 660 a as shown in FIG. 22 and a T-shaped slot 660 b as shown in FIG. 23. Locking slots can also be optionally provided on the exterior of the unit to enhance the structural connection between units as described above in reference to the fourth embodiment. FIG. 24 illustrates an eighth embodiment of a unit 710. Unit 710 is shown as having a rectangular exterior configuration similar to the seventh embodiment. However, other configurations can be used including, but not limited to the configurations shown and described above relative to embodiments one through six. Unit 710 includes a core cavity 750 extending vertically though the unit. The core is preferably drafted. The cavity is illustrated as having a rectangular shape in plan view but other shapes can be used. The core cavity is configured to be filled with a pervious material including a binder to form a pervious plug 752. Unit 710 may optionally include an under channel or cavity as shown and described above in reference to embodiment seven (not shown in FIGS. 24A and 24B). Cavity 750 further includes one or more undercuts 762. Undercut 762 is a recess, cavity or depression in the side of the core. Undercuts may be located at the lower end of the unit, as shown in FIG. 24B for example, or may be located in the midrange of the core. The undercuts and drafting of the cavity combine to create an interior cavity volume that is at least partially converging and diverging in the vertical direction. Accordingly, when the cavity is filled with pervious material mixture of an aggregate and binder, and the binder sets, the resulting pervious plug is locked into the cavity. The plug resists dislodgement from mechanical and/or hydraulic forces. The undercut can be of any desired shape or size, including but not limited to the semi-cylindrical shape shown. Other shapes can be used, including rectangular and triangular shapes. Undercuts can also be made in one or more locations of the exterior side walls (not shown). A common method of manufacturing concrete units such as unit 710 is the dry cast method. However, it is not possible with conventional technology to economically mold undercuts, especially undercuts in interior cavities. In most molding operations cavities are preferably drafted, progressively tapering in one direction only so that at a core can be easily pulled. To meet this challenge, a molding apparatus and method are provided for economically molding undercuts in dry cast concrete units, such as but not limited to unit 710. FIG. 25 is a partial section of a mold box 740 positioned on pallet 764. The box 740 comprises division walls 766, core 768 for forming the cavity, tamping shoes 770, plungers 772 and pendulum devices 774 for forming undercuts. Pendulum device 774 comprises a pendulum member 776 have a molding end 778 that is pivotally mounted to a shaft 780, and a stop 782. The end of the pendulum and correspondingly molded undercuts are shown as being cylindrical, but other shapes are contemplated, including rectangular bar shapes and triangular shapes. The molding device operates as follows. Initially, mold box 740 is positioned on pallet 764, which causes pendulum members 776 to rotate upwardly and outwardly to the position shown in solid lines in FIG. 25. The core 768 is positioned in the mold box above the molding ends 778 of the pendulum members. An appropriate volume of concrete is placed into the mold and tamped with shoes 770 to form a unit 710. The mold is then opened by separating the pallet 764 vertically relative to the mold box. The shoes 770 coupled to mechanical means and with the assistance of gravity press unit 710 out of the mold, the unit remaining on the pallet. Gravity plus the force caused by the relative movement of the unit to the mold box causes the pendulum members 776 to swing downwardly and inwardly to the position shown in dashed lines in FIGS. 25 and 26. Added mechanical assistance, e.g., springs, can be provided to facilitate retraction of the pendulum members. Simultaneously, as the pendulums retract, the unit is removed from the mold box. The newly cast unit 710 can then be moved to another location to cure. Undercuts can be formed with alternative devices and methods, the mold box shown and described in FIGS. 25 and 26 being one example. While particular embodiments of the present invention have been described herein, it will be appreciated by those skilled in the art that changes and modifications may be made thereto without departing from the invention in its broader aspects. In particular the specific features of one embodiment may be combined with features of other embodiments. Non limiting examples of such combinations have been provided herein above. Other combinations will be apparent to those skilled in the art and are contemplated herein. What is claimed is: 1. A permeable surface covering system comprising: a plurality of permeable surface covering units, each of the permeable surface units having a top surface, a bottom surface and at least two pairs of side surfaces; and a pervious material, wherein at least one of the permeable surface covering units is secured to at least one of the other permeable surface covering units and wherein when a permeable surface covering is constructed, each permeable surface covering unit is positioned adjacent to at least one of the other permeable surface covering units and the pervious material at least partially fills the at least one cavity of each permeable surface covering unit and at least partially fills gaps between adjacently positioned permeable surface covering units. 2. The permeable surface covering system of claim 1, wherein each of the permeable surface covering units has at least one cavity positioned along the top surface, and at least one channel positioned along the bottom surface. 3. The permeable surface covering system of claim 2, wherein each of the side surfaces of the at least two pairs of side surfaces of the plurality of permeable surface covering units has more than one spacer and wherein one of the pairs of the side surfaces of the plurality of permeable surface covering units has an irregular general concave contour such that the edges of each side surface of the pair of side surfaces are the furthest extending portion of the side surface and at least one of the more than one spacer of each side surface of the pair of side surfaces is positioned along the contour of the side surface such that the at least one spacer does not extend out farther than the edges of the side surface. 4. The permeable surface covering system of claim 3, wherein the at least one other pair of sides surfaces of the permeable surface covering units has an irregular generally convex contour such that the edges of each side surface of the pair of side surfaces are the most inward extending portion of the side surface and at least one of the more than one spacer of each side surface of the pair of side surfaces is positioned along the contour of the side surface such that the at least one spacer extends out farther than the edges of the side surface. 5. The permeable surface covering system of claim 4, wherein the at least one cavity extends from the top surface to an upper surface of the at least one channel positioned along the bottom surface of the permeable surface covering units such that the at least one cavity is open to the at least one channel and wherein the pervious material at least partially fills the at least one channel. 6. The permeable surface covering system of claim 5, wherein the pervious material comprises an aggregate and binder and wherein when the binder cures the pervious material forms a plug in the at least one cavity and the at least one channel of the permeable surface covering units, and the gaps between adjacently positioned permeable surface covering units. 7. The permeable surface covering system of claim 2, wherein the at least two pairs of side surfaces of the plurality of permeable surface covering units are at least two pairs of irregular shaped mating side surfaces wherein a first pair of the irregular shaped mating side surfaces extends from a first common vertex, has substantially the same configuration and each side surface is rotationally spaced from one another by a first angle, and a second pair of the irregular shaped mating side surfaces extends from a second common vertex, has substantially the same configuration and each side surface is rotationally spaced from one another by a second angle. 8. The permeable surface covering system of claim 7, wherein each of the side surfaces of the plurality of permeable surface covering units has substantially the same configuration and the first and second angles are the same. 9. The permeable surface covering system of claim 7, wherein the at least two pairs of irregular shaped mating side surfaces of the plurality of permeable surface covering units is three pairs of irregular shaped mating side surfaces and wherein a third pair of irregular shaped side surfaces extends from a common vertex, has substantially the same angle and each side surface is rotationally spaced from one another by a third angle. 10. The permeable surface covering system of claim 7, wherein the at least one cavity is formed into at least one of the side surfaces of each of the permeable surface covering units and is open to a cavity formed into the side surface of an adjacently positioned permeable surface covering unit thereby forming a recess between the adjacently positioned permeable surface covering units. 11. The permeable surface covering system of claim 7, wherein the at least one cavity is open to the top surface and is closed to the bottom surface of each of the permeable surface covering units. 12. The permeable surface covering system of claim 7, wherein the at least one channel positioned along the bottom surface of each of the permeable surface covering units is open to at least one of the side surfaces of the permeable surface covering unit and wherein the pervious material at least partially fills the at least one channel. 13. The permeable surface covering system of claim 12, wherein the pervious material comprises an aggregate and binder and wherein when the binder cures the pervious material forms a plug in the at least one cavity and the at least one channel of the permeable surface covering units, and the gaps between adjacently positioned permeable surface covering units. 14. The permeable surface covering system of claim 2, wherein the at least one cavity of the plurality of permeable surface covering units is open from the top surface to the bottom surface and is open to the at least one channel, the at least one cavity having side walls and wherein at least one side wall of the at least one cavity has an undercut. 15. A permeable surface covering comprising: a plurality of permeable surface covering units, each of the permeable surface units having a top surface, a bottom surface, at least two pairs of side surfaces, at least one cavity positioned along the top surface, and at least one channel positioned along the bottom surface, the at least one channel being open to at least one of the at least one cavities and at least one side surfaces, at least one of the permeable surface covering units being secured to at least one of the other permeable surface covering units, each permeable surface covering unit being positioned adjacent to at least one of the other permeable surface covering units; and a pervious material that at least partially fills the at least one cavity and at least one channel of each permeable surface covering unit and at least partially fills gaps between adjacently positioned permeable covering surface units. 16. The permeable surface covering of claim 15, wherein each of the side surfaces of the at least two pairs of side surfaces has more than one spacer and wherein one of the pairs of the side surfaces of the plurality of permeable surface covering units has an irregular general concave contour such that the edges of each side surface of the pair of side surfaces are the furthest extending portion of the side surface and at least one of the more than one spacer of each side surface of the pair of side surfaces is positioned along the contour of the side surface such that the at least one spacer does not extend out farther than the edges of the side surface and wherein the at least one other pair of sides surfaces of the permeable surface covering units has an irregular generally convex contour such that the edges of each side surface of the pair of side surfaces are the most inward extending portion of the side surface and at least one of the more than one spacer of each side surface of the pair of side surfaces is positioned along the contour of the side surface such that the at least one spacer extends out farther than the edges of the side surface. 17. The permeable surface covering system of claim 16, wherein the pervious material comprises an aggregate and binder and wherein when the binder cures the pervious material forms a plug in the at least one cavity and the at least one channel of the permeable surface covering units, and the gaps between adjacently positioned permeable surface covering units. 18. A method of constructing a permeable surface covering comprising: providing a plurality of permeable surface covering units, each of the permeable surface units having a top surface, a bottom surface, at least two pairs of side surfaces, at least one cavity positioned along the top surface, and at least one channel positioned along the bottom surface, the at least one channel being open to at least one of the at least one cavities and at least one side surfaces, at least one of the permeable surface covering units being secured to at least one of the other permeable surface covering units; positioning each permeable surface covering unit adjacent to at least one of the other permeable surface covering units; and at least partially filling pervious material into the at least one cavity and at least one channel of each permeable surface covering unit and at least partially filling gaps between adjacently positioned permeable covering surface units. 19. The method of constructing a permeable surface covering of claim 18, wherein each of the side surfaces of the at least two pairs of side surfaces has more than one spacer and wherein one of the pairs of the side surfaces of the plurality of permeable surface covering units has an irregular general concave contour such that the edges of each side surface of the pair of side surfaces are the furthest extending portion of the side surface and at least one of the more than one spacer of each side surface of the pair of side surfaces is positioned along the contour of the side surface such that the at least one spacer does not extend out farther than the edges of the side surface and wherein the at least one other pair of sides surfaces of the permeable surface covering units has an irregular generally convex contour such that the edges of each side surface of the pair of side surfaces are the most inward extending portion of the side surface and at least one of the more than one spacer of each side surface of the pair of side surfaces is positioned along the contour of the side surface such that the at least one spacer extends out farther than the edges of the side surface. 20. The method of constructing a permeable surface covering system of claim 19, wherein the pervious material comprises an aggregate and binder and wherein when the binder cures the pervious material forms a plug in the at least one cavity and the at least one channel of the permeable surface covering units, and the gaps between adjacently positioned permeable surface covering units.

2018-09-04

en

2018-12-27

US-201514794747-A

Emphasis for sharing application portion ABSTRACT The rendering of information on an output device when there is a set of information rendered on the output device that is shareable to a second output device. In this context, shareable means that the application that generates the information is extracted and run instead on behalf of the second output device to render the information on the second output device. In addition, there is output an emphasis that aids the user in understanding that there is the technical capability to share the set of information in this manner. Thus, the user may be informed and more aptly initiate the technical ability to achieve the sharing of the set of information with the second output device. BACKGROUND Computing technology has revolutionized the way we work, play, and communicate. Computing functional is obtained by a device or system executing software or firmware. The typical paradigm for application preparation is that the application is drafted well in advance of its use, and the functionality of the patent application is relatively predetermined. There are some exceptions to the predetermined functionality. For instance, patches may be made to software application in order to provide repair of previously unknown bugs in the software. Furthermore, updates to software applications may be provided in order to add new functionality to the software application. In some cases, software may be configured and customized for a particular user. However, the application itself defines how far it can be customized. Users can also affect applications by providing commercial feedback on software performance. However, it can take years before user feedback is properly incorporated into an application. The subject matter claimed herein is not limited to embodiments that solve any disadvantages or that operate only in environments such as those described above. Rather, this background is only provided to illustrate one exemplary technology area where some embodiments described herein may be practiced. BRIEF SUMMARY At least some embodiments described herein relate to the rendering of information on an output device when there is a set of information rendered on the output device that is shareable to a second output device. In this context, shareable means that the application that generates the information is extracted and run instead on behalf of the second output device to render the information on the second output device. In addition, there is output an emphasis that aids the user in understanding that there is the technical capability to share the set of information in this manner. Thus, the user may be informed and more aptly initiate the technical ability to achieve the sharing of the set of information with the second output device. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter. BRIEF DESCRIPTION OF THE DRAWINGS In order to describe the manner in which the above-recited and other advantages and features can be obtained, a more particular description of various embodiments will be rendered by reference to the appended drawings. Understanding that these drawings depict only sample embodiments and are not therefore to be considered to be limiting of the scope of the invention, the embodiments will be described and explained with additional specificity and detail through the use of the accompanying drawings in which: FIG. 1 symbolically illustrates a computing system in which some embodiments described herein may be employed. FIG. 2 illustrates a flowchart of a method for rendering information on at least one output device of a computing system; FIG. 3 illustrates a computing architecture that may be used to perform the method of FIG. 2; FIG. 4 symbolically illustrates an example computerized rendering that may be created by the method of FIG. 2; FIG. 5 illustrates a more concrete example of the rendering of FIG. 4; FIG. 6 symbolically illustrates a simple transformation chain in which there is but a single link coupling a single data source and a single data target and in which a transformation represented by the link is automatically performed using a value in the data source as input to generate a value in the data target; FIG. 7 symbolically illustrates another simple example transformation chain in which a transformation is performed using input values from three data sources in order to generate output values in two data targets; FIG. 8 illustrates a transformation chain in the form of a combination of the transformation chain of FIG. 6 and the transformation chain of FIG. 7; FIG. 9A through 9D each illustrate example transformation chains (arrows through which data does not flow absent joining with another transformation chain are illustrated with an “X”, and dependency elements that are not nodes in the transformation chain itself are illustrated with dashed lined borders); FIG. 10A illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9A and 9B; FIG. 10B illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9A and 9C; FIG. 10C illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9B and 9C; FIG. 10D illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9A and 9D; FIG. 11A illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9A, 9B and 9C; FIG. 11B illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9A, 9B and 9D; FIG. 11C illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9A, 9C and 9D; FIG. 12 illustrates an augmented transformation chain representing the joining of the transformation chains of FIGS. 9A, 9B, 9C and 9D; FIG. 13 illustrates a node of a transformation chain along with numerous associated input endpoints and output endpoints; FIG. 14 illustrates a runtime architecture in which transformation chains may be implemented, and which includes a canvas referred to herein as a universal canvas; FIG. 15 illustrates a flowchart of a method for formulating an application in response to detecting events in an environment, which represents a simple case in which an instance of a transformation chain is created and operated within the universal canvas of FIG. 14; FIG. 16 illustrates a flowchart of a method for responding to detecting events in the environment by combining transformation chain instances; FIG. 17A illustrates a flowchart of a method for formulating an integrated instance of two transformation chain classes by first instantiating instances of each class, and then joining the instances; FIG. 17B illustrates a flowchart of a method for formulating an integrated instance of two transformation chain classes by first combining the two transformation chain classes, and then instantiating from the combined transformation chain class; FIG. 18A illustrates a transformation chain instance that is preparing to be split; FIG. 18B illustrates a transformation chain instance that is split from the transformation chain instance of FIG. 18A; FIG. 19 illustrates a flowchart of a method for formulating a split application; FIGS. 20A through 20D illustrates various possible configurations for the split transformation chain instance of FIG. 18B; FIG. 21 illustrates an architecture in which a larger transformation chain instance that is assigned to a first endpoint interface securely interfaces with a portion transformation chain instance that is assigned to a second endpoint interface via a proxy service; FIG. 22 illustrates a flowchart of a method for sharing an application in response to detecting one or more events at a first endpoint interface entity; and FIG. 23 illustrates a flowchart of a method for distributed interfacing with an application across a plurality of hardware entities. DETAILED DESCRIPTION At least some embodiments described herein relate to the rendering of information on an output device when there is a set of information rendered on the output device that is shareable to a second output device. In this context, shareable means that the application that generates the information may be extracted and run instead on or on behalf of the second output device to render the information on the second output device. In addition, there is output an emphasis that aids the user in understanding that there is the technical capability to share the set of information in this manner. Thus, the user may be informed and more aptly initiate the technical ability to achieve the sharing of the set of information with the second output device. First, a computing system will be described with respect to FIG. 1. Then, the general principles of embodiments of outputting sets of shareable information, and the emphasis or notification to the user about the same will be described with respect to FIGS. 2 through 5. Thereafter, the concept of transformation chains will be described with respect to FIGS. 6 through 13. Then, an architecture for supporting a universe of transformation chains and their operation will be described with respect to FIG. 14. Thereafter, an example operation of transformation chains will be described with respect to FIGS. 15 through 23. Computing System Description Computing systems are now increasingly taking a wide variety of forms. Computing systems may, for example, be handheld devices, appliances, laptop computers, desktop computers, mainframes, distributed computing systems, or even devices that have not conventionally been considered a computing system. In this description and in the claims, the term “computing system” is defined broadly as including any device or system (or combination thereof) that includes at least one physical and tangible processor, and a physical and tangible memory capable of having thereon computer-executable instructions that may be executed by the processor. The memory may take any form and may depend on the nature and form of the computing system. A computing system may be distributed over a network environment and may include multiple constituent computing systems. As illustrated in FIG. 1, in its most basic configuration, a computing system 100 typically includes at least one hardware processing unit 102 and memory 104. The memory 104 may be physical system memory, which may be volatile, non-volatile, or some combination of the two. The term “memory” may also be used herein to refer to non-volatile mass storage such as physical storage media. If the computing system is distributed, the processing, memory and/or storage capability may be distributed as well. As used herein, the term “executable module” or “executable component” can refer to software objects, routings, or methods that may be executed on the computing system. The different components, modules, engines, and services described herein may be implemented as objects or processes that execute on the computing system (e.g., as separate threads). In the description that follows, embodiments are described with reference to acts that are performed by one or more computing systems. If such acts are implemented in software, one or more processors of the associated computing system that performs the act direct the operation of the computing system in response to having executed computer-executable instructions. For example, such computer-executable instructions may be embodied on one or more computer-readable media that form a computer program product. An example of such an operation involves the manipulation of data. The computer-executable instructions (and the manipulated data) may be stored in the memory 104 of the computing system 100. Computing system 100 may also contain communication channels 108 that allow the computing system 100 to communicate with other message processors over, for example, network 110. The computing system 100 also may potentially include one or more output devices, such as output device(s) 112. Output devices may be any device that can render information. Examples of output devices include displays, speakers, lights, actuators, projectors, drones, or the like. The computing system 100 may also include one or more input devices, such as input device(s) 114. Examples of input devices include keyboards, pointer device (such as a mouse or tracking pad), voice recognition devices, touch screens, vision sensors, and possibly also physical sensors (e.g., thermometers, global positioning systems, light detectors, compasses, accelerometers, and so forth). Embodiments described herein may comprise or utilize a special purpose or general purpose computer including computer hardware, such as, for example, one or more processors and system memory, as discussed in greater detail below. Embodiments described herein also include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer system. Computer-readable media that store computer-executable instructions are physical storage media. Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, embodiments of the invention can comprise at least two distinctly different kinds of computer-readable media: computer storage media and transmission media. Computer storage media includes RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other storage medium which can be used to store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. A “network” is defined as one or more data links that enable the transport of electronic data between computer systems and/or modules and/or other electronic devices. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a transmission medium. Transmissions media can include a network and/or data links which can be used to carry desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. Combinations of the above should also be included within the scope of computer-readable media. Further, upon reaching various computer system components, program code means in the form of computer-executable instructions or data structures can be transferred automatically from transmission media to computer storage media (or vice versa). For example, computer-executable instructions or data structures received over a network or data link can be buffered in RAM within a network interface module (e.g., a “NIC”), and then eventually transferred to computer system RAM and/or to less volatile computer storage media at a computer system. Thus, it should be understood that computer storage media can be included in computer system components that also (or even primarily) utilize transmission media. Computer-executable instructions comprise, for example, instructions and data which, when executed at a processor, cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. The computer executable instructions may be, for example, binaries or even instructions that undergo some translation (such as compilation) before direct execution by the processors, such as intermediate format instructions such as assembly language, or even source code. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims. Those skilled in the art will appreciate that the invention may be practiced in network computing environments with many types of computer system configurations, including, personal computers, desktop computers, laptop computers, message processors, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, mobile telephones, PDAs, pagers, routers, switches, and the like. The invention may also be practiced in distributed system environments where local and remote computer systems, which are linked (either by hardwired data links, wireless data links, or by a combination of hardwired and wireless data links) through a network, both perform tasks. In a distributed system environment, program modules may be located in both local and remote memory storage devices. User Interface Example FIG. 2 illustrates a flowchart of a method 200 for rendering information on at least one output device of a computing system. As an example, the computing system may be the computing system 100 of FIG. 1, and the output device may be the output device 112 of FIG. 1. FIG. 3 illustrates a computing architecture 300 that may be used to perform the method 200. The computing architecture 300 includes control components 310 and a rendering component 320. In FIG. 2, those acts that are performed by one or more of the control components 310 are illustrated in the left column of FIG. 2 under the heading “Control”; and those acts that are performed by the rendering component 320 are illustrated in the right column of FIG. 2 under the heading “Render”. The control component(s) first instruct (or cause) one or more sets of information to be rendered on an output device of the computing system (act 201). For instance, the rendering control component 311 may provide this instruction. In response, the rendering component 320 renders the sets of information to be rendered on the output device (act 211). For instance, FIG. 4 symbolically illustrates an example computerized rendering 400 that may be created by this process. The computerized rendering includes a first set 401 of information and a second set 402 of information, amongst potentially other sets of information as represented by the ellipses 403. In that case, the rendering (act 211) includes an act of rendering the first set 401 (act 211A) and an act of rendering the second set 402 (act 211B). In this embodiment, the first set 401 of information is shareable, and the second set 402 of information is not shareable. The shareable set of information is shareable in that one or more application portions that generated the shareable set of information 401 may be extracted and operated for rendering of the shareable set of information at a second output device. An example on how this may be accomplished will be described further below with respect to FIGS. 6 through 23. The non-shareable set 402 of information, on the other hand, is not shareable in this way. Before or after the first set 401 of information is rendered (act 211A), the control components 310 (e.g., perhaps rendering control component 311) identifies that a shareable set of information is being or is to be rendered on the output device (act 202). Accordingly, the control components 310 (e.g., again perhaps the rendering control component 311) instructs the rendering component 320 to notify the user that the shareable set of information is shareable (act 203). In response, the rendering component 320 emphasizes (act 212) that the shareable set of information is shareable so as to communicate to a user a technical readiness to receive and implement an instruction to share the shareable set of information to the second output device. Furthermore, the rendering may be made in such a way as to distinguish those sets of information that are shareable from those sets of information that are not shareable. In FIG. 4, this emphasis that provides the user such notification of sharability is represented by the set of information having the asterisk 405, whereas the second set 402 of information has no asterisk. The output of the emphasis may, but need not, be performed on the same output device on which the rendering is made. Furthermore, the emphasis may be output automatically or in response to one or more environmental events. For instance, perhaps the output is emphasized in response to user selection input being received that is associated with the shareable set of information. There are a variety of sensory forms that the rendering 400 may take. For instance, the rendering 400 may be visual rendering, in which case the output device would be a display, projector, holographic imager, or the like. The rendering may be an audio rendering, in which case the output device might be a speaker. The rendering may be tactile, in which case, the output device may provide tactile renderings (actuators such as brail displays). The output of the emphasis may take on the same or different sensory form as compared to the rendered information. For instance, if the rendered information is visual information on a display, the emphasis may be some visualized emphasis on that display (in the case of the sensory form being the same), or some auditory emphasis (in the case of the sensory form being different). FIG. 5 illustrates a more concrete example of the rendering 400 of FIG. 4. In the case of FIG. 5, the rendering 400 is a visual rendering. Accordingly, FIG. 5 illustrates a visualized user interface 500. The user interface 500 is illustrated in state in an object summary set 502 of information and an object details set 501 of information are both displayed. The object summary set 502 includes an enumeration of four order fields 502A through 502D. Each order field includes a name of the order, a picture of the item ordered, and a purchase order number. The user may select the order field 502A (as represented by the thick vertical bar 516) causing the object details set 501 to appear. In one embodiment, this is accomplished by expansion of the application itself upon detecting that the user selected the order field 502A. More regarding this dynamic building of applications in response to environmental events will be described below with respect to FIG. 6. Suppose that the object summary set 502 of information is not shareable, but the object details set 501 is shareable. For instance, perhaps the user is communicating with a supplier of the product detailed in the object details set 501 which corresponds to the selected order field 502A. The user may not want the supplier to have a view on what other orders have been placed, or what other products are being considered for purchase. The sharability of the object details set 501 of information is represented by the asterisk 503, whereas the object summary set 502 of information has no asterisk. Here, the object details set 501 of information represents an example of the first set 401 of information of FIG. 4; and the object summary set 502 of information represents an example of the second set 402 of information of FIG. 4. Furthermore, the display of the object details set 501 of information represents an example of the act 211A of FIG. 2; and the display of the object summary set 502 of information represents an example of the act 211B of FIG. 2. In the case of the rendered information being displayed information, and the output of emphasis occurring in the same sensory form (visually), and on the same output device (e.g., the same display), there are a variety of examples of how to emphasize that a set of information is shareable. For instance, the color of at least a portion of the shareable set of information may be altered, or the color of an object associated with the shareable set of information may be altered, in a manner that is different than would be the color if the shareable set of information were not shareable. For example, the shareable information or its container may be colored to provide high contrast with the remaining sets of information that are not shareable. Alternatively or in addition, a grouping of at least a portion of the shareable set of information may be altered so as to be different than would be the grouping if the shareable set of information were not shareable. For instance, sets of shareable information may be grouped or positioned with other sets of shareable information, with perhaps some separation from other sets that are not shareable. Alternatively or in addition, a positioning of at least a portion of the shareable set of information may be altered so as to be different than would be the positioning if the shareable set of information were not shareable. For instance, shareable sets of information may be placed in a predetermined and/or configurable portion of the display. Alternatively or in addition, a focus of at least a portion of the shareable set of information may be altered to as to be different than would be the focus if the shareable set of information were not shareable. For instance, shareable sets of information may be provided in slightly larger font, in a larger window, or perhaps may be in focus (whereas non-shareable sets may be slightly blurred—at least temporarily). Alternatively or in addition, a layering of at least a portion of the shareable set of information may be altered so as to be different than would be the layering if the shareable set of information were not shareable. For instance, windows that include shareable sets of information may be provided more in the foreground that those windows that contain non-shareable sets of information. In some case, the outputting of emphasis (act 212) may occur in response to user selection input associated with the shareable set of information being received. For instance, the user selection input might be a substantial circling of the displayed shareable set of information. If the user were to, for instance, circle the order details set 501 of information in FIG. 5, then perhaps only then might the visual emphasis be provided. If the user were to, for instance, circle both the order details set 501 of information and the order summary set 502 of information, then perhaps then visual emphasis of the order details set 501 may then be manifested. Referring back to FIG. 2, given this additional assistance to the user regarding what sets of information are shareable and what sets of information are not shareable, the user may then provide a more intelligent user input gesture selecting a set of information to share, and selecting the target for sharing. Accordingly, the method 200 also includes detecting (decision block 220) a portion selection user interaction that is indicative of selection of the shareable set of information. Furthermore, in response to the detection of such user input (“Yes” in decision block 220), the portion of the application that generated the output is extracted and run on behalf of or on the second output device (act 230), causing rendering of the shareable set of information to be rendered on the second output device (240). The Transformation Chain Application An example implementation in which portions of applications may be moved from one output device to another occurs in the context of the application itself being a transformation chain. A transformation chain is an interconnected set of nodes that each may represent data sources and/or data targets. There are links between the nodes, each link representing a transformation. For any given link, the associated transformation receives copies of values of one or more data sources situated at an input end to the link, and generates and provides resulting values at one or more data targets located at the output end of the link. For any given transformation, when a value at one or more of the data sources at its input end changes, the transformation is automatically reevaluated, potentially resulting in changes in value(s) of one or more data targets at the output end of the transformation. In one embodiment, regardless of how complex the transformation chain is, the transformations may be constructed from declarative statements expressing equations, rules, constraints, simulations, or any other transformation type that may receive one or more values as input and provide resulting one or more values as output. An example of a transformation chain is a spreadsheet program, where any of the cells can be a data source or a data target. An equation (i.e., a transformation) may be associated with any cell to cause that cell to be a data target where results of the equation are placed. As an example only, FIG. 6 illustrates a simple transformation chain 600 in which there is but a single link 620. In the drawing notation used throughout this description, a link will be illustrated as an arrow, with the input end being represented as the tail of the arrow, and the output end being represented as the head of the arrow. In cases in which there are multiple data sources at the input end of the link, the arrow will be represented with multiple tails. Copies of the values of the data source(s) at the tail(s) of the arrow represent input to the transformation. In cases in which there are multiple data targets affected by resulting value(s) of the transformation, the arrow will be represented with multiple heads. The values of the data target(s) at the head(s) of the arrow represent output from the transformation. For instance, FIG. 6 illustrates a simple transformation chain 600 that includes a data source 601, a data target 602, and a single link 620. The link 620 represents a transformation performed on a copy of the value 611 at the data source 601 in order to generate a value 612 at the data target 602. Should the value 611 change, the transformation represented by link 620 is automatically reevaluated potentially resulting in a change in the value 612 in the data target 602. FIG. 7 illustrates another simple example transformation chain 700 that includes three data sources 701, 702 and 703; two data targets 704 and 705, and a single link 720. The link 720 represents a transformation performed on copies of the values within the data sources 701, 702 and 703, in order to generate the values in the data targets 704 and 705. Should any of the values within the data sources 701, 702 or 703 change, the transformation link 720 is automatically reevaluated potentially resulting in a change in the values within any one or more of the data targets 704 and 705. FIG. 8 illustrates another example transformation chain 800, and illustrates the principle that transformation chains may build on each other in which a data source to one link may be a data target in other link, in order to create even more complicated transformation chains. For instance, the transformation chain 800 includes an instance 801 of the transformation chain 600, and an instance of 802 of the transformation chain 700. In this case, the data target 602 of the link 620 is also a data source 701 of the link 720. Should the value with the data source 601 change, the transformation represented by link 620 is reevaluated potentially resulting in a change in the value in the data target 602, which is likewise a data source 701 for the next link 720. Likewise, a change in a value of data source 701 would result in the transformation link 720 being reevaluated potentially resulting in a change in the values within any one or more of the data targets 704 and 705. Thus, a change in the value at data source 601 has the potential, through transformation reevaluation, to affect value(s) at node 602 (701) and at nodes 704 and 705. Data targets 704 and 705 might likewise represent data sources for yet other links. Accordingly, in complex transformation chains, a value change might cause propagated value changes through multiple nodes in a transformation chain through proper automated reevaluation of transformations within the transformation chain. While the example transformation chain 800 includes just two links, transformation chains may be quite complex and involve enumerable nodes and associated links connecting those enumerable nodes. The principles described herein may operate regardless of the complexity of the transformation chains. FIG. 9A through 9D illustrates example transformation chains instances or classes 900A through 900D. The instances will have the same structure as the classes, and so the illustrated forms may be considered to represent transformation classes as well as transformation instances. Instances will, however, have particular instance state associated with each of one or more of the nodes of the transformation chain. Accordingly, elements 900A through 900D may be referred to as transformation chain classes or transformation chain instances. The term “transformation chain” will be used to generally refer to both transformation chain classes and their associated transformation chain instances. The example transformation chains 900A through 900D are relatively simple in order to avoid obscuring the broader principles described herein with an overly complex example. That said, the principles described herein apply regardless of how complex the transformation chain, and regardless of the number of transformation chains and associated devices that are within the environment and forming the compound application. In the notation of FIGS. 9A through 9D, the nodes that belong to the transformation class 900N (where N ranges from A through D) are represented using the suffix N. For instance, in FIG. 9A, the transformation chain 900A includes nodes 901A, 902A, 903A, and 904A. The remaining elements 901B, 901C and 901D do not end with the “A” suffix, and thus are not nodes within the transformation chain 900A. Instead, the elements 901B, 901C and 901D represent dependencies with other transformation chains. Throughout FIGS. 9A through 9D, 10A through 10D, 11A through 11C, and 12, to emphasize those elements that are dependency elements, rather than nodes in the transformation chain itself, dependency elements are represented with dashed-lined boundaries. Data does not flow from a node to a dependency element unless the transformation chain is joined with another transformation chain that includes a node represented by the dependency element. The fact that data cannot flow along a particular transformation is represented throughout the figures by the link being marked with an “X”. For instance, element 901B in transformation chain 900A represents a dependency with node 901B in the transformation chain 900B. The dependency element 901B is bordered with dashed lines, and all links leading to or from that dependency element 901B are marked with an “X” since at this stage, the transformation chain 900A is not joined with the transformation chain 900B. Element 901C in transformation chain 900A represents a dependency with node 901C in transformation chain 900C. Element 901D in transformation chain 900A represents a dependency with node 901D in transformation chain class 900D. On its own, the transformation chain instance 900A can function as an application. For example, a copy of a value or copies of values from data source 901A may be used to form a transformed result as a value or values of data target 904A. Furthermore, a copy of a value or copies of values from data sources 901A and 902A may be transformed to result in a value or values of data target 903A. If the transformation chain instance 900A is on its own, the transformations leading to and from the elements 901B, 901C and 901D are not evaluated. The transformation chain 900B includes three nodes 901B, 902B and 903B. However, the transformation chain 900B also includes dependency elements 901A, 902A, 901C and 903C that reference a node in a different transformation chain. Again, the transformation chain instance 900B may operate independently as a single application. For example, a copy of a value or copies of values from data source 901B may be provided through a transformation to generate a resulting value or values for data target 902B. A copy of a value or copies of values from the data source 902B may be provided through a transformation to generate a resulting value or values for data target 903B. Though the transformation chain instances 900A and 900B may operate independently, FIG. 10A illustrates a joined transformation chain 1000A that includes transformation chain 900A joined with transformation chain 900B. Where appropriate, dependency elements in each of the transformation chains are now replaced with the actual node referred to. For example, dependency element 901B of FIG. 9A is now node 901B in FIG. 10A, and dependency elements 901A and 902A of FIG. 9B are now nodes 901A and 902A, respectively, in FIG. 10A. Thus, all of the nodes that have the suffix A or B are nodes within the transformation chain 1000A, and only those nodes that have suffixes C or D are dependency elements. For example, nodes 901A, 902A, 903A, 904A, 901B, 902B and 903B are nodes within the augmented transformation chain 1000A, and the functionality of the compound application becomes somewhat better, more complete, or at least different than the sum of the functionality of the individual transformation chains 900A and 900B on their own. The transformation chain 900C includes three nodes 901C, 902C and 903C. However, the transformation chain 900C also includes dependency elements 903A, 901B and 903B that reference a node in a different transformation chain. Again, the transformation chain instance 900C may operate independently as a single application. For example, a copy of a value or copies of values from data source 901C may be provided through a transformation to generate a resulting value or values for data target 902C. Likewise, a copy of a value or copies of values from the data source 901C may also be provided through a transformation to generate a resulting value or values for data target 903C. Though transformation chain instances 900A and 900C may operate independently, FIG. 10B illustrates a joined transformation chain 1000B that includes transformation chain 900A joined with transformation chain 900C. Dependency elements in each of the transformation chains are now replaced with the actual node referred to the extent that the dependency element refers to a node within any of transformation chains 900A or 900C. Now all of the nodes that have the suffix A or C are nodes within the transformation chain, and only those nodes that have suffixes B or D are dependency elements. For example, nodes 901A, 902A, 903A, 904A, 901C, 902C and 903C are nodes within the augmented transformation chain 1000B. The functionality of the compound application becomes better, more complex, or at least different than the sum of the functionalities of the individual transformation chain instances 900A and 900C. FIG. 10C illustrates a joined transformation chain 1000C that includes transformation chain class 900B joined with transformation chain class 900C. Dependency elements in each of the transformation chains are replaced with the actual node referred to the extent that the dependency element refers to a node within any of transformation chains 900B or 900C. Now all of the nodes that have the suffix B or C are nodes within the transformation chain, and only those nodes that have suffixes A or D are dependency elements. For instance, nodes 901B, 902B, 903B, 901C, 902C and 903C are nodes within the augmented transformation chain 1000C, and the functionality of the compound application becomes better, more complex, or at least different than the sum of the functionalities of the individual transformation chain instances 900B and 900C. FIG. 11A illustrates a joined transformation chain 1100A that includes transformation chains 900A, 900B and 900C also being joined. Dependency elements in each of the transformation chains are replaced with the actual node referred to the extent that the dependency element refers to a node within any of transformation chains 900A, 900B or 900C. Note that all of the illustrated nodes are actually nodes in the transformation chain, except for dependency element 901D. The functionality of the compound application becomes better, more complex, or at least different than the sum of the functionality of the individual transformation chains 900A, 900B and 900C; the sum of the functionality of the individual transformation chains 1000A and 900C; or the sum of the functionality of the individual transformation chains 900A and 1000B. The transformation chain 900D includes two nodes 901D and 902D. However, the transformation chain 900D also includes a single dependency element 903A referencing a node in a different transformation chain class 900A. Again, instances of the transformation chain class 900D may operate independently as a single application. For instance, a copy of a value or copies of values from data source 901D may be provided through a transformation to generate a resulting value or values for data target 902D. Though transformation chain instances 900A and 900D may operate independently, FIG. 10D illustrates a joined transformation chain 1000D that includes transformation chain 900A joined with transformation chain 900D. Dependency elements in each of the transformation chains are now replaced with the actual node referred to the extent that the dependency element refers to a node within any of transformation chains 900A or 900D. Now all of the nodes that have the suffix A or D are nodes within the transformation chain, and only those nodes that have suffixes B or C are dependency elements. For instance, nodes 901A, 902A, 903A, 904A, 901D and 902D are nodes within the augmented transformation chain 1000D, and the functionality of the compound application becomes somewhat better than the sum of the functionality of the individual transformation chain 900A and 900D. Note that FIGS. 10A through 10D illustrate all of the possible permutations involving two and only two of the transformation chains 900A, 900B, 900C and 900D. The transformation chains 900B and 900D are not joined directly in a two transformation chain combination, since neither transformation chain has a dependency element referring to a node in the other transformation chain. Furthermore, transformation 900C and 900D are not joined directly in a two transformation chain combination, since neither has a dependency reference to the other. FIG. 11A illustrates one of three possible combinations of three and only three transformation chains 900A, 900B, 900C and 900D. In particular, FIG. 11A illustrates an augmented transformation chain 1100A that combines transformation chains 900A, 900B and 900C. FIG. 11B illustrates an augmented transformation chain 1100B that combines transformation chains 900A, 900B and 900D (in which all nodes are part of the transformation chain except dependency elements 901C and 903C). FIG. 11C illustrates an augmented transformation chain 1100C that combines transformation chains 900A, 900C and 900D (in which all nodes are part of the transformation chain except dependency elements 901B and 903B). Note that there is no combination of transformation chains 900B, 900C, and 900D illustrated since the transformation chain 900D includes no dependency references to transformation chain 900B (or vice versa), or to transformation chain 900C (or vice versa). FIG. 12 illustrates a combined transformation chain 1200 that includes all of the transformation chains 900A, 900B, 900C and 900D combined. Accordingly, given the transformation chains 900A, 900B, 900C and 900D in the environment, there are 8 possible compound applications that may be formed (corresponding to the transformation chains of FIGS. 10A through 10D, FIGS. 11A through 11C, and FIG. 12). Thus, as the transformation chains of various devices are joined into and decoupled from the environment, the very transformation chain itself changes, and the structure of the compound application thereby changes. For instance, a change in the value of data source 901A might have a very different impact on the transformation chain as the effects of that change are automatically propagated through one or more transformations, depending on whether that data source 901A is within transformation chain 900A alone, within transformation chain 1000A, within transformation chain 1000B, within transformation chain 1000D, within transformation chain 1100A, within transformation chain 1100B, within transformation chain 1100C, or within transformation chain 1200. Any of the nodes of a transformation chain may have zero or more input endpoints where inputs are received from an endpoint interface entity, and zero or more output endpoints where outputs are provided to an endpoint interface entity. In this description and in the claims, an “endpoint interface entity” is defined as a hardware entity and zero of more environmental criteria. In the case of there being zero environmental criteria associated with an endpoint interface entity, the endpoint interface is simply a hardware entity (such as a device or computing system). In the description and in the claims, “a hardware entity” refers to any single or combination of physical items that have the capability to potentially interface with an endpoint. For instance, a hardware entity that provides input or receives input might be a data store, or a location in a data store, a user device, a microphone or microphone array, a camera or camera array, three-dimensional sensors, image recognizers, or the like. If the hardware entity and corresponding one or more environmental criteria together define an endpoint interface entity, then the hardware entity is indeed the endpoint interface entity so long as the environmental criteria are satisfied. However, if the environmental criteria cease to be satisfied, then the hardware entity would lose its status as an endpoint interface entity. In this description, the terms “endpoint interface entity” and “hardware entity” may frequently be used interchangeably on the assumption that if the endpoint interface entity does have environmental criteria, that those criteria remain satisfied in that case. Furthermore, when the term “environmental criteria” is mentioned with respect to a hardware entity or an endpoint interface entity, the environmental criteria for the hardware entity becoming the endpoint interface entity may be different than the environment criteria for the hardware entity ceasing to be the endpoint interface entity. Thus, there may be some hysteresis built into the environmental criteria to avoid rapid changes in whether or not a particular hardware entity qualifies as a particular endpoint interface entity. Examples of environmental criteria will now be provided with the understanding that the principles described herein are not limited to any particular environment criteria. One environmental criterion might be that the hardware entity has an associated identified user or identified group of users. For instance, if a given user or group of users is using a hardware entity, then the hardware entity may become an endpoint interface entity. If another user or group of users is using the hardware entity, then perhaps the hardware entity does not act as an endpoint interface entity. Other examples of environmental criteria might include the position, vantage point, or orientation of a user or group of users within an environment and/or with respect to a hardware entity, the position of an audio source in the environment, background noise levels, whether an audio signature is present, whether a security zone surrounding the environment has been violated, whether an individual has fallen in the environment, the temperature of the environment, the available network connections in the environment, a lighting level and/or configuration, a time of day or week or month or year, and so on for any imaginable environmental criteria. As an example, a mounted flat panel display having multiple viewers oriented to be able to see the flat panel display might be an appropriate endpoint interface device, but if there is but a single viewer, and the node has input endpoints, perhaps a touchscreen device in the hands of the single viewer might be the better endpoint interface device for a given endpoint. As a second example, suppose that there was output was being displayed on a television, and a security system is activated, the activation of the security system might be an environmental criteria that causes some or all of the information displayed on the television to be obscured, or perhaps even cause the television to stop being an endpoint interface entity, and thus disconnect from the application. FIG. 13 illustrates a node 1300 of a transformation chain that includes input endpoints 1310 and output endpoints 1320. The input endpoints 1310 are illustrated as including endpoints 1311 through 1314, are represented as triangles, with the ellipses 1315 representing that the node 1300 may have any number of input endpoints. The output endpoints 1320 are illustrated as including endpoints 1321 through 1323, are represented as squares, with the ellipses 1324 representing that the node 1300 may have any number of output endpoints. The number and type of input and output endpoints may be defined by the transformation chain class(es) that include the node, or the class may provide flexibility in how many input and/or output endpoints are included with each instance of node 1300 in its respective instances of those transformation chain class(es). The endpoints themselves may be considered to be trivial nodes of a transformation class as all they do is provide output to, or receive input from a respective endpoint interface entity. The endpoints are generally not illustrated in FIGS. 1 through 12. The endpoint are however, the mechanism by which the transformation chains interact with the physical world through storage, display, input, actuation, audio, text, or the like. The general concept of the transformation chains has been described with respect to FIGS. 1 through 13 with respect to specific examples of transformation chains that have particular nodes and particular dependency elements. However, the principles described herein apply to any transformation chain having any number of nodes and any number of dependency elements, regardless of the function of the node and identity of the dependency element. Accordingly, the principles described herein may be applied to a limitless variety of transformation chains performing a limitless variety of functions. One or more endpoint interface entities have credentials to interface with the endpoints of a transformation chain instance or portions thereof. Such credentials may include credentials to provide input to some or all of the endpoints of one or more or all nodes of a transformation chain instance, credentials to receive output from some or all of the endpoints of one or more or all nodes of a transformation chain instance, or even the power to delegate credentialed power to one or more delegate endpoint interface entities. Transformation Chain Supporting Architecture In accordance with the principles described herein, an architecture is described in which transformation chains may be combined incrementally forming dynamically changing functions at runtime, thereby changing the concept of what an application is. With the benefit of reading this description, transformation chains are like molecules floating within an environment, and with the proper impetus, such molecules combine resulting in a compound that operates differently from its constituent parts. For instance, given the right impetus, two hydrogen molecules may combine with an oxygen atom to formulate a molecule of water. While liquid hydrogen and liquid oxygen cannot be consumed by humans, liquid water can and must be consumed by human beings. Thus, the principles described herein allow molecules of transformation chains to be joined dynamically and incrementally to formulate customized applications that provide customized functionality that is suitable to the impetus experienced. Such applications may be so customized that there may be times that a particular application is only constructed once. The principles described herein also allow a delegator endpoint interface entity to delegate power to another delegate endpoint interface entity to interface with certain endpoints, without the delegator endpoint interface entity giving up control of how the delegate endpoint interface affects the transformation chain instance. Accordingly, the principles described herein also allow a transformation chain to be safely split. Through atomic and molecular composition, a seemingly infinite variety of animate and inanimate objects, and entire worlds, have formed. Currently, there are only 115 known elements in the periodic table of the elements from which an infinite variety of animate and inanimate objects throughout the universe are composed. Using only a limited number of transformation chains, that may be combined in certain ways, there is a substantially limitless variety of applications of a substantially limitless variety of functions that may be generated in a universe of possible applications. Accordingly, the principles described herein describe a new organic paradigm in incrementally building application and sharing split applications to suit the very present circumstances. Furthermore, the principles described herein allow for the careful tracking of credentials of which endpoint interface entity may interact with which endpoint of which nodes of which transformation chains, and allows for temporary, or even permanent delegation of such credentials to other endpoint interface entities. Accordingly, a wide variety of collaboration scenarios are enabled in such an organic application environment. FIG. 14 illustrates a runtime architecture 1400 in which this new paradigm in applications may be implemented. The runtime architecture 1400 includes a universal canvas 1410. The universal canvas 1410 represents the universe in which transformation chain instances are formed, combined, operated, and extinguished. As an example, the universal canvas 1410 is illustrated as operating eight transformation chains 1411 through 1418 of varying complexity. However, the ellipses 1419 represent that the universal canvas 1410 may run many transformation chain instances. Given sufficient resources, the universal canvas 1410 may even run millions or billions of application chain instances. The runtime architecture also includes a supporting architecture 1420 that includes modules and components that operate outside of the observable universal canvas 1410, to ensure the appropriate formation, combination, sharing, operation, and extinguishing of the transformation chain instances. The supporting architecture 1420 itself can receive input and provide output at represented by bi-directional arrow 1421. The supporting architecture 1420 may also provide access to services as represented by bi-directional arrow 1422. The supporting architecture 1420 also interacts with the universal canvas 1410 as represented by the bi-directional arrow 1423 for purposes of instantiating transformation chains, combining transformation chain instances, altering transformation chain instances, enforcing credentialed use of the transformation chain instances by appropriate endpoint interface entities, extinguishing transformation chain instances, and the like. The precise physical platform on which the universal canvas 1410 is run is not critical. In fact, there can be great flexibility and dynamic change in the physical platform on which the universal canvas 1410 is operated. Some nodes of some transformation chains may be operated by one physical platform (such as a device, endpoint interface entity, system, or cloud, while other nodes operate another physical platform). In one embodiment, the universal canvas 1410 operates in a cloud computing environment, such as a private cloud, a hybrid cloud, or a public cloud. As an example, the universal campus may be within a local network, in a peer-to-peer computing network, in a cloud computing environment, in any other network configuration, or in any combination of the above. Even so, as previously mentioned, the universal canvas interfaces with the physical world through the endpoints of the various nodes of the transformation chain instances. Likewise, the supporting architecture 1420 may be operated in any computing environment, in peer-to-peer computing network, in a local network, any other network configuration, or in any combination of these. In the case where the transformation chain instances within the universal campus 1410 operate fully or primarily, or even party in a cloud computing environment, it may be this same cloud computing environment that operates the supporting architecture. In this description and the following claims, “cloud computing” is defined as a model for enabling on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services). The definition of “cloud computing” is not limited to any of the other numerous advantages that can be obtained from such a model when properly deployed. For instance, cloud computing is currently employed in the marketplace so as to offer ubiquitous and convenient on-demand access to the shared pool of configurable computing resources. Furthermore, the shared pool of configurable computing resources can be rapidly provisioned via virtualization and released with low management effort or service provider interaction, and then scaled accordingly. A cloud computing model can be composed of various characteristics such as on-demand self-service, broad network access, resource pooling, rapid elasticity, measured service, and so forth. A cloud computing model may also come in the form of various service models such as, for example, Software as a Service (“SaaS”), Platform as a Service (“PaaS”), and Infrastructure as a Service (“IaaS”). The cloud computing model may also be deployed using different deployment models such as private cloud, community cloud, public cloud, hybrid cloud, and so forth. In this description and in the claims, a “cloud computing environment” is an environment in which cloud computing is employed. The supporting environment 1420 includes a number of modules 1430. One of the modules 1430 is a summoning module 1431 that interprets input and in response determines that a class of a transformation chain is to be instantiated. For instance, the input may be received directly from input (from arrow 1421) to the supporting environment 1420 or via input from a transformation chain instance running in the universal canvas 1410 itself. Input that may be received from either source will be referred to herein as “general input”. Summoning criteria are used for recognizing that certain general input is to result in a transformation chain instance being created. Summoning criteria may be also any environmental criteria at all. For instance, the summoning criteria may take into account not just verbal conversations, or explicit user input directed at a hardware entity, but may also take into consideration other environmental factors. For instance, whether a particular user is sitting down, moving away, looking somewhere, being near a device with a touch screen, and so forth, may also be environmental criteria used as summoning criteria for summoning an instance of a transformation chain class to be created within the universal canvas 1410. The modules 1430 also includes a chain class module 1432 that instantiates transformation chain instances in response to determinations made by the summoning module 1431 and/or in response to general input. The modules 1430 also includes a chain class maintenance module 1433 that maintains a copy of each transformation chain class. The chain class maintenance module 1433 may add to the library of available transformation chain classes in response to a determination made by the summonsing module 1431 and/or in response to general input. Thus, the chain class maintenance module may maintain a registry of transformation chain classes. For instance, the chain class maintenance module 1433 might merge classes along their appropriate points of dependency, or perhaps create a transformation chain class that represents a redacted or truncated version of a pre-existing transformation chain class. Some transformation chain classes may be created temporarily, whilst others may have more lasting persistence. Furthermore, authentication and authorization may be imposed so as to restrict which entities may instantiate transformation chains of certain classes. A merging module 1434 merges instances of transformation chains to be operated in the universal canvas 1410 in an appropriate way given the dependencies of the transformation chains. Such merging occurs in response to determinations made by the summoning module 1431 and/or in response to other general input. The merging criteria may also be any general environment criteria. Again, the merging criteria may take into account not just verbal conversations, or explicit user input directed at a hardware entity, but may also take into consideration other environmental factors that are deemed appropriate for the merging to occur. An endpoint interface entity registry module 1435 maintains a registry of all possible endpoint interface entities (hardware entities and potentially associated user criteria), as well as which endpoint interface entities are presently active and available given a particular instantiated transformation chain operating within the universal canvas 1410. An environmental module 1436 detects when endpoint interface entities become active or inactive for a given instantiated transformation chain operating within the universal canvas 1410. For instance, the environmental module 1436 might detect when an initiating set of environment criteria for a hardware entity of a particular endpoint interface entity begin to be met resulting in the endpoint interface entity being available for the application (for interacting with the endpoints of the application). Likewise, the environment module 1436 might detect when a terminating set of one or more environmental criteria for the hardware entity of the particular entity is met resulting in the endpoint interface entity no longer being available for the application. An endpoint matching module 1437 determines which active endpoint interface entities for an instantiated transformation chain are capable of and credentialed to provide input for each input endpoint of that transformation chain that is capable of receiving input from the physical world, and determining a proper form of the input given that endpoint interface entity. The endpoint matching module 1437 also determines which active endpoint interface entities for an instantiated transformation chain are capable of and credentialed to receive output for each output endpoint of the transformation chain that is capable of presenting output into the physical world. The modules 1430 includes a presentation module 1438 that, when there are multiple eligible endpoint interface entities that are capable of providing input into an input endpoint, decides which endpoint interface entity is to provide that input, and potentially decides that multiple endpoint interface entities are capable of providing input into that input endpoint. Furthermore, when there are multiple eligible endpoint interface entities that are capable of rendering output from an output endpoint, the presentation module 1438 decides which endpoint interface entity is to provide that input, and potentially decides which of multiple endpoint interface entities are to render the output received from the output endpoint. The presentation module 1438 also decides whether any restrictions are to be imposed when a particular endpoint interface module provides input to an input endpoint of a transformation chain. The presentation module 1438 may also decide whether there are any restrictions that are to be imposed when a particular endpoint interface module renders output from an output endpoint of a transformation chain. When that output is visualizations, the presentation module 1438 may decide how visualized information is to be formatted and/or laid out on the display of the endpoint interface entity. The modules 1430 also includes a delegation module 1439 that allows and facilitates credentialed endpoint interface entity to delegate power to a delegee endpoint interface entity with respect to receiving output from or providing input to particular endpoints of a transformation chain instance. As such, delegation module 1439 facilitates splitting of transformation chain application, thereby allowing dynamic movement into and out of collaborative scenarios. There may be other modules within the modules 1430 as represented by the ellipses 1440. Transformation Chain Operation Having now described transformation chain applications, and an architecture that facilitates operation of transformation chain applications with respect to FIGS. 6 through 14, example operations of the transformation chains and the supporting architecture will now be described with respect to FIGS. 15 through 23. First, the dynamic building of transformation chain instances will be described. The dynamic building of transformation chain instances will now be described. In accordance with the principles described herein, transformation chains may be combined incrementally and with ease of effort forming dynamically changing functions at runtime. Transformation chains are like molecules floating within an environment, and with the proper impetus, such molecules combine resulting in a compound that operates differently from its constituent parts. Thus, the principles described herein allow instances of transformation chains to be joined dynamically and incrementally to formulate customized applications that provide customized functionality that is suitable to the impetus experienced. As a concrete example, suppose that there is a transformation chain that extracts received orders from a database. A verbal command to “show me my orders” by a sales representative might instantiate that transformation chain class, filter by the user that stated the verbal command, and visualize the filtered list or orders. A subsequent join instruction might be “Fetch me my customers”, which might then cause another transformation chain to automatically join with the prior transformation chain to match customers with orders, and visualize the orders by customers. The user might then state “add order exceptions for customers” causing perhaps yet another transformation chain to join the existing transformation chain aggregation, and/or cause input to be made to an existing node of the current aggregation of transformation chains. At each stage, the user may determine based on the current state of the aggregated transformation chain what is lacking, and state or input further joining instructions, from which yet other transformation chains may be join in the growing customized application chain. In essence, the application is built as the user thinks and expresses intuitively what he or she wants, and the application is built in a manner that is sensitive to the environment. FIG. 15 illustrates a flowchart of a method 1500 for formulating an application in response to detecting one or more environment events, which represents a simple case in which an instance of a transformation chain is created and operated within the universal canvas 1410. First, a set of one or more environmental events (e.g., the presence of a user) is detected (act 1501). For instance, the summoning module 1431 might detect one or more environmental events that are to trigger instantiation of a particular transformation chain class. Responsive to the detected environment event(s), the transformation class corresponding to the input is selected (act 1502). For instance, the summoning module 1431 or the chain class module 1432 may select which of the available transformation chain classes (maintained by the chain class maintenance module 1423) corresponds to the detected environmental event(s). An instance of the transformation chain class is then created (act 1503). For instance, the chain class module 1432 might instantiate an instance of the identified transformation chain class. When instantiating the transformation chain class, the endpoint interface entity matching module 1437 may provide appropriate credentials to one or more appropriate endpoint interface entities so that such entities are credentialed to receive output from and/or provide input to one or more endpoints of the transformation chain instance. Optionally, the instance may then be operated (act 1504). For instance, in FIG. 14, the instance of the transformation chain class may be deployed and operated within the universal canvas 1410. As part of this operation (act 1504), the environmental module 1436 detects which of the registered endpoint interface entities are active for the given instantiated transformation chain. Furthermore, the endpoint interface entity matching module 1437 determines which active endpoint interface entity endpoints for the instantiated transformation chain should provide input for each endpoint of each node of the transformation chain that is capable of receiving input from the physical world, and what forms of input are acceptable. Furthermore, the endpoint interface entity matching module 1437 determines which active endpoint interface entities for the instantiated transformation chain should receive output for each output endpoint of each node of the transformation chain that is capable of realizing (e.g., visualizing, rendering, sounding, storing, actuating, and the like) output into the physical world, and what forms of output are acceptable. At some point, further environmental event(s) are detected (such as user input) which directs that an instance of another transformation chain class is to be combined with an existing transformation chain instance. Accordingly, FIG. 16 illustrates a flowchart of a method 1600 for responding to further detected environment event(s) to thereby combine transformation chain instances. The method 1600 is initiated by detecting further environmental event(s) (act 1601) that is constituent with combination of two instances of transformation classes. As an example, a transformation chain instance may be combined with the instance created in method 1500, or perhaps may be combined with an instance of a transformation chain created by a previous performance of the method 1600 of FIG. 16. Although not required, the instance to which the transformation chain instance is to be joined may have previously operated as an application already. Thus, the method 1600 may be repeatedly performed in order to build a sophisticated and customized transformation chain in response to various detected environmental events. The detected environment events of act 1601 may be an expressed instruction to join. For instance, the user might have a user interface that allows explicit selection of a desired application chain class to be instantiated. Alternatively, the detected environment events of act 1601 may simply be an implicit indication that two transformation chain instances should be joined. For instance, the detected environment events might be any activity, such as particular speech, that is consistent with the joining of two instances of different transformation chain classes. Such input could include gestures, requests, and the like. For instance, as previously mentioned, a sales representative might state “fetch me my customers” in the context of the representatives corresponding orders already being visualized. The system may even guess at what transformation chain the user might want based on history and current context. In that case, the user establishing the current context could be the environmental event(s) that cause the new transformation chain to be instantiated that the system guesses may be desired at some future point. For instance, perhaps the system knows that when in a particular conversation the users keep talking about a particular order, the system might join transformation chain instances used to acquire that order in anticipation of showing that order. Whatever form the joining environment event(s) takes, the summoning module 1431 of FIG. 14 detects appropriate environmental event(s) that corresponds to the instantiation of a transformation chain class (as described with respect to FIG. 15) or the joining of two transformation instances (as will be described with respect to FIG. 16). The method 1600 then includes determining, from the further detected environmental event(s), that an instance of one transformation chain class is to be joined with an instance of another transformation chain class (act 1602). For instance, as described above, there are class-level restrictions in which the transformation chain class author expressly makes it possible, at least under some conditions, for instances of two transformation chain classes to be joined. For instance, the dependency elements of FIGS. 9A through 11C are an example of such class-level restrictions and authorizations. However, there may also be instance-level authorization. As an example, the act 1502 may involve consulting a set of one or more rules defining one or more conditions for joining an instance of the first transformation chain class and the second transformation chain class. This set of rules may be dynamic and change over time. For instance, the joining logic may learn over time that certain gestures or other user activity is, or is not, indicative of a user intent or anticipated future user intent to combine such instances. Accordingly, the supporting architecture may observe a history associated with each of multiple users in order to, over time, more accurately predict user intention, depending on a history of a particular user, or group of users, and thereby formulate an appropriate set of summoning and merging criteria. The act 1602 may be performed by, for instance, by the chain class module 1432 with reference to the transformation chain classes known to the class maintenance module 1433. The endpoint interface entity matching module 1437 may reevaluate which endpoint interface entities have credentials to interface with which endpoints of the composite aggregated transformation chain instance. The author of a transformation chain class might also express restrictions at the granularity of a single dependency. For instance, in the dependence element 901B of transformation chain class 900A, the author might express that joining is authorized on that dependency element only if the transformation chain into which it is joined does not include an identified transformation chain class authored by a competitor. The author might also control data that is flowed out of the transformation chain to another joined transformation chain by writing restrictions or conditions into the transformation that would bridge the dependency itself (e.g., between nodes 901A and dependency element 901B). However, even though transformation chain classes may interoperate, that does not mean that the user wants their particular instance of that transformation chain class to join with other instances of other transformation chain classes. After all, the data itself (e.g., the instance state) might be sensitive to the user. Accordingly, the method also may include determining that instances of different transformation chain classes are to be joined. The joining criteria for authorizing two instance of different transformation chain classes to join may include one or more of the following: whether or not the user is on a meeting attendee list, a relationship (e.g., family, social network friend, or the like) of users of the various devices, a communication capability (e.g., near field) between the devices, a proximity of the respective devices (e.g., in the same conference room), the request of the users, of the like. For instance, the joining criteria might include some business criteria such as the associated users of the instances are on the same team. As another example, one device might be a kiosk in a retail space or hotel, where a customer uses the kiosk and a shop assistant or concierge can automatically use their device to join their transformation chain with that of the kiosk to thereby interact with the customer using the compound application. Conditions may be applied to the joining criteria. For instance, a bellhop's device might be able to join a customer's application if the concierge is not around (perhaps detected by the concierge not actively using the pairable application to join with that of customers, or being off network). In some embodiments, the first transformation chain class used to instantiate the first of the two instances to be joined may be derived from an existing transformation chain class. As an example, the first transformation chain class may be the same as the first transformation chain class, except with one or more nodes of the transformation chain removed. In response to the act of determining that the two instances are to be joined (act 1602), the two instances are joined (act 1603), so as to establish connections across one or more flow dependencies of the instance, thereby creating new avenues for data flow, and new application functionality. For instance, this joining may be accomplished by the merging module 1434. The joined instance may thereafter be operated (act 1604). In one embodiment, the instances themselves are directed joined without defining any new combined transformation chain classes. For instance, FIG. 17A illustrates a flowchart of a method 1700A for joining two instances and represents an example of the act 1603 of FIG. 16. The first instance of the first transformation chain class is instantiated (act 1701A) and perhaps operated (act 1711). Furthermore, the second instance of the second transformation chain class is instantiated (act 1702A) and perhaps operated (act 1721). Thereafter, the two instances are joined (act 1703A). In other embodiments, the transformation chain classes themselves are aggregated to define a new combined class, and an instance of that aggregated class is instantiated to thereby accomplish act 1603. The combined instance may exist temporarily, may be kept for the benefit of a limited number of one or more users, or may even be added to the library of transformation chain classes that are available for more widespread use. For instance, FIG. 17B illustrates a flowchart of a method 1700B that represents another example of the act 1603 of FIG. 16. The first transformation chain class is accessed (act 1701B) and the second transformation chain class is accessed (act 1702B). The two classes are then combined (act 1703B). An instance is then created from the combined transformation chain class (act 1704). As an example only, perhaps method 1500 or act 1701A of method 1700A might be employed to create an instance of a transformation chain of FIG. 9A. Now suppose that environmental event(s) are detected that suggest combination of instances of transformation chains of FIGS. 9A and 9B. Method 1600 may then be performed to create the instance of the transformation chain of FIG. 10A. In that case, act 1701A of method 1700 would instantiate from the transformation chain class of FIG. 9A, and act 1702A of method 1700 would instantiate from the transformation chain class of FIG. 9B. The result may be thought of as an instantiation of the aggregated class of the classes of FIGS. 9A and 9B (which is represented in FIG. 10A). Now suppose that environmental event(s) are detected that suggest combination of instances of transformation chains of FIGS. 10A and 9C. The method 1600 may then be performed to create the instance of the transformation chain of FIG. 10A. In that case, act 1701A of method 1700A would be used to instantiate (in which the result from the prior performance of the method to create the transformation chain instance of FIG. 10A could be viewed as instantiating from the aggregated classes of FIGS. 9A and 9B) an instance of FIG. 10A. Furthermore, act 1701B of method 1700 would be used instantiate from the transformation chain class of FIG. 9C. The result may be thought of as an instantiation of the aggregated class of the classes of FIGS. 10A and 9C (which is represented in FIG. 11A). Now suppose that environmental events are detected that suggests combination of instances of transformation chains of FIGS. 11A and 9D. The method 1600 may then be performed to create the instance of the transformation chain of FIG. 11A. In that case, act 1701A of method 1700A would be used to instantiate an instance of FIG. 11A. Furthermore, act 1701B of method 1700 would be used instantiate from the transformation chain class of FIG. 9D. The result may be thought of as an instantiation of the aggregated class of the classes of FIGS. 11A and 9D (which is represented in FIG. 12). Having now described the general principles of transformation chains, the environment in which they may operate, and their principles of aggregation, this description will now address how a delegator endpoint interface entity having credentials on a transformation chain instance may delegate power to a delegee endpoint interface entity to receive output from particular endpoint(s) and/or provided input to particular endpoint(s). Accordingly, application splitting and sharing is made possible in this organic universal canvas of transformation chain instances. FIG. 18A illustrates an example transformation chain 1800 in a state 1800A in which it is about to be split. FIG. 19 illustrates a flowchart of a method 1900 for formulating a split application. As the method 1900 may be performed in the context of the example transformation chains 1800A and 1800B of FIGS. 18A and 18B, respectively, the method 1900 of FIG. 19 will be described with frequent reference to the example transformation chains 1800A and 1800B. As illustrated in FIG. 18A, the example transformation chain 1800A includes six nodes 1801 through 1806. Each of the nodes may have zero or more input endpoints and zero or more output endpoints. However, to keep the diagram cleaner, the endpoints are not illustrated for the example transformation chain 1800A of FIG. 18A. Likewise, the endpoints are not illustrated for the example transformation chain 1800B in FIG. 18B. In the initial state 1800A of FIG. 18A, a particular endpoint interface entity (referred to herein as a “first endpoint interface entity”) is credentialed to provide input to and receive output from endpoints of transformation chain 1800A. The scope of this credential is represented by the dashed lined boundary 1810. Now suppose that the application represented by the transformation chain 1800A is to be split. For instance, the application may be split when sets of shareable information that are generated by one portion of the application are to be shared with another output device. In that case, the portion of the application is run on behalf of or on the second output device for rendering of the set of shareable information on the second device. That is, suppose that the first endpoint interface entity provides interaction or input suggesting that a transformation chain instance representing a portion of the larger transformation chain instance 1800A is to be created (e.g., in response to a “Yes” in decision block 220 of FIG. 2). There may be several reasons for performing such a split. One reason might be simply because the first endpoint interface entity is to use another instance of just that portion of the larger transformation chain class. Another reason might be to delegate input and/or output privileges associated with one, some, or all of the endpoints of those nodes that are part of the portion to another endpoint interface entity. In other words, the first endpoint interface entity assigns the portion of the transformation chain, at least temporarily, to the second endpoint interface entity. A redaction and share gesture may be used to express this intent to delegate. For instance, a user might cross over a certain portion of the user interface (indicating that the target endpoint interface entity is not to have the ability to view or input into those fields), and then indicate a share gesture. In any case, interaction and/or environmental event(s) are detected that are representative of splitting an instance of a smaller class off of the larger transformation chain class (act 1901), thereby initiating the method 1900 of FIG. 19. Based on the detected environment event(s), the system determines that a portion transformation chain class is to be created (act 1902) that represents a portion of the larger transformation chain class. This determination might be made by, for instance, the delegation module 1439 of FIG. 14. For instance, referring to FIG. 18A, suppose that a portion transformation chain class is to be created that is represented only by nodes 1805 and 1806. In response, an instance of the portion transformation chain class is instantiated (act 1903) and operated (act 1904). For instance, the second endpoint interface entity may be instructed (by the first endpoint interface entity and/or by the delegation module 1439) to interact with the endpoints of the instantiated portion transformation chain class. The instantiated portion transformation chain class may be sent to the second endpoint interface entity. FIG. 18B represents the portion resulting transformation chain 1800B that includes just the node 1805 and the node 1806. A dotted lined border 1820 is illustrated to represent that a particular endpoint interface entity may have credentials to interface with some or all of the endpoints of the nodes 1805 and 1806. In one embodiment, the splitting is not made for purposes of delegation, and the first endpoint interface entity also has credentials to interface with the endpoints of nodes 1805 and 1806 in the new portion transformation chain 1800B. However, a very useful scenario is that the first endpoint interface entity has delegated privileges to a second endpoint interface entity to interface with at least some endpoints of the nodes 1805 and 1806 of the portion transformation chain 1800B. FIG. 20A through 20D illustrate several possible embodiments of how such delegation might occur from the perspective of the portion transformation chain 1800B. In the symbolism of FIGS. 20A through 20D, a node represented by dashed lined borders represents a node of which only some of the endpoints of the original node are available for interfacing with the second endpoint interface entity. In the embodiment 2000A of FIG. 20A, the node 1805 is illustrated with as a solid circle, representing that all endpoints of the node 1805 have been instantiated and made available to the second endpoint interface entity. Meanwhile, the node 1806 is illustrated with a dashed-lined circle, representing that only a portion of the endpoints of the node 1806 have been instantiated and made available to the second endpoint interface entity. In the embodiment 2000B of FIG. 20B, the node 1806 is illustrated with as a solid circle, representing that all endpoints of the node 1806 have been instantiated and made available to the second endpoint interface entity. Meanwhile, the node 1805 is illustrated with a dashed-lined circle, representing that only a portion of the endpoints of the node 1805 have been instantiated and made available to the second endpoint interface entity. In the embodiment 2000C of FIG. 20C, the nodes 1805 and 1806 are both illustrated with a dashed-lined circle, representing that only a portion of the endpoints of each of the nodes 1805 and 1806 have been instantiated and made available to the second endpoint interface entity. In the embodiment 2000D of FIG. 20D, the nodes 1805 and 1806 are both illustrated as a solid circuit, representing that all of the endpoints of each of the nodes 1805 and 1806 have been instantiated and made available to the second endpoint interface entity. Note that there need be no change to the instance of the transformation chain 1800 that is in state 1800A from the perspective of the first endpoint interface entity. In that case, whatever endpoints are created for nodes 1805 and 1806 for the second endpoint interface entity may simply be cloned endpoints. During operation, if a cloned input endpoint received inconsistent input from both the first endpoint interface entity and the second interface entity, merging criteria may resolve the inconsistency. For instance, perhaps inconsistencies are resolved in favor of the delegating endpoint interface entity. Merging operations may be provided by, for instance, the delegation module 1439 of FIG. 14. In an alternative embodiment, a remainder instance may be created that represents a logical remainder when the portion instance 1800B is subtracted from the larger instance 1800A, and thus no endpoint are cloned at all. For instance, in the case of FIG. 20D, in which the second endpoint interface entity is given access to all endpoints of the nodes 1805 and 1805, a remainder instance may be created with just the nodes 1801 through 1804. In the case of FIG. 20A, the remainder instance might include nodes 1801 through 1804 and a limited form of node and 1806 with only the endpoints that were not included with the node 1806 of the remainder instance being included in the portion instance 2000A. In the case of FIG. 20B, the remainder instance might include nodes 1801 through 1804, and a limited form of node 1805 with only the endpoints that were not included with the node 1805 of the remainder instance being included within the portion instance 2000B. In the case of FIG. 20C, the remainder instance might include nodes 1801 through 1804, and a limited form of node 1805 and 1806 with only the endpoints that were not included with the nodes 1805 and 1806 of the remainder instance being included within the portion instance 2000B. In operation, the delegation module 1439 may allow the first endpoint interface entity to maintain control or supervision over the actions of the second endpoint interface entity in interacting with the portion 1800B of the transformation chain 1800A. For instance, the second endpoint interface entity may be credentialed through the first endpoint interface with respect to the portion 1800B such that data flows to and from the instance of the portion transformation class 1800B are approved by and/or channeled through the remainder of the transformation chain 1800A controlled by the first endpoint interface entity. Furthermore, the access of the second endpoint interface entity to data (such as a data service) is strictly controlled. Data for nodes that are not within the portion transformation chain class are provided via the approval of the first endpoint interface entity. FIG. 21 illustrates an architecture 2100 in which the larger transformation chain instance 2101A that is assigned to a first endpoint interface 2121A securely interfaces with apportion transformation chain instance 2101B that is assigned to a second endpoint interface 2121B via a proxy service 2110. The larger transformation chain instance 2101A is similar to the transformation chain 1800A of FIG. 18A, except that the first endpoint interface entity 2121A may access only a portion of the endpoints of the node 1805 (now referred to as node 1805A since it now has more limited interfacing capability with the first endpoint interface entity 2121A) and node 1806 (now referred to as node 1806A since it now has more limited interface capability with the first endpoint interface entity 2121A). The ability of the first endpoint interface entity 2121A to interface with the larger transformation chain instance 2101A is represented by bi-directional arrow 2122A. The portion transformation chain instance 2101B is similar to the portion transformation chain 1800B of FIG. 18B, except that (similar to the case of FIG. 20C) the second endpoint interface entity 2121B may access only a portion of the endpoints of the node 1805 (now referred to as node 1805B since it now has more limited interfacing capability with the second endpoint interface entity 2121B) and node 1806 (now referred to as node 1806B since it now has more limited interface capability with the second endpoint interface entity 2121B). The ability of the second endpoint interface entity 2121B to interface with the portion transformation chain instance 2101B is represented by bi-directional arrow 2122B. The proxy service 2110 provides a point of abstraction whereby the second endpoint interface entity 2121B may not see or interact with the nodes 1801 through 1804 of the larger transformation chain instance 2101A, nor may the second endpoint interface entity 2121B interface with any of the endpoints of the nodes 1805 and 1806 that are assigned to the first endpoint interface entity 2121A. As an example, the proxy service 2110 may be established by the delegation module 1439 of FIG. 14 at the time that a portion of transformation chain instance is assigned to another endpoint interface instances. The proxy service 2110 keeps track of which endpoints on node 1805 are assigned to each node 1805A and 1805B, and which endpoints on node 1806 are assigned to each node 1806A and 1806B. When the proxy service 2110 receives input transformations from the larger transformation chain (e.g., node 1801), the proxy service 2110 directs the transformation to each of the nodes 1805A and 1805B as appropriate, depending on which values are affected by the input transformations. Furthermore, when output transformations are provided by the nodes 1805A and 1805B to the node 1801, the proxy service 2110 merges the outputs and provides the merged transformations to the node 1801. For the perspective of the node 1801, it is as though the node 1801 is interacting with node 1805, just as the node 1801 did prior to application splitting. Accordingly, performance and function are preserved, while enabling secure application splitting, by maintaining appropriate information separation between the first and second endpoint interface entities 2121A and 2121B. Such merging of output transformations and splitting of input transformations are performed by component 2111 of the proxy service 2110. The proxy service 2110 may also include a recording module 2120 that evaluates inputs and outputs made to endpoints in each of the nodes 1805A, 1805B, 1806A and 1806B, and records such inputs and outputs. The recording module 2112 also may record the resulting transformations made between nodes. Such recordings are made into a store 2113. A replay module 2113 allows the actions to be replayed. That may be particular useful if the portion transformation chain is assigned to another (i.e., a third) endpoint interface entity later on and a user of that third endpoint interface entity wants to see what was done. That third endpoint interface may come up to speed with what happened during the tenure of the second endpoint interface entity with the portion transformation chain. Another reason to replay might be to check, and approve, commit, or ratify some action. For instance, imagine an order editing scenario where a number of users are seeking to postpone or move back some deliveries. A first user might ask a second user to help with this. However, the first user does not want the second user to edit the order in a way that causes permanent side effects (e.g., some shipping slot gets released and some now slot gets booked due to a service call). The first user might want to replay what the second user did, and if the first user like was she sees, then accept and commit the actions taken. Here, the replay mechanism additionally simulates the side effecting service calls for the second users. Then, on replay, the first user may cause those service calls to be bound to the actual services. The proxy service 2110 further ensures that the limited credentials of the second endpoint interface entity are enforced. For instance, endpoints on the nodes 1805B and 1806B may not receive proprietary data owned by the first endpoint interface entity from a service, and likewise may not change such proprietary data, at least not without the consent of the first endpoint interface entity. The splitting of transformation chain instances as described herein allows for a wide variety of scenarios. For instance, by only allowing output endpoints to be cloned in the portion transformation chain provided to the second endpoint interface entity, and retaining input and output endpoints with the first endpoint interface entity, the second endpoint interface entity may have a shared view on what the first endpoint interface entity is doing. Of course, the first endpoint interface entity may restrict which output endpoints are provided in the portion transformation chain, and thus such view sharing can even be restricted. Furthermore, collaborative and co-use scenarios are enabled by dividing input endpoints between the first and second endpoint interface entities. Several instances and versions of a portion transformation chain may be split off of the main transformation chain to allow such scenarios across more than two endpoint interface entities. Each split may have an associated proxy service that maintains proper information separation and functioning of the transformation chain. FIG. 22 illustrates a flowchart of a method 2200 for sharing an application in response to user input or other environmental event(s) at a first endpoint interface entity. The method is performed in the context of there being multiple applications operating (act 2201). For instance, in FIG. 14, there are multiple applications in the form of transformation chains operating within the universal canvas 1410. Furthermore, a registry of multiple endpoint interface entities is kept (act 2202). In FIG. 14, for example, this registry may be maintained by the endpoint interface entity registry module 1435. Recall that an endpoint interface entity may be a hardware entity and perhaps include associated user criteria defining a user status with respect to that hardware entity. Perhaps a single user may satisfy the user criteria with respect to multiple of the registered endpoint interface entities For each of the applications, the content of box 2210 is performed. Specifically, at least one endpoint interface entity selected from the endpoint interface registry is identified (act 2211) as to interface with the application (or a portion thereof). This selection may include determining that the identified endpoint interface entity is credentialed to interface (or correspond) with the application (or the portion thereof). As part of this identification, it is determined that the environmental events) (if any) are satisfied with respect to the endpoint interface entity (act 2221). For instance, in FIG. 14, this identification may be made by the endpoint matching module 1437. The identified endpoint interface entity is then allowed (act 2212) to interface with the application (or the portion thereof). In other words, within the scope of the application (or the portion thereof), the identified endpoint interface entity is permitted to interface with the corresponding application endpoints within that scope. In the case of a split application, in which different endpoint interface entities are to interface with different portions of the application, the delegation module 1439 operates as described above. In the event that there are multiple endpoint interface entities that are available for a given application, the identification of an appropriate endpoint interface entity (act 2211) might also include determining that 1) an output endpoint for rendering at the hardware entity of the identified endpoint interface entity is efficiently perceivable to at least one (a plurality of) user that satisfies(y) the user criteria of the identified endpoint interface entity, or has some specific characteristic helpful or required to complete a portion of a user's task intent or delivery the appropriate action in response to some implicit event in the environment, and 2) does not conflict with at least one other output endpoint rendered at the hardware entity so as to adversely affect perception of at least one user that satisfies the user criteria. Similarly, the identification of an appropriate endpoint interface entity (act 2211) might also include determining that 1) an input endpoint for inputting at the hardware entity of the identified endpoint interface entity is capable of receiving input from at least one (a plurality of) active endpoint interface entities, or has some specific characteristic helpful or required to complete a portion of a user's task intent or delivery the appropriate action in response to some implicit event in the environment; and 2) an input endpoint for inputting at the hardware entity of the identified endpoint interface entity does not conflict with at least one other input endpoint rendered at the hardware entity so as to adversely affect ability to input of at least one user that interfaces with another endpoint interface entity. Through these determinations with respect to all input and output endpoints of the application, an appropriate distribution of interfacing may be determined. FIG. 23 illustrates a flowchart of a method 2300 for distributed interfacing with an application across a plurality of hardware entities. The method 2300 is an example of the act 2212 of FIG. 22 in the context of there being multiple endpoint interface entities that interface with a particular application. The method includes identifying that multiple hardware entities are available to interface with an application having multiple endpoints (act 2301). The method 2300 then includes performing of distribution of assignments (act 2302) of the hardware entities to interact with the endpoints. This assignment includes assigning which application endpoints each hardware entity may interface with. This assignment may be rules-based. When the application is thereafter operated (act 2303), various interaction is performed at the endpoints. The presentation module 1438 tailors the interaction (act 2304) of the hardware entities with the endpoints by, for each endpoint, restricting the interaction capability of the endpoint perhaps according to the input and output hardware capabilities of the hardware entities. For instance, if an object is to be displayed on a large display that has no touch input, a prompt to “touch here” to perform some function may be removed, whereas if the object is being displayed on a touch screen, that prompt may be present. If information is being displayed via a particular output endpoint on a high fidelity display, perhaps more detail may be displayed on the high fidelity display as compared to, for instance, a watch having a smaller display. Thus, the interaction capability of an endpoint may be restricted. In other words, the input to an endpoint may be restricted according to capabilities of the hardware entity, and output from an endpoint may be restricted according to capabilities of the hardware entity. Furthermore, restrictions may be made depending on compliance with the user criteria associated with a hardware entity. For instance, if most users are further away from the display, less detail might be displayed in favor of enlargement of visualizations. The rules for determining how to restrict an endpoint may be based on at least in part on 1) the interaction capabilities of the hardware entities, 2) anticipated interference in the capabilities of the hardware entities 3) a position of one or more users with respect to at least one or more of the hardware entities; and 4) a control of one or more users with respect to one or more of the hardware entities. The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope. What is claimed is: 1. A method for rendering information on at least one output device of a computing system, the method comprising: an act of rendering a shareable set of information on an first output device, the shareable set of information being shareable in that one or more application portions that generated the shareable set of information may be extracted and operated for rendering of the shareable set of information at a second device; and an act of outputting an emphasis that the shareable set of information is shareable so as to communicate to a user a technical readiness to receive and implement an instruction to share the shareable set of information to the second device. 2. The method in accordance with claim 1, the shareable set of information being a first set of information, the method further comprising: an act of rendering a second set of information on the first output device, the second set of information not being shareable with the second output device, the act of outputting being made in such a way as to communicate to the user that the second set of information is not shareable. 3. The method in accordance with claim 2, the act of rendering the first shareable set of information and the second non-shareable set of information being performed concurrently on the first output device. 4. The method in accordance with claim 1, the output device being a display, the act of rendering comprising an act of displaying the shareable set of information. 5. The method in accordance with claim 4, the act of outputting an emphasis occurring in response to user selection input associated with the shareable set of information being received. 6. The method in accordance with claim 5, the user selection input comprising a substantial circling of the displayed shareable set of information. 7. The method in accordance with claim 6, the user selection input comprising a crossing out gesture of a portion of the display substantially not displaying the shareable set of information. 8. The method in accordance with claim 4, the act of outputting an emphasis comprising an act of visually emphasizing the shareable set of information on the display. 9. The method in accordance with claim 8, the act of visually emphasizing the shareable set of information comprising an act of altering a color of at least a portion of the shareable set of information, or an object associated with the shareable set of information, in a manner that is different than would be the color if the shareable set of information were not shareable. 10. The method in accordance with claim 8, the act of visually emphasizing the shareable set of information comprising an act of altering a grouping of at least a portion of the shareable set of information in a manner that is different than would be the grouping if the shareable set of information were not shareable. 11. The method in accordance with claim 8, the act of visually emphasizing the shareable set of information comprising an act of altering a positioning of at least a portion of the shareable set of information in a manner that is different than would be the positioning if the shareable set of information were not shareable. 12. The method in accordance with claim 8, the act of visually emphasizing the shareable set of information comprising an act of altering a focus of at least a portion of the shareable set of information in a manner that is different than would be the focus if the shareable set of information were not shareable. 13. The method in accordance with claim 8, the act of visually emphasizing the shareable set of information comprising an act of altering a layering of at least a portion of the shareable set of information in a manner that is different than would be the layering if the shareable set of information were not shareable. 14. The method in accordance with claim 1, the act of outputting an emphasis being performed by the first device. 15. The method in accordance with claim 1, the act of outputting an emphasis occurring in response to user selection input associated with the shareable set of information being received. 16. The method in accordance with claim 1, the act of outputting an emphasis being in a same sensory form as the act of rendering the shareable set of information. 17. The method in accordance with claim 1, the act of outputting an emphasis being performed using a different sensory form as the act of rendering the shareable send of information. 18. The method in accordance with claim 1, further comprising: an act of detecting a portion selection user interaction that is indicative of selection of the shareable set of information; and in response to the act of detecting, an act of causing the shareable set of information to be extracted and sent to the second output device. 19. A system comprising: one or more processors; one or more computer-readable storage media having thereon computer-executable instructions that are structured such that, when executed by the one or more processors, and configured to cause the system to perform the following: an act of identifying that a shareable set of information is being rendered on a first output device, the shareable set of information being shareable in that one or more application portions that generated the shareable set of information may be extracted and operated for rendering of the shareable set of information at a second device; and an act of instruction that a user of the first output device be notified that the shareable set of information is shareable. 20. A computer program product comprising one or more computer-readable storage media having thereon computer-executable instructions that are structured such that, when executed by one or more processors of a system, cause the system to perform the following: an act of identifying that a shareable set of information is being rendered on an first output device, an act of rendering a shareable set of information on an first output device, the shareable set of information being shareable in that one or more application portions that generated the shareable set of information may be extracted and operated for rendering of the shareable set of information at a second device; and an act of instruction that a user of the first output device be notified that the shareable set of information is shareable.

2015-07-08

en

2017-01-12

US-201615141274-A

Network Management Layer - Configuration Management ABSTRACT Novel tools and techniques are provided for implementing network management layer configuration management. In some embodiments, a system might determine one or more network devices in a network for implementing a service arising from a service request that originates from a client device over the network. The system might further determine network technology utilized by each of the one or more network devices, and might generate flow domain information (in some cases, in the form of a flow domain network (“FDN”) object), using flow domain analysis, based at least in part on the determined network devices and/or the determined network technology. The system might automatically configure at least one of the network devices to enable performance of the service (which might include, without limitation, service activation, service modification, fault isolation, and/or performance monitoring), based at least in part on the generated flow domain information. CROSS-REFERENCES TO RELATED APPLICATIONS This application is a continuation application of U.S. patent application Ser. No. 14/462,778 (the “'778 application”), filed Aug. 19, 2014 by John T. Pugaczewski (attorney docket no. 020370-012800US), entitled, “Network Management Layer-Configuration Management”), which claims priority to U.S. Patent Application Ser. No. 61/867,461 (the “'461 application”), filed Aug. 19, 2013 by John T. Pugaczewski (attorney docket no. 020370-012801US), entitled, “Network Management Layer-Configuration Management,” the entire disclosure of which is incorporated herein by reference in its entirety for all purposes. COPYRIGHT STATEMENT A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. FIELD The present disclosure relates, in general, to network communications, and more particularly to methods, systems, and computer software for implementing communications network methodologies for determination of network connectivity path given a service request. In some cases, a resultant path might be used to automatically configure network devices directly or indirectly to activate a bearer plane for user traffic flow. BACKGROUND Existing network architectures in support of Metro Ethernet Forum (“MEF”) services include multiple technologies and multiple vendors. Typically, this will result in complicated logic in breaking down the service request and determining how to map the service attributes to corresponding network device configurations. For example, a MEF service request with two user network interfaces (“UNIs”) and an Ethernet virtual connection or circuit (“EVC”) is sent from the client to the support system(s) responsible for communicating with the network. The support system must determine the underlying technology (including, but not limited to, virtual private local area network (“LAN”) service (“VPLS”), IEEE 802.1ad (otherwise referred to as “Q-in-Q,” “QinQ,” or “Q in Q”)) and corresponding vendors. The determination of this connectivity can be persistently stored in part or whole. If the technology and/or vendors change, there is typically a significant development effort in order to keep the automation of service request to underlying network activation and corresponding bearer plane flow. Hence, there is a need for more robust and scalable solutions for implementing communications network methodologies for determination of network connectivity path. In particular, there is a need for a system that overcomes the complexity of multi-technology and multi-vendor networks in support of service activation. Further, there is a need to have a solution that can be used across multiple services, products, and underlying networks for automated service activation. BRIEF SUMMARY Various embodiments provide techniques for implementing network management layer configuration management. In particular, various embodiments provide techniques for implementing communications network methodologies for determination of network connectivity path given a service request. In some embodiments, a resultant path might be used to automatically configure network devices directly or indirectly to activate a bearer plane for user traffic flow. In some embodiments, a system might determine one or more network devices in a network for implementing a service arising from a service request that originates from a client device over the network. The system might further determine network technology utilized by each of the one or more network devices, and might generate flow domain information (in some cases, in the form of a flow domain network (“FDN”) object), using flow domain analysis, based at least in part on the determined network devices and/or the determined network technology. The system might automatically configure at least one of the network devices to enable performance of the service (which might include, without limitation, service activation, service modification, fault isolation, and/or performance monitoring), based at least in part on the generated flow domain information. According to some embodiments, given a Metro Ethernet Forum (“MEF”) service of two or more UNIs and an Ethernet virtual circuit or connection (“EVC”) as input, a detailed an NML-CM flow domain logic algorithm may be used to return or output a computed graph or path (in some cases, in the form of a FDN object). Using the algorithm and the methodology described above, a MEF-defined service may determine the underlying set of network components and connectivity associations required to provide bearer plane service. The returned or outputted graph (in some instances, the FDN object) can then be used to perform the necessary service activation, service modification, fault isolation, and/or performance monitoring, or the like across multiple technologies and multiple vendors. The tools provided by various embodiments include, without limitation, methods, systems, and/or software products. Merely by way of example, a method might comprise one or more procedures, any or all of which are executed by a computer system. Correspondingly, an embodiment might provide a computer system configured with instructions to perform one or more procedures in accordance with methods provided by various other embodiments. Similarly, a computer program might comprise a set of instructions that are executable by a computer system (and/or a processor therein) to perform such operations. In many cases, such software programs are encoded on physical, tangible, and/or non-transitory computer readable media (such as, to name but a few examples, optical media, magnetic media, and/or the like). In an aspect, a method might comprise receiving, with a first network device in a network, a service request, the service request originating from a first client device over the network, determining, with the first network device, one or more second network devices for implementing a service arising from the service request, and determining, with the first network device, network technology utilized by each of the one or more second network devices. The method might further comprise generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices. The method might also comprise automatically configuring, with a third network device in the network, at least one of the one or more second network devices to enable performance of the service arising from the service request, based at least in part on the generated flow domain information. In some embodiments, generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices might comprise generating, with the first network device, a flow domain network (“FDN”) object, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices. In some cases, generating, with the first network device, the FDN object, using flow domain analysis might comprise generating, with the first network device, a computed graph of flow domains indicating one or more network paths in the network through the one or more second network devices and indicating relevant connectivity associations of the one or more second network devices. In some instances, generating, with the first network device, the FDN object, using flow domain analysis might comprise utilizing an outside-in analysis that first analyzes relevant user network interfaces. According to some embodiments, the service request might comprise a Metro Ethernet Forum (“MEF”) service request. In some cases, determining, with the first network device, network technology utilized by each of the one or more second network devices might comprise mapping, with the first network device, MEF services associated with the service request with the network technology utilized by each of the one or more second network devices. In some embodiments, mapping, with the first network device, MEF services associated with the service request with the network technology utilized by each of the one or more second network devices might comprise implementing, with the first network device, an intermediate abstraction between the MEF services and the network technology utilized by each of the one or more second network devices, using a layer network domain. In some instances, the MEF service request might comprise vectors of at least two user network interfaces (“UNIs”) and at least one Ethernet virtual circuit (“EVC”). According to some embodiments, generating, with the first network device, the flow domain information might comprise determining, with the first network device, a network path connecting each of the at least two UNIs with the at least one EVC and generating, with the first network device, the flow domain information, wherein the flow domain information indicates the determined network path connecting each of the at least two UNIs with the at least one EVC and indicates connectivity associations for each of the at least two UNIs with the at least one EVC. Merely by way of example, in some embodiments, generating, with the first network device, the flow domain information, using flow domain analysis, might comprise performing, with the first network device, an edge flow domain analysis, determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising an intra-provider edge router system for multi-dwelling units (“intra-MTU-s”), based on the edge flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in a flow domain comprising an intra-MTU-s, determining, with the first network device, one or more edge flow domains. Generating the flow domain information might comprise, based on a determination that at least one of the one or more second network devices does not include a flow domain comprising an intra-MTU-s, performing, with the first network device, a ring flow domain analysis, determining, with the first network device, whether at least one of the one or more second network devices is included in one or more G.8032 ring flow domains, based on the ring flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in one or more G.8032 ring flow domains, determining, with the first network device, the one or more G.8032 flow domains. In some cases, generating the flow domain information might comprise, based on a determination that at least one of the one or more second network devices is not included in one or more G.8032 ring flow domains, performing, with the first network device, an aggregate flow domain analysis, determining, with the first network device, whether at least one of the one or more second network devices is included in one or more aggregate flow domains, based on the aggregate flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in one or more aggregate flow domains, determining, with the first network device, the one or more aggregate flow domains. According to some embodiments, generating the flow domain information might comprise, based on a determination that at least one of the one or more second network devices is not included in one or more aggregate flow domains, performing, with the first network device, a hierarchical virtual private local area network service (“H-VPLS”) flow domain analysis, determining, with the first network device, whether at least one of the one or more second network devices is included in one or more H-VPLS flow domains, based on the H-VPLS flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in one or more H-VPLS flow domains, determining, with the first network device, the one or more one or more H-VPLS flow domains. In some cases, generating the flow domain information might comprise, based on a determination that at least one of the one or more second network devices is not included in one or more H-VPLS flow domains, performing, with the first network device, a virtual private local area network service (“VPLS”) flow domain analysis, determining, with the first network device, whether at least one of the one or more second network devices is included in one or more VPLS flow domains, based on the VPLS flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in one or more VPLS flow domains, determining, with the first network device, the one or more VPLS flow domains. In some embodiments, generating the flow domain information might comprise, based on a determination that at least one of the one or more second network devices is not included in one or more VPLS flow domains, performing, with the first network device, a flow domain analysis for a provider edge router having routing and switching functionality (“PE_rs flow domain analysis”), determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising one or more PE_rs, based on the PE_rs flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in a flow domain comprising one or more PE_rs, determining, with the first network device, one or more PE_rs flow domains. In some instances, generating the flow domain information might comprise, based on a determination that at least one of the one or more second network devices is not included in a flow domain comprising one or more PE_rs, performing, with the first network device, an interconnect flow domain analysis, determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising an external network-to-network interface (“E-NNI”), based on the interconnect flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in a flow domain comprising an E-NNI, determining, with the first network device, one or more service provider or operator flow domains. According to some embodiments, generating, with the first network device, the flow domain information, using flow domain analysis, might further comprise stitching, with the first network device, at least one of the determined one or more edge flow domains, the determined one or more G.8032 flow domains, the determined one or more aggregate flow domains, the determined one or more one or more H-VPLS flow domains, the determined one or more VPLS flow domains, the determined one or more PE_rs flow domains, or the determined one or more service provider or operator flow domains to generate the flow domain information indicating a flow domain network. In some cases, the service arising from the service request might comprise at least one of service activation, service modification, service assurance, fault isolation, or performance monitoring. In some embodiments, the first network device might comprise one of a network management layer-configuration management (“NML-CM”) controller or a layer 3/layer 2 flow domain (“L3/L2 FD”) controller. In some instances, the third network device might comprise one of a layer 3/layer 2 element management layer-configuration management (“L3/L2 EML-CM”) controller, a NML-CM activation engine, a NML-CM modification engine, a service assurance engine, a fault isolation engine, or a performance monitoring engine. According to some embodiments, the first network device and the third network device might be the same network device. In some cases, each of the one or more second network devices might comprise one of a user-side provider edge (“U-PE”) router, a network-side provider edge (“N-PE”) router, a provider (“P”) router, and/or an internal network-to-network interface (“I-NNI”) device. In some instances, the network technology might comprise one or more of G.8032 Ethernet ring protection switching (“G.8032 ERPS”) technology, aggregation technology, hierarchical virtual private local area network service (“H-VPLS”) technology, packet on a blade (“POB”) technology, provider edge having routing and switching functionality (“PE_rs”)-served user network interface (“UNI”) technology, multi-operator technology, and/or virtual private local area network service (“VPLS”) technology. In another aspect, a network device might comprise at least one processor and a non-transitory computer readable medium communicatively coupled to the at least one processor. The computer readable medium might have stored thereon computer software comprising a set of instructions that, when executed by the at least one processor, causes the network device to perform one or more functions. The set of instructions might comprise instructions for receiving a service request, the service request originating from a first client device over the network, instructions for determining one or more second network devices for implementing a service arising from the service request, and instructions for determining, with the first network device, network technology utilized by each of the one or more second network devices. The set of instructions might further comprise instructions for generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices. The flow domain information might be used to automatically configure the at least one of the one or more second network devices to enable performance of the service arising from the service request. In yet another aspect, a system might comprise a first network device, one or more second network devices, and a third network device. The first network device might comprise at least one first processor and a first non-transitory computer readable medium communicatively coupled to the at least one first processor. The first non-transitory computer readable medium might have stored thereon computer software comprising a first set of instructions that, when executed by the at least one first processor, causes the first network device to perform one or more functions. The first set of instructions might comprise instructions for receiving a service request, the service request originating from a first client device over the network, instructions for determining one or more second network devices for implementing a service arising from the service request, and instructions for determining, with the first network device, network technology utilized by each of the one or more second network devices. The first set of instructions might further comprise instructions for generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices. The third network device might comprise at least one third processor and a third non-transitory computer readable medium communicatively coupled to the at least one third processor. The third non-transitory computer readable medium might have stored thereon computer software comprising a third set of instructions that, when executed by the at least one third processor, causes the third network device to perform one or more functions. The third set of instructions might comprise instructions for receiving the flow domain information from the first network device and instructions for automatically configuring the at least one of the one or more second network devices to enable performance of the service arising from the service request, by sending configuration instructions to the at least one of the one or more second network devices. Each of the one or more second network devices might comprise at least one second processor and a second non-transitory computer readable medium communicatively coupled to the at least one second processor. The second non-transitory computer readable medium might have stored thereon computer software comprising a second set of instructions that, when executed by the at least one second processor, causes the second network device to perform one or more functions. The second set of instructions might comprise instructions for receiving the configuration instructions from the third network device and instructions for changing network configuration settings, based on the configuration instructions. Various modifications and additions can be made to the embodiments discussed without departing from the scope of the invention. For example, while the embodiments described above refer to particular features, the scope of this invention also includes embodiments having different combination of features and embodiments that do not include all of the above described features. BRIEF DESCRIPTION OF THE DRAWINGS A further understanding of the nature and advantages of particular embodiments may be realized by reference to the remaining portions of the specification and the drawings, in which like reference numerals are used to refer to similar components. In some instances, a sub-label is associated with a reference numeral to denote one of multiple similar components. When reference is made to a reference numeral without specification to an existing sub-label, it is intended to refer to all such multiple similar components. FIG. 1 is a block diagram illustrating a system representing network management layer-configuration management (“NML-CM”) network logic, in accordance with various embodiments. FIG. 2A is a block diagram illustrating a system depicting an exemplary NML-CM flow domain, in accordance with various embodiments. FIG. 2B is a block diagram illustrating an exemplary flow domain network (“FDN”), in accordance with various embodiments. FIG. 3A is a block diagram illustrating exemplary FDN derivation, in accordance with various embodiments. FIG. 3B is a block diagram illustrating exemplary layer n sibling check for FDN derivation, in accordance with various embodiments. FIG. 3C is a block diagram illustrating exemplary FDN derivation utilizing a set of bins each for grouping user network interfaces (“UNIs”) that share the same edge serving device, in accordance with various embodiments. FIG. 4 is a flow diagram illustrating an exemplary method for generating a FDN object, in accordance with various embodiments. FIGS. 5A-5I are block diagrams illustrating various exemplary flow domains, in accordance with various embodiments. FIG. 6 is a flow diagram illustrating a method for generating flow domain information and implementing automatic configuration of network devices based on the generated flow domain information, in accordance with various embodiments. FIG. 7 is a block diagram illustrating an exemplary computer or system hardware architecture, in accordance with various embodiments. DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS While various aspects and features of certain embodiments have been summarized above, the following detailed description illustrates a few exemplary embodiments in further detail to enable one of skill in the art to practice such embodiments. The described examples are provided for illustrative purposes and are not intended to limit the scope of the invention. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the described embodiments. It will be apparent to one skilled in the art, however, that other embodiments of the present invention may be practiced without some of these specific details. In other instances, certain structures and devices are shown in block diagram form. Several embodiments are described herein, and while various features are ascribed to different embodiments, it should be appreciated that the features described with respect to one embodiment may be incorporated with other embodiments as well. By the same token, however, no single feature or features of any described embodiment should be considered essential to every embodiment of the invention, as other embodiments of the invention may omit such features. Unless otherwise indicated, all numbers used herein to express quantities, dimensions, and so forth used should be understood as being modified in all instances by the term “about.” In this application, the use of the singular includes the plural unless specifically stated otherwise, and use of the terms “and” and “or” means “and/or” unless otherwise indicated. Moreover, the use of the term “including,” as well as other forms, such as “includes” and “included,” should be considered non-exclusive. Also, terms such as “element” or “component” encompass both elements and components comprising one unit and elements and components that comprise more than one unit, unless specifically stated otherwise. Various embodiments provide techniques for implementing network management layer configuration management. In particular, various embodiments provide techniques for implementing communications network methodologies for determination of network connectivity path given a service request. In some embodiments, a resultant path might be used to automatically configure network devices directly or indirectly to activate a bearer plane for user traffic flow. Herein, “bearer plane” might refer to a user plane or data plane that might carry user or data traffic for a network, while “control plane” might refer to a plane that carries control information for signaling purposes, and “management plane” might refer to a plane that carries operations and administration traffic for network management. Herein also, data traffic or network traffic might have traffic patterns denoted as one of “north traffic,” “east traffic,” “south traffic,” or “west traffic.” North (or northbound) and south (or southbound) traffic might refer to data or network traffic between a client and a server, while east (or eastbound) and west (or westbound) traffic might refer to data or network traffic between two servers. In some embodiments, a system might determine one or more network devices in a network for implementing a service arising from a service request that originates from a client device over the network. In some cases, the service might include, without limitation, service activation, service modification, fault isolation, and/or performance monitoring, or the like. The system might further determine network technology utilized by each of the one or more network devices, and might generate flow domain information (in some cases, in the form of a flow domain network (“FDN”) object), using flow domain analysis, based at least in part on the determined network devices and/or the determined network technology. According to some embodiments, the network technology might include, but is not limited to, one or more of G.8032 Ethernet ring protection switching (“G.8032 ERPS”) technology, aggregation technology, hierarchical virtual private local area network service (“H-VPLS”) technology, packet on a blade (“POB”) technology, provider edge having routing and switching functionality (“PE_rs”)-served user network interface (“UNI”) technology, multi-operator technology, and/or virtual private local area network service (“VPLS”) technology. The system might automatically configure at least one of the network devices to enable performance of the service, based at least in part on the generated flow domain information. In some embodiments, given a Metro Ethernet Forum (“MEF”) service of two or more UNIs and an Ethernet virtual circuit or connection (“EVC”) as input, a detailed an NML-CM flow domain logic algorithm or NML-CM flow domain algorithm may be used to return or output a computed graph or path (in some cases, in the form of a FDN object). Using the algorithm and the methodology described above, a MEF-defined service may determine the underlying set of network components and connectivity associations required to provide bearer plane service. The returned or outputted graph (in some instances, the FDN object) can then be used to perform the necessary service activation, service modification, fault isolation, and/or performance monitoring, or the like across multiple technologies and multiple vendors. According to some embodiments, the NML-CM flow domain algorithm might leverage the concepts provided in the technical specifications for MEF 7.2: Carrier Ethernet Management Information Model (April 2013; hereinafter referred to simply as “MEF 7.2”), which is incorporated herein by reference in its entirety for all purposes. Similar to the recursive flow domain (sub-network) derivation described in MEF 7.2, the NML-CM flow domain algorithm recursively generates a graph (network) of flow domains. The returned value(s) from successfully invocation of the algorithm might be a FDN object. The FDN object is intended to be used by clients, including, but not limited to, a NML-CM activation engine, or the like. In some cases, the service fulfillment process might use the FDN information during a new service activation process. The service fulfillment process might also use the FDN information during a service modification process. Other clients can use the FDN object for service assurance processes, including without limitation, fault isolation. A layer network domain (“LND”) with flow domains might provide an intermediate abstraction between the MEF service(s) and the underlying network technology. The software logic/algorithms might be developed to map MEF service(s) to underlying flow domain network. The flow domain network may then be mapped to the underlying network technology. One benefit of this framework might include that future changes in underlying technology do not require changes to MEF service-aware functionality. In a specific (non-limiting) example, a move from virtual local area network (“VLAN”) or virtual private LAN service (“VPLS”) flow domains to multiprotocol label switching-transport protocol (“MPLS-TP”) flow domains does not require business management layer (“BML”) and/or service management layer (“SML”) support system changes. The framework provides a technology and software layering and abstraction that reduces long term development costs. A change in a vendor(s) supporting the existing or new technology only requires modification of the NML-to-EML support systems. Key in the derivation of the graph (or FDN object) is the need to derive topology from potentially multiple sources. These sources might include, but are not limited to, the network devices, support systems (including, e.g., element management systems (“EMSs”), etc.) and databases. A major goal of the topology engine is to limit and throttle the access to the network. The reason for limiting or throttling access is that each access request of a device has a corresponding cost, which might include, but is not limited to, increased levels of device and network resources. Device and network resources might include, without limitation, CPU utilization, memory, bandwidth, and/or the like. Keeping these resources at or below optimal levels is an important aspect of the aforementioned major goal. The combination of the EMS and controlled devices can provide varying levels of network/device protection. For example, an EMS that asynchronously responds to events and incrementally queries the network/device is better than a solution that is constantly polling. We now turn to the embodiments as illustrated by the drawings. FIGS. 1-7 illustrate some of the features of the method, system, and apparatus for implementing network management layer configuration management, as referred to above. The methods, systems, and apparatuses illustrated by FIGS. 1-7 may refer to examples of different embodiments that include various components and steps, which can be considered alternatives or which can be used in conjunction with one another in the various embodiments. The description of the illustrated methods, systems, and apparatuses shown in FIGS. 1-7 is provided for purposes of illustration and should not be considered to limit the scope of the different embodiments. With reference to the figures, FIG. 1 is a block diagram illustrating a system 100 representing network management layer-configuration management (“NML-CM”) network logic, in accordance with various embodiments. In FIG. 1, system 100 might comprise a plurality of layers 105, including, but not limited to, a business management layer (“BML”), a service management layer (“SML”), a network management layer (“NML”), a flow domain layer (“FDL”), an element management layer (“EML”), an element layer (“EL”), and/or the like. System 100 might further comprise a plurality of user-side or customer-side interfaces or interface devices 110, including, without limitation, one or more graphical user interfaces (“GUIs”) 110 a, one or more web portals 110 b, one or more web services 110 c. In some embodiments, system 100 might further comprise a Metro Ethernet Forum (“MEF”) business management layer-configuration management (“BML-CM”) controller 115, which is located at the BML, and a MEF service management layer-configuration management (“SML-CM”) controller 120, which is located at the SML. Also located at the SML might be a Metro Ethernet Network (“MEN”) 125, the edges of which might be communicatively coupled to two or more user network interfaces (“UNIs”) 130. In some cases, the two or more UNIs 130 might be linked by an Ethernet virtual connection or Ethernet virtual circuit (“EVC”) 135. At the NML, system 100 might comprise a MEF network management layer-configuration management (“NML-CM”) controller 140, while at the FDL, system 100 might comprise a plurality of virtual local area network (“VLAN”) flow domains 145 and a plurality of flow domain controllers 150. In some embodiments (such as shown in FIG. 1), the plurality of VLAN flow domains 145 might include, without limitation, a first VLAN flow domain A 145 a, a second VLAN flow domain B 145 b, and a third VLAN flow domain C 145 c. A plurality of UNIs 130 might communicatively couple to edge VLAN flow domains, such as the first VLAN flow domain A 145 a and the third VLAN flow domain C 145 c (in the example of FIG. 1). The edge VLAN flow domains (i.e., the first VLAN flow domain A 145 a and the third VLAN flow domain C 145 c) might each communicatively couple with inner VLAN flow domains (i.e., the second VLAN flow domain B 145 b) via one or more internal network-to-network interfaces (“I-NNI”) 155. In some cases, each of the plurality of the flow domain controllers 150 might be part of the corresponding one of the plurality of VLAN flow domains 145. In some instances, each of the plurality of the flow domain controllers 150 might be separate from the corresponding one of the plurality of VLAN flow domains 145, although communicatively coupled therewith; in some embodiments, each separate flow domain controller 150 and each corresponding VLAN flow domain 145 might at least in part be co-located. In the example of FIG. 1, flow domain a controller 150 a might be part of (or separate from, yet communicatively coupled to) the first VLAN flow domain A 145 a, while flow domain b controller 150 b might be part of (or separate from, yet communicatively coupled to) the second VLAN flow domain B 145 b, and flow domain c controller 150 c might be part of (or separate from, yet communicatively coupled to) the third VLAN flow domain C 145 c. According to some embodiments, the plurality of flow domain controllers 150 might include layer 3/layer 2 (“L3/L2”) flow domain controllers 150. As understood in the art, “layer 3” might refer to a network layer, while “layer 2” might refer to a data link layer. At the EML, system 100 might further comprise a plurality of L3/L2 element management layer-configuration management (“EML-CM”) controllers 160. As shown in the embodiment of FIG. 1, the plurality of L3/L2 EML-CM controllers 160 might comprise a first L3/L2 EML-CM a controller 160 a, a second L3/L2 EML-CM b controller 160 b, and a third L3/L2 EML-CM c controller 160 c. Each of the plurality of L3/L2 EML-CM controllers 160 might communicatively couple with a corresponding one of the plurality of L3/L2 flow domain controllers 150. Each L3/L2 EML-CM controller 160 might control one or more routers at the EL. For example, as shown in FIG. 1, the first L3/L2 EML-CM a controller 160 a might control a first user-side provider edge (“U-PE”) router 165 a, while the second L3/L2 EML-CM b controller 160 b might control two network-side provider edge (“N-PE”) routers 170 a and 170 b, and the third L3/L2 EML-CM c controller 160 c might control a second U-PE 165 b. I-NNIs 155 might communicatively couple U-PE routers 165 with N-PE routers 170, and communicatively couple N-PE routers 170 to other N-PE routers 170. In operation, a service request might be received by a GUI 110 a, a web portal 110 b, or a web service 110 c. The service request might request performance of a service including, but is not limited to, service activation, service modification, service assurance, fault isolation, or performance monitoring, or the like. The MEF BML-CM controller 115 receives the service request and forwards to the MEF SML-CM controller 120, which then sends the service request to the MEF NML-CM controller 140 (via MEN 125). The MEF NML-CM controller 140 receives the service request, which might include information regarding the UNIs 130 and the EVC(s) 135 (e.g., vectors of the UNIs 130 and the EVC(s) 135, or the like), and might utilize a flow domain algorithm to generate flow domain information, which might be received and used by the L3/L2 flow domain controllers 150 to control the VLAN flow domains 145 and/or to send control information to the L3/L2 EML-CM controllers 160, which in turn controls the U-PEs 165 and/or N-Pes 170 at the element layer. Herein, the functions of the NML and the FDL (as well as interactions between the NML/FDL and the EML or EL) are described with respect to FIGS. 2-6 below. FIG. 2A is a block diagram illustrating a system 200 depicting an exemplary NML-CM flow domain, in accordance with various embodiments. FIG. 2B is a block diagram illustrating an exemplary flow domain network (“FDN”) 225, in accordance with various embodiments. In FIG. 2A, system 200, which represents a NML-CM flow domain, comprises a NML-CM flow domain algorithm 205 that generates flow domain information that is used by an NML-CM activation engine 210 to configure network 215. The flow domain information might be generated (or otherwise based on) a MEF service request 220, which might include information regarding two or more UNIs 230 and at least one EVC 235. In some cases, the information might comprise vectors or vector lists of each of the two or more UNIs 230 and the at least one EVC 235, and/or vector paths through some (if not all) of the two or more UNIs 230 and the at least one EVC 235, or the like. In other words, service information (under the MEF standard) 240 is used by the algorithm 205 to generate network flow domain information 245, which is technology specific yet vendor independent (i.e., it doesn't matter what vendor is providing the network components or devices, rather it is the technology utilized in the network components or devices that is important, at this stage). The network flow domain information 245 is then used by the NML-CM activation engine 210 to configure the network devices and components 250, which may be technology specific and vendor dependent. It should be appreciated that although a NML-CM activation engine 210 is used in this non-limiting example, any suitable client may be used (consistent with the teachings of the various embodiments) to utilize network flow domain information 245 to configure network devices and components 250 to perform a service arising from the MEF service request. In some embodiments, for example, the client (instead of the activation engine 210) might include one of a service modification engine, a service assurance, a fault isolation engine, a performance monitoring/optimization engine, and/or the like, to configure the network devices 250 to perform service modification, service assurance, fault isolation, performance monitoring/optimization, and/or the like, respectively. In general, FIG. 2A illustrates a concept referred to as an “outside-in” approach or analysis, which takes the edge components of UNIs and initiates the process of determining how to connect the UNIs with the EVC in order to meet the service request. In some cases, the “outside-in” approach or analysis might include deriving a network computed graph, which, in some embodiments, might be embodied as a FDN object or flow domain information. FIG. 2B illustrates an example FDN, and a FDN object includes information describing or defining the FDN. Turning to FIG. 2B, FDN 225 might comprise a plurality of layers 260 (denoted “Layer n,” “Layer (n+1),” and “Layer (n+2)” in the non-limiting example of FIG. 2B). At Layer (n+2), FDN 225 might comprise a VPLS flow domain A 265. FDN 225 might further comprise a two or more VLAN flow domains 270 that might span one or more layers 260. In the embodiment of FIG. 2B, FDN 225 includes a first VLAN flow domain A 270 a and a second VLAN flow domain B 270 b, which each spans Layers n and (n+1). The first VLAN flow domain A 270 a and the second VLAN flow domain B 270 b might each comprise a plurality of VLAN flow domains. In the example of FIG. 2B, the first VLAN flow domain A 270 a might comprise VLAN flow domain A1 270 a 1 and VLAN flow domain A2 270 a 2, both at Layer n, and might further comprise VLAN flow domain A3 270 a 3 at Layer (n+1). The second VLAN flow domain B 270 b, as shown in FIG. 2B, might comprise VLAN flow domain B1 270 b 1 and VLAN flow domain B2 270 b 2, the former at Layer n and the latter at Layer (n+1). A plurality of connections 275 might communicatively couple a plurality of UNIs to the VLAN flow domains at Layer n. For example, as shown in FIG. 2B, each of connections 275 a-275 f might communicatively couple each of UNIs (e.g., UNI 1 through UNI 6 325, as shown in FIG. 3) to VLAN flow domain A1 270 a 1, VLAN flow domain A2 270 a 2, or VLAN flow domain B1 270 b 1. In some embodiments, one or more of connections 275 might utilize flexible port partitioning (“FPP”) or the like, which might enable virtual Ethernet controllers to control partitioning of bandwidth across multiple virtual functions and/or to provide balanced quality of service (“QoS”) by giving each assigned virtual function equal (or distributed) access to network bandwidth. FIG. 3A-3C (collectively, “FIG. 3”) are generally directed to FDN derivation, in accordance with various embodiments. In particular, FIG. 3A is a block diagram illustrating exemplary FDN derivation, in accordance with various embodiments. FIG. 3B is a block diagram illustrating exemplary layer n sibling check for FDN derivation, in accordance with various embodiments. FIG. 3C is a block diagram illustrating exemplary FDN derivation utilizing a set of bins each for grouping user network interfaces (“UNIs”) that share the same edge serving device, in accordance with various embodiments. In a flow domain analysis, the end result, given a MEF service (including two or more UNIs and at least one EVC, or the like), might, in some exemplary embodiments, include a FDN object. The FDN object might be used by a client device for various purposes, including, without limitation, service activation, service modification, fault isolation, performance monitoring, and/or the like. The FDN object might provide the intermediate abstraction between the service and the underlying network technology. The node type is a requirement that is used to support flow domain analysis. An attribute associated with the node/device may be assigned. In some cases, the assignment should ideally be an inventoried attribute, but can, in some instances, be derived. The node type might be examined during the flow domain analysis and used to construct the flow domain network. The overall logic might include a series of technology specific (yet vendor independent) flow analyses. The process might begin with a Nodal (i.e., MTU-s, which might refer to a provider edge router (or system thereof) for multi-dwelling units) flow domain analysis, and might follow with various supporting technology flow domains, including, without limitation, G.8032 Ethernet ring protection switching (“G.8032 ERPS”), Aggregation (“Agg” or “AGG”), hierarchical virtual private local area network service (“H-VPLS”), packet on a blade (“POB”), PE-rs served UNIs (herein, “PE-rs” or “PE_rs” might refer to a provider edge router having routing and switching functionality), multi-operator (including, but not limited to, external network-to-network interface (“E-NNI”), border gateway protocol-logical unit (“BGP-LU”), and/or the like), and/or virtual private LAN service (“VPLS”), or the like. Each technology flow domain analysis might begin with the examination of a set of UNIs (e.g., Edge Flow Domain Analysis) that are part of the MEF service. A major function of the Edge Flow Domain Analysis is to take the MEF service request (including vector(s) of UNIs and EVCs), and then determining service devices. The overall logic may be implemented using an outside-in analysis. Specifically, the UNI containment might be used to begin the analysis and determine the outside flow domains. The next step might be based on the devices serving the UNI work from the outside to the inside and determining attached flow domains. The flow domains shown in FIG. 3 include, but are not limited to, G.8032, H-VPLS, AGG, and/or the like. With reference to FIG. 3A, system 300 might comprise a plurality of layers 305 (denoted “Layer n,” “Layer (n+1),” “Layer (n+2),” and “Layer (n+3)”). At each layer, system 300 might include at least one network device 310. For example, as shown in the embodiment of FIG. 3A, at Layer n, system 300 might comprise M number of network devices—a first nth layer network device 310 a, a second nth layer network device 310 b, and through an Mth nth layer network device 310 c—each of which includes a G.8032 ring 315 or a PE_rs 315 (denoted 315 a, 315 b, and 315 c, respectively). At Layer (n+1), system 300 might comprise a first (n+1)th layer network device 310 d through an Mth (n+1)th layer network device 310 e—each of which includes a G.8032 ring 315 or a PE_rs 315 (denoted 315 d and 315 e, respectively). At Layer (n+2), system 300 might comprise a first (n+2)th layer network device 310 f through an Mth (n+2)th layer network device 310 g—each of which includes a G.8032 ring 315 or a PE_rs 315 (denoted 315 f and 315 g, respectively). At Layer (n+3), method 300 might comprise a (n+3)th layer network device 310 h, which may or may not include a G.8032 ring 315 or a PE_rs 315. Each network device 310 may be referred to as a sibling to each other, classified by layers. For instance, with reference to the example shown in FIG. 3A, the first nth layer network device 310 a might be denoted “Sibling n.1,” the second nth layer network device 310 b might be denoted “Sibling n.2,” the Mth nth layer network device 310 c might be denoted “Sibling n.m.” At Layer (n+1), the first (n+1)th layer network device 310 d might be denoted “Sibling (n+1).1,” while the Mth (n+1)th layer network device 310 e might be denoted “Sibling (n+1).m, or the like. And so on. In some embodiments, each of the nth layer network devices 310 a-310 c might communicatively couple via connections 320 (including connections 320 a-320 f) to each of a plurality of UNIs 325 (including UNI 1 through UNI 6, as shown in FIG. 3A). The (n+1)th layer and nth layer network devices might have a parent-child relationship 330, and might communicatively couple to each other via connections 335 (including connections 335 a, 335 b, and 335 c, as shown in FIG. 3A). As shown in the embodiment of FIG. 3A, Sibling n.1 might communicatively couple with Sibling (n+1).1 via connection 335 a, while Sibling n.2 might communicatively couple with Sibling (n+1).1 via connection 335 b, and Sibling n.m might communicatively couple with Sibling (n+1).m via connection 335 c. Each of the (n+1)th layer network devices might communicatively couple with each of the corresponding (n+2)th layer network devices via connections 335 d and 335 e (i.e., network device 310 d coupled with network device 310 f via connection 335 d, network device 310 e coupled with network device 310 g via connection 335 e, as shown in the example of FIG. 3A). Each of the (n+2)th layer network devices 310 f-310 g might communicatively couple to the (n+3)th layer network device 310 h via connections 335 f-335 g. In some embodiments, the network devices at Layer (n+2) might communicate with each other (as denoted by the dashed line in FIG. 3A). In a FDN derivation, the process might begin with a sibling check at the edge or Layer n. In some embodiments, the sibling check might include determining whether a number of the siblings is greater than 1. Based on a determination that the number of the siblings is greater than 1, the process might proceed to Layer (n+1). The process might include performing a “T check,” in which it is determined whether T equals G.8032 ring. If so, then ring members are added. The process might further include performing a flow domain change check, in which it is determined whether T=PE_rs. If T is a PE_rs, then the VLAN flow domain is done. At Layer n+1, another sibling check might be performed that includes determining whether a number of the siblings is greater than 1. Based on a determination that the number of the siblings is greater than 1, the process might proceed to Layer (n+2). The process might include performing a “T check,” in which it is determined whether T equals G.8032 ring. If so, then ring members are added. The process might further include performing a flow domain change check, in which it is determined whether T=PE_rs. If T is a PE_rs, then the VLAN flow domain is done. In general, the process proceeds to the next layer (n+x) until the core technology (in this case, VPLS; although the various embodiments are not so limited) is reached or until there are no more siblings at that layer. FIG. 3B illustrates the nth layer of the FDN of FIG. 3A. FIG. 3C illustrates the steps for determining edge connecting technology. In some embodiments, the first process flow logic might determine the set of Intra-MTUs flow domains, given a set of UNIs. The Edge Flow Domain Analysis might be used to determine the UNI supporting devices. Second, the analysis might feed to the neighbor flow domain. Some technologies that support UNIs might include, without limitation, MTU-s, packet on a blade, PE-rs, H-VPLS, G.8032 remote terminal (“RT”), G.8032 central office terminal (“COT”), and/or the like. The analysis that may be performed herein might examine the vector (set) of UNIs that are components of the MEF service (along with an EVC). The analysis might be an outside-in approach, whereby the network connectivity required to support the service is determined by examining the edge of the network and determining the connecting components inward (e.g., toward a core of the network). In some cases, the UNI list might be examined and a set of bins might be created with each bin holding a subset of UNIs that share the same edge serving device. Once the set of bins is established, the underlying technology may be determined in order to identify the VLAN flow domain type for the edge. With reference to FIG. 3C, the two steps for FDN derivation might include determining shared edge devices (Step 1, 340 a) and determining the edge connecting technology (including, but not limited to, MTU-s, packet on a blade, PE-rs, H-VPLS, G.8032 RT, G.8032 COT, and/or the like) (Step 2, 340 b). At Step 1 (340 a), UNIs 325 or 350 that share the same edge serving device may be grouped within the same bin of a plurality of bins 345 (including a first bin 345 a, a second bin 345 b, and a third bin 345 c, as shown in the non-limiting example of FIG. 3C). For example, in the embodiment of FIG. 3C, UNIs 1, 2, and 4 might be grouped in the first bin 345 a, while UNI 3 might be placed in the second bin 345 b, and UNIs 5 and 6 might be grouped in the third bin 345 c. At Step 2 (340 b), the underlying technology for the grouped UNIs (in the appropriate bins) may be determined in order to identify the VLAN flow domain type for the edge. In some embodiments, by grouping the UNIs by shared edge serving device, determination of the underlying network technology may be implemented by determining the underlying technology for each of the shared edge serving devices (each represented by a bin of the plurality of bins). In such as case, efficient determination may be performed with minimal duplicative determinations. FIG. 4 is a flow diagram illustrating an exemplary method 400 for generating a FDN object, in accordance with various embodiments. In particular, method 400 represents an implementation of an FDN algorithm using the outside-in approach, as referred to with respect to FIGS. 2 and 3 above. While the techniques and procedures of the method 400 is depicted and/or described in a certain order for purposes of illustration, it should be appreciated that certain procedures may be reordered and/or omitted within the scope of various embodiments. Moreover, while the method illustrated by FIG. 6 can be implemented by (and, in some cases, are described below with respect to) system 100 of FIG. 1 (or components thereof), or any of systems 200, 300, and 500 of FIGS. 2, 3, and 5 (or components thereof), respectively, the method may also be implemented using any suitable hardware implementation. Similarly, while systems 200, 300, and 500 (and/or components thereof) can operate according to the methods illustrated by FIG. 4 (e.g., by executing instructions embodied on a computer readable medium), systems 200, 300, and 500 can also operate according to other modes of operation and/or perform other suitable procedures. With reference to FIG. 4, method 400 might comprise initiating MEF service provisioning (block 402). In some cases, initiating MEF service provisioning might comprise receiving a service request, which might originate from a first client device over a network (in some cases, via a UNI). At block 404, method 400 might comprise entering a vector of UNI(s). In some embodiments, entering a vector of UNI(s) might comprise determining one or more network devices for implementing a service arising from the service request. In some cases, the vector of UNI(s) might be included in, or derived from, the service request. Method 400, at block 406, might comprise performing, with the first network device, an edge flow domain analysis and, at block 408, might comprise determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising an intra-provider edge router system for multi-dwelling units (“intra-MTU-s”), based on the edge flow domain analysis. Method 400 might further comprise, based on a determination that at least one of the one or more second network devices is included in a flow domain comprising an intra-MTU-s, determining, with the first network device, one or more edge flow domains (block 410) and, based on a determination that at least one of the one or more second network devices does not include a flow domain comprising an intra-MTU-s, performing, with the first network device, a ring flow domain analysis (block 412). At block 414, method 400 might comprise determining, with the first network device, whether at least one of the one or more second network devices is included in one or more G.8032 ring flow domains, based on the ring flow domain analysis. Method 400, at block 416, might comprise, based on a determination that at least one of the one or more second network devices is included in one or more G.8032 ring flow domains, determining, with the first network device, the one or more G.8032 flow domains. At block 418, method 400 might comprise, based on a determination that at least one of the one or more second network devices is not included in one or more G.8032 ring flow domains, performing, with the first network device, an aggregate (“AGG”) flow domain analysis. Method 400 might further comprise, at block 420, determining, with the first network device, whether at least one of the one or more second network devices is included in one or more aggregate flow domains, based on the aggregate flow domain analysis. Method 400 might further comprise, based on a determination that at least one of the one or more second network devices is included in one or more aggregate flow domains, determining, with the first network device, the one or more aggregate flow domains (block 422) and, based on a determination that at least one of the one or more second network devices is not included in one or more aggregate flow domains, performing, with the first network device, a hierarchical virtual private local area network service (“H-VPLS”) flow domain analysis (block 424). At block 426, method 400 might comprise determining, with the first network device, whether at least one of the one or more second network devices is included in one or more H-VPLS flow domains, based on the H-VPLS flow domain analysis. Method 400, at block 428, might comprise based on a determination that at least one of the one or more second network devices is included in one or more H-VPLS flow domains, determining, with the first network device, the one or more one or more H-VPLS flow domains. Based on a determination that at least one of the one or more second network devices is not included in one or more H-VPLS flow domains, method 400 might follow marker “A” to block 430, at which method 400 might comprise performing, with the first network device, a virtual private local area network service (“VPLS”) flow domain analysis. At block 432, method 400 might comprise determining, with the first network device, whether at least one of the one or more second network devices is included in one or more VPLS flow domains, based on the VPLS flow domain analysis. Method 400 might further comprise, based on a determination that at least one of the one or more second network devices is included in one or more VPLS flow domains, determining, with the first network device, the one or more VPLS flow domains (block 434) and, based on a determination that at least one of the one or more second network devices is not included in one or more VPLS flow domains, performing, with the first network device, a flow domain analysis for a provider edge having routing and switching functionality (“PE_rs flow domain analysis”) (block 436). Method 400, at block 438, might comprise determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising one or more PE_rs, based on the PE_rs flow domain analysis. At block 440, method 400 might comprise, based on a determination that at least one of the one or more second network devices is included in a flow domain comprising one or more PE_rs, determining, with the first network device, one or more PE_rs flow domains. Method 400 might further comprise, at block 442, based on a determination that at least one of the one or more second network devices is not included in a flow domain comprising one or more PE_rs, performing, with the first network device, an interconnect flow domain analysis. Method 400, at block 444, might comprise determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising an external network-to-network interface (“E-NNI”). Method 400 might further comprise, based on the interconnect flow domain analysis, and based on a determination that at least one of the one or more second network devices is included in a flow domain comprising an E-NNI, determining, with the first network device, one or more service provider or operator flow domains (block 446). Otherwise, method 400 proceeds to block 448. In some embodiments, following the determinations of the flow domains—including, e.g., the one or more edge flow domains (at block 410), the one or more G.8032 ring flow domains (at block 416), the one or more AGG flow domains (at block 422), the one or more H-VPLS flow domains (at block 428), the one or more VPLS flow domains (at block 434), the one or more PE_rs flow domains (at block 440), and/or the one or more service provider/operator flow domains (at block 446)—the processes of method 400 proceed to block 448. At block 448, method 400 might comprise stitching, with the first network device, at least one of the determined one or more edge flow domains, the determined one or more G.8032 flow domains, the determined one or more aggregate flow domains, the determined one or more one or more H-VPLS flow domains, the determined one or more VPLS flow domains, the determined one or more PE_rs flow domains, and/or the determined one or more service provider or operator flow domains, or the like, to generate flow domain information indicating a flow domain network (“FDN”) or to generate an FDN object or the like (block 450). The process then concludes at block 452. As discussed herein, the flow domain information or FDN object may be used to configure at least one of one or more second network devices to perform a service arising from the service request, the service including, but not limited to, service activation, service modification, service assurance, fault isolation, and/or performance monitoring, or the like. In some embodiments, the service request might be initiated by the client northbound from the NML-CM system. The NML-CM system may be responsible for decomposing the set of service attributes. The FDN result might be used to determine the underlying element management systems that support each flow domain. The set of requests for activation to each element management system might be transmitted based on the decomposition of the service request into a FDN and FDN into segments. The examples shown in FIGS. 5A-5I (collectively, “FIG. 5”) provide technology specific use cases for VPLS and VLAN flow domains under various topology configurations, in accordance with various embodiments. Although specific network configurations are shown in FIG. 5, such configurations are merely illustrative and non-limiting, and the various embodiments any suitable network configurations having similar flow domains. In FIG. 5A, which represents an example of a flow domain having two UNI Intra-MTU-s to AGG to PE-rs, system 500 comprises two user-side UNIs 505, an MTU-s 510, an AGG 515, and a PE-rs 520. The MTU-s 510 comprises VLAN flow domain A 525 a, while the AGG 515 comprises VLAN flow domain B 525 b, and the PE-rs 520 comprises VLAN flow domain C 525 c. A first user-side UNI (“UNI-C”) 505 has a corresponding network-side UNI (“UNI-N”) 530 a, while a second user-side UNI (“UNI-C”) 505 has a corresponding network-side UNI (“UNI-N”) 530 b. The UNI-Ns 530 a and 530 b communicatively couple the UNI-Cs 505 to VLAN flow domain A 525 a. A first internal network-to-network interface (“I-NNI”) 530 c communicatively couples VLAN flow domain A 525 a with VLAN flow domain B 525 b, while a second I-NNI 530 d communicatively couples VLAN flow domain B 525 b with VLAN flow domain C 525 c. Dashed arrows 535 a and 535 b (collectively, “flow paths 535”) represent flow paths, in this case, from VLAN flow domain A 525 a to each UNI-C 505. As shown in the embodiment of FIG. 5A, the two UNI single Intra MTU-s flow domain use case has a bridged VLAN flow domain with UNIs connected to bridged flow domain. In this case, only two UNIs are defined and are connected to the same MTU-s. A derivative of this option is to configure the MTU-s VLAN flow domain as a cross-connection. In FIG. 5B, which represents an Intra AGG to PE-rs flow domain, system 500 is similar to system 500 as shown in FIG. 5A (and thus descriptions in FIG. 5A similarly apply to corresponding or similar components in FIG. 5B), except that system 500 in FIG. 5B further comprises a second MTU-s 510 b comprising VLAN flow domain D 525 d. In this example, a third UNI-C 505 has a corresponding UNI-N 530 e that communicatively couples to VLAN flow domain D 525 d. A third I-NNI 530 f communicatively couples VLAN flow domain D 525 d with VLAN flow domain B 525 b. Flow path 535 c represents a flow path from VLAN flow domain B 525 b, via VLAN flow domain D 525 d and the third UNI-N 530 e, to the third UNI-C 505. Flow path 535 d represents a flow path from VLAN flow domain B 525 b to VLAN flow domain A 525 a, while flow path 535 e (denoted by a long dash and a double dash) represents a flow path from VLAN flow domain B 525 b to VLAN flow domain C 525 c. In the embodiment of FIG. 5B, the Intra AGG flow domain has multiple MTU-s devices served by a single AGG device. MTU-s VLAN bridged flow domains are configured on each MTU-s. The individual I-NNIs are connected to the AGG bridged VLAN flow domain. Additional UNIs configured via the PE-rs must be accounted for. If additional UNIs that traverse a second PE-rs is required, then the PE-rs bridge flow domain is associated with a VPLS flow domain. In FIG. 5C, which represents an Intra PE-rs/Multiple AGG to PE-rs flow domain, system 500 is similar to system 500 as shown in FIG. 5B (and thus descriptions in FIG. 5B similarly apply to corresponding or similar components in FIG. 5C), except that system 500 in FIG. 5C further comprises a third MTU-s 510 c comprising VLAN flow domain E 525 e and a second AGG 515 b comprising VLAN flow domain F 525 f. In this example, a fourth UNI-C 505 has a corresponding UNI-N 530 g that communicatively couples to VLAN flow domain E 525 e. A fourth I-NNI 530 h communicatively couples VLAN flow domain E 525 e with VLAN flow domain F 525 f, while a fifth I-NNI 530 i communicatively couples VLAN flow domain F 525 f to VLAN flow domain C 525 c. Here, flow path 535 d represents a flow path from VLAN flow domain C 525 c to VLAN flow domain A 525 a, while flow path 535 e (denoted by a long dash and a double dash) represents a flow path from VLAN flow domain C 525 c to another VLAN flow domain (not shown). Flow path 535 f represents a flow path from VLAN flow domain C 525 c, via VLAN flow domain E 525 e, VLAN flow domain F 525 f, fourth I-NNI 530 h, fifth I-NNI 530 i, and fourth UNI-N 530 g, to the fourth UNI-C 505. In the example of FIG. 5C, the Intra PE-rs/Multiple AGG flow domain has one or more MTU-s devices with VLAN bridged or cross-connection flow domains. Each I-NNI from the MTU-s is connected to a VLAN bridged AGG flow domain. Multiple AGG devices are connected with I-NNIs to a common PE-rs VLAN bridged flow domain. If additional UNIs that traverse a second PE-rs are required, then the PE-rs bridge flow domain is associated with a VPLS flow domain. In FIG. 5D, which represents an Intra PE-rs with UNI/AGG flow domain, system 500 is similar to system 500 as shown in FIG. 5B (and thus descriptions in FIG. 5B similarly apply to corresponding or similar components in FIG. 5D), except that system 500 in FIG. 5D further comprises a fourth UNI-C 505 having a corresponding fourth UNI-N 530 g communicatively coupling the fourth UNI-C 505 to VLAN flow domain C 525 c. Flow path 535 g represents a flow path from VLAN flow domain C 525 c to the fourth UNI-C 505 via the fourth UNI-N 530 g. As shown in the embodiment of FIG. 5D, the Intra PE-rs with UNI/AGG flow domain is a use case where the PE-rs in addition to serving AGG connections is providing UNI service. The PE-rs is configured with a VLAN bridged flow domain and associates the I-NNI(s) from AGG devices and all serving UNIs. In FIG. 5E, which represents an Intra-AGG/AGG UNI flow domain, system 500 comprises a first UNI-C 505, an MTU-s 510, an AGG 515, and a PE-rs 520. The MTU-s 510 comprises VLAN flow domain A 525 a, while the AGG 515 comprises VLAN flow domain B 525 b, and the PE-rs 520 comprises VLAN flow domain C 525 c. The first UNI-C 505 has a corresponding UNI-N 530 a, which communicatively couples the first UNI-C 505 to VLAN flow domain A 525 a. A first I-NNI 530 c communicatively couples VLAN flow domain A 525 a with VLAN flow domain B 525 b, while a second I-NNI 530 d communicatively couples VLAN flow domain B 525 b with VLAN flow domain C 525 c. In this case, another UNI-C 505 has a corresponding UNI-N 530 e that communicatively couples to VLAN flow domain B 525 b. Flow path 535 h represents a flow path from VLAN flow domain B 525 b, via VLAN flow domain A 525 a, UNI-N 530 a, and I-NNI 530 c, to the first UNI-C 505. Flow path 535 i represents a flow path from VLAN flow domain B 525 b, via UNI-N 530 e, to the other UNI-C 505. In the example shown in FIG. 5E, the Intra-AGG UNI flow domain use case is also referred to as a packet on a blade (“POB”). In this use case, the AGG device is serving one or more MTU-s devices and one or more UNIs. The remainder of FIG. 5 shows examples of logic that may be necessary to determine if the underlying technology provides G.8032 ERPS network flow domain. A G.8032 ring VLAN flow domain must have the VLAN assignment across all remote terminals (“RTs”) and central office terminals (“COTs”) within a ring. This is a requirement for diversity in failure conditions. The following provides the necessary logic to determine whether the underlying technology provides VPLS network flow domain. In order for a VPLS flow domain to be required, more than one PE-rs is required to fulfill the service activation request. In FIG. 5F, in which an example of VPLS flow domain is shown, system 500 might comprise a first PE-rs 520 a, a second PE-rs 520 b, and a third PE-rs 520 c. The first PE-rs 520 a might comprise a first access concentrator (“AC 1”) 545 a, while the second PE-rs 520 b might comprise a second AC (“AC 2”) 545 b, and the third PE-rs 520 c might comprise a third AC (“AC 3”) 545 c. System 500 might further comprise a VPLS flow domain A 540 that communicatively couples each of AC 1 545 a, AC 2 545 b, and AC 3 545 c via connections 530 j, 530 k, and 530 l, respectively. In some embodiments, each of connections 530 j, 530 k, and 530 l might include an I-NNI connection, as described in detail above. Here, flow path 535 j represents a flow path from/to AC 1 545 a to/from AC 2 545 b, via VPLS flow domain A 540 and connections 530 j and 530 k. Flow path 535 k represents a flow path from/to AC 1 545 a to/from AC 3 545 c, via VPLS flow domain A 540 and connections 530 j and 530 l. Flow path 535 l represents a flow path from/to AC 2 545 b to/from AC 3 545 c, via VPLS flow domain A 540 and connections 530 k and 530 l. In FIG. 5G, which represents a G.8032 single UNI on RT to AGG to PE-rs flow domain, system 500 might comprise a first UNI-C 505, a first RT (“RT1”) 550 a, a second RT (“RT2”) 550 b, an Nth RT (“RTn”) 550 n, a COT 555, an AGG 515, and a PE-rs 520. RT2 550 b might comprise VLAN flow domain A 525 a, while RT1 550 a might comprise VLAN flow domain B 525 b, and RTn 550 n might comprise VLAN flow domain N 525 n. COT 555 might comprise VLAN flow domain M 525 m, while AGG 515 might comprise VLAN flow domain O 525 o, and PE-rs might comprise VLAN flow domain p 525 p. The first UNI-C 505 might have a corresponding UNI-N 530 m that communicatively couples to VLAN flow domain A 525 a. I-NNI 530 n communicatively couples VLAN flow domain A 525 a to VLAN flow domain B 525 b. I-NNI 530 o communicatively couples VLAN flow domain B 525 b to VLAN flow domain M 525 m. I-NNI 530 p communicatively couples VLAN flow domain M 525 m to VLAN flow domain N 525 n. I-NNI 530 q communicatively couples VLAN flow domain N 525 n to VLAN flow domain A 525 a. RT1 550 a, RT2 550 b, RTn 550 n, and COT 555 define a G.8032 ring. In other words, connection of VLAN flow domain A 525 a, VLAN flow domain B 525 b, VLAN flow domain M 525 m, and VLAN flow domain N 525 n (i.e., via I-NNIs 530 n, 530 o, 530 p, and 530 q, respectively) define the G.8032 ring. I-NNI 530 r communicatively couples VLAN flow domain M 525 m to VLAN flow domain O 525 o, while I-NNI 530 s communicatively couples VLAN flow domain O 525 o to VLAN flow domain P 525 p. Flow path 535 m represents a flow path from/to UNI-C 505 to/from PE-rs 520, via UNI-N 530 m, VLAN flow domain A 525 a, I-NNI 530 n, VLAN flow domain B 525 b, I-NNI 530 o, VLAN flow domain M 525 m, I-NNI 530 r, VLAN flow domain O 525 o, I-NNI 530 s, and VLAN flow domain P 525 p. Flow path 535 n (denoted by a long dash and a double dash) represents a flow path from/to VLAN flow domain A 525 a to/from VLAN flow domain M 525 m, via VLAN flow domain N 525 n and I-NNIs 530 q and 530 p. In the embodiment of FIG. 5G, the G.8032 single UNI on RT to AGG to PE-rs flow domain use case requires a VLAN bridged flow domain to be configured on the serving RT. The G.8032 ring members including COT must be configured with VLAN bridge or cross-connection flow domain. The COT is connected with G.8032 I-NNIs to RT ring members and upstream AGG device. The I-NNIs are associated with a COT VLAN flow domain. The AGG device is configured with a VLAN bridged or cross-connection VLAN flow domain. The AGG upstream and downstream I-NNIs are associated with the VLAN bridged or cross-connection flow domain. A VLAN bridged or cross-connection flow domain is configured on the PE-rs. In this use case, it is assumed that additional UNIs are served from a non-common PE-rs. Further flow domain analysis may connect to VPLS flow domain and corresponding flow domains. In FIG. 5H, which represents a G.8032 single UNI on RT to PE-rs flow domain, system 500 is similar to system 500 as shown in FIG. 5G (and thus descriptions in FIG. 5G similarly apply to corresponding or similar components in FIG. 5H), except that system 500 in FIG. 5H omits AGG 515. In FIG. 5H, PE-rs 520 comprises VLAN flow domain O 525 o, and I-NNI 530 r communicatively couples VLAN flow domain M 525 m to VLAN flow domain O 525 o. The embodiment of FIG. 5H is otherwise similar, or identical, to that of FIG. 5G. In the example shown in FIG. 5H, the G.8032 single UNI on RT to PE-rs requires a single VLAN bridged flow domain to be configured on the serving RT. In FIG. 5I, which represents a G.8032 Intra RT flow domain, system 500 is similar to system 500 as shown in FIG. 5G (and thus descriptions in FIG. 5G similarly apply to corresponding or similar components in FIG. 5I), except that system 500 in FIG. 5I further comprises a second UNI-C 505. The two UNI-Cs 505 have corresponding UNI-Ns 530 m and 530 t that each communicatively couples a UNI-C 505 to VLAN flow domain A 525 a. Flow path 535 o represents a flow path from VLAN flow domain A 525 a to UNI-C 505, via UNI-N 530 m, while flow path 535 p represents a flow path from VLAN flow domain A 525 a to UNI-C 505, via UNI-N 530 t. Flow path 535 q (denoted by a long dash and a double dash) represents a flow path from/to VLAN flow domain A 525 a to VLAN flow domain P 525 p, via G.8032 ring (i.e., VLAN flow domain A 525 a, VLAN flow domain B 525 b, VLAN flow domain M 525 m, VLAN flow domain N 525 n, and I-NNIs 530 n, 530 o, 530 p, and 530 q), VLAN flow domain M 525 m, VLAN flow domain O 525 o, VLAN flow domain P 525 p, and I-NNIs 530 r and 530 s. The embodiment of FIG. 5I is otherwise similar, or identical, to that of FIG. 5G. In some embodiments with respect to FIG. 5, I-NNIs 530 might allow for a technique referred to as provider bridging, in which stacked VLANs (denoted “QinQ,” “Q-in-Q,” or “Q in Q”) may be implemented, as provided under IEEE 802.1ad. We now turn to FIG. 6, which is directed to method 600 for generating flow domain information and implementing automatic configuration of network devices based on the generated flow domain information, in accordance with various embodiments. While the techniques and procedures of the method 600 is depicted and/or described in a certain order for purposes of illustration, it should be appreciated that certain procedures may be reordered and/or omitted within the scope of various embodiments. Moreover, while the method illustrated by FIG. 6 can be implemented by (and, in some cases, are described below with respect to) system 100 of FIG. 1 (or components thereof), or any of systems 200, 300, and 500 of FIGS. 2, 3, and 5 (or components thereof), respectively, the method may also be implemented using any suitable hardware implementation. Similarly, while systems 200, 300, and 500 (and/or components thereof) can operate according to the methods illustrated by FIG. 6 (e.g., by executing instructions embodied on a computer readable medium), systems 200, 300, and 500 can also operate according to other modes of operation and/or perform other suitable procedures. In FIG. 6, method 600 might comprise receiving, with a first network device in a network, a service request, the service request originating from a first client device over the network (block 605). In some embodiments, the first network device might include, without limitation, a network management layer-configuration management (“NML-CM”) controller or a layer 3/layer 2 flow domain (“L3/L2 FD”) controller, or the like. In some cases, the network might be a metro Ethernet network. In alternative embodiments, the network may be any suitable network including, but not limited to, a local area network (“LAN”), including without limitation a fiber network, an Ethernet network, a Token-Ring™ network and/or the like; a wide-area network (“WAN”); a wireless wide area network (“WWAN”); a virtual network, such as a virtual private network (“VPN”); the Internet; an intranet; an extranet; a public switched telephone network (“PSTN”); an infra-red network; a wireless network, including without limitation a network operating under any of the IEEE 802.11 suite of protocols, the Bluetooth™ protocol known in the art, and/or any other wireless protocol; and/or any combination of these and/or other networks. In a particular embodiment, the network might include an access network of the service provider (e.g., an Internet service provider (“ISP”)). In another embodiment, the network might include a core network of the service provider, and/or the Internet. At block 610, method 600 might comprise determining, with the first network device, one or more second network devices for implementing a service arising from the service request. According to some embodiments, each of the one or more second network devices might comprise one of a U-PE router, a N-PE router, and/or an I-NNI device, or the like. In some cases, the service arising from the service request might comprise at least one of service activation, service modification, service assurance, fault isolation, and/or performance monitoring, or the like. Method 600 might further comprise, at block 615, determining, with the first network device, network technology utilized by each of the one or more second network devices. In some embodiments, network technology might include, without limitation, one or more of G.8032 ERPS technology, aggregation technology, H-VPLS technology, POB technology, PE_rs-served UNI technology, multi-operator technology, or VPLS technology, and/or the like. In some embodiments, the service request might be a Metro Ethernet Forum (“MEF”) service request. Determining, with the first network device, network technology utilized by each of the one or more second network devices (at block 615) might comprise mapping, with the first network device, MEF services associated with the service request with the network technology utilized by each of the one or more second network devices. In some instances, mapping, with the first network device, MEF services associated with the service request with the network technology utilized by each of the one or more second network devices might comprise implementing, with the first network device, an intermediate abstraction between the MEF services and the network technology utilized by each of the one or more second network devices, using a layer network domain. According to some embodiments, the MEF service request might comprise vectors of at least two user network interfaces (“UNIs”) and at least one Ethernet virtual circuit (“EVC”). Method 600, at block 620, might comprise generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices. In some embodiments, generating flow domain information, using flow domain analysis might comprise generating a flow domain network (“FDN”) object, using flow domain analysis. In some cases, generating a FDN object might comprise generating a computed graph of flow domains indicating one or more network paths in the network through the one or more second network devices and indicating relevant connectivity associations of the one or more second network devices. In some instances, generating a FDN object might comprise utilizing an outside-in analysis that first analyzes relevant user network interfaces (as shown, e.g., with respect to FIGS. 2A, 3B, 3C, and 4). At block 625, method 600 might comprise automatically configuring, with a third network device in the network, at least one of the one or more second network devices to enable performance of the service arising from the service request, based at least in part on the generated flow domain information. In some embodiments, the third network device might include, without limitation, one of a layer 3/layer 2 element management layer-configuration management (“L3/L2 EML-CM”) controller, a NML-CM activation engine, a NML-CM modification engine, a service assurance engine, a fault isolation engine, or a performance monitoring engine, and/or the like. In some cases, the first network device and the third network device might be the same network device. According to some embodiments, the third network device might receive the flow domain information from the first network device, and might automatically configure the at least one of the one or more second network devices to enable performance of the service arising from the service request, by sending configuration instructions to the at least one of the one or more second network devices. The at least one of the one or more second network devices might receive the configuration instructions from the third network device, and might change network configuration settings (i.e., network configuration settings internal to each of the at least one of the one or more second network devices that receives the configuration instructions), based on the configuration instructions. FIG. 7 provides a schematic illustration of one embodiment of a computer system 700 that can perform the methods provided by various other embodiments, as described herein, and/or can function as a customer equipment, a user device, a user network interface (“UNI”), a network interface device (“NID”), an optical network terminal (“ONT”), a control server, an OAM server, server computer, a network management layer-configuration management (“NML-CM”) controller, a layer 3/layer 2 flow domain (“L3/L2 FD”) controller, a layer 3/layer 2 element management layer-configuration management (“L3/L2 EML-CM”) controller, a NML-CM activation engine, a NML-CM modification engine, a service assurance engine, a fault isolation engine, a performance monitoring engine, a user-side provider edge (“U-PE”) router, a network-side provider edge (“N-PE”) router, or an internal network-to-network interface (“I-NNI”) device, and/or the like. It should be noted that FIG. 7 is meant only to provide a generalized illustration of various components, of which one or more (or none) of each may be utilized as appropriate. FIG. 7, therefore, broadly illustrates how individual system elements may be implemented in a relatively separated or relatively more integrated manner. The computer system 700 is shown comprising hardware elements that can be electrically coupled via a bus 705 (or may otherwise be in communication, as appropriate). The hardware elements may include one or more processors 710, including without limitation one or more general-purpose processors and/or one or more special-purpose processors (such as digital signal processing chips, graphics acceleration processors, and/or the like); one or more input devices 715, which can include, without limitation, a mouse, a keyboard, and/or the like; and one or more output devices 720, which can include, without limitation, a display device, a printer, and/or the like. The computer system 700 may further include (and/or be in communication with) one or more storage devices 725, which can comprise, without limitation, local and/or network accessible storage, and/or can include, without limitation, a disk drive, a drive array, an optical storage device, solid-state storage device such as a random access memory (“RAM”) and/or a read-only memory (“ROM”), which can be programmable, flash-updateable, and/or the like. Such storage devices may be configured to implement any appropriate data stores, including, without limitation, various file systems, database structures, and/or the like. The computer system 700 might also include a communications subsystem 730, which can include, without limitation, a modem, a network card (wireless or wired), an infra-red communication device, a wireless communication device and/or chipset (such as a Bluetooth™ device, an 802.11 device, a WiFi device, a WiMax device, a WWAN device, cellular communication facilities, etc.), and/or the like. The communications subsystem 730 may permit data to be exchanged with a network (such as the network described below, to name one example), with other computer systems, and/or with any other devices described herein. In many embodiments, the computer system 700 will further comprise a working memory 735, which can include a RAM or ROM device, as described above. The computer system 700 also may comprise software elements, shown as being currently located within the working memory 735, including an operating system 740, device drivers, executable libraries, and/or other code, such as one or more application programs 745, which may comprise computer programs provided by various embodiments, and/or may be designed to implement methods, and/or configure systems, provided by other embodiments, as described herein. Merely by way of example, one or more procedures described with respect to the method(s) discussed above might be implemented as code and/or instructions executable by a computer (and/or a processor within a computer); in an aspect, then, such code and/or instructions can be used to configure and/or adapt a general purpose computer (or other device) to perform one or more operations in accordance with the described methods. A set of these instructions and/or code might be encoded and/or stored on a non-transitory computer readable storage medium, such as the storage device(s) 725 described above. In some cases, the storage medium might be incorporated within a computer system, such as the system 700. In other embodiments, the storage medium might be separate from a computer system (i.e., a removable medium, such as a compact disc, etc.), and/or provided in an installation package, such that the storage medium can be used to program, configure, and/or adapt a general purpose computer with the instructions/code stored thereon. These instructions might take the form of executable code, which is executable by the computer system 700 and/or might take the form of source and/or installable code, which, upon compilation and/or installation on the computer system 700 (e.g., using any of a variety of generally available compilers, installation programs, compression/decompression utilities, etc.) then takes the form of executable code. It will be apparent to those skilled in the art that substantial variations may be made in accordance with specific requirements. For example, customized hardware (such as programmable logic controllers, field-programmable gate arrays, application-specific integrated circuits, and/or the like) might also be used, and/or particular elements might be implemented in hardware, software (including portable software, such as applets, etc.), or both. Further, connection to other computing devices such as network input/output devices may be employed. As mentioned above, in one aspect, some embodiments may employ a computer system (such as the computer system 700) to perform methods in accordance with various embodiments of the invention. According to a set of embodiments, some or all of the procedures of such methods are performed by the computer system 700 in response to processor 710 executing one or more sequences of one or more instructions (which might be incorporated into the operating system 740 and/or other code, such as an application program 745) contained in the working memory 735. Such instructions may be read into the working memory 735 from another computer readable medium, such as one or more of the storage device(s) 725. Merely by way of example, execution of the sequences of instructions contained in the working memory 735 might cause the processor(s) 710 to perform one or more procedures of the methods described herein. The terms “machine readable medium” and “computer readable medium,” as used herein, refer to any medium that participates in providing data that causes a machine to operate in a specific fashion. In an embodiment implemented using the computer system 700, various computer readable media might be involved in providing instructions/code to processor(s) 710 for execution and/or might be used to store and/or carry such instructions/code (e.g., as signals). In many implementations, a computer readable medium is a non-transitory, physical, and/or tangible storage medium. Such a medium may take many forms, including, but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical and/or magnetic disks, such as the storage device(s) 725. Volatile media includes, without limitation, dynamic memory, such as the working memory 735. Transmission media includes, without limitation, coaxial cables, copper wire and fiber optics, including the wires that comprise the bus 705, as well as the various components of the communication subsystem 730 (and/or the media by which the communications subsystem 730 provides communication with other devices). Hence, transmission media can also take the form of waves (including, without limitation, radio, acoustic, and/or light waves, such as those generated during radio-wave and infra-red data communications). Common forms of physical and/or tangible computer readable media include, for example, a floppy disk, a flexible disk, a hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punch cards, paper tape, any other physical medium with patterns of holes, a RAM, a PROM, an EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read instructions and/or code. Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to the processor(s) 710 for execution. Merely by way of example, the instructions may initially be carried on a magnetic disk and/or optical disc of a remote computer. A remote computer might load the instructions into its dynamic memory and send the instructions as signals over a transmission medium to be received and/or executed by the computer system 700. These signals, which might be in the form of electromagnetic signals, acoustic signals, optical signals, and/or the like, are all examples of carrier waves on which instructions can be encoded, in accordance with various embodiments of the invention. The communications subsystem 730 (and/or components thereof) generally will receive the signals, and the bus 705 then might carry the signals (and/or the data, instructions, etc. carried by the signals) to the working memory 735, from which the processor(s) 705 retrieves and executes the instructions. The instructions received by the working memory 735 may optionally be stored on a storage device 725 either before or after execution by the processor(s) 710. While certain features and aspects have been described with respect to exemplary embodiments, one skilled in the art will recognize that numerous modifications are possible. For example, the methods and processes described herein may be implemented using hardware components, software components, and/or any combination thereof. Further, while various methods and processes described herein may be described with respect to particular structural and/or functional components for ease of description, methods provided by various embodiments are not limited to any particular structural and/or functional architecture but instead can be implemented on any suitable hardware, firmware, and/or software configuration. Similarly, while certain functionality is ascribed to certain system components, unless the context dictates otherwise, this functionality can be distributed among various other system components in accordance with the several embodiments. Moreover, while the procedures of the methods and processes described herein are described in a particular order for ease of description, unless the context dictates otherwise, various procedures may be reordered, added, and/or omitted in accordance with various embodiments. Moreover, the procedures described with respect to one method or process may be incorporated within other described methods or processes; likewise, system components described according to a particular structural architecture and/or with respect to one system may be organized in alternative structural architectures and/or incorporated within other described systems. Hence, while various embodiments are described with—or without—certain features for ease of description and to illustrate exemplary aspects of those embodiments, the various components and/or features described herein with respect to a particular embodiment can be substituted, added, and/or subtracted from among other described embodiments, unless the context dictates otherwise. Consequently, although several exemplary embodiments are described above, it will be appreciated that the invention is intended to cover all modifications and equivalents within the scope of the following claims. What is claimed is: 1. A method, comprising: receiving, with a first network device in a network, a service request, the service request originating from a first client device over the network; determining, with the first network device, one or more second network devices for implementing a service arising from the service request; determining, with the first network device, network technology utilized by each of the one or more second network devices; generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices; and automatically configuring, with a third network device in the network, at least one of the one or more second network devices to enable performance of the service arising from the service request, based at least in part on the generated flow domain information. 2. The method of claim 1, wherein generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices comprises generating, with the first network device, a flow domain network (“FDN”) object, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices. 3. The method of claim 2, wherein generating, with the first network device, the FDN object, using flow domain analysis comprises generating, with the first network device, a computed graph of flow domains indicating one or more network paths in the network through the one or more second network devices and indicating relevant connectivity associations of the one or more second network devices. 4. The method of claim 2, wherein generating, with the first network device, the FDN object, using flow domain analysis comprises utilizing an outside-in analysis that first analyzes relevant user network interfaces. 5. The method of claim 1, wherein the service request comprises a Metro Ethernet Forum (“MEF”) service request. 6. The method of claim 5, wherein determining, with the first network device, network technology utilized by each of the one or more second network devices comprises mapping, with the first network device, MEF services associated with the service request with the network technology utilized by each of the one or more second network devices. 7. The method of claim 6, wherein mapping, with the first network device, MEF services associated with the service request with the network technology utilized by each of the one or more second network devices comprises implementing, with the first network device, an intermediate abstraction between the MEF services and the network technology utilized by each of the one or more second network devices, using a layer network domain. 8. The method of claim 5, wherein the MEF service request comprises vectors of at least two user network interfaces (“UNIs”) and at least one Ethernet virtual circuit (“EVC”). 9. The method of claim 8, generating, with the first network device, the flow domain information comprises: determining, with the first network device, a network path connecting each of the at least two UNIs with the at least one EVC; and generating, with the first network device, the flow domain information, wherein the flow domain information indicates the determined network path connecting each of the at least two UNIs with the at least one EVC and indicates connectivity associations for each of the at least two UNIs with the at least one EVC. 10. The method of claim 8, wherein generating, with the first network device, the flow domain information, using flow domain analysis, comprises: performing, with the first network device, an edge flow domain analysis; determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising an intra-provider edge router system for multi-dwelling units (“intra-MTU-s”), based on the edge flow domain analysis; based on a determination that at least one of the one or more second network devices is included in a flow domain comprising an intra-MTU-s, determining, with the first network device, one or more edge flow domains; based on a determination that at least one of the one or more second network devices does not include a flow domain comprising an intra-MTU-s, performing, with the first network device, a ring flow domain analysis; determining, with the first network device, whether at least one of the one or more second network devices is included in one or more G.8032 ring flow domains, based on the ring flow domain analysis; based on a determination that at least one of the one or more second network devices is included in one or more G.8032 ring flow domains, determining, with the first network device, the one or more G.8032 flow domains; based on a determination that at least one of the one or more second network devices is not included in one or more G.8032 ring flow domains, performing, with the first network device, an aggregate flow domain analysis; determining, with the first network device, whether at least one of the one or more second network devices is included in one or more aggregate flow domains, based on the aggregate flow domain analysis; based on a determination that at least one of the one or more second network devices is included in one or more aggregate flow domains, determining, with the first network device, the one or more aggregate flow domains; based on a determination that at least one of the one or more second network devices is not included in one or more aggregate flow domains, performing, with the first network device, a hierarchical virtual private local area network service (“H-VPLS”) flow domain analysis; determining, with the first network device, whether at least one of the one or more second network devices is included in one or more H-VPLS flow domains, based on the H-VPLS flow domain analysis; and based on a determination that at least one of the one or more second network devices is included in one or more H-VPLS flow domains, determining, with the first network device, the one or more one or more H-VPLS flow domains. 11. The method of claim 10, wherein generating, with the first network device, the flow domain information, using flow domain analysis, further comprises: based on a determination that at least one of the one or more second network devices is not included in one or more H-VPLS flow domains, performing, with the first network device, a virtual private local area network service (“VPLS”) flow domain analysis; determining, with the first network device, whether at least one of the one or more second network devices is included in one or more VPLS flow domains, based on the VPLS flow domain analysis; based on a determination that at least one of the one or more second network devices is included in one or more VPLS flow domains, determining, with the first network device, the one or more VPLS flow domains; based on a determination that at least one of the one or more second network devices is not included in one or more VPLS flow domains, performing, with the first network device, a flow domain analysis for a provider edge router having routing and switching functionality (“PE_rs flow domain analysis”); determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising one or more PE_rs, based on the PE_rs flow domain analysis; based on a determination that at least one of the one or more second network devices is included in a flow domain comprising one or more PE_rs, determining, with the first network device, one or more PE_rs flow domains; based on a determination that at least one of the one or more second network devices is not included in a flow domain comprising one or more PE_rs, performing, with the first network device, an interconnect flow domain analysis; determining, with the first network device, whether at least one of the one or more second network devices is included in a flow domain comprising an external network-to-network interface (“E-NNI”), based on the interconnect flow domain analysis; and based on a determination that at least one of the one or more second network devices is included in a flow domain comprising an E-NNI, determining, with the first network device, one or more service provider or operator flow domains. 12. The method of claim 11, wherein generating, with the first network device, the flow domain information, using flow domain analysis, further comprises: stitching, with the first network device, at least one of the determined one or more edge flow domains, the determined one or more G.8032 flow domains, the determined one or more aggregate flow domains, the determined one or more one or more H-VPLS flow domains, the determined one or more VPLS flow domains, the determined one or more PE_rs flow domains, or the determined one or more service provider or operator flow domains to generate the flow domain information indicating a flow domain network. 13. The method of claim 1, wherein the service arising from the service request comprises at least one of service activation, service modification, service assurance, fault isolation, or performance monitoring. 14. The method of claim 1, wherein the first network device comprises one of a network management layer-configuration management (“NML-CM”) controller or a layer 3/layer 2 flow domain (“L3/L2 FD”) controller. 15. The method of claim 1, wherein the third network device comprises one of a layer 3/layer 2 element management layer-configuration management (“L3/L2 EML-CM”) controller, a NML-CM activation engine, a NML-CM modification engine, a service assurance engine, a fault isolation engine, or a performance monitoring engine. 16. The method of claim 1, wherein the first network device and the third network device are the same network device. 17. The method of claim 1, wherein each of the one or more second network devices comprise one of a user-side provider edge (“U-PE”) router, a network-side provider edge (“N-PE”) router, a provider (“P”) router, or an internal network-to-network interface (“I-NNI”) device. 18. The method of claim 1, wherein the network technology comprises one or more of G.8032 Ethernet ring protection switching (“G.8032 ERPS”) technology, aggregation technology, hierarchical virtual private local area network service (“H-VPLS”) technology, packet on a blade (“POB”) technology, provider edge having routing and switching functionality (“PE_rs”)-served user network interface (“UNI”) technology, multi-operator technology, or virtual private local area network service (“VPLS”) technology. 19. A network device, comprising: at least one processor; and a non-transitory computer readable medium communicatively coupled to the at least one processor, the computer readable medium having stored thereon computer software comprising a set of instructions that, when executed by the at least one processor, causes the network device to perform one or more functions, the set of instructions comprising: instructions for receiving a service request, the service request originating from a first client device over the network; instructions for determining one or more second network devices for implementing a service arising from the service request; instructions for determining, with the first network device, network technology utilized by each of the one or more second network devices; and instructions for generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices, wherein the flow domain information is used to automatically configure the at least one of the one or more second network devices to enable performance of the service arising from the service request. 20. A system, comprising: a first network device; one or more second network devices; and a third network device; wherein the first network device comprises: at least one first processor; and a first non-transitory computer readable medium communicatively coupled to the at least one first processor, the first non-transitory computer readable medium having stored thereon computer software comprising a first set of instructions that, when executed by the at least one first processor, causes the first network device to perform one or more functions, the first set of instructions comprising: instructions for receiving a service request, the service request originating from a first client device over the network; instructions for determining one or more second network devices for implementing a service arising from the service request; instructions for determining, with the first network device, network technology utilized by each of the one or more second network devices; and instructions for generating, with the first network device, flow domain information, using flow domain analysis, based at least in part on the determined one or more second network devices and based at least in part on the determined network technology utilized by each of the one or more second network devices; wherein the third network device comprises: at least one third processor; and a third non-transitory computer readable medium communicatively coupled to the at least one third processor, the third non-transitory computer readable medium having stored thereon computer software comprising a third set of instructions that, when executed by the at least one third processor, causes the third network device to perform one or more functions, the third set of instructions comprising: instructions for receiving the flow domain information from the first network device; and instructions for automatically configuring the at least one of the one or more second network devices to enable performance of the service arising from the service request, by sending configuration instructions to the at least one of the one or more second network devices; wherein each of the one or more second network devices comprises: at least one second processor; and a second non-transitory computer readable medium communicatively coupled to the at least one second processor, the second non-transitory computer readable medium having stored thereon computer software comprising a second set of instructions that, when executed by the at least one second processor, causes the second network device to perform one or more functions, the second set of instructions comprising: instructions for receiving the configuration instructions from the third network device; and instructions for changing network configuration settings, based on the configuration instructions.

2016-04-28

en

2016-08-18

US-54833804-A

Method for producing 1,1,1-trifluoroethane ABSTRACT Process for the manufacture of 1,1,1-trifluoroethane (HFC-143a), according to which 1,1-difluoro-1-chloroethane (HCFC-142b) is subjected to a vapour-phase reaction with hydrogen fluoride (HF) in the presence of a hydrofluorination catalyst, in which process the molar ratio of the HCFC-142b introduced to the HF introduced into the vapour-phase reaction is greater than or equal to 1 and less than 1.3. The present invention relates to a process for the manufacture of 1,1,1-trifluoroethane (HFC-143a). HFC-143a is used as constituent of refrigerant mixtures which are replacing chlorofluorocarbons. Patent Application EP-A-714 874 discloses the manufacture of HFC-143a from 1,1-difluoro-1-chloroethane (HCFC-142b) in the vapour phase with an HF/HCFC-142b molar ratio of greater than 1. European Patent EP-B-714 874 teaches that this ratio has to be at least 1.3 in order to avoid the formation of by-products by decomposition of the HCFC-142b. It was desirable to make available a selective process for the manufacture of HFC-143a from HCFC-142b which makes it possible to achieve a good productive output by volume and which minimizes the need for purification operations on conclusion of the hydrofluorination reaction. The invention consequently relates to a process for the manufacture of 1,1,1-trifluoroethane (HFC-143a), according to which 1,1-difluoro-1-chloro-ethane (HCFC-142b) is subjected to a vapour-phase reaction with hydrogen fluoride (HF) in the presence of a hydrofluorination catalyst, in which process the molar ratio of the HCFC-142b introduced to the HF introduced into the vapour-phase reaction is greater than or equal to 1 and less than 1.3. It has been found, surprisingly and contrary to the teaching of the document EP 714 874, that it is possible to efficiently and selectively obtain HFC-143a from HCFC-142b while operating with an HF/HCFC-142b ratio of approximately 1. In the process according to the invention, good stability with regard to the activity of the catalyst over time is also observed. In the process according to the invention, the HF/HCFC-142b molar ratio is often greater than or equal to 1.02. Preferably, this molar ratio is greater than or equal to 1.05. In the process according to the invention, the HF/HCFC-142b molar ratio is often less than or equal to 1.25. Preferably, this molar ratio is less than or equal to 1.20. In the process according to the invention, the temperature is generally greater than or equal to 100° C. Preferably, the temperature is greater than or equal to 150° C. In the process according to the invention, the temperature is generally less than or equal to 400° C. Preferably, the temperature is less than or equal to 250° C. In the process according to the invention, the pressure is generally greater than or equal to 1 bar. Preferably, the pressure is greater than or equal to 5 bar. In the process according to the invention, the pressure is generally less than or equal to 30 bar. Preferably, the pressure is less than or equal to 15 bar. In the process according to the invention, the contact time, defined as the ratio of the volume of the catalyst to the flow rate of HF and HCFC-142b introduced into the reactor, is generally greater than or equal to 1 s. Preferably, the contact time is greater than or equal to 10 s. In the process according to the invention, the contact time, defined as the ratio of the volume of the catalyst to the flow rate of HF and HCFC-142b introduced into the reactor, is generally less than or equal to 200 s. Preferably, the contact time is less than or equal to 50 s. In the process according to the invention, the hydrofluorination catalyst can be chosen, for example, from supported or unsupported metal salts. If appropriate, the support can, for example, be active charcoal. The hydrofluorination catalyst can advantageously comprise chromium oxide. An amorphous chromium oxide exhibiting, before an optional prefluorination treatment, a BET/N2 specific surface of greater than or equal to 100 m2/g gives good results. An amorphous chromium oxide exhibiting such a specific surface of greater than or equal to 200 m2/g is preferred. If appropriate, the amorphous chromium oxide generally exhibits, before an optional prefluorination treatment, a BET/N2 specific surface of less than or equal to 600 m2/g, preferably of less than or equal to 400 m2/g. A catalyst which is particularly preferred for use in the process according to the invention comprises chromium and magnesium. This catalyst can be obtained by a method according to which: (a) a water-soluble chromium(III) salt is reacted with magnesium hydroxide or magnesium oxide, and optionally graphite, in the presence of water; (b) the reaction mixture obtained is converted into a paste; (c) the paste is dried; (d) the dried paste is subjected to treatment with hydrogen fluoride at temperatures of 20 to 500° C; and the amounts of water-soluble chromium(III) salt, of magnesium hydroxide or of magnesium oxide, and optionally of graphite, are respectively chosen so that the dried paste obtained in stage (c) comprises from 3.5 to 26% by weight, preferably from 4.5 to 23% by weight, of chromium, expressed in the form of Cr2O3, at least 25% by weight of magnesium, expressed in the form of MgO, and optionally graphite, preferably in an amount of 5 to 40% by weight. The manufacture of such a catalyst is disclosed, for example, in Application EP-A-733 611, the content of which with regard to this subject is incorporated by reference in the present patent application. In another aspect, it has been found that, with the catalyst comprising chromium and magnesium described above, all other characteristics remaining as defined above, specific advantages for stability of the activity of the catalyst are also obtained when the molar ratio of the HCFC-142b introduced to the HF introduced into the vapour-phase reaction is greater than or equal to 1.3. In this specific aspect, such a ratio of greater than or equal to 2 can be employed. In this specific aspect, the molar ratio of the HCFC-142b introduced to the HF introduced into the vapour-phase reaction is generally less than or equal to 10. Preferably, in this specific aspect, this ratio is less than or equal to 5. The HCFC-142b used as starting material in the process according to the invention is available commercially. Alternatively, it can be obtained by hydrofluorination starting from vinylidene chloride or from 1,1,1-trichloroethane or their mixtures. The stream of reactants introduced into the vapour-phase reaction is preferably composed essentially of HCFC-142b and of hydrogen fluoride. Other compounds, such as in particular 1,1-dichloro-1-fluoroethane, can optionally be present in the stream of reactants introduced into the vapour-phase reaction. Preferably, the content of such compounds is less than 5 mol %, with respect to the sum of moles of compounds present in the stream of reactants. A content of less than 1 mol% is more particularly preferred. The process according to the invention can be carried out continuously or batchwise. A continuous process is preferred. The process according to the invention can be carried out in any reactor appropriate for carrying out a vapour-phase hydrofluorination process. Mention may in particular be made of a tubular reactor, made of materials resistant to the presence of HF at the temperature and pressure of the reaction, comprising a fixed bed of catalyst. The example below is intended to illustrate the invention without, however, limiting it. EXAMPLE A catalyst comprising 4.6% by weight of Cr, expressed in the form of Cr2O3, Mg and graphite, obtained in accordance with the example of the document EP 733 611, was introduced into a tubular reactor with a volume of 70 ml made of Hastelloy B2. The catalyst was dried at 150° C. for 1 hour under a flushing stream of nitrogen at a flow rate of 10 N2/h. The catalyst was subsequently fluorinated with an HF/N2 mixture (11 l HF/h-20 l N2/h) at 200° C. for 1 hour and then at 250° C. for 1 hour, at 300° C. for 6 hours and at 350° C. for 8 hours. After fluorination, heating was carried out to a temperature of 200° C. HCFC-142b and HF were introduced continuously. The HF/HCFC-142b ratio introduced was 1.1. The pressure of the reaction was 10 bar. On conclusion of the reaction, a gas phase comprising HFC-143a was recovered and was introduced into a washing column in order to remove, by washing with an aqueous KOH solution, the excess HF and the HCl produced. The gas exiting from this washing operation was analysed by gas chromatography. The conversion of HCFC-142b was 93.5% and the selectivity for HFC-143a was 99.5%. The 0.5% of impurities comprised 50% of HCFC-141b. The reaction was continued for 600 h without loss of activity or of selectivity. 1. Process for the manufacture of 1,1,1-trifluoroethane (HFC-143a), according to which 1,1-difluoro-1-chloroethane (HCFC-142b) is subjected to a vapour-phase reaction with hydrogen fluoride (HF) in the presence of a hydrofluorination catalyst, in which process the molar ratio of the HCFC-142b introduced to the HF introduced into the vapour-phase reaction is greater than or equal to 1 and less than 1.3. 2. Process according to claim 1, in which the molar ratio is greater than or equal to 1.02. 3. Process according to claim 2, in which the molar ratio is greater than or equal to 1.05. 4. Process according to claim 1, in which the molar ratio is greater than or equal to 1.25. 5. Process according to claim 4, in which the molar ratio is greater than or equal to 1.20. 6. Process according to claim 1, in which the temperature of the reaction is from 100 to 400° C. 7. Process according to claim 1, in which the pressure of the reaction is from 1 to 30 bar. 8. Process according to claim 1, in which the contact time is from 1 to 200 s. 9. Process according to claim 1, in which the hydrofluorination catalyst comprises chromium oxide. 10. Process according to claim 9, in which the catalyst comprises chromium and magnesium and the catalyst can be obtained by a method according to which: (a) a water-soluble chromium(III) salt is reacted with magnesium hydroxide or magnesium oxide, and optionally graphite, in the presence of water; (b) the reaction mixture obtained is converted into a paste; (c) the paste is dried; (d) the dried paste is subjected to treatment with hydrogen fluoride at temperatures of 20 to 500° C.; and the amounts of water-soluble chromium(III) salt and of magnesium hydroxide or of magnesium oxide are respectively chosen so that the dried paste obtained in stage (c) comprises from 3.5 to 26% by weight of chromium, expressed in the form of Cr2O3, and at least 25% by weight of magnesium, expressed in the form of MgO. 11. Process according to claim 3, in which the molar ratio is greater than or equal to 1.25. 12. Process according to claim 11, in which the molar ratio is greater than or equal to 1.20. 13. Process according to claim 12, in which the temperature of the reaction is from 100 to 400° C. 14. Process according to claim 13, in which the pressure of the reaction is from 1 to 30 bar. 15. Process according to claim 14, in which the contact time is from 1 to 200 s. 16. Process according to claim 15, in which the hydrofluorination catalyst comprises chromium oxide.

2004-03-05

en

2006-08-24

US-202217962227-A

Holistic student assessment framework based on multi-task learning ABSTRACT The present disclosure relates to a method of predicting a user&#39;s score on a question by an electronic device. The method includes: training a DP-multi tasking learning (DP-MTL) model; verifying the DP-MTL model; receiving choice selection information related to the question from the user through the terminal, and predicting 1) a probability that the user answers the question correctly and 2) the user&#39;s score related to the question using the verified DP-MTL model based on the choice selection information, and the DP-MTL model may be a model for predicting the user&#39;s score based on 1) information on whether the user answers the question correctly, 2) information on which incorrect answer is selected among choices of the question when the user selects an incorrect answer, and 3) a skill level of the user. CROSS-REFERENCE TO RELATED APPLICATION This application claims priority to and the benefit of Korean Patent Application No. 10-2021-0133754, filed on Oct. 8, 2021 and Korean Patent Application No. 10-2021-0141504, filed on Oct. 22, 2021 the disclosure of which is incorporated herein by reference in its entirety. BACKGROUND 1. Field of the Invention The present disclosure relates to a holistic student assessment framework based on multi-task learning using deep learning. 2. Discussion of Related Art In the field of education services, accurately estimating a user's knowledge level has a great influence on applications. The most common approach for providing such an assessment is through knowledge tracing (KT) which provides a binary classification of accuracy on questions for a specific user. However, binarized information on accuracy often ignores information that may be provided by reasoning behind an answer. For example, in a multiple-choice question (MCQ) (e.g., a task known as option tracing (OT)), the reason for choosing a particular option as an answer may provide more information than a simple KT model. The present disclosure proposes a simple and novel methodology for capturing the information inherent in correct answer accuracy and option selection in a multi-task learning framework. SUMMARY OF THE INVENTION The present disclosure is directed to a framework for implementing score prediction (SP) that predicts a student's score in proportion to knowledge tracing (KT), choice tracing (CT), and 0 values that calculate whether students are most likely to answer which choice for a given question and whether an answer is correct or incorrect. In addition, the present disclosure is directed to a method of improving various educational applications including identifying students' vulnerabilities and recommending customized questions through generalizability of a student assessment framework. The technical objects to be achieved by the present disclosure are not limited to the technical objects described above, and other technical objects that are not described may be clearly understood by those with ordinary knowledge in the technical field to which the present disclosure belongs from the following description. According to an aspect of the present invention, there is provided a method of predicting a user's score on a question by an electronic device, including: training a DP-multi tasking learning (DP-MTL) model; verifying the DP-MTL model; receiving choice selection information related to the question from the user through a terminal; and predicting 1) a probability that the user answers the question correctly and 2) the user's score related to the question using the verified DP-MTL model based on the choice selection information, in which the DP-MTL model may be a model for predicting the user's score based on 1) information on whether the user answers the question correctly, 2) information on which incorrect answer is selected among choices of the question when the user selects an incorrect answer, and 3) a skill level of the user. The training of the DP-MTL model may be based on the following Equation: the u may denote a parameter indicating the user, the θ may denote a parameter indicating the skill level of the user, and the ai may denote an item parameter constituting an i-th question. In the training of the DP-MTL model, the ai and the θ may be calculated to minimize the (LDP(θu, ai)). In the verifying of the DP-MTL model, the λ may be verified to minimize the (LDP(θu, ai)). According to another aspect of the present invention, there is provided an electronic device for predicting a user's score on a question, including: a communication module configured to communicate with a terminal; a memory; and a processor, in which the processor may train a DP-multi tasking learning (DP-MTL) model, verify the DP-MTL model, receives choice selection information related to the question from the user through the terminal, and predict 1) a probability that the user answers the question correctly and 2) the user's score related to the question using the verified DP-MTL model based on the choice selection information, and the DP-MTL model may be a model for predicting the user's score based on 1) information on whether the user answers the question correctly, 2) information on which incorrect answer is selected among choices of the question when the user selects an incorrect answer, and 3) a skill level of the user. BRIEF DESCRIPTION OF THE DRAWINGS The above and other objects, features and advantages of the present invention will become more apparent to those of ordinary skill in the art by describing exemplary embodiments thereof in detail with reference to the accompanying drawings, in which: FIG. 1 is a block diagram for describing an electronic device related to the present disclosure; FIG. 2 is a block diagram of an artificial intelligence (AI) device according to an embodiment of the present disclosure; FIG. 3 is an example of a pipeline for an experiment of a DP-multi tasking learning (DP-MTL) model to which the present disclosure may be applied; and FIG. 4 is an embodiment of an electronic device to which the present disclosure may be applied. The accompanying drawings, which are included as part of the detailed description to help understanding of the present disclosure, provide embodiments of the present disclosure, and explain technical features of the present disclosure together with the detailed description. DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS Hereinafter, exemplary embodiments of the present disclosure will be described in detail with reference to the accompanying drawings. The same or similar components will be denoted by the same reference numerals regardless of the drawing numerals, and an overlapping description for the same or similar components will be omitted. In addition, terms “module” and “unit” for components used in the following description are used only to easily write the disclosure. Therefore, these terms do not have distinct meanings or roles by themselves. In addition, in describing the embodiment disclosed in the present disclosure, if it is determined that a detailed description of the related known art may obscure the gist of the embodiment disclosed in the present disclosure, the detailed description thereof will be omitted. Further, it should be understood that the accompanying drawings are provided only in order to allow exemplary embodiments of the present disclosure to be easily understood, and the spirit of the present disclosure is not limited by the accompanying drawings, but includes all the modifications, equivalents, and substitutions included in the spirit and the scope of the present disclosure. Terms including ordinal numbers such as “first,” “second,”, and the like, may be used to describe various components. However, these components are not limited by these terms. The terms are used only to distinguish one component from another component. It is to be understood that when one element is referred to as being “connected to” or “coupled to” another element, it may be directly connected or coupled to another element or connected or coupled to another element with still another element intervening therebetween. On the other hand, it should be understood that when one element is referred to as being “directly connected to” or “directly coupled to” another element, it may be connected or coupled to another element without other elements interposed therebetween. Singular forms are intended to include plural forms unless the context clearly indicates otherwise. It will be further understood that terms “include” or “have” used in the present specification specify the presence of features, numerals, steps, operations, components, parts mentioned in the present specification, or combinations thereof, but do not preclude the presence or addition of one or more other features, numerals, steps, operations, components, parts, or combinations thereof. FIG. 1 is a block diagram for describing an electronic device related to the present disclosure. An electronic device 100 includes a wireless communication unit 110, an input unit 120, a sensing unit 140, an output unit 150, an interface unit 160, a memory 170, a control unit 180, and a power supply unit 190, and the like. The components illustrated in FIG. 1 are not essential for implementing an electronic device, and the electronic devices described herein may have more or fewer components than those listed above. More specifically, the wireless communication unit 110 of the components may include one or more modules which allow wireless communication between the electronic device 100 and a wireless communication system, between the electronic device 100 and other electronic devices 100, or the electronic device 100 and an external server. In addition, the wireless communication unit 110 may include one or more modules which connect the electronic device 100 to one or more networks. The wireless communication unit 110 may include at least one of a broadcast receiving module 111, a mobile communication module 112, a wireless Internet module 113, a short range communication module 114, and a location information module 115. The input unit 120 may include a camera 121 or an image input unit for inputting an image signal, a microphone 122 for inputting a sound signal, an audio input unit, or a user input unit 123 (for example, a touch key, a push key, and the like) for receiving information from a user. Voice data or image data collected by the input unit 120 may be analyzed and processed by a control command of a user. The sensing unit 140 may include one or more sensors for detecting at least one of information in the electronic device, surrounding environment information surrounding the electronic device, and user information. For example, the sensing unit 140 may include at least one of a proximity sensor 141, an illumination sensor 142, a touch sensor, an acceleration sensor, a magnetic sensor, a G-sensor, a gyroscope sensor, a motion sensor, an RGB sensor, an infrared sensor (IR sensor), a fingerprint sensor, an ultrasonic sensor, an optical sensor (e.g., see a camera 121), a microphone (see 122), a battery gauge, an environmental sensor (e.g., it may include at least one of a barometer, a hygrometer, a thermometer, a radiation detection sensor, a thermal detection sensor, a gas detection sensor, etc.), and a chemical sensor (e.g., an electronic nose, a healthcare sensor, a biometric sensor, etc.). Meanwhile, the electronic device disclosed in the present disclosure may use a combination of pieces of information detected by at least two or more of these sensors. The output unit 150 is used to generate an output related to sight, hearing, tactile sense, or the like, and may include at least one of a display unit 151, a sound output unit 152, a haptic module 153, and an optical output unit 154. The display unit 151 forms a mutual layer structure with or is integrally formed with the touch sensor, thereby implementing a touch screen. The touch screen may function as the user input unit 123 which provides an input interface between the electronic device 100 and the user, and may provide an output interface between the electronic device 100 and the user. The interface unit 160 serves as a path of various types of external devices connected to the electronic device 100. The interface unit 160 may include at least one of a wired/wireless headset port, an external charger port, a wired/wireless data port, a memory card port, a port for connection of a device including an identity module, an audio input/output (I/O) port, a video input/output (I/O) port, and an earphone port. In the electronic device 100, appropriate control related to the connected external device may be performed in response to the connection of the external device to the interface unit 160. In addition, the memory 170 stores data for supporting various functions of the electronic device 100. The memory 170 may store a plurality of application programs or applications that are run by the electronic device 100, and data and instructions for operating the electronic device 100. At least some of these application programs may be downloaded from the external server via wireless communication. In addition, at least some of these application programs may be present on the electronic device 100 from the time of shipment for basic functions (for example, an incoming and outgoing call function, and a message reception and transmission function) of the electronic device 100. Meanwhile, the application program may be stored in the memory 170, installed on the electronic device 100, and run by the control unit 180 to perform the operation (or function) of the electronic device. In addition to the operation related to the application program, the control unit 180 typically controls the overall operation of the electronic device 100. The control unit 180 may provide or process appropriate information or a function for a user by processing signals, data, information, and the like, which are input or output through the above-described components, or by running an application program stored in the memory 170. In addition, the control unit 180 may control at least some of the components described with reference to FIG. 1 to run the application program stored in the memory 170. In addition, the control unit 180 may operate at least two or more of the components included in the electronic device 100 in combination with each other to run the application program. The power supply unit 190 receives power from an external power source and an internal power source under the control of the control unit 180 and supplies the received power to each component included in the electronic device 100. The power supply unit 190 includes a battery which may be a built-in battery or a replaceable battery. At least some of the components may cooperatively operate in order to implement the operation, control, or control method of the electronic device according to various embodiments described below. In addition, the operation, control, or control method of the electronic device may be implemented on the electronic device by running at least one application program stored in the memory 170. In the present disclosure, the electronic device 100 may be collectively referred to as an electronic device. FIG. 2 is a block diagram of an artificial intelligence (AI) device according to an embodiment of the present disclosure. The AI device 20 may include an electronic device including an AI module capable of performing AI processing, a server including the AI module, or the like. In addition, the AI device 20 may be included as at least a part of the electronic device 100 illustrated in FIG. 1 and may be provided to be performed in conjunction with at least some components of the electronic device 100 during AI processing. The AI device 20 may include an AI processor 21, a memory 25, and/or a communication unit 27. The AI device 20 is a computing device capable of learning neural networks, and may be implemented in various electronic devices such as a server, a desktop personal computer (PC), a notebook PC, and a tablet PC. The AI processor 21 may learn the AI model using a program stored in the memory 25. In particular, the AI processor 21 may learn the AI model in order to provide an education service to a user. Such an AI model may include a DP-multi tasking learning (DP-MTL) model to be described later. For example, the DP-MTL may be a multi-task learning framework that assesses a student as a whole through three main tasks (e.g., knowledge tracing (KT), option tracing (OT), and score prediction (SP)). For example, KT may model a student's knowledge state to track each individual's master state improvement in a domain under test. Before deep learning became popular, as a statistical model, item response theory (IRT) (Gonz'alez-Brenes, Huang, and Brusilovsky 2014; Khajah et al. 2014; Yudelson, Koedinger, and Gordon 2013; Pel'anek 2017; Gervet et al. 2020) and Bayesian knowledge tracing (BKT) were used to assess students' mastery of knowledge elements. However, with the development of machine learning and deep learning, a time series-based approach to KT has been presented (Piech et al. 2015; Zhang et al. 2017; Choi et al. 2020). OT is a task of predicting an option that students with a particular skill level are more likely to choose. Several IRT studies based on OT (polytonomous IRT) have handled ordered categorical responses carried out through psychometric tests in areas of social sciences such as psychiatry and adult attachment (Bacci, Bartolucci and Gnaldi 2014, Faley, Waller, and Brennan 2000). Student SP is also an important task in the field of AI education (Loh, Chae and Hwang 2020; Iqbal et al. 2017; Sweeney, Lester, and Langwala 2015). Common methodologies used for SP include matrix factorization (Elbadrawy and Karypis 2016; Sweeney et al. 2016) and a regression model (Morsy and Karypis 2017; Ren et al. 2019). Some studies use a KT algorithm to predict a student score as a downstream task (Liu et al. 2019). Meanwhile, the AI processor 21 for performing the functions as described above may be a general purpose processor (for example, a central processing unit (CPU)), but may be an AI dedicated processor (for example, a graphics processing unit (GPU)) for AI learning. The memory 25 may store various programs and data required for operation of the AI device 20. The memory 25 may be implemented by a non-volatile memory, a volatile memory, a flash memory, a hard disc drive (HDD), a solid state drive (SSD), or the like. The memory 25 is accessed by the AI processor 21, and readout/recording/correction/deletion/update, and the like, of data in the memory 25 may be performed by the AI processor 21. In addition, the memory 25 may store a neural network model (e.g., a deep learning model) generated through a learning algorithm for data classification/recognition according to an embodiment of the present disclosure. Meanwhile, the AI processor 21 may include a data learning unit which learns a neural network for data classification/recognition. For example, the data learning unit acquires learning data to be used for learning, and applies the obtained learning data to the deep learning model, thereby making it possible to train the deep learning model. The communication unit 27 may transmit the AI processing result by the AI processor 21 to an external electronic device. Here, the external electronic device may include other terminals and servers. Meanwhile, although the AI device 20 illustrated in FIG. 2 has been described as functionally divided into the AI processor 21, the memory 25, the communication unit 27, and the like, the above-described components may be integrated into one module and called an AI module. Typically within the edutech marketplace or the in-house technology stack, IRT is used to calculate the probability that a student will answer a question correctly. The IRT is a model that calculates the probability that a student will answer a specific question correctly using variables such as the difficulty of the question. However, the existing IRT predicts the variables and calculates the probability based only on whether the student answered the question correctly. That is, the calculation is performed only with data on whether or not the student answered the question correctly. Therefore, although it is possible to obtain data on which incorrect answer the student selected, there is a problem in that the data is not used properly. For example, assume that a certain question has choices A, B, C, D, and E. When A is a correct answer, B is an incorrect answer similar to the correct answer, and C, D, and E are completely incorrect answers, the existing IRT (e.g., D-IRT) treats students who choose B and students who choose C, D, and E equally, but in fact, the existing IRT model may not take into account that students who choose B may have higher skills than those who choose C, D, and E. To solve this problem, the present disclosure proposes a DP-MTL model that adds the polytonomous IRT (P-IRT) to the existing IRT. The P-IRT is a model that predicts which choice a student will choose, and is a model that predicts which choice a student will most likely choose, rather than predicting the student's answer with a simple correct answer. However, the P-IRT only considers the probability of students choosing a certain option, but does not consider whether the question is answered correctly. To solve this, the DP-MTL model may be configured by combining the IRT (e.g., D-IRT) and the P-IRT. In addition, in order to predict additional potential student skill, the multi-dimensional IRT that may be understood more specifically by vectorizing each student's conceptual understanding may be added. The existing IRT (e.g., D-IRT) model may be calculated, for example, as in Equation 1 below. Referring to Equation 1, pi denotes a probability that a student will answer an i-option (index) question, θ denotes a student's skill (e.g., indicating a student's ability) parameter to solve the question, and ai denotes an item for an i-option question (discriminatory) parameter, and bi denotes a difficulty parameter for the i option question. ci denotes a pseudo guessing parameter for the i-option question. The parameters may be obtained through a gradient descent algorithm or a known algorithm having a similar purpose. Unlike the existing IRT model, the DP-MTL model is a model that predicts a student's answer by calculating 1) a correct answer, 2) which wrong answer was chosen, and 3) a student's potential skill level. The DP-MTL may be composed of a combined version of dichotomous option correctness (D) and polytonomous option choice (P) with a ratio of λ:1−λ where 0≤λ≤1. 1. Dichotomous Option Correctness(D) A traditional dichotomous model may be trained by minimizing negative log likelihood for observations of interactions that include pairs corresponding to users, questions, and correct answers. This is equivalent to maximizing a conditional probability of a user corresponding to a correct/incorrect answer of an item based on a student's interaction data. Equation 2 below is an example of a method for training the dichotomous model. Here, LD denotes a negative log likelihood, which may be minimized. In addition, u denotes a student index, θu denotes a skill parameter of student u, ai denotes the overall item parameter (for example, it may include ai in Equation 1) constituting the i-option (index) question, xi,u denotes a binary variable that determines whether student u answered the i-option question correctly. 2. Polytonomous Option Choice(P) The polytonomous model may be trained by minimizing the negative log likelihood (LP(θu, ai)). Equation 3 is an example of a method for training a polytonomous model. For example, the polytonomous model may consider a characteristic of a question with more than one choice. Referring to Equation 3, may be calculated by Equation 4 below. Referring to Equation 4, 0 denotes a student's skill parameter, ao denotes an item parameter for question option (index) o, and bo denotes a difficulty parameter for option o. j may denote the total number of options. Also, referring to Equation 2 again, P(1−xi,u|θu,ai) may be replaced by Σo u,j ≠o i *P(ou,j|θu,ai) which is the sum of the probabilities that a student chooses an incorrect value. Therefore, LD in Equation 2 may be calculated again by Equation 5 below. 3. DP-MTL In the present disclosure, based on Equations 3 and 5, a learning object of the DP-MTL model may be defined as Equation 6 below. λLD+(1−λ)LP  [Equation 6] Accordingly, referring to Equation 7 below, an objective function of the DP-MTL model may be derived by combining two objective functions. FIG. 3 is an example of a pipeline for an experiment of the DP-multi tasking learning (DP-MTL) model to which the present disclosure may be applied. Unlike the existing IRT model, the DP-MTL model is a model that predicts a student's score by calculating whether a student answers a question correctly, and when a student chooses an incorrect answer, which incorrect answer the student chooses from the choices, and the student's potential skill level. Referring to FIG. 3 , the DP-MTL model may be trained through a training dataset. The training dataset and the test dataset may include masked data about which choice is chosen for each question (Q) for each user in order to validate whether training and learning have been performed properly. The DP-MTL model may be trained through Equation 7 above by receiving data on whether the user selects a correct answer to a question or which incorrect answer the user has chosen when the user chooses an incorrect answer. Referring to (i), the DP-MTL model may measure the skill parameter θ of the user and the item parameter a of the question. (ii) The skill parameter θ of the user may be used as a user representation for a downstream SP task. (iii) The performance of the SP task may be measured for each user in a test split as an assessment metric for the quality of user representation. (i) and (ii) may denote a KT/OT pipeline, and (iii) may denote an SP pipeline. FIG. 4 is an embodiment of an electronic device to which the present disclosure may be applied. Referring to FIG. 4 , the electronic device includes a communication module for communication with the terminal, a memory, and a processor, and may train the DP-MTL model through a program stored in the memory. The electronic device trains a DP-multi tasking learning (DP-MTL) model (S410). For example, the DP-MTL model may be a model that predicts a user's score based on 1) information on whether a user answers a question correctly, 2) when the user chooses an incorrect answer, information on which incorrect answer the user chooses, and 3) a user's potential skill level. In more detail, the electronic device may input the training dataset to the DP-MTL model, and calculate a and θ parameters for minimizing (LDP(θu, ai)) based on Equation 7. The electronic device may use the calculated a and θ parameters to learn both information on whether a user chooses a correct answer (knowledge tracing (KT)) and which choice the user exactly chooses (choice tracing (CT)) by the DP-MTL. The electronic device verifies the DP-MTL model (S420). For example, the electronic device may verify the training dataset. In more detail, the electronic device may train the DP-MTL model while reducing the size of the training dataset (e.g., 30%, 20%, 10% . . . ), and use a dataset with a small DP-MTL model to verify how effectively KT, CT, and SP progress. In addition, the electronic device may perform verification on λ to minimize the (LDP(θu, ai)). The electronic device receives the choice selection information related to a question from the user through the terminal (S430). For example, the choice selection information may include information on which choice a user chooses for each question. The terminal may provide a question to a user, and may receive choices for the question from the user. The electronic device uses the verified DP-MTL model based on the choice selection information to predict 1) the probability that a user answers a question correctly and 2) the score related to the user's question (S440). The present disclosure described above enables the program to be embodied as computer readable code on a medium on which the program is recorded. A computer readable medium may include all kinds of recording devices in which data that may be read by a computer system is stored. An example of the computer readable medium may include a HDD, an SSD, a silicon disk drive (SDD), a read only memory (ROM), a random access memory (RAM), a compact disc-read only memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage, and the like, and also include a medium implemented in the form of a carrier wave (for example, transmission through the Internet). Therefore, the above-mentioned detailed description is to be interpreted as being illustrative rather than being restrictive in all aspects. The scope of the present disclosure should be determined by reasonable interpretation of the appended claims, and all changes within the equivalent scope of the present disclosure are included in the scope of the present disclosure. According to an embodiment of the present disclosure, it is possible to implement SP for predicting a student's score in proportion to KT, CT, and θ values that calculate whether students are most likely to answer which choice for a given question and whether an answer is correct or incorrect. In addition, according to an embodiment of the present disclosure, generalizability of a student assessment framework can improve a variety of educational applications including identifying students' vulnerabilities and recommending customized questions. Effects which can be achieved by the present disclosure are not limited to the above-described effects. That is, other effects that are not described may be obviously understood by those skilled in the art to which the present disclosure pertains from the above detailed description. In addition, although the services and embodiments have been mainly described hereinabove, this is only an example and does not limit the present disclosure. Those skilled in the art to which the present disclosure pertains may understand that several modifications and applications that are not described in the present specification may be made without departing from the spirit of the present disclosure. For example, each component described in detail in an exemplary embodiment of the present invention may be modified. In addition, differences associated with these modifications and applications are to be interpreted as being included in the scope of the present disclosure as defined by the following claims. What is claimed is: 1. A method of predicting a user's score on a question by an electronic device, the method comprising: training a DP-multi tasking learning (DP-MTL) model; verifying the DP-MTL model; receiving choice selection information related to the question from the user through a terminal; and predicting 1) a probability that the user answers the question correctly and 2) the user's score related to the question using the verified DP-MTL model based on the choice selection information, wherein the DP-MTL model is a model for predicting the user's score based on 1) information on whether the user answers the question correctly, 2) information on which incorrect answer is selected among choices of the question when the user selects an incorrect answer, and 3) a skill level of the user. 2. The method of claim 1, wherein the training of the DP-MTL model is based on the following Equation: the u denotes a parameter indicating the user, the θ denotes a parameter indicating the skill level of the user, and the ai denotes an item parameter constituting an i-th question. 3. The method of claim 2, wherein, in the training of the DP-MTL model, the ai and the θ are calculated to minimize the (LDP(θu, ai)). 4. The method of claim 2, wherein, in the verifying of the DP-MTL model, the λ is verified to minimize the (LDP(θu, ai)). 5. An electronic device for predicting a user's score on a question, the electronic device comprising: a communication module configured to communicate with a terminal; a memory; and a processor, wherein the processor trains a DP-multi tasking learning (DP-MTL) model, verifies the DP-MTL model, receives choice selection information related to the question from the user through the terminal, and predicts 1) a probability that the user answers the question correctly and 2) the user's score related to the question using the verified DP-MTL model based on the choice selection information, and the DP-MTL model is a model for predicting the user's score based on 1) information on whether the user answers the question correctly, 2) information on which incorrect answer is selected among choices of the question when the user selects an incorrect answer, and 3) a skill level of the user. 6. The electronic device of claim 5, wherein the processor trains the DP-MTL model based on the following Equation: the u denotes a parameter indicating the user, the θ denotes a parameter indicating the skill level of the user, and the ai denotes an item parameter constituting an i-th question. 7. The electronic device of claim 6, wherein the processor calculates the ai and the θ to minimize the (LDP(θu, ai)) and trains the DP-MTL model. 8. The electronic device of claim 6, wherein the processor verifies the λ to minimize (LDP(θu, ai)) in order to verify the DP-MTL model.

2022-10-07

en

2023-04-13

US-37673207-A

Biodegradable resin composition and molded article of the same ABSTRACT An object of the invention is to provide a resin composition which is particularly excellent in impact resistance, tensile elongation characteristics, heat resistance, surface properties, moldability and the like accompanied by less time dependent alteration of these properties and which is produced by mixing a certain plasticizer with a biodegradable polymer of plant origin, and to provide a molded product of the composition. The present invention can provide a resin composition comprising a biodegradable 3-hydroxyalkanoate copolymer (A) and a plasticizer (B), wherein: the biodegradable 3-hydroxyalkanoate copolymer (A) has a recurring unit represented by the structure formula (1): [—CHR—CH 2 —CO—O—] (wherein, R represents an alkyl group represented by C n H 2n+1 ; and n is an integer of 1 to 15); the plasticizer (B) is based upon a polyglycerol acetic acid ester having an acetylation degree of no less than 50% ester. TECHNICAL FIELD The present invention relates to a composition including a polymer which is biodegradable and of plant origin, and a molded product of the same. More particularly, the present invention relates to a resin composition which includes a certain plasticizer and a biodegradable aliphatic polyester-based resin, particularly a biodegradable 3-hydroxyalkanoate copolymer, and to a molded product of the same. Preferably, the invention relates to a resin composition which includes a certain plasticizer and a biodegradable aliphatic polyester-based resin, particularly a 3-hydroxyalkanoate copolymer, and poly 3-hydroxyalkanoate having a melting temperature higher than that of the copolymer, and to a molded product of the same. BACKGROUND ART Conventionally, plastics have characteristics such as processibility and usability, whereas, they have been thrown away after use owing to their difficulty in recycling, and to hygienic point of view. However, as the use and disposal of the plastics increase, problems associated with their disposal by landfilling or incineration have drawn attention, and they may be responsible for great burden on the global environment such as deficiency of garbage landfill sites, influences on ecological system by remaining nondegradable plastics in the environment, generation of detrimental gas in combustion, global warming resulting from a large amount of combustion calorie, and the like. In recent years, biodegradable plastics have been extensively developed as a material which can solve the problems of the plastic waste. Additionally, these biodegradable plastics are of plant origin, and absorb and immobilize carbon dioxide that is present in the air. Carbon dioxide generated in combustion of these biodegradable plastics of plant origin was originally present in the air, therefore increase in carbon dioxide in the ambient air is not caused. This phenomenon is referred to as “carbon neutrality”, which tends to have been placed importance thereon. Carbon dioxide immobilization is expected to be effective in preventing the global warming. Particularly, in connection with Kyoto Protocol in which achievement level of carbon dioxide reduction was suggested, deliberation of Congress for ratification was approved in Russia in August 2003. Accordingly, it is highly probable that the Protocol will come into effect actually, whereby materials for carbon dioxide immobilization have drawn a great deal of attention, and active use thereof has been desired. Meanwhile, although aromatic polyesters have been produced and consumed in large quantities as general-purpose polymers, in light of immobilization of carbon dioxide and prevention of global warming, they are not preferable material in terms of the carbon neutrality, because they are produced from fossil fuels, thereby leading to release of carbon dioxide immobilized in the ground to the ambient air. In light of the biodegradability and carbon neutrality, aliphatic polyester-based resins have drawn attention as the plastics of plant origin, particularly polylactic acid-based resins, poly 3-hydroxyalkanoate (hereinafter, may be referred to as “PHA”), further poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] (hereinafter, may be referred to as “PHBH”), and the like have been drawing attention. Among them, poly[3-hydroxybutyrate-co-3-hydroxyhexanoate], in particular, has superior heat resistance owing to the crystallinity, and impact resistance, superior tensile elongation characteristics and flexibility resulting from 3-hydroxyhexanoate included as a copolymerization component, in combination. Therefore, they have drawn attention as a resin material accompanied by the balance of physical properties. However, with respect to PHA, further greater impact resistance, tensile elongation characteristics, and moldability have been demanded, and improvement for time dependent alteration at room temperatures has been also demanded. In this respect, improvement by adding a certain plasticizer was proposed (Patent Documents 1 to 3). However, bleed out properties, and volatility are not sufficiently improved by them, and polylactic acid is predominantly used as a biodegradable polymer. Moreover, any effect of improving the time dependent alteration is not referred to at all. Furthermore, in order to improve the molding processibility of PHA, addition of another PHA having a higher melting temperature as a nucleating agent to PHA as a matrix was proposed (Patent Document 4), but significant time dependent alteration of physical properties was caused, and also a low level of tensile elongation characteristics was observed. Patent Document 1: Japanese Examined Patent Application, Publication No. H07-68443 Patent Document 2: Japanese Unexamined Patent Application, Published Japanese Translation of a PCT Application No. 2005-501927 Patent Document 3: Japanese Unexamined Patent Application, Publication No. 2002-80703 Patent Document 4: Japanese Unexamined Patent Application, Published Japanese Translation of a PCT Application No. H08-510498 DISCLOSURE OF THE INVENTION Problems to be Solved by the Invention The present invention solves the aforementioned problems, and an object of the invention is to provide a resin composition which is particularly excellent in impact resistance, tensile elongation characteristics, heat resistance, surface properties (bleed characteristics), moldability and the like accompanied by less time dependent alteration of these properties and which is produced using a polymer of plant origin obtained by actively immobilizing carbon dioxide that is present around the earth, and to provide a molded product of the composition. Means for Solving the Problems The present inventors elaborately investigated in order to solve the aforementioned problems, and consequently found that a resin composition which is excellent in impact resistance, tensile elongation characteristics, heat resistance, surface properties, moldability and the like accompanied by less time dependent alteration of these properties, and a molded product of the same can be obtained by mixing a certain plasticizer with a 3-hydroxyalkanoate copolymer that is a polymer of plant origin which is biodegradable and is obtained by actively immobilizing carbon dioxide around the earth at a given ratio. Accordingly, the present invention was accomplished. Specifically, a first aspect of the present invention provides a resin composition including 100 parts by weight of (A) a biodegradable 3-hydroxyalkanoate copolymer having a recurring unit represented by the structural formula (1): [—CHR—CH2—CO—O—] (wherein, R represents an alkyl group represented by CnH2n+1; and n is an integer of 1 to 15), and 0.1 to 50 parts by weight of (B) a plasticizer which is constituted with 100 to 50% by weight of a polyglycerol acetic acid ester having an acetylation degree of no less than 50%, and 0 to 50% by weight of a monoglycerol ester. In this aspect of the invention, it is preferred that: (C) a biodegradable poly 3-hydroxyalkanoate having a melting temperature Tm2 higher than the melting temperature Tm1 of the copolymer (A) is further included; the melting temperature Tm2 of the biodegradable poly 3-hydroxyalkanoate (C) satisfies the relational expression of Tm2≧Tm1+5° C.; and the resin composition contains 0.1 to 30 parts by weight of the biodegradable poly 3-hydroxyalkanoate (C) based on 100 parts by weight of the copolymer (A). In addition, the copolymer (A) preferably includes poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] having a recurring unit of 3-hydroxybutyrate and a recurring unit of 3-hydroxyhexanoate as a principal component, and more preferably the copolymer (A) is poly[3-hydroxybutyrate-co-3-hydroxyhexanoate]. Moreover, it is preferred that the copolymer (A) has a molecular weight of 300,000 to 3,000,000 in terms of the weight average molecular weight. Furthermore, in connection with the component ratio of the recurring units of poly[3-hydroxybutyrate-co-3-hydroxyhexanoate], the component ratio of 3-hydroxybutyrate unit/3-hydroxyhexanoate unit is preferably 99/1 to 80/20 (mol/mol). Additionally, the polyglycerol acetic acid ester having an acetylation degree of no less than 50% is preferably at least one selected from the group consisting of a diglycerol acetic acid ester and a triglycerol acetic acid ester having an acetylation degree of no less than 50%. Further, it is preferred that the monoglycerol ester be diacetylmonoacylglycerol with a constitutive fatty acid having no less than 8 carbon atoms. Moreover, the biodegradable poly 3-hydroxyalkanoate (C) includes the 3-hydroxybutyrate unit in an amount of preferably no less than 90% by mole, and more preferably, the biodegradable poly 3-hydroxyalkanoate (C) is poly 3-hydroxybutyrate. Hereinafter, the present invention will be explained in detail. As the biodegradable polymer in the present invention, the (3-hydroxyalkanoate) copolymer (A) having a recurring unit represented by the formula (1): [—CHR—CH2—CO—O—] (wherein, R represents an alkyl group represented by CnH2n+1; and n is an integer of 1 to 15) may be used in light of degradable properties under anaerobic conditions and excellent moisture resistance, and possibility of increase in the molecular weight. Typical examples of the biodegradable 3-hydroxyalkanoate copolymer (A) in the present invention include e.g., poly[3-hydroxybutyrate-co-3-hydroxyvaleate], poly[3-hydroxybutyrate-co-3-hydroxyhexanoate], poly[3-hydroxybutyrate-co-3-hydroxyoctanoate], poly[3-hydroxybutyrate-co-3-hydroxydecanoate], and the like. Among these, poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] is preferably included as a principal component. The phrase “including poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] as a principal component” referred to herein means that poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] accounts for no less than 70% in the copolymer (A). The copolymer (A) including poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] at the rate of no less than 90% is more preferred. Further preferably, the copolymer (A) includes poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] alone, and is a copolymer produced by a microorganism. Examples of the microorganism described above include e.g., Alcaligenes eutrophus AC32 strain (International Deposition with international depositary authority under the Budapest Treaty: National Institute of Advanced Industrial Science and Technology, International Patent Organism Depositary (Tsukuba Central 6, 1-1-1 Higashi, Tsukuba, Ibaraki, Japan), original deposition date: Aug. 12, 1996, transferred on Aug. 7, 1997, Deposition No. FERM BP-6038, transferred from original Deposition FERM P-15786, (J. Bacteriol., 179, 4821 (1997)), which had been prepared by introducing a PHA synthase gene derived from Aeromonas caviae into Alcaligenes eutrophus, and the like. The biodegradable poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] herein refers to a name which is employed as a generic name of a copolymer having a recurring unit of 3-hydroxybutyrate and a recurring unit of 3-hydroxyhexanoate as principal components. The copolymer may also include the other monomer component as described above as long as 3-hydroxybutyrate and 3-hydroxyhexanoate are included as principal components. Further, the polymerization process for obtaining the aforementioned copolymer is not particularly limited, and any copolymerization process such as random copolymerization, alternating copolymerization, block copolymerization or the like may be applied. The constituent ratio of the recurring units in the biodegradable poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] in the present invention is preferably 99/1 to 80/20 (mol/mol), more preferably 98/2 to 82/18 (mol/mol), and still more preferably 97/3 to 85/15 (mol/mol) in terms of 3-hydroxybutyrate unit/3-hydroxyhexanoate unit. The constituting ratio of the recurring units of poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] may be abbreviated as HH rate. The weight average molecular weight (Mw) of the biodegradable 3-hydroxyalkanoate copolymer (A) of the present invention is preferably 300,000 to 3,000,000, more preferably 400,000 to 2,500,000, and still more preferably 500,000 to 2,000,000 in light of the impact resistance and tensile elongation characteristics. When the weight average molecular weight of the copolymer (A) is less than 300,000, mechanical characteristics may be inferior, while when the weight average molecular weight exceeds 3,000,000, the processing may be difficult. The method of measuring the weight average molecular weight of the biodegradable 3-hydroxyalkanoate copolymer (A) is not particularly limited, but herein the molecular weight can be determined in terms of the polystyrene equivalent measured with a GPC system manufactured by Waters Corporation equipped with a column Shodex K-804 (polystyrene gel) manufactured by Showa Denko K. K., using chloroform as a mobile phase. The plasticizer (B) used in the present invention is a plasticizer that includes 100 to 50% by weight of a polyglycerol acetic acid ester having an acetylation degree of no less than 50%, and 0 to 50% by weight of a monoglycerol ester. By including the plasticizer (B) containing a polyglycerol acetic acid ester having an acetylation degree of no less than 50% as a principal component into the resin composition of the present invention, bleed out of the plasticizer is minimized, and a resin composition accompanied by less generation of the volatile component can be obtained since the polyglycerol acetic acid ester having an acetylation degree of no less than 50% is particularly excellent in compatibility with the copolymer (A). As a simple method for producing the polyglycerol acetic acid ester having an acetylation degree of no less than 50% used in the present invention, generally, a method in which polyglycerol is reacted with acetic anhydride to permit acetylation, and then acetic acid yielded as a by-product is eliminated may be exemplified, but not particularly limited thereto. In the polyglycerol acetic acid ester having an acetylation degree of no less than 50% used in the present invention, the number n of recurrence of the glycerol units in polyglycerol is preferably 2 to 5, and more preferably 2. In the case of the diglycerol acetic acid ester in which the number n of recurrence of the glycerol units is 2, examples of those having an acetylation degree of no less than 50% include simple forms of the diester, triester or tetraester, and mixtures thereof. In light of compatibility with the copolymer (A), and the like, simple forms of the diester and triester, or mixtures thereof are preferred. The acetylation degree referred to in the present invention means a degree of esterification of acetic acid with respect to the hydroxyl group of polyglycerol, and is derived from the following formula (1): (acetylation degree)=(ester value)/(ester value+hydroxyl value)×100   (1) wherein, (ester value)=(saponification value)−(acid value). The acetylation degree in the polyglycerol acetic acid ester is preferably no less than 70%, and more preferably no less than 90% in light of the compatibility. Furthermore, in the monoglycerol ester used in the present invention, the number of carbon atoms of the fatty acid used in esterification may be selected based on the balance between compatibility and volatility. However, since the compatibility is complemented by the polyglycerol acetic acid ester in an aspect of the present invention in which the monoglycerol ester is used in combination with the polyglycerol acetic acid ester, diacetylmonoacylglycerol including a fatty acid having 8 or more carbon atoms as a constitutive fatty acid is preferred in favor of low volatility. Among the fatty acids having 8 or more carbon atoms, caprylic acid, capric acid, lauric acid, oleic acid, erucic acid and the like are preferred taking into account the compatibility, and in particular, caprylic acid, capric acid and lauric acid which are saturated fatty acids are more preferred taking into consideration the oxidation stability. The aforementioned number of carbon atoms is preferably equal to or less than 28 in light of the compatibility (fatty acid having 28 carbon atoms: montanic acid). It should be noted that diacetylmonoacylglycerol may be obtained by any of the processes involving (i) esterification reaction of monoglycerol with fatty acid, (ii) reaction of acetic anhydride with a distilled monoglyceride or a reactive monoglyceride obtained by a known process such as an interesterification reaction of glycerol with a triglyceride such as a fat (fatty oil) or a fatty acid alkyl ester, (iii) interesterification of triglyceride with triacetin, and the like, but the method is not particularly limited thereto. With respect to the mixing proportion of the polyglycerol acetic acid ester having an acetylation degree of no less than 50% and the monoglycerol ester in the plasticizer (B) used in the present invention, in light of the effect achieved by mixing, and suppression of bleed out, 100 to 50% by weight of the polyglycerol acetic acid ester having an acetylation degree of no less than 50%, and 0 to 50% by weight of the monoglycerol ester are mixed; 100 to 80% by weight of the polyglycerol acetic acid ester having an acetylation degree of no less than 50%, and 0 to 20% by weight of the monoglycerol ester are preferably mixed; and 100% by weight of the polyglycerol acetic acid ester having an acetylation degree of no less than 50% is more preferably used. To use the polyglycerol acetic acid ester having an acetylation degree of no less than 50% alone is preferred for achieving the effects such as improvement of time dependent alteration and the like; however, since a monoglycerol ester may be produced and contaminated in some cases depending on the synthetic method, their mixture of both components as they are included may be used. The amount of the blended plasticizer (B) in the present invention is 0.1 to 50 parts by weight, preferably 0.1 to 30 parts by weight, and more preferably 0.1 to 20 parts by weight based on 100 parts by weight of the biodegradable 3-hydroxyalkanoate copolymer (A). When the amount of the plasticizer (B) is less than 0.1 parts by weight, the effect as a plasticizer is less likely to be exhibited, and tensile elongation at an initial stage may be reduced and the effect of suppressing its time dependent alteration may be deteriorated. Further, when the amount exceeds 50 parts by weight, deterioration of the heat resistance, bleed out properties, reduction of the tensile elongation at an initial stage, deterioration of the effect of suppressing its time dependent alteration, and the like may be caused. In the present invention, by blending the biodegradable poly 3-hydroxyalkanoate (C) having a melting temperature higher than that of the copolymer (A), the biodegradable poly 3-hydroxyalkanoate (C) serves as a crystal nucleating agent in the resin composition, whereby crystallization of the resin composition can be promoted, and thus the molding processibility can be improved. More specifically, when the copolymer (A) having a melting temperature Tm1 is melted at a given temperature, crystal nucleus of the poly 3-hydroxyalkanoate (C) having a melting temperature Tm2 that is higher than Tm1 is left unmelted. Thus, a crystal rapidly grows with the unmelted poly 3-hydroxyalkanoate (C) as a nuclear point, whereby the crystallization rate is accelerated. With respect to the melting temperature Tm1 of the copolymer (A), the melting temperature Tm2 of the biodegradable poly 3-hydroxyalkanoate (C) in the present invention preferably satisfies the relational expression of Tm2≧Tm1+5° C.; more preferably satisfies the relational expression of Tm2≧Tm1+10° C.; and still more preferably satisfies the relational expression of Tm2≧Tm1+20° C. When the melting temperature Tm2 satisfies the relational expression of Tm2<Tm1+5° C., the effect as a nucleating agent may be unsatisfactory, and thus moldability tends to be depressed. The melting temperature Tm in the present invention may be determined on the basis of a peak of the endothermic curve drawn along with melting of 1 to 10 mg of a sample of the copolymer (A) or the biodegradable poly 3-hydroxyalkanoate (C) by elevating the temperature from 30° C. at a rate of 10° C./min until being raised to 30 to 40° C. higher than the temperature at which each sample is sufficiently melted, then lowering the temperature at a rate of 10° C./min to 30° C., and again elevating the temperature at a rate of 10° C./min until being raised to 30 to 40° C. higher than the temperature at which each sample is sufficiently melted, using a differential scanning calorimeter (manufactured by Seiko Electronics Co., Ltd., DSC200). In the measurement, when multiple peaks of the endothermic curve are found, the peak of the highest temperature may be decided as Tm. The poly 3-hydroxyalkanoate (C) having a melting temperature Tm2 is a biodegradable polymer having a recurring unit represented by the structure formula [—CHR—CH2—CO—O—] (wherein, R represents an alkyl group represented by CnH2n+1; n is an integer of from 1 to 15; and R may be the same or different in the polymer). However, when the poly 3-hydroxyalkanoate (C) is a copolymer, the recurring unit may be the same as or different from the recurring unit of the copolymer (A). The poly 3-hydroxyalkanoate (c) having a melting temperature Tm2 is preferably poly 3-hydroxybutyrate (hereinafter, may be referred to as “PHB”) in light of promotion of crystallization, but a recurring unit other than 3-hydroxybutyrate may be included at most 10% by mole as long as the relational expression of Tm2≧Tm1+5° C. is satisfied. Particularly, when the biodegradable 3-hydroxyalkanoate copolymer (A) having a melting temperature Tm1 is PHBH, and the HH rate is 1 to 20% by mole, the poly 3-hydroxyalkanoate (c) having a melting temperature Tm2 is preferably poly 3-hydroxybutyrate in light of promotion of crystallization. However, when the 3-hydroxyalkanoate copolymer (A) having a melting temperature Tm1 is PHBH, and the HH rate is 10 to 20% by mole, PHBH having a recurring unit of 3-hydroxybutyrate and 3-hydroxyhexanoate, and having a HH rate of 0.01 to 8% by mole may be used as the poly 3-hydroxyalkanoate (c) having a melting temperature Tm2, in light of uniform dispersibility and compatibility. The poly 3-hydroxyalkanoate (c) having a melting temperature Tm2 may be obtained by either a method of production from a microorganism or a synthetic method, and the method for production is not particularly limited. The content of the poly 3-hydroxyalkanoate (c) having a melting temperature Tm2 in the present invention is preferably 0.1 to 30 parts by weight, and more preferably 0.1 to 20 parts by weight based on 100 parts by weight of the 3-hydroxyalkanoate copolymer (A) having a melting temperature Tm1. When the content of the poly 3-hydroxyalkanoate (C) is less than 0.1 parts by weight, the effect as a nucleating agent may be decreased, whereby the moldability is likely to be reduced. In contrast, when the content exceeds 30 parts by weight, the effect to meet the content cannot be expected, and thus such a content is not practical but uneconomical. In addition to the biodegradable 3-hydroxyalkanoate copolymer (A) and the biodegradable poly 3-hydroxyalkanoate (C), to the resin composition of the present invention may be further added if necessary polyglycolic acid, polylactic acid, poly 4-hydroxybutyrate, poly 4-hydroxyvaleate, poly 3-hydroxyhexanoate or polycaprolactone, as well as at least one aliphatic polyester such as polyethylene adipate, polyethylene succinate, polybutylene adipate or polybutylene succinate, or a copolymer thereof, as a polymer that includes aliphatic polyvalent carboxylic acid and aliphatic polyhydric alcohol as principal constitutive components. The amount of such a polymer blended is preferably 1 to 300 parts by weight, and more preferably 5 to 100 parts by weight based on 100 parts by weight of the biodegradable 3-hydroxyalkanoate copolymer (A). To the resin composition of the present invention may be added a nucleating agent (D) other than the aforementioned poly 3-hydroxyalkanoate (C) within the range not to impair the physical properties, whereby crystallization can be facilitated. Examples of the other nucleating agent (D) include e.g., high fatty acid amides, urea derivatives, sorbitol-based compounds, boron nitride, high fatty acid salts, aromatic fatty acid salts, and the like. Among these, because of high effect as the nucleating agent, the high fatty acid amides, the urea derivatives, and the sorbitol-based compounds are preferred. These may be used singly, or two or more thereof may be used in combination. Examples of the high fatty acid amide include behenic acid amide, oleic acid amide, erucic acid amide, stearic acid amide, palmitic acid amide, N-stearylbehenic acid amide, N-stearylerucic acid amide, ethylenebisstearic acid amide, ethylenebisoleic acid amide, ethylenebiserucic acid amide, ethylenebislauryl acid amide, ethylenebiscapric acid amide, p-phenylenebisstearic acid amide, a polycondensation product of ethylene diamine, stearic acid and sebacic acid, and the like. Particularly, behenic acid amide is preferred. As the urea derivative, bis(stearylureide)hexane, 4,4′-bis(3-methylureide)diphenylmethane, 4,4′-bis(3-cyclohexylureide)diphenylmethane, 4,4-bis(3-cyclohexylureide)dicyclohexylmethane, 4,4′-bis(3-phenylureide)dicyclohexylmethane, bis(3-methylcyclohexylureide)hexane, 4,4′-bis(3-decylureide)diphenylmethane, N-octyl-N′-phenylurea, N,N′-diphenylurea, N-tolyl-N′-cyclohexylurea, N,N-dicyclohexylurea, N-phenyl-N′-tribromophenylurea, N-phenyl-N′-tolylurea, N-cyclohexyl -N′-phenylurea, and the like may be illustrated, and particularly bis(stearylureide)hexane is preferred. Examples of the sorbitol-based compound include 1,3,2,4-di (p-methylbenzylidene)sorbitol, 1,3,2,4-dibenzylidenesorbitol, 1,3-benzylidene-2,4-p-methylbenzylidenesorbitol, 1,3-benzylidene-2,4-p-ethylbenzylidenesorbitol, 1,3-p-methylbenzylidene-2,4-benzylidenesorbitol, 1,3-p-ethylbenzylidene-2,4-benzylidenesorbitol, 1,3-p-methylbenzylidene-2,4-p-ethylbenzylidenesorbitol, 1,3-p-ethylbenzylidene-2,4-p-methylbenzylidenesorbitol, 1,3,2,4-di(p-ethylbenzylidene)sorbitol, 1,3,2,4-di(p-n-propylbenzylidene)sorbitol, 1,3,2,4-di(p-i-propylbenzylidene)sorbitol, 1,3,2,4-di(p-n-butylbenzylidene), 1,3,2,4-di(p-s-butylbenzylidene)sorbitol, 1,3,2,4-di(p-t-butylbenzylidene)sorbitol, 1,3,2,4-di(p-methoxybenzylidene)sorbitol, 1,3,2,4-di(p-ethoxybenzylidene)sorbitol, 1,3-benzylidene-2,4-p-chlorbenzylidenesorbitol, 1,3-p-chlorbenzylidene-2,4-benzylidenesorbitol, 1,3-p-chlorbenzylidene-2,4-p-methylbenzylidenesorbitol, 1,3-p-chlorbenzylidene-2,4-p-ethylbenzylidenesorbitol, 1,3-p-methylbenzylidene-2,4-p-chlorbenzylidenesorbitol, 1,3-p-ethylbenzylidene-2,4-p-chlorbenzylidenesorbitol, 1,3,2,4-di(p-chlorbenzylidene)sorbitol, and the like. Among these, 1,3,2,4-di(p-methylbenzylidene)sorbitol, and 1,3,2,4-dibenzylidenesorbitol are preferred. The amount of the nucleating agent (D) used in the resin composition of the present invention is preferably 0.1 to 10 parts by weight, more preferably 0.2 to 8 parts by weight, and still more preferably 0.5 to 5 parts by weight based on 100 parts by weight of the (3-hydroxyalkanoate) copolymer (A) in light of the formability. When the amount of the nucleating agent (D) is less than 0.1 parts by weight, the effect as the nucleating agent can be insufficient, while when the amount exceeds 10 parts by weight, the effect can be saturated, leading to economical disadvantage. In addition, it is preferred that the resin composition of the present invention has a mean crystal particle size of equal to or less than 50 μm, in light of improvement of the impact resistance, tensile elongation characteristics, transparency and the like. In the resin composition of the present invention, the flexural modulus, heat resistance and the like can be further improved by further adding the filler. Among the aforementioned fillers, examples of inorganic filler include carbon black, calcium carbonate, silicon oxide and silicic acid salts, zinc white, Hycite clay, kaolin, basic magnesium carbonate, mica, talc, quartz powder, diatomaceous earth, dolomite powder, titanium oxide, zinc oxide, antimony oxide, barium sulfate, calcium sulfate, alumina, calcium silicate and the like, and particularly, mica and talc having a particle size of 0.1 to 30 μm are preferred. In addition, examples of the other filler include inorganic fibers such as carbon fiber, and organic fibers such as human hair and sheep wool. Moreover, natural fibers such as bamboo fibers, pulp fibers, kenaf fibers, analogous other plant alternatives, annual herb plants of genus Hibiscus in family Malvaceae, annual herb plants of family Tiliaceae, and the like can be also used. In light of reduction of carbon dioxide, natural fibers of plant origin are preferred, and particularly, kenaf fibers are preferred. The amount of the filler used in the resin composition of the present invention is preferably 0.1 to 100 parts by weight, more preferably 0.1 to 80 parts by weight, and still more preferably 0.1 to 50 parts by weight based on 100 parts by weight of the 3-hydroxyalkanoate copolymer (A), in light of physical properties, formability, and costs. When the amount of the filler is less than 0.1 parts by weight, less improvement of the physical properties is likely to be achieved, while the filler exceeding 100 parts by weight is apt to result in lowering of the impact strength. To the resin composition of the present invention may be added a known modifier, a thermoplastic resin, or a thermosetting resin in the range not to inhibit the effects of the present invention. Examples of typical modifier include core shell type graft copolymers having a core of an acrylic rubber, an acryl silicone composite rubber, a butadiene rubber or the like, molding processibility modifiers including an acrylic high molecular polymer, and the like. Examples of the thermoplastic resin include general-purpose thermoplastic resins such as polyolefin-based resins like polypropylene and polyethylene, polyvinyl chloride-based resins, polystyrene-based resins, ABS-based resins, acrylic resins and the like, as well as general-purpose engineering plastics such as polyethylene terephthalate-based resins, polybutylene terephthalate-based resins, polycarbonate-based resins, polyamide-based resins and the like. In addition, epoxy resins and the like may be exemplified as typical thermosetting resins. Into the resin composition of the present invention can be compounded a filler; a colorant such as a pigment or a dye; an odor absorbent such as activated charcoal or zeolite; a flavor such as vanillin or dextrin; an antioxidant; an anti-oxidizing agent; a weather resistance improving agent; a stabilizer such as an ultraviolet ray absorbing agent; a plasticizer other than the component (B) described above; a lubricant; a release agent; a water repellent agent; an antimicrobial agent; a slidability improving agent; and other secondary additive, as needed. The aforementioned additives may be used alone, or two or more thereof may be used in combination. The resin composition of the present invention can be produced by a known method. For example, as the method of heat melting and mixing, mixing by mechanical agitation with a single screw extruder, a twin screw extruder, a tank having a kneader, a gear pump, a kneading roll, a stirrer or the like; application of a static mixer in which dividing and joining of the flow are repeated by a flow guide apparatus; and the like may be exemplified. In the case of heat melting, it is necessary to mix while paying attention to lowering of the molecular weight of PHA resulting from thermal degradation. The heat melting is preferably carried out at a temperature of 160 to 170° C. In addition, there is also a method of obtaining the resin composition of the present invention including dissolving in a solvent to permit dissolution, and thereafter removing the solvent. Final composition can be also produced by forming a master batch with a combination in part of each component used in the present invention beforehand, and thereafter adding the residual component(s). Thus, compatibility of each component is improved, whereby physical property balance can be improved. The resin composition of the present invention can be processed by extrusion molding, or injection molding. Further, using the extrusion molding machine as described above, it may be processed into the shape of pellet, block, film, sheet or the like. After pelletizing once so as to provide favorable dispersibility of various components, the pellet may be processed into the shape of film or sheet by an injection molding machine or an extruder. Alternatively, processing to obtain a film or sheet can be executed with a calender molding machine, a roll molding machine, or an inflation molding machine. Moreover, the film or the sheet obtained from the composition of the present invention can be subjected to thermal molding by heat, vacuum molding, press molding or the like. In addition, hollow molding by a blow molding machine can be carried out. Further, it can be formed into fibers by melt spinning or the like. The molded product obtained using the resin composition of the present invention has efficiently improved impact resistance, tensile elongation characteristics, surface properties and molding processibility while retaining high heat resistant characteristics as a crystallizable polymer of the biodegradable 3-hydroxyalkanoate copolymer (A). In addition, surprisingly, time dependent alteration of impact resistance and tensile elongation characteristics can be significantly improved. The resin composition of the present invention is formed into a variety of molded articles such as fiber, string, rope, woven fabric, knit fabric, nonwoven fabric, paper, film, sheet, tube, plate, bar, vessel, bag, accessory, foam and the like, which may be used alone. Alternatively, it can be used by combining with a variety of fiber, string, rope, woven fabric, knit fabric, nonwoven fabric, paper, film, sheet, tube, plate, bar, vessel, bag, accessory, foam or the like constituted with a simple substance other than this composition to improve the physical property of the simple substance. The molded articles obtained in this manner can be suitably used in fields such as agriculture, fishery, forestry, horticulture, medicine, sanitary goods, food industry, clothing, nonclothing, packaging, automobile, building material, and others. Effects of the Invention The present invention can provide a resin composition which is excellent in impact resistance, tensile elongation characteristics, heat resistance, surface properties (bleed characteristics), moldability and the like accompanied by less time dependent alteration of these properties, and a molded product of the same by blending: a plasticizer (B) including a polyglycerol acetic acid ester having an acetylation degree of no less than 50% as a principal component, into a biodegradable poly 3-hydroxyalkanoate copolymer (A). BEST MODE FOR CARRYING OUT THE INVENTION Next, the composition of the present invention, and the molded article thereof will be explained in more detail by way of Examples, but the present invention is not limited just to these Examples. The resins and additives used in this Example are as follows. A-1: PHBH poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] (HH rate=12%, Mw=500,000, melting temperature: 120° C.) B-1: plasticizer manufactured by Riken Vitamin Co., Ltd., RIKEMAL PL710 (polyglycerol acetic acid ester having an acetylation degree of 99%/monoglycerol ester=90% by weight/10% by weight) B-2: plasticizer manufactured by Riken Vitamin Co., Ltd., RIKEMAL PL012 (glycerin diacetomonolaurate having an acetylation degree of 66%) B-3: plasticizer ATBC/tributyl acetylcitrate C-1: PHB poly 3-hydroxybutyrate (PHB, manufactured by BAIOMER, Mw=750,000, melting temperature: 171° C.) D-1: nucleating agent behenic acid amide (manufactured by CRODA JAPAN KK, Incroslip B) E-1: hindered pheolic antioxidant (manufactured by Ciba Specialty Chemicals Holding Inc., IRGANOX-1010) PHBH (A-1) having an HH rate of 12% by mole, and a Mw (weight average molecular weight) of about 500,000, produced using Alcaligenes eutrophus AC32 strain (J. Bacteriol., 179, 4821 (1997), FERM BP-6038) which had been prepared by introducing a PHA synthetic enzyme gene derived from Aeromonas caviae into Alcaligenes eutrophus as a microorganism through arbitrarily adjusting the raw material and culture conditions was used. Conditions for Culturing Microirganism Culture was conducted as in the following. Composition of the preculture medium included 1 w/v % Meat-extract, 1 w/v % Bacto-Trypton, 0.2 w/v % Yeast-extract, 0.9 w/v % Na2HPO4.12H2O, and 0.15 w/v % KH2PO4, with a pH of 6.7. Composition of the medium for producing polyester included 1.1 w/v % Na2HPO4.12H2O, 0.19 w/v % KH2PO4.0.6 w/v % (NH4)2SO4, 0.1 w/v % MgSO4.7H2O, and a 0.5 v/v % solution of a trace metal salt (prepared by dissolving 1.6 w/v % FeCl3.6H2O, 1 w/v % CaCl2.2H2O, 0.02 w/v % CoCl2.6H2O, 0.016 w/v % CuSO4.5H2O, 0.012 w/v % NiCl3.6H2O and 0.01 w/v % CRCl3.6H2O in 0.1 N hydrochloric acid), with PKOO (palm kernel olein oil) used as a carbon source. The culture was conducted by feeding culture while feeding the carbon source. A glycerol stock of a PHBH-producing strain was inoculated into the preculture medium, and cultured for 20 hrs. Thereafter, the culture was inoculated into a 5-L jar fermenter (manufactured by B. E. MARUBISHI Co., Ltd., model MD-500) charged with 2.5 L of the culture medium for production at 10 v/v %. The operating conditions involved a culture temperature of 28° C., an agitating speed of 420 rpm and a ventilation volume of 0.6 wm, and the pH was adjusted to be from 6.6 to 6.8. For adjusting the pH, 14% aqueous ammonia was used. The culture was conducted for upto 65 hrs. Following the culture, bacterial cells were recovered by centrifugal separation, washed with methanol, and lyophilized. The lyophilized bacterial cells were extracted with chloroform, and the residues of the bacterial cells were filtrated. Thereafter, hexane was added to the filtrate to allow PHBH to be deposited. PHBH was recovered by filtration, washed with hexane, and dried to prepare PHBH. Measurement of Melting Temperature Tm of PHA Copolymer (A) or PHA (C) Using a differential scanning calorimeter (manufactured by Seiko Electronics Co., Ltd., DSC200), the temperature of 1 to 10 mg the PHA copolymer (A) or PHA (C) was elevated from 30° C. to 200° C. at a rate of 10° C./min, and then lowered from 200° C. to 30° C. at a rate of 10° C./min. Subsequently, the temperature was elevated again from 30° C. to 200° C. at a rate of 10° C./min. The peak of the endothermic curve drawn along with melting of the PHA copolymer (A) or PHA (C) was recorded, and decided as a melting temperature Tm. When multiple peaks of the endothermic curve were found in elevating the temperature again, top temperature at the peak with the greatest endothermic quantity was decided as Tm. EXAMPLES 1 TO 3 A mixture of poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] (PHBH), the plasticizer, the nucleating agent and the antioxidant at the blending proportion shown in Table 1 was subjected to melt kneading using a twin screw extruder (manufactured by Japan Steel Works, Ltd., TEX30a) at a cylinder setting temperature of 130° C. to obtain a pellet of the composition. Thus resulting composition was evaluated on the sheet moldability, the impact resistance, the tensile elongation at break, the bleed characteristics and the heat resistance. The results are shown in Table 1. COMPARATIVE EXAMPLES 1 TO 4 At the blending proportion shown in Table 1, pellets of resin compositions were obtained in a similar operation to that in Example 1. Thus resulting resin composition pellet was evaluated on the sheet moldability, the impact resistance, the tensile elongation at break, the bleed characteristics and the heat resistance. The results are shown in Table 1. Evaluation methods of the resulting resin compositions are as in the following. Evaluation of Tensile Elongation Characteristics The pellets obtained in Examples 1 to 3 and Comparative Examples 1 to 4 were dried at 80° C for 5 hrs, and thereafter extruded using a single screw extruder Laboplastomill (manufactured by Toyo Seiki Seisaku-sho, Ltd., model 20C200) equipped with a T-die having a width of 150 mm under conditions at a processing temperature of 160° C. and a screw rotation frequency of 30 rpm to produce sheets having a thickness of 0.1 mm. From thus resulting sheets, dumbbells (JIS K7113, small test piece No. 2(⅓)) were produced in an MD direction (along the stream) by punching. Thus resulting dumbbell test pieces were preserved for 7 days, 60 days or 90 days at 23° C. in an atmosphere with a humidity of 50% after the extrusion molding to form sheets. Using a tensile tester (manufactured by Shimadzu Corporation, AUTOGRAPH AG2000A), a tensile test was performed under a condition of the tensile test speed being 33 mm/min. Impact Resistance The pellets obtained in Examples 1 to 3 and Comparative Examples 1 to 4 were dried at 80° C. for 5 hrs, and thereafter sheets having a thickness of 1 mm were produced using a hot pressing machine (manufactured by SHINTO Metal Industries Corporation, compression molding machine NSF-50) under conditions at 170° C. with a load of 5 MPa. From thus resulting sheets, samples of 50 mm square were cut out to produce test pieces. Thus resulting test pieces were preserved for 7 days or 60 days at 23° C. in an atmosphere with a humidity of 50% after the hot press molding to form sheets, and the impact strength (23° C.) was evaluated with a DuPont impact test (Toyo Seiki Seisaku-sho, Ltd.) with a diameter of impact center being φ12.7 mm. Surface Properties (Bleed Characteristics) The sheets of 50 mm square×0.1 mm in thickness obtained by the aforementioned extrusion molding to form sheets were preserved in an oven (manufactured by Tabai Espec Corp., SHPS-222) with a setting temperature of 100° C. for 24 hrs, and the state of bleed of the sheet surface was observed and evaluated. A: bleed not found B: bleed found a little C: bleed found Sheet Moldability Surface properties of the drawn roll face and the sheet 10 min after initiating aforementioned molding to form sheets were visually observed, and evaluated. A: no cohesion to the drawn roll found, also revealing favorable surface properties (smoothness) of the sheet. B: cohesion to the drawn roll found a little, and uneven surface properties (smoothness) of the sheet found. C: significant cohesion to the drawn roll found, also revealing unfavorable surface properties (smoothness) of the sheet. Heat Resistance: Heat Deformation Temperature (HDT) Measurement Method The pellets obtained in Examples 1 to 3 and Comparative Examples 1 to 4 were dried at 80° C. for 5 hrs, and thereafter test pieces of 127 mm×12.7 mm×6.4 mm in thickness were produced under conditions of a cylinder setting temperature being 150° C. and a mold temperature of 60° C. using an injection molding machine (manufactured by Toshiba Machine Co., Ltd., IS75E, clamping force: 75 ton). The heat deformation temperature at a load of 0.45 MPa was determined on the resulting test piece according to JIS K7207 (method A). TABLE 1 Example Comparative Example Unit 1 2 3 1 2 3 4 (A-1) PHBH (3HH 12%) Part by 100 100 100 100 100 100 100 (B-1) plasticizer weight 20 10 5 60 (B-2) plasticizer 10 (B-3) plasticizer 10 (D-1) nucleating agent 1 1 1 1 1 1 1 (E-1) stabilizer 0.2 0.2 0.2 0.2 0.2 0.2 0.2 Heat resistance ° C. 89 90 91 90 87 86 80 Tensile elongation at break % 425 416 380 282 370 160 170 (7 days after forming sheet) Tensile elongation at break % 390 370 350 289 300 120 130 (60 days after forming sheet) Tensile elongation at break % 340 320 300 228 240 80 100 (90 days after forming sheet) Impact resistance kg · cm 35 30 30 25 30 30 35 (7 days after forming sheet) Impact resistance kg · cm 35 30 30 20 20 15 35 (60 days after forming sheet) Bleed characteristics — B A A A B B C Sheet moldability — A A A B B B C From the results shown in Table 1, Examples 1 to 3 demonstrated greater initial tensile elongation at break and impact value as compared with Comparative Examples 1 to 4, with less time dependent alteration, and also excellent bleed characteristics, heat resistance and sheet moldability were proven according to Examples 1 to 3. EXAMPLES 4 TO 9 A mixture of poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] (PHBH), poly 3-hydroxybutyrate (PHB), the plasticizer, the nucleating agent and the antioxidant blended with a compounding proportion shown in Table 2 was subjected to melt kneading using a twin screw extruder (manufactured by Japan Steel Works, Ltd., TEX30a) at a cylinder preset temperature of 130° C. to obtain a pellet of the composition was obtained. Thus resulting composition was evaluated on the molding processibility, the impact resistance, the tensile elongation at break, the bleed characteristics and the heat resistance. The results are shown in Table 2. COMPARATIVE EXAMPLES 5 TO 9 At the blending proportion shown in Table 2, pellets of resin compositions were obtained in a similar operation to that in Example 4. Thus resulting resin composition pellet was evaluated on the molding processibility, the impact resistance, the tensile elongation at break, the bleed characteristics and the heat resistance. The results are shown in Table 2. Evaluation methods of the resulting resin compositions are as in the following. Evaluation of Tensile Elongation Characteristics The pellets obtained in Examples 4 to 9 and Comparative Examples 5 to 9 were dried at 80° C. for 5 hrs, and thereafter extruded using a single screw extruder Laboplastomill (manufactured by Toyo Seiki Seisaku-sho, Ltd., model 20C200) equipped with a T-die having a width of 150 mm under conditions at a processing temperature of 160° C. and a screw rotation frequency of 30 rpm to produce sheets having a thickness of 0.1 mm. From thus resulting sheets, dumbbells (JIS K7113, small test piece No. 2(⅓)) were produced in an MD direction (along the stream) by punching. Thus resulting dumbbell test pieces were preserved for 7 days or 60 days at 23° C. in an atmosphere with a humidity of 50% after the extrusion molding to form sheets. Using a tensile tester (manufactured by Shimadzu Corporation, AUTOGRAPH AG2000A), a tensile test was performed under a condition of the tensile test speed being 33 mm/min. Evaluation of Molding Processibility The pellets obtained in Examples 4 to 9 and Comparative Examples 5 to 9 were dried at 80° C. for 5 hrs, and thereafter extruded using a single screw extruder Laboplastomill (manufactured by Toyo Seiki Seisaku-sho, Ltd., model 20C200) equipped with a T-die having a width of 150 mm under conditions at a processing temperature of 160° C. and a screw rotation frequency of 30 rpm. The maximum drawing speed that enables release to be achieved from the metal roll (temperature regulated to 60° C.) in the extrusion with the T-die was determined for evaluation. Impact Resistance The pellets obtained in Examples 4 to 9 and Comparative Examples 5 to 9 were dried at 80° C. for 5 hrs, and thereafter sheets having a thickness of 1 mm were produced using a hot pressing machine (manufactured by SHINTO Metal Industries Corporation, compression molding machine NSF-50) under conditions at 170° C. with a load of 5 MPa. From thus resulting sheets, samples of 50 mm square were cut out to produce test pieces. Thus resulting test pieces were preserved for 7 days or 60 days at 23° C. in an atmosphere with a humidity of 50% after the hot press molding to form sheets, and the impact strength (23° C.) was evaluated with a DuPont impact test (Toyo Seiki Seisaku-sho, Ltd.) with a diameter of impact center being φ12.7 mm. Bleed Characteristics The sheets of 50 mm square×0.1 mm in thickness obtained by the aforementioned extrusion molding to form sheets were preserved in an oven (manufactured by Tabai Espec Corp., SHPS-222) with a setting temperature of 100° C. for 24 hrs, and the state of bleed of the sheet surface was observed and evaluated. A: bleed not found B: bleed slightly found C: bleed found Heat Resistance: Heat Deformation Temperature (HDT) Measurement Method The pellets obtained in Examples 4 to 9 and Comparative Examples 5 to 9 were dried at 80° C. for 5 hrs, and thereafter test pieces of 127 mm×12.7 mm×6.4 mm in thickness were produced under conditions of a cylinder setting temperature being 150° C. and a mold temperature of 60° C. using an injection molding machine (manufactured by Toshiba Machine Co., Ltd., IS75E, clamping force: 75 ton). The heat deformation temperature at a load of 0.45 MPa was determined on the resulting test piece according to JIS K7207 (method A). TABLE 2 Example Comparative Example Unit 4 5 6 7 8 9 5 6 7 8 9 (A-1) PHBH (HH rate = 12%) part by 100 100 100 100 100 100 100 100 100 100 100 (B-1) plasticizer weight 10 20 10 10 5 3 60 (B-2) plasticizer 10 (B-3) plasticizer 10 (C-1) PHB 10 10 5 5 5 10 10 10 10 (D-1) nucleating agent 1 1 1 1 1 1 1 1 1 1 1 (E-1) stabilizer 0.2 0.2 0.2 0.2 0.2 0.2 0.2 0.2 0.2 0.2 0.2 Tensile elongation at break % 416 390 373 423 363 350 282 276 344 148 420 (7 days after forming sheet) Tensile elongation at break % 370 372 350 403 252 204 289 40 120 31 399 (60 days after forming sheet) Impact resistance kg · cm 30 35 30 30 30 25 25 18 30 30 35 (7 days after forming sheet) Impact resistance kg · cm 30 35 30 30 30 25 20 12 20 15 35 (60 days after forming sheet) Heat resistance ° C. 91 90 91 90 92 92 90 92 90 91 81 Molding processibility m/min 0.4 >4 >4 3 3 3 0.5 >4 >4 >4 >4 Bleed characteristics — A B A A A A A A C C C From the results shown in Table 2, Examples 4 to 9 demonstrated greater initial tensile elongation at break and impact value as compared with Comparative Examples 5 to 9, with less time dependent alteration, and also excellent bleed characteristics and heat resistance were proven according to Examples 5 to 9. Furthermore, Examples 5 to 9 exhibited extremely superior molding processibility. INDUSTRIAL APPLICABILITY The composition of the present invention is formed into a variety of molded articles such as fiber, string, rope, woven fabric, knit fabric, nonwoven fabric, paper, film, sheet, tube, plate, bar, vessel, bag, accessory, and the like, which may be used alone. Alternatively, it can be used by combining with a variety of fiber, string, rope, woven fabric, knit fabric, nonwoven fabric, paper, film, sheet, tube, plate, bar, vessel, bag, accessory, foam or the like constituted with a simple substance other than this composition to improve the physical property of the simple substance. The molded article obtained in this manner can be suitably used in fields such as agriculture, fishery, forestry, horticulture, medicine, sanitary goods, food industry, clothing, nonclothing, packaging, automobile, building material, and others. 1. A resin composition comprising a biodegradable 3-hydroxyalkanoate copolymer (A) and a plasticizer (B), wherein: the biodegradable 3-hydroxyalkanoate copolymer (A) has a recurring unit represented by the structure formula (1): [—CHR—CH2—CO—O—] (wherein, R represents an alkyl group represented by CnH2n+1; and n is an integer of 1 to 15); the plasticizer (B) is constituted with 100 to 50% by weight of a polyglycerol acetic acid ester having an acetylation degree of no less than 50%, and 0 to 50% by weight of a monoglycerol ester; and the resin composition comprises 0.1 to 50 parts by weight of the plasticizer (B) based on 100 parts by weight of the copolymer (A). 2. The resin composition according to claim 1 further comprising (C) a biodegradable poly 3-hydroxyalkanoate having a melting temperature Tm2 higher than the melting temperature Tm1 of the copolymer (A), wherein: the melting temperature Tm2 of the biodegradable poly 3-hydroxyalkanoate (C) satisfies the relational expression of Tm2≧Tm1+5° C.; and the resin composition contains 0.1 to 30 parts by weight of the biodegradable poly 3-hydroxyalkanoate (C) based on 100 parts by weight of the copolymer (A). 3. The resin composition according to claim 1 wherein the copolymer (A) is constituted with poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] having a recurring unit of 3-hydroxybutyrate and a recurring unit of 3-hydroxyhexanoate as a principal component. 4. The resin composition according to claim 1 wherein the copolymer (A) has a weight average molecular weight of 300,000 to 3,000,000. 5. The resin composition according to claim 3 wherein the component ratio of the recurring units of the poly[3-hydroxybutyrate-co-3-hydroxyhexanoate] in terms of 3-hydroxybutyrate unit/3-hydroxyhexanoate unit is 99/1 to 80/20 (mol/mol). 6. The resin composition according to claim 1 wherein the polyglycerol acetic acid ester having an acetylation degree of no less than 50% is at least one selected from the group consisting of a diglycerol acetic acid ester and a triglycerol acetic acid ester having an acetylation degree of no less than 50%. 7. The resin composition according to claim 1 wherein the monoglycerol ester is diacetylmonoacylglycerol with a constitutive fatty acid having no less than 8 carbon atoms. 8. The resin composition according to claim 2 wherein the biodegradable poly 3-hydroxyalkanoate (C) is poly 3-hydroxybutyrate.

2007-08-09

en

2010-02-18

US-201414263824-A

Request routing based on class ABSTRACT A system and method for management and processing of resource requests is provided. A content delivery network service provider receives a DNS query from a client computing device. The DNS query corresponds to a requested resource from the client computing device. The content delivery network service provider associates the client computing device with a cluster of other client computing devices. Based on routing information for the cluster, the content delivery network service provider routes the DNS query. The process can further include monitoring performance data associated with the delivery of the requested resource and updating the routing information for the cluster based on the performance data for use in processing subsequent requests from client computing devices in the cluster. CROSS-REFERENCE TO RELATED APPLICATIONS This application is a continuation of U.S. patent application Ser. No. 13/766,574 filed Feb. 13, 2013, entitled REQUEST ROUTING BASED ON CLASS, which in turn is a continuation of U.S. patent application Ser. No. 13/418,239, now U.S. Pat. No. 8,386,596, filed Mar. 12, 2012, entitled REQUEST ROUTING BASED ON CLASS, which is in turn a continuation of U.S. patent application Ser. No. 13/098,366, now U.S. Pat. No. 8,135,820, filed Apr. 29, 2011, and entitled “REQUEST ROUTING BASED ON CLASS,” which is in turn a continuation of U.S. patent application Ser. No. 12/060,173, now U.S. Pat. No. 7,962,597, filed Mar. 31, 2008, and entitled “REQUEST ROUTING BASED ON CLASS,” the disclosures of which are incorporated herein by reference. BACKGROUND Generally described, computing devices and communication networks can be utilized to exchange information. In a common application, a computing device can request content from another computing device via the communication network. For example, a user at a personal computing device can utilize a software browser application to request a Web page from a server computing device via the Internet. In such embodiments, the user computing device can be referred to as a client computing device and the server computing device can be referred to as a content provider. Content providers are generally motivated to provide requested content to client computing devices often with consideration of efficient transmission of the requested content to the client computing device and/or consideration of a cost associated with the transmission of the content. For larger scale implementations, a content provider may receive content requests from a high volume of client computing devices which can place a strain on the content provider's computing resources. Additionally, the content requested by the client computing devices may have a number of components, which can further place additional strain on the content provider's computing resources. With reference to an illustrative example, a requested Web page, or original content, may be associated with a number of additional resources, such as images or videos, which are to be displayed with the Web page. In one specific embodiment, the additional resources of the Web page are identified by a number of embedded resource identifiers, such as uniform resource locators (“URLs”). In turn, software on the client computing devices typically processes embedded resource identifiers to generate requests for the content. Often, the resource identifiers associated with the embedded resources reference a computing device associated with the content provider such that the client computing device would transmit the request for the additional resources to the referenced content provider computing device. Accordingly, in order to satisfy a content request, the content provider would provide client computing devices data associated with the Web page as well as the data associated with the embedded resources. Some content providers attempt to facilitate the delivery of requested content, such as Web pages and/or resources identified in Web pages, through the utilization of a content delivery network (“CDN”) service provider. A CDN server provider typically maintains a number of computing devices in a communication network that can maintain content from various content providers. In turn, content providers can instruct, or otherwise suggest to, client computing devices to request some, or all, of the content provider's content from the CDN service provider's computing devices. As with content providers, CDN service providers are also generally motivated to provide requested content to client computing devices often with consideration of efficient transmission of the requested content to the client computing device and/or consideration of a cost associated with the transmission of the content. Accordingly, CDN service providers often consider factors such as latency of delivery of requested content in order to meet service level agreements or to generally improve the quality of delivery service. DESCRIPTION OF THE DRAWINGS The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein: FIG. 1 is a block diagram illustrative of content delivery environment including a number of client computing devices, content provider, and a content delivery network service provider; FIG. 2 is a block diagram of the content delivery environment of FIG. 1 illustrating the registration of a content provider with a content delivery service provider; FIG. 3 is a block diagram of the content delivery environment of FIG. 1 illustrating the generation and processing of a content request from a client computing device to a content provider; FIG. 4 is a block diagram of the content delivery environment of FIG. 1 illustrating one embodiment of the generation and processing of a DNS query corresponding to an embedded resource from a client computing device to a content delivery network service provider; FIGS. 5A-5C are block diagrams of the content delivery environment of FIG. 1 illustrating another embodiment of the generation and processing of a DNS query corresponding to an embedded resource from a client computing device to a content delivery network service provider and the subsequent generation and processing of DNS queries corresponding to a first and a second alternative resource identifier from a client computing device to a content delivery network; FIG. 6 is a block diagram of the content delivery environment of FIG. 1 illustrating the generation and processing of embedded resource requests from a client computing device to a content delivery network service provider; FIG. 7 is a flow diagram illustrative of a request routing routine implemented by a content delivery network service provider for selecting a cache server component; and FIG. 8 is a flow diagram illustrative a request routing routine implemented by a content delivery network service provider for updating routing information. DETAILED DESCRIPTION Generally described, the present disclosure is directed to the management and processing of resource requests made to a content delivery network (“CDN”) service provider from client computing devices. Specifically, aspects of the disclosure will be described with regard to routing information associated with a resource request based on routing information for a cluster of client computing devices. Although various aspects of the disclosure will be described with regard to illustrative examples and embodiments, one skilled in the art will appreciate that the disclosed embodiments and examples should not be construed as limiting. FIG. 1 is a block diagram illustrative of content delivery environment 100 for the management and processing of content requests. As illustrated in FIG. 1, the content delivery environment 100 includes a number of client computing devices 102 (generally referred to as clients) for requesting content from a content provider and/or a CDN service provider. In an illustrative embodiment, the client computing devices 102 can correspond to a wide variety of computing devices including personal computing devices, laptop computing devices, hand-held computing devices, terminal computing devices, mobile devices, wireless devices, various electronic devices and appliances and the like. In an illustrative embodiment, the client computing devices 102 include necessary hardware and software components for establishing communications over a communication network 108, such as a wide area network or local area network. For example, the client computing devices 102 may be equipped with networking equipment and browser software applications that facilitate communications via the Internet or an intranet. Although not illustrated in FIG. 1, each client computing device 102 utilizes some type of local DNS resolver component, such as a DNS Name server, that generates the DNS queries attributed to the client computing device. In one embodiment, the local DNS resolver component may be provide by an enterprise network to which the client computing device 102 belongs. In another embodiment, the local DNS resolver component may be provided by an Internet Service Provider (ISP) that provides the communication network connection to the client computing device 102. The content delivery environment 100 can also include a content provider 104 in communication with the one or more client computing devices 102 via the communication network 108. The content provider 104 illustrated in FIG. 1 corresponds to a logical association of one or more computing devices associated with a content provider. Specifically, the content provider 104 can include a web server component 110 corresponding to one or more server computing devices for obtaining and processing requests for content (such as Web pages) from the client computing devices 102. The content provider 104 can further include an origin server component 112 and associated storage component 114 corresponding to one or more computing devices for obtaining and processing requests for network resources from the CDN service provider. One skilled in the relevant art will appreciate that the content provider 104 can be associated with various additional computing resources, such additional computing devices for administration of content and resources, DNS name servers, and the like. For example, although not illustrated in FIG. 1, the content provider 104 can be associated with one or more DNS name server components that would be authoritative to resolve client computing device DNS queries corresponding to a domain of the content provider. With continued reference to FIG. 1, the content delivery environment 100 can further include a CDN service provider 106 in communication with the one or more client computing devices 102 and the content providers 104 via the communication network 108. The CDN service provider 106 illustrated in FIG. 1 corresponds to a logical association of one or more computing devices associated with a CDN service provider. Specifically, the CDN service provider 106 can include a number of Point of Presence (“POP”) locations 116, 122, 128 that correspond to nodes on the communication network 108. Each POP 116, 122, 128 includes a DNS component 118, 124, 130 made up of a number of DNS server computing devices for resolving DNS queries from the client computers 102. Each POP 116, 122, 128 also includes a resource cache component 120, 126, 132 made up of a number of cache server computing devices for storing resources from content providers and transmitting various requested resources to various client computers. The DNS components 118, 124 and 130 and the resource cache components 120, 126 132 may further include additional software and/or hardware components that facilitate communications including, but not limited, load balancing or load sharing software/hardware components. In an illustrative embodiment, the DNS component 118, 124, 130 and resource cache component 120, 126, 132 are considered to be logically grouped, regardless of whether the components, or portions of the components, are physically separate. Additionally, although the POPs 116, 122, 128 are illustrated in FIG. 1 as logically associated with the CDN service provider 106, the POPs will be geographically distributed throughout the communication network 108 in a manner to best serve various demographics of client computing devices 102. Additionally, one skilled in the relevant art will appreciate that the CDN service provider 106 can be associated with various additional computing resources, such additional computing devices for administration of content and resources, and the like. One skilled in the relevant art will appreciate that the components and configurations provided in FIG. 1 are illustrative in nature. Accordingly, additional or alternative components and/or configurations, especially regarding the additional components, systems and subsystems for facilitating communications may be utilized. With reference now to FIGS. 2-6, the interaction between various components of the content delivery environment 100 of FIG. 1 will be illustrated. For purposes of the example, however, the illustration has been simplified such that many of the components utilized to facilitate communications are not shown. One skilled in the relevant art will appreciate that such components can be utilized and that additional interactions would accordingly occur without departing from the spirit and scope of the present disclosure. With reference to FIG. 2, an illustrative interaction for registration of a content provider 104 with the CDN service provider 106 will be described. As illustrated in FIG. 2, the CDN content registration process begins with registration of the content provider 104 with the CDN service provider 106. In an illustrative embodiment, the content provider 104 utilizes a registration application program interface (“API”) to register with the CDN service provider 106 such that the CDN service provider 106 can provide content on behalf of the content provider 104. The registration API includes the identification of the origin server 112 of the content provider 104 that will provide requested resources to the CDN service provider 106. One skilled in the relevant art will appreciate that upon identification of appropriate origin servers 112, the content provider 104 can begin to direct requests for content from client computing devices 102 to the CDN service provider 106. Specifically, in accordance with DNS routing principles, a client computing device request corresponding to a resource identifier would eventually be directed toward a POP 116, 122, 128 associated with the CDN service provider 106. In the event that the resource cache component 120, 126, 132 of a selected POP does not have a copy of a resource requested by a client computing device 102, the resource cache component will request the resource from the origin server 112 previously registered by the content provider 104. With continued reference to FIG. 2, upon receiving the registration API, the CDN service provider 106 obtains and processes the registration information. In an illustrative embodiment, the CDN service provider 106 can then generate additional information that will be used by the client computing devices 102 as part of the content requests. The additional information can include, without limitation, client identifiers, such as client identification codes, content provider identifiers, such as content provider identification codes, executable code for processing resource identifiers, such as script-based instructions, and the like. One skilled in the relevant art will appreciate that various types of additional information may be generated by the CDN service provider 106 and that the additional information may be embodied in any one of a variety of formats. The CDN service provider 106 returns an identification of applicable domains for the CDN service provider (unless it has been previously provided) and any additional information to the content provider 104. In turn, the content provider 104 can then process the stored content with content provider specific information. In one example, as illustrated in FIG. 2, the content provider 104 translates resource identifiers originally directed toward a domain of the origin server 112 to a domain corresponding to the CDN service provider. The translated URLs are embedded into requested content in a manner such that DNS queries for the translated URLs will resolve to a DNS server corresponding to the CDN service provider 106 and not a DNS server corresponding to the content provider 104. Although the translation process is illustrated in FIG. 2, in some embodiments, the translation process may be omitted in a manner described in greater detail below. Generally, the identification of the resources originally directed to the content provider 104 will be in the form of a resource identifier that can be processed by the client computing device 102, such as through a browser software application. In an illustrative embodiment, the resource identifiers can be in the form of a uniform resource locator (“URL”). Because the resource identifiers are included in the requested content directed to the content provider, the resource identifiers can be referred to generally as the “content provider URL.” For purposes of an illustrative example, the content provider URL can identify a domain of the content provider 104 (e.g., contentprovider.com), a name of the resource to be requested (e.g., “resource.xxx”) and a path where the resource will be found (e.g., “path”). In this illustrative example, the content provider URL has the form of: http://www.contentprovider.com/path/resource.xxx During an illustrative translation process, the content provider URL is modified such that requests for the resources associated with the translated URLs resolve to a POP associated with the CDN service provider 106. In one embodiment, the translated URL identifies the domain of the CDN service provider 106 (e.g., “cdnprovider.com”), the same name of the resource to be requested (e.g., “resource.xxx”) and the same path where the resource will be found (e.g., “path”). Additionally, the translated URL can include additional processing information (e.g., “additional information”). The translated URL would have the form of: http://additional information.cdnprovider.com/path/resources.xxx In another embodiment, the information associated with the CDN service provider 106 is included in the modified URL, such as through prepending or other techniques, such that the translated URL can maintain all of the information associated with the original URL. In this embodiment, the translated URL would have the form of: http://additional information.cdnprovider.com/www.contentprovider.com/path/resource.xxx With reference now to FIG. 3, after completion of the registration and translation processes illustrated in FIG. 2, a client computing device 102 subsequently generates a content request that is received and processed by the content provider 104, such as through the Web server 110. In accordance with an illustrative embodiment, the request for content can be in accordance with common network protocols, such as the hypertext transfer protocol (“HTTP”). Upon receipt of the content request, the content provider 104 identifies the appropriate responsive content. In an illustrative embodiment, the requested content can correspond to a Web page that is displayed on the client computing device 102 via the processing of information, such as hypertext markup language (“HTML”), extensible markup language (“XML”), and the like. The requested content can also include a number of embedded resource identifiers, described above, that corresponds to resource objects that should be obtained by the client computing device 102 as part of the processing of the requested content. The embedded resource identifiers can be generally referred to as original resource identifiers or original URLs. Upon receipt of the requested content, the client computing device 102, such as through a browser software application, begins processing any of the markup code included in the content and attempts to acquire the resources identified by the embedded resource identifiers. Accordingly, the first step in acquiring the content corresponds to the issuance, by the client computing device 102 (through its local DNS resolver), of a DNS query for the Original URL resource identifier that results in the identification of a DNS server authoritative to the “.” and the “com” portions of the translated URL. After resolving the “.” and “com” portions of the embedded URL, the client computing device 102 then issues a DNS query for the resource URL that results in the identification of a DNS server authoritative to the “.cdnprovider” portion of the embedded URL. The issuance of DNS queries corresponding to the “.” and the “com” portions of a URL are well known and have not been illustrated. With reference now to FIG. 4, in an illustrative embodiment, the successful resolution of the “cdnprovider” portion of the original URL identifies a network address, such as an IP address, of a DNS server associated with the CDN service provider 106. In one embodiment, the IP address can be a specific network address unique to a DNS server component of a POP. In another embodiment, the IP address can be shared by one or more POPs. In this embodiment, a further DNS query to the shared IP address utilizes a one-to-many network routing schema, such as anycast, such that a specific POP will receive the request as a function of network topology. For example, in an anycast implementation, a DNS query issued by a client computing device 102 to a shared IP address will arrive at a DNS server component logically having the shortest network topology distance, often referred to as network hops, from the client computing device. The network topology distance does not necessarily correspond to geographic distance. However, in some embodiments, the network topology distance can be inferred to be the shortest network distance between a client computing device 102 and a POP. With continued reference to FIG. 4, in either of the above identified embodiments (or any other embodiment), a specific DNS server in the DNS component 118 of a POP 116 receives the DNS query corresponding to the original URL from the client computing device 102. Once one of the DNS servers in the DNS component 118 receives the request, the specific DNS server attempts to resolve the request. In one illustrative embodiment as shown in FIG. 4, a specific DNS server resolves the DNS query by identifying an IP address of a cache server component that will process the request for the requested resource. As described above and as will be described further below in reference to FIG. 6, a selected resource cache component can process the request by either providing the requested resource if it is available or attempt to obtain the requested resource from another source, such as a peer cache server computing device or the origin server 112 of the content provider 104. In further reference to FIG. 4, the specific DNS server can utilize a variety of information in selecting a resource cache component. In an illustrative embodiment, and as will be further described below in reference to FIGS. 7 and 8, the DNS server determines a class associated with the requesting client computing device. For example, the class can correspond to a specific geographic region to which the client computing device belongs or an internet service provider for the client computing device. Such class information can be determined from the client directly (such as information provided by the client computing device or ISP) or indirectly (such as inferred through a client computing device's IP address). Based on the class, the DNS server determines appropriate routing information. Then, for embodiments described specifically in reference to FIG. 4, the DNS server selects an appropriate resource cache component for providing content associated with the resource request based on the routing information for the determined class of the client computing device. The IP address selected by the DNS server may correspond to a specific caching server in the resource cache. Alternatively, the IP address can correspond to a hardware/software selection component (such as a load balancer). As will also be further described below, the DNS server can further utilize network performance measurements to assist in selecting specific resource cache components for the determined class. With reference now to FIGS. 5A-5C, as an alternative to selecting a resource cache component upon receipt of a DNS query as described in reference to FIG. 4, the CDN service provider 106 can maintain sets of various alternative resource identifiers. The alternative resource identifiers can be provided by the CDN service provider 106 to the client computing device 102 such that a subsequent DNS query on the alternative resource identifier will resolve to a different DNS server component within the CDN service provider's network. In an illustrative embodiment, the alternative resource identifiers are in the form of one or more canonical name (“CNAME”) records. In one embodiment, each CNAME record identifies a domain of the CDN service provider 106 (e.g., “cdnprovider.com” or “cdnprovider-1.com”). As will be explained in greater detail below, the domain in the CNAME does not need to be the same domain found in original URL or in a previous CNAME record. Additionally, each CNAME record includes additional information, such as request routing information, (e.g., “request routing information”). An illustrative CNAME record can have the form of: http://request_routing_information.cdnprovider.com In an illustrative embodiment, the CNAME records are generated and provided by the DNS servers to identify a more appropriate DNS server of the CDN service provider 106. As with selecting an appropriate resource cache component as described above in reference to FIG. 4, the DNS server receiving the initial DNS query can utilize a variety of information to select a more appropriate DNS server of the CDN service provider 106 to resolve the resource request. In an illustrative embodiment, and as will also be further described below in reference to FIGS. 7 and 8, the DNS server determines a class associated with the requesting client computing device. Again, the class can, for example, correspond to a specific geographic region to which the client computing device belongs or an internet service provider for the client computing device. In any case, the DNS server may obtain class information from the client directly (such as information provided by the client computing device or ISP) or indirectly (such as inferred through a client computing device's IP address). Based on the class, the DNS server determines appropriate routing information. Then, for the embodiments described specifically in reference to FIG. 5A, the DNS server selects an appropriate alternative DNS server for use in resolving the resource request based on the routing information for the determined class of the client computing device. As will also be further described below, the DNS server can further utilize network performance measurements to select specific alternative DNS servers for the determined class. In accordance with an illustrative embodiment, the DNS server maintains a data store that defines CNAME records for various original URLs. If a DNS query corresponding to a particular original URL matches an entry in the data store, the DNS server returns a CNAME record as defined in the data store. In an illustrative embodiment, the data store can include multiple CNAME records corresponding to a particular original URL. The multiple CNAME records would define a set of potential candidates that can be returned to the client computing device. In such an embodiment, the DNS server, either directly or via a network-based service, selects one of the CNAME records defined in the data store as more appropriate routing information based on logic that factors a determined class of the requesting client computing device. It will be appreciated by one skilled in the art and others that the DNS server can implement further additional logic in selecting an appropriate CNAME from a set of possible of CNAMEs. In an illustrative embodiment, each DNS server component 118, 124, 130 maintains the same data stores that define CNAME records, which can be managed centrally by the CDN service provider 106. Alternatively, each DNS server component 118, 124, 130 can have POP specific data stores that define CNAME records, which can be managed centrally by the CDN service provider 106 or locally at the POP 116, 122, 128. Still further, each DNS server computing device within the DNS server components 118, 124, 130 can utilize shared data stores managed by a respective POP or a local data store specific to an individual DNS server computing device. The returned CNAME can also include request routing information that is different from or in addition to the information provided in URL/CNAME of the current DNS query. For example, if the CNAME selection is based on a class associated with the requesting client computing device, a specific class can be identified in the “request_routing_information” portion of the specific CNAME record. A similar approach could be taken to identify service level plans and file management by including a specific identifier in the “request_routing_information” portion of the CNAME record. In another embodiment, request routing information can be found in the identification of a CDN service provider 106 domain different from the domain found in the current URL/CNAME. For example, if the CNAME is based on a regional plan, a specific regional plan domain (e.g., “cdnprovider-regionl.com”) could be used in the domain name portion of the specific CNAME record. Any additional request routing information can be prepended to the existing request routing information in the current URL/CNAME such that the previous request routing information would not be lost (e.g., http://serviceplan.regionalplan.cdnprovider.com). One skilled in the relevant art will appreciate that additional or alternative techniques and/or combination of techniques may be used to include the additional request routing information in the CNAME record that is selected by the DNS server component 118. With continued reference to FIG. 5A, one skilled in the relevant art will appreciate that the DNS server may select (or otherwise obtain) a CNAME record that is intended to resolve to a more appropriate DNS server of the CDN service provider 106. It may be possible, however, that the same DNS server would also be authoritative for the subsequent DNS query for the CNAME to be provided to the client computing device. For example, a specific DNS server may be authoritative for both a specific regional plan and a service level plan. Thus, returning a CNAME would still result in the DNS query arriving at the same DNS query (which may also be due in part to the client computing device's geography). In such an embodiment, the DNS server, such as DNS server component 118, may choose to resolve the future DNS query in advance. With reference now to FIG. 5B, upon receipt of the CNAME from the DNS server component 118, the client computing device 102 generates a subsequent DNS query corresponding to the CNAME. As previously discussed with regard to FIG. 4, the DNS query process could first start with DNS queries for the “.” and “com” portions, followed by a query for the “cdnprovider” portion of the CNAME. To the extent, however, that the results of a previous DNS queries can be cached (and remain valid), the client computing device 102 can utilize the cached information and does not need to repeat the entire process. However, at some point, depending on whether the CNAME provided by DNS server component 118 (FIG. 5A) and the previous URL/CNAME share common CDN service provider domains, the current CNAME DNS query resolves to a different POP provided by the CDN service provider 106. As illustrated in FIG. 5B, the DNS server component 124 of POP 122 receives the current CNAME based on the different information in the current CNAME previously provided by the DNS server component 118. As previously described, the DNS server component 124 can then determine whether to resolve the DNS query on the CNAME with an IP address of a cache component that will process the content request or whether to provide another alternative resource identifier selected in the manners described above. For purposes of illustration, assume that the DNS server component 118 determines that the DNS query corresponding to the current CNAME (provided by DNS server component 116) also corresponds to a CNAME record in its data store. In such an example, the DNS server component 124 would do any necessary processing to select a specific CNAME as described above and return the CNAME to the client computing device. With reference now to FIG. 5C, the client computing device 102 would now transmit a second subsequent DNS query corresponding to the CNAME provided by DNS server component 124 (FIG. 5B). In accordance with DNS query processes already described, the DNS query would illustratively be received by the DNS server component 130 of POP 128. Again, the DNS server component 130 can then determine whether to resolve the DNS query on the CNAME with an IP address of a cache component that will process the content request or whether to provide another alternative resource identifier selected in the manners described above. In this example, the DNS server component 130 returns an IP address. With continued reference to FIG. 5C, in an illustrative embodiment, the DNS server components, such as DNS server component 130, can utilize a variety of information in selecting a resource cache component. In one example, the DNS server component can default to a selection of a resource cache component of the same POP. In another example, the DNS server components can select a resource cache component based on various load balancing or load sharing algorithms. Still further, the DNS server components can utilize network performance metrics or measurements to assign specific resource cache components. Yet further, the DNS server components can select a resource cache component based on routing information for a class of the requesting client computing device as described in reference to FIG. 4. Again, the IP address selected by a DNS server component may correspond to a specific caching server in the resource cache. Alternatively, the IP address can correspond to a hardware/software selection component (such as a load balancer). With reference now to FIG. 6, in an illustrative example, assume that the DNS server component 130 has selected the resource cache component 132 of POP 128. Upon receipt of the IP address for the resource cache component 132, the client computing device 102 transmits requests for the requested content to the resource cache component 132. The resource cache component 132 processes the request in a manner described above and the requested content is transmitted to the client computing device 102. With reference now to FIG. 7, one embodiment of a routine 700 implemented by the CDN service provider 106 for processing a resource request will be described. One skilled in the relevant art will appreciate that actions/steps outlined for routine 700 may be implemented by one or many computing devices/components that are associated with the CDN service provider 106. Accordingly, routine 700 has been logically associated as being generally performed by the CDN service provider 106, and thus the following illustrative embodiments should not be construed as limiting. Routine 700 can apply to embodiments described both in reference to FIG. 4 and FIGS. 5A-5C. As such, routine 700 will first be described in reference to embodiments corresponding to selecting resource cache components at DNS servers based on routing information for a class of the requesting client computing device, as generally described in reference to FIG. 4. At block 702, one of the DNS server components 118, 124, 130 receives a DNS query corresponding to a resource identifier. As previously discussed, the resource identifier can be a URL that has been embedded in content requested by the client computing device 102 and previously provided by the content provider 104. The DNS server determines a class of the requesting client associate with the DNS query at block 704. As mentioned above, the class can, for example, correspond to a specific geographic region to which the client computing device belongs or an internet service provider for the client computing device. Such class information can be determined from the client directly (such as information provided by the client computing device or ISP) or indirectly (such as inferred through a client computing device's IP address). In an illustrative embodiment, the determination of class at block 704 can specifically include associating the requesting client computing device to a cluster of other client computing devices based on a variety of criteria. Such criteria can include geographic region and internet service provider data, as mentioned above, in addition to routing path information, networking equipment, client sponsored service level agreements, content provider service level agreements, and the like. At a decision block 706, a test is conducted to determine whether the current DNS server is authoritative to resolve the DNS query. In an illustrative embodiment, the DNS server can determine whether it is authoritative to resolve the DNS query if there are no CNAME records corresponding to the received resource identifier. In this illustrative embodiment, there are no CNAME records. Accordingly, the routine continues at block 708 where, in general, the current DNS server determines routing information for the determined class. Specifically, in an illustrative embodiment, the DNS server selects an appropriate resource cache component for providing content associated with the resource request based on routing information for the determined class of the client computing device. The DNS server then provides the IP address of the selected resource cache component to the client computing device. In an illustrative embodiment, the routing information can be a list of resource cache components that can service the content request for a particular class of client computing devices. The DNS server can use a variety of logic to select a resource cache component from the list. In one embodiment, a probability of selecting each resource cache component on the list can be defined, and the DNS server selects a resource cache component based on these probabilities. Accordingly, in this illustrative embodiment, a DNS server will select a resource cache component on a frequency corresponding to the determined probabilities. For example, the DNS server will most frequently select the resource cache component with the highest probability of selection, but can also, at times, select a resource cache component with a lower probability of selection. In this case, the probabilities correspond to anticipated performance of the selected computing device. As will be described further below, the CDN service provider 106 can monitor performance of delivering requested resources to clients in a particular class and thereafter update the routing information (e.g., probabilities) accordingly. In another embodiment, the probabilities can correspond to load shedding or other network traffic mitigation. By periodically selecting a non-preferred resource cache component and monitoring its performance for the class, the CDN service provider 106 can thus determine if changes to the routing information for the class are desirable. It will be appreciated by one skilled in the relevant art that a number of algorithms or selection logic can be used for selecting a resource cache component to service the resource request from a particular class of client computing devices. For example, in addition to the frequency-based reinforcement algorithm described above, the DNS server may implement alternative reinforcement learning algorithms. Examples of other reinforcement algorithms include, but are not limited to, algorithms such as State-Action-Reward-State-Action (SARSA), Q-learning, delayed Q-learning, and the like. Additionally, other machine learning approaches, such as support vector machines, neural networks, Bayesian engines, etc. may be utilized in conjunction with a DNS server to select the appropriate resource cache component. Next, embodiments in which routing information for a class of the requesting client computing device is used to select an appropriate DNS server for processing the request will be described. In such embodiments, routine 700 similarly commences at block 702 where one of the DNS server components 118, 124, 130 receives a DNS query corresponding to a resource identifier. As described above, the DNS server further determines a class of the requesting client computing device associated with the DNS query at block 704. At decision block 706, a test is conducted to determine whether the current DNS server is authoritative to resolve the DNS query. In an illustrative embodiment, the DNS server can determine whether it is authoritative to resolve the DNS query if there are no CNAME records corresponding to the received resource identifier. Alternative or additional methodologies may also be practiced to determine whether the DNS server is authoritative. If the current DNS server is authoritative (including a determination that the same DNS server will be authoritative for subsequent DNS queries), the current DNS server resolves the DNS query by returning the IP address of cache server component. In a non-limiting manner, a number of methodologies for selecting an appropriate resource cache component have been previously discussed. Additionally, as described above, the IP address may correspond to a specific cache server of a resource cache component or generally to group of cache servers. Alternatively, if at decision block 704 the DNS server is not authoritative, at block 708, the DNS server component selects and transmits an alternative resource identifier. As described above, the DNS server component can utilize a data store to identify a set of potential candidate CNAMES as a function of the current DNS query. The DNS server then, either directly or via a network-based service, selects one of the CNAME records defined in the data store as more appropriate routing information based on logic that factors a determined class of the requesting client computing device. At block 710, different DNS server components 118, 124, 130 receive a DNS query corresponding to the CNAME. The routine 700 then returns to decision block 704 and continues to repeat as appropriate. In an illustrative embodiment, where the DNS server is not authoritative, the routing information can be a set or list of potential candidate CNAMES which correspond to one or more DNS servers that can service the content request for a particular class of client computing devices. Similar to selecting a cache resource component as described above, the DNS server can use a variety of logic to select a CNAME, or another DNS server, from the list. In one embodiment, a probability of selecting each CNAME in the set can be initially defined in a number of ways, and the DNS server selects a CNAME based on the defined probabilities. Accordingly, in this illustrative embodiment, a DNS server will most frequently select the CNAME with the highest probability of selection, but can also, at times, select a CNAME with a lower probability of selection. In this case, the probabilities correspond to anticipated performance of the corresponding computing device. As will be described further below, the CDN service provider 106 can monitor performance of delivering requested resources to clients in a particular class and thereafter update the probabilities. Again, in further embodiments, the probabilities can correspond to load shedding or other network traffic mitigation. By periodically selecting a non-preferred CNAME and monitoring performance of the corresponding DNS server for the class, the CDN service provider 106 can thus determine if changes to the routing information for the class are desirable. It will be appreciated by one skilled in the relevant art that a number of algorithms or selection logic can be used for selecting a CNAME/DNS server to service the resource request from a particular class of client computing devices. With reference now to FIG. 8, one embodiment of a request routing routine 800 for updating routing information will be described. One skilled in the relevant art will appreciate that actions/steps outlined for routine 800 may be implemented by one or many computing devices/components that are associated with the CDN service provider 106. Accordingly, routine 800 has been logically associated as being performed by the CDN service provider 106. At a block 802, a first DNS server of the CDN service provider 106 receives a DNS query corresponding to a requested resource from a client computing device. As similarly described above in reference to block 704 of FIG. 7, the DNS server at block 804 determines a class corresponding to the requesting client and associated with the DNS query. Also at block 804, the DNS server determines either DNS or cache routing information based on the determined class of the client computing device as similarly described above. The routine 800 continues at block 806 where network performance criteria associated with delivery of the requested resource is monitored. The network performance criteria can correspond to measurements of network performance for transmitting data from the CDN service provider POPs to the client computing device 102. In one embodiment, network data transfer latencies associated with the delivery of the requested resource are measured by the client computing device 102. Alternatively, the CDN service provider 106, such as through the resource cache component, can measure the performance as part of providing content to a client computing device. Such network performance data can be managed and maintained globally by the CDN service provider and shared with the DNS servers of the CDN or individually by the DNS servers of the CDN service provider. Moreover, network performance criteria can be provided as a batch process from POPs or sent in response to a request from one POP to another. With continued reference to FIG. 8, at a test block 808, a determination is made as to whether an update to the routing information for the identified class is needed based on the performance data. In one embodiment, the update determination can be made by the CDN service provider globally or by the individual DNS service components or DNS servers. In an illustrative embodiment where individual DNS servers determine whether to update routing information for a class, each DNS server can manage and maintain routing information for the identified class unique to the particular DNS server. In this illustrative embodiment, the performance data can be maintained globally by the CDN service provider and shared with the DNS components and/or DNS servers, with each DNS component and/or DNS server managing how the performance data is used. Accordingly, routing information for a class may vary from one DNS component/server to another. Returning to FIG. 8, if an update is needed, the routing information for the identified class is modified at block 810. In one embodiment, the CDN service provider 106 modifies a list of computing devices (e.g. DNS components/servers and/or resource cache components) for servicing a resource request from a particular class of client computing devices 102. In another embodiment, the CDN service provider and/or specific DNS components/servers can maintain and modify probabilities of selection of particular computing devices for servicing a resource request for a class of client computing devices. For example, if performance data indicates that a DNS server and/or a resource cache component which has a lower probability of selection has performed well, the probability of selection may be increased so that the particular DNS server and/or resource cache component will be selected more frequently for servicing a resource request from a client computing device. After a modification has been made at block 810, or if an update is not needed at block 808, the routine 800 returns to block 802 for further processing as described above. It will be appreciated by one skilled in the relevant art that there are a number of ways to modify the routing information associated with requests from a class of client computing devices. It will further be appreciated by one skilled in the relevant art that the timing at which performance is monitored and updates to routing information are made can vary. It will be appreciated by those skilled in the art and others that all of the functions described in this disclosure may be embodied in software executed by one or more processors of the disclosed components and mobile communication devices. The software may be persistently stored in any type of non-volatile storage. Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment. Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached FIGURES should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art. It will further be appreciated that the data and/or components described above may be stored on a computer-readable medium and loaded into memory of the computing device using a drive mechanism associated with a computer readable storing the computer executable components such as a CD-ROM, DVD-ROM, or network interface further, the component and/or data can be included in a single device or distributed in any manner. Accordingly, general purpose computing devices may be configured to implement the processes, algorithms and methodology of the present disclosure with the processing and/or execution of the various data and/or components described above. It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims. 1. A computer-implemented method comprising: as implemented by one or more computing devices of a content delivery network (CDN) service, the one or more computing devices configured with specific executable instructions, obtaining a Domain Name System (DNS) query from a client computing device at a first DNS server, wherein the DNS query corresponds to a requested resource and wherein the first DNS server corresponds to the CDN service; determining a class of the client computing device associated with the DNS query; and monitoring performance associated with delivery of the requested resource; determining whether an update to routing information for the class is needed based on the delivery performance; and if so, modifying the routing information for the class. 2. The method as recited in claim 1, wherein the routing information includes identification of a plurality of cache components, and for individual cache components, information associated with a probability of selection of the individual cache component for delivery of the requested resource. 3. The method as recited in claim 1, wherein the routing information includes a probability of selection of individual DNS servers used for processing the resource request for the determined class. 4. The method as recited in claim 1, wherein determining whether an update to the routing information for the class is needed based on the delivery performance comprises comparing a probability of selection of a first DNS server and other DNS servers. 5. The method as recited in claim 4, wherein modifying the routing information for the class comprises increasing the probability of selection of a DNS server having a lower probability of selection so that the DNS server having a lower probability of selection will be selected more frequently for processing a resource request for the determined class. 6. The method of claim 1 further comprising: determining whether the first DNS server is authoritative to resolve the DNS query; and if not, selecting a second DNS server for processing the resource request based on the routing information for the determined class. 7. The method as recited in claim 6, wherein determining whether an update to the routing information for the class is needed based on the delivery performance comprises monitoring performance associated with delivery of the requested resource using the second DNS server. 8. The method as recited in claim 7, wherein modifying the routing information for the class comprises modifying the routing information for the class based on the delivery performance of the requested resource using the second DNS server. 9. The method as recited in claim 8, wherein modifying the routing information for the class comprises modifying a list of DNS servers for processing the resource request for the determined class. 10. The method as recited in claim 8, wherein modifying the routing information for the class comprises modifying probabilities of selection of particular DNS servers used for processing the resource request for the determined class. 11. A system comprising: a first network point of presence associated with a content delivery network (CDN) service, wherein the first network point of presence includes a Domain Name System (DNS) server that receives a DNS query from a client computing device, wherein the DNS query corresponds to a requested resource, and wherein the DNS server in the first network point of presence is associated with a memory and operative to: determine a class of the client computing device associated with the DNS query; monitor performance associated with delivery of the requested resource; determine whether an update to routing information for the class is needed based on the delivery performance; and if so, modify the routing information for the class. 12. The system as recited in claim 11, wherein the routing information includes identification of a plurality of cache components, and for individual cache components, information associated with a probability of selection of the individual cache component for delivery of the requested resource. 13. The system as recited in claim 11, wherein the routing information includes a probability of selection of individual DNS servers used for processing the resource request for the determined class. 14. The system as recited in claim 11, wherein determining whether an update to the routing information for the class is needed based on the delivery performance comprises comparing a probability of selection of a first DNS server and other DNS servers. 15. The system as recited in claim 14, wherein modifying the routing information for the class comprises increasing the probability of selection of a DNS server having a lower probability of selection so that the DNS server having a lower probability of selection will be selected more frequently for processing a resource request for the determined class. 16. The system of claim 11, wherein the DNS server in the first network point of presence is further operative to: determine whether the first DNS server is authoritative to resolve the DNS query; and if not, select a second DNS server for processing the resource request based on the routing information for the determined class. 17. The system as recited in claim 16, wherein determining whether an update to the routing information for the class is needed based on the delivery performance comprises monitoring performance associated with delivery of the requested resource using the second DNS server. 18. The system as recited in claim 17, wherein modifying the routing information for the class comprises modifying the routing information for the class based on the delivery performance of the requested resource using the second DNS server. 19. The system as recited in claim 18, wherein modifying the routing information for the class comprises modifying a list of DNS servers for processing the resource request for the determined class. 20. The system as recited in claim 18, wherein modifying the routing information for the class comprises modifying probabilities of selection of particular DNS servers used for processing the resource request for the determined class. 21. A non-transitory, computer-readable storage medium having computer-executable modules for processing a Domain Name System (DNS) query from a client computing device, the DNS query corresponding to a requested resource, the computer-executable modules comprising: one or more modules configured to: determine a class of the client computing device associated with the DNS query; monitor performance associated with delivery of the requested resource; determine whether an update to routing information for the class is needed based on the delivery performance; and if so, modify the routing information for the class. 22. The non-transitory, computer-readable storage medium as recited in claim 21, wherein the routing information includes identification of a plurality of cache components, and for individual cache components, information associated with a probability of selection of the individual cache component for delivery of the requested resource. 23. The non-transitory, computer-readable storage medium as recited in claim 21, wherein the routing information includes a probability of selection of individual DNS servers used for processing the resource request for the determined class. 24. The non-transitory, computer-readable storage medium as recited in claim 21, wherein determining whether an update to the routing information for the class is needed based on the delivery performance comprises comparing a probability of selection of a first DNS server and other DNS servers. 25. The non-transitory, computer-readable storage medium as recited in claim 24, wherein modifying the routing information for the class comprises increasing the probability of selection of a DNS server having a lower probability of selection so that the DNS server having a lower probability of selection will be selected more frequently for processing a resource request for the determined class.

2014-04-28

en

2014-08-21

US-201816122890-A

Temperature measurement correction method, electronic system and method of generating correction regression coefficient table ABSTRACT A temperature measurement correction method for a temperature detection device is provided. The temperature detection device includes a case and a focal plane array module disposed on an inner of the case. The temperature measurement correction method includes measuring an ambient temperature, a temperature of the case and a temperature of the focal plane array module, determining a plurality of radiometric regression coefficients according to the ambient temperature, the temperature of the case and the temperature of the focal plane array module, utilizing the temperature detection device to sense infrared energy radiated from an object to generate an electrical signal, and calculating an actual temperature value of the object according to the plurality of radiometric regression coefficients and the electrical signal. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a temperature measurement correction method, an electronic system and a method of generating correction regression coefficient table, and more specifically to a temperature measurement correction method, electronic system and method of generating correction regression coefficient table capable of improving the measurement accurately. 2. Description of the Prior Art Infrared in the prior art possesses strong transmittance and is able to be applied in a great variety of aspects, such as communication, medical, probing, military, etc. For applications not related to the atmospheric window, the infrared is usually utilized in a gas sensor to sense the absorption wavelengths of particular gases and further determine whether there is gas leaking according to the gas concentration. If the infrared is applied in an imaging system, the selected wavelength of the infrared is usually between 8 micrometers and 15 micrometers because the infrared within the waveband needs no further irradiation and can be used at room temperature without additional cooling processes to suppress noise. Moreover, the peak of the black body radiation wavelength from a human is around 10 micrometers. Thus, the infrared is able to be applied to military purposes of shooting combat for a single soldier at night, and for the purposes of people's livelihood, the infrared can be applied to vision assistance on automobile electronics at night, for example, auto-piloting. Therefore, infrared sensing technology has been widely used in various fields. An uncooled thermal camera usually uses a focal plane array of a microbolometer to receive thermal radiation energy and a readout circuit measures the corresponding electrical signal according to the resistance change produced by variations of the component characteristics in the focal plane array. The measured corresponding electrical signal is used for calculating the actual measured temperature. However, the measurement error of the measured electrical signal due to the process variations of the sensor and the influence of the focal plane array temperature may cause inaccurate temperature measurements. A conventional shutter-based offset correction method controls the switch operation of the optical shutter to improve thermal drift influence and measurement accuracy. However, the drawback of the conventional shutter shutter-based offset correction method is that requires additional shutter hardware for performing correction in a small size sensor. Another offset correction method is shutter-less offset correction method. The conventional shutter-less offset correction method needs to calculate multi-order equations (e.g., multiple 2-order and 3-order equations) for correcting the temperature measurement drift caused by different thermal factors. However, calculating the complex equations requires consuming much system resource and computation time. Thus, there is a need for improvement of the prior art. SUMMARY OF THE INVENTION It is therefore a primary objective of the present invention to provide a temperature measurement correction method, an electronic system and a method of generating correction regression coefficient table capable of improving the measurement accurately, so as to solve the above mentioned problems. The present invention provides a temperature measurement correction method, for a temperature detection device, the temperature detection device comprising a case and a focal plane array module disposed on an inner of the case, the temperature measurement correction method comprising: measuring an ambient temperature, a temperature of the case and an operation temperature of the focal plane array module; determining a plurality of radiometric regression coefficients according to the ambient temperature, the temperature of the case and the operation temperature of the focal plane array module; utilizing the temperature detection device to sense infrared energy radiated from an object to generate an electrical signal; and calculating an actual temperature value of the object according to the plurality of radiometric regression coefficients and the electrical signal. The present invention further provides an electronic system, comprising: a first temperature detection device, comprising: a case; and a focal plane array module, disposed on an inner of the case, comprising: a focal plane array comprising a plurality of infrared sensors for sensing infrared energy radiated from an object; and a readout circuit, for generating an electrical signal in response to the sensed infrared energy sensed by the infrared sensor of the focal plane array; a second temperature detection device, for measuring an ambient temperature, a temperature of the case and an operation temperature of the focal plane array module; and a processor circuit, for determining a plurality of radiometric regression coefficients according to the ambient temperature, the temperature of the case and the operation temperature of the focal plane array module, and calculating an actual temperature value of the object according to the plurality of radiometric regression coefficients and the electrical signal. The present invention further provides a method of generating a correction regression coefficient table, for a temperature detection device, the temperature detection device comprising a case and a focal plane array module disposed on an inner of the case, the method comprising: in the same measurement environment, utilizing the temperature detection device to measure objects at different temperatures to generate a plurality of electronic signal; calculating radiometric regression coefficients corresponding to measurement environment according to the plurality of electronic signals and a black body radiation equation; and storing the radiometric regression coefficients corresponding to measurement environment so as to establish a correction regression coefficient table. These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a schematic diagram of an electronic system according to an embodiment of the present invention. FIG. 2 is a schematic diagram of a temperature correction procedure according to an embodiment of the present invention. FIG. 3 is a schematic diagram of a generating procedure of a correction regression coefficient table according to an embodiment of the present invention. FIG. 4 is a schematic diagram illustrating a correction regression coefficient table according to an embodiment of the present invention. FIG. 5 and FIG. 6 are schematic diagrams illustrating the measurement environment, the correction radiometric regression coefficients and the calculated temperature according to embodiments of the present invention. DETAILED DESCRIPTION Please refer to FIG. 1, which is a schematic diagram of an electronic system 1 according to an embodiment of the present invention. The electronic system 1 includes temperature detection devices 10 and 20, a processor circuit 30 and a storage device 40. The temperature detection device 10 includes a case 102 and a focal plane array (FPA) module 104. The FPA module 104 is disposed on an inner of the case 102. The case 102 is utilized for supporting the FPA module 104. The FPA module 104 includes an FPA 1042 and a readout circuit 1044. The FPA 1042 includes a plurality of infrared (IR) sensors (not shown in figures). The IR sensors of the FPA 1042 can be utilized for sensing infrared energy radiated from an object. The readout circuit 1044 is utilized for generating an electrical signal in response to the sensed infrared energy sensed by the IR sensor of the FPA 1042. For example, the IR sensor of the FPA 1042 absorbs infrared energy radiated from an object under test and characteristics of the IR sensor may change in response to the absorbed infrared energy. Accordingly, the readout circuit 1044 generates a corresponding electrical signal according to the infrared energy sensed by the IR sensor. The electrical signal generated by the readout circuit 1044 may be a voltage signal, a current signal or any other electrical signal. The electrical signal generated by the readout circuit 1044 can be provided to the processor circuit 30 for the following operation. The electrical signal generated by the readout circuit 1044 can also be converted to a digital signal magnitude (amplitude) value for the following operation. The temperature detection device 10 can be an uncooled thermal camera. The temperature detection device 10 can be a microbolometer-based sensor device, and the IR sensor of the FPA 1042 can be a microbolometer sensor, but not limited thereto. In addition, the temperature detection device 10 can be a cooled thermal camera. The temperature detection device 20 is utilized for measuring an ambient temperature, a temperature of the case 102 and an operation temperature of the FPA module 104. For example, the temperature of the case 102 can be an internal temperature or an external temperature of the case 102 of the temperature detection device 10. The operation temperature of the FPA module 104 can be a temperature of the internal component of the IR sensor of the FPA 1042, a temperature of the internal component of the readout circuit 1044 or a temperature of the related component of the FPA module 104. In addition, the temperature detection device 20 may include at least one temperature sensor for measuring the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. For example, the temperature detection device 20 includes a temperature sensor for measuring the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. For example, according to actual measurement environment requirements, the temperature detection device 20 may include a plurality of temperature sensors respectively disposed on at least one of the environment of the electronic system 1, the case 102 and the FPA module 104 for measuring the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. The temperature detection device 20 can be thermocouple sensor, a resistance temperature sensor (RTD), a thermistor sensor or combinations thereof, but not limited thereto. In an embodiment, compared with the temperature detection device 10, the temperature detection device 20 can be implemented by using low cost sensors. The processor circuit 30 is utilized for determining a plurality of radiometric regression coefficients according to the ambient temperature, the temperature of the case 102 and the temperature of the FPA module 104 and calculating an actual temperature value of the object under test according to the plurality of radiometric regression coefficients and the electrical signal generated by the temperature detection device 10. The storage device 40 is utilized for storing a correction regression coefficient table. The correction regression coefficient table stores radiometric regression coefficients corresponding to the combinations of the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. In brief, the electronic system 1 of the embodiments can adjust the radiometric regression coefficients according to the ambient temperature, the temperature of the case 102 and the temperature of the FPA module 104 and accordingly calculate an actual temperature value of the object under test, so as to reduce the sensor offset of the temperature detection device 10 and improve the accuracy of measurement. For an illustration of the operations of the electronic system 1, please refer to FIG. 2. FIG. 2 is a schematic diagram of a procedure 2 according to an exemplary embodiment of the invention. The procedure 2 includes the following steps: Step S200: Start. Step S202: Measure an ambient temperature, a temperature of the case 102 and an operation temperature of the FPA module 104. Step S204: Determine radiometric regression coefficients according to the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. Step S206: Utilize the temperature detection device 10 to sense infrared energy radiated from an object to generate an electrical signal. Step S208: Calculate an actual temperature value of the object according to the radiometric regression coefficients and the electrical signal. Step S210: End According to the procedure 2, in Step S202, the temperature detection device 20 measures an ambient temperature, a temperature of the case 102 and an operation temperature of the FPA module 104, and the measured ambient temperature, the measured temperature of the case 102 and the measured operation temperature of the FPA module 104 can be provided to the processor circuit 30. In Step S204, the processor circuit 30 determines radiometric regression coefficients (e.g., radiometric regression coefficients R, B, F and O) according to the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. For example, the processor circuit 30 determines radiometric regression coefficients according to a preset correction regression coefficient table, and the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104 measured by the temperature detection device 20 in Step S202. For example, the storage device 40 stores a correction regression coefficient table. The correction regression coefficient table includes radiometric regression coefficients for each set of the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. The correction regression coefficient table is associated with a calculation result calculated based on that the electrical signals are generated when the temperature detection device measures the objects at different temperatures and at least one of radiometric regression coefficients is set as a fixed value. Therefore, the processor circuit 30 can query the correction regression coefficient table to obtain (read) the radiometric regression coefficients corresponding to the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104 measured by the temperature detection device 20 measured in Step S202. In other words, the processor circuit 30 can select different radiometric regression coefficients depending on the temperature information of the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. In Step S206, the temperature detection device 10 is configured to sense infrared energy radiated from the object under test to generate an electrical signal. That is, under such an environment that the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104 are measured by the temperature detection device 20 in Step S202, the temperature detection device 10 senses infrared energy radiated from the object under test and accordingly generates the electrical signal. In Step S208, the processor circuit 30 is configured to calculate the actual temperature value of the object under test according to the plurality of the radiometric regression coefficients obtained in Step S204 and the electrical signal generated by the temperature detection device 10 in Step S206. For example, suppose the processor circuit 30 determines four radiometric regression coefficients R, B, F, O according to the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. After that, the IR sensors of the FPA 1042 absorb infrared energy radiated from the object under test. The readout circuit 1044 generates a voltage signal according to the sensed infrared energy sensed by the IR sensors and the generated voltage signal is converted to a digital measured voltage value VD. The actual temperature value TO of the object under test can be calculated by the processor circuit 30 according to the Planck curve approximate equation. The Planck curve approximate equation can be expressed as follows: Where VD represents the measured voltage value measured by the temperature detection device 10, R, B, F and O are radiometric regression coefficients. For example, the radiometric regression coefficient R represents the system response of the received external energy of the temperature detection device 10. The radiometric regression coefficient B represents an absorption spectrum parameter of the temperature detection device 10. The radiometric regression coefficient F represents a nonlinear correction parameter of the temperature detection device 10. The radiometric regression coefficient O represents an offset parameter of the temperature detection device 10. TO represents the actual temperature of the object under test. An inverse function of equation (1) can be expressed as follows: Therefore, the processor circuit 30 substitutes the measured voltage value VD measured by the temperature detection device 10 and the radiometric regression coefficients determined in Step S204 into equation (2) to calculate the actual temperature TO of the object under test. In other words, by substituting the electrical signal generated based on the sensed infrared energy sensed by the temperature detection device 10 and the radiometric regression coefficients determined based on the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104 into equation (2), the actual temperature TO of the object under test can be obtained by calculating the solution of equation (2). The operation of generating a correction regression coefficient table may be summarized as a procedure 3. Please refer to FIG. 3, which is a schematic diagram of a procedure 3 according to an embodiment of the present invention. The procedure 3 includes the following steps: Step S300: Start. Step S302: Measure objects at different temperatures in the same measurement environment to generate a plurality of electronic signals. Step S304: Calculate radiometric regression coefficients corresponding to measurement environment according to the plurality of electronic signals and black body radiation equation. Step S306: Store radiometric regression coefficients corresponding to measurement environment so as to establish correction regression coefficient table. Step S308: End. According to the procedure 3, in Step S302, for establishing a correction regression coefficient table, the temperature detection device 10 is configured to measure objects at different temperatures in the same measurement environment to generate a plurality of electronic signals. The measured electronic signals are provided to the processor circuit 30. Conditions of the measurement environment may include that the ambient temperature is at a first temperature, the temperature of the case 102 is at a second temperature and the operation temperature of the FPA module 104 is at a third temperature. For example, the electronic system 1 operates in a measurement environment that the ambient temperature is TA1, the temperature of the case 102 is TC1 and the operation temperature of the FPA module 104 is TF1, the temperature detection device 10 measures a first object having a temperature of T1 to generate a measured voltage value VD1. The electronic system 1 operates in the measurement environment that the ambient temperature is TA1, the temperature of the case 102 is TC1 and the operation temperature of the FPA module 104 is TF1, the temperature detection device 10 measures a second object having a temperature of T2 to generate a measured voltage value VD2. The temperature T1 is different from the temperature T2. In Step S304, the processor circuit 30 calculates the radiometric regression coefficients corresponding to the measurement environment according to the electronic signals measured in Step S302 and a black body radiation equation. For example, since at least one radiometric regression coefficient is a fixed value, the radiometric regression coefficients corresponding to the measurement environment can be calculated by the processor circuit 30 according to equation (1). For example, suppose the radiometric regression coefficients B1 and F1 are fixed values respectively. By substituting the measured voltage value VD1 and the temperature T1 of the first object into equation (1), the following equation is obtained: Where R′ and O1′ represent the corrected radiometric regression coefficients. By substituting the measured voltage value VD2 and the temperature T2 of the second object into equation (1), the following equation is obtained: Where R′ and O1′ represent the corrected radiometric regression coefficients. Since the radiometric regression coefficient B1 and F1 are fixed values and the measured voltage value VD1, the temperature T1 of the first object, the measured voltage value VD2 and the temperature T2 of the second object are known, the corrected radiometric regression coefficients R′ and O1′ can be obtained by calculating the solutions of the simultaneous equations (3) and (4). Please refer to FIG. 4, which is a schematic diagram illustrating a correction regression coefficient table according to an embodiment of the present invention. The processor circuit 30 can set the radiometric regression coefficient B1 and F1 and the corrected radiometric regression coefficients R′ and O1′ as the correction radiometric regression coefficients corresponding to the measurement environment since the measurement environment includes the following conditions: the ambient temperature is TA1, the temperature of the case 102 is TC1 and the operation temperature of the FPA module 104 is TF1. In Step S306, a correction regression coefficient table can be established according to information of the measurement environment and the corresponding correction radiometric regression coefficients. The processor circuit 30 can store the correction radiometric regression coefficients of each measurement environment into the storage device 40 so as to establish the correction regression coefficient table. The correction regression coefficient table can be stored in a lookup table available in the storage device 40. For example, as shown in FIG. 4, the corresponding correction radiometric regression coefficients can be calculated since the correction radiometric regression coefficient B is a fixed value B1 and the correction radiometric regression coefficient F is a fixed value F1. In brief, for different measurement environments, the invention can establish correction radiometric regression coefficients corresponding to each measurement environment according to the procedure 3. Each measurement environment has the corresponding correction radiometric regression coefficients. After the correction regression coefficient table is established and stored in the storage device 40, the electronic system 1 can utilize the temperature detection device 10 to measure temperature of the object. In more detail, according to the procedure 2, the temperature detection device 20 measures the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104. The processor circuit 30 query the correction regression coefficient table to obtain the corresponding radiometric regression coefficients corresponding to the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104 measured by the temperature detection device 20. After that, the temperature detection device 10 senses infrared energy radiated from the object under test and generates the corresponding electrical signal. By substituting the measured electrical signal and the obtained radiometric regression coefficients into equation (2), a high accuracy actual temperature of the object under test can be obtained. In an embodiment, take a narrow temperature range as an example, for example, black body radiation source's temperature range is from 0° C. to 50° C. During establishing the correction regression coefficient table, a planar standard black body radiation source can be utilized as the standard temperature reference for calibration. For example, during establishing the correction regression coefficient table, the black body radiation surface covers the whole field of view of the lens of the temperature detection device 10, the black body radiation source can be adjusted to different temperatures and the black body radiation source is used as the standard temperature reference for calibration. When operating in the measurement environment that the ambient temperature is 19.2° C., the temperature of the case 102 is 23.32° C. and the operation temperature of the FPA module 104 is 22° C., the electronic system 1 performs a high temperature point (45° C.) and a low temperature point (20° C.) measurement for area correction to determine the correction radiometric regression coefficients R, B, F and O. The radiometric regression coefficient R represents the system response of the received external energy of the temperature detection device 10. The radiometric regression coefficient B represents an absorption spectrum parameter of the temperature detection device 10. The radiometric regression coefficient F represents a nonlinear correction parameter of the temperature detection device 10. The radiometric regression coefficient O represents an offset parameter of the temperature detection device 10. When the black body radiation source is at 20° C., the IR sensors of the FPA 1042 of the temperature detection device 10 sense infrared energy radiated from the black body radiation source and accordingly, the readout circuit 1044 of the temperature detection device 10 generates a corresponding average voltage signal and converts the average voltage signal to an average voltage value VD1. For example, the average voltage value VD1 is 3109.25 counts@14 bits. Similarly, when the black body radiation source is at 45° C., the IR sensors of the FPA 1042 of the temperature detection device 10 sense infrared energy radiated from the black body radiation source and accordingly, the readout circuit 1044 generates a corresponding average voltage signal and converts the average voltage signal to an average voltage value VD2. For example, the average voltage value VD2 is 4538 counts@14 bits. In such a situation, by substituting the measured voltage value VD1 (VD1=3109.25 counts@14 bits) and the temperature T1 (T1=20° C.) into equation (3), substituting the measured voltage value VD2 (VD1=4538 counts@14 bits) and the temperature T2 (T2=45° C.) into equation (4), setting the correction radiometric regression coefficient B being 1428 and substituting the correction radiometric regression coefficient B (B=1428) into equations (3) and (4), and setting the correction radiometric regression coefficient F being 1 and substituting the correction radiometric regression coefficient F (F=1) into equations (3) and (4), the correction radiometric regression coefficients R and O are obtained by calculating the solutions of the simultaneous equations (3) and (4) for a system of linear equations in two unknowns. As shown in FIG. 5, the correction radiometric regression coefficient R is 392760 and the correction radiometric regression coefficients O is 83.5158. After that, in the same measurement environment, the black body radiation source is adjusted to 20° C., 30° C., 40° C., 50° C., respectively. According to Step S206 of the procedure 2, the temperature detection device 10 is utilized to sense infrared energy radiated from the black body radiation source and generates the corresponding average voltage values VD shown in FIG. 5. By substituting the correction radiometric regression coefficients R (R=392760), O (0=83.5158), B (B=1428), F (F=1) and the average voltage values VD into equation (2), a calculated temperature value is obtained through performing the inverse operation. The calculated temperature value is the actual temperature of the black body radiation source measured by the temperature detection device 10. In an embodiment, take a wide temperature range as an example, for example, black body radiation source's temperature range is from 0° C. to 500° C. During establishing the correction regression coefficient table, a planar standard black body radiation source can be utilized as the standard temperature reference for calibration. For example, during establishing the correction regression coefficient table, the black body radiation surface covers the whole field of view of the lens of the temperature detection device 10, the black body radiation source can be adjusted to different temperatures and the black body radiation source is used as the standard temperature reference for calibration. When operating in the measurement environment that the ambient temperature is 18.8° C., the temperature of the case 102 is 23.76° C. and the operation temperature of the FPA module 104 is 22.4° C., the electronic system 1 performs a high temperature point (90° C.) and a low temperature point (30° C.) measurement for area correction to determine the correction radiometric regression coefficients R, B, F and O. When the black body radiation source is at 30° C., the IR sensors of the FPA 1042 of the temperature detection device 10 sense infrared energy radiated from the black body radiation source and accordingly, the readout circuit 1044 generates a corresponding average voltage signal and converts the average voltage signal to an average voltage value VD1. For example, the average voltage value VD1 is 3794 counts@14 bits. Similarly, when the black body radiation source is at 90° C., the IR sensors of the FPA 1042 of the temperature detection device 10 sense infrared energy radiated from the black body radiation source and accordingly, the readout circuit 1044 generates a corresponding average voltage signal and converts the average voltage signal to an average voltage value VD2. For example, the average voltage value VD2 is 7480.5 counts@14 bits. In such a situation, by substituting the measured voltage value VD1 (VD1=3794 counts@14 bits) and the temperature T1 (T1=30° C.) into equation (3), substituting the measured voltage value VD2 (VD1=7480.5 counts@14 bits) and the temperature T2 (T2=90° C.) into equation (4), setting the correction radiometric regression coefficient B being 1428 and substituting the correction radiometric regression coefficient B (B=1428) into equations (3) and (4), and setting the correction radiometric regression coefficient F being 1 and substituting the correction radiometric regression coefficient F (F=1) into equations (3) and (4), the correction radiometric regression coefficients R and O are obtained by calculating the solutions of the simultaneous equations (3) and (4) for a system of linear equations in two unknowns. As shown in FIG. 6, the correction radiometric regression coefficient R is 338281 and the correction radiometric regression coefficients O is 729.066. After that, in the same measurement environment, the black body radiation source is adjusted at 25° C., 50° C., 75° C., 100° C., respectively. According to Step S206 of the procedure 2, the temperature detection device 10 is utilized to sense infrared energy radiated from the black body radiation source and generates the corresponding average voltage values VD shown in FIG. 6. By substituting the correction radiometric regression coefficients R (R=338281), O (0=729.066), B (B=1428), F (F=1) and the average voltage values VD into equation (2), a calculated temperature value is obtained through performing the inverse operation. The calculated temperature value is the actual temperature of the black body radiation source measured by the temperature detection device 10. According to the embodiments of FIGS. 5 and 6, the invention determines the corresponding correction radiometric regression coefficients R, B, F and O according to the ambient temperature, the temperature of the case 102 and the operation temperature of the FPA module 104 for each measurement environment and calculated the actual temperature of the object under test. In fact, it can be verified that the accuracy of the electronic system 1 can be ±0.4° C. and thus having excellent measurement accuracy. Note that, those skilled in the art should readily make combinations, modifications and/or alterations on the abovementioned description and examples. The abovementioned steps of the procedures including suggested steps can be realized by means that could be hardware, firmware known as a combination of a hardware device and computer instructions and data that reside as read-only software on the hardware device, or a processing system. Examples of hardware can include analog, digital and mixed circuits known as microcircuit, microchip, or silicon chip. Examples of the processing system can include a system on chip (SOC), system in package (SIP), a computer on module (COM), and the processor circuit 30. In summary, the electronic system 1 of the embodiments can adjust the radiometric regression coefficients according to the ambient temperature, the temperature of the case 102 and the temperature of the FPA module 104 and accordingly calculate an actual temperature value of the object under test, so as to reduce the sensor offset of the temperature detection device 10 and improve the accuracy of measurement. Compared with the conventional measurement offset correction method, the invention does not require additional shutter hardware for implementation and also does not require computing complex equations, thus effectively improving the accuracy of measurement. Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims. What is claimed is: 1. A temperature measurement correction method, for a temperature detection device, the temperature detection device comprising a case and a focal plane array module disposed on an inner of the case, the temperature measurement correction method comprising: measuring an ambient temperature, a temperature of the case and an operation temperature of the focal plane array module; determining a plurality of radiometric regression coefficients according to the ambient temperature, the temperature of the case and the operation temperature of the focal plane array module; utilizing the temperature detection device to sense infrared energy radiated from an object to generate an electrical signal; and calculating an actual temperature value of the object according to the plurality of radiometric regression coefficients and the electrical signal. 2. The temperature measurement correction method of claim 1, wherein the step of determining the plurality of radiometric regression coefficients according to the ambient temperature, the temperature of the case and the operation temperature of the focal plane array module comprises: querying a correction regression coefficient table to obtain the plurality of radiometric regression coefficients corresponding to the ambient temperature, the temperature of the case and the operation temperature of the focal plane array module; wherein the correction regression coefficient table is associated with a calculation result calculated based on that the electrical signals are generated when the temperature detection device measures the objects at different temperatures and at least one of the radiometric regression coefficients is a fixed. 3. The temperature measurement correction method of claim 1, wherein the temperature detection device is a microbolometer-based detection device. 4. The temperature measurement correction method of claim 1, further comprising: in the same measurement environment, utilizing the temperature detection device to measure objects at different temperatures to generate a plurality of first electronic signals; calculating the radiometric regression coefficients corresponding to the measurement environment according to the plurality of first electronic signals and a blackbody radiation equation; and storing the radiometric regression coefficients corresponding to the measurement environment, so as to establish a correction regression coefficient table. 5. An electronic system, comprising: a first temperature detection device, comprising: a case; and a focal plane array module, disposed on an inner of the case, comprising: a focal plane array comprising a plurality of infrared sensors for sensing infrared energy radiated from an object; and a readout circuit, for generating an electrical signal in response to the sensed infrared energy sensed by the infrared sensor of the focal plane array; a second temperature detection device, for measuring an ambient temperature, a temperature of the case and an operation temperature of the focal plane array module; and a processor circuit, for determining a plurality of radiometric regression coefficients according to the ambient temperature, the temperature of the case and the operation temperature of the focal plane array module and calculating an actual temperature value of the object according to the plurality of radiometric regression coefficients and the electrical signal. 6. The electronic system of claim 5, wherein the processor circuit queries a correction regression coefficient table to obtain the plurality of radiometric regression coefficients corresponding to the ambient temperature, the temperature of the case and the operation temperature of the focal plane array module. 7. The electronic system of claim 5, wherein the temperature detection device is a microbolometer-based detection device and the infrared sensor is a microbolometer sensor. 8. A method of generating a correction regression coefficient table, for a temperature detection device, the temperature detection device comprising a case and a focal plane array module disposed on an inner of the case, the method comprising: in the same measurement environment, utilizing the temperature detection device to measure objects at different temperatures to generate a plurality of electronic signal; calculating radiometric regression coefficients corresponding to measurement environment according to the plurality of electronic signals and a black body radiation equation; and storing the radiometric regression coefficients corresponding to measurement environment, so as to establish a correction regression coefficient table. 9. The method of claim 8, wherein the step of calculating the radiometric regression coefficients corresponding to measurement environment according to the plurality of electronic signals and the black body radiation equation comprises: calculating the radiometric regression coefficients corresponding to the measurement environment according to the electronic signals and a black body radiation equation since at least one of the radiometric regression coefficients is a fixed value. 10. The method of claim 8, wherein the temperature detection device is a microbolometer-based detection device.

2018-09-06

en

2019-06-27

US-201213630001-A

Resistance variable memory structure and method of forming the same ABSTRACT A semiconductor structure includes a resistance variable memory structure. The semiconductor structure also includes a dielectric layer. A portion of the resistance variable memory structure is over the dielectric layer. The resistance variable memory structure includes a first electrode embedded in the dielectric layer. A resistance variable layer disposed over the first electrode and a portion of the dielectric layer. A second electrode disposed over the resistance variable layer. TECHNICAL FIELD This disclosure relates generally to a semiconductor structure and, more particularly, to a resistance variable memory structure and method for forming a resistance variable memory structure. BACKGROUND In integrated circuit (IC) devices, resistive random access memory (RRAM) is an emerging technology for next generation non-volatile memory devices. RRAM is a memory structure including an array of RRAM cells each of which stores a bit of data using resistance values, rather than electronic charge. Particularly, each RRAM cell includes a resistance variable layer, the resistance of which can be adjusted to represent logic “0” or logic “1”. From an application point of view, RRAM has many advantages. RRAM has a simple cell structure and CMOS logic comparable processes which result in a reduction of the manufacturing complexity and cost in comparison with other non-volatile memory structures. Despite the attractive properties noted above, a number of challenges exist in connection with developing RRAM. Various techniques directed at configurations and materials of these RRAMs have been implemented to try and further improve device performance. BRIEF DESCRIPTION OF THE DRAWINGS Aspects of the present disclosure may be understood from the following detailed description and the accompanying figures. It is emphasized that, in accordance with the standard practice in the industry, various features are not drawn to scale. In fact, the dimensions of the various features may be arbitrarily increased or reduced for clarity of discussion. FIG. 1 is a flowchart of a method of forming a semiconductor structure having a resistance variable memory structure according to one or more embodiments of this disclosure. FIGS. 2A to 2H are cross-sectional views of semiconductor structures having a resistance variable memory structure at various stages of manufacture according to one or more embodiments of the method of FIG. 1. FIG. 3 illustrates a cross-sectional view of a resistance variable memory structure in operation with filaments formed in a resistance variable layer of the resistance variable memory structure according to one or more embodiments of this disclosure. DETAILED DESCRIPTION The making and using of illustrative embodiments are discussed in detail below. It should be appreciated, however, that the disclosure provides many applicable inventive concepts that can be embodied in a wide variety of specific contexts. The specific embodiments discussed are merely illustrative and do not limit the scope of the disclosure. According to one or more embodiments of this disclosure, a semiconductor structure includes a resistance variable memory structure. The resistance variable memory structure includes a resistance variable layer formed between two electrodes. By applying a specific voltage to each of the two electrodes, an electric resistance of the resistance variable layer is altered. The low and high resistances are utilized to indicate a digital signal “1” or “0”, thereby allowing for data storage. The switching behavior does not depend only on the materials of the resistance variable layer but also depends on the choice of electrodes and interfacial properties of the electrodes. According to one or more embodiments of this disclosure, the semiconductor structure having a resistance variable memory structure is formed within a chip region of a substrate. A plurality of semiconductor chip regions is marked on the substrate by scribe lines between the chip regions. The substrate will go through a variety of cleaning, layering, patterning, etching and doping steps to form the semiconductor structures. The term “substrate” herein generally refers to a bulk substrate on which various layers and device structures are formed. In some embodiments, the bulk substrate includes silicon or a compound semiconductor, such as GaAs, InP, Si/Ge, or SiC. Examples of such layers include dielectric layers, doped layers, polysilicon layers or conductive layers. Examples of device structures include transistors, resistors, and/or capacitors, which may be interconnected through an interconnect layer to additional integrated circuits. FIG. 1 is a flowchart of a method 100 of forming a semiconductor structure having a resistance variable memory structure according to one or more embodiments of this disclosure. FIGS. 2A to 2I are cross-sectional views of semiconductor structures 200A and 200B each having a resistance variable memory structure at various stages of manufacture according to various embodiments of the method 100 of FIG. 1. It should be noted that additional processes may be provided before, during, or after the method 100 of FIG. 1. Various figures have been simplified for a better understanding of the inventive concepts of the present disclosure. Referring now to FIG. 1, the flowchart of the method 100 begins with operation 102. An opening is formed in a dielectric layer. The dielectric layer has a top surface. The dielectric layer is formed on a substrate having at least one conductive structure on a top portion of the substrate. In at least one embodiment, the opening is etched from the top surface of the dielectric layer to expose a portion of the at least one conductive structure. Referring to FIG. 2A, which is an enlarged cross-sectional view of a portion of a semiconductor structure 200A having a resistance variable memory structure after performing operation 102. The semiconductor structure 200A includes a substrate (not shown) such as a silicon carbide (SiC) substrate, GaAs, InP, Si/Ge or a silicon substrate. The substrate may include a plurality of layers formed on a top portion of the substrate. Examples of such layers include dielectric layers, doped layers, polysilicon layers or conductive layers. The substrate may further include a plurality of device structures formed within the plurality of layers. Examples of device structures include transistors, resistors, and/or capacitors. In the illustrated examples of FIGS. 2A-2I, the semiconductor structures 200A and 200B include a conductive structure 202 formed on the top portion of the substrate (not shown). The conductive structure 202 may include a conductive interconnect, a doped region or a silicide region. In some embodiments, the conductive structure 202 may include Al, Cu, Ti, Ta, W, Mo, TaN, NiSi, CoSi, TiN, WN or silicon. The conductive structure 202 is formed by a suitable process, including deposition, lithography patterning, doping, implanting, or etching processes. A dielectric layer 204 is deposited over the conductive structure 202. The dielectric layer 204 has a top surface 204A. The dielectric layer 204 comprises silicon oxide, fluorinated silica glass (FSG), carbon doped silicon oxide, silicon nitride, silicon oxynitride, tetra-ethyl-ortho-silicate (TEOS) oxide, phosphosilicate glass (PSG), borophosphosilicate glass (BPSG), Black Diamond® (Applied Materials of Santa Clara, Calif.), amorphous fluorinated carbon, low-k dielectric material, or combinations thereof. The deposition process may include chemical vapor deposition (CVD), atomic layer deposition (ALD), high density plasma CVD (HDPCVD) or spinning on glass. An opening 206 is etched in the dielectric layer 204 extending from the top surface 204A to a top surface of the conductive structure 202 to expose a portion of the conductive structure 202. The opening 206 has sidewalls and a width W1. The opening 206 is formed by suitable process, including lithography patterning, and etching processes. FIG. 2B is a cross-sectional view of the semiconductor structure 200A after a barrier layer 208 is optionally formed in the opening 206. The barrier layer 208 comprises at least one of TiN, Ti, Ta, TaN, W or WN. In at least one embodiment, a barrier material may overfill the opening 206 in the dielectric layer 204. Possible formation methods include electroless plating, sputtering, electro plating, physical vapor deposition (PVD) or CVD. The excess barrier material outside the opening 206 is removed through a suitable process such as chemical mechanical polishing (CMP) or planarization etching back process. FIG. 2C is a cross-sectional view of the semiconductor structure 200A after a top portion of the barrier layer 208 is removed from the opening 206. An etching process is performed to remove the top portion of the barrier layer 208 and leave a remained portion of the barrier layer 208 filled in a bottom section of the opening 206. The etching process may include a dry etching process, wet etching process, or a combination thereof. Referring back to FIG. 1, the method 100 continues with operation 104 in which the opening is filled with a first electrode material substantially to the top surface of the dielectric layer. FIG. 2D is a cross-sectional view of the semiconductor structure 200A after performing operation 104. A first electrode 210 is filled in the opening 206 overlying the barrier layer 208. The first electrode 210 includes a first electrode conductive material having a proper work function such that a high work function wall is built between the first electrode 210 and a resistance variable layer subsequently formed. The first electrode 210 may comprise Pt, AlCu, TiN, Au, Ti, Ta, TaN, TaN, W, WN or Cu. In at least one embodiment, a first electrode conductive material may overfill the opening 206 of the dielectric layer 204 in FIG. 2C. Possible formation methods include electroless plating, sputtering, electro plating, PVD or ALD. Then, the excess first electrode conductive material outside the opening 206 is removed through a suitable planarization process such as CMP or planarization etching back process. The first electrode 210 is formed in a top section of the opening 206, and embedded in the dielectric layer 204. The first electrode 210 has a top surface 210A substantially coplanar to the top surface 204A of the dielectric layer 204. Since the barrier layer 208 and the first electrode 210 are formed in the same opening 206, the barrier layer 208 and the first electrode 210 have a substantially same width W1 as the opening 206 and aligned sidewalls. The conductive structure 202 is electrically connected to the first electrode 210 through the barrier layer 208. The barrier layer 208 deposited on the conductive structure 202 and under the first electrode 210 is designed to prevent inter-mixing of the materials in the conductive structure 202 and the first electrode 210. The barrier layer 208 prevents diffusion between the conductive structure 202 and the first electrode 210 and any junction spiking. The electrical performances the semiconductor structure 200A is thus improved. Referring back to FIG. 1, method 100 continues with operations 106 and 108. In operation 106, a resistance variable layer is deposited over the first electrode material. In operation 108, a second electrode material is deposited over the resistance variable layer. FIG. 2E is a cross-sectional view of the semiconductor structure 200A after performing operations 106 and 108. A resistance variable layer 212 is deposited over the first electrode 210 and the dielectric layer 204. The resistance variable layer 212 has a resistivity capable of switching between a high resistance state and a low resistance state (or conductive), by application of an electrical voltage. In various embodiments, the resistance variable layer 212 includes dielectric materials comprising a high-k dielectric material, a binary metal oxide or a transition metal oxide. In some embodiments, the resistance variable layer 212 includes nickel oxide, titanium oxide, hafnium oxide, zirconium oxide, zinc oxide, tungsten oxide, aluminum oxide, tantalum oxide, molybdenum oxide or copper oxide. Possible formation methods include PVD or ALD, such as ALD with a precursor containing zirconium and oxygen. In one example, the resistance variable layer 212 has a thickness in a range from about 20 angstrom to about 200 angstrom. A second electrode material 214 is deposited over the resistance variable layer 212. The second electrode material 214 may include suitable conductive material to electrically connect a subsequently formed resistance variable memory structure to other portions of an interconnect structure for electrical routing. The second electrode material 214 may comprise Pt, AlCu, TiN, Au, Ti, Ta, TaN, TaN, W, WN or Cu. In some embodiments, the first electrode material 210 and the second electrode material 214 have a same composition. In some embodiments, the first electrode material 210 and the second electrode material 214 have different compositions. Possible formation methods include electroless plating, sputtering, electro plating, PVD or ALD. In some examples, the semiconductor structure 200A may further includes a cap layer 213 optionally formed on the resistance variable layer 212 and underlying the second electrode material 214 as shown in FIG. 2I. The cap layer includes a conductive material that is unstable, capable of depriving oxygen from the resistance variable layer 212, and creates vacancy defects in the resistance variable layer 212. The cap layer comprises titanium, tantalum or hafnium. Referring back to FIG. 1, the method 100 continues with operation 110 in which the second electrode material and the resistance variable layer are etched to form a resistance variable memory structure. FIGS. 2F and 2G are cross-sectional views of the semiconductor structure 200A after performing operation 110. In FIG. 2F, a mask layer 216 having a feature with a width W2 is formed over the second electrode material 214. The feature is formed by suitable process, including deposition, lithography patterning, and/or etching processes. In at least one embodiment, the feature of the mask layer 216 overlies the first electrode 210 and covers a region having the width W2 wider than the width W1 of the first electrode 210. An etching process is performed to remove the second electrode material 214 and the resistance variable layer 212 not underlying the mask layer 216. Then, a second electrode 214A is defined and a resistance variable memory structure 250A is formed. Since the second electrode material 214 and the resistance variable layer 212 are covered and etched under the same mask layer 216, the second electrode 214A and the patterned resistance variable layer 212 have a substantially same width W2 wider than the width W1 of the first electrode 210. Also, the second electrode 214A and the patterned resistance variable layer 212 have substantially aligned sidewalls. In certain embodiments, the feature of the mask layer 216 overlies the first electrode 210 and covers a region having the width W2 less than the width W1 of the first electrode 210. The second electrode 214A and the patterned resistance variable layer 212 have a substantially same width W2 less than the width W1 of the first electrode 210. FIG. 2G illustrates a cross-sectional view of the semiconductor structure 200A after the mask layer 216 is removed and a top surface of the second electrode 214A of the resistance variable memory structure 250A is exposed. The removing process may include a dry etching process, wet etching process, or combination thereof. FIG. 2H is a cross-sectional view of the semiconductor structure 200B having another resistance variable memory structure 250B according to various embodiments of the method 100 of FIG. 1. The layer stacks and manufacture methods of the semiconductor structure 200B are similar to the semiconductor structure 200A. However, the resistance variable memory structure 250B in the semiconductor structure 200B does not include the barrier layer 208 of the semiconductor structure 200A. The conductive structure 202 is electrically connected directly to the first electrode 210. FIG. 3 is an enlarged cross-sectional view of the semiconductor structure 200A having a resistance variable memory structure 250A in various operations for data storage. In a “forming” operation, a “forming” voltage is applied to the first and second electrodes 210 and 214A of the resistance variable memory structure. The “forming” voltage is high enough to generate a conductive portion in the resistance variable layer 212. In one example, the conductive portion includes one or more conductive filaments 300 to provide a conductive path such that the resistance variable layer 212 shows an “on” or low resistance state. The conductive path may be related to the lineup of the defect (e.g. oxygen) vacancies in the resistance variable layer 212. In some embodiments, the “forming” voltage is applied only one time. Once the conductive path is formed, the conductive path will remain present in the resistance variable layer 212. Other operations may disconnect or reconnect the conductive path using smaller voltages or different voltages. In a “set” operation, a “set” voltage high enough to reconnect the conductive path in the resistance variable layer 212 is applied to the resistance variable memory structure 250A such that the resistance variable layer 212 shows the “on” or low resistance state. The “set” operation turns the resistance variable layer 212 to the low resistance state. In a “reset” operation, a “reset” voltage high enough to break the conductive path in the resistance variable layer 212 is applied to the resistance variable memory structure 250A such that the resistance variable layer 212 shows an “off” or high resistance state. By applying a specific voltage between two electrodes 210 and 214A, an electric resistance of the resistance variable layer 212 is altered after applying the specific voltage. The low and high resistances are utilized to indicate a digital signal “1” or “0”, thereby allowing for data storage. Various embodiments of the present disclosure may be used to improve the performance of a resistance variable memory structure. For example, the first electrode 210 is formed by a filling process in the opening 206 in operation 104. The second electrode 214A is formed by an etching process in operation 110. The disclosed method includes a single etching process (in operation 110) used to form both electrodes 210 and 214A. This disclosure eliminates drawbacks in conventional methods such as etching damage to the resistance variable layer 212 due to multiple etching steps in patterning both the first and second electrodes 210 and 214A which leads to long exposure times in plasma environments. Without etching damages in the resistance variable layer 212, a possible leakage current in the resistance variable memory structures 250A and 250B is reduced. In another example, an operation current of the resistance variable memory structure (250A or 250B) is related to an area of the conductive paths (or conductive filaments 300) in the resistance variable layer 212. The area of the conductive paths (or conductive filaments 300) is confined within the width W1 of the first electrode 210 and the width W2 of the second electrode 214A after the “forming” operation. The smaller of either the width W1 or the width W2 dictates a width of the area of the conductive paths in the resistance variable layer 212. As lithography patterning processes continue shrinking the width W1 and the width W2, the operation current of the resistance variable memory structure (250A or 250B) also is capable of being further reduced. In this disclosure, the width W1 is decided by the lithography patterning and etching processes capability to from the opening 206 in operation 102. Also, the width W1 of the first electrode 210 is decided in the operation 102. In a view of the lithography patterning and etching processes, reducing a size of the dimension of an opening (or etched portion) in a material layer is simpler than reducing the dimension of a feature (or remained portion) in a material layer. In this disclosure, the width W1 of the first electrode 210 is decided in the opening 206. This disclosure provides an effective technique to facilitate scaling down of the resistance variable memory structure (250A or 250B), and also reduction of the operation current. One aspect of the disclosure describes a semiconductor structure including a resistance variable memory structure. The semiconductor structure includes a dielectric layer. At least a portion of the resistance variable memory structure is over the dielectric layer. The resistance variable memory structure includes a first electrode embedded in the dielectric layer. A resistance variable layer disposed over the first electrode and a portion of the dielectric layer. A second electrode disposed over the resistance variable layer. A further aspect of the disclosure describes a semiconductor structure including a resistance variable memory structure. The semiconductor structure includes a conductive structure. A barrier layer disposed over the conductive structure. The resistance variable memory structure is over the barrier layer. The resistance variable memory structure includes a first electrode disposed over the barrier layer. The barrier layer and the first electrode have a substantially same width W1. A resistance variable layer disposed over the first electrode. A second electrode disposed over the resistance variable layer. The resistance variable layer and the second electrode have a substantially same width W2 different from the width W1. The present disclosure also describes an aspect of a method of forming a resistance variable memory structure. The method includes forming an opening in a dielectric layer. The dielectric layer has a top surface. The opening is filled with a first electrode material substantially to the top surface. A resistance variable layer is deposited over the first electrode material. A second electrode material is deposited over the resistance variable layer. The resistance variable layer and the second electrode material are etched to form a resistance variable memory structure. Although the embodiments and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. As one of ordinary skill in the art will readily appreciate from the present disclosure, processes, machines, manufacture, compositions of matter, means, methods, or steps that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present disclosure. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps. 1. A semiconductor structure comprising: a dielectric layer; and a resistance variable memory structure, wherein at least a portion of the resistance variable memory structure is over the dielectric layer, the resistance variable memory structure comprising: a first electrode embedded in the dielectric layer; a resistance variable layer disposed over the first electrode and a portion of the dielectric layer; and a second electrode disposed over the resistance variable layer. 2. The semiconductor structure of claim 1, wherein the first electrode has a width W1 and the second electrode has a width W2, and the width W1 is less than the width W2. 3. The semiconductor structure of claim 1, further comprising a cap layer between the resistance variable layer and the second electrode. 4. The semiconductor structure of claim 3, wherein the cap layer comprises titanium, tantalum or hafnium. 5. The semiconductor structure of claim 1, further comprising a conductive structure under the dielectric layer, and electrically connecting to the first electrode. 6. The semiconductor structure of claim 5, further comprising a barrier layer embedded in the dielectric layer between the first electrode and the conductive structure. 7. The semiconductor structure of claim 6, wherein the barrier layer comprises TiN, Ti, Ta, TaN, W or WN. 8. The semiconductor structure of claim 1, wherein the resistance variable layer comprises a high-k dielectric material, a binary metal oxide or a transition metal oxide. 9. The semiconductor structure of claim 1, wherein the resistance variable layer comprises nickel oxide, titanium oxide, hafnium oxide, zirconium oxide, zinc oxide, tungsten oxide, aluminum oxide, tantalum oxide, molybdenum oxide or copper oxide. 10. The semiconductor structure of claim 1, wherein each of the first electrode and the second electrode comprises Pt, AlCu, TiN, Au, Ti, Ta, TaN, TaN, W, WN or Cu. 11. A semiconductor structure comprising: a conductive structure; a barrier layer disposed over the conductive structure; and a resistance variable memory structure over the barrier layer, the resistance variable memory structure comprising: a first electrode disposed over the barrier layer, wherein the barrier layer and the first electrode have a substantially same width W1; a resistance variable layer disposed over the first electrode; and a second electrode disposed over the resistance variable layer, wherein the resistance variable layer and the second electrode have a substantially same width W2 different from the width W1. 12. The semiconductor structure of claim 11, wherein the width W1 is less than the width W2. 13. The semiconductor structure of claim 11, further comprising a dielectric layer over the conductive structure and surrounding both the barrier layer and the first electrode. 14. The semiconductor structure of claim 11 further comprising a cap layer between the resistance variable layer and the second electrode. 15. The semiconductor structure of claim 11, wherein the barrier layer contacts the conductive structure. 16. The semiconductor structure of claim 11, wherein the resistance variable layer comprises a high-K dielectric material, a binary metal oxide or a transition metal oxide. 17. The semiconductor structure of claim 11, wherein each of the first electrode and the second electrode comprises Pt, AlCu, TiN, Au, Ti, Ta, TaN, TaN, W, WN or Cu. 18. The semiconductor structure of claim 11, wherein barrier layer comprises TiN, Ti, Ta, TaN, W or WN. 19-20. (canceled) 21. A manufacture, comprising: a dielectric layer having an opening defined therein; a first electrode in the opening of the dielectric layer; a resistance variable member over the dielectric layer and over the first electrode; and a second electrode over the resistance variable member, and the first electrode and the second electrode sandwiching the resistance variable member. 22. The manufacture of claim 21, wherein the first electrode has a width W1, the second electrode has a width W2, and the width W1 is less than the width W2.

2012-09-28

en

2014-04-03

US-12861808-A

Method for accessing a memory chip ABSTRACT The present invention provides a method for accessing a memory chip. The method includes: positioning a plurality of first input pins and a plurality of second input pins on the memory chip; respectively inputting a plurality of row address signals into the plurality of first input pins, where a length of a row address command package of each row address signal corresponds to a plurality of clock periods of a clock signal, and the row address command package includes a plurality of row input commands; and respectively inputting a plurality of column address signals into the plurality of second input pins, where a length of a column address command package of each column address signal corresponds to a plurality of clock periods of the clock signal, and the column address command package includes a plurality of column input commands. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for accessing a memory chip, and more particularly, to a memory accessing method capable of reducing a number of input pins of a dynamic random access memory (DRAM). 2. Description of the Prior Art Regarding the prior art double data rate (DDR) synchronous DRAM (SDRAM) architecture, a SDRAM typically has following input signals: two clock signals, i.e. CLK and #CLK, sixteen memory address input signals: A0-A15, four bank address input signals: BA0-BA3, a chip-select signal CS, a row address strobe signal RAS, a column address strobe signal CAS, a write enable signal WE, a synchronous signal CKE, a calibration signal ZQ, and a reset signal RESET. The length of an input command of each input signal mentioned above corresponds to a clock period of a clock signal, and each input signal is inputted into a memory chip through its own pin, which is dedicated for the input signal. Therefore, the memory chip of the prior art SDRAM typically has twenty-nine input pins. Please refer to FIG. 1. FIG. 1 is a diagram illustrating a prior art dual in-line memory module (DIMM) 100. As shown in FIG. 1, the DIMM 100 comprises eight memory chips 110_1-110_8, and each memory chip comprises twenty-nine input pins. Regarding the operations of the DIMM 100, twenty-nine input signals are transmitted from a controller 120 to the memory chip 100_1, then the input signals sequentially transmit to the memory chip 110_2, 110_3, . . . , 110_8. Therefore, two adjacent memory chips are connected each other with twenty-nine electrical wirings. Generally speaking, the more input pins the memory chip has, the narrower the distance between two electrical wirings, causing increased difficulty of the layout of the electrical wirings and increased interference between signals transmitted through the electrical wirings. Therefore, the layout of the DIMM 100 is difficult due to these disadvantages. Additionally, regarding the test of the memory chips implemented as DIMMs, the tooling cost appears to be too high, and the number of memory chips that a test station can test each time appears to be insufficient. SUMMARY OF THE INVENTION It is therefore an objective of the present invention to provide a method for accessing a memory chip with the method being capable of reducing a number of input pins of a memory such as a dynamic random access memory (DRAM), in order to reduce the density of electrical wirings of dual in-line memory modules (DIMMs) and save the cost on tests of memory chips. According to one embodiment of the present invention, a method for accessing a memory chip is provided. The method comprises: positioning a plurality of first input pins and a plurality of second input pins on the memory chip; respectively inputting a plurality of row address signals into the plurality of first input pins, where a length of a row address command package of each row address signal corresponds to a plurality of clock periods of a clock signal, and the row address command package comprises a plurality of row input commands; and respectively inputting a plurality of column address signals into the plurality of second input pins, where a length of a column address command package of each column address signal corresponds to a plurality of clock periods of the clock signal, and the column address command package comprises a plurality of column input commands. According to the method for accessing the memory chip provided by the present invention, the number of input pins of the memory chip can be reduced without influencing the performance of the memory implemented with the memory chip, causing the layout of the DlMMs to be easier and the testing cost to be lowered. These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings. BRIEF DESCRITPION OF THE DRAWINGS FIG. 1 is a diagram illustrating a prior art dual in-line memory module (DIMM). FIG. 2 is a diagram illustrating a memory chip according to one embodiment of the present invention. FIG. 3 is a diagram illustrating six row address signals according one embodiment of the present invention. FIG. 4 is a diagram illustrating five column address signals according one embodiment of the present invention. FIG. 5 is a diagram illustrating an exemplary operation of accessing the memory chip shown in FIG. 2. DETAILED DESCRIPTION In the prior art DDR SDRAM architecture, a length of an input command of each input signal corresponds to a clock period of a clock signal, and each input signal is inputted into a memory chip through its own pin. Therefore, the prior art memory chip has twenty-nine input pins. In order to reduce a number of input pins, the present invention uses the concept of the “command package”. That is, each pin is utilized for receiving a command package, and the command package comprises a plurality of input commands such as four input commands. Thus, the number of input pins of a memory chip implemented according to the present invention can be reduced. However, because each command package comprises four input commands and the length of an input command corresponds to a clock period, the length of a command package is corresponding to four clock periods. In the operations of the memory, the row address signal and the column address signal cannot be inputted into the same bank at the same time. As a result, when using the command package whose length is four clock periods, it is required for the conventional architecture to wait for four clock periods after the row address signal is inputted into a bank and then the column address signal can be inputted into the same bank, causing the performance of the memory to be seriously degraded. Therefore, the present invention provides a method which can reduce the number of input pins of a memory chip without seriously degrading the performance of the memory. The operations are described as follows. Please refer to FIG. 2. FIG. 2 is a diagram illustrating a memory chip 200 according to one embodiment of the present invention. As shown in FIG. 2, the memory chip 200 comprises a clock pin PIN_CLK, six row address signal pins PIN_R0-PIN_R5, five column address signal pins PIN_C0-PIN_C4, a first chip-selection signal pin PIN_CSR for a chip-select signal such as a row address chip-select signal, and a second chip-select signal pin PIN_CSC for a chip-select signal such as a column address chip-select signal. In this embodiment, the clock signal pin PIN_CLK is utilized for receiving a clock signal CLK, the row address signal pins PIN_-R0-PIN_R5 are utilized for respectively receiving six row address signals RowAdr0, RowAdr1, RowAdr2, RowAdr3, RowAdr4, RowAdr5, the column address signal pins PIN_C0-PIN_C5 are utilized for respectively receiving five column address signals ColAdr0, ColAdr1, ColAdr2, ColAdr3, ColAdr4, the first chip-select signal pin PIN_CSR (i.e. the row address chip-select signal pin) is utilized for receiving a first chip-select signal CSR to select the memory chip 200 to receive the row address signals, and the second chip-select signal pin PIN_CSC (i.e. the column address chip-select signal pin) is utilized for receiving a second chip-select signal CSC to select the memory chip 200 to receive the column address signals. Please note that, the pins positioned on the memory chip 200 shown in FIG. 2 is for illustrative purposes only. In addition, without influencing the disclosure of the present invention, FIG. 2 only shows a portion of the pins related to further description of the present invention. In practice, the memory chip 200 of the present invention is not limited to have the same pin arrangement as that shown in FIG. 2. The accessing operations of the memory chip 200 are described as follows. Please refer to FIG. 3. FIG. 3 is a diagram illustrating six row address signals according one embodiment of the present invention. In the present invention, six row address signals RowAdr0, RowAdr1, RowAdr2, RowAdr3, RowAdr4, RowAdr5 are inputted into the memory chip through six first input pins (i.e., row address signal pins PIN_R0-PIN_R5). As shown in FIG. 3, the length of a row address command package of each row address signal corresponds to four clock periods of the clock signal CLK, and the row address command package comprises four row input commands. Therefore, six row address command packages of the six row address signals comprise twenty-four row input commands. In this embodiment, the twenty-four row input commands comprises four pieces of setting information of bank address BA0-BA3, sixteen pieces of setting information of memory address A0-A15, and four pieces of memory control command setting information CMD0-CMD3, where the four pieces of setting information of bank address BA0-BA3 are implemented for replacing the bank address input signals BA0-BA3 in the prior art DDR SDRAM architecture, and the sixteen pieces of setting information of memory address A0-A15 are implemented for replacing the memory address input signals A0-A15 in the prior art DDR SDRAM architecture. In addition, the four pieces of memory control command setting information CMD0-CMD3 are decoded to generate a control command of a plurality of memory control commands, where the memory control commands may comprise an activate command, a pre-charge command, a refresh command, a mode register set (MRS) command, a self-refresh entry (SRE) command, a power down entry command, a ZQ calibration long/ZQ calibration short (ZQCL/ZQCS) command, . . . , etc. Please refer to FIG. 4. FIG. 4 is a diagram illustrating five column address signals according one embodiment of the present invention. In the present invention, the five column address signals ColAdr0, ColAdr1, ColAdr2, ColAdr3, ColAdr4 are inputted into the memory chip through the five second input pins (i.e., the column address signal pins PIN_C0-PIN_C4 shown in FIG. 2). As shown in FIG. 4, the length of a column address command package of each column address signal corresponds to four clock periods of the clock signal CLK, and the column address command package comprises four column input commands. Therefore, five column address command packages of the five column address signals comprise twenty column input commands. The twenty column input commands comprise four pieces of setting information of bank address BA0-BA3, thirteen pieces of setting information of memory address A0-A12, a write enable (WE) input command, an auto-pre-charge (AP) input command, and a burst chop 4/burst length 8 (BC4/BL8) input command. The four pieces of setting information of bank address BA0-BA3 are implemented for replacing the bank address input signals BA0-BA3 in the prior art DDR SDRAM architecture, and the thirteen pieces of setting information of memory address A0-A12 are implemented for replacing the memory address input signals A0-A12 in the prior art DDR SDRAM architecture. It is noted that, the input commands of the six row address command packages of the six row address signals are for illustrative purposes only. In practice, the twenty-four row input commands can be rearranged and the twenty column input commands shown in FIG. 4 can also be rearranged without influencing the operations of the memory chip of the present invention. For example, locations of any two of the row input commands can be exchanged with each other, and locations of any two of the column input commands can also be exchanged with each other. In another example, locations of the row input commands can be rotated, and locations of the column input commands can be rotated, too. Additionally, the number of the above-mentioned row address signals (RowAdr0-RowAdr5), the number of the above-mentioned column address signals (ColAdr0-ColAdr4), and the number of pieces of the setting information of the bank address (BA0-BA3) are for illustrative purposes only. In practice, when the storage capacity of the memory is increased (e.g. the number of pieces of setting information of the memory address is increased, or the number of the banks is increased), seven or more row address signals can be used, and six or more column address signals can be used. For example, the memory chip 200 may further comprises a row address signal pin PIN_R6 and a column address signal pin PIN_C5, where the row address signal pin PIN_R6 is utilized for receiving a row address signal RowAdr6, and a row address command package of the row address signal RowAdr6 comprises two pieces of setting information of the bank address BA4, BA5, and two pieces of setting information of the memory address A16, A17; and a column address command package of the column address signal ColAdr5 comprises two pieces of setting information of the bank addresses BA4, BA5, and two pieces of setting information of the memory addresses A13, A14. As mentioned above, because the row (column) address command package of this embodiment comprises four row (column) input commands, adding only one additional row address signal pin and only one additional column address signal pin in a variation of this embodiment can increase four pieces of setting information of the bank address or the memory address. Therefore, the testing cost of the memory chip can be reduced. As mentioned above, both the row address signals and the column address signals comprise the setting information of the memory address (A0, A1, . . . , etc.), and therefore, different banks can be operated at the same time. FIG. 5 is a diagram illustrating an exemplary operation of accessing the memory chip shown in FIG. 2. As shown in FIG. 5, at time T1, six row address command packages of the six row address signals RowAdr0-RowAdr5 are utilized for activating a first bank of the memory chip 200, and at the same time, five column address command packages of the five column address signals ColAdr0-ColAdr4 are utilized for writing a second bank (if the second bank is activated). At time T2, six row address command packages of the six row address signals RowAdr0-RowAdr5 are utilized for activating a third bank. At time T3, five column address command packages of the five column address signals ColAdr0-ColAdr4 are utilized for reading the first bank. Therefore, the performance degradation of the memory due to the command package whose length is four clock periods can be alleviated. In the prior art DDR SDRAM architecture, many parameters such as RAS to RAS delay time tRRD, RAS pre-charge time tRP, RAS to CAS delay time tRCD, row cycle time tRC, . . . , etc. have prescribed values. If the clock period of the memory is equal to 1.25 nano-seconds, the lengths of the row address command package and the column address command package provided by the present invention are equal to 5 nano-seconds, which can be utilized for appropriately replacing related operations of the prior art DDR SDRAM architecture without violating the prescribed values of the related parameters. For example, the RAS pre-charge time tRP is at least 10 nano-seconds, and is equal to the length of two row address command packages. That is, a length of an interval between a pre-charge operation and an activation operation of a bank is equal to the length of the row address command package. Therefore, the performance of the memory will not be influenced. In addition, the prior art DDR SDRAM architecture has a chip-select signal utilized for enabling a memory chip. In the present invention, because both the six row address signals and the five column address signals comprise the setting information of the memory address, the present invention further provides a first chip-select signal CSR (i.e. the row address chip-select signal) utilized for enabling the memory chip to receive the row address signals, and a second chip-select signal CSC (i.e. the column address chip-select signal) utilized for enabling the memory chip to receive the column address signals. The row address chip-select signal CSR and the column address chip-select signal CSC are inputted into the memory chip through a third input pin (i.e., the first chip-select signal pin PIN_CSR shown in FIG. 1) and a fourth input pin (i.e., the second chip-select signal pin PIN_CSC shown in FIG. 1), respectively. As shown in FIG. 5, when the row address chip-select signal CSR or the column address chip-select signal CSC is at an enabling state, the memory chip can receive the row address signals or the column address signals. Briefly summarizing the above method for accessing the memory chip, in the embodiment of the present invention, the lengths of the six row address command packages of the six row address signals are equal to four clock periods, and each row address command package comprises four row input commands; and the lengths of the five column address command packages of the five column address signals are equal to four clock periods, and each column address command package comprises four row input commands. Counting the eleven address input signals mentioned above, the two clock signals CLK and #CLK, the row address chip-select signal CSR, the column address chip-select signal CSC, an on-die termination signal ODT, a synchronous signal CKE, a calibration signal ZQ, and a reset signal RESET, the method for accessing the memory chip provide by the embodiment of the present invention needs nineteen input signals. That is, the memory chip only requires nineteen input pins. In contrast to the prior art memory chip having twenty-nine input pins, the present invention indeed reduce the input pins of the memory chip. Therefore, the layout of the DIMM is easier, and the testing cost can also be reduced. Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. 1. A method for accessing a memory chip, comprising: positioning a plurality of first input pins and a plurality of second input pins on the memory chip; respectively inputting a plurality of row address signals into the plurality of first input pins, where a length of a row address command package of each row address signal corresponds to a plurality of clock periods of a clock signal; and respectively inputting a plurality of column address signals into the plurality of second input pins, where a length of a column address command package of each column address signal corresponds to a plurality of clock periods of the clock signal. 2. The method of claim 1, wherein the row address command packet comprises a plurality of row input commands, and the column address command package comprises a plurality of column input commands. 3. The method of claim 2, wherein the length of the row address command package corresponds to four clock periods, and the row address command package comprises four row input commands. 4. The method of claim 3, wherein quantity of first input pins is six. 5. The method of claim 4, wherein the row input commands of the six row address command packages of the six row address signals comprises four pieces of setting information of bank address, sixteen pieces of setting information of memory address, and four pieces of memory control command setting information. 6. The method of claim 5, further comprising: decoding the four pieces of memory control command setting information of to generate a memory control command. 7. The method of claim 2, wherein the length of the column address command package corresponds to four clock periods, and the column address command package comprises four column input commands. 8. The method of claim 7, wherein quantity of second input pins is five. 9. The method of claim 8, wherein the column input commands of the five column address command packages of the five column address signals comprises at least four pieces of setting information of bank address and thirteen pieces of setting information of memory address. 10. The method of claim 8, wherein the column input commands of the five column address command packages of the five column address signals comprises at least a write enable (WE) input command, a auto-precharge (AP) input command, and a burst chop/burst length (BC/BL) input command. 11. The method of claim 1, further comprising: positioning a third input pin and a fourth input pin on the memory chip; inputting a first chip-select signal to the third input pin into utilize the memory chip to receive the plurality of row address signals; and inputting a second chip-select signal to the fourth input pin into utilize the memory chip to receive the plurality of column address signals.

2008-05-29

en

2009-12-03

US-202016899309-A

Method and system for identifying an opportunity ABSTRACT A computer-implemented sales assistance method that monitors electronic activity and searches for events and generates a collection of signals from said events is presented. The method receives user criteria via a user interface that include the selection of keywords and signals, scores the signals using the criteria, and extracts one or more opportunities from the signals and determines actions that users should follow to meet the opportunities. The method is capable of providing a timeline for an opportunity, a window of opportunity, an opportunity map as well as a list of potential buyers associated with an opportunity, together with their inferred contact information and email addresses. The method is particularly useful for sales and business development, but it has utility in other scenarios as well. RELATED FIELD This invention generally relates to identification of an opportunity from digital activities, and more specifically to the field of mining digital processes that underpin client interactions with a business. BACKGROUND The Internet has revolutionized the way in which customers/clients approach the adoption of a new enterprise solution. Customers/clients may search the Internet for companies providing a given solution, and this search information in turn provides valuable clues to a sales organization that provides that given solution. For example, if Company A performs a lot of searches with words such as “copyright infringement,” “intellectual property law firm,” and “copyright attorneys,” those searches provide a clue to law firms that handle copyright cases that there might be potential business to be won from Company A. A motivated customer/client may also post a potential job offer in a related job category when a certain stage in the budgeting process has been reached, so they may readily get on board with a new technology with a new hire. In this way, when the purchase of the new technology is finalized, they may install and use the product without costly or otherwise disabling delays. Typically, such hiring information is publicly available and is advertised, so that many candidates may be reached. Therefore, this would be another type of information that provides clues to a proactive sales organization. A method and system that provides sales organizations with sales leads by monitoring the information that is output by potential customers/clients is desired. SUMMARY Embodiments of the invention pertain to a computer-implemented method of identifying an opportunity that monitors electronic activity and searches for events, receives user criteria via a user interface, ranks the events using the user criteria, generates signals from the events, and extracts one or more opportunities from the signals and determines an action that is likely to turn the one or more opportunities into sales. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1A is a pictorial illustration of a timeline, and early, active, definite and missed opportunities. FIG. 1B is an example illustration of a User Interface showing top signals. FIG. 2 is an example illustration of User Interface showing a six-week window of opportunity. FIG. 3 is a pictorial illustration of an opportunity map showing cities where certain opportunities are present. FIG. 4 is a flow chart describing a signal processing engine. FIG. 5 is a depiction of signals. FIG. 6 is a flow chart describing the process of data crawling for news, social media and job postings. FIG. 7 is a flow chart describing signal scoring for news, social media and job postings. FIG. 8 is a flow chart describing the process of data crawling for client searches. FIG. 9 is a flow chart describing the process of signal scoring for client search surges. FIG. 10 is a flow chart describing the computation of opportunity probabilities and risk probabilities. FIG. 11 is a flow chart describing the usage of machine learning. FIG. 12 is a flow chart describing growth signals. FIG. 13 is an example illustration of a User Interface showing the identification of potential buyers. FIG. 14 depicts a block diagram showing how the different parts of the disclosure are interrelated, in accordance with an embodiment of the inventive concept. DETAILED DESCRIPTION The disclosure pertains to an improved method and system for digital sales lead mining. The present invention is particularly useful for sales and business development, but it has utility in other scenarios as well. Generally, as customers interact with a business, events (e.g., searches, job postings) happen that can provide useful insight into what is going on with the customers. When those events are logged and thoughtfully processed, it is possible to automatically extract information that can be acted upon. Enterprises that fail to automate such processes over time are likely to fall behind their competition as they will spend additional energy and time obtaining sales lead information that could have been already available to them, yet that they have missed due to their antiquated infrastructure. Meanwhile, their more agile competition may have already acted and capitalized on an opportunity. For instance, when customers research a solution or take steps toward staffing their organization for a particular skill, such information is generally publicly available. A well-informed sales organization may access this information and infer that a customer is ready to purchase a certain product or solution. A motivated customer may interact with a certain supplier but may also interact with competitors of that supplier, and the nature of such interactions can be telling of the stage of the contemplated transaction. Such patterns of interaction might even reveal that an opportunity was missed as the customer is too far along in their negotiation and purchasing process with a competitor. Certain external factors may also signal that a buying intent is imminent. Certain court cases, such as a copyright infringement case, for instance, may prompt various actions inside companies that are potentially affected by such decisions, and these actions may feature economic decisions involving the purchasing of specialized products, services or solutions. By way of another example, a company may announce publicly that they are settling a lawsuit. This event may signal to this company, certain competitors, or possibly an entire business sector, that they will want to invest in a solution designed to avoid similar complaints or legal problems. The location of certain offices of employers and relevant actors may also be significant. For example, if multiple Internet search queries for a certain topic are originating from the same corporate office, this raises the probability that a concerted effort to research a subject and possibly acquire a product is being entertained. This would also allow to predict which Business Unit of a certain company would be interested in a product and possible names and titles of the people involved in such queries. Such names and titles can be inferred by searching websites and relevant databases. A number of systems and methods have been described for some type of sales process mining. For example, U.S. Pat. No. 10,509,786 to Oley Rogynskyy et. al. attempts to automatically match records based on entity relationships. This system by Rogynskyy et. al. focuses on constructing a node graph based on electronic activity. It lacks the concept of timeline and window of opportunity as in the present invention. U.S. Pat. No. 10,210,587 to Neal Goldman describes a system that nurtures relationships by providing users news and other events that happen to people they are connected to. Goldman's system lacks the concept of signals that typically characterize the nature of the business relationship, and also fails to capture other data sources such as client searches and job postings. U.S. Pat. No. 10,430,239 to Lei Tang et al. describes a system that predicts the possible completion of a first set of sales tasks based on the calibrated completion of a past set of sales tasks. This system fails at understanding external client activity and therefore the risks associated with an opportunity (e.g., if the client starts interacting with a competitor). It also lacks the understanding of the buying influence of the client, which is a critical weight in the importance of the sales tasks at hand. Many salespeople do busy work but interact with low level clients. U.S. Patent Application Publication No. 2019/0378149 to Hua Gao et al. describes a system that generates sales leads by comparing target clients similarities in fitness, engagement, and buying intent. This method, however, lacks explanation of the specific signals that makes a lead relevant to a salesperson, ultimately causing trust issues with the result and preventing a successful engagement on the basis of specific trigger events that one can state in an introduction email. U.S. Pat. No. 10,475,056 to Amanda Kahlow describes a system that predicts sales readiness based on a timeline of events from various website visitors data sources, and identifies spikes of events that indicate buying interest. The prediction is primarily driven from internet search and website activities, and does not consider internal sales activity, company profile fitness data, and buyer engagement data. It does not determine the probability of an opportunity to close, but provides a weighted average of events based on data source type and event freshness. Moreover, it does not provide a buyer map and relevant buyers to engage, nor does it suggest topics of interest. A white paper titled “Workflow Mining: Discovering Process Models from Event Logs” was published in IEEE Transactions on Knowledge and Data Engineering—Volume 16, Issue 9, and numbered DOI: 10.1109/TKDE.2004.47. The paper presents a new algorithm to extract a process model from a “workflow log” containing information about the workflow process, as it is actually being executed, and represents it in terms of a Petri net. This white paper lacks domain specificity, with both the data and concepts related to the sales process and opportunity signal mining, namely the Buyer Timeline and Buyer Stage. It also lacks the signal mining required to transform raw and noisy data into growth signals useful to salespeople. Lastly, it lacks the relevant buyer map and buyer engagement information, which is critical to not just discover, but also execute, a sales process. The system of the disclosure is capable of providing a timeline for an opportunity, a window of opportunity, an opportunity map, a series of signals as well as a list of potential buyers associated with an opportunity, together with their inferred contact information and email addresses. General Layout As used herein, a “user” or a subscriber is a person or entity who has permission to use the sales process mining system to obtain information about business opportunities, or a person or entity looking for a sales lead. A “client” or a “target” is a person or entity whose business is of interest to the user, and may be public or private person or entity related to or supporting the user's industry sector. “Client searches” are searches performed by clients or targets. FIG. 14 is a block diagram of the general layout of the sales process mining system 10 in accordance with an embodiment of the disclosure. The sales process mining system 10 generally monitors electronic activity and searches for relevant “events,” then generates signals indicating relevant events. The monitoring is done by data crawler 6000 that crawls predefined set of websites including news, social media, and job postings, as well as client searches, based mostly on text representations. The data acquired by crawling are then processed and analyzed, optionally with the help of machine intelligence, to yield signals, growth signals, opportunities and risk probabilities, and buyer identification. These metrics guide user/clients with their decision on when and where to invest their sales/marketing efforts. As shown, the system 10 receives user criteria 14001, which may include keywords 14002, from a user interface. Data crawler 6000 and event ranker 7000 access information received via the user interface 12, such as the user criteria 14001. “User criteria” may include a target market and products/services that are sold by the user/client. “Target market,” in turn, includes company sector and size, and may be as specific as names of entities. The data crawler 6000 crawls through news 6010, social media 6020, and job postings 6030. In addition, the data crawler 6000 also crawls client searches 8050. Events are selected and ranked or weighted by an event ranker 7000, based on the centrality and importance of an entity (e.g., an entity in target market) in the article or posting. The output of the event ranker 7000 is fed to the signal processing engine 4001. The signal processing engine 4001 generates signals 1050 and growth signals 12000. Signals 1050 and growth signals 12000 are, in turn, used for opportunities and risk probability processing 10000 and buyer identification 13000 with the help of machine intelligence 11000. As a result of these operations, one or more reports are generated, such as a timeline report 1001, a window of opportunity 2000, actions 2010, and an opportunity map 3001. Each part of the sales process mining system 10 will now be described in more detail. Signals A “signal” indicates that there may be an activity or opportunity of interest. A signal may be based on an event (e.g., a client search or a job posting) or a plurality of events (e.g., a surge in client searches for short-term loans). The events that are extracted from various data sources are ranked and converted into signals 1050. FIG. 1B depicts signals 1050, which correspond to particular events that were identified as being relevant and ranked based on user criteria, using a process which is disclosed herein. An Early Signal 1061 may correspond to an Internet search for a specific term in the field such as “leveraged loan” for a firm providing financial services of the particular kind. In the example that is shown in FIG. 1B, six events are indicted to be early signals 1061. An Active Signal 1062 may correspond to an announcement of a strategic hire in a specific job that is required in the art. An example for a firm providing financial services would be “investment officer”, or the acronym “CIO”. An Active Signal 1062 may also correspond to the search for specialized consultants in the field who may assist in the selection of products, risk assessment, as well as implementation. As a prospect looks for such consultants, they may search the Internet for the names of firms that are well known in supplying such consultants and typical search terms might be (in lowercase) “cambridge associates” or “franklin park”, or the like. In the example of FIG. 1B, three events are categorized as active signals 1062. A Definite Signal 1063 is generated based on an event indicating a search for a specific brand of solution or company name able to supply such solution. Exemplary search terms might be (in lowercase) “napier fund” or “joseph lane”, or the like. In the example of FIG. 1B, one event is categorized as a definite signal 1063. FIG. 5 depicts examples of signals and Opportunities, wherein opportunities are determined based on number and type of signals. Generally, Opportunities (further illustrated in FIG. 1A) are less specific than the signals that are shown in FIG. 1B. Signal 5001 consists of an anonymous website visit on October 6th. “Anonymous website visit,” as used herein, means someone visited the client's website anonymously, such that the user does not know the identity of the person or the entity affiliated with the search. Signal 5002 consists of a competitor website visit made by a client or target company on October 6th. The client's interest in a competitor may signal a lead for the user. Signal 5003 consists of a job posting for “digital content specialist” by the target company on August 7th. Signal 5004 consists of a surge in searches for “copyright violation” on June 2nd. Signal 5005 consists of a United States court case filing for “copyright infringement” on April 18th. Each of signals 5001, 5002, 5003, 5004, and 5005 may be categorized into early signal, active signal, or definite signal. When combined, these signals may generate an Active Opportunity 1011 or maybe even a Definite Opportunity 1012 because the chronology of the individual signals indicate that the client or target has some type of copyright issue and needs services to deal with the issue. The fact that the client visited a competitor website in signal 5002 indicates that the client is actively searching for professionals to hire, and that perhaps the anonymous website visit of signal 5001 was made by the same client. Timeline Report Referring to FIG. 1A, a timeline report 1001 is presented with time 1030 on the horizontal axis and a probability trend 1040 on the vertical axis. The timeline report 1001 generally divides up the probability trend into different types, each type being characterized according to opportunity level. In the example embodiment of FIG. 1A, there are four types: an early opportunity 1010, an active opportunity 1011, a definite opportunity 1012, and a missed opportunity 1013. Specific dates 1020 such as November 1st or December 1st are also represented as points of reference. The timeline report 1001 of FIG. 1A is specific to a target or client. An early opportunity 1010 is typically labelled as such when one observes any or all of the following elements: 1. A surge in client searches of a keyword or specialized term of the art, such as “leverage loan” or “asset-based securities” or “mortgage backed securities” or “loan obligation” or any such term that a potential client would we expected to look for on a search engine of the Internet. 2. A visit or multiple visits on the user's web site; 3. Searches for competitor solutions. An active opportunity 1011 is typically labelled as such when a strategic hire is being announced or when there is a surge in client searches on particular consultants who are specialists in the field of interest. It is thought that the consultants will be needed to select a particular solution, or possibly assess its feasibility, or possibly assist in implementing such solution. A definite opportunity 1012 is labelled as such when there is evidence that a customer is looking for a specific brand or company name. A missed opportunity 1013 is labelled as such when information is uncovered establishing that a customer has decided upon a competing product. This may correspond to a public statement such as a press release on either the customer or competitor side, or both sides. Other information may also allow to infer a similar conclusion. Efforts to win the opportunity are pointless at this stage. A sales organization may then choose to acknowledge that sale and monitor the progress of the installation. Referring back to FIG. 1A, the timeline 1001 also typically represents certain phases 1051, 1052, 1053, 1054. In Phase 1051, there is a preponderance of Early Opportunity 1010 being observed and collected by the system of the present disclosure. Referring to the example in FIG. 1A, Phase 1051 occurs before August 1st. In Phase 1052 there is gradual growth in the number of Active Signals being observed and collected. Referring to the example in FIG. 1A, Phase 1052 occurs between August 1st and November 1st. In Phase 1053 a Definite Opportunity 1012 is detected based on type and number of signals. Referring to the example in FIG. 1A, Phase 1053 occurs during November. In Phase 1054 a Missed Opportunity 1013 is detected based on types and number of signals. Referring to the example in FIG. 1A, Phase 1054 occurs after December 1st. Phases are useful for the computation of windows of opportunity. Windows of Opportunity Referring to FIG. 2, a Window of Opportunity 2000 is illustrated. By analyzing the timeline 1001 of FIG. 1A, one may observe that certain phases, such as 1051, and 1052, have typically longer durations and other phases such as 1053, and 1054 have typically shorter durations. This means that there is typically a short span of time for a phase 1053 during which a definite opportunity 1012 is available. In the particular example illustrated in FIG. 2 the corresponding phase 1053 indicating an active opportunity 1012 lasts about six weeks and thus represents a six-week window of opportunity 2000. This will be the best time for the client to execute on a strategy to win a given prospect. This means that the seller's offer should be fully presented and available to relevant buyers during the window of opportunity 2000. Once the window of opportunity 2000 closes, there will be little time left to influence a decision and it likely will be too late to start a campaign. Therefore, action must be taken, and a strategy executed while the window of opportunity 2000 remains open. To assist the client in deploying such strategy, and as illustrated in FIG. 2, the present invention may list certain Actions 2010 that the client may perform to accomplish their goal. The present invention may also assign a Score 2020 pertaining to the validity of certain Actions 2010. An example of such Action 2010 is to contact a certain buyer at a certain company within a prescribed window of time. A number of such Actions 2010 may be presented by the system together with a score vouching for the confidence behind such action. As shown in the example of FIG. 2, an Action 2010 indicates target type, such as industry sector (e.g., Healthcare company) and a signal score 2020 (e.g., 274). In one embodiment, a higher signal score indicates a stronger reason to pursue this opportunity. More information about signal scoring is provided below. Opportunity Map In another aspect of the present invention and referring to FIG. 3, an Opportunity Map 3001 is introduced. As shown in FIG. 3, several signals are represented inside a signal types pie chart 3010. These include signals related to federal regulators 3011, social media signals 3012 and client search surges 3013 and indicate sources of relevant signals (e.g., announcements, publications, searches). In the particular example illustrated in FIG. 3, federal regulators 3011 represent 20% of the area contained in Chart 3010, while social media signals 3012 represent another 20% and client search surges 3013 represent the rest, 60%. A schematic map 3020 of the geography of relevance is also drawn as part of FIG. 3. It also displays certain relevant cities 3015 for the client. The abovementioned signals 3011, 3012, and 3013 are also associated with a geo-location as is depicted later in the present specification, and can thus be displayed on the map 3020 with a surface area corresponding to their percentages of the chart 3010, and therefore, a measure of their importance. Relevant cities 3015 are also shown, “relevant” meaning that those cities may be of interest to the particular user to whom the map 3020 is presented, based on user criteria. Different users would be shown different relevant cities 3015. A location that is associated with a signal may be the location where a social media posting or client search originated. In the example map 3020 that is depicted in FIG. 3, the federal regulators 3011, the social media 3012, and client search surges 3013 are all clustered around one area. The cluster of searches provides clues to the user that there might be an event of interest happening in that area. The opportunity map 3001 combines the chart 3010 with a geographical map 3020 to portray a picture of the cities or geographies associated with the signals and their relative importance. A client using the opportunity map 3001 may thus infer which corporate offices are transmitting such signals and the system 10 may also help in suggesting which corporate officers or employees may be associated with such signals, as will be explained below. Signal Processing Engine In another aspect of the system, a Signal Processing Engine 4001 is introduced. Referring to FIG. 4. The reports described above are based on the output of the Signal Processing Engine 4001, as shown in FIG. 14. The Signal Processing Engine 4001 comprises three main stages: Noise 4010, Signal Processing 4020, and Opportunity 4030. Noise 4010 refers to a very high number, several billions, of economic data points that surface on a daily basis. These include any or all of the following: Social media rumors Breaking news Client searches Cyber web Cloud usage Interest surges Programmatic advertising Job postings Job seeking behavior Product shipments Calls and emails Company and people web profiles Specialized industry websites This is not an exhaustive list, and other economic data may be included. Furthermore, combinations with fewer than all the above economic data points may be used as well. Signal Processing 4020 refers to a small relative number, on the order of one for every ten thousand, of events that are actionable for a particular client. These include: Active hiring Key sponsor leaving Settlement reached Surge in employee interest Lack of executive team coverage Client interaction with a competitor Industry-related trigger event. This is not an exhaustive list, and other events may be included. Furthermore, combinations with fewer than all the above events may be used as well. An Opportunity 4030 may surface from assessing the impact of each new signal. When grouping signals by product and by company it becomes possible to identify that certain signals represent potential opportunities. For instance, for a client involved in financial services the signals that may indicate an opportunity could include: News: Announcement of Material Weakness Searches: Headquarters searching legal websites Visits: Headquarters visited client website 4 times Jobs: Hiring new CFO Buyers: Contacts found in LinkedIn to connect with In order to provide a score for the Opportunity 4030, the following criteria may be used: risk sensing, buying intent, expertise required, relationship capital. This is not an exhaustive list, and other criteria may be included. Furthermore, combinations with fewer than all the above criteria may be used as well. Data Crawling for News, Social Media, and Job Postings In another aspect of the system, in order to process and extract such signals from the available data sources, the following methods are being used. When the data sources consist of news, social media and job postings, and referring to FIG. 6, the method operates as follows. Referring to FIG. 6, the signal extraction process 6000 of Data Crawling for News, Social Media and Job Postings is depicted. A first step in signal extraction 6000 is Crawl 6001. Crawl 6001 consists of continuously retrieving News 6010, Social Media 6020 and Job Postings 6030 from a multiplicity of data providers. Such news 6010, media 6020 and postings 6030 pertain to more than one million companies globally. In the present invention a single historical data store 6500 is created to draw signals from. This is a shared resource that is used for all clients. The news 6010, media 6020 and postings 6030 are filtered using keywords. As illustrated in FIG. 6, a second step in signal extraction process 6000 is Cleanse 6002. This step removes irrelevant text, tags, and the like that do not carry information. A third step in signal extraction process 6000 is named De-duplicate 6003. This step searches a historical data store 6500 for duplicates, marks those duplicates, and removes those. A fourth step in the signal extraction process 6000 is named Natural Language Processing 6004. Known techniques in natural language processing are used to extract organization names, people names, locations, etc. from the data sources. A fifth step in signal extraction process 6000 is named Sentiment Analysis 6005. This step uses known techniques to categorize opinions in the pieces of text forming the historical data store 6500. In this step the system 10 determines whether the text is positive, negative or neutral toward a topic affecting a particular client. A sixth and final step in signal extraction process 6000 is Entity Mapping 6006. In this step, the centrality and importance of an entity in a particular article or post is ranked. The particular industry and revenue level for each organization is also mapped. Signal Scoring for News, Social Media, and Job Postings In another aspect of the disclosure, and referring to FIG. 7, a signal scoring process 9000 for News, Social Media and Job Postings is depicted. The signal scoring process 9000 may follow the signal extraction process 6000, although this is not a limitation of the disclosure. Referring to FIG. 7, the signal scoring process 9000 for news, social media and job postings consists of three steps that extract a signal from noise and provide scoring. In a Query Step 7001, elements defining a signal such as keywords, website rank, and other filters are used to query the historical data store 6500 to find and create new signals. In the Query Step 7001, a base score (which is initially assigned by the sales process mining system 10) is also introduced and is associated with a time window of relevance. In the Client Matching Step 7002, signals that have entities matching clients, their competitors, their customers, and their potential customers are tagged. In the Signal Scoring Step 7003, signals are geo-coded and associated with a relevant city 3015 using known geo-coding methods. This geo-coding allows a filtering step based on relevant geography. A final score is applied using the following elements, including but not limited to: Configured Factors: Signal Type Stage Impact Calculated Factors: Sentiment Location Activity Volume Time-based Surges Keyword Relevancy Time Decay (Optional) Dynamic Factors (Machine Learning Model created to generate weighting score) Outcome-based User Feedback: Tagging Signals with Won or Rejected Deals Quality Control-based User Feedback: QA Engineers rejecting a signal The Signal Score is then Calculated: Signal Score=Normalized (Signal Type)+Normalized (Sentiment)+Normalized (Activity Volume)+Normalized (Time-based Surges)+Normalized (Keyword Relevancy)+Normalized (Time Decay)×Weighted Factors (Outcome-based User Feedback+Quality-Control-based User Feedback) Data Crawling for Client Searches In a further aspect of the disclosure, and referring to FIG. 8, a client search crawling process 8000 is depicted. During the client search crawling process 8000, crawling is done through the searches conducted by the client, which are stored in the historical data store 6500. The client search crawling process 8000 may follow the signal scoring process 7000, but this is not a limitation of the disclosure. Referring to FIG. 8, the client search crawling process 8000 of signal scoring for Client Searches 8050 comprises three sub steps. Client Searches 8050 are of a different nature from News 6010, Social Media 6020 and Job Postings 6030 and require different processing. There is more granularity in the client search data, such as typically two hundred million records per day, compared to one million records per day. Accordingly, additional processing power is required. The three steps depicted below attempt to extract a signal from noise. In the Crawling Step 8001, search data files are being retrieved on a daily basis from file share locations. In the Processing Step 8002, approximately ninety percent of the search data is pruned by eliminating searches that are not associated with target companies. Eliminated searches may emanate from someone's home, or someone's mobile device for instance. Home and mobile searches may, however, be added back once it is established that such users log into company accounts on a frequent basis. In the Indexing Step 8003, individual search records are being geo-coded using known methods and entered into the historical data store 6500. Signal Scoring for Client Search Surges In a further aspect of the disclosure, and referring to FIG. 9, a client search signal scoring process 9000 is depicted. When there is a surge in searches conducted by clients, the searches are scored according to the factors depicted above in reference to FIG. 7. The client search signal scoring process 9000 may follow the client search crawling process 8000, but this is not a limitation of the inventive concept. Referring to FIG. 9, the client search signal scoring process 9000 comprises four steps. These steps attempt to extract a signal from noise and provide scoring. While articles and posts by themselves can be individual signals, for the client search data it is the sum of hits (or matches) on keywords and the surges of the same that may define a signal. In the Query Step 9001, keyword definitions and target companies and organizations are used to query the historical data store 6500 to find relevant search data. In the Signal and Surge Step 9002, search matches are associated with companies and locations and a trending analysis is performed over the last few months of data to determine if a surge has occurred. “Surges” are defined as quantities that are significant when compared to a baseline over a few months as determined by known methods. In the Client Matching Step 9003, signals that have entities matching internal clients are tagged. In the Signal Scoring Step 9004, signals are matched based on the industry relative to entities as well as revenue. Signals are also geo-coded and associated with a relevant city 3015 using known geo-coding methods. In this way, a filtering step based on relevant geography can be applied. A final score is applied using the following elements, including but not limited to the following: Determination of a surge Internal client matching Industry Revenue, relevant city 3015. Relevant geography Opportunities and Risks Probability Processing In a further aspect of the disclosure, and referring to FIG. 10, an opportunities and risks probability determination process 10000 is depicted. The opportunities and risks probability process 10000 may follow the probability determination process 9000, but this is not a limitation of the disclosure. Referring to FIG. 10, Signals are the building blocks that are combined and analyzed to determine Opportunities and Risks. The opportunities and risks probability determination process 10000 comprises three steps. In step 10001, signals are grouped by product and company. In step 10002, base probability is generated using a plurality of factors including the following: Signal types Signal scores Signal weight adjustments Signal timing Company industry Company size Location Prior actions. Some or all of the above factors are combined to compute a base probability for each signal, using statistics and ML models based on prior actions. The base probability, which is the probability of turning this opportunity into a deal/sale, is useful to determine what an end user should see as a priority. In step 10003, signals are compared to one another with their attached base probabilities and a score is attached to each probability. Score Probability is calculated as: the Sum of each Signal Score×Normalized (Company size+Company Industry+Signal Type+Location+Prior actions). Machine Intelligence Usage In a further aspect of the present invention, and referring to FIG. 11, a machine intelligence usage process 11000 is depicted. Referring to FIG. 11, Machine Learning (or Machine Intelligence) is used at different stages of the process described herein. Machine Intelligence is used for two main tasks: Eliminate noise 11001 and Assess Relevance of Signal 11002. In Eliminate Noise 11001, an assessment is made as to whether a given signal is useful information or should be considered as noise. This step is an ongoing data quality process, comprising a feedback loop. In order to obtain feedback, users and customers of the system 10 are presented with alternative potential signals and asked to vote for the ones that they consider to be relevant, and the ones that they consider to be irrelevant. This provides feedback material for a machine learning process to operate using known machine learning methods such as “XGBoost”. In the second step 11002, feedback is received from clients on whether the signal is adapted to their focus area. More specifically, feedback of the following types is sought. “Show me more of this” “I am not interested in that” In order to process such feedback, Bayesian models known in the art are used, similar to the Bayesian models that are routinely used in an electronic mail system for “spam filtering” operations. Growth Signals In a further aspect of the present invention, and referring to FIG. 12, Growth Signals 12000 are depicted. Growth Signals 12000 are presented as the combination of Fit 12001, Influence 12002 and Intent 12003. Fit 12001 corresponds to the current sales intelligence status quo in the art, and comprise such criteria including some or all of the following: Firm information: Sector Size Location Digital Index Cloud Technologies Social Media presence Supply chain Growth Trends Job openings Website Profile Search Engine Optimization Keywords Influence 12002 comprises some or all of the following criteria: Job Roles: Function Seniority Business Unit Size Legal Entity Location Affinities Skills Experience Career Path Personality Culture Affiliations Ownerships Partnerships School Alumni Board Memberships Markets Competitor Event Industry Event Intent 12003 comprises some or all of the following criteria: Topic Surge: Internet Search Internet Browsing Corporate Events Corporate Social Media Sales Emails Marketing Campaigns Usage Surge: Product Shipments Service Usage Payments Interaction Volume Transaction Volume Identification of Potential Buyers In a further aspect of the disclosure, and referring to FIG. 13, potential buyers may be identified by the system 10. Referring to FIG. 13, an example illustration of a User Interface shows the potential Buyers report 13001. A map 13002 of relevant territory is also displayed with the location 13003 associated with each Buyer 13001. Users typically provide information pertaining to a target market, preferably including company sector and size, as well as information on products and services sold. Further referring to FIG. 13, Buyers may be displayed on a Buyers List 13004. Each buyer 13001 on the list may be associated with one or more of the following: phone number, email, title, address, Social Media channel. Such buyer information and channel of potential contact should be regarded in an illustrative rather than a restrictive sense. Such information may be obtained by querying the Store 6500, finding names and titles of officers in certain signals related to news and job postings, and accessing databases such as LinkedIn. While the embodiments are described in terms of a method or technique, it should be understood that the disclosure may also cover an article of manufacture that includes a non-transitory computer readable medium on which computer-readable instructions for carrying out embodiments of the method are stored. The computer readable medium may include, for example, semiconductor, magnetic, opto-magnetic, optical, or other forms of computer readable medium for storing computer readable code. Further, the disclosure may also cover apparatuses for practicing embodiments of the inventive concept disclosed herein. Such apparatus may include circuits, dedicated and/or programmable, to carry out operations pertaining to embodiments. Examples of such apparatus include a general-purpose computer and/or a dedicated computing device when appropriately programmed and may include a combination of a computer/computing device and dedicated/programmable hardware circuits (such as electrical, mechanical, and/or optical circuits) adapted for the various operations pertaining to the embodiments. Various modifications and changes may be made as would be obvious to a person skilled in the art having the benefit of this disclosure. It is intended to embrace all such modifications and changes and, accordingly, the above description to be regarded in an illustrative rather than a restrictive sense. What is claimed is: 1. A computer-implemented method for identifying an opportunity, comprising: monitoring electronic activity and searches for events, receiving user criteria via a user interface, ranking the events using the user criteria, generating signals from said events, extracting one or more opportunities from the signals and determining an action that is likely to turn at least one opportunity of the opportunities into sales. 2. The computer-implemented method of claim 1, wherein the generating of signals further comprises: removing irrelevant text and tags, and removing duplicates from events; using natural language processing to extract organization names, people names and locations from the text, and categorizing opinions in the text, and determining if the text is positive, negative or neutral toward a topic. 3. The computer-implemented tracking method of claim 2, further ranking the centrality and importance of an entity in a data source. 4. The computer-implemented tracking method of claim 1, wherein the user criteria comprise a target market and products and services that are sold. 5. The computer-implemented tracking method of claim 4, wherein the target market further comprises data on company sector and size. 6. The computer-implemented method of claim 1, wherein the events are extracted from one of the following data sources: news, social media and job postings, and client searches. 7. The computer-implemented tracking method of claim 1, wherein the generating of signals from the events comprises: matching entities with clients, matching signals relative to entities and revenue, geo-coding signals and associating signals to a relevant geography, and determining a score using one or more of: a base score, A time window, Entity, Revenue, Relevant geography. 8. The computer-implemented tracking method of claim 1, wherein generating the signals from the events comprises: determining whether a surge of searches has occurred, matching entities with clients matching signals relative to entities and revenue geo-coding signals and associating signals to a relevant geography determining a score using one or more of: a base score, entity, revenue, relevant geography. 9. The computer-implemented method of claim 1, further comprising determining opportunities and risks by: grouping signals by product and company, generating a base probability, comparing signals to one another and attaching a score to each base probability. 10. The computer-implemented method of claim 9, wherein the base probability is generated by factoring one or more of the following: Signal types, Signal scores, Signal weight adjustments, Signal timing, Company industry, Company size, Location, Prior actions. 11. The computer-implemented method of claim 1, further comprising characterizing the opportunity as one of the following based on the events: An early opportunity, An active opportunity, A definite opportunity, A missed opportunity. 12. The computer-implemented method of claim 1, further associating a window of opportunity to the opportunity, wherein the window of opportunity represents a time period during which the action, if taken, has maximum likelihood of turning the opportunity into sales. 13. The computer-implemented method of claim 1, further associating an opportunity map with an opportunity, wherein the opportunity map displays the geographical locations from where the events originate, and wherein a surface area associated with a signal indicates the importance of the signal. 14. The computer-implemented method of claim 1, further associating a chart with an opportunity, wherein the chart displays data sources associated with the opportunity, and wherein a larger surface area on the chart indicates that more signals originated from the data source represented by that larger surface area. 15. The computer-implemented method of claim 1, further defining an opportunity by assessing the impact of signals and grouping signals by product and company. 16. The computer-implemented method of claim 1, the action includes contacting a predetermined buyer. 17. The computer-implemented method of claim 1, wherein the user criteria include data pertaining to a target market, and products and services sold. 18. The computer-implemented method of claim 17, wherein the user criteria include contact names of buyers. 19. The computer-implemented method of claim 18, wherein the buyers are displayed in at least one of a list and a map. 20. The computer-implemented method of claim 18, further comprising obtaining one or more of the following for the buyers: Name, Title, Phone number, Email, Social Media channel, Address.

2020-06-11

en

2021-12-16

US-201615189394-A

Vehicles with aerodynamic spoiler and retractable sensing systems ABSTRACT A vehicular sensing system, a vehicle and a method of performing one or both of vehicular mapping and navigating operations using the sensing system. The sensing system is secured to a roof or other suitable location on the vehicle and includes one or more sensors configured to acquire at least one of vehicular mapping and navigational data, a retractable mounting structure to move the sensor or sensors between a deployed and stowed position, and an aerodynamic spoiler, air dam or deflector. The body of the spoiler acts as a housing with a recess formed in its upper surface such that upon placement of the spoiler on the roof, the recess provides a location within the spoiler to permit storage of the mounting structure and sensors when they are in their deployed (non data-acquisition) mode of operation. The size and placement of the mounting structure and sensors is such that they do not detract from the aerodynamic or aesthetic qualities of the spoiler. TECHNICAL FIELD The present specification generally relates to the use of sensors for vehicular mapping and navigation, more specifically, to roof-mounted vehicle sensing systems with retractable mounting structures that stow behind a roof-mounted spoiler when not in use. BACKGROUND Sensors such as lidar (light detection and ranging user laser light) can be used by vehicles to provide detailed 3D spatial information for the identification of objects near the vehicle, as well as the use of such information in the service of systems for vehicular mapping, navigation and autonomous operations. In order to be effective, these devices (which tend to be somewhat bulky) must be placed on locations on the vehicle that promote a wide and relatively unencumbered range of detection or field-of-view; such locations include the roof, hood or the like. Unfortunately, such placement can be both aerodynamically and aesthetically objectionable. Accordingly, a need exists for alternative devices and methods for promoting the acquisition of mapping and navigation data for—among other things—autonomous vehicle operation without the drawbacks of conventional sensors and sensor-actuation componentry. SUMMARY In one embodiment, a sensing system for use on a vehicle is disclosed. The system includes one or more sensors configured to acquire vehicular mapping, navigational or related data. The system also includes a retractable mounting structure that can be used to selectively raise and lower the sensor or sensors depending on whether the vehicle to which the system is attached is in a data collection mode of operation or not. The system additionally includes a spoiler that houses the sensor and mounting structure. The spoiler is shaped to have an elongate dimension and an airflow dimension that are substantially transverse to one another so that the elongate dimension can be secured to the roof of the vehicle along a direction that is substantially transverse to the intended travel direction of the vehicle. The housing of the spoiler has a recess formed in its upper surface for stowed placement of the mounting structure and sensor. In this way, the cooperation between the spoiler, sensor and mounting structure permits selective movement of the sensor and the mounting structure between a stowed position and a deployed position. The system is compact enough to ensure that when the sensor and mounting structure are in the stowed position within the recess, the system defines a relatively unobtrusive profile that does not substantially alter the profile or contour of the spoiler, yet when placed in a deployed position permit the sensor to perform a data acquisition function commensurate with mapping or navigational operations, does so with an automated, simple mechanical movement. By using small (i.e., miniaturized) sensors, the mounting structure may be made up of correspondingly small linkage structure for placement into the housing recess. In another embodiment, a vehicle is disclosed. The vehicle includes a wheeled chassis with a passenger compartment, a motive power unit, a guidance apparatus cooperative with the wheeled chassis and motive power unit and a vehicular sensing system. The sensing system includes one or more sensors configured to acquire at least one of vehicular mapping and navigational data, as well as a retractable mounting structure secured to a spoiler that is mounted or otherwise secured to the vehicle roof. The spoiler is shaped to have an elongate dimension and an airflow dimension that are substantially transverse to one another so that the elongate dimension extends along a direction that is substantially transverse to the travel direction of the vehicle. The spoiler also acts as a housing for the mounting structure and sensors through a recess formed in its upper surface. In this way, the cooperation between the spoiler, sensor and mounting structure permits selective movement of the sensor and the mounting structure between a stowed position and a deployed position. In yet another embodiment, a method for performing at least one of vehicular mapping and vehicular navigation is disclosed. The method includes securing movement and data-acquisition components to a spoiler that is mounted or otherwise secured to the roof of the vehicle. As such, the data-acquisition components and spoiler make up a sensing system such that when one or more sensors that make up a part of system are in a deployed position, the sensor can operate in its intended data-acquisition mode, and when the sensor is in a stowed position, it is situated within the recess. The method additionally includes acquiring at least one of mapping data and navigational data through the sensor when the system is in the deployed condition. The spoiler is made up of a housing with an elongate dimension and an airflow dimension that are substantially transverse to one another. A recess formed in the housing's upper surface permits selective movement between the stowed position and the deployed position such that when the mounting structure and the one or more sensors are stowed within the recess, they define a substantially unobtrusive profile relative to the spoiler. In this way, the aerodynamic features made possible by the spoiler contour are substantially unaffected by the presence of the stored sensors and mounting structure. These and additional features provided by the embodiments described herein will be more fully understood in view of the following detailed description, in conjunction with the drawings. BRIEF DESCRIPTION OF THE DRAWINGS The embodiments set forth in the drawings are illustrative and exemplary in nature and not intended to limit the subject matter defined by the claims. The following detailed description of the illustrative embodiments can be understood when read in conjunction with the following drawings, where like structure is indicated with like reference numerals and in which: FIG. 1 depicts a perspective view of a vehicle with a sensing system in a deployed position according to one embodiment as described herein; FIG. 2 depicts the vehicle and sensing system of FIG. 1 when the sensing system is in a stowed position; FIG. 3 depicts a front elevation view of the vehicle and sensing system of FIG. 2; and FIG. 4 depicts a side cutaway elevation view of the vehicle and sensing system of FIG. 2. DETAILED DESCRIPTION Embodiments described herein are generally related to vehicles that are equipped with sensing systems (alternatively referred to as perception systems) for selectively acquiring mapping or navigational data through the use of a retractable mounting structure that moves lidar or related sensors between stowed and deployed positions. By integrating the structure that is used to selectively deploy the sensors into the spoiler, air dam, deflector or related airfoil that is mounted at or near the leading edge of the roof of the vehicle, aerodynamic and aesthetic limitations that are associated with the use of a traditional mapping or navigational data sensing system may be overcome. This system may be used to operate the vehicle at least partially in response to the acquired mapping and navigational data. More particularly, such operation of the vehicle may include autonomous vehicle operation. Referring first to FIGS. 1 and 2, a vehicle 10 includes a chassis 20 with a plurality of wheels 30. Chassis 20 may either be of body-on-frame or unibody construction, and both configurations are deemed to be within the scope of the present disclosure. A motive power unit 40 such as a conventional internal combustion engine (ICE), battery pack, fuel cell stack or a hybrid combination of one or more of the above may be situated in or on the chassis 20 to provide propulsive power to the vehicle 10. As shown, the motive power unit 40 is situated underneath a hood that is placed at the fore end of vehicle 10. A passenger compartment 50 is formed inside the chassis 20 and serves not only as a region to transport passengers and cargo, but also as a place from which a driver may operate vehicle 10. A guidance apparatus (which may include, among other things, steering wheel, transmission, accelerator, brakes or the like) is used in cooperation with the wheels 30, motive power unit 40 and other systems to control movement of the vehicle 10. A generally planar roof 60 defines a closure surface with contours along lateral and axial rooflines RL and RA at the top of vehicle 10. As can be seen, the lateral dimension is substantially transverse to the intended travel direction of vehicle 10, while the axial dimension is substantially collinear with the intended travel direction of vehicle 10. In some embodiments, the roof 60 may include periodic longitudinal ridges or lateral side downward tapering (neither of which are shown) for structural, aerodynamic or aesthetic reasons; none of these features detract from the fact that the roof 60 is mostly planar in both its side-to-side and front-to-back dimensions that correspond to the lateral and axial rooflines RL and RA. While the closure surface defined by lateral and axial rooflines RL and RA is illustrated as being generally planar, it may have one or more non-planar (i.e., curvilinear or arcuate) regions, features or both. Both planar and non-planar variants are within the scope of the present disclosure. In some embodiments of vehicle 10, the roof 60 may include one or more sunroofs 70 formed therein. In such configuration, the sunroof 70, which is preferably made from glass or an optically transparent synthetic resin, defines a substantially planar form that can mimic the shape of the roof 60 around it. In the present context, the term “sunroof” is meant to encompass any selectively deployable structure formed in the roof 60 of vehicle 10 that permits one or both of visual and open-air access between the passenger compartment 50 and the ambient environment. In some embodiments, the sunroof 70 can be opened and closed either manually or electrically, the latter by the operation of a motor and series of gears, pivots, slots and pins as understood by those skilled in the art. In some embodiments, the sunroof 70 moves along a path dictated by longitudinally-extending guide rails (not shown) that are part of a sunroof housing that is formed underneath the roof 60 and integrated within structural elements that may make up a portion of the chassis 20. Examples of such structural elements include A-pillars 22, B-pillars 24, C-pillars 26, crossbar 28 structure, as well as a roof rails, roof bows, or the like (the latter of which are not shown). In some embodiments, a weather strip is situated on the four peripheral side edges of the sunroof 70 in order to form a hermetic seal 75 when the sunroof 70 is in its closed position. Likewise, a roof recess 65 (which may also house a rain channel and other equipment, as well as a location with which to mount the sunroof 70 rails and related supporting structure) may be formed around the periphery of the opening in the roof 60 where the sunroof 70 is placed. Referring next to FIG. 3 in conjunction with FIGS. 1 and 2, in one embodiment, the sensing system 80 is made up of at least a retractable mounting structure 90, a spoiler 95 and one or more sensors 100. The spoiler 95 is formed across at least a portion of the width of the roof 60 that corresponds to the lateral RL and defines a generally aerodynamic (i.e., airfoil) shape with an elongate dimension 95 E and an airflow dimension 95 A that are substantially transverse to one another. Thus, the spoiler 95 has its elongate dimension 95 E that is substantially collinear with the lateral roofline RL. In one form, the spoiler 95 may be made from a rigid plastic material, while in others, it may be made from a metal, composite or other suitable structural material. Furthermore, spoiler 95 is constructed as a housing 95 H for other components due to its ability to be formed from a hollow shell construction. In such construction, the housing 95 H may also be the primary load-bearing structure for spoiler 95. In this way, the significant hollow volume that is formed between the shell can be used to house other components, such as actuators like motor M and gears G Likewise, the outer shell can be readily formed into a suitable shape to provide the intended aerodynamic contour 95 C. Moreover, a recess 97 (as shown with particularity in FIG. 1) may be formed in the housing 95 H of spoiler 95. This recess 97 defines a trough-like region into which the mounting structure 90 and sensors 100 may be placed. The placement of the spoiler 95 as part of the sensing system 80 is such that when mounted to the roof 60, it is at a position that is closer than the sunroof 70 to the front of the vehicle 10. The placement of the spoiler 95 axially upstream of the sunroof 70 helps to promote more desirable airflow patterns over the roof 60 in general, and in particular over the aperture that is present in the roof 60 when the sunroof 70 is in an open position. Such desirable airflow patterns are particularly advantageous during such open positions in that they help to reduce motion-induced wind noise that may otherwise be present in the passenger compartment 50. Referring again to FIG. 1, the sensing system 80 is shown in its deployed mode, where the retractable mounting structure 90 is configured as a kinematic assembly that moves within the recess 97. Within the present context, a kinematic assembly is a collection of one or more of trusses, rods, arms, cams, pivots, sliders, rollers, springs, gears or motors that when used in cooperation with one another can affect the selective movement of the sensing system 80 discussed herein. In such context, any reference to a linkage or related structure embodies at least a subset of some of these components working in conjunction with one another to bring about such selective movement. Because the recess 97 may be formed in the housing 95 H that is above the closure surface that is defined by the rooflines RL and RA, the kinematic assembly needed to move the mounting structure 90 and sensors 100 between their deployed and stowed positions may be housed in one or more of its hollow cavities, thereby avoiding the necessity of placing it in the roof recess 65, where it could otherwise detract from already-limited amount of usable space. In one embodiment, the mounting structure 90 is constructed to have purely pivoting movement between the stowed and deployed positions, as shown with the use of pivot (also referred to as pivot pins) 98. In another embodiment (not shown), the mounting structure 90 may be constructed as a slider-crank variant of a four-bar linkage, where a longitudinal groove that acts as a prismatic joint that is formed in the housing 95 H functions as a slider along which the truss 92 that acts as the driver or crank can rotate and translate. In addition, the truss 92 that forms the mounting rod or pole for sensors 100 may act as the connecting rod floating link. In a variation, the truss 92 that makes up the mounting rod of the mounting structure 90 may define a telescoping structure for additional deployed extension of sensors 100. In yet another embodiment, the mounting structure 90 may include other forms of construction (such as a scissor-truss or the like) in order to promote the selective deployment of the sensors 100 without having an unduly long profile when the sensing system 80 is placed in a stowed position. Significantly, all of these forms of construction can utilize relatively thin, substantially flat or cylindrical trusses 92 as a way to further ensure that the sensing system 80 is sized and shaped to fit within recesses 65 formed in the roof 60. It will be appreciated that all of the aforementioned forms of mounting structure 90 construction and operation are within the scope of the present disclosure. The one or more sensors 100 are secured along the mounting structure 90 such that upon having the sensing system 80 lifted up in to the deployed position shown in FIG. 1, the sensors are in an elevated height-wise position relative to vehicle 10, thereby allowing them a less-encumbered view of the road or related terrain from which mapping or navigation data is being acquired. Although shown as being secured to the remote end of the truss 92 from where such structure is pivotably secured to the roof 60 or sunroof housing, it will be appreciated that the sensors 100 may be placed anywhere along the length of the truss 92. Moreover, there may be more than one sensor 100 on truss 92, as well as more than one type (i.e., lidar, radar, optical or the like) of sensor 100, and that all such variants are deemed to be within the scope of the present disclosure. Lidar may offer suitable detection ranges (often up to 200 to 250 meters or more) and increased angular resolution that can be particularly well-suited to automotive applications where horizontal or vertical position identification of objects in the road may be performed with greater precision. Lidar may recognize size differences among identified objects, including those from a comparable distance and relative speed. This in turn can allow algorithms that act on the sensed data to draw more accurate conclusions about the type of object within the field of view of sensor 100, especially when the algorithms or software need to compress the three-dimensional data associated with a vehicle 10 in motion into a two-dimensional image suitable for displaying. In addition, lidar sensors can usually be produced at lower costs than comparable devices that operate in other bands within the electromagnetic spectrum. Examples of the use of sensor data in the pursuit of mapping and navigational operations include U.S. Pat. No. 8,112,178 entitled ROBOTIC PLATFORM FOR AUTONOMOUS AUTOMOTIVE VEHICLE DEVELOPMENT, U.S. Pat. No. 8,384,776 entitled DETECTION OF TOPOLOGICAL STRUCTURE FROM SENSOR DATA WITH APPLICATION TO AUTONOMOUS DRIVING IN SEMI-STRUCTURED ENVIRONMENTS, U.S. Pat. No. 9,062,977 entitled NAVIGATION OF ON-ROAD VEHICLE BASED ON OBJECT REFERENCE DATA THAT IS UPDATED and U.S. Pat. No. 9,239,580 entitled AUTONOMOUS MOBILE ROBOT, SELF POSITION ESTIMATION METHOD, ENVIRONMENTAL MAP GENERATION METHOD, ENVIRONMENTAL MAP GENERATION APPARATUS, AND DATA STRUCTURE FOR ENVIRONMENTAL MAP, all of which are incorporated herein by reference. Referring with particularity to FIG. 3, the sensors 100 define a relatively small package such that upon stowing the sensing system 80 into the spoiler 95, the mounting structure 90 and sensors 100 are completely nested. These significant miniaturization features can be employed, regardless of whether they operate within the optical, infrared, microwave or other bands within the electromagnetic spectrum. Furthermore, the aforementioned relatively small volume of the mounting structure 90 and sensors 100 means that they may be partially or even substantially completely contained within the recess 97 when the sensing system 80 is in its stowed position. Spring-loading or actuator-based pivoting rotation of each of the sensors 100 relative to the truss 92 or other components may be used to permit the angle of the deployed sensors 100 to be varied about at least horizontal 100 H and vertical 100 v axes as a way to increase their data acquisition capability. In addition to providing for improved fit, finish, aesthetic and aerodynamic integration of the sensing system 80 into spoiler 95, its stowage into recess 97 also helps to minimize exposure of the sensitive components to inclement weather, damage, vandalism or the like. In some embodiments, the sensors 100 are lidar sensors that operate in the infrared band to perform laser imaging, and may include (among other components) an optical beam transmitter, optical detector, beam alignment device, optical filter and spectrometer. Sensors 100 can be signally coupled to a microprocessor-based controller 105 (shown notionally as being within the same compartment that houses the motive power unit 40 but understood to be placeable within any suitable location of vehicle 10) to coordinate data acquisition and storage, as well as overall system 80 operation. In one embodiment, the sensors 100 may be made to emit a series of focused, low-power beams, as well as to detect and record their reflection off of various objects. By capturing and evaluating lidar data over time, the data acquired by the sensors 100—which operates in conjunction with the controller 105—may be built up into a representation of objects and their relative positions to the vehicle 10. This in turn may be used to generate vehicular mapping and navigational data. As will be appreciated, sensors 100 may include mixed modes of data acquisition. Thus, while some of sensors 100 may be laser-based lidars operating in the infrared band, others may be cameras operating in the optical band. In such a system, the images acquired from each different type of sensor 100 may be compared with one another through algorithms operating on the controller so that a more complete map or related rendering of the road being traversed may be ascertained. All such variants are deemed to be within the scope of the present disclosure. Controller 105 may be a digital computer that in addition to having a processing unit, also has an input, an output, and memory that can temporarily or permanently store such a code, program or algorithm in the computer's memory such that the instructions contained in the code are operated upon by the processing unit based on input data. In this way, output data generated by the code and the processing unit can be conveyed to another component (such as sensing system 80), program or a user via output. In one form, a data-containing portion of the memory (also called working memory) is referred to as random access memory (RAM), while an instruction-containing portion of the memory (also called permanent memory is referred to as read only memory (ROM)). A data bus or related set of wires and associated circuitry forms a suitable data communication path that can interconnect the input, output, CPU and memory, as well as sensing system 80 or any peripheral equipment in such a way as to permit the system to operate as an integrated whole. In this way, controller 105 may be configured as a computer system based on a von Neumann architecture so that it may perform one or more specific automated steps outlined in this disclosure. As such, controller 105 becomes a particularly-adapted computer or computer-related data processing device that employs the salient features of such an architecture in order to perform at least some of the data acquisition, manipulation, actuation, control or related computational functions. It will be appreciated by those skilled in the art that computer-executable instructions that embody operations discussed elsewhere in this disclosure can be placed within an appropriate location (such as the aforementioned memory) within controller 105 in order to achieve the objectives set forth in the present disclosure. Data acquired from the sensors 100 is routed through a bus or other suitable signal communication line to the controller 105 or related a computing device that may be outfitted with one or more processors and memory for storing data and program instructions that are used by processors. Algorithms (such as those associated with a particular application program) are stored in the controller memory and acted upon by the processors. In addition to the sensors 100, the sensing system 80 may use an inertial measurement unit (IMU), global navigation satellite system (GNSS) or the like to collect information specific to the environment surrounding vehicle 10; such addition information may include that associated with other objects in or around the vehicle's travel path, such as other vehicles, buildings, landmarks, pedestrians, animals or obstacles. Likewise, measurements may be taken by the sensing system 80 to check for elevation changes in the road and other data needed to perform its mapping or navigation functions. In an autonomous mode of operation, the controller 105 is used to navigate the vehicle 10 over a road or other suitable surface based on information acquired by the sensing system 80. In such mode, the controller 105 at least partially provides operating instructions to the motive power unit 40 and the guidance apparatus. Referring next to FIG. 4 in conjunction with FIG. 2, when the vehicle 10 is in a data acquisition mode, the mounting structure 90 can be deployed (such as through the operation of a motor M and gear train G, both as shown in FIG. 4, as well as with springs or other biasing members to have the sensors 100 pop up out of the roof 60 in the manner shown in FIG. 1. While in their deployed position, the one or more sensors 100 are extended away from the spoiler 95 to define a data-acquisition mode of operation in order to achieve their mapping or navigational functions, and when the mounting structure 90 and sensors 100 of system 80 is in its stowed position within the recess 97 formed in the spoiler 95, both the sensor 100 and mounting structure 90 define a substantially flush profile across the portion of the recess 97. Within the present context, a substantially flush profile is formed by the mounting structure 90 and sensors 100 relative to the spoiler 95 such that when the formers are in their stowed position within the recess 97 of the latter—in being viewed from a front or side elevation of the vehicle 10—there appears to be no significant discontinuities, gaps, protuberances or other undulations relative to the generally continuous profile of the intended aerodynamic contour 95 C of spoiler 95. In such context, seams (including those seams that are filled by seals 115) that are visible are not violative of such substantially flush profile so long as they result in a gap no wider than necessary to perform their sealing function. Thus, any seam formed at the point of adjacent abutment between such surfaces would be deemed to be within the present meaning of a substantially flush profile so long as it does not result in a gap that is wider than it need be in the course of commonly-accepted vehicular fit and finish. Regardless of the precise aerodynamic contour 95 C of spoiler 95, the construction of the sensing system 80 is such that when the mounting structure 90 and sensors 100 are stowed, the view across or along the aerodynamic contour 95 C defines an aesthetically-pleasing and aerodynamically unobtrusive profile. Referring back to FIGS. 1 and 2 in conjunction with FIG. 3, this flush profile is enhanced by the presence of fairings 110 which are used predominantly when the sensing system 80 is in the stowed position of FIG. 2. In particular, the fairings 110 define a relatively thin and generally planar rectangular member that upon retraction of the sensing system 80 into the recess 97, provide a smooth, continuous upper surface for spoiler 95. In some embodiments, the fairings 110 may be made of a similar material to that of the remainder of the housing 95 H, and can be painted to match colors. Likewise, the fairings 110 may be rigid enough to withstand loads, particularly in the form of wind loads when sensing system 80 is deployed. Taken in conjunction with one another, the use of the fairings 110 and the small size of the mounting structure 90 and sensors 100 give the sensing system 80 a relatively unobtrusive volumetric profile that is stowed between the roof 60 and passenger compartment 50 during periods where the sensors 100 are not in operation so that the outer dimension of the roof 60 and its related aesthetic attributes are not altered. Although not shown, the fairings 110 may include ether hinges, apertures or portions that are transparent to the particular wavelength of interest so that the sensor 100 can perform its emitting and detecting functions during deployment while still preserving a substantially closed, sealed closure of the sensing system 80 during stowage. Additionally, seals 115 may be disposed around the periphery that is defined by the fairings to further promote a substantially water-tight, aesthetically-pleasing roof profile during such times as when the assembly of the sensing system 80 is in the stowed position. These seals 115 perform similar hermetic functions to those of the seals 75 that are formed around sunroof 70. In some embodiments, the fairings 110 may be secured directly to the housing 95 H in order to perform their covering function. In such configurations, hinges or related pivots similar to pivots 98 may be formed between the roof 60 and fairings 110 such that upon deployment of the sensing system 80, the fairings 110 rotate away from the roof 60 at the hinge point. Such movement may be achieved through any suitable actuation system, including motor-and-gear driven, hydraulic or pneumatic variants, and coupled to controller 105 such that their opening and closing may be made to correspond with the respective deploying and stowing movements of the sensing system 80. In some embodiments, the fairing 110 may be formed as an integral part of the truss 92 rather than being merely attached to it. In such construction, the fairing 110 can be sized and shaped to provide both adequate levels of structural integrity to the mounting structure 90, as well as the requisite degree of coverage of the recess 65 in order to ensure the substantially continuous, flush profile between the adjacent surfaces of the sensing system 80 and roof 60. Referring again to FIG. 4, a side cutaway elevation view of the vehicle 10 and sensing system 80 of FIG. 2 when the sensing system 80 is in a stowed position shows that the size of the mounting structure 90 and sensors 100 is small enough to fit within the empty volume defined within the housing 95 H. In some embodiments, the sensors 100 define a small volumetric profile of no more than about 2 to 3 inches in each of the height, width and thickness dimensions. This miniaturization of the actual sensing capability can provide the sensing system 80 with a small profile (and the small associated weight) so that the rods, trusses 92 or related bar-like members of the mounting structure 90 can be kept thin while still having sufficient rigidity to perform their deployment functions. In addition to having various roof 60 structural elements (such as the pillars, rails, bars or the like mentioned above) that may form a suitably rigid hard point for operation of the spoiler 95 as well as the mounting structure 90 and sensors 100 that are disposed therein, other mounting elements 116 may serve to provide secure mounting of spoiler 95 to the roof 60, as well as form (if necessary) a substantially water-tight seal and vibration isolation functions. One particular area of roof-mounting interest for the sensing system 80 is in the upper corner of the roof 60 that is near the A, B or C-pillars 22, 24 or 26, where the reinforcements share the flange with the windshields. The selective raising and lowering of the sensing system 80 may be actuated by a motor M and one or more gears G that are stowed in the recess between the roof 60 and the headliner 55 of the passenger compartment 50. In one preferred form, the gears G may be in the form of a worm gear that is rotatably coupled to an output shaft formed on motor M. Certain portions of data-collecting during modes of operation of the sensing system 80 may be performed while the vehicle 10 is moving. For example, as the vehicle 10 traverses a highway or other road, the sensor or sensors 100 may collect large amounts of data (often in excess of 700,000 data points per second). Significantly, because the sensing system 80 is mounted on top of the roof 60, its presence does not result in a further vertically-downward encroachment on the passenger compartment 50. As such, the look up angle θ for the driver may be maintained from being compromised, as well as to not have a headliner 55 lowered to accommodate the sensing system 80. Controller 105 is shown placed in an alternate location relative to that of FIG. 3; it will be appreciated that either placement is within the scope of the present disclosure. It is noted that the terms “substantially” and “about” may be utilized herein to represent the inherent degree of uncertainty that may be attributed to any quantitative comparison, value, measurement, or other representation. These terms are also utilized herein to represent the degree by which a quantitative representation may vary from a stated reference without resulting in a change in the basic function of the subject matter at issue. While particular embodiments have been illustrated and described herein, it should be understood that various other changes and modifications may be made without departing from the spirit and scope of the claimed subject matter. Moreover, although various aspects of the claimed subject matter have been described herein, such aspects need not be utilized in combination. It is therefore intended that the appended claims cover all such changes and modifications that are within the scope of the claimed subject matter. What is claimed is: 1. A vehicular sensing system comprising: a spoiler defining a housing with an elongate dimension and an airflow dimension that are substantially transverse to one another, the spoiler configured to have its elongate dimension be secured along at least a portion of a lateral distance across a roof of a vehicle, the housing defining at least one recess formed in an upper surface thereof such that upon placement of the spoiler on the roof, the at least one recess extends substantially along the elongate dimension; at least one sensor configured to acquire at least one of vehicular mapping and navigational data; and a retractable mounting structure cooperative with the at least one sensor and secured to the spoiler to permit selective movement between a stowed position and a deployed position such that when the mounting structure and the at least one sensor are in their deployed position, the at least one sensor is located outside of the recess to define a data-acquisition mode of operation, and when the mounting structure and the at least one sensor are in their stowed position, both the mounting structure and the at least one sensor are situated within the recess. 2. The system of claim 1, wherein the mounting structure and the at least one sensor define a substantially flush profile along the airflow dimension of the spoiler when the mounting structure and the at least one sensor are in their stowed position. 3. The system of claim 1, wherein the mounting structure and the at least one sensor do not project above a contour formed along the airflow dimension of the spoiler when the mounting structure and the at least one sensor are in their stowed position. 4. The system of claim 1, wherein the at least one sensor comprises at least one lidar sensor. 5. The system of claim 1, wherein the mounting structure comprises a linkage that is pivotably cooperative with the housing through at least one hinge. 6. The system of claim 5, wherein the linkage is movably responsive to the operation of at least one motor and at least one gear that is mounted within the housing. 7. The system of claim 1, further comprising a fairing cooperative with the recess, the mounting structure and at least one sensor such that when the mounting structure and at least one sensor are in their stowed position, the fairing substantially covers the mounting structure, the at least one sensor and the recess. 8. The system of claim 7, wherein the fairing is affixed to at least one of the mounting structure and at least one sensor with a size and shape such that when the mounting structure and at least one sensor are in their stowed position, the fairing defines a substantially flush profile along the housing upper surface. 9. The system of claim 7, further comprising a seal disposed between the fairing and the recess. 10. A vehicle comprising: a wheeled chassis defining a passenger compartment therein with a roof disposed thereover; a motive power unit; a guidance apparatus cooperative with the wheeled chassis and motive power unit; and a vehicular sensing system comprising: a spoiler defining a housing with an elongate dimension and an airflow dimension that are substantially transverse to one another, the spoiler configured to have its elongate dimension be secured along at least a portion of a lateral distance across the roof of a vehicle, the housing defining at least one recess formed in an upper surface thereof such that upon placement of the spoiler on the roof, the at least one recess extends substantially along the elongate dimension; at least one sensor configured to acquire at least one of vehicular mapping and navigational data; and a retractable mounting structure cooperative with the at least one sensor and secured to the spoiler to permit selective movement between a stowed position and a deployed position such that when the mounting structure and the at least one sensor are in their deployed position, the at least one sensor is located outside of the recess to define a data-acquisition mode of operation, and when the mounting structure and the at least one sensor are in their stowed position, both the mounting structure and the at least one sensor are situated within the recess. 11. The vehicle of claim 10, wherein the at least one sensor comprises at least one lidar sensor. 12. The vehicle of claim 10, wherein the mounting structure comprises: a linkage that is pivotably cooperative with the recess through at least one hinge; and an actuation mechanism cooperative with the linkage such that upon operation of the actuation mechanism, the linkage moves between the deployed and stowed positions. 13. The vehicle of claim 10, further comprising a fairing cooperative with the recess, the mounting structure and at least one sensor such that when the mounting structure and at least one sensor are in their stowed position, the fairing substantially covers the mounting structure, the at least one sensor and the recess. 14. The vehicle of claim 13, wherein the fairing is affixed to at least one of the mounting structure and at least one sensor with a size and shape such that when the mounting structure and at least one sensor are in their stowed position, the fairing substantially defines a substantially flush profile along the housing upper surface. 15. The vehicle of claim 13, further comprising a seal disposed between the fairing and the recess. 16. The vehicle of claim 10, further comprising a sunroof situated within a portion of the roof such that the airflow dimension of the spoiler is disposed upstream of and substantially collinear with an axial roofline that is defined in the roof. 17. A method for performing at least one of vehicular mapping and vehicular navigation, the method comprising: securing a sensing system to a roof of a vehicle, the sensing system comprising: a spoiler defining a housing with an elongate dimension and an airflow dimension that are substantially transverse to one another, the spoiler configured to have its elongate dimension be secured along at least a portion of a lateral distance across the roof of a vehicle, the housing defining at least one recess formed in an upper surface thereof such that upon placement of the spoiler on the roof, the at least one recess extends substantially along the elongate dimension; at least one sensor configured to acquire at least one of vehicular mapping and navigational data; and a retractable mounting structure cooperative with the at least one sensor and secured to the spoiler to permit selective movement between a stowed position and a deployed position; moving the system between a stowed position and a deployed position such that when the mounting structure and the at least one sensor are in their deployed position, the at least one sensor is located outside of the recess to define a data-acquisition mode of operation, and when the mounting structure and the at least one sensor are in their stowed position, both the mounting structure and the at least one sensor are situated within the recess; and acquiring at least one of mapping data and navigational data through the at least one sensor when the system is in the deployed condition. 18. The method of claim 17, wherein the sensing system further comprises a fairing cooperative with the recess, the mounting structure and at least one sensor such that when the mounting structure and at least one sensor are in their stowed position, the fairing defines a substantially flush profile along the housing upper surface. 19. The method of claim 17, further comprising operating the vehicle at least partially in response to the at least one of the acquired mapping data and navigational data. 20. The method of claim 19, wherein the operating the vehicle comprises autonomous vehicle operation.

2016-06-22

en

2017-12-28

US-12224608-A

Piezoelectric thin-film resonator and filter ABSTRACT A piezoelectric thin-film resonator includes: a lower electrode that is formed on a substrate; a piezoelectric film that is formed on the substrate and the lower electrode; an upper electrode that is formed on the piezoelectric film, with a portion of the piezoelectric film being interposed between the lower electrode and the upper electrode facing each other; and an additional film that is formed on the substrate on at least a part of the outer periphery of the lower electrode at the portion at which the lower electrode and the upper electrode face each other, with the additional film being laid along the lower electrode. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention generally relates to a piezoelectric thin-film resonator and a filter, and more particularly, to a piezoelectric thin-film resonator that utilizes the conversions between electric signals and bulk acoustic waves caused in a piezoelectric thin film, and a filter that includes such piezoelectric thin-film resonators. 2. Description of the Related Art As wireless devices such as portable telephone devices have spread rapidly, there is an increasing demand for small, light-weight resonators, and filters formed by combining those resonators. Conventionally, dielectric filters and surface acoustic wave (SAW) filters have been used. In recent years, however, attention is drawn to piezoelectric thin-film resonators that exhibit excellent characteristics especially at high frequencies and can be made small or monolithic in size, and also to filters that are formed with those piezoelectric thin-film resonators. Piezoelectric thin-film resonators are classified into FBAR (Film Bulk Acoustic Resonator) types and SMR (Solidly Mounted Resonator) types. A FBAR-type piezoelectric thin-film resonator has a film stack structure that consists of a lower electrode, a piezoelectric film, and an upper electrode, and is formed on a substrate. A hollow space or cavity is formed below the lower electrode at a location (a resonant portion) at which the lower electrode and the upper electrode face each other, with the piezoelectric film being interposed between the lower electrode and the upper electrode. The cavity in an FBAR-type piezoelectric thin-film resonator may be a cavity that is formed between the lower electrode and the substrate by performing wet etching on a sacrifice layer formed on the surface of the substrate, or may be a via hole that is formed in the substrate by performing wet etching or dry etching. A SMR-type piezoelectric thin-film resonator has an acoustic multilayer film, instead of a cavity. The acoustic multilayer film is formed by stacking films having high acoustic impedance and films having low acoustic impedance alternately, and has a film thickness of λ/4(λ: the wavelength of acoustic waves). An FBAR having a via hole is disclosed in “ZnO/SiO2-Diaphragm Composite Resonator on a Silicon Wafer (K. Nakamura, H. Sasaki, and H. Shimizu, Electronics Letters, vol. 17, No. 14, pp. 507-509, July 1981)”. A FBAR having a cavity is disclosed in Japanese Patent Application Publication No. 60-189307. FIG. 1 is a cross-sectional view of an FBAR having a via hole 18. FIG. 2 is a cross-sectional view of an FBAR having a cavity 18. As shown in FIG. 1, a lower electrode 12, a piezoelectric film 14, and an upper electrode 16 are formed in this order on a substrate 10 that has a SiO2 film 11 formed on its surface and is made of silicon. A cavity 18 (a via hole) is formed in the substrate 10 below a portion at which the lower electrode 12 and the upper electrode 16 face each other. As shown in FIG. 2, a SiO2 film 11 is formed as a supporting film on a substrate 10 made of silicon, so that a cavity 18 (a cavity) can be formed. A lower electrode 12, a piezoelectric film 14, and an upper electrode 16 are formed in this order on the SiO2 film 11. The lower electrode 12 and the upper electrode 16 partially face each other, with the piezoelectric film 14 being interposed between the facing portions of the lower electrode 12 and the upper electrode 16. Here, the lower electrode 12 and the upper electrode 16 may be made of aluminum, (Al), copper (Cu), molybdenum (Mo), tungsten (W), tantalum (Ta), platinum (Pt), ruthenium (Ru), rhodium (Rh), iridium (Ir), chromium (Cr), titanium (Ti), or the like. The lower electrode 12 and the upper electrode 16 may be stack materials formed by combining some of those materials. The piezoelectric film 14 may be made of aluminum nitride (AlN), zinc oxide (ZnO), lead zirconate titanate (PZT), lead titanate (PbTiO3), or the like. The substrate 10 may be a silicon substrate, a glass substrate, a GaAs substrate, or the like. When a high-frequency electric signal is applied between the upper electrode and the lower electrode, acoustic waves are generated by an inverse piezoelectric effect in the piezoelectric film interposed between the upper electrode and the lower electrode, or acoustic waves are generated by the deformation caused by a piezoelectric effect. Those acoustic waves are converted into electric signals. Since such acoustic waves are all reflected by the faces of the upper electrode and the lower electrode exposed to the air, longitudinal oscillatory waves having principal displacement in the thickness direction are generated. Resonance is caused at a frequency at which the total film thickness H of the film stack consisting of the lower electrode, the piezoelectric film, and the upper electrode (including the film added onto the upper electrode) is equal to an integral multiple (n times) of ½ of the wavelength λ of the acoustic waves The resonant frequency F is expressed as: F=nV/(2H), where V represents the propagation velocity of acoustic waves determined by the material. In view of this, the resonant frequency F can be controlled by adjusting the total film thickness H of the stack film, and a piezoelectric thin-film resonator with desired frequency characteristics can be obtained. Japanese Patent Application Publication No. 2005-536908 of the PCT international publication for a patent application discloses a technique by which an insulating film is provided at the same height as the lower electrode on the substrate, and the step portion is removed from the lower electrode, so as to prevent the degradation of the crystallinity of the piezoelectric film due to the step portion of the lower electrode. Japanese Patent Application Publication No. 2002-140075 discloses a technique by which the step portion of the lower electrode is placed directly on the substrate, so as to prevent the degradation of the crystallinity of the piezoelectric film due to the step portion of the lower electrode. Japanese Patent Application Publication No. 2006-254295 discloses a technique by which the corners of the resist pattern to be used for the formation of the lower electrode are rounded, so as to prevent the degradation of the crystallinity of the piezoelectric film due to the step portion of the lower electrode. An AlN film is often used as the piezoelectric film, so as to achieve desired acoustic velocity, desired temperature characteristics, and desired sharpness of resonance peaks (the Q value). Particularly, the formation of an AlN film having crystallinity oriented toward the c-axis (oriented in a direction perpendicular to the surface of the lower electrode (the (002) direction)) is one of the essential factors to determine the resonance characteristics. However, the formation of an AlN film having high crystallinity oriented toward the c-axis requires a large amount of energy. For example, where a film is formed by MOCVD (Metal Organic Chemical Vapor Deposition), it is necessary to heat the substrate to 1000° C. or higher. Where a film is formed by PECVD (Plasma Enhanced Chemical Vapor Deposition), it is necessary to provide plasma power and heat the substrate to 400° C. or higher. Also, where a film is formed by a sputtering technique, a temperature rise is caused in the substrate by the sputtering of the insulating film. Therefore, an AlN film has high film stress. The lower electrode has the step portion, and the side wall of the step portion is tapered. The piezoelectric film is formed to cover the step portion of the lower electrode. As a result, the crystallinity of the piezoelectric film becomes lower at the step portion of the lower electrode, and there is the problem of degradation of the resonance characteristics of the piezoelectric thin-film resonator. In accordance with Japanese Patent Application Publication No. 2005-536908 of the PCT international publication for a patent application, after an insulating film is formed to cover the step portion of the lower electrode, the surfaces of the lower electrode and the insulating film are flattened by polishing the surfaces so as to remove the step portion of the lower electrode. The film thickness of the lower electrode affects the resonant frequency. Therefore, it is difficult to perform the surface polishing without causing unevenness in the film thickness in the wafer plane and between wafers, while the film thickness control performed on the lower electrode by the surface polishing is essential. Also, the deposition of the insulating film and the surface polishing increase the number of manufacturing procedures. As a result, the productivity becomes lower, and the production costs become higher. The technique disclosed in Japanese Patent Application Publication No. 2002-140075 can cope with a piezoelectric film having high film stress, and improves the mechanical strength and the Q value. By this technique, however, the electromechanical coupling coefficient (k2) becomes lower. SUMMARY OF THE INVENTION It is therefore an object of the present invention to provide a piezoelectric thin-film resonator and a filter including the piezoelectric thin-film resonator in which the above disadvantages are eliminated. A more specific object of the present invention is to provide a piezoelectric thin-film resonator that can have resonance characteristics improved, and a filter including the piezoelectric thin-film resonator. According to an aspect of the present invention, there is provided a piezoelectric thin-film resonator including: a lower electrode that is formed on a substrate; a piezoelectric film that is formed on the substrate and the lower electrode; an upper electrode that is formed on the piezoelectric film, with a portion of the piezoelectric film being interposed between the lower electrode and the upper electrode facing each other; and an additional film that is formed on the substrate on at least a part of an outer periphery of the lower electrode at the portion at which the lower electrode and the upper electrode face each other, the additional film being laid along the lower electrode. Thus, cracks that are normally formed due to degradation of the crystallinity of the piezoelectric film at the step portion of the lower electrode are not formed, and the resonance characteristics can be improved. According to another aspect of the present invention, there is provided a filter including piezoelectric thin-film resonators configured as mentioned above. BRIEF DESCRIPTION OF THE DRAWINGS Other objects, features and advantages of the present invention will become more apparent from the following detailed description when read in conjunction with the accompanying drawings, in which: FIG. 1 is a cross-sectional view of a piezoelectric thin-film resonator having a cavity of a via-hole type; FIG. 2 is a cross-sectional view of a piezoelectric thin-film resonator having a cavity of a cavity type; FIG. 3A is a top view of a piezoelectric thin-film resonator in accordance with a first embodiment of the present invention; FIG. 3B is a cross-sectional view of the piezoelectric thin-film resonator, taken along the line A-A of FIG. 3A; FIG. 3C is a cross-sectional view of the piezoelectric thin-film resonator, taken along the line B-B of FIG. 3A; FIG. 4A is a top view of a piezoelectric thin-film resonator in accordance with a first comparative example; FIG. 4B is a cross-sectional view of the piezoelectric thin-film resonator, taken along the line A-A of FIG. 4A; FIG. 4C is a cross-sectional view of the piezoelectric thin-film resonator, taken along the line B-B of FIG. 4A; FIGS. 5A through 5H are cross-sectional views illustrating a method for manufacturing the piezoelectric thin-film resonator in accordance with the first embodiment; FIG. 6A shows the resonance characteristics of the piezoelectric thin-film resonator in accordance with the first comparative example; FIG. 6B shows a Smith chart illustrating the reflection characteristics of the piezoelectric thin-film resonator in accordance with the first comparative example; FIG. 7A shows the resonance characteristics of the piezoelectric thin-film resonator in accordance with the first embodiment; FIG. 7B shows a Smith chart illustrating the reflection characteristics of the piezoelectric thin-film resonator in accordance with the first embodiment; FIG. 8 is a cross-sectional view illustrating the cause of degradation of the resonance characteristics in the first comparative example; FIG. 9 is a cross-sectional view illustrating the reason that the resonance characteristics can be improved in the first embodiment; FIG. 10 is a top view of a piezoelectric thin-film resonator in accordance with a second embodiment of the present invention; FIG. 11 shows a top view (a) of a piezoelectric thin-film resonator in accordance with a third embodiment of the present invention, and a a cross-sectional view (b) of the piezoelectric thin-film resonator, taken along the line A-A of part (a); FIG. 12 shows a top view (a) of a piezoelectric thin-film resonator in accordance with a modification of the third embodiment, and a cross-sectional view (b) of the piezoelectric thin-film resonator, taken along the line A-A of part (a); FIG. 13 is an equivalent circuit diagram of a ladder filter in accordance with a fourth embodiment of the present invention; and FIG. 14 shows the bandpass characteristics of the ladder filter in accordance with the fourth embodiment. DESCRIPTION OF THE PREFERRED EMBODIMENTS The following is a description of embodiments of the present invention, with reference to the accompanying drawings. First Embodiment FIG. 3A is a top view of a piezoelectric thin-film resonator in accordance with a first embodiment. FIG. 3B is a cross-sectional view of the piezoelectric thin-film resonator, taken along the line A-A of FIG. 3A. FIG. 3C is a cross-sectional view of the piezoelectric thin-film resonator, taken along the line B-B of FIG. 3A. FIG. 4A is a top view of a piezoelectric thin-film resonator in accordance with a first comparative example. FIG. 4B is a cross-sectional view of the piezoelectric thin-film resonator, taken along the line A-A of FIG. 4A. FIG. 4C is a cross-section alview of the piezoelectric thin-film resonator, taken along the line B-B of FIG. 4A. As shown in FIGS. 3A through 3C, the piezoelectric thin-film resonator in accordance with the first embodiment has a lower electrode 12 that is made of Ru, has a thickness of 260 nm, and is formed on a substrate 10 that is formed with a (100)-cut silicon substrate. A piezoelectric thin film 14 that has a thickness of 1220 nm and is formed with an AlN film having the principal axis extending in the (002) direction is provided on the substrate 10 and the lower electrode 12. An upper electrode 16 that is made of Ru and has a thickness of 260 nm is provided on the piezoelectric film 14, with a part of the piezoelectric film 14 being interposed between the lower electrode 12 and the upper electrode 16. With this structure, a film stack consisting of the lower electrode 12, the piezoelectric film 14, and the upper electrode 16 is formed. At the portion at which the lower electrode 12 and the upper electrode 16 face each other (a resonant portion 21), an additional film 22 made of the same material (Ru) as the lower electrode 12 is provided on the substrate 10 and at least along a part of the outer periphery of the lower electrode 12. The distance d between the lower electrode 12 and the additional film 22 at the portion at which the lower electrode 12 and the upper electrode 16 face each other is 2.0 μm. The thickness of the additional film 22 is 260 nm, and the width is 4 μm. The resonant portion 21 has an oval shape. The length of the long axis of the resonant portion 21 is 250 μm, and the length of the short axis is 180 μm. A cavity 18 having a dome-like shape is formed between the substrate 10 and the lower electrode 12 below the resonant portion 21. With the dome-like shape, the cavity 18 has a larger height at the center than at the peripheral portions. The resonant portion 21 is included in a region formed by projecting the cavity 18 onto the substrate 10. An introduction path 24 for etching a later described sacrifice layer is provided in the lower electrode 12. The end of the instruction path 24 is not covered with the piezoelectric film 14, and the lower electrode 12 has a hole 26 at the end of the instruction path 24. The piezoelectric film 14 has an opening portion 28 so as to provide an electric connection with the lower electrode 12. As shown in FIGS. 4A through 4C, the piezoelectric thin-film resonator in accordance with the first comparative example does not have the additional film 22 formed on the substrate 10. The other aspects of the structure are the same as those of the first embodiment illustrated in FIGS. 3A through 3C, and therefore, explanation of them is omitted here. Referring now to FIGS. 5A through 5H, a method for manufacturing the piezoelectric thin-film resonator in accordance with the first embodiment is described. FIGS. 5A through SD are cross-sectional views of the piezoelectric thin-film resonator, taken along the line A-A of FIG. 3A. FIGS. 5E through 5H are cross-sectional views of the piezoelectric thin-film resonator, taken along the line B-B of FIG. 3A. As shown in FIGS. 5A and 5E, a sacrifice layer 30 that is made of MgO (magnesium oxide) and has a thickness of approximately 20 nm is formed on the substrate 10 by a sputtering technique or a vapor deposition technique. After that, the sacrifice layer 30 is shaped into a predetermined form by an exposure technique and an etching technique. As shown in FIGS. 5B and 5F, the lower electrode 12 is formed by sputtering Ru in an Ar gas atmosphere under a pressure of 0.6 to 1.2 Pa. After that, the lower electrode 12 is shaped into a predetermined form by an exposure technique and an etching technique. Here, the additional film 22 is formed at the same time. As shown in FIGS. 5C and 5G, the piezoelectric film 14 is formed on the lower electrode 12 and the substrate 10 by sputtering Al in an Ar/N2 mixed gas atmosphere under a pressure of approximately 0.3 Pa. The upper electrode 16 is formed on the piezoelectric film 14 by sputtering Ru in an Ar gas atmosphere under a pressure of 0.6 to 1.2 Pa. After that, the piezoelectric film 14 and the upper electrode 16 are shaped into predetermined forms by an exposure technique and an etching technique. Further, the hole 26 is formed at the end of the instruction path 24 by an exposure technique and an etching technique. The hole 26 is formed at the same time as the lower electrode 12. As shown in FIG. 5D and 5H, an etching solution for etching the sacrifice layer 30 is introduced through the instruction path 24, and the sacrifice layer 30 is removed. Here, the stress on the film stack consisting of the lower electrode 12, the piezoelectric film 14, and the upper electrode 16 is set to be compressive stress by adjusting the sputtering conditions. Accordingly, when the etching of the sacrifice layer 30 is completed, the film stack expands to form the cavity 18 having a dome-like shape between the lower electrode 12 and the substrate 10. The compressive stress on the combined film under the sputtering conditions of the first embodiment is −300 MPa. In this manner, the piezoelectric thin-film resonator in accordance with the first embodiment is completed. FIG. 6A shows the resonance characteristics of the piezoelectric thin-film resonator in accordance with the first comparative example. FIG. 6B shows a Smith chart illustrating the reflection characteristics of the piezoelectric thin-film resonator in accordance with the first comparative example. FIG. 7A shows the resonance characteristics of the piezoelectric thin-film resonator in accordance with the first embodiment. FIG. 7B shows a Smith chart illustrating the reflection characteristics of the piezoelectric thin-film resonator in accordance with the first embodiment. FIGS. 6A through 7B show the resonance characteristics and the reflection characteristics of piezoelectric thin-film resonators located at three points in a wafer. In FIGS. 6A and 7A, the abscissa axis indicates frequency [MHz], and the ordinate axis indicates attenuation [dB]. As shown in FIG. 6A, with the piezoelectric thin-film resonator in accordance with the first comparative example, ripples are formed at frequencies (in the neighborhood of 1880 MHz) slightly lower than the resonant frequency, and the resonance characteristics are degraded. As can be seen from the Smith chart of FIG. 6B, the reflection characteristics are also degraded (as indicated by the arrow in FIG. 6B). As shown in FIG. 7A, with the piezoelectric thin-film resonator in accordance with the first embodiment, ripples are prevented at frequencies (in the neighborhood of 1880 MHz) slightly lower than the resonant frequency, and the resonance characteristics are improved. As can be seen from FIG. 7B, the reflection characteristics are also improved (as indicated by the arrow in FIG. 7B). FIG. 8 is a cross-sectional view illustrating the cause of degradation of the resonance characteristics of the piezoelectric thin-film resonator in accordance with the first comparative example. More specifically, FIG. 8 is a cross-sectional view showing the piezoelectric thin-film resonator before etching is performed on the sacrifice layer 30 (before the cavity 18 is formed). FIG. 8 is also an enlarged view of the step portion of the lower electrode 12. The thin lines in the piezoelectric film 14 represent the columnar crystalline structure of the piezoelectric film 14 (AlN film). As shown in FIG. 8, the step portion of the lower electrode 12 has a tapered shape. The columnar crystalline structure of the piezoelectric film 14 is perpendicular to the substrate 10 and to the upper face of the lower electrode 12, and is also perpendicular to the tapered portion of the step portion of the lower electrode 12. Therefore, the crystallinity of the piezoelectric film 14 is degraded in the region Y. As a result, cracks are formed in the region Y due to the stress generated when the dome-like cavity 18 is formed as shown in FIGS. 5D and 5H. Those cracks degrade the resonance characteristics. FIG. 9 is a cross-sectional view and an enlarged view of the step portion of the lower electrode 12 of the piezoelectric thin-film resonator in accordance with the first embodiment (before etching is performed on the sacrifice layer 30). As shown in FIG. 9, the additional film 22 is provided at a distance d of 2.0 μm from the lower electrode 12, so as to prevent cracks in the region Y Accordingly, the resonance characteristics can be improved. The distance d is not limited to 2.0 μm, but the crystallinity of the piezoelectric film 14 at the step portion of the lower electrode 12 becomes similar to the crystallinity of the first comparative example if the distance d is too long. Therefore, it is preferable that the distance d is 2.0 μm or shorter. In accordance with the first embodiment, the additional film 22 is provided on the substrate 10 and at least along a part of the outer periphery of the lower electrode 12 at the portion at which the lower electrode 12 and the upper electrode 16 face each other, as shown in FIGS. 3A through 3C. The piezoelectric film 14 is provided on the substrate 10 and the lower electrode 12, so as to cover the additional film 22. With this arrangement, cracks to be formed due to degradation of the crystallinity of the piezoelectric film 14 at the step portion of the lower electrode 12 can be prevented as illustrated in FIG. 9. Accordingly, fewer ripples are formed in the piezoelectric thin-film resonator in accordance with the first embodiment than in the piezoelectric thin-film resonator in accordance with the first comparative example, and the resonance characteristics can be improved. In the first embodiment, the electromechanical coupling coefficient (k2) and the resonance peak sharpness (Q value) are the same as those in the first comparative example. It is also preferable that the lower electrode 12 and the additional film 22 are made of the same material (Ru), as shown in FIGS. 3A through 3C. In that case, the lower electrode 12 and the additional film 22 can be formed at the same time as shown in FIGS. 5B and 5F, and higher productivity can be achieved. Further, the cavity 18 having a dome-like shape is formed between the substrate 10 and the lower electrode 12 below the portion at which the lower electrode 12 and the upper electrode 16 face each other, as shown in FIGS. 3A through 3C. Accordingly, there is no need to perform etching on the substrate 10. Thus, higher productivity can be achieved, and degradation of the mechanical strength of the substrate 10 can be prevented. Also, since the region for forming the cavity 18 is small, higher integration can be achieved. Furthermore, as the sacrifice layer 30 provided to form the cavity 18 is thin, excellent orientation can be maintained in the piezoelectric film 14. Further, the stress on the film stack consisting of the lower electrode 12, the piezoelectric film 14, and the upper electrode 16, or the stress on the portion at which the lower electrode 12 and the upper electrode 16 face each other, is compressive stress, as illustrated in FIGS. 3A through 3C. With this arrangement, the cavity 18 having a dome-like shape can be protected from deformation. Also, the hole 26 continuing to the cavity 18 is formed in the lower electrode 12. With this arrangement, the cavity 18 having a dome-like shape can be formed by introducing an etching solution through the hole 26 and performing etching on the sacrifice layer 30, as illustrated in FIGS. 5D and 5H. The portion at which the lower electrode 12 and the upper electrode 16 face each other is included in the region formed by projecting the cavity 18 having a dome-like shape onto the substrate 10, as illustrated in FIGS. 3A through 3C. Accordingly, the portion (the resonant portion 21) at which the lower electrode 12 and the upper electrode 16 face each other can oscillate. Also, the cavity 18 does not need to have a dome-like shape. The resonant portion 21 can oscillate, as long as the portion at which the lower electrode 12 and the upper electrode 16 face each other is included in the region formed by projecting the cavity 18 onto the substrate 10. Further, the portion at which the lower electrode 12 and the upper electrode 16 face each other has an oval shape, and no two sides run parallel to each other, as illustrated in FIGS. 3A through 3C. With this arrangement, acoustic waves reflected by the outer periphery of the piezoelectric film 14 can be prevented from turning into transverse standing waves in the resonant portion 21. Thus, ripples do not appear in the resonance characteristics. Further, the piezoelectric film 14 is made of aluminum nitride with an orientation having the principal axis extending in the (002) direction, as illustrated in FIGS. 3A through 3C. With this arrangement, a piezoelectric thin-film resonator having excellent resonance characteristics can be formed. Also, zinc oxide with an orientation having the principal axis extending in the (002) direction may be used to achieve excellent resonance characteristics. Although the substrate 10 is a silicon substrate in the first embodiment, it is possible to use a quartz substrate, a glass substrate, a GaAs substrate, or the like. Also, the lower electrode 12 and the upper electrode 16 are made of Ru in the first embodiment, but those materials mentioned in the description of the related art may also be employed. Although the sacrifice layer 30 is a MgO layer in the first embodiment, it is possible to use a material that can readily dissolve in an etching solution, such as ZnO, Ge, Ti or SiO2. Second Embodiment FIG. 10 is a top view of a piezoelectric thin-film resonator in accordance with a second embodiment of the present invention. As shown in FIG. 10, the portion (the resonant portion 21) at which the lower electrode 12 and the upper electrode 16 face each other has a polygonal shape formed with nonparallel sides. The other aspects of the structure are the same as those of the first embodiment illustrated in FIGS. 3A through 3C, and therefore, explanation of them is omitted here. In accordance with the second embodiment, the portion at which the lower electrode 12 and the upper electrode 16 face each other has a polygonal shape formed with nonparallel sides. Since there are no two parallel sides, acoustic waves reflected by the outer periphery of the piezoelectric film 14 can be prevented from turning into transverse standing waves in the resonant portion 21. Thus, ripples do not appear in the resonance characteristics. Third Embodiment A third embodiment of the present invention is an example case where the cavity 18 is formed in the substrate 10. FIG. 11 shows a top view (a) of a piezoelectric thin-film resonator in accordance with the third embodiment, and a cross-sectional view (b) of the piezoelectric thin-film resonator, taken along the line A-A of part (a). FIG. 12 shows a top view of a piezoelectric thin-film resonator in accordance with a modification of the third embodiment, and a cross-sectional view of the piezoelectric thin-film resonator, taken along the line A-A of part (a). As shown in FIGS. 11 and 12, the cavity 18 may not be formed between the substrate 10 and the lower electrode 12 as in the first embodiment and the second embodiment, but may be formed in the substrate 10 under the portion (the resonant portion 21) at which the lower electrode 12 and the upper electrode 16 face each other in the third embodiment. The cavity 18 can be vertically formed by performing etching on the substrate 10 by Deep-RIE (Reactive Ion Etching). Fourth Embodiment A fourth embodiment of the present invention is an example of a four-stage ladder filter that includes piezoelectric thin-film resonators of the first embodiment. FIG. 13 is a circuit diagram illustrating the ladder filter in accordance with the fourth embodiment. In a four-stage ladder filter, series-arm resonators S and parallel-arm resonators P between an input terminal Tin and an output terminal Tout normally form a S-P-P-S-S-P-P-S structure. In the fourth embodiment, however, the two series-arm resonators S in the middle are combined to form a series-arm resonator S2, and the two parallel-arm resonators P at either end are combined to form parallel-arm resonators P1 and P2. As shown in FIG. 13, the series-arm resonators S1, S2, and S3 are connected in series between the input terminal Tin and the output terminal Tout. The parallel-arm resonator P1 is connected between the ground and the node between the series-arm resonators S1 and S2. The parallel-arm resonator P2 is connected between the ground and the node between the series-arm resonators S2 and S3. To obtain bandpass filter characteristics in a ladder filter, it is necessary to make the resonant frequency of the parallel-arm resonators lower than the resonant frequency of the series-arm resonators. Therefore, in this embodiment, the series-arm resonators are piezoelectric thin-film resonators of the first embodiment, and the parallel-arm resonators are piezoelectric thin-film resonators formed by providing a mass load film on each upper electrode 16 of piezoelectric thin-film resonators of the first embodiment. The mass load film is made of Ti and has a thickness of 130 nm. FIG. 14 shows the bandpass characteristics of the ladder filter in accordance with the fourth embodiment. For comparison, FIG. 14 also shows the bandpass characteristics of a ladder filter (a second comparative example) that includes piezoelectric thin-film resonators of the first comparative example as the series-arm resonators and the parallel-arm resonators (with a mass load film being formed on each upper electrode). A circuit diagram of the ladder filter of the second comparative example is the same as the circuit diagram of the fourth embodiment. In FIG. 14, the abscissa axis indicates frequency [MHz], and the ordinate axis indicates attenuation [dB]. As shown in FIG. 14, the bandpass characteristics of the ladder filter of the second comparative example (indicated by the broken line) have ripples formed in the pass band in the neighborhood of 1960 MHz. On the other hand, the bandpass characteristics of the ladder filter of the fourth embodiment (indicated by the solid line) have no ripples formed. Accordingly, the bandpass characteristics can be improved by employing piezoelectric thin-film resonators of the first embodiment in a ladder filter. In the fourth embodiment, the series-arm resonators and the parallel-arm resonators are both formed with piezoelectric thin-film resonators of the first embodiment. However, the present invention is not limited to that arrangement. For example, ripples in the pass band can be prevented in a case where piezoelectric thin-film resonators of the first embodiment are used as the series-and resonators, and piezoelectric thin-film resonators of the first comparative example are used as the parallel-arm resonators. In a case where piezoelectric thin-film resonators of the first embodiment are used as the series-arm resonators and the parallel-arm resonators, ripples in the pass band can be prevented, and the attenuation characteristics of the lower frequency side of the pass band can be improved. In the fourth embodiment, the ladder filter includes piezoelectric thin-film resonators of the first embodiment. However, the ladder filter may include piezoelectric thin-film resonators of the second embodiment and the third embodiment. Further, it is possible the employ piezoelectric thin-film resonators of the first through third embodiments in a filter other than a ladder filter, such as a multi-mode filter or a lattice filter. Although a few preferred embodiments of the present invention have been shown and described, it would be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents. The present application is based on Japanese Patent Application No. 2007-131094 filed on May 17, 2007, the entire disclosure of which is hereby incorporated by reference. 1. A piezoelectric thin-film resonator comprising: a lower electrode that is formed on a substrate; a piezoelectric film that is formed on the substrate and the lower electrode; an upper electrode that is formed on the piezoelectric film, with a portion of the piezoelectric film being interposed between the lower electrode and the upper electrode facing each other; and an additional film that is formed on the substrate on at least a part of an outer periphery of the lower electrode at the portion at which the lower electrode and the upper electrode face each other, the additional film being laid along the lower electrode. 2. The piezoelectric thin-film resonator as claimed in claim 1, wherein the piezoelectric film covers the additional film. 3. The piezoelectric thin-film resonator as claimed in claim 1, wherein the additional film is made of the same material as the lower electrode. 4. The piezoelectric thin-film resonator as claimed in claim 1, wherein a cavity having a dome-like shape is provided between the substrate and the lower electrode below the portion at which the lower electrode and the upper electrode face each other. 5. The piezoelectric thin-film resonator as claimed in claim 4, wherein the lower electrode has a hole continuing to the cavity. 6. The piezoelectric thin-film resonator as claimed in claim 1, wherein a cavity is formed in the substrate under the portion at which the lower electrode and the upper electrode face each other. 7. The piezoelectric thin-film resonator as claimed in claim 4, wherein the portion at which the lower electrode and the upper electrode face each other is included in a region formed by projecting the cavity onto the substrate. 8. The piezoelectric thin-film resonator as claimed in claim 1, wherein stress on the portion at which the lower electrode and the upper electrode face each other is compressive stress. 9. The piezoelectric thin-film resonator as claimed in claim 1, wherein the portion at which the lower electrode and the upper electrode face each other has an oval shape. 10. The piezoelectric thin-film resonator as claimed in claim 1, wherein the portion at which the lower electrode and the upper electrode face each other has a polygonal shape formed with nonparallel sides. 11. The piezoelectric thin-film resonator as claimed in claim 1, wherein the piezoelectric film is made of aluminum nitride or zinc oxide with an orientation having a principal axis extending in a (002) direction. 12. A filter comprising piezoelectric thin-film resonators including: a lower electrode that is formed on a substrate; a piezoelectric film that is formed on the substrate and the lower electrode; an upper electrode that is formed on the piezoelectric film, with a portion of the piezoelectric film being interposed between the lower electrode and the upper electrode facing each other; and an additional film that is formed on the substrate on at least a part of an outer periphery of the lower electrode at the portion at which the lower electrode and the upper electrode face each other, the additional film being laid along the lower electrode.

2008-05-16

en

2008-11-20

US-202117465218-A

Multi Configurable Lid for Container ABSTRACT A lid is provided having a lid body which is configured for removable engagement with a fluid container. A cap on the lid is pivotally positionable to seal an opening in the lid which communicates with a cavity in the container. A connector is also provided which is in a pivoting engagement with the first end of the cap. The connector is employable to engage the lid and the attached container to the person of the user. This application claims priority to U.S. Provisional Patent Application Ser. No. 63/162,219 filed on Mar. 17, 2021, which is incorporated herein in its entirety by this reference thereto. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates generally to lids which engage with containers. More particularly, the invention relates to a removably engageable lid for a liquid container which has a pivoting removable handled connector. When connected with a container, the lid renders the container engageable to hiking or other gear by using the provided handle for an attachment, as well as allowing measuring of the container contents or measuring of additives placed into the container to which the lid is engaged using an onboard measuring component. 2. Prior Art Reusable containers typically come in the form of rigid plastic, glass, or metal containers which can be washed and reused as needed. Such reuse substantially reduces the waste related to single-use cups or containers which are simply discarded after their first use. Conventional reusable beverage containers typically include an interior cavity for holding a liquid which can be dispensed or can be consumed from the container. Often, a removable and sealable lid is provided with reusable containers such that the user can employ the container in an on-the-go manner without the hazard of spilling any of the contents. Such removable lids, however, are conventionally provided with an opening communicating through the lid which is employable for dispensing or drinking liquid from the interior cavity of the container. This opening conventionally has a cap which is tethered or rotationally engaged to the cap to allow the cap to move between a sealed positioning sealing the opening and an open position, wherein liquid in the container can exit through the opening. In use, in instances such as hiking or where the user will be moving, many conventional containers offer no structures for the connection of the container to the person or equipment worn by the user, so the container is outside of packed bags and easy to access for drinking. Consequently, they must be stored within pockets or backpacks or the like during transport. So positioned, the lid on many containers is prone to accidental opening. Such can result in spillage or and loss of the liquid inside the container. The forgoing examples of related art for container lids and limitation related therewith are intended to be illustrative and not exclusive, and they do not imply any limitations on the invention described and claimed herein. Various limitations of the related art will become apparent to those skilled in the art upon a reading and understanding of the specification below and the accompanying drawings. With respect to the above, before explaining at least one preferred embodiment of the user configurable reusable lid, configured for an operative engagement to a container herein, it is to be understood that the disclosed device and system are not limited in application to the details of employment and to the arrangement of the components or the steps set forth in the following description or illustrated in the drawings. The various apparatus and operations of the herein disclosed user configurable beverage lid for a container are capable of other embodiments, and of being practiced and carried out in various ways, all of which will be obvious to those skilled in the art once the information herein is reviewed. Also, it is to be understood that the phraseology and terminology employed herein are for the purpose of description, and should not be regarded as limiting. As such, those skilled in the art will appreciate that the conception upon which this disclosure is based, may readily be utilized as a basis for other use-configurable lids for removably engaged containers. It is important, therefore, that the embodiments, objects and claims herein, be regarded as including such equivalent construction and methodology insofar as they do not depart from the spirit and scope of the present invention. SUMMARY OF THE INVENTION The device herein disclosed and described provides a solution to the shortcomings in prior art of container lids which are configured for removable engagement to fluid and drink containers, which may hold liquid or powder or other materials therein. By configured for removable engagement as used herein is meant that the cap has a cap connection which will removably mate to a complimentary container connection on the container, such as threads or a snap on or other mating engagement. The device herein includes a pivoting cap having an elongated configuration with a recess formed on one end. The pivoting cap is in a removable engagement to a pivot point, in a first pivoting engagement to the body of the lid. This pivoting engagement is provided by first and second projections extending from one end of the lid. A connector, having a handle member for engaging the lid to a support or to provide a handle for carrying the lid in a removable engagement to a container, has a measuring cavity forming a scoop or measuring cup. This connector engaged to the lid in a second pivoting engagement, with and in between two shoulders of the pivoting cap. The connector pivots in this second pivoting engagement independently from the cap in the first pivoting engagement, to thereby prevent an accidental disengagement of the cap from sealing an opening in the lid. The connector when removed from the second pivoting engagement is easily held by a handle member while being employed to measure powder or liquid held in the attached container or to be added to the container internal cavity. The lid device herein is employable with any container which is configured for a mating removable connection to the lid such as using mating threads or a snap on configuration. The lid herein, in addition to the pivoting connection with the second end of the removable cap, is configured for dispensing of the fluid, powder, or other contents of the engaged container, through the opening communicating through the lid and into an internal cavity of the container. Should the user wish to have a pivoting handle or support to carry or hold an engaged container in position for use, the lid herein is configurable by the user to include the connector which is configured with a handle or other member. For such a configuration, the connector is positioned into the separate second pivoting engagement within the gap in the cap which is engaged with the lid. The device herein provides the noted pivoting and disengageable cap, which rotates along the same axis as the pivoting connector, but independently therefrom. The independent pivoting of each of the cap and connector, prevents the accidental opening of the cap from sealing the opening to the lid, when the connector is pivoted separately. Further, the cap has an elongated body which may have a recess formed at a first end opposite a second end which is configured for the pivoting connection to the lid. This recess may be formed by a hollow area positioned within a sealing projection extending from a lower surface of the body of the cap and is employable as a secondary measuring device. The lid herein has a first projection extending therefrom opposite a second projection. An open area or gap is positioned in between the two projections. On a first side of the first projection is positioned a first recess. A second recess aligned with the first recess is formed into a first side of the second projection. At the second end of the body forming the cap is a first shoulder portion which is opposite a second shoulder portion at the second end of the body. A gap is positioned between the first shoulder portion and second shoulder portion. A first projection extending from the first shoulder portion is configured to rotationally engage and pivot within the first recess in the first shoulder portion. A second projection extending from a central area of the second shoulder portion and aligned with the first projection, extends from the second shoulder portion and pivotally engages with a second recess formed into the second projection. Of course the first and second shoulder portions and the first and second recesses can be reversed in positioning to form the first pivoting engagement of the second end of the cap to the first and second projections on the lid. The body forming the cap engaged with the lid herein is preferably formed of a flexible polymeric material. So formed, the first shoulder portion and the second shoulder portion are deflectable toward each other and into the gap therebetween, to allow for insertion to a removable engagement of the first protrusion into the first recess and the second protrusion within the second recess to form the first pivoting engagement. Deflecting the two shoulder portions into the gap allows the user to disengage the projections of the cap from the recesses to remove it. If included, the formed recess may be employed with the cap removed to measure powder or fluid to be deposited into the interior cavity of the container. The cap is pivotable at the second end thereof while having the two projections engaged within the two recesses, to a first position, wherein the sealing projection at the first end of the cap, engages with an seals the opening formed in the lid. The body of the cap is pivotable to a second position wherein the sealing projection disengages the opening, and the first end of the body of the cap extends and is positioned on or above an opposite side of the lid from the opening. Where the cap body is the only component in a pivoting engagement with and between the first projection and second projection from the cap, the axis of the body will run at a declining angle from the two protrusions engaged with the two recesses, when in the second position, disengaged from the lid opening. This positions the sealing projection upon an opposite side of the container from that where the opening of the lid is positioned. This declining angle, positioning the sealing projection below a top surface of the lid, is most preferred to keep the sealing projection from contacting the face of a user when drinking from the opening in the lid while attached to a fluid container. As noted, additionally provided with the device is the supporting connector. This connector has a connector body from which a connecting member such as a handle or ring or hook extends on a first side thereof. The formed handle, ring or hook or other connecting member of similar operation, can be employed to carry the lid and an engaged container. It may also be employed to hang the lid and support an engaged container in a hanging position from a backpack or support ring or other user-chosen hanger when the connector is positioned in a pivoting engagement in the gap between the shoulder portions of the cap. The body of the connector is removably engageable to a second pivoting connection. This second pivoting connection is located in between the first shoulder portion and the second shoulder portion at the second end of the body of the cap. Thus, the connector in the second pivoting engagement, does not contact with the shoulder portions and rotates independently from the cap body. Currently, this rotating or pivoting connection of the connector is formed by a first post extending from a first side of the connector body of the support connector which is engaged within a first slot formed in a second side of the first shoulder portion of the cap and a second post extending from a second side of the connector body, which engages a second slot formed into the second side of the second shoulder portion of the body of the cap. The body of the connector may have a measuring cavity formed therein, in between a first and second side upon which the first and the second protrusion are located to form the second pivoting engagement. This measuring cavity has a fixed volume such as a tablespoon, teaspoon, or the like, to allow the user to measure powder or liquid within the container, or to be deposited into the container, for mixing. With the support connector so engaged to pivot in between the two shoulder portions of the cap body, it is independently rotatable to different positions around the first and second post extending therefrom. The body of the cap has an endwall at a second end running across the gap, on an opposite side thereof from the two shoulder portions. With the connector engaged in the gap at the second end of the cap, this endwall will contact against the connector body when moving toward the second position and defines a rotation or pivoting limiter for the cap body. Removal of the support connector will eliminate this rotation limiter by removing the endwall, wherein an exterior surface of the lid will define the rotation limiter for the body of the cap. The device is, thus, configurable by the user to include the pivoting cap, with or without the preferred pivoting connector, should such not be needed for current use. Further, the user is provided with an onboard measuring scoop or the like formed by the measuring cavity in the body of the connector. The measuring cavity is easily deployed and used by a simple disengagement of the body of the connector from the second pivoting engagement. The loop or handle extending from the connector body is held in the fingers of the user while the measuring cavity is employed to measure powder or liquid. With respect to the above description, before explaining at least one preferred embodiment of the herein disclosed lid device for removable engagement to a container in detail, it is to be understood that the invention is not limited in its application to the details of construction and to the arrangement of the components in the following description or illustrated in the drawings. The invention herein described is capable of other embodiments and of being practiced and carried out in various ways which will be obvious to those skilled in the art. Also, it is to be understood that the phraseology and terminology employed herein are for the purpose of description and should not be regarded as limiting. As such, those skilled in the art will appreciate that the conception upon which this disclosure is based may readily be utilized as a basis for designing of other container lid structures, methods and systems for carrying out the several purposes of the present disclosed device. It is important, therefore, that the claims be regarded as including such equivalent construction and methodology insofar as they do not depart from the spirit and scope of the present invention. As used in the claims to describe the various inventive aspects and embodiments, “comprising” means including, but not limited to, whatever follows the word “comprising”. Thus, use of the term “comprising” indicates that the listed elements are required or mandatory, but that other elements are optional and may or may not be present. By “consisting of” is meant including, and limited to, whatever follows the phrase “consisting of”. Thus, the phrase “consisting of” indicates that the listed elements are required or mandatory, and that no other elements may be present. By “consisting essentially of” is meant including any elements listed after the phrase, and limited to other elements that do not interfere with or contribute to the activity or action specified in the disclosure for the listed elements. Thus, the phrase “consisting essentially of” indicates that the listed elements are required or mandatory, but that other elements are optional and may or may not be present depending upon whether or not they affect the activity or action of the listed elements. The term “substantially” where not specifically otherwise defined, is plus or minus 5 percent. Objects, features, and advantages of the invention will be brought out in the following part of the specification, wherein detailed description is for the purpose of fully disclosing the invention without placing limitations thereon. BRIEF DESCRIPTION OF DRAWING FIGURES The accompanying drawings, which are incorporated herein and form a part of the specification, illustrate some, but not the only or exclusive, examples of embodiments and/or features. It is intended that the embodiments and figures disclosed herein are to be considered illustrative rather than limiting. In the drawings: FIG. 1 depicts the user configurable lid in a removable engagement to an underlying container which is configured in a first mode having a cap pivotally engaged to projections on a lid. FIG. 2 shows a view of a particularly preferred mode of the lid device as in FIG. 1, but wherein a removably engageable connector which is in a separate second pivoting engagement with and between shoulder portions at a second end of the cap, and holds the cap in engagement to the shoulders. FIG. 3 shows an exploded view of the lid device as in FIG. 2 wherein the user would assemble it from the components shown. FIG. 4 shows an exploded view of the body forming the pivoting cap and the body of the connector which engages the lid herein in an independent pivoting engagement with shoulder portions of the cap. FIG. 5 depicts the components assembled of FIG. 4. FIG. 5A shows the connector having a handle member extending from one side thereof, and showing the measuring cavity formed therein which is employable as a fluid or powder measuring scoop. FIG. 6 depicts the lid device as in FIG. 1 in operative removable engagement to any container, having a cap body in a first position with the second end thereof sealing the opening in the lid and wherein the connector has not been engaged by the user. FIG. 7 shows the device as in FIG. 6, with the elongated cap body pivoted to second position with the second end thereof disengaged from the opening and in a position angled toward the bottom of the container and away from the face of a drinking user. FIG. 8 is an overhead view of the device as in FIG. 2 showing the lid device herein engaged to a container. FIG. 9 shows a side perspective view of the device as in FIG. 8 and shows the dome shaped top surface having an elevated central area surrounded by an annular surrounding area which is lower in elevation. FIG. 10 depicts the lid device, in use, engaged to a container adapted for such where the container is for drinking showing the cap of the lid device being rotatable to a position away from contact with the drinking user. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS OF THE INVENTION In this description, the directional prepositions of up, upwardly, down, downwardly, front, back, top, upper, bottom, lower, left, right and other such terms refer to the device as it is oriented and appears in the drawings and are used for convenience only; they are not intended to be limiting or to imply that the device has to be used or positioned in any particular orientation. Now referring to drawings in FIGS. 1-10, wherein similar components are identified by like reference numerals, there is seen in FIG. 1 the user configurable lid device 10 which is configured for engagement to a container herein, configured in a first mode. In this mode of the device, the lid 14 is formed by a lid body and is configured with a lid fastener which is removably engageable to a container fastener of a container 12 such as a liquid container 12 having threads or a frictional connection adapted for such. By lid fastener is meant a first fastener which engages with a mating second fastener on a container 14. As shown, for example, the lid 14 can be configured for removable engagement in a seal over the cavity 30 of the container 12 to which it is configured to engage. By removable engagement is meant employing mating fasteners on both the lid 14 and the container 12, to hold the lid 14 thereon. Such, for example, may be a second lid fastener on the container 12 such as mating threads 31, which will threadably engage with the first lid fastener formed of matching mating threads (not shown but well known) on the lid 14. Such a removable engagement may also be, for example, a snap on engagement of a recess on a bottom of the lid 14 with a projection on the container 12 to removably engage the lid 14 to cover and seal over the cavity 30 of a container 12, or it could be a frictional engagement of a recess in the bottom of the lid 14 over an exterior circumference of the container 12 adjacent the cavity 30 opening. The lid 14, thus, can be provided separately from a container 12 and used in combination therewith, so long as the lid 14 will form a removable engagement covering the cavity 30 of the container 12. While thread, frictional, and snap on engagements are mentioned herein, any removable engagement of the lid 14 with a contain 12 which will seal the cavity 30, as would occur to those skilled in the art, is anticipated within the scope of this invention, such as a snap on seal between the two and/or a frictional engagement of the circumference of the cap 14 with a circumferential area of the container 12 or other means for a sealed removable engagement therebetween. As shown, the lid 14 or lid body, has a first projection 16 extending from and above a top surface 15 of the lid 14 opposite and inline with a second projection 18 extending from the top surface 15 of the lid 14. A cap body 20 is pivotally engaged at a first end thereof, directly to the first projection 16 and second projection 18 extending from a lid 14 which is removably engaged to a container 12. As noted, this is preferred because the lid 14 can be configured without the connector 22 engaged, and still provide the cap body 20 in the first pivoting engagement with the first and second projections, where the connector 22 is not desired. This first pivoting engagement of the cap body 20, as shown, is formed by a first shoulder portion 24 in a rotational engagement with the first projection 16 from the lid 14, and a second shoulder portion 26, rotationally engaged directly to the second projection 18 from the lid 14. While other pivoting engagements are employable and anticipated within the scope of this patent, currently, a first pin 33 on the first shoulder portion 24 is axially aligned with a second pin 35 on the second shoulder portion 26. The first pin 33 rotationally engages directly with the first recess 36 and the second pin engages directly with the second recess 38 to form the first pivoting engagement. However, the pins may be positioned on the projections and the recesses on the shoulder portions, for example, in another configuration of the first pivoting engagement. The first shoulder 24 and second shoulder 26 are preferably formed of a flexible material such as a plastic or polymeric material, which will allow them to flex or deflect slightly during this positioning of the cap body 20 to this first pivoting engagement. FIG. 2 shows a view of the lid 14 herein as in FIG. 1, but wherein a removably engageable connector 22 has a body 23 which is in a separate and independent second pivoting engagement with the first end of the cap body 20. This second pivoting engagement of the connector 22 with the cap body 23 is currently a first protrusion 32 on a first sidewall 49 of the connector 22 engaging with a first slot 40 in the first shoulder portion 24 of the cap body 20, and a second protrusion 34 on a second sidewall 50 of the connector 22, engaging with a second slot 42 formed into the second shoulder portion 26 of the cap body 20. Thus, the second pivoting engagement of the connector 22 with the second end of the cap body 20 positions it within a gap 51 between the first shoulder portion 24 and second shoulder portion 26. FIG. 3 shows an exploded view of the lid 14 as in FIG. 2 wherein the user would assemble it from the components shown. As shown, the cap body 20 may have a recess 28 formed at a first end thereof. This recess 28, if provided, may be employed as a secondary measuring component, to measure volume amounts, such as spoonfuls of additives to be deposited into a drink in a cup or different vessel, or into the interior cavity 30 of the container 12. The cap body 20 is, thus, rotationally engageable in the first pivoting engagement directly with the first and second projections from the cap 14, with or without the inclusion of the connector 22, which is preferably included in the second pivoting engagement with the second end of the cap body 20. The removable first pivoting engagement of the cap body 20 positions the first shoulder portion 24 and second shoulder portion 26 in between and engaged with the first projection 16 from the lid 14 and the second projection 18 from the lid 14. As an example of such rotational or pivoting engagement, the first pin 33 extending from the first shoulder 24 engages with a first recess 36 in the first projection 16 of the lid 14, and a second projecting pin 35 extending from the second shoulder 26 rotationally, engages a second recess 38 in the second projection 18 from the lid 14. The depicted connector 22, while not required, is preferably included in the second pivoting engagement to the first shoulder 24 and second shoulder 26 which are located at the first end of the cap body 20. Such is accomplished by first positioning the connector body 23 in between the first shoulder 24 and second shoulder 26, by sliding a first slot 40, located on the first shoulder 24, and a second slot 42 located on the second shoulder 26, over a first protrusion 32 extending from a first sidewall 49 of the connector 22 and the second slot 42 in the second shoulder 26 over a second protrusion 34 extending from the second sidewall 50 of the connector 22. Subsequently, the first pivoting connection is formed by positioning the first pin 33 on the cap body 20 and the second projection 35 on the cap body 20 engaged into the first slot 40 and second slot 42 respectively. FIG. 4 shows an exploded view of the cap body 20 of the rotating member and the body 23 of the connector 22. While the connector 22 is shown with a rectangular annular handle member 25 in the form of a ring having a ring opening 29 therein and extending from a body 23 of the connector 22, to define and form a carrying handle, it could be formed circular or oval or in another shape. The ring opening 29 allows for a clip or hook or strap or other support component to be engaged therethrough or to the ring member 25. This engagement of a support component allows an engaged container to be hung from the person of the user or from a belt or backpack using the connection of the support component to the user or their person. Particularly preferred is the fact that the handle member 25 will swivel in the gap 51 in the second pivoting engagement with the first shoulder portion 24 and second shoulder portion 26 of the cap body 20. This swivel of the handle member 25 occurs independently of the cap 20 which remains sealed and in the first pivoting engagement with the two projections 16 and 18. The first projecting pin 33 on the first shoulder 24 of the cap 20 has a beveled distal edge 17 in the same configuration as the beveled distal edge 17 depicted on the projecting second pin 35. The beveled edges 17, on both projecting pins 33 and 35, allow for the user to push the two shoulders 24 and 26 between the two projections 16 and 18 and to slightly deflect the two projections 16 and 18 and/or shoulder portions, during engagement of the cap body 20 to the first pivoting engagement, with more ease than if they were not present. The two beveled edges 17 will slide on and deflect the two shoulders 24 and 26 inward into the gap 51, therebetween, during a connection to the first pivoting engagement if the connector is not present. The sealing projection 48 at the second end of the cap 20 is sized to seal the opening 49 shown in FIG. 3, for example, with the cap 20 pivoted to a first or sealing position, such as shown in FIGS. 1-2. Also shown, enlarged are the second protrusion 34 opposite the first protrusion 32 on an opposite first side of the body 23 of the connector 22 (shown in FIG. 3), which will form the second pivoting engagement within the first slot 40 formed in the first shoulder 24 and a second slot 42 formed into the second shoulder 26. The components of the lid depicted in FIG. 4 are shown assembled in FIG. 5 where the connector 22 is depicted in a pivoting engagement in the gap 51 (FIG. 1) between the two shoulders 24 and 26. So assembled, the cap body 20 can be slid into the first pivoting engagement between the first projection 16 and second projection 18 by contacting the beveled edges 17 on both the projecting pins 33 and 35 against the an upper edge of both the first projection 16 and second projection 18 and pushing on the cap body 20. This will cause a slight deflection of the first projection 16 and second projection 18 away from each other as they slide on the beveled edges 17, whereafter the first projecting pin 33 and second projecting pin 35 will engage with the first recess 36 and second recess 38 to form the first pivoting engagement. FIG. 5A shows the connector 22 with the body 23 thereof having a handle member 25 extending from one side thereof surrounding the ring opening 29. While shown as a rectangular shape, it can be any looped shape to function to hold the lid 14 to a sling or D-ring or other component for carrying. The body 23 of the connector 22 has a measuring cavity 27 formed therein, in between a first sidewall 48 having the first protrusion 32 thereon, and second side wall 50 having the second protrusion 34 thereon. As noted, the first protrusion 32 engaged with the first slot 40 and the second protrusion 34 engaged within the second slot 42, form the second pivoting engagement which has been found to provide a force to better hold the first shoulder 24 and second shoulder 26 in the first pivoting engagement with the first projection 16 and second projection 18 respectively. This measuring cavity 27 has a fixed volume such as a tablespoon, teaspoon, or the like, to allow the user to measure a volume of powder or liquid from or for deposit into the container. The handle member 25 allows the user to grip the connector 22 once removed from the second pivoting engagement, and use the measuring cavity 27 to scoop the desired amount of material from the container 12 or for deposit into the container 12. Shown in FIG. 6 is the lid 14 or device 10, as in FIG. 1, in operative sealed engagement with the container 12. The lid 14 has the elongated body of the cap 20 in the first pivoting engagement and is located in the first position sealing the opening 49 in a mode of the device not as favored wherein the connector 22 is not employed. In FIG. 7 is depicted the lid 14 or device 10 as in FIG. 6, with the elongated body of the cap 20 pivoted to a second position, opposite the first position of FIG. 6, and out of the way of a user drinking from the opening 49 if the attached container 12 holds liquid for such. FIG. 8 is an overhead view of the lid 14 as in FIG. 2, showing the body of the cap 20 pivoted in the first pivoting engagement to the first position wherein the sealing projection 48 is sealably engaged with the opening 46 in the spout of the cap 14, to prevent the contents from the chosen engaged container 12 from exiting the opening 49. As can be seen, the positioning of the two projections 16 and 18 and the curved shape of the surface of the lid 14 are configured to allow the cap body 20 to rotate to a declining angle in the second position, well below the line 53 running across the edge of the drinking spout 54 surrounding the opening 48 FIG. 9 is a side perspective view of the dome shaped lid 14 removably engaged with a chosen container as in FIG. 8, wherein the dome shaped cap body 20 is pivoted in the first pivoting engagement to the second position, and the body 23 of the connector 22 is engaged in the second pivoting engagement in the gap 51 between the first shoulder portion 24 and second shoulder portion 26. In this configuration, a surface edge 21 of the cap body 20 contacts against the surface of the connector 22 and thereby forms a limit to further pivoting toward the second position by the cap body 20. Also, the dome shape of the top surface 15 of the lid 14 has a central area 41 which is situated at a higher elevation than an annular surrounding area 47. This is preferred, as noted, above because it allows for positioning of the cap body 20 away from and out of contact with the face of a user when the container is inverted with the lower end of the container 12 elevated above the lid 14. Shown in FIG. 10 is the lid 14 device herein operatively engaged to a chosen container 12 in use for drinking therefrom. As shown, the lid 14 in operative removable engagement to the container 12, when tipped for drinking use with the elongated cap body 20 engaged to the lid 14, is pivoted in the first pivoting engagement toward the second position thereof. In this second position, the cap body 20 contacts against the connector 22, the elongated cap body 20 is positioned at an angle running from the first end engaged to the first and second projections 16 and 18, toward the bottom of the engaged container 12. This angled positioning locates the sealing projection 48 and surface of the cap body 20 a distance away from the line 53 running across the edge of the spout 54. Because the connector 22 is rotationally engaged within the two shoulders 24 and 26 of the cap body 20, enhanced angular positioning is accomplished in either the mode where the connector 22 is not engaged in the second pivoting engagement with the body of the cap 20, or where it is engaged therewith. This is because the first shoulder 24 and second shoulder 26 rotate in the engagement to the first projection 16 and second projection 18, and allow the surface of the cap body 20 to rotate and touch against the surface of the connector surrounding the ring opening 29. This combined with the dome shape of the upper surface of the lid 14, allows the cap body 20 to be angularly positioned in a downward position on one side of the dome forming the top surface of the lid 14, and the opening 46. However, even with the connector 22 positioned in the second pivoting engagement within the gap 51 between the two shoulders 24 and 26 at the second end of the body of the cap 20, the elongated body of the cap 20, when pivoted to the second position, will still angle away from the line 53 and from the face of the user, and avoid contact therewith when the connector 22 is operatively engaged. This lid invention has other applications potentially, and one skilled in the art could discover these. The description of the features of this invention does not limit the claims of this application and applications developed by those skilled in the art will be included in this invention. While all of the fundamental characteristics and features of the invention have been shown and described herein, with reference to particular embodiments thereof, a latitude of modification, various changes and substitutions are intended in the foregoing disclosure and it will be apparent that in some instances, some features of the invention may be employed without a corresponding use of other features without departing from the scope of the invention as set forth. It should also be understood that various substitutions, modifications, and variations may be made by those skilled in the art without departing from the spirit or scope of the invention. Consequently, all such modifications and variations and substitutions are included within the scope of the invention as defined by the following claims. What is claimed: 1. A lid comprising: a lid body, said lid body having a top surface, said lid body configured for a sealed engagement with a container; an opening communicating through said lid body; a first cap projection extending from said top surface opposite a second cap projection extending from said top surface; said first cap projection and said second cap projection having a space therebetween; a cap body having a first end opposite a second end; said first end of said cap body in a first pivoting engagement with both said first cap projection and said second cap projection; said cap body pivotable to a first position having said second end in a sealed engagement with said opening; and said cap body pivotable to a second position having said second end disengaged from said sealed engagement, whereby liquid located within said container while in said sealed engagement with said cap body, is dispensable through said opening. 2. The lid of claim 1, wherein said first pivoting engagement between said first end of said cap body with both said first cap projection and said second cap projection comprises: a first shoulder positioned on said first end of said cap body; a second shoulder positioned on said first end of said cap body; a gap located in between said first shoulder and said second shoulder; a first projection extending from said first shoulder being in a first rotating engagement with first recess formed into said first cap projection; and a second projection extending from said second shoulder being in a second rotating engagement with second recess formed into said second cap projection. 3. The lid of claim 2, additionally comprising: said cap body being formed of flexible material; said first end of said cap being removably engageable to said first pivoting engagement; a first beveled edge positioned upon said first projection extending from said first shoulder; a second beveled edge positioned upon said second projection extending from said second shoulder; and said cap body engageable to said first pivoting engagement by pushing said first end thereof into said space thereby causing a temporary first deflection of said first shoulder into said gap during a first sliding contact of said first beveled edge with said first cap projection, and causing a temporary second deflection of said second shoulder into said gap during a second sliding contact of said second beveled edge against said second cap projection. 4. The lid of claim 2, additionally comprising: a connector having a first end and having a second end; said first end of said connector being in a second pivoting engagement within the gap between said first shoulder and said second shoulder of said cap body; a ring having a ring opening therein at said second end of said connector; and said ring opening defining an attachment point for said cap to the person of a user. 5. The lid of claim 3, additionally comprising: a connector having a first end and having a second end; said first end of said connector being in a second pivoting engagement within the gap between said first shoulder and said second shoulder of said cap body; a ring having a ring opening therein at said second end of said connector; and said ring opening defining an attachment point for said cap to the person of a user. 6. The lid of claim 4 wherein said second pivoting engagement comprises: a first protrusion extending from a first side of said ring connector; a second protrusion extending from a second side of said ring connector opposite and in line with said first protrusion; said first protrusion engaged within a first slot formed into said first shoulder; and said second protrusion engaged within a second slot formed into said second shoulder. 7. The lid of claim 5 wherein said second pivoting engagement comprises: a first protrusion extending from a first side of said ring connector; a second protrusion extending from a second side of said ring connector opposite and in line with said first protrusion; said first protrusion engaged within a first slot formed into said first shoulder; and said second protrusion engaged within a second slot formed into said second shoulder. 8. The lid of claim 4 additionally comprising a measuring cavity positioned at said first end of said connector. 9. The lid of claim 5 additionally comprising a measuring cavity positioned at said first end of said connector. 10. The lid of claim 6 additionally comprising a measuring cavity positioned at said first end of said connector. 11. The lid of claim 7 additionally comprising a measuring cavity positioned at said first end of said connector. 12. The lid of claim 1 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid. 13. The lid of claim 2 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid. 14. The lid of claim 3 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid. 15. The lid of claim 4 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid. 16. The lid of claim 8 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid. 17. The lid of claim 9 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid. 18. The lid of claim 10 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid. 19. The lid of claim 11 additionally comprising: said top surface of said lid body being dome shaped; said dome shaped top surface having an elevated central area and having an annular surrounding area having said top surface at a lower elevation than said elevated central area; said opening being positioned in said annular surrounding area on a first side of said lid; said first cap projection and said second cap projection being positioned in said annular surrounding area on a second side of said lid opposite said opening; and said cap body when pivoted to said second position extending in a direction away from both said first pivoting engagement and said opening, whereby said second end of said cap body is positioned to avoid contact with the face of a user drinking from said opening with said container inverted with a lower end of said container elevated above said lid.

2021-09-02

en

2022-09-22

US-202217651325-A

Smart Sensor Scheduler ABSTRACT A system includes an image sensor having a plurality of pixels that form a plurality of regions of interest (ROIs), image processing resources, and a scheduler configured to perform operations including determining a priority level for a particular ROI of the plurality of ROIs based on a feature detected by one or more image processing resources of the image processing resources within initial image data associated with the particular ROI. The operations also include selecting, based on the feature detected within the initial image data, a particular image processing resource of the image processing resources by which subsequent image data generated by the particular ROI is to be processed. The operations further include inserting, based on the priority level, the subsequent image data into a processing queue of the particular image processing resource to schedule the subsequent image data for processing by the particular image processing resource. CROSS-REFERENCE TO RELATED APPLICATION This application is a continuation of and claims priority to U.S. patent application Ser. No. 16/730,760, filed Dec. 30, 2019, and titled “Smart Sensor Scheduler,” which is hereby incorporated by reference as if fully set forth in this description. BACKGROUND An image sensor includes a plurality of light-sensing pixels that measure an intensity of light incident thereon and thereby collectively capture an image of an environment. A Bayer filter may be applied to the image sensor to allow the image sensor to generate color images of the environment. Image sensors may be used in a plurality of applications such as photography, robotics, and autonomous vehicles. SUMMARY The pixels of an image sensor may form a plurality of regions of interest (ROIs). The image sensor may be configured to generate full-resolution image data that includes each of these ROIs, or ROI image data that includes a subset of the ROIs. As the environment of the image sensor changes over time, ROIs that contain therein features of interest may generate more image data than others. To avoid oversubscription of some image processing resources used by the image sensor for processing these ROI images, a scheduler may be provided on the image sensor. The scheduler may be configured to distribute the ROI images among the image processing resources. Based on the content of the ROI images, the scheduler may select a priority level for the ROI image and an image processing resource by which the ROI image is to be processed. The scheduler may then insert the ROI image into a processing queue of the selected resource to scheduler processing of the ROI image. The scheduler may be configured to distribute the ROI images among the processing resources based on a desired latency, throughput, or utilization, among other objectives. In a first example embodiment, a system is provided that includes an image sensor having a plurality of pixels that form a plurality of ROIs, a plurality of image processing resources, and a scheduler configured to perform operations. The operations include determining a priority level for a particular ROI of the plurality of ROIs based on a feature detected by one or more image processing resources of the plurality of image processing resources within initial image data associated with the particular ROI. The operations also include selecting, based on the feature detected within the initial image data, a particular image processing resource of the plurality of image processing resources by which subsequent image data generated by the particular ROI is to be processed. The operations further include inserting, based on the priority level of the particular ROI, the subsequent image data into a processing queue of the particular image processing resource to schedule the subsequent image data for processing by the particular image processing resource. In a second example embodiment, a method is provided that includes determining, by a scheduler, a priority level for a particular ROI of a plurality of ROIs formed by a plurality of pixels of an image sensor. The priority level is determined based on a feature detected by one or more image processing resources of a plurality of image processing resources within initial image data associated with the particular ROI. The method also includes selecting, by the scheduler and based on the feature detected within the initial image data, a particular image processing resource of the plurality of image processing resources by which subsequent image data generated by the particular ROI is to be processed. The method further includes inserting, by the scheduler and based on the priority level of the particular ROI, the subsequent image data into a processing queue of the particular image processing resource to schedule the subsequent image data for processing by the particular image processing resource. In a third example embodiment a non-transitory computer readable storage medium is provided having stored thereon instructions that, when executed by a computing device, cause the computing device to perform operations. The operations include determining a priority level for a particular ROI of a plurality of ROIs formed by a plurality of pixels of an image sensor. The priority level is determined based on a feature detected by one or more image processing resources of a plurality of image processing resources within initial image data associated with the particular ROI. The operations also include selecting, based on the feature detected within the initial image data, a particular image processing resource of the plurality of image processing resources by which subsequent image data generated by the particular ROI is to be processed. The operations further include inserting, based on the priority level of the particular ROI, the subsequent image data into a processing queue of the particular image processing resource to schedule the subsequent image data for processing by the particular image processing resource. In a fourth example embodiment, a system is provided that includes means for determining a priority level for a particular ROI of a plurality of ROIs formed by a plurality of pixels of an image sensor. The priority level is determined based on a feature detected by one or more image processing resources of a plurality of image processing resources within initial image data associated with the particular ROI. The system also includes means for selecting, based on the feature detected within the initial image data, a particular image processing resource of the plurality of image processing resources by which subsequent image data generated by the particular ROI is to be processed. The system further includes means for inserting, based on the priority level of the particular ROI, the subsequent image data into a processing queue of the particular image processing resource to schedule the subsequent image data for processing by the particular image processing resource. These, as well as other embodiments, aspects, advantages, and alternatives, will become apparent to those of ordinary skill in the art by reading the following detailed description, with reference where appropriate to the accompanying drawings. Further, this summary and other descriptions and figures provided herein are intended to illustrate embodiments by way of example only and, as such, that numerous variations are possible. For instance, structural elements and process steps can be rearranged, combined, distributed, eliminated, or otherwise changed, while remaining within the scope of the embodiments as claimed. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 illustrates a block diagram of an image sensor with three integrated circuit layers, in accordance with example embodiments. FIG. 2 illustrates an arrangement of regions of interest, in accordance with example embodiments. FIG. 3A illustrates an image sensor and a scheduler, in accordance with example embodiments. FIG. 3B illustrates image processing queues, in accordance with example embodiments. FIG. 4 illustrates a priority policy, in accordance with example embodiments. FIG. 5 illustrates interconnections between image processing resources, in accordance with example embodiments. FIG. 6 illustrates image processing queues, in accordance with example embodiments. FIG. 7 illustrates a flow chart, in accordance with example embodiments. DETAILED DESCRIPTION Example methods, devices, and systems are described herein. It should be understood that the words “example” and “exemplary” are used herein to mean “serving as an example, instance, or illustration.” Any embodiment or feature described herein as being an “example,” “exemplary,” and/or “illustrative” is not necessarily to be construed as preferred or advantageous over other embodiments or features unless stated as such. Thus, other embodiments can be utilized and other changes can be made without departing from the scope of the subject matter presented herein. Accordingly, the example embodiments described herein are not meant to be limiting. It will be readily understood that the aspects of the present disclosure, as generally described herein, and illustrated in the figures, can be arranged, substituted, combined, separated, and designed in a wide variety of different configurations. Further, unless context suggests otherwise, the features illustrated in each of the figures may be used in combination with one another. Thus, the figures should be generally viewed as component aspects of one or more overall embodiments, with the understanding that not all illustrated features are necessary for each embodiment. Additionally, any enumeration of elements, blocks, or steps in this specification or the claims is for purposes of clarity. Thus, such enumeration should not be interpreted to require or imply that these elements, blocks, or steps adhere to a particular arrangement or are carried out in a particular order. Unless otherwise noted, figures are not drawn to scale. I. OVERVIEW Sensors may be provided on an autonomous vehicle to assist with perception of and navigation through various environments. These sensors may include image sensors, light detection and ranging (LIDAR) devices, and/or radio detection and ranging (RADAR) devices, among others. These sensors may be capable of generating more data than can be timely processed by processing resources provided by the sensors and/or by the autonomous vehicle. This may be the case, for example, when a large number of sensors is provided on the vehicle and/or when the resolution of each sensor is high, resulting in generation of a large amount of sensor data. Additionally, desired data transfer latency and/or the amount of data transfer bandwidth available on the sensor and/or the autonomous vehicle may limit the amount of sensor data that can be utilized. Accordingly, sensing components and corresponding circuitry may be provided that divide a field of view of the sensor into a plurality of regions of interest (ROIs) and allow for selective readout of sensor data from individual ROIs. For example, in the case of an image sensor, the pixels of the image sensor may form a plurality of ROIs, each of which may be read out independently of other ROIs. That is, the image sensor may generate image data in some ROIs (e.g., those that contain therein some object of interest) while other ROIs (e.g., those that do not contain an object of interest) are not used to generate image data. These ROIs may allow the image sensor to accommodate high frame rate and/or high resolution imaging while at the same time reducing the total amount of image data that is generated, analyzed, and/or transmitted. ROI images and full-resolution images may be processed by a plurality of image processing resources to detect in these images features that are useful in controlling the autonomous vehicle. The image processing resources may include pixel-level processing circuitry, neural network circuitry, control systems of the autonomous vehicle, and/or communicative connections between subsets of the plurality of image processing resources. Some of the image processing resources may be included as part of the circuitry and/or packaging of the image sensor, while others may be provided as part of the circuitry and/or packaging of other components of the autonomous vehicle (e.g., the control system). The pixel-level processing circuitry may be configured to perform pixel-level processing, such as analog-to-digital conversion, demosaicing, high dynamic range fusion, and image sharpening, among other operations. The neural network circuitry may be configured to process output of the pixel-level processing circuitry to extract higher-order features and/or semantic information from the captured images. The neural network circuitry may also be configured to detect objects of interest within the image data based on the features and/or semantic information. Control systems of the vehicle may be configured to control the vehicle based on outputs of the pixel-level processing circuitry and/or the neural network circuitry, among other information. Communicative connections between these processing resources may allow for sharing of data, coordination, and cooperation between the processing resources in operating the autonomous vehicle. A scheduler may be provided to coordinate the operations of the image sensor and the image processing resources. Specifically, the scheduler may be configured to schedule the processing of image data generated by the sensor based on the availability of the image processing resources, the relative importance of the features represented by different ROIs, the task being performed by the vehicle, and/or the relationship between the features and the task, among other considerations. For example, the scheduler may be configured to minimize the latency between obtaining a given image data by the image sensor and processing the given image data by the plurality of image processing resources, maximize the utilization of the plurality of image processing resources, and/or maximize the throughput of image data through the plurality of image processing resources. To that end, the scheduler may be configured to determine priority levels for different ROIs of the plurality of ROIs. The priority level assigned to a particular ROI may be based on a feature detected by one or more image processing resources within initial image data associated with the particular ROI. The initial image data may have been generated by the particular ROI, and the detected feature may be expected to be viewable by the particular ROI at a future time. Alternatively, the initial image data may have been generated by another ROI, and the detected feature may be expected to be viewable by the particular ROI at the future time. The priority level of a given ROI may change over time as different features are present within that ROI. Priority levels may be assigned by the scheduler according to a predetermined priority policy. The policy may associate each priority level with corresponding combinations of features of interest, tasks being carried out by the vehicle, environmental conditions, relationship between the features of interest and the tasks, and/or other contextual information. Thus, image processing operations that are more important to the operation of the vehicle (e.g., pedestrian detection) may be prioritized relative to image processing operations that are less important. The priority policy may be modifiable to allow for different combinations of features and operational contexts to be prioritized to different extents. The scheduler may also be configured to select, based on the feature detected within the initial image data, a particular image processing resource of the plurality of image processing resources by which subsequent image data generated by the particular ROI is to be processed. The particular image processing resource may be selected based on the availability of this and other image processing resources. For example, the system may include multiple instances of a particular type of image processing resource. The scheduler may select an instance that has a shortest processing queue or a processing queue containing therein only lower priority tasks, among other considerations. In one example, when the detected feature is a crosswalk, the particular image processing resource may be a neural network configured to detect pedestrians. In another example, when the detected feature is a vehicle, the particular image processing resource may be a neural network configured to continue to detect and/or track the vehicle. In a further example, when the feature of interest is a final result of processing by one or more neural networks, the particular image processing resource may be a communicative connection between the one or more neural networks and a control system of the vehicle. Allocation of this communicative connection may allow the control system of the vehicle to determine how to operate the vehicle based on this final result. As can be seen from these examples, the image processing resource selected by the scheduler may be the same as or different from the image processing resources that initially detected the feature of interest. In some implementations, the set of image processing resources available to process image data from a given ROI may be spatially constrained. For example, the image sensor and at least a portion of the image processing resources may be implemented as part of a multi-layer integrated circuit. The image sensor may be defined on a first layer of the integrated circuit, while the image processing resources may be defined on one or more additional layers of the integrated circuit. The pixels of a particular ROI may be electrically connected to a subset, but not all, of the image processing resources. This subset of the image processing resources may be spatially co-located with the ROI. For example, the subset may include processing resources disposed above the ROI (i.e., in the same area of the integrated circuit as the ROI). In another example, the subset may include image processing resources disposed above the ROI and any adjacent ROIs, but might not include the image processing resources disposed above non-adjacent ROIs. Thus, the scheduler may be configured to select the image processing resources for a particular ROI from the subset available for that particular ROI. The image processing resources may be interconnected with one another in a similarly spatially-constrained fashion. For example, pixel-level processing circuitry located above a given ROI may be interconnected to neural network circuitry located above the given ROI, but not neural network circuitry located above other ROIs. In other implementations, each ROI may be processed by any available image processing resource without any spatial constraints. The scheduler may be further configured to insert the subsequent image data into a processing queue of the particular image processing resource. A position in the processing queue at which the subsequent image data is inserted may be based on the priority level of the particular ROI. This insertion into the queue may schedule the subsequent image data for processing by the particular image processing resource. For example, image data with a high priority may be inserted into the processing queue such that it precedes any image data with a lower priority and follows any image data with a higher priority. Thus, image data may be processed in an order that reflects its importance in operating the autonomous vehicle. When multiple image data have the same or similar priority, the processing order may be determined according to policy, such as a first-in-first-out (FIFO) policy, a last-in-first-out (LIFO) policy, a shortest-job-first (SJF) policy, or a round robin (RR) policy, among other possibilities. Further, image data may be assigned an expiration time. Expired image data may be dropped from the processing queue, thus allowing the image processing resources to avoid processing image data that no longer accurately represents the current environment of the vehicle. The scheduler may also be configured to consider dependencies among different image processing resources. For example, when neural network circuitry is scheduled to operate on an intermediate result generated by pixel-level processing circuitry, the intermediate result may be inserted into the processing queue of the neural network circuitry at a position that allows sufficient time for the intermediate result to be generated. Thus, the position of the intermediate result in the processing queue of the neural network circuitry may depend on a position of the initial image data in a processing queue of the pixel-level processing circuitry that generated the intermediate result. II. EXAMPLE SMART SENSOR FIG. 1 is a block diagram of an example image sensor 100 with three integrated circuit layers. Image sensor 100 may use the three integrated circuit layers to detect objects. For example, image sensor 100 may capture an image that includes a person and output an indication of “person detected.” In another example, image sensor 100 may capture an image and output a portion of the image that includes a vehicle that was detected by image sensor 100. The three integrated circuit layers includes a first integrated circuit layer 110, a second integrated circuit layer 120, and a third integrated circuit layer 130. First integrated circuit layer 110 is stacked on second integrated circuit layer 120, and second integrated circuit layer 120 is stacked on third integrated circuit layer 130. First integrated circuit layer 110 may be in electrical communication with second integrated circuit layer 120. For example, first integrated circuit layer 110 and second integrated circuit layer 120 may be physically connected to one another with interconnects. Second integrated circuit layer 120 may be in electrical communication with third integrated circuit layer 130. For example, second integrated circuit layer 120 and third integrated circuit layer 130 may be physically connected to one another with interconnects. First integrated circuit layer 110 may have a same area as second integrated circuit layer 120. For example, the length and width of first integrated circuit layer 110 and second integrated circuit layer 120 may be the same while the heights may be different. Third integrated circuit layer 130 may have a larger area than first and second integrated circuit layers 110, 120. For example, third integrated circuit layer 130 may have a length and width that are both twenty percent greater than the length and the width of first and second integrated circuit layers 110, 120. First integrated circuit layer 110 may include an array of pixel sensors that are grouped by position into pixel sensor groups (each pixel sensor group referred to as “pixel group” in FIG. 1) 112A-112C (collectively referred to by 112). For example, first integrated circuit layer 110 may include a 6400×4800 array of pixel sensors grouped into three hundred twenty by two hundred forty pixel sensor groups, where each pixel sensor group includes an array of 20×20 pixel sensors. Pixel sensor groups 112 may be further grouped to define ROIs. Each of pixel sensor groups 112 may include 2×2 pixel sensor sub-groups. For example, each of the pixel sensor groups of 20×20 pixel sensors may include ten by ten pixel sensor sub-groups, where each pixel sensor sub-group includes a red pixel sensor in an upper left, a green pixel sensor in a lower right, a first clear pixel sensor in a lower left, and a second clear pixel sensor in an upper right, each sub-group also referred to as Red-Clear-Clear-Green (RCCG) sub-groups. In some implementations, the size of the pixel sensor groups may be selected to increase silicon utilization. For example, the size of the pixel sensor groups may be such that more of the silicon is covered by pixel sensor groups with the same pattern of pixel sensors. Second integrated circuit layer 120 may include (pixel-level) image processing circuitry groups (each image processing circuitry group referred to as “process group” in FIG. 1) 122A-122C (collectively referred to by 122). For example, second integrated circuit layer 120 may include three hundred twenty by two hundred forty image processing circuitry groups. Image processing circuitry groups 122 may be configured to each receive pixel information from a corresponding pixel sensor group and further configured to perform image processing operations on the pixel information to provide processed pixel information during operation of image sensor 100. In some implementations, each image processing circuitry group 122 may receive pixel information from a single corresponding pixel sensor group 112. For example, image processing circuitry group 122A may receive pixel information from pixel sensor group 112A and not from any other pixel group, and image processing circuitry group 122B may receive pixel information from pixel sensor group 112B and not from any other pixel group. In some implementations, each image processing circuitry group 122 may receive pixel information from multiple corresponding pixel sensor groups 112. For example, image processing circuitry group 122A may receive pixel information from both pixel sensor groups 112A and 112B and no other pixel groups, and image processing circuitry group 122B may receive pixel information from pixel group 112C and another pixel group, and no other pixel groups. Having image processing circuitry groups 122 receive pixel information from corresponding pixel groups may result in fast transfer of the pixel information from first integrated circuit layer 110 to second layer 120 as image processing circuitry groups 122 may physically be close to the corresponding pixel sensor groups 112. The longer the distance over which information is transferred, the longer the transfer may take. For example, pixel sensor group 112A may be directly above image processing circuitry group 122A and pixel sensor group 112A may not be directly above the image processing circuitry group 122C, so transferring pixel information from pixel sensor group 112A to the image processing circuitry group 122A may be faster than transferring pixel information from the pixel sensor group 112A to image processing circuitry group 122C, if there were interconnects between pixel sensor group 112A and image processing circuitry group 122C. Image processing circuitry groups 122 may be configured to perform image processing operations on pixel information that image processing circuitry groups 122 receives from the pixel groups. For example, image processing circuitry group 122A may perform high dynamic range fusion on pixel information from pixel sensor group 112A and image processing circuitry group 122B may perform high dynamic range fusion on pixel information from pixel sensor group 112B. Other image processing operations may include, for example, analog to digital signal conversion and demosaicing. Having image processing circuitry groups 122 perform image processing operations on pixel information from corresponding pixel sensor groups 112 may enable image processing operations to be performed in a distributed fashion in parallel by image processing circuitry groups 122. For example, image processing circuitry group 122A may perform image processing operations on pixel information from pixel sensor group 112A at the same time as image processing circuitry group 122B performs image processing operations on pixel information from pixel group 122B. Third integrated circuit layer 130 may include neural network circuitry groups 132A-132C (each neural network circuitry group referred to as “NN group” in FIG. 1) 132A-132C (collectively referred to by 132) and full image neural network circuitry 134. For example, third integrated circuit layer 130 may include three hundred twenty by two hundred forty neural network circuitry groups. Neural network circuitry groups 132 may be configured to each receive processed pixel information from a corresponding image processing circuitry group and further configured to perform analysis for object detection on the processed pixel information during operation of image sensor 100. In some implementations, neural network circuitry groups 132 may each implement a convolutional neural network (CNN). In some implementations, each neural network circuitry group 132 may receive processed pixel information from a single corresponding image processing circuitry group 122. For example, neural network circuitry group 132A may receive processed pixel information from image processing circuitry group 122A and not from any other image processing circuitry group, and neural network circuitry group 132B may receive processed pixel information from image processing circuitry group 122B and not from any other image processing circuitry group. In some implementations, each neural network circuitry group 132 may receive processed pixel information from multiple corresponding image processing circuitry groups 122. For example, neural network circuitry group 132A may receive processed pixel information from both image processing circuitry groups 122A and 122B and no other image processing circuitry groups, and neural network circuitry group 132B may receive processed pixel information from both image processing circuitry group 122C and another pixel group, and no other pixel groups. Having the neural network circuitry groups 132 receive processed pixel information from corresponding image processing circuitry groups may result in fast transfer of the processed pixel information from second integrated circuit layer 120 to third integrated circuit layer 130 as neural network circuitry groups 132 may physically be close to the corresponding image processing circuitry groups 122. Again, the longer the distance over which information is transferred, the longer the transfer may take. For example, image processing circuitry group 122A may be directly above neural network circuitry group 132A so transferring processed pixel information from image processing circuitry group 122A to neural network circuitry group 132A may be faster than transferring processed pixel information from image processing circuitry group 122A to neural network circuitry group 132C, if there were interconnects between image processing circuitry group 122A and neural network circuitry group 132C. Neural network circuitry groups 132 may be configured to detect objects from the processed pixel information that neural network circuitry groups 132 receive from image processing circuitry groups 122. For example, neural network circuitry group 132A may detect objects from the processed pixel information from image processing circuitry group 122A, and neural network circuitry group 132B may detect objects from the processed pixel information from image processing circuitry group 122B. Having neural network circuitry groups 132 detect objects from the processed pixel information from corresponding image processing circuitry group 122 enables detection to be performed in a distributed fashion in parallel by each of neural network circuitry groups 132. For example, neural network circuitry group 132A may detect objects from processed pixel information from image processing circuitry group 122A at the same time as neural network circuitry group 132B may detect objects from processed pixel information from image processing circuitry group 122B. In some implementations, neural network circuitry groups 132 may perform intermediate processing. Accordingly, image sensor 100 may use the three integrated circuit layers 110, 120, and 130 to perform some intermediate processing and output just an intermediate result. For example, image sensor 100 may capture an image that includes a person and output an indication of “area of interest in some region of the image,” without classifying the object of interest (the person). Other processing, performed outside image sensor 100 may classify the region of interest as a person. Accordingly, the output from image sensor 100 may include some data representing the output of some convolutional neural network. This data in itself may be hard to decipher, but once it continues to be processed outside image sensor 100, the data may be used to classify the region as including a person. This hybrid approach may have an advantage of reducing required bandwidth. Accordingly, output from neural network circuitry groups 132 may include one or more of selected regions of interest for pixels representing detections, metadata containing temporal and geometrical location information, intermediate computational results prior to object detection, statistical information regarding network certainty level, and classifications of detected objects. In some implementations, neural network circuitry groups 132 may be configured to implement CNNs with high recall and low precisions. Neural network circuitry groups 132 may each output a list of objects detected, where the object was detected, and timing of detection of the object. Full image neural network circuitry 134 may be configured to receive, from each of neural network circuitry groups 132, data that indicates objects that neural network circuitry groups 132 detected and detect objects from the data. For example, neural network circuitry groups 132 may be unable to detect objects that are captured by multiple pixel groups, as each individual neural network circuitry group may only receive a portion of processed pixel information corresponding to the object. But, full image neural network circuitry 134 may receive data from multiple neural network circuitry groups 132 and may thus be able to detect objects sensed by multiple pixel groups. In some implementations, full image neural network circuitry 134 may implement a recurrent neural network (RNN). The neural networks may be configurable, both in regard to their architecture (number and type of layers, activation functions, etc.) as well as in regard to the actual values of neural network components (e.g. weights, biases, etc.) In some implementations, having image sensor 100 perform processing may simplify a processing pipeline architecture, provide higher bandwidth and lower latency, allow for selective frame rate operations, reduce costs with the stacked architecture, provide higher system reliability as an integrated circuit may have fewer potential points of failure, and provide significant cost and power savings on computational resources. III. EXAMPLE ROI ARRANGEMENT FIG. 2 illustrates an example arrangement of ROIs on an image sensor. Namely, image sensor 200 may include pixels forming C columns and R rows. Image sensor 200 may be analogous to image sensor 100. Thus, the pixels of image sensor 200 may correspond to first integrated circuit layer 110. Image sensor may be divided into eight ROIs, including ROI 0, ROI 1, ROI 2, ROI 3, ROI 4, ROI 5, ROI 6, and ROI 7 (i.e., ROIs 0-7), each of which comprises m columns of pixels and n rows of pixels. Thus, C=2m and R=4n. In some implementations, each ROI may include therein multiple pixel groups 112. Alternatively, pixel groups 112 may be sized and arranged such that each pixel group is also an ROI. FIG. 2 illustrates the ROIs arranged into two columns, with even-numbered ROIs on the left and odd-numbered ROIs on the right. In other implementations, however, the ROIs and their numbering may be arranged in different ways. For example, ROIs 0-3 may be in the left column while ROIs 4-7 may be in the right column. In another example, the ROIs may divide image sensor 200 into 8 columns organized into a single row, with the ROIs numbered from 0-7 arranged from left to right along the 8 columns of the single row. In some implementations, the ROIs may be fixed in a given arrangement. Alternatively, the ROIs may be reconfigurable. Namely, the number of ROIs, position of each ROI, and the shape of each ROI may be reconfigurable. Image data may be read-out from a given ROI of ROIs 0-7 independently of the other ROIs. For example, image data may be acquired from ROI 0 without also acquiring image data from the other ROIs. In another example, ROI image data may be read out from two or more different ROIs in parallel (e.g., from ROI 2 and ROI 7). Image data generated by a union of ROIs 0-7 may be referred to as a full-resolution image, while image data that includes a subset of ROIs 0-7 may be referred to as an ROI image. Image sensor 200 may include a combination of analog-to-digital converters (ADCs), multiplexers, and read-out transistors that allows for independent readout of each of ROIs 0-7. ROI image data may be read out from a given ROI column by column or row by row, depending on the arrangement of the read-out circuitry. For example, when ROI 2 is to be read out, read-out circuitry may be reassigned from ROIs 0, 4, and 6 to read out 4 columns of ROI 2 in parallel. In another example, read-out circuitry may be reassigned from ROIs 0, 1, and 3-7 to ROI 2 to read out 8 columns of ROI 2 in parallel. Thus, the rate at which a given ROI may be read-out may depend on the amount of image read-out circuitry that is reassignable to between the ROIs. The full-resolution image and/or one or more ROI images may be used to select one or more ROIs from which ROI images are to be acquired. For example, the full-resolution images may be analyzed to detect therein an object of interest. An ROI that contains or is expected to contain the object of interest may be selected to be used to generate a plurality of ROI images for further analysis. An object may be considered to be of interest based on, for example, a speed of the object (e.g., when this speed exceeds a threshold speed or is below the threshold speed) a distance between image sensor 100 and the object (e.g., when this distance exceeds a threshold distance is is below the threshold distance), and/or a classification of the object, among other possibilities. In some implementations, selection of the ROI may be performed by third integrated circuit layer 130 of image sensor 100. For example, full image NN circuitry 134 may be used to select the ROI. In other implementations, the ROI may be selected by a control system (e.g., a control system of an autonomous vehicle) that is communicatively connected to and operates based on the outputs of image sensor 100. Once a particular ROI is selected, the particular ROI may be used to acquire a plurality of ROI images. IV. EXAMPLE SCHEDULER ARCHITECTURE FIG. 3A illustrates an example architecture of a scheduler for image sensor 200. Specifically, image sensor 200 may include scheduler 302, pixel groups 310 and 312 through 314 (i.e., pixel groups 310-314) defining ROIs 0-7, respectively, and a plurality of image processing resources. The image processing resources include pixel-level processing circuitry 320, 322, and 324 through 330 (i.e., pixel-level processing circuitry 320-330), machine learning circuitry 340, 342, and 344 through 350 (i.e., machine learning circuitry 340-350), and communicative connections 316, 332, and 352. Image sensor 200 may be configured to provide image data to control system 360, which may also be considered a part of the image processing resources. Control system 360 may represent a combination of hardware and software configured to generate operations for a robotic device or an autonomous vehicle, among other possibilities. Pixel groups 310-314 represent groupings of the pixels that make up image sensor 200. In some implementations, each of pixel groups 310-314 may correspond to one or more of pixel sensor groups 112. Pixel groups 310-314 may represent circuitry disposed in first integrated circuit layer 110. The number of pixel sensor groups represented by each of pixel groups 310-314 may depend on the size of each of ROIs 0-7. In implementations where the number, size, and/or shape of ROIs are reconfigurable, the subset of pixel sensor groups 112 making up each of pixel groups 310-314 may vary over time based on the number, size, and/or shape of the ROIs. Pixel-level processing circuitry 320-330 represent circuitry configured to perform pixel-level image processing operations. Pixel-level processing circuitry 320-330 may operate on outputs generated by pixel groups 310-314. The pixel-level operations may include analog-to-digital conversion, demosaicing, high dynamic range fusion, image sharpening, filtering, edge detection, and/or thresholding. Pixel-level operations may also include other types of operations that are not carried out by way of machine learning models (e.g., neural networks) provided on image sensor 200 or by control system 360. In some implementations, each of pixel-level processing circuitry 320-330 may include one or more of process groups 122, among other circuitry configured to perform pixel-level image processing operations. Thus, pixel-level circuitry 320-330 may represent circuitry disposed in second integrated circuit layer 120. Machine learning circuitry 340-350 may include circuitry configured to execute operations associated with one or more machine learning models. Machine learning circuitry 340-350 may operate on outputs generated by pixel groups 310-314 and/or pixel-level processing circuitry 320-330. In some implementations, each of machine learning circuitry 340-350 may correspond to one or more of neural network groups 132 and/or full image neural network circuitry 132, among other circuitry that implements machine learning models. Thus, machine learning circuitry 340-350 may represent circuitry disposed in third integrated circuit layer 130. Communicative connections 316 may represent electrical interconnections between pixel-level processing circuitry 320-330 and pixel groups 310-314. Similarly, communicative connections 332 may represent electrical interconnections between (i) machine learning circuitry 340-350 and (ii) pixel-level processing circuitry 320-330 and/or pixel groups 310-314. Further, communicative connections 352 may represent electrical interconnections between machine learning circuitry 340-350 and control system 360. Communicative connections 316, 332, and 352 may be considered a subset of the image processing resources at least because these connections (i) facilitate the transfer of data between circuitry configured to process the image data and (ii) may be modified over time to transfer data between different combinations of the circuitry configured to process the image data. In some implementations, communicative connections 316 may represent electrical interconnections between first integrated circuit layer 110 and second integrated circuit layer 120, and communicative connections 332 may represent electrical interconnections between second integrated circuit layer 120 and third integrated circuit layer 130. Communicative connections 352 may represent electrical interconnections between third integrated circuit layer 130 and one or more circuit boards by way of which image sensor 200 is connected to control system 360. Each of communicative connections 316, 332, and 352 may be associated with a corresponding maximum bandwidth. Because image sensor 200 is divided into a plurality of ROIs which may generate ROI image data in an asymmetric fashion, some of pixel groups 310-314 may generate more image data than others. The amount of image data generated by a given pixel group may fluctuate over time depending on the features or objects represented by this image data. Accordingly, some portions of pixel-level processing circuitry 320-330 and/or machine learning circuitry 340-350 might be oversubscribed by being requested to process more of the ROI image data than is requested of other portions. Without a scheduler, this may result in a bottleneck that limits the rate at which ROI image data can be generated and processed. For example, if pixel-level processing circuitry 320 and machine learning circuitry 340, along with the electrical interconnections therebetween, were the only image processing resources configured to process image data from pixel group 310, the rate at which ROI images are generated from ROI 0 might be limited by the throughput of circuitry 320, 340, and/or the interconnections therebetween. Further, during a period of time when ROI images are being acquired from ROI 0, but not from the other ROIs, circuitry 322-330 and 342-350, as well as the interconnections therebetween, might be idle. In such a fixed assignment of circuitry, approximately 87.5% of the circuitry of image sensor 200 might be idle while ROI image data is being acquired from a single ROI. Thus, such a fixed assignment may be inefficient in terms of utilization of the available circuitry, image data processing throughput, and expended energy (e.g., wasted energy when circuitry is idle). Accordingly, rather than relying on fixed interconnections between ROIs and image processing resources, scheduler 302 may be configured to dynamically distribute the generated image data for processing among image processing resources 316, 320-330, 340-350, 332, 352, and/or 360 (i.e., image processing resources 316-360) available to image sensor 200. Specifically, the distribution of image data among image processing resources 316-360 may be performed according to priority policy 304, an example of which is illustrated in and discussed with respect to FIG. 4. Priority policy 304 may define priority levels for various combinations of image features, vehicle tasks, vehicle operating conditions, and other contextual information. Thus, priority policy 304 may, at least in part, indicate how to prioritize the processing of different ROIs. Scheduler 302 may be communicatively connected to each of image processing resources 316-360, and may be aware of (e.g., may receive, access, and/or store a representation of) the capabilities of, workloads assigned to, and/or features detected by each of image processing resources 316-360. Thus, in some implementations, scheduler 302 may be configured to distribute image data among image processing resources 316-360 in a manner that improves or minimizes a latency between obtaining and processing image data, improves or maximizes a utilization of image processing resources 316-360, and/or improves or maximizes a throughput of image data through image processing resources 316-360. These objectives may be quantified by one or more objective functions, each of which may be minimized or maximized (e.g., globally or locally) to achieve the corresponding objective. V. EXAMPLE PROCESSING QUEUES FIG. 3B illustrates example processing queues of a plurality of image processing resources. Scheduler 302 may be configured to schedule ROI image data generated by a particular ROI for processing by an image processing resource by adding the ROI image data to a processing queue of the image processing resource. Accordingly, FIG. 3B illustrates processing queue 362 of pixel-level processing circuitry 320, processing queue 364 of pixel level processing circuitry 322, and processing queue 364 of machine learning circuitry 350. Each of pixel-level processing circuitries 324-330, machine learning circuitries 340-344, and/or control system 360 may also be associated with corresponding queues, which are not shown, but are indicated by the ellipses in FIG. 3B. Processing queues (“queues,” for short) 362-366 may be implemented as storage buffers, each of which may be co-located with its corresponding processing circuitry on image sensor 200. In other implementations, queues 362-366 may be maintained by scheduler 302, rather than by the corresponding circuitry. FIG. 3B also illustrates detected feature queue 370 configured to store data representing features that have been detected within corresponding ROIs by the image processing circuitry. Specifically, detected feature queue may be maintained and/or stored by scheduler 302 or another component of image sensor 200. When a particular image processing resource (e.g., machine learning circuitry 350) detects a feature of interest within image data captured by a particular ROI, information regarding this detection and the corresponding ROI may be added to the rear of detected feature queue 370. In the example illustrated in FIG. 3B, detected feature queue 370 includes information regarding features detected in ROIs 5 (at the front of queue 370), 0, 7, 2, 1, 4, and 6 (at the rear of queue 370). The processing queue in which scheduler 302 places the image data acquired from a particular ROI, and the position of this image data within the queue, may depend on the current and/or expected contents of the ROI image data. Thus, detected feature queue 370 may include, for a particular detected feature, data identifying (i) the ROI in which the feature was detected, (ii) the feature (e.g., the classification, type, of other indicator thereof) that was detected within the ROI, (iii) attributes, properties, and/or characteristics of the detected feature (e.g., distance, speed, etc.), and/or (iv) a time at which initial image data, within which the feature was detected, was captured, among other information. Accordingly, based on this data, scheduler 302 may be configured to determine a corresponding ROI in which the detected feature is expected to be observed at a future time, assign a priority level to the detected feature and/or the corresponding ROI, and select an image processing resource by way of which subsequent image data acquired from the corresponding ROI at the future time is to be processed. Scheduler 302 may be configured to assign the priority level to the feature based on the type and/or classification of the feature. This assignment of priority level may be facilitated by priority policy 304. Scheduler 302 may be configured to select the corresponding ROI in which the detected feature is expected to be observed at the future time based on attributes of the detected feature (e.g., speed and direction relative to a vehicle on which sensor 200 is mounted). Scheduler 302 may be configured to select the image processing resource for the subsequent image data based on the type and/or classification of the feature. For example, the selected image processing resources may be configured to re-detect, within the subsequent image data, the previously-detected feature, or detect other features commonly associated with this detected feature (e.g., detect traffic lights within the subsequent image data on the basis of detecting a cross-walk within the initial image data). Scheduler 302 may schedule the image data associated with the ROIs indicated in queue 370 in, for example, a FIFO order. Specifically, scheduler 302 may start scheduling with ROI 5 and thereafter continue through ROIs 0, 7, 2, 1, 4, and 6. Each ROI indicated in queue 370 may represent one or more ROI images, with the exact amount depending on, for example, the type of detected feature and the purpose for which the feature is being detected and/or tracked. In some implementations, scheduler 302 may be configured to schedule multiple ROIs in parallel. In cases where multiple image processing resources are available for processing particular ROI image data, scheduler 302 may be configured to select the image processing resource with the shortest queue. For example, if both circuitry 320 and 322 are available for processing the image data associated with ROI 5, scheduler 302 may add ROI 5 to queue 362 because it is shorter than queue 364. In some implementations, scheduler 302 may be configured to always add the ROI image data to the rear of the selected queue, regardless of the priority assigned to the ROI image data. In other implementations, the position at which the ROI image data is inserted into the queue may depend on the priority level of the ROI image data. For example, the ROI image data may be inserted such that it preceded any image data having lower priorities and follows any image data having higher priorities. When, for example, scheduler 302 determines to insert ROI 5 into queue 362 and ROI 5 has a higher priority than the already-scheduled ROI 7 and a lower priority than the already-scheduled ROI 1, ROI 5 may be inserted between these two already-scheduled ROIs. Thus, higher-priority ROI image data may be allowed to skip in front of lower-priority image data in the queue, allowing image sensor 200 to detect high-priority features with low latency. Multiple ROI image frames that have the same priority level may be scheduled for processing in a FIFO order, a LIFO order, a SJF order, a random order, or an RR order, among other possibilities. VI. EXAMPLE SCHEDULER PRIORITY POLICY FIG. 4 illustrates an example of priority policy 304 that may be used by scheduler 302 to assign priorities to different detected features and/or their corresponding ROIs. For example, priority policy 304 may define a plurality of priority levels 400, ROI features 402, and maximum latencies 404. In the example shown, priority policy includes 8 different priority levels ranging from 1 to 8, with 1 representing the highest priority and 8 representing the lowest priority. Each of priority levels 400 may be associated with a corresponding set of ROI features 402. For example, priority level 1 may be associated with detection of humans in the path of the vehicle, priority level 2 may be associated with detection of other vehicles and/or detection of humans to the sides of the vehicle. Priority level 3 may be associated with detection of traffic signs and signals, priority level 4 may be associated with detection of road markings, and priority level 5 may be associated with detection of vehicle localization features (e.g., fiducial markers). Priority level 6 may be associated with detection of features behind the vehicle, priority level 7 may be associated with detection of features beyond a threshold height above the vehicle, and priority level 8 may be associated with an absence of any feature detections. Priority levels 1, 2, and 3 may be associated with a maximum latency of 50 milliseconds between (i) generation of given ROI image data and (ii) completion of processing of the image data by a selected image processing resource. Similarly, priority levels 4, 5, and 6 may be associated with a maximum latency of 75 milliseconds, and priority levels 7 and 8 may be associated with a maximum latency of 200 milliseconds. Scheduler 302 may be configured to assign image data for processing in a manner that allows the image data to be processed within the maximum latency time allowed for its assigned priority level. Thus, the image processing operations may be grouped into, for example, short-term, medium-term, and long-term operations depending on the associated latency. In some implementations, scheduler 302 may be configured to associate an expiration time with each image data inserted into a processing queue, thus allowing the image processing resource to omit processing of the image data if processing is not initiated and/or completed before the expiration time. In practice, priority policy 304 may be more complicated than shown in FIG. 4. For example, each of priority levels 400 may be associated with one or more additional types of features, tasks being performed by the vehicle, other contextual information, and/or combinations thereof. Thus, a particular feature may be assigned a different priority depending on the operation being performed by the vehicle and/or the environmental conditions in which the vehicle is operating, among other factors. For example, when the vehicle is backing up, features behind the vehicle may be assigned priority level 1, rather than priority level 6. Further, the number of priority levels and the features, tasks, and/or operating conditions corresponding to each priority level may be modified, thus allowing for performance of scheduler 302 to be adjusted and tuned to achieve desired results. VII. EXAMPLE SPATIAL CONSTRAINTS FIG. 5 illustrates an example implementation of image sensor 200 in which ROI image data may be configured to be processed by spatially co-located image processing resources. Image sensor 200 includes pixel groups 310-314, pixel level processing circuitry 320-330, ROI neural network circuitry 500, 502, 504, 506, and 508 through 510 (i.e., ROI neural network circuitry 500-510), and full image neural network circuitry 512. Neural network circuitry 500-510 and 512 may correspond to machine learning circuitry 340-350 of FIG. 3A. As the physical distance between a pixel group and the image processing circuitry assigned thereto increases, it may take longer to transfer the image data between these two components. Thus, the latency associated with the image processing may increase and throughput may decrease. For example, in implementations where pixel group 310 is interconnected with each of pixel-level processing circuitry 320-330, the amount of time allotted for data transfer may be sufficiently large to allow for data transfer over the longest transmission path (e.g., corner to corner across image sensor 200 from pixel group 310 to circuitry 330). On the other hand, as the physical distance between two components decreases, it may take less time to transfer the image data between these two components, thus decreasing the latency and increasing the throughput. Thus, if pixel group 310 is interconnected with a co-located subset of pixel-level processing circuitry 320-330, the amount of time allotted for data transfer may be reduced relative to the fully interconnected example. Accordingly, in some implementations, scheduler 302 may be configured to take into account any spatial constraints between pixel groups and image processing resources in scheduling the processing of image data. Additionally or alternatively, when multiple image processing resources are available for processing image data, scheduler 302 may prioritize assigning the image data to an image processing resource that is closest to the ROI from which the image data originated. Further, in implementations where each pixel group is interconnected with each of pixel-level processing circuitry 320-330 (and each of pixel-level processing circuitry 320-330 is, in turn, interconnected with the ROI neural network circuitries), scheduler 302 may simulate a spatial constraint by scheduling a given pixel group for processing by co-located circuitry and avoiding scheduling the given pixel group by non-co-located circuitry. In general, circuitry may be considered to be co-located with a pixel group when the circuitry is disposed within a threshold distance of the pixel group and/or when data can be transmitted therebetween in under a threshold period of time. In the embodiment illustrated in FIG. 5, pixel group 310 may be disposed in the same portion of image sensor 200 (i.e., in the same area but in a different layer) as pixel-level processing circuitry 320 and 322 and ROI neural network circuitry 500 and 502, as indicated by the shared hatched pattern thereof. Similarly, pixel group 312 may be may be disposed in the same portion of image sensor 200 as pixel-level processing circuitry 324 and 326 and ROI neural network circuitry 504 and 506, and pixel group 314 may be may be disposed in the same portion of image sensor 200 as pixel-level processing circuitry 328 and 330 and ROI neural network circuitry 508 and 510. Thus, pixel groups 310-314 may be considered to be co-located with any circuitry disposed in the same area of, but in a different layer, of image sensor 200. Further, as illustrated in FIG. 2, ROIs 0 and 1 may be adjacent to one another, but not to ROI 7. Thus, pixel-level processing circuitry 324 and 326 and ROI neural network circuitry 504 and 506 may also be adjacent to ROI 0, but not ROI 7. Accordingly, pixel-level processing circuitry 320-322 and ROI neural network circuitry 500-506 may each be viewed as being co-located with each of pixel groups 310 and 312, but not pixel group 314. Thus, these components are shown interconnected with one another in FIG. 5. In some implementations, circuitry (not shown) disposed beneath the pixel group that defines ROI 2 may also be considered to be co-located with pixel group 310, and circuitry disposed beneath the pixel group that defines ROI 3 may also be considered to be co-located with pixel group 312. In other implementations, pixel-level processing circuitry 324 might be considered co-located with pixel group 310 (e.g., due to being directly adjacent thereto), while pixel-level processing circuitry 326 might not be considered co-located with pixel group 310 (e.g., due to not being directly adjacent thereto). Full image neural network circuitry 512 may be viewed as co-located with each of pixel groups 310-314 in that it is configured to process full-resolution images (e.g., by aggregating the processing results from multiple ROIs). Accordingly, the subset of circuitry 320-330 and 500-510 that is considered co-located with a given pixel group may vary. This subset may be defined, at the time image sensor 200 is manufactured, by the formation of some, but not other, interconnections. Alternatively or additionally, the subset may be defined dynamically by defining, for scheduler 302, the subset of image processing resources by which image data from a particular ROI may be processed. In either case, scheduler 302 may be configured to enforce any hard-wired and/or programmed spatial constraints. Specifically, scheduler 302 may be configured to insert the image data associated with a particular ROI into the queues of image processing resources that are included in the co-located subset of image processing resources, and avoid inserting this image data into the queues of image processing resources that are not included in the subset. VIII. EXAMPLE DEPENDENCY-AWARE SCHEDULING Scheduler 302 may also be configured to schedule the image data for processing in a dependency-aware manner. Specifically, FIG. 6 illustrates scheduling dependencies that may be accounted for by scheduler 302. FIG. 6 illustrates pixel-level processing circuitry 320, ROI neural network circuitry 502, and full image neural network circuitry 512, each of which are associated with a corresponding one of processing queues 362, 600, and 602, respectively. In some cases, image data from a particular ROI may be processed sequentially by multiple image processing components. For example, as illustrated in FIG. 6, image data acquired from ROI 2 may first be processed by pixel-level processing circuitry 320 to generate an intermediate result. The intermediate result of pixel-level processing circuitry 320 may then be provided to ROI neural network circuitry 502, which may use this intermediate result to detect higher-order image features. The output of ROI neural network circuitry 502 may then be combined with similar results associated with the other ROIs that make up the full-resolution image and may be processed by full image neural network circuitry 512. For example, pixel-level processing circuitry 320 may be configured to generate an HDR image based on multiple ROI images from ROI 2. ROI neural network circuitry 502 may detect within the HDR image various edges, curves, and other geometric features. Full image neural network circuitry may aggregate such features from multiple ROIs to detect one or more objects of interest (e.g., pedestrians, vehicles, etc.). Rather than waiting for the output of circuitry 320 to be generated and placed in queue 370 before scheduling circuitry 502, and subsequently waiting for the output of circuitry 502 and placed in queue 370 before scheduling circuitry 512, scheduler 302 may be configured to schedule each of circuitries 320, 502, and 512 as part of a single scheduling operation. Further, in scheduling these circuitries, scheduler 302 may take into account the processing time associated with each circuitry. Thus, as illustrated in FIG. 6, the image data associated with ROI 2 may be placed at the front of queue 362. The intermediate result of circuitry 320 may be placed in queue 600 before the image data associated with ROI 0 and after ROI 1, thus allowing the intermediate result to be generated before it is expected as input by circuitry 502. Similarly, the output of circuitry 502 may be placed in queue 602 after the image data associated with ROIs 0-7 making up full image 604, thus allowing the output of circuitry 502 to be generated before it is expected as input by circuitry 512. IX. ADDITIONAL EXAMPLE OPERATIONS FIG. 7 illustrates a flow chart of operations related to scheduling of image data for processing by image processing resources. The operations may be carried out by image sensor 100, image sensor 200, and/or scheduler 302, among other possibilities. However, the operations can also be carried out by other types of devices or device subsystems. For example, the process could be carried out by a server device, an autonomous vehicle, and/or a robotic device. The embodiments of FIG. 7 may be simplified by the removal of any one or more of the features shown therein. Further, these embodiments may be combined with features, aspects, and/or implementations of any of the previous figures or otherwise described herein. Block 700 may involve determining, by a scheduler, a priority level for a particular ROI of a plurality of ROIs formed by a plurality of pixels of an image sensor. The priority level may be determined based on a feature detected by one or more image processing resources of a plurality of image processing resources within initial image data associated with the particular ROI. Block 702 may involve selecting, by the scheduler and based on the feature detected within the initial image data, a particular image processing resource of the plurality of image processing resources by which subsequent image data generated by the particular ROI is to be processed. Block 704 may involve inserting, by the scheduler and based on the priority level of the particular ROI, the subsequent image data into a processing queue of the particular image processing resource to schedule the subsequent image data for processing by the particular image processing resource. In some embodiments, the image sensor may include a first layer of an integrated circuit, and the plurality of image processing resources may include one or more additional layers of the integrated circuit. Image data generated by the particular ROI may be configured to be processed by a first subset of image processing resources of the plurality of image processing resources, and the first subset of image processing resources may be spatially co-located with the particular ROI on the integrated circuit. Thus, selecting the particular image processing resource may include selecting the particular image processing resource from the first subset of image processing resources. In some embodiments, selecting the particular image processing resource may include selecting (i) a first image processing resource of the plurality of image processing resources by which the subsequent image data generated by the particular ROI is to be processed to generate an intermediate result and (ii) a second image processing resource of the plurality of image processing resources by which the intermediate result is to be processed. In some embodiments, inserting the subsequent image data into the processing queue of the particular image processing resource may include inserting the subsequent image data into a first processing queue of the first image processing resource and, based on a position of the subsequent data in the first processing queue, inserting the intermediate result into a second processing queue of the second image processing resource such that the intermediate result is scheduled for processing by the second image processing resource after the intermediate result is generated by the first image processing resource. In some embodiments, determining the priority level for the particular ROI may include receiving, from the one or more image processing resources, an indication that the feature was detected within the initial image data. The particular ROI may be determined based on a subset of the plurality of pixels from which the one or more image processing resources obtained the initial image data. In some embodiments, determining the priority level for the particular ROI may include selecting the priority level from a plurality of priority levels based on the feature detected by one or more image processing resources. Each respective priority level of the plurality of priority levels may be associated with at least one corresponding image data feature. In some embodiments, the particular image processing resource may be selected further based on environmental conditions expected to be present at a time when the subsequent image data is generated. In some embodiments, inserting the subsequent image data into the processing queue of the particular image processing resource may include determining an expiration time by which the subsequent image data is to be processed by the particular image processing resource. The expiration time may be associated with the subsequent image data in the processing queue. The particular image processing resource may be configured to omit processing the subsequent image data after the expiration time. In some embodiments, the initial image data may be generated by the particular ROI, and determining the priority level for the particular ROI may include determining that the feature detected by the one or more image processing resources within the initial image data generated by the particular ROI is expected to remain within the particular ROI at a time when the subsequent image data is planned to be captured. In some embodiments, the initial image data may be generated by a second ROI different from the particular ROI, and determining the priority level for the particular ROI may include determining that the feature detected by the one or more image processing resources within the initial image data generated by the second ROI is expected to move from the second ROI to the particular ROI and be viewable by the particular ROI at a time when the subsequent image data is planned to be captured. In some embodiments, a vehicle may be configured to operate based on output of the plurality of image processing resources. The priority level for the particular ROI may be determined further based on (i) a task being carried out by the vehicle and (ii) a relationship between the task and the feature detected by the one or more image processing resources. In some embodiments, the particular image processing resource may be selected further based on an amount of image data in the processing queue of the particular image processing resource. In some embodiments, the particular image processing resource may be selected further based on an at least one of: (i) a first objective function that minimizes a latency between obtaining a given image data by the image sensor and processing the given image data by the plurality of image processing resources, (ii) a second objective function that maximizes a utilization of the plurality of image processing resources, or (iii) a third objective function that maximizes a throughput of image data through the plurality of image processing resources. In some embodiments, the plurality of image processing resources may include one or more of: (i) pixel-level processing circuitry, (ii) neural network circuitry, (iii) a control system of an autonomous vehicle, or (iv) communicative connections between subsets of the plurality of image processing resources. In some embodiments, the scheduler may be configured to determine to deactivate an additional ROI of the plurality of ROIs based on an additional feature detected by one or more additional image processing resources of the plurality of image processing resources within additional image data associated with the additional ROI. Based on the additional ROI, one or more further image processing resources of the plurality of image processing resources may be selected to be deactivated. The one or more further image processing resources may be deactivated. X. CONCLUSION The present disclosure is not to be limited in terms of the particular embodiments described in this application, which are intended as illustrations of various aspects. Many modifications and variations can be made without departing from its scope, as will be apparent to those skilled in the art. Functionally equivalent methods and apparatuses within the scope of the disclosure, in addition to those described herein, will be apparent to those skilled in the art from the foregoing descriptions. Such modifications and variations are intended to fall within the scope of the appended claims. The above detailed description describes various features and operations of the disclosed systems, devices, and methods with reference to the accompanying figures. In the figures, similar symbols typically identify similar components, unless context dictates otherwise. The example embodiments described herein and in the figures are not meant to be limiting. Other embodiments can be utilized, and other changes can be made, without departing from the scope of the subject matter presented herein. It will be readily understood that the aspects of the present disclosure, as generally described herein, and illustrated in the figures, can be arranged, substituted, combined, separated, and designed in a wide variety of different configurations. With respect to any or all of the message flow diagrams, scenarios, and flow charts in the figures and as discussed herein, each step, block, and/or communication can represent a processing of information and/or a transmission of information in accordance with example embodiments. Alternative embodiments are included within the scope of these example embodiments. In these alternative embodiments, for example, operations described as steps, blocks, transmissions, communications, requests, responses, and/or messages can be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved. Further, more or fewer blocks and/or operations can be used with any of the message flow diagrams, scenarios, and flow charts discussed herein, and these message flow diagrams, scenarios, and flow charts can be combined with one another, in part or in whole. A step or block that represents a processing of information may correspond to circuitry that can be configured to perform the specific logical functions of a herein-described method or technique. Alternatively or additionally, a block that represents a processing of information may correspond to a module, a segment, or a portion of program code (including related data). The program code may include one or more instructions executable by a processor for implementing specific logical operations or actions in the method or technique. The program code and/or related data may be stored on any type of computer readable medium such as a storage device including random access memory (RAM), a disk drive, a solid state drive, or another storage medium. The computer readable medium may also include non-transitory computer readable media such as computer readable media that store data for short periods of time like register memory, processor cache, and RAM. The computer readable media may also include non-transitory computer readable media that store program code and/or data for longer periods of time. Thus, the computer readable media may include secondary or persistent long term storage, like read only memory (ROM), optical or magnetic disks, solid state drives, compact-disc read only memory (CD-ROM), for example. The computer readable media may also be any other volatile or non-volatile storage systems. A computer readable medium may be considered a computer readable storage medium, for example, or a tangible storage device. Moreover, a step or block that represents one or more information transmissions may correspond to information transmissions between software and/or hardware modules in the same physical device. However, other information transmissions may be between software modules and/or hardware modules in different physical devices. The particular arrangements shown in the figures should not be viewed as limiting. It should be understood that other embodiments can include more or less of each element shown in a given figure. Further, some of the illustrated elements can be combined or omitted. Yet further, an example embodiment can include elements that are not illustrated in the figures. While various aspects and embodiments have been disclosed herein, other aspects and embodiments will be apparent to those skilled in the art. The various aspects and embodiments disclosed herein are for purpose of illustration and are not intended to be limiting, with the true scope being indicated by the following claims. What is claimed is: 1. A system comprising: an image sensor comprising a plurality of pixels that form a plurality of regions of interest (ROIs); a first plurality of image processing resources located in a first layer of an integrated circuit; a second plurality of image processing resources located in a second layer of the integrated circuit; and a scheduler configured to perform operations comprising: identifying a particular ROI of the plurality of ROIs based on a feature detected within an initial image data associated with the particular ROI; selecting, based on the feature detected within the initial image data, (i), from the first plurality of image processing resources, a first image processing resource by which subsequent image data generated by the particular ROI is to be processed to generate an intermediate result and (ii), from the second plurality of image processing resources, a second image processing resource by which the intermediate result is to be processed; and scheduling (i) the subsequent image data for processing by the first image processing resource and (ii) the intermediate result for processing by the second image processing resource. 2. The system of claim 1, wherein the first plurality of image processing resources comprises pixel-level processing circuitry configured to operate on outputs of the plurality of pixels, and wherein the second plurality of image processing resources comprises machine learning circuitry configured to operate on outputs of the pixel-level processing circuitry. 3. The system of claim 1, wherein the plurality of pixels are located in a third layer of the integrated circuit that is disposed on a first side of the first layer of the integrated circuit, and wherein the second layer of the integrated circuit is disposed on a second side of the first layer of the integrated circuit. 4. The system of claim 1, wherein the feature is detected by one or more image processing resources of the first plurality of image processing resources and the second plurality of image processing resources. 5. The system of claim 1, wherein at least one image processing resource of the first image processing resource or the second image processing resource is selected further based on the at least one image processing resource being spatially co-located with the particular ROI. 6. The system of claim 1, wherein: scheduling the subsequent image data for processing by the first image processing resource comprises inserting the subsequent image data into a first processing queue of the first image processing resource; and scheduling the intermediate result for processing by the second image processing resource comprises inserting the intermediate result into a second processing queue of the second image processing resource. 7. The system of claim 6, wherein inserting the intermediate result into the second processing queue comprises: determining (i) a first position of the subsequent image data in the first processing queue and (ii) an expected processing time of the subsequent image data by the first image processing resource; and before the intermediate result is generated, inserting the intermediate result at a second position within the second processing queue, wherein the second position is separated in time from the first position by at least the expected processing time. 8. The system of claim 6, wherein inserting the intermediate result into the second processing queue comprises: determining an expiration time by which the intermediate result is to be processed by the second image processing resource; and associating the expiration time with the intermediate result in the second processing queue, wherein the second image processing resource is configured to omit processing the intermediate result after the expiration time. 9. The system of claim 6, wherein one or more of the first image processing resource or the second image processing resource is selected further based on an amount of data in one or more of the first processing queue or the second processing queue. 10. The system of claim 1, wherein identifying the particular ROI comprises: identifying the particular ROI based on a subset of the plurality of pixels, wherein the subset represents the feature detected within the initial image data. 11. The system of claim 1, wherein the operations further comprise: determining a priority level for the particular ROI of the plurality of ROIs based on the feature detected within the initial image data associated with the particular ROI, wherein scheduling of the subsequent image data and the intermediate result is based on the priority level. 12. The system of claim 11, wherein determining the priority level for the particular ROI comprises: selecting the priority level from a plurality of priority levels based on the feature detected within the initial image data, wherein each respective priority level of the plurality of priority levels is associated with at least one corresponding image feature. 13. The system of claim 11, further comprising: a vehicle configured to operate based on outputs of one or more of the first plurality of image processing resources or the second plurality of image processing resources, wherein the priority level for the particular ROI is determined further based on (i) a task being carried out by the vehicle and (ii) a relationship between the task and the feature detected within the initial image data. 14. The system of claim 1, wherein at least one of the first image processing resource or the second image processing resource is selected further based on environmental conditions expected to be present at a time when the subsequent image data is generated. 15. The system of claim 1, wherein the initial image data is generated by the particular ROI, and wherein identifying the particular ROI comprises: determining that the feature detected within the initial image data is expected to remain within the particular ROI at a time when the subsequent image data is planned to be captured. 16. The system of claim 1, wherein the initial image data is generated by a second ROI different from the particular ROI, and wherein identifying the particular ROI comprises: determining that the feature detected within the initial image data is expected to move from the second ROI to the particular ROI and be viewable by the particular ROI at a time when the subsequent image data is planned to be captured. 17. The system of claim 1, wherein one or more of the first image processing resource or the second image processing resource is selected further based on an at least one of: (i) a first objective function configured to quantify a latency between obtaining image data by the image sensor and processing the image data, (ii) a second objective function configured to quantify a utilization of at least one of the first plurality of image processing resources or the second plurality of image processing resources, or (iii) a third objective function configured to quantify a throughput of the image data through at least one of the first plurality of image processing resources or the second plurality of image processing resources. 18. The system of claim 1, wherein the scheduler is also configured to schedule operation of one or more of: (i) a control system of an autonomous vehicle or (ii) communicative connections between different groups of image processing resources. 19. A method comprising: identifying, by a scheduler, a particular region of interest (ROI) of a plurality of ROIs formed by a plurality of pixels of an image sensor, wherein the particular ROI is identified based on a feature detected within an initial image data associated with the particular ROI; selecting, by the scheduler and based on the feature detected within the initial image data, (i), from a first plurality of image processing resources located in a first layer of an integrated circuit, a first image processing resource by which subsequent image data generated by the particular ROI is to be processed to generate an intermediate result and (ii), from a second plurality of image processing resources located in a second layer of the integrated circuit, a second image processing resource by which the intermediate result is to be processed; and scheduling, by the scheduler, (i) the subsequent image data for processing by the first image processing resource and (ii) the intermediate result for processing by the second image processing resource. 20. A non-transitory computer readable storage medium having stored thereon instructions that, when executed by a computing device, cause the computing device to perform operations comprising: identifying a particular region of interest (ROI) of a plurality of ROIs formed by a plurality of pixels of an image sensor, wherein the particular ROI is identified based on a feature detected within an initial image data associated with the particular ROI; selecting, based on the feature detected within the initial image data, (i), from a first plurality of image processing resources located in a first layer of an integrated circuit, a first image processing resource by which subsequent image data generated by the particular ROI is to be processed to generate an intermediate result and (ii), from a second plurality of image processing resources located in a second layer of the integrated circuit, a second image processing resource by which the intermediate result is to be processed; and scheduling (i) the subsequent image data for processing by the first image processing resource and (ii) the intermediate result for processing by the second image processing resource.

2022-02-16

en

2022-06-02

US-202118010701-A

Method for measuring length of living tissue included in slide image, and computing system for performing same ABSTRACT Disclosed are a method for measuring the length of a living tissue included in a slide image, and a computing system for performing same. According to one aspect of the present invention, the method comprising the steps of: segmenting the slide image into a plurality of patches having a predetermined size; generating a graph corresponding to the slide image; for each edge included in the graph, setting a weight of the edge; for each connected component of the graph including two or more nodes, detecting shortest paths between all node pairs included in the connected components and determining a longest shortest path having the longest length from among the detected shortest paths between all the node pairs; and calculating the length of the living tissue included in the slide image, on the basis of the longest shortest path of each connected component constituting the graph. TECHNICAL FIELD The present disclosure relates to a method for measuring the length of a living tissue included in a slide image and a computing system for performing the same. BACKGROUND ART One of the major tasks performed by pathology or department of pathology is to read a patient's biometric image (e.g., a tissue slide of the patient) to perform a diagnosis to determine the condition or symptom for a specific disease. This diagnosis is a method that depends on the experience and knowledge of skilled medical personnel for a long time. A recent trend is to gradually increase a method of reading a slide image generated by digital imaging instead of a living tissue slide. Meanwhile, in most diagnostic practices, pathologists use a microscope and a measuring instrument (e.g., ruler) to manually measure tissue size on slide images, and on the slide image, the living tissue is not in the form of a straight line, but in the form of a very irregular curve, and as a result, there is a problem in that the size of the tissue may be measured differently depending on the pathologist who measures the tissue, and even when the same pathologist measures the same tissue, the size of the tissue may vary for each measurement. In other words, although the size of a living tissue or a lesion tissue in which a lesion appears is treated as a very important factor in pathological diagnosis (e.g., prostate cancer biopsy) through a living body slide image, it is very difficult to accurately measure the size of the tissue. DISCLOSURE OF THE INVENTION Technical Goals Accordingly, the present disclosure has been proposed to solve the problems of the related art as described above, and an object of the present disclosure is to provide a method for accurately and objectively measuring the length of a living tissue included in a slide image. Technical Solutions According to an aspect of the present disclosure, there is provided a method for measuring a length of a living tissue included in a slide image including dividing, by a computing system, the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; generating, by the computing system, a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a living tissue among the plurality of patches, and when the living tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; for each edge included in the graph, setting a weight of the edge; for each connected component of the graph including two or more nodes, detecting shortest paths between all node pairs included in the connected component and determining a longest shortest path with a longest length among the shortest paths between all node pairs; and calculating the length of the living tissue included in the slide image based on the longest shortest path of each connected component included in the graph. In an embodiment, the setting of the weight of the edge may include calculating the weight W of the edge by the following [Equation 1]. W=A/{E(v1)×E(v2)}  [Equation 1] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, and E(x) is the number of edges connected to node x on the graph) In an embodiment, at least some of living tissues included in the slide image may be lesion tissues, and the setting of the weight of the edge may include calculating the weight W of the edge by the following [Equation 2]. W=A/[{E(v1)×E(v2)}×{C(v1)×C(v2)}]  [Equation 2] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, E(x) is the number of edges connected to node x on the graph, and C(y) is 1 when the patch corresponding to node y on the graph does not contain lesion tissue, and α when it does (where α is a predetermined real number greater than 1)) In an embodiment, the method may include binarizing the plurality of patches; and for each of the plurality of binarized patches, based on whether a pixel representing a living tissue exists at each edge line and each corner of the binarized patch, determining whether a living tissue spans a patch adjacent to the patch. In an embodiment, at least some of living tissues included in the slide image may be lesion tissues, and the method may further include generating a tissue mask in which a living tissue region included in the slide image is masked; generating a lesion mask in which the lesion tissue included in the slide image is masked; and determining whether the living tissue or lesion tissue is included in the plurality of patches, based on the tissue mask and the lesion mask. According to another aspect of the present disclosure, there is provided a method for measuring a length of a lesion tissue included in a slide image, including dividing, by a computing system, the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; generating, by the computing system, a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a lesion tissue among the plurality of patches, and when the lesion tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; for each edge included in the graph, setting a weight of the edge; for each connected component of the graph including two or more nodes, detecting shortest paths between all node pairs included in the connected component and determining a longest shortest path with a longest length among the shortest paths between all node pairs; and calculating the length of the lesion tissue included in the slide image based on the longest shortest path of each connected component included in the graph. According to another aspect of the present disclosure, a recorded computer program installed in a data processing device for performing the method described above is provided. According to another aspect of the present disclosure, a computing system including a processor; and a memory configured to store a computer program, wherein the computer program, when executed by the processor, causes the computing system to perform the method described above is provided. According to another aspect of the present disclosure, there is provided a computing system for performing a method for measuring a length of a living tissue included in a slide image, including a dividing module configured to divide the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; a graph generating module configured to generate a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a living tissue among the plurality of patches, and when the living tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; a weight setting module configured to, for each edge included in the graph, set a weight of the edge; a shortest path determining module configured to, for each connected component of the graph including two or more nodes, detect shortest paths between all node pairs included in the connected component and determine a longest shortest path with a longest length among the shortest paths between all node pairs; and a calculating module configured to calculate the length of the living tissue included in the slide image based on the longest shortest path of each connected component included in the graph. In an embodiment, the weight setting module may calculate the weight W of the edge by the following [Equation 3]. W=A/{E(v1)×E(v2)}  [Equation 3] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, and E(x) is the number of edges connected to node x on the graph) In an embodiment, at least some of living tissues included in the slide image may be lesion tissues, and the weight setting module may calculate the weight W of the edge by the following [Equation 4]. W=A/[{E(v1)×E(v2)}×{C(v1)×C(v2)}]  [Equation 4] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, E(x) is the number of edges connected to node x on the graph, and C(y) is 1 when the patch corresponding to node y on the graph does not contain lesion tissue, and α when it does (where α is a predetermined real number greater than 1)) In an embodiment, the computing system may further include an image processing module configured to binarize the plurality of patches; and a determining module configured to, for each of the plurality of binarized patches, based on whether a pixel representing a living tissue exists at each edge line and each corner of the binarized patch, determine whether a living tissue spans a patch adjacent to the patch. In an embodiment, at least some of living tissues included in the slide image may be lesion tissues, and the computing system may further include an image processing module configured to generate a tissue mask in which a living tissue region included in the slide image is masked, and generate a lesion mask in which the lesion tissue included in the slide image is masked; and a determining module configured to determine whether the living tissue or lesion tissue is included in the plurality of patches, based on the tissue mask and the lesion mask. According to another aspect of the present disclosure, there is provided a computing system for performing a method for measuring a length of a lesion tissue included in a slide image, including a dividing module configured to divide the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; a graph generating module configured to generate a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a lesion tissue among the plurality of patches, and when the lesion tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; a weight setting module configured to, for each edge included in the graph, set a weight of the edge; a shortest path determining module configured to, for each connected component of the graph including two or more nodes, detect shortest paths between all node pairs included in the connected component and determine a longest shortest path with a longest length among the shortest paths between all node pairs; and a calculating module configured to calculate the length of the lesion tissue included in the slide image based on the longest shortest path of each connected component included in the graph. Advantageous Effects According to the technical idea of the present disclosure, it is possible to provide a method for accurately and objectively measuring the length of a living tissue or a lesion tissue included in a slide image. BRIEF DESCRIPTION OF DRAWINGS In order to more fully understand the drawings recited in the detailed description of the disclosure, a brief description of each drawing is provided. FIG. 1 is a flowchart illustrating an example of a living tissue length measurement method according to an embodiment of the present disclosure. FIGS. 2A to 2G are diagrams for explaining a specific process of performing a living tissue length measurement method according to an embodiment of the present disclosure. FIG. 3 is a diagram for explaining a method for generating, by a computing system, an edge of a graph according to an embodiment of the present disclosure. FIG. 4 is a diagram for explaining an example in which a generated graph includes two or more connected components. FIG. 5 is a diagram for explaining embodiments of setting a weight of each edge included in a graph. FIG. 6 is a block diagram illustrating a schematic configuration of a computing system according to an embodiment of the present disclosure. FIGS. 7A to 7E are diagrams illustrating an example of a process in which a computing system measures the length of a living tissue included in a living body slide image according to an embodiment of the present disclosure. BEST MODE FOR CARRYING OUT THE INVENTION Since the present disclosure can apply various transformations and can have various embodiments, specific embodiments are illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present disclosure to specific embodiments, and should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present disclosure. In describing the present disclosure, if it is determined that a detailed description of a related known technology may obscure the gist of the present disclosure, the detailed description thereof will be omitted. Terms such as first, second, etc., may be used to describe various elements, but the elements should not be limited by the terms. The above terms are used only for the purpose of distinguishing one component from another. The terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present disclosure. The singular expression includes the plural expression unless the context clearly dictates otherwise. In the present specification, it should be understood that the terms such as “comprises” or “have” are intended to designate that the features, numbers, steps, operations, components, parts, or combinations thereof described in the specification exist, and this does not preclude the possibility of addition or existence of one or more other features or numbers, steps, operations, components, parts, or combinations thereof. In addition, in the present specification, when any one component ‘transmits’ data to another component, the component may directly transmit the data to the other component, or may transmit the data to the other component through at least one other component. Conversely, when one component ‘directly transmits’ data to another component, it means that the data is transmitted from the component to the other component without passing through the other component. Hereinafter, preferred embodiments of the present disclosure will be described in detail with reference to the accompanying drawings. Like reference numerals in each drawing indicate like elements. A computing system according to an embodiment of the present disclosure may be an information processing device. A computing system 100 may be a processing system such as a desktop computer, a laptop computer, or a server, and may be a processing device including a handheld device such as a mobile phone, a satellite phone, a wireless phone, a session initiation protocol (SIP), a wireless local loop (WLL) station, a smart phone, a tablet PC, and a personal digital assistant (PDA). The computing system may perform a method for measuring the length of a living tissue included in a slide image (hereinafter, referred to as a ‘living tissue length measurement method’). FIG. 1 is a flowchart illustrating an example of a living tissue length measurement method performed by the computing system. The computing system may receive a slide image S100. The slide image may be an image obtained by photographing a living tissue. For example, the slide image may be a pathological slide image obtained by photographing a living tissue to determine the presence or absence of a lesion of a predetermined disease (e.g., cancer). The computing system may divide the slide image into a plurality of patches having a predetermined size S110. Each of the plurality of patches may be any one obtained by dividing the slide image into an N×M grid (where N and M are each an integer of 2 or more). Each of the plurality of patches may be in the form of a square having the same size. FIG. 2A is a diagram illustrating an example of a slide image, and FIG. 2B is a diagram illustrating an example in which the slide image of FIG. 2A is divided into patches. When the computing system 100 receives the slide image 10 as shown in FIG. 2A, the dividing module 110 may form 40 patches (e.g., 21) by dividing them into a grid shape 20 of 5×8 as shown in FIG. 2B. Each of the slide patches (e.g., 21) may have the same size. The computing system may detect a living tissue from the slide image, and according to an embodiment, may detect a lesion tissue, which is a living tissue including a lesion caused by a predetermined disease, from the slide image S120. In the present specification, detecting the living tissue included in the image may mean detecting a region in which the living tissue is photographed in the image or determining a patch including the region in which the living tissue is photographed among a plurality of patches forming the image, and detecting the lesion tissue included in the image may mean detecting a region in which the lesion tissue is photographed in the image or determining a patch in which the lesion tissue is photographed among a plurality of patches forming the image. In an embodiment, the computing system may detect a living tissue included in the slide image through image binarization, which is a computer vision-related technology. In more detail, the computing system may perform pre-processing such as noise filtering and/or median blurring on the slide image, convert it to gray scale, and perform binarization by performing thresholding on the converted image and dividing each pixel based on a predetermined threshold. According to an embodiment, the computing system may perform binarization for each patch obtained by dividing the slide image, and the result of binarizing the patches 20 of FIG. 2B in this way is shown in FIG. 2C. In addition to this, there may be various embodiments in which the computing system detects a living tissue. For example, the computing system may detect the living tissue included in the slide image by using a pre-learned artificial intelligence network to detect the living tissue. Meanwhile, the computing system may detect the lesion tissue from the slide image using the above-described binarization technique or a pre-learned artificial intelligence network. Referring back to FIG. 1 , the computing system may generate a graph (particularly, an undirected graph) corresponding to the slide image S130. More specifically, the computing system may generate nodes of the graph. The computing system may generate nodes corresponding to each patch included in the slide image S131. FIG. 2D is a diagram illustrating nodes 40 corresponding to each of the patches 20 of FIG. 2B. The computing system may also generate edges of the graph. In the computing system, when a living tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches may be connected by an edge. For example, the computing system may scan upper/lower/left/right edge lines of the patch to determine whether a living tissue spans a patch adjacent to the patch. In other words, the computing system may scan each edge line of the patch, and when pixels representing living tissue are formed on at least a part of the corresponding edge line, may determine that adjacent patches that share the corresponding edge and the corresponding patch spans living tissue. FIG. 3 is a diagram for explaining a method for the computing system to generate edges of a graph. FIG. 3A shows each patch of the slide image, FIG. 3B shows the (2, 2)th patch, (2,3)th patch, (3,2)th patch, and (3,3)th patch which are some of the patches of FIG. 3A, and FIG. 3C shows the node corresponding to FIG. 3B and the edge of each node generated by the computing system. In the example of FIG. 3B, in the (2, 2)th patch, since pixels (indicated by thick lines) representing living tissues are formed on the upper, lower, and right edge lines, the computing system may determine that the living tissue spans the (2, 2)th patch and the (1, 2)th patch adjacent to the top, the (2, 2)th patch and the (3, 2)th patch adjacent to the bottom, the (2, 2)th patch and the (2, 3)th patch adjacent to the right, and as shown in FIG. 3C, may connect the node (2:2) and the node (1:2) as an edge, the node (2:2) and the node (3:2) as an edge, and the node (2:2) and the node (2:3) as an edge. In addition, when pixels representing living tissues are formed at each corner of the patch and a diagonally adjacent corner facing it, the computing system may determine that the living tissue spans the two patches. In the example of FIG. 3B, since pixels representing living tissues are formed in the lower right corner of the (2, 2)th patch and the upper left corner of the (3, 3)th patch facing it, as shown in FIG. 3B, the computing system may connect the node (2:2) corresponding to the (2, 2)th patch and the node (3:3) corresponding to the (3, 3)th patch as an edge. In a similar manner, the computing system may determine the edges of the node (2:3), node (3:2), and node (3:3). A graph 50 in which the nodes of FIG. 3D are connected by edges in the same manner as described above is shown in FIG. 2E. Meanwhile, the computing system may generate a graph corresponding to the slide by removing the independent node that is not connected to any other nodes, and the graph 60 from which the independent node is removed from the graph of FIG. 2E is shown in FIG. 2F. Meanwhile, depending on the slide image, the graph generated by the computing system may include two or more connected components. If the slide image is composed of patches as shown in FIG. 4A, the computing system may generate a graph including two connected components as shown in FIG. 4C by removing an independent node from the graph as shown in FIG. 4B. Referring back to FIG. 1 , the computing system may set a weight for each edge included in the graph S140, which will be described with reference to FIG. 5 . In the example of FIG. 5 , it is assumed that the arrangement of each node is the same as that of the corresponding patch. In an embodiment, the computing system may set the weight to 1 in the case of an edge connecting nodes corresponding to adjacent patches in the vertical, horizontal directions, and in the case of an edge connecting nodes corresponding to diagonally adjacent patches, may set the weight to √{square root over (2)}, an example of which is shown in FIG. 5A. As shown in FIG. 5A, edges (V1, V2), (V1, V3), (V3, V4) have a weight of 1 since the edges connect nodes corresponding to the vertically or horizontally adjacent patches, and since the edge <V1, V4> connects the nodes corresponding to the adjacent patches in the diagonal direction, the weight is set to In another embodiment, the computing system may set the weight by further considering the number of neighboring nodes of each of the two nodes connected by the edge (here, the neighboring node is a node connected to the corresponding node through the edge, and the number of the neighboring node is equal to the number of edges the corresponding node has). This is to allow the longest shortest path to be described later to pass through the middle of the living tissue as much as possible. In a weight setting method in consideration of the number of neighboring nodes, the weight W of the edge may be determined by the following [Equation 1], an example of which is shown in FIG. 5B. W=A/{E(v1)×E(v2)}  [Equation 1] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, and E(x) is the number of edges connected to node x (i.e., number of the neighboring node of node v)) As shown in FIG. 5B, assuming that node V1 has 4 neighboring nodes (i.e., 4 edges), node V2 has 1 neighboring node, node V3 has 3 neighboring nodes and node V4 has 2 neighboring nodes, each edge of FIG. 5B may have the following weight. Weight of (V1,V2)=1/{E(V1)×E(V2)}=1/(4×1)=¼ Weight of (V1,V3)=1/{E(V1)×E(V3)}=1/(4×3)= 1/12 Weight of (V1,V4)=√{square root over (2)}/{E(V1)×E(V4)}=√{square root over (2)}/(4×2)=√{square root over (2)}/8 Weight of (V3,V4)=1/{E(V3)×E(V4)}=1/(3×2)=⅙ Meanwhile, when at least a part of the living tissue included in the slide image is lesion tissue, the computing system may set a weight by further considering whether a patch corresponding to two nodes connected by an edge includes lesion tissue. This is because, when the living tissue includes a lesion tissue, the length of the living tissue including the lesion tissue must be measured. In a weight setting method considering whether or not a patch includes a lesion tissue, the weight W of the edge may be determined by the following [Equation 2], an example of which is shown in FIG. 5C. W=A/{C(v1)*C(v2)}  [Equation 2] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, and C(y) is 1 when the patch corresponding to any node v on the graph does not contain lesion tissue, and α when it does (where α is a predetermined real number greater than 1, and α is assumed to be 2 below)) As shown in FIG. 5C, when lesion tissues are included in nodes V1 and V4, each edge of FIG. 5C may have the following weight. Weight of (V1,V2)=1/{C(V1)×C(V2)}=1/(2×1)=½ Weight of (V1,V3)=1/{C(V1)×C(V3)}=1/(1×2)=½ Weight of (V1,V4)=√{square root over (2)}/{C(V1)×C(V4)}=√{square root over (2)}/(2×2)=√{square root over (2)}/4 Weight of (V3,V4)=1/{C(V3)×C(V4)}=1/(1×2)=½ Meanwhile, in another embodiment, the computing system may set the weight in consideration of both the number of neighboring nodes and whether the patch includes lesion tissue. In this case, the computing system may determine the weight W of the edge by the following [Equation 4], an example of which is shown in FIG. 5D. W=A/{E(v1)×E(v2)}/{C(v1)×C(v2)}  [Equation 4] Nodes V1 and V4 include lesion tissue, and if the number of neighboring nodes of each node is the same as in FIG. 5D, each edge of FIG. 5D may have the following weight. Weight of (V1,V2)=1/{E(V1)×E(V2)}/{C(V1)×C(V2)}=1/(4×1)/(2×1)=⅛ Weight of (V1,V3)=1/{E(V1)×E(V3)}/{C(V1)×C(V3)}=1/(4×3)/(1×2)= 1/24 Weight of (V1,V4)=√{square root over (2)}/{E(V1)×E(V2)}/{C(V1)×C(V4)}=√{square root over (2)}/(4×2)/(2×2)=√{square root over (2)}/32 Weight of (V3,V4)=1/{E(V1)×E(V2)}/{C(V3)×C(V4)}=1/(3×2)/(1×2)= 1/12 Referring back to FIG. 1 , the computing system may, for each connected component of the graph including two or more nodes, detect a shortest path between all node pairs included in the connected component and determine a longest shortest path with a longest length among the shortest paths between all node pairs. In an embodiment, the computing system may determine the longest shortest path using a Floyd-Warshall algorithm. In other words, the computing system may calculate the shortest path between each pair of nodes included in the connected component, and determine the longest shortest path that is the shortest path having the longest distance among them. FIG. 2G is a diagram illustrating the longest shortest path of the graph shown in FIG. 2F. Referring back to FIG. 1 , the computing system may calculate the length of the living tissue included in the slide image based on the longest shortest path of each of the connected components included in the graph. In an embodiment, the computing system may recalculate the length of each longest shortest path by setting the lengths of all edges on the longest shortest path of each connected component to 1 or √{square root over (2)}, depending on the arrangement of patches corresponding to two nodes connected by the corresponding edges, and then multiply the recalculated length by the actual distance between the vertically or horizontally adjacent patches to calculate the actual length of the living tissue. In an embodiment, the computing system may sum all the distances of the longest shortest paths of each connected component, calculate the total length of the living tissue based on the summed value, and output it to the outside of the computing system. In another embodiment, the computing system may calculate the length of each piece included in the living tissue included in the slide image based on the distances of the longest shortest paths of all the connected components, and output it to the outside of the computing system. FIG. 6 is a block diagram illustrating a schematic configuration of the computing system 100 according to an embodiment of the present disclosure. Referring to FIG. 6 , the computing system 100 may include a dividing module 110, a graph generating module 120, a weight setting module 130, a shortest path determining module 140, and a calculating module 150. In addition, the computing system 100 may further include an image processing module 160, a determining module 170, and/or a diagnosis module 180. According to an embodiment, the computing system 100 may include only some of the components illustrated in FIG. 6 , or may include more components than this. For example, the computing system 100 may further include at least one communication module capable of communicating with an external system through a network or a control module capable of controlling functions and/or resources of other components included in the computing system 100, a storage module capable of storing various information, an input/output module capable of interfacing with the user and receiving information from the outside or outputting information to the outside, and the like. The computing system 100 may include hardware resources and/or software necessary to implement the technical idea of the present disclosure, and does not necessarily mean one physical component or one device. In other words, the computing system 100 may mean a logical combination of hardware and/or software provided to implement the technical idea of the present disclosure, and if necessary, may be implemented as a set of logical configurations for implementing the technical idea of the present disclosure by being installed in devices spaced apart from each other and performing respective functions. In addition, the computing system 100 may refer to a set of components separately implemented for each function or role for implementing the technical idea of the present disclosure. In this specification, a module may refer to a functional and structural combination of hardware for carrying out the technical idea of the present disclosure and software for driving the hardware. For example, it can be easily deduced to an average expert in the art of the present disclosure that the module may refer to a logical unit of a predetermined code and a hardware resource for executing the predetermined code, and does not necessarily mean a physically connected code or one type of hardware. The dividing module 110 may divide the slide image into a plurality of patches having a predetermined size. Here, each of the plurality of patches may be any one obtained by dividing the slide image into an N×M grid (N and M are each an integer of 2 or more), and may have a square shape of the same size. At least a part of the living tissue included in the slide image may be a lesion tissue, and the diagnosis module 180 may determine whether a lesion due to a predetermined disease exists in the slide image or each of the plurality of patches. Alternatively, the diagnosis module 180 may detect a lesion tissue in the slide image or each of the plurality of patches. In an embodiment, the image processing module 160 may binarize the plurality of patches, and the determining module 170 may, for each of the plurality of binarized patches, determine whether a living tissue spans a patch adjacent to the patch, based on whether a pixel representing a living tissue exists at each edge line and each corner of the binarized patch. In another embodiment, the image processing module 160 may generate a tissue mask in which the living tissue region included in the slide image is masked, and generate a lesion mask in which the lesion tissue included in the slide image is masked, and the determining module may determine whether the living tissue or lesion tissue is included in the plurality of patches, based on the tissue mask and the lesion mask. Meanwhile, the graph generating module 120 may generate a graph corresponding to the slide image. The graph generated by the graph generating module 120 may include nodes corresponding to each patch including a living tissue among the plurality of patches, and when a living tissue spans any two patches adjacent to each other in the vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches may be connected by an edge. The weight setting module 130 may set a weight of each edge included in the graph. In an embodiment, the weight setting module 130 may calculate the weight W of the edge by the following [Equation 5]. W=A/{E(v1)×E(v2)}  [Equation 5] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, and E(x) is the number of edges connected to node x on the graph) In another embodiment, the weight setting module may calculate the weight W of the edge by the following [Equation 6]. W=A/[{E(v1)×E(v2)}×{C(v1)×C(v2)}]  [Equation 6] (where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, E(x) is the number of edges connected to node x on the graph, and C(y) is 1 when the patch corresponding to node y on the graph does not include lesion tissue, and α when it does (where α is a predetermined real number greater than 1)) Meanwhile, the shortest path determining module 140 may, for each connected component of the graph including two or more nodes, detect shortest paths between all node pairs included in the connected component and determine a longest shortest path with a longest length among the shortest paths between all node pairs, and the calculating module 150 may calculate the length of the living tissue included in the slide image based on the longest shortest path of each of the connected components included in the graph. FIG. 7 is a diagram illustrating an example of a process in which the computing system measures the length of a living tissue included in a living body slide image. When a slide image as shown in FIG. 7A is input, as shown in FIG. 7B, the computing system 100 may generate a tissue mask in which the living tissue region included in the slide image is masked, and as shown in FIG. 7C, may generate a lesion mask in which the lesion tissue included in the slide image is masked. The computing system 100 may divide the slide image into a plurality of patches and generate a graph corresponding to the slide image as shown in FIG. 7D. Thereafter, the computing system may determine the longest shortest path of each connected component in the graph of FIG. 7D. In FIG. 7E, the longest shortest path of each connected component is displayed overlapped on the slide image. Meanwhile, the above-described method for measuring the length of a living tissue may be applied as a method for measuring the length of a lesion tissue very easily. In other words, in order to perform the method for measuring the length of a lesion tissue according to an embodiment of the present disclosure, the computing system may divide the slide image into a plurality of patches having a predetermined size (where each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, and N and M are each an integer of 2 or more). The computing system may generate a graph corresponding to the slide image. Here, the graph may include a node corresponding to each of the patches including the lesion tissue among the plurality of patches, and when the lesion tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches may be connected by an edge. In addition, the computing system may set a weight of each edge included in the graph. Here, the computing system may set the weight of the corresponding edge in consideration of the number of neighboring nodes of the two nodes connected by the edge, which has been described above. The computing system may, for each connected component of the graph including two or more nodes, detect shortest paths between all node pairs included in the connected component and determine a longest shortest path with a longest length among the shortest paths between all node pairs. The computing system may calculate the length of the lesion tissue included in the slide image based on the longest shortest path of each of the connected components included in the graph. Meanwhile, according to an embodiment, the computing system 100 may include at least one processor and a memory for storing a program executed by the processor. The processor may include a single-core CPU or a multi-core CPU. The memory may include high-speed random access memory and may include non-volatile memory such as one or more magnetic disk storage devices, flash memory devices, or other non-volatile solid-state memory devices. Access to memory by the processor and other components may be controlled by a memory controller. Meanwhile, the method for measuring the length of a living tissue/lesion tissue according to an embodiment of the present disclosure may be implemented in the form of a computer readable program instruction and stored in a computer readable recording medium. The computer readable recording medium includes all types of recording devices in which data readable by a computer system is stored. The program instructions recorded on the recording medium may be specially designed and configured for the present disclosure, or may be known and available to those skilled in the software field. Examples of the computer readable recording medium include magnetic media such as hard disks, floppy disks and magnetic tapes, optical media such as CD-ROMs and DVDs, magneto-optical media such as floptical disks and hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. In addition, the computer readable recording medium is distributed in a computer system connected through a network, so that the computer readable code may be stored and executed in a distributed manner. Examples of the program instruction include not only machine code such as generated by a compiler, but also a device for electronically processing information using an interpreter or the like, for example, a high-level language code that may be executed by a computer. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the present disclosure, and vice versa. The above description of the present disclosure is for illustration, and those skilled in the art to which the present disclosure pertains will understand that it may be easily modified into other specific forms without changing the technical spirit or essential characteristics of the present disclosure. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and likewise components described as distributed may be implemented in a combined form. The scope of the present disclosure is indicated by the following claims rather than the above detailed description, and all changes or modifications derived from the meaning and scope of the claims and their equivalents should be construed as being included in the scope of the present disclosure. INDUSTRIAL APPLICABILITY Method for measuring the length of a living tissue included in a slide image and a computing system for performing the same 1. A method for measuring a length of a living tissue included in a slide image, comprising: dividing, by a computing system, the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; generating, by the computing system, a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a living tissue among the plurality of patches, and when the living tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; for each edge included in the graph, setting a weight of the edge; for each connected component of the graph including two or more nodes, detecting shortest paths between all node pairs included in the connected component and determining a longest shortest path with a longest length among the shortest paths between all node pairs; and calculating the length of the living tissue included in the slide image based on the longest shortest path of each connected component included in the graph. 2. The method according to claim 1, wherein the setting the weight of the edge comprises: calculating the weight W of the edge by the following [Equation 1]: W=A/{E(v1)×E(v2)}  [Equation 1] where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, and E(x) is the number of edges connected to node x on the graph. 3. The method according to claim 1, wherein at least some of living tissues included in the slide image are lesion tissues, and the setting of the weight of the edge comprises: calculating the weight W of the edge by the following [Equation 2]: W=A/[{E(v1)×E(v2)}×{C(v1)×C(v2)}]  [Equation 2] where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, E(x) is the number of edges connected to node x on the graph, and C(y) is 1 when the patch corresponding to node y on the graph does not contain lesion tissue, and α when it does (where α is a predetermined real number greater than 1). 4. The method according to claim 1, further comprising: binarizing the plurality of patches; and for each of the plurality of binarized patches, based on whether a pixel representing a living tissue exists at each edge line and each corner of the binarized patch, determining whether a living tissue spans a patch adjacent to the patch. 5. The method according to claim 1, wherein at least some of living tissues included in the slide image are lesion tissues, and the method further comprises: generating a tissue mask in which a living tissue region included in the slide image is masked; generating a lesion mask in which the lesion tissue included in the slide image is masked; and determining whether the living tissue or lesion tissue is included in the plurality of patches, based on the tissue mask and the lesion mask. 6. A method for measuring a length of a lesion tissue included in a slide image, comprising: dividing, by a computing system, the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; generating, by the computing system, a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a lesion tissue among the plurality of patches, and when the lesion tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; for each edge included in the graph, setting a weight of the edge; for each connected component of the graph including two or more nodes, detecting shortest paths between all node pairs included in the connected component and determining a longest shortest path with a longest length among the shortest paths between all node pairs; and calculating the length of the lesion tissue included in the slide image based on the longest shortest path of each connected component included in the graph. 7. A recorded computer program installed in a data processing device for performing the method according to claim 1. 8. A computing system comprising: a processor; and a memory configured to store a computer program, wherein the computer program, when executed by the processor, causes the computing system to perform the method according to claim 1. 9. A computing system for performing a method for measuring a length of a living tissue included in a slide image, comprising: a dividing module configured to divide the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; a graph generating module configured to generate a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a living tissue among the plurality of patches, and when the living tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; a weight setting module configured to, for each edge included in the graph, set a weight of the edge; a shortest path determining module configured to, for each connected component of the graph including two or more nodes, detect shortest paths between all node pairs included in the connected component and determine a longest shortest path with a longest length among the shortest paths between all node pairs; and a calculating module configured to calculate the length of the living tissue included in the slide image based on the longest shortest path of each connected component included in the graph. 10. The computing system according to claim 9, wherein the weight setting module calculates the weight W of the edge by the following [Equation 3]: W=A/{E(v1)×E(v2)}  [Equation 3] where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, and E(x) is the number of edges connected to node x on the graph. 11. The computing system according to claim 9, wherein at least some of living tissues included in the slide image are lesion tissues, and the weight setting module calculates the weight W of the edge by the following [Equation 4]: W=A/[{E(v1)×E(v2)}×{C(v1)×C(v2)}]  [Equation 4] where v1 and v2 are two nodes connected by the edge, A is 1 when the patches corresponding to nodes v1 and v2, respectively, are vertically or horizontally adjacent, and √{square root over (2)} when diagonally adjacent, E(x) is the number of edges connected to node x on the graph, and C(y) is 1 when the patch corresponding to node y on the graph does not contain lesion tissue, and α when it does (where α is a predetermined real number greater than 1). 12. The computing system according to claim 9, further comprising: an image processing module configured to binarize the plurality of patches; and a determining module configured to, for each of the plurality of binarized patches, based on whether a pixel representing a living tissue exists at each edge line and each corner of the binarized patch, determine whether a living tissue spans a patch adjacent to the patch. 13. The computing system according to claim 9, wherein at least some of living tissues included in the slide image are lesion tissues, and the computing system further comprises: an image processing module configured to generate a tissue mask in which a living tissue region included in the slide image is masked, and generate a lesion mask in which the lesion tissue included in the slide image is masked; and a determining module configured to determine whether the living tissue or lesion tissue is included in the plurality of patches, based on the tissue mask and the lesion mask. 14. A computing system for performing a method for measuring a length of a lesion tissue included in a slide image, comprising: a dividing module configured to divide the slide image into a plurality of patches having a predetermined size, wherein each of the plurality of patches is any one obtained by dividing the slide image into an N×M grid, where N and M are each an integer of 2 or more; a graph generating module configured to generate a graph corresponding to the slide image, wherein the graph includes nodes corresponding to each patch including a lesion tissue among the plurality of patches, and when the lesion tissue spans any two patches adjacent to each other in a vertical, horizontal, or diagonal direction, two nodes corresponding to the two adjacent patches are connected by an edge; a weight setting module configured to, for each edge included in the graph, set a weight of the edge; a shortest path determining module configured to, for each connected component of the graph including two or more nodes, detect shortest paths between all node pairs included in the connected component and determine a longest shortest path with a longest length among the shortest paths between all detected node pairs; and a calculating module configured to calculate the length of the lesion tissue included in the slide image based on the longest shortest path of each connected component included in the graph.

2021-06-16

en

2023-09-28

US-201916363911-A

Systems and methods for particle pattern simulation ABSTRACT A method is provided comprising, receiving, by a computer system comprising a processor and a tangible, non-transitory memory, particle parameters, creating, by the computer system, particle elements in accordance with the particle parameters, and building, by the computer system, a pattern using the particle elements. CROSS REFERENCE TO RELATED APPLICATIONS This application a continuation of U.S. patent application Ser. No. 13/717,251, filed Dec. 17, 2012 and entitled “SYSTEMS AND METHODS FOR PARTICLE PATTERN SIMULATION”, which claims priority to U.S. Provisional Application No. 61/578,055, filed Dec. 20, 2011 and entitled “SYSTEMS AND METHODS FOR PARTICLE PATTERN SIMULATION”, the contents of each of which are incorporated by reference in their entirety. FIELD This disclosure generally relates to modeling particle patterns in seamless surface coverings. BACKGROUND Seamless surface coverings (sometimes referred to as chemical surface covering materials) may be used for wall or floor covering and provide a clean, seamless solution for wall and floor covering found in residential, commercial and industrial areas. Currently, both commercially and residentially, there are many different types of chemical surface covering materials that yield a seamless surface on a substrate that is both durable and decorative. Chemical surface covering materials may be used on a variety of substrates, such as concrete, wood, and the like. These chemical surface covering materials typically consist of a clear (or pigmented) hardening material and a plurality of particles. Most commonly, the hardening material, such as polyester, urethane, polyurethane, polymethylmethacrylate, methylmethacrylate (MMA), polyaspartic, polyurea, or epoxy compounds, is applied in viscous form to a substrate. Then, a group of particles is broadcast or distributed on top of the hardening material, and the coating is allowed to cure. Alternatively, or in combination with the above, particles may be mixed with the hardening material to create a composite slurry that is then distributed over a substrate to provide a durable and decorative coating. A top coat may then optionally be applied. Once cured, the resultant surface covering is nearly or completely seamless. Examples of floor covering materials that incorporate some combination of hardening materials and particles include, but are not limited to, quartz floors, decorative chip floors, decorative flake floors, mica floors, and terrazzo floors. The particles used may vary in size (e.g., length, width, and depth), geometry, color, and relative proportion to one another. Examples of particles used in seamless surface covering applications include, but are not limited to, color chips, color flakes, color quartz, mica, glass, stones, and rocks (generally referenced as aggregate or decorative media). As it is difficult to predict what pattern a plurality of particles will assume prior to application to a substrate, it may be difficult for a consumer to visualize or imagine what a finished surface covering might look like for a given plurality of particles. One may produce “swatches” or samples of a particle pattern, though this approach only captures a small portion of the near infinite possible configurations, limiting the ability to accurately simulate a particle pattern Thus, there is a need to model particle patterns without having to perform an installation of a seamless surface covering. SUMMARY In accordance with various aspects of the present invention, systems and methods are disclosed for creating a modeling or simulating pattern using given particle elements for use of such pattern in seamless surface coverings. In various embodiments, a method is provided comprising, receiving, by a computer system comprising a processor and a tangible, non-transitory memory, particle parameters, creating, by the computer system, particle elements in accordance with the particle parameters, and building, by the computer system, a pattern using the particle elements. In various embodiments, a system for particle pattern simulation is provided, the system comprising a non-transitory memory communicating with a processor, the non-transitory memory having instructions stored thereon that, in response to execution by the processor, cause the processor to perform operations comprising receiving, by the processor, particle parameters, creating, by the processor, particle elements in accordance with the particle parameters, building, by the processor, a pattern using the particle elements. In various embodiments, a computer readable medium bearing instructions for particle pattern simulation is provided, the instructions, when executed by a processor, cause said processor to perform operations comprising receiving, at a processor, particle parameters, creating, by the processor, particle elements in accordance with the particle parameters, building, by the processor, a pattern using the particle elements. In various embodiments, a system for particle pattern simulation is provided, the system comprising, a color sensor in communication with a processor, a non-transitory memory communicating with the processor, the non-transitory memory having instructions stored thereon that, in response to execution by the processor, cause the processor to perform operations comprising receiving, by the processor, an input color from the color sensor, receiving, by the processor, particle parameters, wherein the particle parameters comprises the input color, creating, by the processor, particle elements in accordance with the, particle parameters, building, by the processor, a pattern using the particle elements. BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES The accompanying drawings, which are incorporated herein and form a part of the specification, illustrate the present disclosure and, together with the description, further serve to explain the principles of the disclosure and to enable a person skilled in the pertinent art to make and use the disclosed embodiments. FIG. 1 illustrates exemplary particles in accordance with various embodiments; FIG. 2 illustrates an exemplary pattern in accordance with various embodiments; FIG. 3 illustrates an exemplary method in accordance with various embodiments; FIGS. 4A-4D illustrate an exemplary application flow in accordance with various embodiments; FIGS. 5 illustrated an exemplary particle pattern in a larger viewing format; FIG. 6 illustrates an exemplary user interface in accordance with various embodiments; FIG. 7 illustrates an exemplary particle pattern displayed in a virtual room in accordance with various embodiments; FIG. 8 illustrates an exemplary particle pattern displayed in a virtual grocery retail space in accordance with various embodiments; FIG. 9 illustrates an exemplary email containing a sample particle pattern in accordance with various embodiments; FIG. 10 illustrates an exemplary method in accordance with various embodiments; and FIG. 11 illustrates an exemplary method in accordance with various embodiments. DETAILED DESCRIPTION The detailed description of exemplary embodiments herein makes reference to the accompanying drawings and pictures, which show the exemplary embodiment by way of illustration. While these exemplary embodiments are described in sufficient detail to enable those skilled in the art to practice the disclosure, it should be understood that other embodiments may be realized and that logical and mechanical changes may be made without departing from the spirit and scope of the disclosure. Thus, the detailed description herein is presented for purposes of illustration only and not of limitation. For example, the steps recited in any of the method or process descriptions may be executed in any order and are not limited to the order presented. Moreover, any of the functions or steps may be outsourced to or performed by one or more third parties. Furthermore, any reference to singular includes plural embodiments, and any reference to more than one component may include a singular embodiment. Systems, methods and computer program products are provided. In the detailed description herein, references to “various embodiments”, “one embodiment”, “an embodiment”, “an example embodiment”, etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to effect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described. After reading the description, it will be apparent to one skilled in the relevant art(s) how to implement the disclosure in alternative embodiments. As described above, seamless covering materials often comprise a hardening material and a plurality of particles. Most commonly, the hardening material, such as polyester, urethane, or epoxy compounds, is applied in viscous form to a substrate. Then, a plurality of particles is broadcast or distributed on top of the hardening material, and the coating is allowed to cure. With reference to FIG. 1, exemplary particles are illustrated in accordance with various embodiments. The particles may also be referred to as “chips”, “flakes” or “fleck.” Particles may comprise varying geometries. While particles may comprise regular geometric shapes such as circles, rectangles, squares, and trapezoids, in various embodiments, particles are of an irregular geometry. Particles are typically thin, having a depth of from about 1 mil to 10 mils and more commonly between 4.5 mils to 5.5 mils. While particle length and width may vary, among particles with irregular geometries, in various embodiments, particles may be of about 2 inches or less in either length or width. For example, particles may range from about 0.015625 inches in length or width to about 1 inch in length or width. Particles may be of any color or colors and may comprise a graphic pattern, such as a two-tone or striped configuration. In various embodiments, particles may exhibit optical effects that include, but are not limited to, translucent, metallic, reflective, highlight, shadowing, fluorescent, and/or phosphorescent effects. A plurality of particles may comprise any combination of particles such that each particle may have a different size, color, and/or geometry. Particle parameters may describe one or more properties of a plurality of particles, such as particle size, color, geometry, and the proportion of the number of particles for a given particle size, color, and/or geometry in relation to the total number of particles. A collection of particles may form a particle pattern. A particle pattern includes the particular configuration of a plurality of particles. An exemplary particle pattern is illustrated in FIG. 2. Because the possible particle parameters are infinite, and because particle distribution on a substrate (e.g., a wall or a floor) is performed randomly upon installation, it may be difficult for one to approximate how a given plurality of particles will appear when applied to a substrate. Stated another way, a pattern of particles is difficult to approximate without performing an installation on a substrate. In accordance with various embodiments, a method is disclosed that provides pattern simulation in accordance with given particle parameters. In such a manner, accurate pattern simulation is available in real time. Such a method is particularly advantageous when performed on a portable computing device such as a smartphone, tablet computer, or laptop computer. For example, a salesperson could easily input pattern parameters into a table computer at a potential customer's location to simulate how a finished floor or wall covering would appear. The customer may then adjust the particle parameters to achieve a desirable pattern. Once the particle parameters are known, the particle parameters may then be used to generate a purchase order or otherwise transmitted to an external system to facilitate ordering, to check availability, and/or to schedule installation. In many circumstances, a customer may desire to install a seamless covering in a room (e.g., a garage, warehouse, retail store, workshop, studio, home, etc.) or other place that is already in existence. The room may include various color schemes embodied in, for example, walls, flooring, furniture, equipment, or other colors that appear in the room. Color schemes may be embodied in wall paint color, curtain color selection, furniture upholstery selection, and the like. In other circumstances, a customer may have access to one or more items that will be installed into a room, such as a new paint color. In that regard, in accordance with various embodiments, a color sensor is provided to sense the color of a tangible object. The sensed color, or a color selected based upon the sensed color, may be used as a particle parameter. Stated another way, the color sensor may import one or more “real world” colors, or colors selected from a predetermined color palette based upon one or more “real world” colors, into a particle simulation. This allows for more accurate and precise color selection than has been available in the past. With reference to FIG. 3, exemplary method 300 is illustrated. Step 302 comprises receiving particle parameters. Step 302 may include receiving one more particle parameters that describe a plurality of particles. For example, particle parameters may comprise particle proportion data, particle size, and particle color, such as the following data: 10% red 0.25 inch, 20% green 1 inch, and 70% white 0.125 inches. In such a scenario, for every 100 particles, 10 will be red and have at least one dimension measuring approximately 0.25 inches, 20 will be green and have at least one dimension measuring approximately 1 inch, and 70 will be white and have at least one dimension measuring approximately 0.125 inches. Particle parameters may also describe how many total particles there will be in a given simulation. For example, to simulate a floor covering, the particle parameters may specify that there will be 10,000 total particles. In various embodiments, the total particle number is not provided in the particle parameters. In such case, a default value for number of particles may used, which may be scalable depending on the size of the simulation. Step 302 may receive particle parameters from a user interface. The user interface may comprise graphical or numeric input options for a user to select the particle parameters. Graphs, buttons, and slidable indicators may be used in this regard. The user interface may allow a user to choose any combination of particle size, proportional distribution, and/or color. In various embodiments, step 302 comprises receiving an input text stream, such as an email, xml formatted data, or html formatted data, and parsing the input stream to obtain particle parameters. Step 302 may further comprise creation of particle parameters at random. Step 304 comprises creating particle elements. A particle element is a representation of a particle that may be displayed graphically, such as on an electronic display or on paper. A particle element may have attributes that describe a particle, such as size, color, and/or geometry. A particle element may comprise a data structure that includes one or more data points related to a particle and/or a graphical representation of the same. For example, a data structure may be a run time object or a row in one or more databases. In various embodiments, step 304 comprises creating particle elements for all or substantially all particles in the plurality of particles. In embodiments where all or substantially all particles in the plurality of particles have particle elements, there is a more accurate approximation of tangible particles. Step 304 comprises building the particle pattern. The particle pattern may be built by arranging each particle element into a pattern. Such arrangement may occur randomly in that each particle element is assigned a space on a simulated substrate at random. The random approach accurately simulates the actual distribution of particles on a substrate. Particle elements may align so that there is no overlap in the pattern, though in various embodiments particle elements may overlap so that, when viewed, one or more particle elements may obscure another particle element. Thus, step 304 simulates the actions of mixing particles and distributing them upon a substrate. As seamless coverings are typically installed in such a random manner, the pattern of step 304 approximates the randomness of an actual seamless covering. The pattern of step 304 may be rebuilt periodically to provide alternate randomization. The particle pattern may be situated in a graphical representation of an environment, such as a garage, warehouse, retail location, or other space. Other structures may be on or next to the particle pattern, such as windows and doors. In various embodiments, the particle pattern and/or the particle parameters may be incorporated into a purchase order. For example, all or a portion of the particle parameters may be inserted into an email, xml document, or other structured or unstructured data format to form a purchase order. The purchase order may then be transmitted (e.g., emailed) to a third party. For example, a salesperson and a potential customer may change the particle parameters to meet the customer's specifications. The particle parameters may then be transmitted to a warehouse to check availability of the desired particles and/or the availability of an installation timeframe. In addition, the particle parameters may be emailed to another for further simulation. With reference to FIGS. 4A-4D, an exemplary application flow is illustrated. In various embodiments, an iOS application may execute on an IPAD or IPAD MINI tablet computer, as shown in step 402 and labeled Launch App. A logo or other mark may appear, as shown in step 404 and labeled Chips Animation. A blend design palette may be displayed, as shown in step 406 and labeled Blend Design Pallet. Particle parameters may then be set using a user interface, as shown in step 408 and labeled Select Chip Size. In step 408, various sizes of particles are selected, along with particle colors and the number of different types of particles. In that regard, each particle size and color pairing may be considered a particle type. An exemplary user interface is shown in step 408 that allows for selection of particle size using a slide rule style selection widget. In step 410, particle color may be selected from a color palette. The color palette, either in its entirety or a portion thereof, may be displayed in a user interface to facilitate color selection. The color palette may comprise any suitable color palette, for example, an arbitrary color palette, a paint brand color palette (e.g., SHERWIN WILLIAMS brand paint palette), a PANTONE color palette, an RGB color space, an sRGB color space, an ADOBE RGB color space, and any other color palette now known of hereinafter developed. Step 412 shows the user interface of step 408, after a color has been selected. The user interface shown in step 412 may be referred to as the Composition Tool. Particle sizes may be adjusted and simulated. For example, step 414 shows chip sizes of ¼″. Step 416 shows chip sizes of ⅛″. Step 418 shows chip sizes of 1/16″. The blend (i.e., collection of particle elements) may be applied to virtual environments, such as a virtual grocery space, virtual hospital as shown in step 420, virtual garage as shown in step 422 and virtual office as shown in step 424. The various features of a room may be input into a user interface, such as that shown in step 426. For example, wall color, the number and size of windows, or other features may be input for rendering. In addition, room features may be imported from a separate data file and, in various embodiments, photographs may be used to identify objects and render virtual representations of those objects. In various embodiments, three dimensional spaces may be navigated as shown in step 428. However, in various embodiments, a two dimensional static image may also be used to model a given space such as that shown in step 428. The blend (i.e., collection of particle elements) may be saved in a tangible, non-transitory memory, such as labeled as step 430. Blends that have been previously saved may be loaded as labeled as step 434 and/or ordered as labeled as step 436. A saved blend may be emailed, as labeled as step 438. The email in step 438 may describe the blend in any suitable format, such as plain text, xml, html, or other suitable format. A sample representation of the blend (i.e., collection of particle elements), shown labeled as step 440, may be included in the email. Further, a video may be created to showcase various saves blends. For example, as shown as labeled step 442 that comprises three blend sample, 444, 446 and 448. With reference to FIG. 5, a sample blend is shown on a tablet computer. FIG. 6 illustrates an exemplary user interface such as that also shown in step 408. Sliding bars are used to control particle size. Particle color may also be selected. The proportion of each particle type may also be input. If one desires to set a proportion of one or more particle size/color combinations and then “fill” the rest of the blend with another particle type, on may be accomplish this using the user interface. For example, one may fix two particle types at 20% and 30%, and then one or more other particle types will be automatically filled to reach a full 100%. FIGS. 7 and 8 illustrate, in a larger format, virtual spaces that may be rendered as static images or as navigable, 3D spaces. FIG. 8 illustrates, in a larger format, a portion of an exemplary email that contains a description of a particular particle blend. The blend is described using color codes, particle size, and proportion of each type of particle. In various embodiments, and with reference to method 1000 of FIG. 10, one or more colors may be input into method 300. In that regard, one or more colors may be received and used in the creation of a particle blend. In step 1004, color input is sent to create particle elements 304. The color input may be represented in any format, and may represent a color of, for example, a color palette. The color input may be included with other particle element parameters, such as particle size and the proportion of one particle type to another. With reference to FIG. 11, method 1050 is shown. Method 1050 enables a real world color to be imported into a virtual representation of a particle blend. In various embodiments, the real world color may be matched to a predetermined color palette, allowing for a tangible recreation in a particle blend. In this manner, a real world color may be approximated, if needed, to fit the color palette so that particles fabrication may be completed. In step 1052, a color is sensed. The color may exist in the real world as reflecting or radiating from any object. For example, a painted wall, a piece of polished stone (e.g., granite), a tile, a carpet, fiberglass, or other object may reflect a given color. The reflected color may be sensed by a color sensor. The color sensor, as described above, may capture the sensed color and represent the sensed color as a digital or analog representation. In various embodiments, a color sensor may be used to sense a color of a “real world” object. The color sensor may comprise any device that may sense a color. The color sensor may sense color using a variety of methods. For example, a color sensor may passively accept light and determine the color of the light. A color sensor may also emit a known wavelength of light, receive a reflection of that light, and determine color in that manner. Though any color sensor is contemplated herein, a color sensor may receive light and convert the light into a frequency. The output frequency may be output in any suitable manner, for example, a square wave. The output frequency may be representative of the color of the light received by the color sensor. An exemplary color ensor that may be used in various embodiments is the TCS3200 (Texas Advanced Optoelectronic Solutions, Inc., 1001 Klein Road, Suite 300, Plano, Tex. 75074). The output of the color sensor may comprise any data that corresponds to a particular color. For example, the output of the color sensor may comprise a frequency. The output of the color sensor may also comprise a digital representation of color. The digital representation may encode a frequency or wavelength of the color represented. The output of the color sensor may also comprise a red green blue (“RGB”) value The color sensor may be embedded in any device or may be a stand-alone device. For example, the color sensor may be included in a smartphone, tablet device (e.g., IPAD or IPAD MINI), phablet computer, laptop computer, desktop computer, or similar devices. In various embodiments, the color sensor is not embedded in a smartphone or tablet device. In various embodiments, the color sensor is in communication, such as electrical communication or logical communication, with a processor. Logical communication may involve the communication of output data from the color sensor to the processor via various communications protocols over physical or wireless connections. For example, a logical communication may include a BLUETOOTH connection, near field communication (“NFC”), a wireless Ethernet (e.g., 802.11a/b/g/n), a wired Ethernet connection, a Universal Serial Bus (“USB”) connection, or any similar connection. One or more devices or components may receive the output of the color sensor and package or otherwise manipulate the output in preparation for transmission via the aforementioned connection types. For example, an analog output of the color sensor may be converted to a digital representation prior to transmission via a BLUETOOTH connection. The output of the color sensor may be mapped or otherwise correlated to a predetermined color palette. For example, in step 1054, the sensed color is mapped to a color palette. The predetermined color palette may represent a paint company's color palette. In that regard, any selected color in the color palette may be used to create particles. The sensed color may be matched or otherwise fit to a color in the color palette. In various embodiments, the mapping will seek to closely align the sensed color to a color in the color palette. For example, a color sensor may sense a dark blue. In step 1554, the sensed blue may be mapped to Pantone PMS 287 or, as represented in a hexadecimal, 001A57, or the SHERWIN WILLIAMS color Blueblood (hexadecimal 024889). Thus, the sensed color may be based upon the available color palette. For example, if the sensed color may be represented by 001A57 but the SHERWIN WILLIAMS palette does not contain 001A57, another similar blue such as 024889 may be used. In various embodiments, step 1054 maps the sensed color to a complementary or contrasting color. In that regard, visually appealing (or, if desired, visually unappealing) effects may be obtained by using the sensed color as a basis for selection of another color. For example, if a color sensor senses a color such as Pantone PMS 287, step 1054 may map to Pantone PMS 278. In such a manner, selectable color coordination may be achieved. Step 1054 may output a mapped color in that the output color is the color from the predetermined color palette and not necessary the same color as the sensed color. The mapped color may be used as the color input in step 1004. In various embodiments, the methods described herein are implemented using the various particular machines described herein. The methods described herein may be implemented using the below particular machines, and those hereinafter developed, in any suitable combination, as would be appreciated immediately by one skilled in the art. Further, as is unambiguous from this disclosure, the methods described herein may result in various transformations of certain articles. For the sake of brevity, conventional data networking, application development and other functional aspects of the systems (and components of the individual operating components of the systems) may not be described in detail herein. Furthermore, the connecting lines shown in the various figures contained herein are intended to represent exemplary functional relationships and/or physical couplings between the various elements. It should be noted that many alternative or additional functional relationships or physical connections may be present in a practical system. The various system components discussed herein may include one or more of the following: a host server or other computing systems including a processor for processing digital data; a memory coupled to the processor for storing digital data; an input digitizer coupled to the processor for inputting digital data; an application program stored in the memory and accessible by the processor for directing processing of digital data by the processor; a display device coupled to the processor and memory for displaying information derived from digital data processed by the processor; and a plurality of databases. Various databases used herein may include: client data; merchant data; financial institution data; and/or like data useful in the operation of the system. As those skilled in the art will appreciate, a computer system may include an operating system (e.g., Windows NT, Windows 95/98/2000, Windows XP, Windows Vista, Windows 7, OS2, UNIX, Linux, Solaris, MacOS, iOS, Android, etc.) as well as various conventional support software and drivers typically associated with computers. A user may include any individual, business, entity, government organization, software and/or hardware that interact with a system. A web client includes any device (e.g., personal computer, tablet computer, or smartphone) which communicates via any network, for example such as those discussed herein. Such browser applications comprise Internet browsing software installed within a computing unit or a system to conduct online transactions and/or communications. These computing units or systems may take the form of a computer or set of computers, although other types of computing units or systems may be used, including laptops, notebooks, hand held computers, personal digital assistants, set-top boxes, workstations, computer-servers, main frame computers, mini-computers, PC servers, pervasive computers, network sets of computers, personal computers, such as iPads, iMACs, and MacBooks, kiosks, terminals, point of sale (POS) devices and/or terminals, televisions, or any other device capable of receiving data over a network. A web-client may run Microsoft Internet Explorer, Mozilla Firefox, Google Chrome, Apple Safari, or any other of the myriad software packages available for browsing the internet. Practitioners will appreciate that a web client may or may not be in direct contact with an application server. For example, a web client may access the services of an application server through another server and/or hardware component, which may have a direct or indirect connection to an Internet server. For example, a web client may communicate with an application server via a load balancer. In an exemplary embodiment, access is through a network or the Internet through a commercially-available web-browser software package. As those skilled in the art will appreciate, a web client includes an operating system (e.g., Windows NT, 95/98/2000/CE/Mobile, OS2, UNIX, Linux, Solaris, MacOS, PalmOS, iOS, Android, etc.) as well as various conventional support software and drivers typically associated with computers. A web client may include any suitable personal computer, network computer, workstation, personal digital assistant, cellular phone, smart phone, minicomputer, mainframe or the like. A web client can be in a home or business environment with access to a network. In an exemplary embodiment, access is through a network or the Internet through a commercially available web-browser software package. A web client may implement security protocols such as Secure Sockets Layer (SSL) and Transport Layer Security (TLS). A web client may implement several application layer protocols including http, https, ftp, and sftp. In an embodiment, various components, modules, and/or engines of system 100 may be implemented as micro-applications or micro-apps. Micro-apps are typically deployed in the context of a mobile operating system, including for example, a Palm mobile operating system, a Windows mobile operating system, an Android Operating System, Apple iOS, a Blackberry operating system and the like. The micro-app may be configured to leverage the resources of the larger operating system and associated hardware via a set of predetermined rules which govern the operations of various operating systems and hardware resources. For example, where a micro-app desires to communicate with a device or network other than the mobile device or mobile operating system, the micro-app may leverage the communication protocol of the operating system and associated device hardware under the predetermined rules of the mobile operating system. Moreover, where the micro-app desires an input from a user, the micro-app may be configured to request a response from the operating system which monitors various hardware components and then communicates a detected input from the hardware to the micro-app. As used herein, the term “network” includes any cloud, cloud computing system or electronic communications system or method which incorporates hardware and/or software components. Communication among the parties may be accomplished through any suitable communication channels, such as, for example, a telephone network, an extranet, an intranet, Internet, point of interaction device (point of sale device, personal digital assistant (e.g., iPhone®, Palm Pilot®, Blackberry®), cellular phone, kiosk, etc.), online communications, satellite communications, off-line communications, wireless communications, transponder communications, local area network (LAN), wide area network (WAN), virtual private network (VPN), networked or linked devices, keyboard, mouse and/or any suitable communication or data input modality. Moreover, although the system is frequently described herein as being implemented with TCP/IP communications protocols, the system may also be implemented using IPX, Appletalk, IP-6, NetBIOS, OSI, any tunneling protocol (e.g. IPsec, SSH), or any number of existing or future protocols. If the network is in the nature of a public network, such as the Internet, it may be advantageous to presume the network to be insecure and open to eavesdroppers. Specific information related to the protocols, standards, and application software utilized in connection with the Internet is generally known to those skilled in the art and, as such, need not be detailed herein. See, for example, DILIP NAIK, INTERNET STANDARDS AND PROTOCOLS (1998); JAVA 2 COMPLETE, various authors, (Sybex 1999); DEBORAH RAY AND ERIC RAY, MASTERING HTML 4.0 (1997); and LOSHIN, TCP/IP CLEARLY EXPLAINED (1997) and DAVID GOURLEY AND BRIAN TOTTY, HTTP, THE DEFINITIVE GUIDE (2002), the contents of which are hereby incorporated by reference. The various system components may be independently, separately or collectively suitably coupled to the network via data links which includes, for example, a connection to an Internet Service Provider (ISP) over the local loop as is typically used in connection with standard modem communication, cable modem, Dish networks, ISDN, Digital Subscriber Line (DSL), or various wireless communication methods, see, e.g., GILBERT HELD, UNDERSTANDING DATA COMMUNICATIONS (1996), which is hereby incorporated by reference. It is noted that the network may be implemented as other types of networks, such as an interactive television (ITV) network. Moreover, the system contemplates the use, sale or distribution of any goods, services or information over any network having similar functionality described herein. “Cloud” or “Cloud computing” includes a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services) that can be rapidly provisioned and released with minimal management effort or service provider interaction. Cloud computing may include location-independent computing, whereby shared servers provide resources, software, and data to computers and other devices on demand. For more information regarding cloud computing, see the NIST's (National Institute of Standards and Technology) definition of cloud computing at http://csrc.nist.gov/groups/SNS/cloud-computing/cloud-def-v15.doc (last visited Feb. 4, 2011), which is hereby incorporated by reference in its entirety. As used herein, “transmit” may include sending electronic data from one system component to another over a network connection. Additionally, as used herein, “data” may include encompassing information such as commands, queries, files, data for storage, and the like in digital or any other form. The system contemplates uses in association with web services, utility computing, pervasive and individualized computing, security and identity solutions, autonomic computing, cloud computing, commodity computing, mobility and wireless solutions, open source, biometrics, grid computing and/or mesh computing. Any databases discussed herein may include relational, hierarchical, graphical, or object-oriented structure and/or any other database configurations. Common database products that may be used to implement the databases include DB2 by IBM (Armonk, N.Y.), various database products available from Oracle Corporation (Redwood Shores, Calif.), Microsoft Access or Microsoft SQL Server by Microsoft Corporation (Redmond, Wash.), MySQL by MySQL AB (Uppsala, Sweden), or any other suitable database product. Moreover, the databases may be organized in any suitable manner, for example, as data tables or lookup tables. Each record may be a single file, a series of files, a linked series of data fields or any other data structure. Association of certain data may be accomplished through any desired data association technique such as those known or practiced in the art. For example, the association may be accomplished either manually or automatically. Automatic association techniques may include, for example, a database search, a database merge, GREP, AGREP, SQL, using a key field in the tables to speed searches, sequential searches through all the tables and files, sorting records in the file according to a known order to simplify lookup, and/or the like. The association step may be accomplished by a database merge function, for example, using a “key field” in pre-selected databases or data sectors. Various database tuning steps are contemplated to optimize database performance. For example, frequently used files such as indexes may be placed on separate file systems to reduce In/Out (“I/O”) bottlenecks. More particularly, a “key field” partitions the database according to the high-level class of objects defined by the key field. For example, certain types of data may be designated as a key field in a plurality of related data tables and the data tables may then be linked on the basis of the type of data in the key field. The data corresponding to the key field in each of the linked data tables is preferably the same or of the same type. However, data tables having similar, though not identical, data in the key fields may also be linked by using AGREP, for example. In accordance with one embodiment, any suitable data storage technique may be utilized to store data without a standard format. Data sets may be stored using any suitable technique, including, for example, storing individual files using an ISO/IEC 7816-4 file structure; implementing a domain whereby a dedicated file is selected that exposes one or more elementary files containing one or more data sets; using data sets stored in individual files using a hierarchical filing system; data sets stored as records in a single file (including compression, SQL accessible, hashed via one or more keys, numeric, alphabetical by first tuple, etc.); Binary Large Object (BLOB); stored as ungrouped data elements encoded using ISO/IEC 7816-6 data elements; stored as ungrouped data elements encoded using ISO/IEC Abstract Syntax Notation (ASN.1) as in ISO/IEC 8824 and 8825; and/or other proprietary techniques that may include fractal compression methods, image compression methods, etc. In one exemplary embodiment, the ability to store a wide variety of information in different formats is facilitated by storing the information as a BLOB. Thus, any binary information can be stored in a storage space associated with a data set. As discussed above, the binary information may be stored on the financial transaction instrument or external to but affiliated with the financial transaction instrument. The BLOB method may store data sets as ungrouped data elements formatted as a block of binary via a fixed memory offset using either fixed storage allocation, circular queue techniques, or best practices with respect to memory management (e.g., paged memory, least recently used, etc.). By using BLOB methods, the ability to store various data sets that have different formats facilitates the storage of data associated with the financial transaction instrument by multiple and unrelated owners of the data sets. For example, a first data set which may be stored may be provided by a first party, a second data set which may be stored may be provided by an unrelated second party, and yet a third data set which may be stored, may be provided by a third party unrelated to the first and second party. Each of these three exemplary data sets may contain different information that is stored using different data storage formats and/or techniques. Further, each data set may contain subsets of data that also may be distinct from other subsets. As stated above, in various embodiments, the data can be stored without regard to a common format. However, in one exemplary embodiment, the data set (e.g., BLOB) may be annotated in a standard manner when provided for manipulating the data onto the financial transaction instrument. The annotation may comprise a short header, trailer, or other appropriate indicator related to each data set that is configured to convey information useful in managing the various data sets. For example, the annotation may be called a “condition header”, “header”, “trailer”, or “status”, herein, and may comprise an indication of the status of the data set or may include an identifier correlated to a specific issuer or owner of the data. In one example, the first three bytes of each data set BLOB may be configured or configurable to indicate the status of that particular data set; e.g., LOADED, INITIALIZED, READY, BLOCKED, REMOVABLE, or DELETED. Subsequent bytes of data may be used to indicate for example, the identity of the issuer, user, transaction/membership account identifier or the like. Each of these condition annotations are further discussed herein. The data set annotation may also be used for other types of status information as well as various other purposes. For example, the data set annotation may include security information establishing access levels. The access levels may, for example, be configured to permit only certain individuals, levels of employees, companies, or other entities to access data sets, or to permit access to specific data sets based on the transaction, merchant, issuer, user or the like. Furthermore, the security information may restrict/permit only certain actions such as accessing, modifying, and/or deleting data sets. In one example, the data set annotation indicates that only the data set owner or the user are permitted to delete a data set, various identified users may be permitted to access the data set for reading, and others are altogether excluded from accessing the data set. However, other access restriction parameters may also be used allowing various entities to access a data set with various permission levels as appropriate. The data, including the header or trailer may be received by a stand alone interaction device configured to add, delete, modify, or augment the data in accordance with the header or trailer. As such, in one embodiment, the header or trailer is not stored on the transaction device along with the associated issuer-owned data but instead the appropriate action may be taken by providing to the transaction instrument user at the stand alone device, the appropriate option for the action to be taken. The system may contemplate a data storage arrangement wherein the header or trailer, or header or trailer history, of the data is stored on the transaction instrument in relation to the appropriate data. One skilled in the art will also appreciate that, for security reasons, any databases, systems, devices, servers or other components of the system may consist of any combination thereof at a single location or at multiple locations, wherein each database or system includes any of various suitable security features, such as firewalls, access codes, encryption, decryption, compression, decompression, and/or the like. Encryption may be performed by way of any of the techniques now available in the art or which may become available—e.g., Twofish, RSA, El Gamal, Schorr signature, DSA, PGP, PKI, and symmetric and asymmetric cryptosystems. Firewalls may include any hardware and/or software suitably configured to protect various components and/or enterprise computing resources from users of other networks. Further, a firewall may be configured to limit or restrict access to various systems and components behind the firewall for web clients connecting through a web server. Firewall may reside in varying configurations including Stateful Inspection, Proxy based, access control lists, and Packet Filtering among others. Firewall may be integrated within a web server or any other various components or may further reside as a separate entity. A firewall may implement network address translation (“NAT”) and/or network address port translation (“NAPT”). A firewall may accommodate various tunneling protocols to facilitate secure communications, such as those used in virtual private networking. A firewall may implement a demilitarized zone (“DMZ”) to facilitate communications with a public network such as the Internet. A firewall may be integrated as software within an Internet server, any other application server components or may reside within another computing device or may take the form of a standalone hardware component. The computers discussed herein may provide a suitable website or other Internet-based graphical user interface which is accessible by users. In one embodiment, the Microsoft Internet Information Server (IIS), Microsoft Transaction Server (MTS), and Microsoft SQL Server, are used in conjunction with the Microsoft operating system, Microsoft NT web server software, a Microsoft SQL Server database system, and a Microsoft Commerce Server. Additionally, components such as Access or Microsoft SQL Server, Oracle, Sybase, Informix My SQL, Interbase, etc., may be used to provide an Active Data Object (ADO) compliant database management system. In one embodiment, the Apache web server is used in conjunction with a Linux operating system, a MySQL database, and the Perl, PHP, and/or Python programming languages. Any of the communications, inputs, storage, databases or displays discussed herein may be facilitated through a website having web pages. The term “web page” as it is used herein is not meant to limit the type of documents and applications that might be used to interact with the user. For example, a typical website might include, in addition to standard HTML documents, various forms, Java applets, JavaScript, active server pages (ASP), common gateway interface scripts (CGI), extensible markup language (XML), dynamic HTML, cascading style sheets (CSS), AJAX (Asynchronous Javascript And XML), helper applications, plug-ins, and the like. A server may include a web service that receives a request from a web server, the request including a URL (http://yahoo.com/stockquotes/ge) and an IP address (123.56.789.234). The web server retrieves the appropriate web pages and sends the data or applications for the web pages to the IP address. Web services are applications that are capable of interacting with other applications over a communications means, such as the internet. Web services are typically based on standards or protocols such as XML, SOAP, AJAX, WSDL and UDDI. Web services methods are well known in the art, and are covered in many standard texts. See, e.g., ALEX NGHIEM, IT WEB SERVICES: A ROADMAP FOR THE ENTERPRISE (2003), hereby incorporated by reference. Middleware may include any hardware and/or software suitably configured to facilitate communications and/or process transactions between disparate computing systems. Middleware components are commercially available and known in the art. Middleware may be implemented through commercially available hardware and/or software, through custom hardware and/or software components, or through a combination thereof. Middleware may reside in a variety of configurations and may exist as a standalone system or may be a software component residing on the Internet server. Middleware may be configured to process transactions between the various components of an application server and any number of internal or external systems for any of the purposes disclosed herein. WebSphere MQ™ (formerly MQSeries) by IBM, Inc. (Armonk, N.Y.) is an example of a commercially available middleware product. An Enterprise Service Bus (“ESB”) application is another example of middleware. Practitioners will also appreciate that there are a number of methods for displaying data within a browser-based document. Data may be represented as standard text or within a fixed list, scrollable list, drop-down list, editable text field, fixed text field, pop-up window, and the like. Likewise, there are a number of methods available for modifying data in a web page such as, for example, free text entry using a keyboard, selection of menu items, check boxes, option boxes, and the like. The system and method may be described herein in terms of functional block components, screen shots, optional selections and various processing steps. It should be appreciated that such functional blocks may be realized by any number of hardware and/or software components configured to perform the specified functions. For example, the system may employ various integrated circuit components, e.g., memory elements, processing elements, logic elements, look-up tables, and the like, which may carry out a variety of functions under the control of one or more microprocessors or other control devices. Similarly, the software elements of the system may be implemented with any programming or scripting language such as C, C++, C#, Java, JavaScript, VBScript, Macromedia Cold Fusion, COBOL, Microsoft Active Server Pages, assembly, PERL, PHP, awk, Python, Visual Basic, SQL Stored Procedures, PL/SQL, any UNIX shell script, and extensible markup language (XML) with the various algorithms being implemented with any combination of data structures, objects, processes, routines or other programming elements. Further, it should be noted that the system may employ any number of conventional techniques for data transmission, signaling, data processing, network control, and the like. Still further, the system could be used to detect or prevent security issues with a client-side scripting language, such as JavaScript, VBScript or the like. As will be appreciated by one of ordinary skill in the art, the system may be embodied as a customization of an existing system, an add-on product, upgraded software, a stand alone system, a distributed system, a method, a data processing system, a device for data processing, and/or a computer program product. Accordingly, the system may take the form of an entirely software embodiment, an entirely hardware embodiment, or an embodiment combining aspects of both software and hardware. Furthermore, the system may take the form of a computer program product on a computer-readable storage medium having computer-readable program code means embodied in the storage medium. Any suitable computer-readable storage medium may be utilized, including hard disks, CD-ROM, optical storage devices, magnetic storage devices, and/or the like. The system and method is described herein with reference to screen shots, block diagrams and flowchart illustrations of methods, apparatus (e.g., systems), and computer program products according to various embodiments. It will be understood that each functional block of the block diagrams and the flowchart illustrations, and combinations of functional blocks in the block diagrams and flowchart illustrations, respectively, can be implemented by computer program instructions. These computer program instructions may be loaded onto a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions that execute on the computer or other programmable data processing apparatus create means for implementing the functions specified in the flowchart block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Accordingly, functional blocks of the block diagrams and flowchart illustrations support combinations of means for performing the specified functions, combinations of steps for performing the specified functions, and program instruction means for performing the specified functions. It will also be understood that each functional block of the block diagrams and flowchart illustrations, and combinations of functional blocks in the block diagrams and flowchart illustrations, can be implemented by either special purpose hardware-based computer systems which perform the specified functions or steps, or suitable combinations of special purpose hardware and computer instructions. Further, illustrations of the process flows and the descriptions thereof may make reference to user windows, webpages, web sites, web forms, prompts, etc. Practitioners will appreciate that the illustrated steps described herein may comprise in any number of configurations including the use of windows, webpages, web forms, popup windows, prompts and the like. It should be further appreciated that the multiple steps as illustrated and described may be combined into single webpages and/or windows but have been expanded for the sake of simplicity. In other cases, steps illustrated and described as single process steps may be separated into multiple webpages and/or windows but have been combined for simplicity. As used herein, the meaning of the term “non-transitory computer-readable medium” should be construed to exclude only those types of transitory computer-readable media which were found in In re Nuijten, 500 F.3d 1346 (Fed. Cir. 2007) to fall outside the scope of patentable subject matter under 35 U.S.C. § 101, so long as and to the extent In re Nuijten remains binding authority in the U.S. federal courts and is not overruled by a future case or statute. Stated another way, the term “computer-readable medium” should be construed in a manner that is as broad as legally permissible Benefits, other advantages, and solutions to problems have been described herein with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any elements that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as critical, required, or essential features or elements of the disclosure. The scope of the disclosure is accordingly to be limited by nothing other than the appended claims, in which reference to an element in the singular is not intended to mean “one and only one” unless explicitly so stated, but rather “one or more.” Moreover, where a phrase similar to ‘at least one of A, B, and C’ or ‘at least one of A, B, or C’ is used in the claims or specification, it is intended that the phrase be interpreted to mean that A alone may be present in an embodiment, B alone may be present in an embodiment, C alone may be present in an embodiment, or that any combination of the elements A, B and C may be present in a single embodiment; for example, A and B, A and C, B and C, or A and B and C. Although the disclosure includes a method, it is contemplated that it may be embodied as computer program instructions on a tangible computer-readable carrier, such as a magnetic or optical memory or a magnetic or optical disk. All structural, chemical, and functional equivalents to the elements of the above-described exemplary embodiments that are known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the present claims. Moreover, it is not necessary for a device or method to address each and every problem sought to be solved by the present disclosure, for it to be encompassed by the present claims. Furthermore, no element, component, or method step in the present disclosure is intended to be dedicated to the public regardless of whether the element, component, or method step is explicitly recited in the claims. No claim element herein is to be construed under the provisions of 35 U.S.C. 112, sixth paragraph, unless the element is expressly recited using the phrase “means for.” As used herein, the terms “comprises”, “comprising”, or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. 1. A method comprising: creating, by a computer-based system, particle elements for graphical display, wherein the particle elements comprise attributes corresponding to particle parameters, and wherein the particle parameters describe a property of a plurality of particles for use in a seamless surface covering; building, by the computer-based system, a particle pattern by arranging the particle elements to form the particle pattern, wherein each particle element is assigned to a position in the particle pattern to simulate a distribution of physical particles; and rendering, by the computer-based system, a second virtual environment by overlaying the particle pattern on a virtual environment, wherein the second virtual environment is configured for graphical display to simulate the distribution of physical particles on a physical substrate. 2. The method of claim 1, further comprising importing, by the computer-based system, the virtual environment comprising at least one of a floor, a wall, or a ceiling. 3. The method of claim 2, wherein the rendering the second virtual environment comprises overlaying the particle pattern on to at least one of the floor, the wall, or the ceiling of the virtual environment. 4. The method of claim 2, further comprising importing, by the computer-based system, a room feature for the virtual environment, wherein the room feature comprises at least one of a wall color, a number of windows, a size of each window, wherein the second virtual environment is rendered to include the room feature. 5. The method of claim 2, wherein the position assigned to each particle element comprises a random position in the particle pattern. 6. The method of claim 5, further comprising: rebuilding, by the computer-based system, the particle pattern by arranging the particle elements to form the particle pattern, wherein each particle element is assigned to a second random position in the particle pattern to simulate a second distribution of physical particles; and rendering, by the computer-based system, a third virtual environment by overlaying the particle pattern on to at least one of the floor, the wall, or the ceiling of the virtual environment, wherein the third virtual environment is configured for graphical display to simulate the second distribution of physical particles on the physical substrate. 7. The method of claim 1, further comprising receiving, by the computer-based system, the particle parameters from a web client, wherein the web client is configured to display a user interface for selecting the particle parameters. 8. The method of claim 1, further comprising: receiving, by the computer-based system, an input text stream, wherein the input text stream comprises an email, XML formatted data, or HTML formatted data, and wherein the input text stream comprises the particle parameters; and parsing, by the computer-based system, the input text stream to determine the particle parameters. 9. The method of claim 1, further comprising: importing, by the computer-based system, a photograph comprising a physical object; and rendering, by the computer-based system, a virtual representation of the physical object, wherein the second virtual environment is rendered to include the virtual representation of the physical object. 10. A system for simulating particle patterns for use in a seamless surface covering, the system comprising: a color sensor in communication with a processor; and a non-transitory memory in communication with the processor, the non-transitory memory having instructions stored thereon that, in response to execution by the processor, cause the processor to perform operations comprising: receiving, by the processor, an input color from the color sensor; creating, by the processor, particle elements for graphical display, wherein the particle elements comprise attributes corresponding to particle parameters, and wherein the particle parameters include the input color and describe a property of a plurality of particles for use in the seamless surface covering; building, by the processor, a particle pattern by arranging the particle elements to form the particle pattern, wherein each particle element is assigned to a position in the particle pattern to simulate a distribution of physical particles; and rendering, by the processor, a second virtual environment by overlaying the particle pattern on a virtual environment, wherein the second virtual environment is configured for graphical display to simulate the distribution of physical particles on a physical substrate. 11. The system of claim 10, further comprising importing, by the processor, the virtual environment comprising at least one of a floor, a wall, or a ceiling. 12. The system of claim 11, wherein the rendering the second virtual environment comprises overlaying the particle pattern on to at least one of the floor, the wall, or the ceiling of the virtual environment. 13. The system of claim 10, wherein the color sensor emits electromagnetic radiation of a known wavelength at an object, wherein the color sensor receives a reflection of the electromagnetic radiation of the known wavelength, wherein the reflection is represented by a red green blue (“RGB”) value, wherein the RGB value is mapped to a first color of a color palette, and wherein the input color comprises the first color of the color palette, a second color from the color palette that complements the first color, or a third color from the color palette that contrasts the first color. 14. The system of claim 10, wherein the color sensor is configured to passively accept light and convert the light into an output frequency, wherein the output frequency is representative of a color of the light received by the color sensor, wherein the output frequency is mapped to a first color of a color palette, and wherein the input color comprises the first color of the color palette, a second color from the color palette that complements the first color, or a third color from the color palette that contrasts the first color. 15. A method comprising: creating, by a processor, particle elements for graphical display, wherein the particle elements comprise attributes corresponding to particle parameters, and wherein the particle parameters comprise at least one of a total number of particles, a particle color, a particle size, a particle shape, and a proportion of each particle color to the total number of particles; building, by the processor, a particle pattern by arranging the particle elements to form the particle pattern, wherein each particle element is assigned to a position in the particle pattern to simulate a distribution of physical particles; and rendering, by the processor, a second virtual environment by overlaying the particle pattern on a virtual environment, wherein the second virtual environment is configured for graphical display to simulate the distribution of physical particles on a physical substrate. 16. The method of claim 15, further comprising importing, by the processor, the virtual environment comprising at least one of a floor, a wall, or a ceiling. 17. The method of claim 16, wherein the rendering the second virtual environment comprises overlaying the particle pattern on to at least one of the floor, the wall, or the ceiling of the virtual environment. 18. The method of claim 15, wherein the particle shape comprises at least one of a circle, a rectangle, a square, a trapezoid, and an irregular geometry, wherein the particle size defines a dimension of the particle element, and wherein the dimension comprises a width, a length, and a depth. 19. The method of claim 15, wherein the particle color comprises at least one of an optical effect or a graphical representation, wherein the optical effect comprises at least one of a translucent effect, a metallic effect, a reflective effect, a highlight effect, a shadowing effect, a fluorescent effect, or a phosphorescent effect, and wherein the graphical representation comprises at least one of a color chip, a color flake, a color quartz, mica, glass, stones, or rock. 20. The method of claim 15, wherein the particle element comprises a data structure including a data point related to a physical particle or a graphical representation of the physical particle, and wherein the data structure comprises a run time object or a row in a database.

2019-03-25

en

2019-07-18

US-202117188757-A

Detecting when a piece of material is caught between a chuck and a tool ABSTRACT A system for detecting material caught between a chuck and a removable tool. The system includes a sensor mounted on a surface that experiences a vibration caused by a rotating of the removable tool in the chuck. The system also includes an electronic processor configured to receive raw vibration data from the sensor, generate transformed vibration data by transforming the raw vibration data, and using a machine learning model, analyze the raw vibration data and transformed vibration data to determine whether there is a piece of material caught between the removable tool and the chuck. RELATED APPLICATIONS This application is related to and claims the benefit of and priority to U.S. Provisional Patent Application Ser. No. 62/985,170, filed Mar. 4, 2020, titled “DETECTING WHEN A PIECE OF MATERIAL IS CAUGHT BETWEEN A CHUCK AND A TOOL” (Attorney Docket No. 022896-3233-US01), the disclosure of which is hereby incorporated herein by reference as if set forth in its entirety. BACKGROUND Machining equipment, such as milling machines, often include a spindle chuck into which different tools can be inserted. Equipped with these tools milling machines can be used to form objects, for example, machine parts. SUMMARY FIG. 1A shows a tool 100 (for example, a cutting tool) in a chuck 105. In some embodiments, the chuck is connected to a spindle that is turned by a motor (for example, as part of a computer numerical control (CNC) machine). In FIG. 1A, the tool 100 is aligned with the chuck 105. As illustrated in FIG. 1B, sometimes during the manufacturing process, a small piece of material 110, such as a metal chip, becomes stuck between the tool 100 and the chuck 105. For example, a metal chip may become lodged between the chuck 105 and tool 100 when the tool 100 in the chuck 105 is changed either manually or automatically. The lodged chip may change the angle of the tool 100 in the chuck 105 as illustrated in FIG. 1B. Thus, the piece of material may cause the tool 100 to become misaligned with the chuck 105 and, as a result, make inaccurate cuts, tap inaccurate holes, or both. In some cases, the misalignment of the tool 100 in the chuck 105 may cause damage to the tool 100, the spindle, the chuck 105, other parts of the machine operating the tool, or a combination of the foregoing. It should be noted that the tool 100, although not illustrated herein, may include both a tool and a tool holder. Existing systems use sensors mounted (via, for example, a bearing) on the spindle connecting the chuck to the motor and limit-based monitoring to determine when a piece of material is caught between the chuck and the tool. However, these existing systems are not easily used on older or legacy machines, and the hardware used to attach the sensor to the spindle often fails. Additionally, these existing systems suffer from limited scalability and required defined measuring cycles, which cause downtime. Some existing systems require connection to a machine control system to determine when monitoring should take place (when is a tool in use), which tool is in use, or both. Some existing systems use different models for determining whether material is caught between a tool and a chuck depending on the tool in use and need to determine which tool is in use in order to select the correct model. Connecting to the machine control system is complex and requires customization for the different hardware of each machine control system vendor and each machine setup. Therefore, embodiments herein describe, among other things, a system and method for detecting when a piece of material is caught between a chuck and a tool. Certain embodiments described herein utilize machine learning software to determine when a piece of material is caught between the chuck and the tool based on vibration data from a sensor mounted on a surface of the machine (for example, a motor housing). Certain embodiments described herein do not require a sensor to be mounted on the spindle and overcome many of the aforementioned deficiencies of existing systems. Additionally, the embodiments described herein do not require connection to machine control systems because they use vibration data to determine when a tool is in use and a machine learning model to determine, for a variety of different tools, whether a piece of material is caught between a tool and a chuck. For example, one embodiment provides a system for detecting material caught between a chuck and a removable tool. The system includes a sensor mounted on a surface that vibrates. The vibration of the surface is caused by a rotating of the removable tool in the chuck. The system also includes an electronic processor configured to receive raw vibration data from the sensor, generate transformed vibration data by transforming the raw vibration data, and using a machine learning model, analyze the raw vibration data and transformed vibration data to determine whether there is a piece of material caught between the tool and the chuck. Another embodiment provides a method for detecting material caught between a chuck and a tool. The method includes receiving raw vibration data from a sensor mounted on a surface that vibrates. The vibration of the surface is caused by a rotating of the removable tool in the chuck, generating transformed vibration data by transforming the raw vibration data, and using a machine learning model, analyzing the raw vibration data and transformed vibration data to determine whether there is a piece of material caught between the tool and the chuck. Yet another embodiment provides a method for detecting material caught between a chuck and a removable tool. The method includes receiving raw vibration data from a sensor mounted on a surface that vibrates. The vibration of the surface is caused by an operation of the removable tool in the chuck and using a machine learning model, analyzing raw vibration data, transformed vibration data generated from the raw vibration data, or both to determine whether there is a piece of material caught between the removable tool and the chuck. Other aspects, features, and embodiments will become apparent by consideration of the detailed description and accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1A illustrates an example of a tool in a chuck when there is no piece of material caught between the tool and the chuck. FIG. 1B illustrates an example of a tool in a chuck when there is a piece of material caught between the tool and the chuck. FIG. 2 is a block diagram of a system for detecting when a piece of material is caught between a chuck and a tool according to one embodiment. FIG. 3 is a block diagram of a local computer of the system of FIG. 1 according to one embodiment. FIG. 4 is an example illustration of training data used to train the machine learning model utilized during the execution of the method of FIG. 5 according to one embodiment. FIG. 5 is a flowchart of a method of using the system of FIG. 2 to detect when a piece of material is caught between a chuck and a tool according to one embodiment. FIG. 6 is a block diagram of a neural network used to perform the method of FIG. 5 according to one embodiment. FIG. 7 is an illustration of raw vibration data and resulting predictions according to one embodiment. DETAILED DESCRIPTION Before any embodiments are explained in detail, it is to be understood that this disclosure is not intended to be limited in its application to the details of construction and the arrangement of components set forth in the following description or illustrated in the following drawings. Embodiments are capable of other configurations and of being practiced or of being carried out in various ways. A plurality of hardware devices and software, as well as a plurality of different structural components may be used to implement various embodiments. In addition, embodiments may include hardware, software, and electronic components or modules that, for purposes of discussion, may be illustrated and described as if the majority of the components were implemented solely in hardware. However, one of ordinary skill in the art, and based on a reading of this detailed description, would recognize that, in at least one embodiment, the electronic based aspects of the invention may be implemented in software (for example, stored on non-transitory computer-readable medium) executable by one or more processors. For example, “control units” and “controllers” described in the specification can include one or more electronic processors, one or more memory modules including non-transitory computer-readable medium, one or more communication interfaces, one or more application specific integrated circuits (ASICs), and various connections (for example, a system bus) connecting the various components. It should also be understood that although certain drawings illustrate hardware and software located within particular devices, these depictions are for illustrative purposes only. In some embodiments, the illustrated components may be combined or divided into separate software, firmware and/or hardware. For example, instead of being located within and performed by a single electronic processor, logic and processing may be distributed among multiple electronic processors. Regardless of how they are combined or divided, hardware and software components may be located on the same computing device or may be distributed among different computing devices connected by one or more networks or other suitable communication links. FIG. 2 illustrates a system 200 for detecting when a piece of material is caught between a chuck and a tool. In the example provided, the system 200 includes a machine 203 with a motor/motor housing 205, a z-axis ball screw 210, a z-axis ball screw end cap 212, a chuck 215, a tool 220, and a sensor 225. The system 200 also includes a local computer 230 (an edge device) and a server 235. In some embodiments, the machine 203 is a computer numerical control (CNC) machine. In some embodiments, the local computer 230 is included in the machine 203. The motor 205 included in the machine 203 drives the z-axis ball screw 210 and the z-axis ball screw 210 translates the rotary motion of the motor 205 to linear motion to change the z-axis. The chuck 215 connects the z-axis ball screw 210 to the tool 220 so that when the motor 205 turns, the tool 220 moves. The chuck 215 allows different tools to be connected to the z-axis ball screw 210. The tool 220 attached to the chuck 215 may be changed automatically or manually. In one example, the tool 220 is a turning tool capable of forming objects such as mechanical components out of a piece of material by cutting away at the material. When the tool 220 cuts the material, chips are generated which can get stuck between the tool 220 and the chuck 215 causing misalignment of the tool 220, such as the misalignment shown in FIG. 1B. The sensor 225 is a vibration sensor, capable of measuring the vibrations generated by the moving tool 220. For example, the sensor 225 may be a Structure-Borne Sound Sensor (SB SS) or a Connected Industrial Sensor Solution (CISS) manufactured by Robert Bosch LLC. The sensor 225 is communicatively connected to the local computer 230 and sends vibration data to the local computer 230 via various wired or wireless connections. For example, in some embodiments, the sensor 225 is directly coupled via a dedicated wire to the local computer 230. In other embodiments, the sensor 225 is communicatively coupled to the local computer 230 via a shared communication link such as a Bluetooth™ or other wireless connection. In some embodiments, the sensor 225 is mounted to the motor housing 205. In other embodiments, the sensor 225 is mounted to the z-axis ball screw end cap 212, an x-axis ball screw end cap (not shown), or a y-axis ball screw end cap (not shown). The local computer 230 and the server 235 communicate over one or more wired or wireless communication networks 240. Portions of the wireless communication networks 240 may be implemented using a wide area network, such as the Internet, a local area network, such as a Wi-Fi network, short-range wireless networks, such as a Bluetooth™ network, near field communication connections, and combinations or derivatives thereof. In alternative embodiments, the server 235 is part of a cloud-based system external to the system 200 and accessible by the local computer 230 over one or more additional networks. It should be noted that while certain functionality described herein as being performed by one component of the system 200, in some embodiments that functionality may be performed by a different component of the system 200 or a combination of components of the system 200. It should be understood that the system 200 may include a different number of machines (for example, milling machines) each with a sensor, a different number of local computers, and a different number of servers than the single machine 203, local computer 230, and server 235 illustrated in FIG. 2. FIG. 3 is a block diagram of one example embodiment of the local computer 230 of the system 200 of FIG. 2. The local computer 230 includes, among other things, an electronic processor 300 (such as a programmable electronic microprocessor, microcontroller, or similar device), a memory 305 (for example, non-transitory, machine readable memory), and a communication interface 310. The electronic processor 300 is communicatively connected to the memory 305 and the communication interface 310. The electronic processor 300, in coordination with the memory 305 and the communication interface 310, is configured to implement, among other things, the methods described herein. The memory 305 includes software that, when executed by the electronic processor 300, causes the electronic processor 300 to perform the method 500 illustrated in FIG. 5. For example, the memory 305 illustrated in FIG. 3 includes machine learning model 315 and raw data processing software 320. The machine learning model 315 may be a deep neural network (for example, a convolutional neural network (CNN) or a recurrent neural network (RNN)). In one example, the neural network includes two input channels, allowing the neural network to analyze both raw vibration data and vibration data transformed by the raw data processing software 320 simultaneously to detect when a piece of material is caught between a chuck and a tool. As described below, in some embodiments, the neural network may include a different number of channels than two channels illustrated and described herein. In some embodiments, the machine learning model 315 is trained to detect when a piece of material is caught between a chuck and a tool using training data including samples or snippets of vibration data that have been labeled to indicate whether or not they are indicative of a piece of material being caught between a tool and a chuck. The training data includes a training set, a validation set, and a test set. The training set is a set of vibration data samples or snippets used to train the machine learning model 315 (for example, to determine weights and biases in the machine learning model 315). The validation set is a set of vibration data samples or snippets used to evaluate the machine learning model 315 after each training epoch and test the loss and accuracy of the machine learning model 315 on unseen data. The test set is a set of vibration data samples or snippets used to provide an unbiased evaluation of the final machine learning model 315 and define the degree of generalization of the machine learning model 315. The training data includes data vibration data from a variety of different machines, using a variety of tools in a variety of states of wear while manufacturing a variety of different objects. The training data may include raw vibration data and transformed vibration data. FIG. 4 provides a visual representation of one example of training data. As illustrated in FIG. 4, the training set 402, validation set 404, and test set 406 may each be different sets of vibration data collected from different machines, using different tools of different ages to manufacture different objects. The vibration data samples for tools illustrated in FIG. 4 having a darker shade represent tools which possess both good process measurements (e.g., vibrations generated by the machine operating without material caught in the chuck) and defect process measurements (e.g., vibrations generated by the machine operating with material is caught in the chuck). The process measurements of the tools that are shared by the train and the validation dataset are split between both datasets. Using such varied training data produces a model trained to detect material caught between a chuck and a tool across a variety of conditions and circumstances. In some embodiments, the training data is segmented into snippets allowing the number of training samples having a standard length to be increased. Dataset segmentation consists of slicing a signal into smaller segments (i.e., snippets), which allow enlargement of the training population with samples having a standard length. Each snippet has a window size. For vibration data, drive motor speed and sensor sampling rate should be considered when determining the window size. In some embodiments, a window size is set to cover at least one full revolution of the motor (i.e., the selected window should contain the periodical spatial position of the drive motor). In some embodiments, the window size is determined according to the following formula: In some embodiments, each snippet is smaller (for example, half of the window size). In some embodiments, the training data is downsampled. Downsampling is utilized to increase the performance of some neural networks (for example, Long Short-Term Networks) by using smaller window sizes. In some embodiments, the training data is normalized using, for example, Standard-Scaling. In some embodiments, the training data is collected via one or more local computers such as the local computer 230 and sent to the server 235. The server 235 uses the received training data to train a machine learning model 315 and, when the machine learning model 315 is trained, sends the machine learning model 315 to each local computer in the system 200. When the local computer 230, executing the machine learning model 315, cannot determine whether vibration data is indicative of a piece of material being caught between a tool and a chuck, the local computer 230 may send a notification to the server 235 (for example, using a suitable network message or an application programming interface). In some embodiments, the notification may include the vibration data and a label that the machine operator has associated with the vibration data. In response to receiving the notification, the server 235 may retrain the machine learning model 315 and send the retrained machine learning model to each of the local computers in the system 200. Therefore, the machine learning model deployed to each local computer improves over time from collective awareness and the initial training time needed to apply the machine learning model to monitoring a new machine is reduced. Although not illustrated herein, the server 235 may contain components similar to those illustrated in FIG. 3 as being included in the local computer 230. The functionality described herein as being performed by the local computer 230 or the server 235 may be distributed amongst a plurality of local computers and servers. Additionally, the local computer 230, the server 235, or both may contain sub-modules that include additional electronic processors, memory, or application specific integrated circuits (ASICs) for handling communication functions, processing of signals, and application of the methods listed below. In other embodiments, the local computer 230, server 235, or both include additional, fewer, or different components than those illustrated in FIG. 3. FIG. 5 illustrates an example method 500 of detecting when a piece of material is caught between a chuck and a tool. At step 505, the electronic processor 300 receives raw vibration data from a sensor mounted on a surface of the machine 203 that experiences a vibration. In some embodiments, the vibration is caused by a removable tool (for example, the tool 220) rotating in the chuck 215. For example, the sensor 225 may capture the movement of the motor housing 205 or z-axis ball screw end cap 212 in the x-direction, the y-direction, or both. In some embodiments, at step 510, the electronic processor 300 transforms the raw vibration data to produce transformed vibration data. For example, at step 510, the electronic processor 300 may execute the raw data processing software 320 to apply a Fast Fourier Transform to the raw vibration data received from the sensor 225. Applying a Fast Fourier Transform to the raw vibration data can reduce the dimensions of the input space by extracting the power spectral density series. At step 515, the electronic processor 300, using a machine learning model (for example, the machine learning model 315), analyzes the raw vibration data and transformed vibration data to determine when there is a piece of material caught between the tool 220 and the chuck 215. In some embodiments, as explained in detail with regard to FIGS. 6 and 7, the machine learning model 315 uses a neural network to predict whether the raw vibration data and transformed vibration data are indicative of vibrations caused by a tool and chuck operating with a piece of material caught between them. FIG. 6 illustrates one example of how the electronic processor 300 (at step 515) determines when a piece of material is caught between the chuck 220 and the tool 220. In the example illustrated in FIG. 6, the machine learning model 315 is illustrated as a convolutional neural network with two input channels. In the example illustrated in FIG. 6, raw vibration data in the x-direction is fed to the neural network as a signal via a first channel 600 and transformed vibration data in the x-direction is fed to the neural network as a signal via a second channel 610. The neural network has a plurality of layers including feature extraction layers 615 and a classification layer 620. There are two types of feature extraction layers 615—convolutional layers and pooling or sub-sampling layers. Each convolutional layer applies filters to the raw and transformed vibration data in the x-direction. In certain embodiments, a filter is a matrix of weight values. The weight values of the filters are set by training the neural network. Sub-sampling layers reduce the size of the input data or signals being processed by the neural network. A sub-sampling layer creates a smaller portion from a larger signal by creating the smaller signal with patterns that represent groups of patterns in the larger signal. The classification layer 620 is responsible for using the extracted features of the raw and transformed vibration data in the x-direction detecting when a piece of material is caught between a chuck and a tool. It should be understood that the machine learning model 315 may receive different input via the two input channels than the raw and transformed vibration data in the x-direction illustrated in FIG. 6. For example, the machine learning model 315 may receive raw and transformed vibration data in the y-direction, raw vibration data in the x-direction and transformed vibration data in the y-direction, or raw vibration data in the y-direction and transformed vibration data in the x-direction. It should be understood that different combinations of vibration data, other than those described herein, may be received by the machine learning model 315 via two input channels. It should also be understood that the machine learning model 315 may be a neural network with a different number of channels than the two channels illustrated in FIG. 6. For example, the machine learning model 315 may be a neural network with a single input channel and the neural network may receive raw vibration data in the x-direction, raw vibration data in the y-direction, transformed vibration data in the y-direction, or transformed vibration data in the x-direction via the single input channel. In another example, the machine learning model 315 may be a neural network with four input channels and receive raw vibration data in the x-direction, raw vibration data in the y-direction, transformed vibration data in the y-direction, and transformed vibration data in the x-direction via the four input channels. It should be understood that the machine learning model 315 may be a neural network with a different number of channels than those described in the examples presented herein. Additionally, the machine learning model 315 may receive different input via the input channels than the inputs described in the examples presented herein. FIG. 7 is an example illustration of raw vibration data in the x-direction 700 for tools 702 (labeled 1 through 8), raw vibration data in the y-direction 705 for tools 702 (labeled 1 through 8), and a prediction 710 (made by the machine learning model 315 using raw vibration data in the x-direction 700 and raw vibration data in the y-direction 705) as to whether a piece of material is caught between a chuck and a tool. In the example illustrated in FIG. 7, tools with numbers outlined in dashes (in FIG. 7, tools 1, 5, and 8) are determined to be rotating without a piece of material caught between the chuck and the tool and tools with numbers outlined in a solid line (in FIG. 7, tools 2, 3, 4, 6, and 7) are determined to be rotating with a piece of material caught between the chuck and the tool. In some embodiments, when a piece of material is determined to be caught between the chuck 215 and the tool 220, the electronic processor 300 is configured to send a signal to interrupt the machining process (for example, using a suitable message protocol or discrete signal), send a signal to cause a notification indicating that there is a piece of material caught between the chuck 215 and the tool 220 to a user (for example, a technician), a combination of the foregoing, and the like. For example, the user may be notified of the existence of the piece of the material via a user interface of a user device or the local computer 230. In some embodiments, interrupting the machining process includes preventing the machine 203 from manufacturing any further objects until a human operator approves the machine 203 for further manufacturing. Embodiments described herein are described in terms of detecting a piece of material caught between a chuck and a tool during a rotation of the tool by the chuck and a spindle. However, it should be understood that the embodiments may be used to detect piece(s) of material caught between a chuck, clamp (for example, a blade clamp), or other tool holder and a tool held by the chuck, clamp, or holder during non-rotational movements of a tool by a machine. In one non-limiting example, a tool (for example, a saw blade) used in a reciprocating motion may generate vibrations during the operation of the tool that can be used to determine whether material is caught in the tool holder (for example, a blade clamp). Systems and methods described herein are also applicable to machines operating such tools. In the foregoing specification, specific embodiments and examples have been described. However, one of ordinary skill in the art appreciates that various modifications and changes can be made without departing from the scope of the invention as set forth in the claims below. Accordingly, the specification and figures are to be regarded in an illustrative rather than a restrictive sense, and all such modifications are intended to be included within the scope of present teachings. In this document, relational terms such as first and second, top and bottom, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The terms “comprises,” “comprising,” “has,” “having,” “includes,” “including,” “contains,” “containing” or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises, has, includes, contains a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by “comprises . . . a,” “has . . . a,” “includes . . . a,” or “contains . . . a” does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises, has, includes, contains the element. The terms “a” and “an” are defined as one or more unless explicitly stated otherwise herein. The terms “substantially,” “essentially,” “approximately,” “about” or any other version thereof, are defined as being close to as understood by one of ordinary skill in the art, and in one non-limiting embodiment the term is defined to be within 10%, in another embodiment within 5%, in another embodiment within 1% and in another embodiment within 0.5%. The term “coupled” as used herein is defined as connected, although not necessarily directly and not necessarily mechanically. A device or structure that is “configured” in a certain way is configured in at least that way but may also be configured in ways that are not listed. Various features, advantages, and embodiments are set forth in the following claims. What is claimed is: 1. A system for detecting material caught between a chuck and a removable tool, the system comprising: a sensor mounted on a surface that experiences a vibration caused by a rotating of the removable tool in the chuck; and an electronic processor, the electronic processor configured to receive raw vibration data from the sensor; generate transformed vibration data by transforming the raw vibration data; and using a machine learning model, analyze the raw vibration data and transformed vibration data to determine whether there is a piece of material caught between the removable tool and the chuck. 2. The system according to claim 1, wherein the machine learning model includes a convolutional neural network. 3. The system according to claim 2, wherein the convolutional neural network includes a first channel whereby the convolutional neural network receives the raw vibration data for analysis and a second channel whereby the convolutional neural network receives the transformed vibration data for analysis. 4. The system according to claim 1, wherein the sensor is a vibration sensor. 5. The system according to claim 1, wherein the electronic processor is further configured to send a first signal to interrupt a machining process send a second signal to cause a notification indicating that the piece of material is caught between the chuck and the removable tool to be sent to a user, or both. 6. The system according to claim 1, wherein the electronic processor is included in a local computer and the electronic processor is configured to receive the machine learning model from a server. 7. The system according to claim 6, wherein the server is configured to train the machine learning model using vibration data collected from one or more different machines, using one or more different tools of one or more different ages to manufacture one or more different objects. 8. The system according to claim 1, wherein the electronic processor is configured to transform the raw vibration data by applying a Fast Fourier Transform to the raw vibration data. 9. A method for detecting material caught between a chuck and a removable tool, the method comprising: receiving raw vibration data from a sensor mounted on a surface that experiences a vibration caused by a rotating of the removable tool in the chuck; generating transformed vibration data by transforming the raw vibration data; and using a machine learning model, analyzing the raw vibration data and transformed vibration data to determine whether there is a piece of material caught between the removable tool and the chuck. 10. The method according to claim 9, wherein the machine learning model includes a convolutional neural network. 11. The method according to claim 10, wherein the convolutional neural network includes a first channel whereby the convolutional neural network receives the raw vibration data for analysis and a second channel whereby the convolutional neural network receives the transformed vibration data for analysis. 12. The method according to claim 9, wherein the sensor is a vibration sensor. 13. The method according to claim 9, the method further comprising sending a first signal to interrupt a machining process, sending a second signal to cause a notification indicating that the piece of material is caught between the chuck and the removable tool to be sent to a user, or both. 14. The method according to claim 9, the method further comprising receiving, with a local computer, the machine learning model from a server. 15. The method according to claim 14, wherein the server is configured to train the machine learning model using vibration data collected from one or more different machines, using one or more different removable tools of one or more different ages to manufacture one or more different objects. 16. The method according to claim 9, wherein transforming the raw vibration data includes applying a Fast Fourier Transform to the raw vibration data. 17. A method for detecting when material caught between a chuck and a removable tool, the method comprising: receiving raw vibration data from a sensor mounted on a surface that experiences a vibration caused by an operation of the removable tool in the chuck; and using a machine learning model, analyzing at least one selected from the group consisting of the raw vibration data and transformed vibration data generated from the raw vibration data to determine whether there is a piece of material caught between the removable tool and the chuck.

2021-03-01

en

2021-09-09

US-201616065040-A

In-Vehicle Device ABSTRACT An in-vehicle device comprises a gesture defection unit, which recognizes a user&#39;s hand position located within a predetermined range, a driving state recognition unit which detects a driving state of a vehicle, and a gesture control unit which controls a state of a gesture operation based on a recognition result of the hand position by the gesture detection unit, wherein the gesture control unit disables the gesture operation when the driving state of the vehicle detected by the driving state recognition unit is in a predetermined disabling state. TECHNICAL FIELD The present invention relates to an in-vehicle device. BACKGROUND ART PTL 1 describes an operation device of in-vehicle equipment which superimposes and displays, on a head up display (HUD), the operation menu of the in-vehicle equipment and the projected image of the driver's hand placed on the operation unit, and thereby allows the driver to operate the operation unit white viewing the projected image to simplify and facilitate the selection operation of the in-vehicle equipment so that such operation will not interfere with the diving of the vehicle. CITATION LIST Patent Literature [PTL 1] Japanese Patent Application Publication No. 2010-215194 SUMMARY OF THE iNVENTION Problems to be Solved by the invention Nevertheless, when operating the in-vehicle equipment while driving a vehicle, with the technology described in PTL 1, because the operation menu is constantly displayed on the HUD, such display of the operation menu may interfere with the diving operation. Moreover, in order to perform operations, a dedicated device for performing operations must be installed somewhere within the vehicle, and, in addition to increased costs, there are restrictions in the mounting of such device Furthermore, even in cases of using a voice-only interface, processing time of the processing required for voice recognition and time for listening to the emitted voice are required, and the operability and convenience am impaired. Means to Solve the Problems According to the first mode of the present invention, an in-vehicle device comprises a gesture detection unit which recognizes a user's hand position located within a predetermined range, a driving state recognition unit which detects a driving state of a vehicle, and a gesture control unit which controls a state of a gesture operation based on a recognition result of the hand position by the gesture detection unit, wherein the gesture control unit disables the gesture operation when the driving state of the vehicle detected by the driving state recognition unit is in a predetermined disabling state. Advantageous Effects of the invention According to the present invention, it is possible to improve the safety and operatability of the operation of in-vehicle equipment by a driver who is driving a vehicle. BRIEF DESCRIPTION OF DRAWINGS FIG. 1 is a configuration diagram of an in-vehicle device in the first embodiment of the present invention. FIG. 2(a) shows an example of an installation position of a sensing unit. FIG. 2(b) shows an example of gesture defection areas. FIG. 2(c) shows an example of gesture detects areas. FIG. 3(a) shows an example of an operation How in the first embodiment. FIG. 3(b) shows an example of an operation flow in the first embodiment. FIG. 4(a) shows a display example of a display unit and an external display unit. FIG. 4(b) shows a display example of a display unit and an external display unit. FIG. 4(c) shows a display example of a display unit and an external display unit. FIG. 4(d) shows a display .example of a display unit and an external display unit. FIG. 5(a) shows a display example of an external display unit. FIG. 5(b) shows a display example of an external display unit. FIG. 5(c) shows a display example of an external display unit. FIG. 5(d) shows a display example of an external display unit. FIG. 6 shows a display example of a display unit and an external display unit. FIG. 7(b) shows a display example of an external display unit. FIG. 7(b) shows a display example of an external display unit. FIG. 8(a) shows an installation example of a sensing unit. FIG. 8(b) shows a correspondence example of operations decoding to the position of a sensing unit. FIG. 9 shows an example of a sensing unit and shapes of a user's hand. FIG. 10(a) shows examples of the manner of waving a user's hand FIG. 10(b) shows a display example of an external display unit. FIG. 11(a) shows a display example of a display unit. FIG. 11(b) shows an example of display locations of the displayed contents. FIG. 11(c) shows an example of display locations of the displayed contents. FIG. 12(a) shows an example of an operation flow. FIG. 12(b) shows a display example of an external display unit. FIG. 12(c) shows a display example of an external display unit. FIG. 12(d) shows a display example of an external display unit. FIG. 12(e) shows a display example of an external display unit. FIG. 12(f) shows a display example of an external display unit. FIG. 12(g) shows a display example of an external display unit. FIG. 13 shows a configuration diagram of an in-vehicle device in the second embodiment. FIG. 14(a) shows an example of a control pattern according to a driving load level. FIG. 14(b) shows an example of a control pattern according to a driving load level. FIG. 14(c) shows an example of a control pattern according to a driving bad level. FIG. 14(d) shows an example of a control pattern according to a driving load level. FIG. 15(a) shows a display example of an external display unit. FIG. 15(b) shows a display example of an external display unit. FIG. 16(a) shows a display example of a display unit. FIG. 16(b) shows a display example of an external display unit. FIG. 17 shows a configuration diagram of an in-vehicle device in the third embodiment of the present invention. FIG. 18 shows an appearance example of a cockpit. FIG. 19 shows a display example of a display unit and an external display unit. FIG. 20 an example of an operation method based on gestures and a steering controller. FIG. 21 shows a display example of an external display unit. FIG. 22 shows a display example of an external display unit. FIG. 23 shows a display example of an external display unit. FIG. 24 shows an example of an operation flow. FIG. 25 shows an example of an operation method based on a steering controller and a touch panel. FIG. 26(a) shows a table indicating a selection method of an operation device according to the approach of a user's hand to a specific device. FIG. 26(b) shows a table indicating a selection method of an operation device according to the position and moving direction of a user's hand. FIG. 28(c) shows a table indicating a selection method of an operation device and a display device according to the driving/stopped state FIG. 27 shows an example of an operation flow. FIG. 28 shows an example of an operation method based on a steering controller and a commander controller. FIG. 29 stows an example of an operation method based on a gesture and a steering controller; FIG. 30 shows a configuration diagram of an in-vehicle device in the fifth embodiment of the present invention. FIG. 31 shows an exterior example of the cockpit. FIG. 32 shows an example of the gesture detection region and the user's hand motion. FIG. 33 shows an example of the gesture detection region and the user's hand motion. FIG. 34 shows a differentiation method of the gesture operation according to the steering angle and a display example of the display unit. FIG. 36 shows an example of the operational flow. FIG. 36(a) shows an example of steering angles in the steering operation. FIG. 36(b) shows an example of the enablement/disablement determination of the gesture operation according to the steering angle. FIG. 37 shows an example of the operational flow. FIG. 36(a) shows an example of steering angles and angular velocity in the steering operation. FIG. 38(b) shows an example of the enablement/disablement determination of the gesture operation according to the steering amount. FIG. 39 shows an example of the gesture operation method according to the rotating direction of the steering wheel. FIG. 40 shows a table illustrating the control method of the gesture operation according to the rotating direction of the steering wheel. FIG. 41 shows an example of the operational flow. FIG. 42 shows an example illustrating the relationship of the steering wheel and the gesture detection region. DESCRIPTION OF EMBODIMENTS Embodiments of the present invention are now explained in detail with reference to the appended drawings. First Embodiment <<Explanation of Configurations>> FIG. 1 is a configuration diagram of an in-vehicle device 101 in the first embodiment An in-vehicle device control unit 102 is the part, that controls the overall operation of the in-vehicle device 101 and realizes the functions as a messenger application 113 and an output information control unit 114 by performing operations according to programs related to the messenger application 113 and the output information control unit 114 stored in a storage unit 123. Note that, the in-vehicle device 101 may also be loaded with applications other than the messenger application 113 and the output information control unit 114, and these programs may also be stored in the storage unit 123 at the time of factory shipment, or may be stored in the storage unit 123 selected by the user via a communication unit 107, or via an externally connected IF (not shown) such as a USB terminal. Moreover, the in-vehicle device control unit 102 controls the basso operation as a car navigation system, and additionally controls the contents to be output based on the various types of input information. A sensing unit 103 is the pad that detects the distance between the user's hand and a sensor, and detects the waving of the user's hand, and is configured, for example, from a sensor such as an infrared distance sensor, a laser distance sensor, an ultrasonic distance sensor, a distance image sensor, an electrolytic sensor, or an image sensor, a microcomputer which performs data processing, and software that, runs on the microcomputer. There is no particular limitation regarding the sensors to be used in the sensing unit 103, and any sensor may be used so as long as it has a function of being able to obtain a signal for detecting the distance to the user's hand and detecting the waving of the user's hand. Based on the sensor data obtained from the sensing unit 103, a gesture detection unit 104 detects whether the user placed one's hand at a certain position, or whether a predetermined gesture (for instance, hand waving motion in a vertical/horizontal direction) was performed. For example, the user's hand placement is detected by analyzing whether a predetermined sensor value has continued for a given length of time, and the gesture operation is detected by analyzing the difference between the response times of the hand detection results between a plurality of sensors. A switch operation unit 105 is a hardware switch for operating the in-vehicle device 101, and may be a button-pressing type, or a jog-dial type. A touch operation unit 106 sends the touched coordinates to the in-vehicle device control unit 102, and operates the in-vehicle device 101. A microphone 115 acquires sounds within the vehicle. A voice recognition unit 118 converts the speech from the input sound data into a text code string. A communication unit 107 is connected to an outside network, and inputs/outputs various types of information. For example, the communication unit 107 inputs navigation-related information and sends/receives messages. An external switch operation unit 117 is a switch operation unit installed at a location that is different from the location of the in-vehicle device 101, and considered may be a steering switch mounted near the steering wheel, or a commander switch mounted on the center console of the vehicle. A display unit 108 is a device for presenting video information to the user, and, for instance, is a device comprising a display device such as an LCD (Liquid Crystal Display), and an arithmetic processing device and a memory which are required for the display processing of video contents and GUI (Graphical User interface). An external display unit 109 is a display installed at a location within the vehicle that is different from the location of the in-vehicle device 101. For example, the external display unit 109 may be a head up display (HUD) mounted at the anterior of the driver's seat. An HUD can display various types of information while allowing the scenery ahead of the driver (user) to pass therethrough. A sound output unit 110 is the part that outputs sounds or voices. A speaker 111 outputs sound from tine sound output unit 110. A tactile IF output unit 112 is the part that conveys some type of tactile information to the user, and, for instance, is configured from an ultrasonic array formed from a plurality of ultrasonic elements, and conveys the spatial pressure to an arbitrary distance of the device. Otherwise, an air blower may be provided to yield the same effect. Moreover, the tactile IF output unit 112 may also be configured from an oscillator mounted near the steering wheel to cause the entire steering wheel to vibrate, and there is no particular limitation regarding the constituent elements. A messenger application 113 sends and receives messages to and from the communication unit 107, stores the input messages, and outputs such messages. Moreover, when sending a message, the messenger application 113 sends the outbound message to the communication unit 107. An output information control unit 114 controls the contents to be output to the display unit 108 or the external display unit 109. FIG. 2(a) shows an installation example of the sensing unit 103. The sensing unit 103 is mounted on the driver's side in a right-side steering wheel vehicle relative to the display unit 108, and can detect the distance information of an object from the spot of the sensor element, and the movement of the object. Consequently, as shown in the lower diagram of FIG. 2(a), the space between the vehicle device 101 and the user is divided into a plurality of areas, and in which region the user's hand exists can be detected in detail. As shown in the lower diagram, the space is divided into a region 201 that is close to the sensor position, and a region 202 that is even closer to the sensor position. Note that the number of sensor elements, installation position, and areas to be detected are not limited to this example. <<Main Operational Flow>> The operation of the in-vehicle device 101 is now explained in detail with reference to the operation flow shown in FIG. 3(a). Note that, when the messenger application 113 is to output videos or voices to output units such as the display unit 108, the external display unit 109, and the speaker ill, the messenger application 113 sends video or voice information to the output information control unit 114, and the output information control unit 114 determines whether or not to output the received information to the foregoing output units. However, in order to simplify the ensuing explanation, expressions such as “the messenger application 113 outputs videos to the display unit 108” and “the messenger application 113 outputs voices” will be used. Foremost, the operation of the in-vehicle device 1 is started when the engine of the vehicle is started. The operation of the output information control unit 114 displays a navigation screen and an icon 401 of the messenger application 113 on the display unit 108 (center display in this example) as shown in FIG. 4(a) when the operation is started. The messenger application 113 is executed in the background by the in-vehicle device control unit 102 together with the activation of the in-vehicle device 101 and is activated by the output information control unit 114 when the touch operation unit 108 detects a touch operation of touching the icon 401, or the gesture detection unit 104 detects the user's predetermined gesture operation (for instance, hand waving in the leftward direction in front of the sensor). Moreover, the output information control unit 114 displays a navigation screen and a screen related to the messenger application 113 on the external display unit 109 (HUD in this example) when the operation is started. When a message is received from the outside via the communication unit 107 (S301), the messenger application 113 outputs a sound affect to notify an incoming message, displays the total number of received messages on the external display unit 109 as shown with an icon 402 of FIG. 4(b), and notifies the user that the number of unread messages has increased. When the gesture detection unit 104, the voice recognition unit 118, the switch operation unit 105, the external switch operation unit 117, or the touch operation unit 108 subsequently detects that the user performed an operation for activating the messenger application 113 (S303), the output information control unit 114 switches the display to a screen for using the application by activating the messenger application 113 as shown in FIG. 4(c) (S304). The messenger application 113 thereafter outputs voice information which reads the received messages in order from the oldest message (S305). FIG. 4(c) is a display example when using the half screen of the display unit 108 as the screen of the messenger application 113. When the touch operation unit 106 detects that the user touched a region of an icon 403 on FIG. 4(c), the messenger application 113 causes the display unit 106 to display a screen for performing the respective operations of stamp reply, fixed phrase reply, free speech reply, and message return/forward from the left side of the region of the icon 403. Moreover, while the voice information of S305 is being output, the messenger application 113 causes the external display unit 109 to display the current number of unread messages as with an icon 404 in the lower diagram of FIG. 4(c), and the name of the sender of the message that is being read. When the gesture detection unit 104 detects that the user performed a predetermined gesture operation (for instance, hand waving motion in an upward or downward direction) while the message is being read (S308: Yes), the messenger application 113 causes the speaker 111 to output voice information so that the latest message among the spread messages is read (S308). When no such gesture operation is detected, the messenger application 113 continues to output the voice information so that the unread messages are read in order from the oldest message (S307), and, when the reading of the latest message is finished, enters a reply operation standby state while causing the display unit 108 and the external display unit 109 to continue displaying the last sender as shown in FIG. 4(d) (S309). In the reply operation standby state, the messenger application 113 displays an icon 501, which indicates that a gesture-based reply operation can be performed, on the external display unit 109 as shown in FIG. 5(a). When a given length of time (for instance, 0.5 seconds) has elapsed in a state where the user's hand is placed in the region 202 of FIG. 2(a) (S310: Yes), it is determined that, the conditions for starting the operation have been satisfied, and the external display unit 109 switches its screen such that the menu as the operation guide of the reply operation will be displayed in a manner of sliding from the right side of the screen, and a sound effect to notify the appearance of the menu is also output (S311). Note that, when the user's hand is detected in the region 202, the messenger application 113 may also output a sound effect for allowing the user to aurally recognize such detection, and move the icon 501 to the right side or change the color of the icon as shown in FIG. 5(b) for allowing the user to also visually recognize such detection. Moreover, when the user's hand is defected in the region 201 and not in the region 202 and a given length of time (for instance, 0.3 seconds) has elapsed, the messenger application 113 outputs a sound effect to notify the user that the hand placement position is erroneous. Upon placing one's hand, the user can perform hand placement operations while looking ahead without having to shift one's line of sight to his/her hand. FIG. 2(b) and FIG. 2(c) are diagrams showing in detail the relation of the detection state of the user's hand and the output of sound effects. FIG. 2(b) and FIG. 2(c) respectively represent the time axis and the sensor value of the sensing unit 103, and show the boundary for determining whether the sensor value falls within the region 201 or the region 202. FIG. 2(b) shows an example where the user stretches one's hand toward the region 202, and places one's hand in the region 202 for a given length of time. When the gesture detection unit 104 detects that the user's hand entered the region 201, the gesture detection unit 104 outputs a sound effect 1. Next, when the gesture detection unit 104 detects that the user's hand entered the region 202, the gesture detection unit 104 outputs a sound effect 2. When the gesture detection unit 104 continues to detect that the user's hand is in the region 202 for a time T1 or longer (for instance, for 0.6 seconds or longer), the gesture detection unit 104 outputs a sound effect 3, and switches the screen of the external display unit 109 as explained with reference to S311. FIG. 2(c) shows an example where the user continues to place one's hand in the reason 201. The gesture detection unit 104 outputs the sound effect 1 upon detecting that the user's hand entered the region 201, and outputs a sound effect 4 upon detecting that the user's hand is in the region 201 for a time 12 or longer (for instance, for 0.3 seconds or longer). If the user's hand is subsequently detected in the region 202, the same process as the example of FIG. 2(b) is performed in the ensuing explanation, the operation of placing one's hand in the region 202 for the time T1 or longer is sometimes simply referred to as “hand placement”. FIG. 5(c) shows an example of a case where an operation menu, which enables the user to perform a stamp reply, is displayed. The icon 502 is an operation guide which means that, when the user performs a gesture in the upward, leftward or downward direction while placing one's hand over the icon 502, the corresponding stamp can be selected. Moreover, the display of ½ at the upper left corner refers to the total number of pages of the displayed stamp candidates, and the current page. When a gesture in the upward, leftward or downward direction is detected in this state (S312: Yes), the messenger application 113 selects the stamp corresponding to that direction and sends a reply (S313), and then once again makes a transition to the reply operation standby state S309. When no gesture detected and the user's hand leaves the region 202 (S312: No. S314: Yes), the displayed contents of the external display unit 109 are switched to the displayed contents shown in FIG. 5(d) (S315). The icon 503 represents the stamp candidates that can currently be selected. The icon 504 represents that the corresponding operation will be performed when the gesture operation corresponding to the displayed direction (upward hand waving or downward hand waving) is performed. Moreover, the display of “fixed phrase” means switching the reply method to a fixed phrase reply, and the display of “next page” means switching the stamp candidates from those displayed with the icon 503 to the next candidate group. If numerous options are displayed at once, the user will spend too much time selecting the option despite the user driving a vehicle, and may lead to the user's lack of concentration in driving the vehicle. Thus, in the first embodiment, only the 3 options positioned at the top, left and bottom are provided, and, by providing gestures for increasing the options of the stamp to be sent more than 3 options can be provided to the user. When a corresponding gesture operation is detected (S316: Yes), a corresponding operation is executed (S317). When a gesture is not detected (S316: No) and the placement of the user's hand in the region 202 is detected (S318: Yes), the messenger application 113 makes a transition to the state of S311, and once again enters the stamp selection state. When the user's hand is not detected and a given period of time (for instance, 10 seconds) elapses in that state (S318: No, S319: Yes), the messenger application 113 erases the operation guide from the screen of the external display unit 109, and makes a transition to the reply operation standby state of S309 (S320). When a reply is sent, as shown in FIG. 8, the messenger application 113 displays the contents of the reply operation result (selected stamp in this example) on the display unit 108, displays the name of the user who sent the reply on the external display unit 109, and reads the reply message, Note that, this operation flow is an explanation of a representative example of the operation of the in-vehicle device 101 of the present invention, and the operation, display, and sound effect are not limited to this example. For example, while the foregoing explanation was provided by assuming the sending of a reply when using the messenger application 113, the present invention is not limited thereto, and can be applied to the overall operation of the in-vehicle device control unit 102 of selecting a plurality of options. FIG. 3(b) shows a simplified version of the operation flow. The basic operation is as explained above, and, while the explanation of the operation in each step is the same as those with the same step number of FIG. 3(a), S316 of FIG. 3(b) does not have to be limited to vertical hand waving, and may also accept various operations, such as the operation using a steering switch. Moreover, when a message is received from the outside, the configuration may also be such that the message is read at the same time that the message is received, or the contents of the received message may be displayed on the external display unit 109. Consequently, it will be easier for the user to comprehend the message. Moreover, the configuration may also be such that the reply operation standby can be accepted at any time without waiting for the reading of the latest message to be finished. Consequently, the user may send a reply at any time. Moreover, with regard to the region 202 where the user's hand is to be placed, the configuration may be such that the tactile sensation is presented in midair in such region by the tactile IF unit 112. For example, the configuration may be such that the pressure points of an ultrasonic device array appear on the boundary of the areas, or a tactile sensation is given on the vertical line of the region using an air blower. Consequently, the user can place one's hand in the region while looking straight ahead, and can send a reply safely even though such operation is performed while driving. Moreover, while the transition is made to the stamp reply operation after the user's hand placement is detected in this example, the configuration may also be such that the transition is made to the reply method selection state (stamp, fixed phrase, free speech or the like) before the foregoing transition. Consequently, the user can select one's preferred reply method at the time that the reply operation is started. Moreover, while the user's gesture is accepted after the user's hand placement is detected and the operation guide is displayed on the external display unit 109 in this example, the user's gesture may also be accepted from a given length of time before (for instance, 0.2 seconds before) displaying the operation guide. Consequently, once the user becomes familiar with the operation and learns which gesture corresponds to which operation, the operation can be performed without having to display unnecessary screens on the external display unit 109, and the operation time can also be shortened. Moreover, in S319, while the lapse of a given length of time was measured, the configuration may also be such that the process proceeds to S320 upon detecting a predetermined operation (for instance, hand waving motion in the left direction, switch operation, or the like) prior to satisfying the foregoing condition. Consequently, the user can switch the display of the externa; display unit 109 to a navigation screen at one's desired timing. Moreover, the operation guide displayed on the external display unit 109 and the gesture direction are not limited to 3 directions, and arbitrary directions and number of directions may be used. Here, directions in which the gesture operation can be easily performed white sitting in the driver's seat may be set. For example, if the user's gesture is made in the direction of the steering wheel, the user's hand may hit the steering wheel while driving the vehicle and, therefore, a gesture in such direction is excluded as an option. Thus, the configuration may be such that whether the steering wheel of the vehicle to be driven is a right-side steering wheel or a left-side steering wheel can be set in advance using the setting screen and, when the steering wheel is a left-side steering wheel the operation guide displayed on the external display unit 109 indicates the 3 directions of upward, downward and rightward as shown in FIG. 7(a) and FIG. 7(b). Note that FIG. 7(a) and FIG. 7(b) correspond to FIG. 5(c) and FIG. Moreover, because the hand to be used for the gesture will change depending on the location where the steering wheel is mounted, the display and direction of the icons are also changed. Furthermore, because the visibility of the various icons will change depending on the position of the steering wheel, the use may also individually change the setting. Consequently, the user can perform operations based on gestures that, can be easily performed according to the steering wheel installation position for each vehicle model, and the user can effortlessly perform various operations based on gestures while sitting in the driver's seat. Moreover, the configuration may also be such that the placement of the user's hand can be performed at a plurality of locations, without liming the hand placement position to one location as in this example. For example, as shown in FIG. 8(a), three sensors are installed at three locations. Here, the reply method may be decided depending on which sensor defected the user's hand placement. As shown in FIG. 8(b) a stamp reply is sent when the sensor 103A detects the user's hand placement a fixed phrase reply is sent when the sensor 103B detects the user's hand placement, and a free speech reply is sent when the sensor 103C detects the user's hand placement. Consequently, the user can quickly select the reply method and perform the reply operation. The user may also designate in advance which sensor corresponds to which method. Moreover, the configuration may also be such that a camera is used for the sensing unit 103 as shown in FIG. 9 to detect the approach and gesture of the user's hand. The images of predetermined hand shapes are learned in advance, and the user's hand placement is detected from the pattern recognition of the learned data, irrespective of the distance and position of the user's hand. Here, a plurality of hand shapes may be detected during the user's hand placement (901A to 903C), and the reply method may thereby be selected. Consequently, the user will be able to start the reply operation by reaching out one's hand in front of the sensing unit 103 without having to perform any gesture operation. Furthermore, the configuration may also be such that the direction and number of gestures to be accepted are changed according to the position and posture of the user's hand upon detecting the users hand placement. For example, as shown in FIG. 10(a), in a state where the user's placing one's elbow on an elbow rest and raising one's hand, when the user's hand placement is detected, gestures in the leftward, downward and rightward directions are recognized as shown in FIG. 10(b). This is because, in the user's posture described above, it would be difficult for the user to make a gesture in the upward direction and, therefore, gestures in the 3 directions of leftward, downward and rightward are recognized. Furthermore, the configuration may also be such that the user can set in advance which gestures am to be recognized. Consequently, the user can perform gesture operations based on unrestricted postures. Moreover, while the operation menu of the reply operation is displayed on the external display unit 109 in this example, the configuration may also be such that the location of display and the displayed contents are changed according to the connection status or the installation position of the various devices. For example, when the HUD is not connected, the gesture operation guide is displayed at the center of the screen as shown in FIG. 11(a). Here, as shown in FIG. 11(b), the processing of managing the installation position and the connection status of a plurality of displays and deciding the priority is performed. While the basic rule is to display the operation guide on the display with the highest priority, in cases where the HUD cannot be used due to a malfunction or other reasons, the operation guide is displayed on the display of the next highest priority. Here, the time of displaying the guide may be shortened or the amount of information to be displayed may be reduced according to the priority. The priority may be set based on various methods; for instance, the priority may be set at the time of factory shipment or time of sales, set by the user with a setting semen (not shown), or programmed in the in-vehicle terminal so that the priority is determined from the characteristics of the display that is connected to the in-vehicle terminal. Furthermore, when a carry-in external device (smartphone or the like) is connected to the in-vehicle device 101 as shown in FIG. 11(c), the configuration may also be such that the priority is increased according to the installation position. Consequently, when a device such as the HUD to display the operation guide cannot be used, the operation guide can be displayed on a substitute device to enable the user to perform operations. Moreover, in the reply operation of S311 onward in FIG. 3(a) or FIG. 3(b), the configuration may also be such that other operation means (voice recognition operation, switch operation or the like) capable of operating the in-vehicle device 101 may also be used without limitation to the gesture operation. FIG. 12(a) shows the operation flow in the foregoing case. After the step of S318, when a preparatory movement of the user attempting to perform certain operation means is detected (S1201: Yes); the operation guide corresponding to such operation is displayed on the external display unit 109 (S1202). Subsequently, when the selected operations executed (S1203: Yes), a reply based on the selected option is performed (S1204). Specifically, upon making a transition to the state of S315, the operation guide as shown in FIG. 12(b) is displayed on the external display unit 108. An icon 1201 shows that the upper icon can be used for selecting the option of gesture, the middle icon can be used for selecting the option of voice recognition, and the lower icon can be used for selecting the option of switch, respectively. When it is detected that the user will perform a steering controller operation (for instance, an arbitrary button of the steering switch is pressed once, or a contact sensor is mounted on the switch surface and a response thereof is obtained), the display switches to the screen as shown in FIG. 12(c). The icon 1201 notifies the user that the steering controller operation is active by changing the color of the icon. The display 1202 shows the candidates of stamps corresponding to the respective buttons of the steering controller. A reply operation based on the corresponding stamp is performed according to the pressed button of the steering controller. Note that the display returns to the screen of FIG. 12(b) when a given length of time elapses, or the contact sensor of the steering controller is no longer responding. Meanwhile, when it is detected that the user will perform voice recognition (for instance, a voice recognition start switch is pressed), the display switches to the screen as shown in FIG. 12(d). The icon 1201 shows that the voice recognition is in a standby state, and the display 1203 shows that, by speaking words corresponding to the respective messages, the corresponding stamp can be selected. When the result of voice recognition coincides with one of the options, a reply operation of the corresponding stamp is performed. In the example of FIG. 12(d), while only messages such as “I'm having fun” corresponding to the icon are displayed, the icon to be sent may also be displayed alongside the message so that user can know, at a glance, which icon will be sent. When voice recognition is used, because the user can select the stamp to be sent without removing one's hand from the steering wheel this will further contribute to safe driving. Note that the three types of operation means can be switched even midway during their operations if a start trigger of the respective operations is detected. Moreover, in an operation state based on switch operation and voice recognition, a gesture operation based on a vertical hand waving in such state is also accepted Consequently, when the user is to send a reply, the user is not limited to a single operation means, and may freely select the operation means for performing the reply operation according to the driving status, or according to the user's preference. Moreover, upon switching the respective operation means, by presenting to the user which operation means is currently operable and how to perform such operation, the user can quickly perform the operation intuitively without any hesitation. Moreover, the configuration may also be such that the operation contents that can be pet-formed when the user places one's hand are changed according to the operation status of the application being controlled by the in-vehicle device 101. FIG. 12(e) shows an example of presenting, as navigation-related operations as the available choices, the route setting to the user's home, registration of the current location, and voice-based setting of the destination, when the application running in the background is only a navigation application FIG. 12(f) shows an example of presenting, as available choices, the operation of stopping the music, skipping to the next song, or skipping to the previous song when the user places one's hand during music playback. FIG. 12(g) shows an example of presenting, as available choices, the operation of listening to the details of traffic jam information, rerouting to the destination, or changing the destination when the user places one's hand upon receiving traffic jam information or the like. Consequently, the user can quickly select various operations according to the status of application being controlled by the in-vehicle device 101 while the user is driving the vehicle. Based on the in-vehicle device 101 according to the first embodiment of the present invention described above, the user can, intuitively and quickly, perform operations while looking straight ahead even while diving the vehicle. Specifically, the user can quickly switch the display of the messenger application and perform the operation of skipping message while looking straight ahead. Moreover, in cases of operations of selecting a plurality of options, the user can select one's intended option while looking straight ahead and confirming the contents of the available choices Furthermore, once the user becomes familiar with the operations, the user will be able to select the options without having to view the display, and the user will be able to perform operations more safely and quickly. Second Embodiment <<Explanation of Configurations>> FIG. 13 is a configuration diagram of the in-vehicle device 101 in this embodiment. In comparison to the configuration diagram of FIG. 1, a vehicle information input unit 118, an operation means control unit 119, a driving load estimation unit 120, and a map DB (database) 121 have been added. The vehicle information input unit 118, the operation means control unit 119, and the driving toad estimation unit 120 exhibit the functions as the vehicle information input unit 118, the operation means control unit 119, and the driving load estimation unit 120 as a result of the in-vehicle device control unit 102 performing operations according to the programs stored in the storage unit 123. The vehicle information input unit 118 is the part that acquires information related to the vehicle that is being driven, and, for instance, is connected to the vehicle via a CAN (Control Area Network), and acquires information related to vehicle speed, accelerator position, brake position, turn signal, and steering angle. The operation means control unit 119 controls to which operation the operation input from the gesture detection unit 104 or the voice recognition unit 118, or the various switch operation units should be reflected. The driving load estimation unit 120 estimates the user's driving load in the driving operation. For example, in addition to the various input signals from the vehicle information input unit 118 described above, the driving load estimation unit 120 integrates information input from the communication unit 107 (map information, type of road that the vehicle is traveling on, distance to preceding vehicle, and so on), and defines the driving load level as four stages (None, Low, Medium, High). “None” is a state where the vehicle is wasting at a traffic light or the vehicle is on autopilot and being driven based on ACC (Adaptive Cruise Control) or the like where the driver is not required to perform any special operation, “Low” is a state where the vehicle is being driven on a straight road with no obstacles in the periphery, “Medium” is a state where the vehicle is being driven at a certain speed or faster and a steering wheel operation is constantly required, or a state of making a turn at an intersection, and “High” is a state where the user is required to perform an important driving operation to avoid an accident. The map DB 121 is a database which stores map information. <<Explanation of Operation>> The operation of the in-vehicle device 101 of the second embodiment is now explained in detail. The basic operation is the same as the operation explained in the first embodiment, but the second embodiment is unique in that the operation is controlled according to the output of the driving load estimation unit 120. The in-vehicle device control unit 102 has defined in advance the driving load level output from the driving load estimation unit 120 and the displayed contents that can be presented as the operation means that can be operated at the respective driving load levels. FIG. 14(a) to FIG. 14(d) show the foregoing definitions. FIG. 14(a) shows whether or not the respective operation means can be used in the respective driving load levels When the driving load level is “None” or “Low”, all operation means described in the first embodiment can be used for sending a reply. Meanwhile, when the driving load level is “High”, all operations are prohibited. When the driving load is “Medium”, the display of the hand placement operation guide and the subsequent selection of options based on a gesture operation are prohibited. Because a hand placement, operation is an operation means that forces the user to perform one-handed driving, this operation is prohibited in circumstances where the user should concentrate on the driving operation. The external display unit 109 of the second embodiment displays the current driving load level as shown with the icon 1503 of FIG. 15(a). FIG. 15(a) shows that the driving load level is “Medium”, and a display showing that the hand placement operation is prohibited, as shown with the icon 1501, is indicated to notify the user that an operation using one's hand cannot be performed. Moreover, then the user's hand placement is detected in this state, the display or color of the icon 1501 is changed. and a warning sound or warning message is output, to emphases the fact that no hand placement operation may be performed, and to urge the user to immediately stop his/her hand placement. By performing the foregoing control the user can comprehend the current driving load status, and it is possible to prevent, as much as possible, the user from removing one's hand from the steering wheel for a long time as a result of attempting to display the operation guide even though the user is required to perform the steering wheel operation. Meanwhile, free speech reply based on voice recognition that does not require the use of a hand and a direct gesture that can be completed with an instant operation can be used even when the driving load level is “Medium”. Furthermore, in cases where the reply operation after the user's hand placement in a state where the driving load level is “None” or “Low” is still being performed, if the driving load level switches to “Medium”, the selected operation of options based on switch operation and voice recognition is permitted only for the foregoing reply operation that is still being performed. Here, FIG. 15(b) shows that, among the icons of the three types of operation means, the selected operation based on hand placement and gesture is prohibited. FIG. 14(b) shows the definitions related to the driving load level and the output contents of the center display. Foremost, when the driving load level is “None”, the messenger application 113 displays the entire text of the message. Moreover, when the user is sending a reply based on basic operations such as touching the operation Icon on the screen, all options such as the stamp candidates are also displayed When the driving load is “Low” or “Medium”, the text of the message is not displayed, and only the name of the sender of the message is displayed. Moreover, the operation system using a touch operation is also not displayed. Furthermore, when the driving load is “High”, the screen of the messenger application 113 is also turned off and a warning message corresponding to the situation (for instance, “Keep distance”) is displayed. Note that, in cases where the driving load is “Low” or “Medium” and the user is sending a reply based on hand placement, if the driving load level switches to “None” midway during the foregoing operation, the user may also perform such operation based on a touch operation on the center display in consideration of the status of the operation guide displayed on the HUD. For example, as shown in FIG. 16(a), in a state where the user is performing a stamp reply on the HUD, information of the contents and arrangement of the stamp candidates is maintained and additionally displayed on the center display as shown in FIG. 16(b). Specifically, in a state where the contents of the stamp candidates 1601 and the arrangement thereof on the screen of the HUD are maintained, the stamp candidates are displayed on the center display as shown with reference numeral 1602 Furthermore, the contents of 1602 are arranged on the driver's side so that it would be easier for the driver to perform operations, and select the stamp to be sent based on a touch operation. Moreover, the remaining stamp candidates are arranged on the screen at a position that is far from the driver's side as shown with 1803. Contrarily, in cases where the user is performing operations on the center display while the vehicle is stopped, if the driving load switches to “Low” or “Medium” as a result of the user starting the vehicle, the display of options and the selected operation on the center display are discontinued, and, while maintaining the reply method that was still being operated, the process proceeds to the step of S315 of FIG. 3(a), and the operation is succeeded as is. FIG. 14(c) shows the definitions related to the driving load level and the output contents of the HUD. Foremost, when the driving load level is “None” or “Low”, the name of the sender is displayed when the message is being read, and the operation guide when sending a reply is displayed. When the driving load level is “Medium”, a message to the effect that a hand placement operation is prohibited is displayed, or the screen of the operation is maintained and displayed only when the driving load level changes from “Low” to “Medium”. When the driving load level is “High”, a warning message corresponding to the situation (for instance, “Keep distance!”) is displayed. FIG. 14(d) shows the definitions related to the driving load level and the sound output from the speaker. When the driving load level is “None” to “Medium”, the operation sound or the reading voice at such time is output. When the driving load level is “High”, only a warning sound is output. Note that, even when a message is being read, the output thereof is stopped. The stopped message that was being read is resumed and once again read from the beginning once the driving load level becomes lower. Note that the configuration may also be such that the user's hand placement detection algorithm and the feedback method are changed according to the driving load level. For example, when the driving load level is “Low” and the hand placement is detected when the user places one's hand for 0.6 seconds or longer, in cases where the driving load level is “None”, the setting is changed such that the hand placement is detected when the user places one's hand for 2 seconds or longer. Furthermore, when the driving load level is “None”, the feedback of hand placement based on a sound output is discontinued. Consequently, the hand placement detection algorithm which was devised so that the user can perform operations quickly and while looking straight ahead while driving can prevent erroneous detection based on operations other than hand placement operations, such as touch operations, by giving consideration to the fact that touch operations and taking one's eyes off the road are permitted while the vehicle is stopped. As described above, based on the in-vehicle device 101 according to the second embodiment of the present invention, in addition to the user being able to intuitively and quickly perform operations while looking straight ahead even white driving the vehicle, the user can perform operations based on various means and receive more information when the user has much leeway such as when the vehicle is stopped, and the user can perform safe driving by preventing the user from focusing on other operations other than the driving operation in situations where the user should be concentrating on the driving operation. Note that, while all of the embodiments explain the case of applying the present invention to an in-vehicle device, the present invention is not limited thereto, and may also be applied to devices such as a personal computer, digital signage, construction machinery, aircraft, or monitoring operator device that comprise a display unit and an operation means. Third Embodiment <<Explanation of Configuration>> FIG. 17 is a configuration diagram of the in-vehicle device 101 in the third embodiment. In comparison to the configuration diagram of FIG. 1, an operation menu application 1701, a display output unit 1702, a steering controller 1703, a steering contact detection unit 1704, a commander controller 1705, and a commander contact detection unit 1706 have been added. The operation menu application 1701 is software for displaying an operation menu on the display unit 108 and the external display unit 109 according to the programs stored in the storage unit 123. The display output unit 1702 has a function of outputting video signals to the display unit 108 in cases where a display device that is not built into the in-vehicle device 101 is used as the display unit 108. The steering controller 1703 is a switch part that is mounted on the steering wheel, and is used by the user for inputting operations. Moreover, the steering contact detection unit 1704 detects whether the user's hand has come into contact with the switch pad of the steering controller 1703. The commander controller 1705 is a switch part that is mounted on the in-vehicle instrument panel or center console, and is used by the user for inputting operations. Moreover, the commander contact detection unit 1706 detects whether the user's hand has come into contact with the switch part, of the commander controller 1705. FIG. 18 shows the appearance of a cockpit in the third embodiment. The display unit 108 is mounted at the center of the instrument panel, and touch operations can be performed with the touch operation unit 108. Moreover, a sensing unit 103 for detecting gestures is provided at the upper right part of the display unit 108. The external display unit 109 is configured from an HUD, and can display various types of information while allowing the scenery ahead of the driver (user) to pass therethrough. The steering controller 1703 is provided in the steering wheel. Moreover, the commander controller 1705 is provided on the center console. <<Explanation of Operation>> The operation of the in-vehicle device 101 of the third embodiment is now explained. The basic operation is the same as the operation explained in the first embodiment, but the third embodiment is unique in that the displayed contents of the display unit 103 and the external display unit 109 are changed based on the hand waving in the upward direction and the downward direction relative to the sensing unit 103, and that the shape of the operation menu and operation guide displayed on the external display unit 109 is changed according to the hand motion that is detected by the sensing unit 103. FIG. 19 shows a state where the displayed contents of the display unit 108 and the external display unit 109 are changed based on the hand waving in the upward direction and the downward direction relative to the sensing unit 103. The respective screens of (A), (B) and (C) of FIG. 19 represent the display in the screen mode controlled by the operation menu application 1701, and (A) shows an audio operation mode, (B) shows a navigation operation mode, and (C) shows an air-conditioning operation mode. Each time the user wave's one hand in the upward direction once, the screen of the display unit 108 and the external display unit 109 switches from (A) to (B), from (B) to (C) and from (C) to (A) of FIG. 19. FIG. 20 shows a state where the user is performing operations based on gestures and the steering controller 1703 in the (B) navigation operation mode. As shown in (i) of FIG. 20, when the user place's one hand over the sensing unit 103, the gesture operation menu 2001 is displayed on the external display unit 109, and, by moving one's hand in one direction among upward, downward and leftward from the hand placement position, the user can select the item corresponding to that direction. Meanwhile, in (i) of FIG. 20, when the user returns one's hand to the steering wheel from the state of hand placement, the steering controller operation menu 2002 is displayed as shown in (ii) of FIG. 20. In the state shown in (ii) of FIG. 20, by pressing one switch among the top switch, middle switch and bottom switch of the steering controller 1703, the user can select the item corresponding to the pressed switch Note that, in the state shown in (ii) of FIG. 20, if the user once again places one's hand over the sensing unit 103 without pressing any switch, the screen returns to the stat shown in (i) of FIG. 20. FIG. 21, FIG. 22, and FIG. 23 show the screen transition of the external display unit 109 in the series of operations explained with reference to FIG. 19 and FIG. 20. FIG. 21 shows the screen transition of the (B) navigation operation mode, FIG. 22 shews the screen transition of the (A) audio operation mode, and FIG. 23 shows the screen transition of the (C) air-conditioning operation mode. FIG. 24 shows the detailed movement in the screen of the external display unit 109 in the (B) navigation operation mode. As described above, when the user place's one's hand over the sensing unit 103 in the (B) navigation operation mode, the gesture operation menu 2001 is displayed on the external display unit 109. Here, when the user moves one's hand in the upward direction from the hand placement position, as shown in 2401 of FIG. 24, only the item corresponding to the upward direction is displayed for a predetermined time, and based on this display, the user can confirm that the intended item has been selected. Moreover, when a predetermined time elapses from the display of 2401, the display of the external display unit 109 returns to the state before the user's hand placement. Note that the movement is the same for the steering controller operation menu 2002. FIG. 28(a) is a table showing the correspondence of the gesture detection status and the operation device in the in-vehicle device 101 of the third embodiment. Moreover, FIG. 28(c) is a table showing the correspondence of the operation device and the display device according to a state where the vehicle is moving and a state where the vehicle is stopped. The output information control unit 114 of the third embodiment determines the operation device and the display device to be used in the operation of a predetermined menu accenting to FIG. 26(a) and FIG. 26(c). As shown in FIG. 26(a), when the user's hand is near the sensing unit 103, the output information control unit 114 determines that the user is attempting to perform an operation with a gesture. Moreover, when the user's hand is removed from the sensing unit 103, the output information control unit 114 determines that the user is attempting to perform an operation with the steering controller 1703. Note that, for vehicles that are not equipped with the steering controller 1703, the output information control unit 114 may determine that the user is attempting to perform an operation with another operation device such as a commander controller 1705 that is equipped in the vehicle. Based on the foregoing determination, the output information control unit 114 instructs the operation menu application 1701 to output a predetermined screen. It is thereby possible to display the operation menu and operation guide that are suitable for the operation device to be operated by the user, and an effect is yielded in that the user can smoothly perform operations using the intended operation device. Moreover, as shown in FIG. 26(c), when the output information control unit 114 determines that the user is attempting to perform operations by using gestures, the steering controller 1703 and the commander controller 1705 while the vehicle is moving, the output information control unit 114 displays the operation menu on the external display unit 109 (HUD). Consequently, because the user can visually confirm the operation menu with minimal line of sight movement from the state of visually recognizing the forward view of the vehicle, an effect is yielded in that the influence on the driving operation caused by the operation of the operation menu can be suppressed. Note that, while the vehicle is stopped, operations based on a touch panel with high operability which enables detailed operations with the user's fingertips may also be permitted. For example, as shown in FIG. 25, in a state where the steering controller operation menu 2002 is being displayed on the external display unit 109, when the user moves one's hand close to the sensing unit 103 while the vehicle is stopped, a detailed menu as shown in 2501 of FIG. 25 may be displayed on the display unit 108. and operations may be performed based on touch operation Furthermore, when the vehicle starts moving again, the display of the display unit 106 may be turned off, and the steering controller operation menu 2002 may be displayed once again on the external display unit 109. Consequently, an effect, is yielded in that the user can switch to a touch panel operation and perform operations efficiently based on a touch operation in circumstances where the driving operation will not be hindered, such as when the vehicle is stopped. In the third embodiment, while the steering controller operation menu 2002 is displayed on the external display unit 109 when the user returns one's hand to the steering wheel, the display of the steering controller operation menu 2002 may feel bothersome when the user wishes to perform the driving operation with the hand that was returned to the steering. Thus, as shown in FIG. 27, when the user returns one's hand to the steering wheel, a simplified menu in which the part where the menu is to be displayed in the external display unit 109 is reduced in size as shown in 2701 of FIG. 27 may be displayed, and the steering controller operation menu 2002 may be displayed when the steering contact detection unit 1704 detects that the user has touched the switch of the steering controller 1703. Consequently, because the steering controller operation menu 2002 is not displayed right up until the user operates the steering controller 1703, it is possible to reduce the botheration of the menu display, and also yield the effect of effectively using the display of the external display unit 109 for displaying other information required for driving. Fourth Embodiment <<Explanation of Configurations>> FIG. 28 shows the appearance of the operation of the in-vehicle device 101 in the fourth embodiment. In comparison to the external view of FIG. 20, a screen where the commander operation menu 2801 is displayed on the external display unit 109 when the user places one's hand near the commander controller 1705 has been added. Moreover, in the fourth embodiment, a camera is used as the sensing unit 103 as shown in FIG. 9. The sensing unit 103 of the fourth embodiment detects in which direction the user's hand is moving in the periphery of the sensing unit 103. Note that, so as long as it is possible to detect in which direction the user's hand is moving, the sensing unit 103 may be a sensing device other than a camera. <<Explanation of Operation>> The operation of the in-vehicle device 101 of the fourth embodiment is now explained. The basic operation is the same as the operation explained in the third embodiment, but the fourth embodiment is unique in that the displayed contents of the display unit 108 and the external display unit 109 to be displayed on the external display unit 109 am changed based on detecting in which direction the user's hand is moving in the periphery of the sensing unit 103. FIG. 28 shows a state where the user is performing operations based on gestures, the steering controller 1703 and the commander controller 1705 in the (B) navigation operation mode. As shown in (i) of FIG. 28, when the user moves one's hand in the direction of the steering while from a state of placing one's hand over the sensing unit 103, the steering controller operation menu 2002 is displayed as shown in (i) of FIG. 28. Meanwhile, when the user moves one's hand in the direction of the commander controller 1705 from a state of placing one's hand over the sensing unit 103 as shown in (ii) of FIG. 28, operation menu 2801 is displayed on the commander controller 1705 as shown (ii) of FIG. 28. In the state shown in (ii) of FIG. 28, by rotating the rotary controller once, the user can select one item in correspondence with the rotary controlled equipped in the commander controller 1705. FIG. 28(b) is a table showing the selection of the operation device according to the position and moving direction of the hand in the in-vehicle device 101 of the fourth embodiment. The output information control unit 114 of the fourth embodiment decides the operation device to be used for the operation of a predetermined menu according to FIG. 28(b). As shown in FIG. 26(b), when the user's hand is near the sensing unit 103, the output information control unit 114 determines that the user is attempting to perform an operation with a gesture. Moreover, when the user's hand moves from the sensing unit 103 in the direction or to the position of the steering controller 1703, the output information control unit 114 determines that the user is attempting to perform the operation with the steering controller 1703. Furthermore, when the user's hand moves from the sensing unit 103 in the direction or to the position of the commander controller 1705, the output information control unit 114 determines that the user is attempting to perform the operation with the commander controller 1705. Note that the steering controller 1703 and the commander controller 1706 may be other operation devices equipped in the vehicle. Based on the foregoing determination, the output information control unit 114 instructs the operation menu application 1701 to output a predetermined screen. It is thereby possible to display the operation menu and operation guide that are suitable for the operation device to be operated by the user, and an effect is yielded in that the user can smoothly perform operations using the intended operation device. Mote that, upon displaying the operation menu, the determination may also be made based on the user's finger-pointing direction detected by the sensing unit 103 rather than based on the direction or position that the user's hand moved from the sensing unit 103. For example, as shown in FIG. 29, the sensing unit 103 may detect that the user pointed one's finger to the air-conditioning operation panel 2901 in the state shown in (i) of FIG. 29, and the steering controller operation menu 2302 for air-conditioning operation may be displayed on the external display unit 109 based on the foregoing detection. Consequently, an effect is yielded in that the intended operation menu can be displayed even more smoothly without the user having to place one's hand over the sensing unit 103 even once. Fifth Embodiment <<Configuration>> FIG. 30 is a configuration diagram of the in-vehicle device 101 in the fifth embodiment. In comparison to the configuration diagrams of FIG. 13 and FIG. 17, a steering operation detection unit 3001, a driving state recognition unit 3002, and a gesture control unit 3003 have been added. The driving state recognition unit 3002 and the gesture control unit. 3003 express, as functional blocks, the functions that are realized by the programs stored in the storage unit 123 being executed by the in-vehicle device control unit 102. The steering operation detection unit 3001 detects the user's operation state of the steering wheel based on information of the steering angle acquired by the vehicle information input unit 118, and outputs the detected result to the driving state recognition unit 3002. The driving state recognition unit 3002 detects the driving state of the vehicle based on the output of the steering operation detection unit 3001. When the driving state recognition unit 3002 determines that the driving state of the vehicle is in the predetermined state described later, the driving state recognition unit 3002 outputs a gesture operation disablement instruction to the gesture control unit 3003. The gesture control unit 3003 normally outputs an input from the gesture detection unit 104 to the operation menu application 1701, and causes operations based on the gesture to be in an enabled state. Meanwhile, when the driving state recognition unit 3002 outputs a disablement instruction, the gesture control unit 3003 cancels and disables the input from the gesture detection unit 104, and causes operations based on the gesture to be in a disabled state. However, when the driving state recognition unit 3002 outputs a disablement instruction, the gesture control unit 3003 may also stop the operation of the gesture detection unit 104; that is, stop the detection of gestures by the gesture detection unit 104. FIG. 31 shows an appearance of the cockpit in this embodiment. A sensing unit 3101 for detecting gestures is provided on the left side of the steering wheel in a right-side steering wheel vehicle. As with the sensing unit 103 explained in the first to fourth embodiments, the sensing unit 3101 is the part that detects the distance between the user's hand and a sensor, and detects the waving of the user's hand. The external display unit 103 is configured as an HUD, and can display various types of information while allowing the scenery ahead of the driver (user) to pass therethrough. Moreover, the display unit 108 is mounted at the center of the instrument panel, and touch operations can be performed with the touch operation unit 106. The display unit 108 or the external display unit 109 displays contents corresponding to the gesture operation detected by the sensing unit 3101. Here, as a result of the output information control unit 114 shown in FIG. 30 instructing the operation menu application 1701 to output a predetermined screen, an operation menu related to the gesture operation is displayed on the display unit 108 or the external display unit 109. The operation menu application 1701 is software that displays an operation menu on the display unit 108 and the external display unit 109 according to the programs stored in the storage unit 123. <<Operation>> The operation of the in-vehicle device 101 of this embodiment is now explained The basic operation is the same as the operation explained in the first embodiment. In the fifth embodiment, the mounting position of the sensing unit 3101 has been changed from the sensing unit 103 shown in FIG. 2 and other diagrams, and the gesture detection region that was near the display unit 108 in the first embodiment has been changed to a position that is near the left side of the steering wheel. The fifth embodiment is unique in that the displayed contents of the display unit 108 or the external display unit 108 are changed according to the user's hand waving in the upward direction or downward direction near the left side of the steering wheel, and whether to change the operation menu and the operation guide to be displayed on the display unit 108 or the external display unit 109; that is, whether the users gesture operation should be accepted as being enabled, is controlled according to the steering angle detected by the steering operation detection unit 3001. The user is thereby able to perform the gesture operation based on a small movement near the steering wheel without having to separate one's hand far away from the steering wheel even while driving, and at the same time enablement/disablement of the gesture operation is switched according to the steering angle, confusion between the driving operation and gesture operation performed near the steering wheel can be prevented, and user-friendliness in inputting commands can be improved. While a case was explained where the steering operation detection unit 3001 defects the operation state of the steering wheel based on information such as the steering angle acquired by the vehicle information input unit 118, the present invention is not limited thereto, and the configuration may also be such that the user's steering operation, such as the steering angle or the like, is detected using a camera or a sensor. FIG. 32 and FIG. 33 are diagrams showing the gesture detection region, and the motion of the user's hand in the gesture detection region. The gesture detection region 3201 in FIG. 32 and FIG. 33 is a visualization of the region where the sensing unit 3101 detects the motion of the user's hand. As described above, in this embodiment, the gesture detection region 3201 is set near the left, side of the steering wheel, and the user performs the gesture operation using one's left hand. FIG. 32(i) shows the hand waving gesture operation of passing one's hand across the gesture detection region 3201 from top down without stopping one's hand in the gesture detection region 3201. FIG. 32(ii) shows the hand waving gesture operation of passing one's hand across the gesture detection region 3201 from bottom up without stopping one's hand in the gesture detection region 3201. In this embodiment, these two gesture operations are collectively referred to as the “direct gesture”. FIG. 33 shows a method of the gesture operation of moving one's hand after hand placement, in which the motion of one's hand is temporarily stopped in the gesture detection region 3201. In this embodiment, this operation is referred to as the “hand placement gesture”. When the user places one's hand in the gesture detection region 3201, for instance, the gesture operation menu 2001 shown in FIG. 20(e) is displayed on the external display unit 109. As shown in FIG. 33(i) to FIG. 33(iii), by the user moving one's hand in any one of the directions of up, down and left from the hand placement position, the user can select the item corresponding to that direction. For example, when the user moves one s hand downward in a state where the gesture operation menu 2001 shown in FIG. 20(i) is displayed on the external display unit 109, “Set destination” is selected. FIG. 34 is a diagram showing an operation example using the direct gesture of FIG. 32: and shows that the processing to be performed in response to the gesture operation is changed according to the angle of the steering wheel. FIG. 34(i) shows a state where the steering operation detection unit 3001 has detected that the steering wheel has hardly been turned; that is, a state where the angle 3410 is approximately zero in this state, when hand waving in the downward direction in the gesture detection region 3201 is detected, the displayed contents of the display unit 108 are changed from the audio operation mode to the air-conditioner operation mode based on the operation of the operation menu application 1701 according to the control of the output information control unit 114. FIG. 34(ii) shows a state where the angle 3411 is net zero; that is, a state where the steering wheel has been turned. When the angle of the steering wheel is a certain value or higher, the gesture control unit 3003 performs control for disabling the user's gesture operation detected by the gesture detection unit 104. Here, because the gesture operation has been disabled, the output information control unit 114 does not execute control of displaying the operation menu related to the gesture operation on the display unit 108 or the external display unit 109 as described above even when hand waving in the downward direction in the gesture detection region 3201 is detected. The displayed contents of the display unit 108 shown at the lower right of FIG. 34(ii) remain in the audio operation mode, and this indicates that the gesture operation has been disabled. (Flowchart) The operation of the in-vehicle device 101 is now explained with reference to a flowchart. FIG. 35 is a flowchart showing the operation of the in-vehicle device 101. The in-vehicle device 101 executes the program which yields the operation depicted in FIG. 35. In step S3501, the gesture detection unit 104 starts to stand by for an input from the user, and then proceeds to step S3502. In step S3502, whether the gesture detection unit 104 has detected a gesture operation is determined The routine proceeds to step S3503 when it is determined that a gesture operation has been detected, and remains at step S3502 when it is determined that a gesture operation has not been detected. Note that the term “gesture operation” used in this step refers to the direct gesture or the hand placement gesture described above. In step S3503, the driving state recognition unit 3002 determines whether the steering angle is equal to or less than a predetermined threshold based on information from the steering operation detection unit 3001 Note that this threshold is stored in the storage unit 123. The routine proceeds to step S3504 when it is determined that the steering angle is equal to or less than the threshold, and proceeds to step S3505 when it is determined that the steering angle is greater than the threshold. In step S3504, the output information control unit 114 or the operation menu application 1701 executes processing corresponding to the gesture operation detected in step S3502, and ends the program which yields the operation depicted in FIG. 35. Processing corresponding to the gesture operation is, for instance, transition of the display unit 108 or the external display unit 109 shown in FIG. 34(), or execution of the selected operation. In step S3505, the driving state recognition unit 3002 outputs a disablement instruction to the gesture control unit 3003 to disable the gesture operation, in response to this disablement instruction, the gesture control unit 3003 disables the gesture operation by disabling inputs from the gesture detection unit 104 or stopping the operation of the gesture detection unit 104 as described above. The routine thereafter returns to step S3501. For example, when the user is to perform a hand placement gesture, because the gesture operation is enabled when the steering angle is equal to or less than the threshold, the user's hand placement in the gesture detection region 3201 is foremost detected, and step S3504 is executed the first, time Here, the output information control unit 114 uses the operation menu application 1701 and displays, on the display unit 108 or the external display unit 109, the gesture operation menu showing candidates of the gesture operation corresponding to the user's hand movement after hand placement. Consequently, for instance, the gesture operation menu 2001 shown in FIG. 20(i) is displayed on the external display unit 109. When the placed hand is subsequently moved, the gesture is once again detected (S3502: YES) and step S3504 is once again executed, whereby the operation corresponding to the hand waving is executed according to the gesture operation menu displayed on the display unit 108 or the external display unit 109. Meanwhile, when the steering angle is greater than the threshold and the users hand placement in the gesture detection region 3201 is detected, step S3505 is executed and the gesture operation is disabled. Here, because step S3504 is not executed, the output information control unit 114 does not display the foregoing gesture operation menu on the display unit 108 or the external display unit 109. In other words, in the foregoing case, even when the user's hand is positioned in the gesture detection region 3201, the output information control unit 114 does not change the displayed contents of the display unit 108 or the external display unit 109. Even when the user thereafter makes a hand waving motion of moving one's placed hand, the gesture operation according to the hand waving motion is not executed. Note that, in FIG. 35, after hand waving is detected in step S3502, the gesture operation is disabled by ignoring the gesture that was previously detected in step S3505 and not reflecting the gesture recognition result in the functional operation. Nevertheless, when the steering angle is exceeding the threshold, the gesture operation may also be disabled by disabling the gesture recognition function itself without detecting hand waving with the gesture detection unit 104. The following effects are yielded according to the fifth embodiment explained above. (1) An in-vehicle device 101 comprises a gesture detection unit 104 which recognizes a user's hand position located within a predetermined gesture detection region 3201. a driving state recognition unit 3002 which detects a driving state of a vehicle, and a gesture control unit 3003 which controls a state of a gesture operation based on a recognition result of the hand position by the gesture detection unit 104. The gesture control unit 3003 disables the gesture operation when the driving state of the vehicle detected by the driving state recognition unit 3002 is in a disabling state. Because the in-vehicle device 101 is configured as described above, the gesture operation is disabled based on the driving state of the vehicle, and it is possible to improve the safety and operability of the operation of in-vehicle equipment by a driver who is driving a vehicle. (2) The in-vehicle device 101 further comprises a steering operation detection unit 3001 which defects a steering operation for diving the vehicle, and an output information control unit 114 which controls displayed contents of a display unit 108 or an external display unit 109 connected to the in-vehicle device 101. The driving state recognition unit 3002 detects a driving slate of the vehicle based on the steering operation. The disabling state is a state where a users steering operation amount, or a steering angle, detected by the steering operation detection unit 3001 exceeds a predetermined threshold, or a predetermined operation amount. When the gesture operation has been disabled, the output information control unit 114 does not change the display of the display unit 108 or the external display unit 109 even when the user's hand position is within the gesture detection region 3201. Consequently, when the steering operation amount exceeds a predetermined operation amount, the display of the display unit 108 or the external display unit 109 is not changed even when a direct gesture is performed and, therefore, the driver can visually recognize that the screen display has not been changed, and the driver's concentration will not be disturbed. (3) When the gesture operation has not been disabled, the output information control unit 114 displays, on the display unit 108 or the external display unit 109, a gesture operation menu 2001 shown in FIG. 20(i) indicating candidates of the gesture operation corresponding to the users hand movement in step S3504 when the gesture detection unit 104 detects that the users hand has been placed within the gesture detection region 3201. Meanwhile, when the gesture operation has been disabled in step S3505, the output information control unit 114 does not display the gesture operation menu 2001 on the display unit 108 or the external display unit 109, Consequently, when the steering operation amount exceeds a predetermined operation amount, the gesture operation menu is not displayed on the display unit 108 or the external display unit 109 even when a hand placement gesture is performed and, therefore, it is possible to cause the user to recognize that gesture operations are not accepted. (4) The in-vehicle device 101 further comprises a steering operation detection unit 3001 which detects a steering operation for driving the vehicle. The disabling state is a state where a user's steering operation amount detected by the steering operation detection unit 3001 exceeds a predetermined operation amount, or a predetermined operation amount. The gesture control unit 3003 disables the gesture operation by stopping operation of the gesture detection unit. 104 or disabling inputs from the gesture detection unit 104. In cases where the steering angle is exceeding the threshold, it is possible to consider that the user is turning the steering wheel to perform a driving operation. In other words, it is likely that the user is moving one s hand near the steering wheel to perform a driving operation. In the foregoing case, if gesture recognition is performed near the steering wheel the users hand motion for driving the vehicle is likely to be falsely recognized as a gesture operation Thus, by eliminating the possibility of such false recognition, it is possible to perform appropriate gesture recognition that is more in line with actual movements. (5) The steering operation amount is an angle of a steering wheel operated by a user. First Modified Example of Fifth Embodiment In the fifth embodiment described above, the driving state recognition unit 3002 evaluated the angle of the steering wheel, or the steering angle, based on the output of the steering operation detection unit 3001. Nevertheless, the operation speed of the steering wheel or the steering angle velocity, may also be evaluated. In other words, in step S3303 of FIG. 35, whether the steering angle velocity, or the operation speed of the steering wheel, is equal to or less than a predetermined threshold may be determined. According to this modified example, the following effects are yielded in addition to the effects of the fifth embodiment. (1) The steering operation amount is an operation speed of a steering wheel operated by a user. For instance, a state where the steering angle velocity is approximately zero is a state where the steering angle remains at a certain value, and it is possible to consider that, while the user is turning the steering wheel a certain amount to perform a driving operation, the operation amount of the steering wheel is small, such as in a case where the vehicle is slowly rounding a curve having a large curvature. In the foregoing case, because it is possible to consider that the user can afford to perform operations other than the driving operation irrespective of the size of the steering angle, the user can perform more gesture operations by enabling the gesture operation, and the user-friendliness can thereby be improved. Second Modified Example of Fifth Embodiment In the fifth embodiment described above, all gesture operations are uniformly disabled, or not accepted, when the steering operation amount is a predetermined threshold or higher. Nevertheless, it is also possible refrain from accepting only specific gesture operations according to the steering operation amount. FIG. 38(a) a diagram showing an example of defining the angle in the steering operation as a plurality of regions. The region between angle SA00 and angle SA01 is defined as a region 3801 as a state where the steering wheel is being fumed slightly, the region between angle SA01 and angle SA02 is defined as a region 3602; and a state in which the steering wheel is being turned greater than angle SA02 is defined as a region 3603 Note that the division of regions is not limited to the foregoing example, and the configuration may also be such that the regions are further subdivided. FIG. 36(b) is a diagram showing the correspondence of the size of the steering angle and the enablement/disablement of the gesture operation. The gesture control unit 3003 in this modified example determines, pursuant, to FIG. 38(b), the types of gesture operations to be enabled among a plurality of gesture operations in accordance with the steering angle. For example, when the steering angle is in the region 3801, the gesture control unit 3003 enables both the direct gesture shown in FIG. 32 and the hand placement gesture shown in FIG. 33. This is because, since the steering angle is small, it is possible to consider that the steering operation for driving the vehicle is not being performed much, and the hand motion made in the gesture detection region 3201 near the steering wheel is most likely being performed by the user as a gesture operation. When the steering angle is in the region 3603, the gesture control unit 3003 disables both the direct gesture and the hand placement gesture. This is because, since the steering angle is great, it is possible to consider that the user is concentrating on the steering operation for driving the vehicle, and, because it is unlikely that the user will perform a gesture operation, this disablement is intended to prevent the false recognition of a steering operation, which is being performed by the user for driving the vehicle, as a gesture operation. When the steering angle is in the region 3802, the gesture control unit 3003 enables only the direct gesture, and disables the hand placement gesture. This is a result of giving consideration to the characteristics of the hand motion in a direct gesture and a hand placement gesture. While a direct gesture is a hand waving motion that ends in a short time, a hand placement gesture requires the placement of the hand in the gesture detection region 3201 for a given period of time in order to perform the operation, and is suitably performed when not much steering operation is required for driving the vehicle and the user can afford to operate the equipment. Thus, consideration is given to the work rate required for the steering operation to drive the vehicle, and, when the work rate is high, it is determined that the performance of a hand placement gesture by the user is unlikely, and the hand placement gesture is disabled, it is thereby possible to prevent the equipment from being unintentionally operated based on a gesture operation, and this will lead to improved user-friendliness. Note that the control is not limited to the example described above, and, for instance, the configuration may be such that the determination is made only based on the region 3601 and the region 3603, or the regions made be subdivided into four or more regions. According to this modified example, the following effects are yielded in addition to the effects of the fifth embodiment. (1) The gesture control unit 3003 disables only a specific gesture operation among a plurality of gesture operations performed by a user based on the steering operation amount. Thus, it is possible to limit the gesture operations to be accepted according to the steering operation amount. (2) The driving state recognition unit 3002 increases the gesture operations to be disabled when the steering operation amount increases. Thus, it is possible to reduce the gesture operations to be accepted as the possibility that the user will perform a gesture operation is low and the possibility of falsely recognizing a steering operation for driving the vehicle as a gesture operation is high. Moreover, by integrally using the steering operation amounts recognized by the driving state recognition unit 3002 and determining whether to enable and accept the users gesture operation, it is possible to perform detailed gesture recognition processing with minimal false recognition. Sixth Embodiment <<Configuration>> The configuration of the in-vehicle device 101 in the sixth embodiment is the same as the fifth embodiment. However, the operation of the in-vehicle device control unit 102 differs from the fifth embodiment. In addition to the steering operation state output by the steering operation detection unit 3001, the driving state recognition unit 3002 recognizes the driving state based on information such as the vehicle speed and accelerator position acquired by the vehicle information input unit 118, and the turn signal based on the operation of the direction indicator. The driving state to be recognized is, for instance, a state in which the turn signal has bean turned ON and the vehicle speed is zero; that is, a state where the vehicle has stopped, or a state in which the steering wheel has been turned rightward while driving. <<Explanation of Operation>> The operation of the in-vehicle device 101 in the sixth embodiment is now explained. The basic operation is the same as the operation explained in the fifth embodiment, and the sixth embodiment is unique in that whether to enable and accept the user's gesture operation is determined according to the user's operation speed of the steering wheel (for instance, angular velocity), ON /OFF of the turn signal (direction indicator), vehicle speed and other information recognized by the driving state recognition unit 3002 in addition to the steering angle detected by the steering operation detection unit 3001. FIG. 37 is a flowchart showing the operation of the in-vehicle device 101 in the sixth embodiment. However, the same processing as FIG. 35 in the fifth embodiment is given the same step number and the explanation thereof is omitted. In step S3501, the gesture detection unit 104 starts to stand by for an input from the user, and then proceeds to step S3502. In step S3502, whether the gesture detection unit 104 has detected a gesture operation is determined. The routine proceeds to step S506 when it is determined that a gesture operation has been detected, and remains at step S3502 when it is determined that a gesture operation has not been detected. In step S3508, the driving state recognition unit 3002 determines whether the vehicle speed is zero; that is, whether the vehicle has stopped or is moving. The routine proceeds to step S3504 when if is determined that the vehicle speed is zero, and proceeds to step S3507 when it is determined that the vehicle speed is not zero. In step S3507, the driving state recognition unit 3002 determines whether the direction indicator is OFF; that is, whether the turn signal is OFF. Whether it is likely that the user is performing a steering operation for driving the vehicle is determined based on the ON/OFF of the direction indicator. The routine proceeds to step S3508 when it is determined that the direction indicator is OFF, and proceeds to step S3505 when it is determined that the direction indicator is ON. In step S3508, the driving state recognition unit 3002 determines whether the operation speed of the steering wheel or the angular velocity, is equal to or less than a predetermined threshold. The routine proceeds to step S3504 when it is determined that the angular velocity is equal to or less than the threshold, and proceeds to step S3505 when it is determined that the angular velocity is greater than the threshold. In step S3505 that is executed when the vehicle speed is not zero and the direction indicator is ON or the steering angle velocity is greater than the threshold, the driving state recognition unit 3002 ignores the signals of the gesture motion detected in step S3502, and returns to step S3501. In step S3504, the operation menu application 1701 executes the operation corresponding to the gesture motion detected in step S3502, and ends the program which yields the operation depicted in FIG. 37. The following effects are yielded according to the sixth embodiment explained above. (1) The disabling state in which the gesture operation is disabled is a state where, at least, the vehicle speed is not zero. Thus, it is possible to predict that the user may be performing a steering operation on grounds that the vehicle is moving, and it is thereby possible to prevent the false recognition of the users hand motion that, was made for performing a steering operation. (2) The Disabling state in which the gesture operation is disabled further includes a slate where the vehicle's direction indicator has been turned ON in addition to a state where the steering angle velocity has exceeded the threshold. Thus, it is possible to predict that the user may be performing a steering operation on grounds that the direction indicator is ON, and it is thereby possible to prevent the false recognition of the user's hand motion that was made for performing a steering operation. First Modified Example of Sixth Embodiment In the sixth embodiment described above, the enablement/disablement of all gesture operations was uniformly controlled based on the vehicle speed, direction indicator, and steering angle velocity. Nevertheless, it is also possible to evaluate the busyness of the driving operation of the steering wheel based on a combination of the steering angle and the steering angle velocity, and determine the types of gesture operations to be enabled among a plurality of gesture operations. FIG. 38(a) is a diagram showing the definition of regions indicating the angle in the steering operation, and the definition of the angular velocity AV. Angles are defined in the same manner as FIG. 38(a); that is, the region between angle SA00 and angle SA01 is defined as a region 3801 as a state where the steering wheel is being turned slightly, the region between angle SA01 and angle SA02 is defined as a region 3602, and a state in which the steering wheel is being turned greater than angle SA02 is defined as a region 3603. The angular velocity AV takes on a positive value irrespective of the rotating direction of the steering wheel. FIG. 38(b) is a diagram showing the steering amount as a combination of angle and angular velocity, and the types of gesture operations to be enabled among a plurality of gesture operations for each steering amount. In FIG. 38(b), a state where the angular velocity AV is approximately zero is, for example, a state where the angular velocity is 5 degrees of less per second, and the threshold is, for example, an angular velocity of 15 degrees per second. When the steering angle is in the region 3801 and the steering angle velocity AV is approximately zero, the gesture control unit 3003 determines that the hand motion detected in the gesture detection region 3201 was made by the user for performing a gesture operation. Thus, both the direct gesture and the hand placement gesture are enabled. Meanwhile, even in the region 3601, when the steering angle velocity AV is greater than the threshold, it is determined that the steering motion is being busily performed and preference is given to the driving operation, and both gesture operations of direct gesture and hand placement gesture are disabled. When the steering angle is in the region 3802 and the steering angle velocity AV is approximately zero, both the direct gesture and the hand placement gesture are enabled, and, when the steering angle velocity AV is greater than the threshold, both the direct gesture and the hand placement gesture are disabled. Moreover, when the steering angle velocity AV is not zero but smaller than the threshold, only the direct gesture is enabled, and the hand placement gesture is disabled. When the steering angle is in the region 3803, preference is given to the driving operation as the steering angle is great, and both the direct gesture and the hand placement gesture are disable irrespective of the size of the steering angle velocity AV. The following effects are yielded according to the first modified example of the sixth embodiment explained above. (1) The steering operation amount is a combination of an angle of a steering wheel operated by a user and an operation speed of a steering wheel operated by a user, and the output information control unit 114 changes the displayed contents of the display unit 108 or the external display unit 109 according to the combination of the angle of the steering wheel and the operation speed of the steering wheel. In other words, the gesture control unit 3003 determines the types of gesture operations to be enabled among a plurality of gesture operations according to the combination of the steering angle and the steering angle velocity AV Consequently, for any gesture operation that was enabled, the output information control unit 114 changes the display of the display unit 108 or the external display unit 109 according to the corresponding gesture operation. Meanwhile, for any gesture operation that was disabled, the output information control unit 114 does not change the display of the display unit 108 or the external display unit 109. As a result of determining the enablement/disablement of the gesture operation by combining the steering angle and the steering angle velocity, for instance, in cases where there is a certain amount of steering angle but hardly any driving operation is being performed to the steering wheel such as when the vehicle is stably rounding a curve, the user is able to perform a gesture operation to the target equipment, and it is possible to yield the effect of improving the user-friendliness while suppressing the false recognition ratio of gesture operations. Second Modified Example of Sixth Embodiment In the sixth embodiment described above, all gesture operations are uniformly disabled upon corresponding to predetermined conditions. Nevertheless, it is also possible to disable only specific gesture operations according to the rotating direction of the steering wheel. FIG. 39 and FIG. 40 are diagrams showing an example of controlling the gesture operation according to the rotating direction of the steering wheel. FIG. 39(i) shows an operation example of the direct gesture in cases of turning the steering wheel to the right; that is, when the vehicle rounds a right curve, turns right, or makes a lane change to a right lane. FIG. 39(ii) shows an example in cases of turning the steering to the left. FIG. 40 is a diagram showing whether to enable the hand waving in a downward direction or the hand waving in an upward direction of the direct gesture operation in the respective steering operations of turning the steering wheel to the right and turning the steering wheel to the left. In the case of FIG. 39(i) in which the steering wheel is being turned to the right, it is assumed that, by placing the hand on the steering wheel and turning the steering wheel to the right, the hand will pass through the gesture detection region 3201 from left to right. Thus, the hand waving in the upward direction of the direct gesture, which can be easily confused with the driving operation, is disabled, and not recognized as a gesture motion. In the case of FIG. 39(ii) in which the steering wheel is being turned to the left, counter to FIG. 39(i), it is assumed that, by placing the hand on the steering wheel and turning the steering wheel to the left, the hand will pass through the gesture detection region 3201 from right to left. Thus, the hand waving in the downward direction of the direct gesture, which can be easily confused with the driving operation, is disabled, and not. recognized as a gesture motion. Moreover, the same applies to the hand placement gesture, and a gesture operation direction which is easily confused with a steering rotating direction is disabled. (Flowchart) FIG. 41 is a flowchart showing the operation of the in-vehicle device 101 in the second modified example of the sixth embodiment. However, the same processing as FIG. 37 in the sixth embodiment is given the same step number and the explanation thereof is omitted. The difference in comparison to the flowchart shown in FIG. 37 is that step S3510 has been added. In step S3510 which is executed when a negative determination is obtained in step S3508, the driving state recognition unit 3002 determines whether the operation direction of the hand waving motion detected in step S3502 matches the rotating direction of the steering wheel detected in step S3508. A match in this step means the hand waving in the upward direction when the steering wheel is turned to the right and the hand waving in the downward direction when the steering is turned to the left. The routine proceeds to step S3505 when it is determined that the result is a match, and proceeds to step S3504 when it is determined that the result is not a match. The following effects are yielded according to the second modified example of the sixth embodiment explained above. (1) Disablement of the gesture operation is not accepting the gesture operation of moving one's hand in the same direction as the users steering operation direction detected by the steering operation detection unit 3001. By changing the enablement/disablement of the hand waving in the downward direction and the hand waving in the upward direction in the direct gesture according to the rotating direction of the steering wheel as described above, it is possible to eliminate the gesture operations that, are easily confused with the rotating direction of the steering wheel, and yield the effect of improving the accuracy of gesture recognition. Specifically, it is possible to yield the effect of being able to properly differentiate the steering operation for driving the vehicle and the hand motion for performing a gesture operation. Third Modified Example of Sixth Embodiment In the fifth and sixth embodiments, the sensing unit 3101 was provided on the steering wheel but the sensing unit 3101 may also be provided near the steering. To put if differently, while the gesture detection region 3201 moved together with the steering wheel in the fifth and sixth embodiments, the configuration may also be such that the gesture detection region 3201 does not move even when the steering wheel is turned. FIG. 42 is a diagram showing the relationship of the steering wheel and the gesture detection region. FIG. 42(i) shows an example of mounting the sensing unit 4001 not on the steering wheel, but on a sensor installation site 4002 such as a base that does not rotate together with the steering wheel. FIG. 42(ii) shows an example of mounting the sensing unit 3101 on the steering wheel, and, when the steering is turned to the right, the gesture detection region 3201 moves in a right upper direction together with the steering wheel. FIG. 42(iii) shows an example of turning the steering wheel to the right from the state shown in FIG. 42(i). In the foregoing case, the gesture detection region 3201 will not move even when the steering wheel is turned, and the gesture defection region 3201 will constantly be positioned at the same location. In all of the configurations described above, the user can perform a gesture operation near the steering wheel while driving the vehicle without having to separate one's hand far away from the steering wheel, and it is possible to yield an effect of realizing user-friendly device operations. The disclosure of the following priority application is incorporated herein by reference Japanese Patent Application No. 2015-249369 (filed on Dec. 22, 2015) REFERENCE SIGNS LIST 101 in-vehicle device 102 in-vehicle device control unit 103 sensing unit 104 gesture detection unit 105 switch operation unit 106 touch operation unit 107 communication unit 108 display unit 109 external display unit 110 sound output unit 111 speaker 112 tactile IF output unit 113 messenger application 114 output information control unit 115 microphone 116 voice recognition unit 117 external switch operation unit 118 vehicle information input unit 119 operation means control unit 120 driving load estimation unit 121 map DB 1701 operation menu application 1702 display output unit 1703 steering controller 1704 steering contact detection unit 1705 commander controller 1706 command contact detection unit 2001 gesture operation menu 2002 steering operation menu 2201 gesture operation menu 2202 steering operation menu 2301 gesture operation menu 2302 steering operation menu 2401 item selection state 2402 item selection state 2501 detailed menu 2701 simplified menu 2801 commander controller operation menu 3001 steering operation detection unit 3002 driving state recognition unit 3003 gesture control unit 3101 sensing unit 3201 gesture detection region 3410 steering angle 3411 steering angle 4001 sensing unit 4002 sensor installation site 1. An in-vehicle device, comprising: a gesture detection unit which recognizes a user's hand position located within a predetermined range; a driving state recognition unit which detects a driving state of a vehicle; and a gesture control unit which controls a state of a gesture operation based on a recognition result of the hand position by the gesture detection unit, wherein the gesture control unit disables the gesture operation when the driving state of the vehicle detected by the driving state recognition unit is in a predetermined disabling state. 2. The in-vehicle device according to claim 1, further comprising: a steering operation detection unit which detects a steering operation for driving the vehicle; and an output information control unit which controls displayed contents of a display unit connected to the in-vehicle device, wherein the driving state recognition unit detects a driving state of the vehicle based on the steering operation, wherein the disabling state is a state where a user's steering operation amount detected by the steering operation detection unit exceeds a predetermined operation amount, and wherein, when the gesture operation has been disabled, the output information control unit does not change the display of the display unit even when the hand position is within the predetermined range. 3. The in-vehicle device according to claim 2, wherein, when the gesture operation has not been disabled, the output information control unit displays, on the display unit, a gesture operation menu indicating candidates of the gesture operation corresponding to the hand movement when the gesture detection unit detects that the user's hand has been placed within the predetermined range, and wherein, when the gesture operation has been disabled, the output information control unit does not display the gesture operation menu on the display unit. 4. The in-vehicle device according to claim 1, further comprising: a steering operation detection unit which detects a steering operation for driving the vehicle, wherein the disabling state is a state where a user's steering operation amount detected by the steering operation detection unit exceeds a predetermined operation amount, and wherein the gesture control unit disables the gesture operation by stopping operation of the gesture detection unit or disabling inputs from the gesture detection unit. 5. The in-vehicle device according to claim 2, wherein the steering operation amount is an angle of a steering wheel operated by a user. 6. The in-vehicle device according to claim 2, wherein the steering operation amount is an operation speed of a steering wheel operated by a user. 7. The in-vehicle device according to claim 2, wherein the steering operation amount is a combination of an angle of a steering wheel operated by a user and an operation speed of the steering wheel operated by a user, and wherein the output information control unit changes the displayed contents of the display unit according to the combination of the angle of the steering wheel and the operation speed of the steering wheel. 8. The in-vehicle device according to claim 2, wherein the gesture control unit disables only a specific gesture operation among a plurality of gesture operations performed by a user based on the steering operation amount. 9. The in-vehicle device according to claim 2, wherein the gesture control unit disables a gesture operation of moving a hand in a same direction as a user's steering operation direction detected by the steering operation detection unit. 10. The in-vehicle device according to claim 2, wherein the disabling state is a state where, at least, a vehicle speed of the vehicle is not zero. 11. The in-vehicle device according to claim 10, wherein the disabling state further includes a state where the vehicle's direction indicator has been turned ON.

2016-10-24

en

2019-01-03

US-201716500558-A

Microbial insecticide for control of mulberry thrips ABSTRACT The present invention relates to a microbial insecticide for control of thrips , comprising a Beauveria bassiana ERL836 strain (KCCM11506P) or a spore thereof. The insecticide of the present invention shows an insecticidal activity as potent as pre-existing chemical insecticides against thrips , is environmentally friendly, and easy to manage and produce, thus finding outstanding commercial applications. TECHNICAL FIELD The present invention relates to a microbial insecticide for control of thrips. BACKGROUND ART Thrips spp. is an insect that belongs to the order Thysanoptera, and is a small-sized insect pest that emerges throughout the year to cause great damage to all the crops whose flowers bloom, such as gardening and flowering plants. In particular, Western flower thrips and Melon thrips are non-native invasive insect pests that are currently spreading throughout the nation to cause serious damage to various agricultural crops. And Some viruses such as tomato spotted wilt virus (TSWV) are mediated by these insect pests. Therefore, the control of these species is especially required. Meanwhile, the thrips is highly proliferative, and shows rapid resistance development to chemical insecticides, compared to other insect pests. Within 1 month after thrips trespasses into any facility, thrips spends one generation and it has a variety of mixed life stages such as eggs, larvae, pupae, adults, and the like. Therefore, the thrips is considered to be an insect pest that is relatively difficult to control using an insecticide. For control of thrips, approximately 220 chemical insecticides such as pyriproxyfen, spinetoram, and the like have been used so far. However, the thrips has resistance to most of these chemical insecticides, and also has resistance to recently studied and developed chemical insecticides such as spinosad, acetamiprid, dinotefuran, and the like. Carbamate-based insecticides (bendiocarb, carbosulfan, methiocarb, and the like), organophosphate-based insecticides (methomyl, chlorpyrifos, diazino, and the like), synthetic pyrethroid-based insecticides (acrinathrin, bifenthrin, cyhalothrin, and the like), neonicotinoid-based insecticides (imidacloprid, acetaprid, dinotefuran, and the like), microorganism-derived biochemical agents (spinosad), mectin-based insecticides (abamectin, milbemectin, and the like), and the like have been reported as the representative chemical insecticides to which the thrips have resistance. As there has been recently a growing interest in side effects such as environmental pollution, the advent of resistant insect pests according to the continuous use and abuse of the chemical insecticides, and the like, the use of the chemical insecticides has been gradually limited. A biological control method that may replace such chemical insecticides and is environmentally safe, has been actively studied. For example, the biological control method is a control method using natural enemies such as Orius sp., predatory mites, and the like, or using entomopathogenic fungi that infect the insect pests. Approximately 750 or more entomopathogenic fungi have been known so far. Among these, Beauveria bassiana, Metarhizium anisopliae, Nomuraea rileyi, and the like have been typically developed as the microbial insecticides, and used to control various insect pests. With regard to the Beauveria bassiana strain, KR 10-2016-0000537 discloses the insect insecticidal activity against a beet armyworm larva by a Beauveria bassiana FG274 strain, KR 10-2016-0139521 discloses the insecticidal activity against a two-spotted spider mite or green peach aphid by a Beauveria bassiana SD15 strain, KR 10-2016-0084968 discloses the insecticidal activity against a Riptortus clavatus by a Beauveria bassiana JEF007 strain, KR 10-2011-0011239 discloses the insecticidal activity against a Monochamus alternatus or a Moechotypa diphysis by a Beauveria bassiana MaWl strain, KR 10-2011-0094749 discloses the insecticidal activity against a Monochamus saltuarius by a Beauveria bassiana MsW1 strain, and KR 10-2015-0113255 discloses the insecticidal activity against paddy rice insect pests such as Laodelphax striatellus (Fallen) or Issorhoptrus oryzophilus Kuschel by a Beauveria bassiana ERL836 strain. However, for controlling thrips, there is still a need for new highly active microbial insecticides that can be strongly controlled, environmentally friendly, and easy to handle and use, at the same level as chemical insecticides. PRIOR-ART DOCUMENTS Patent Documents KR 10-2016-0000537 KR 10-2016-0139521 KR 10-2016-0084968 KR 10-2011-0011239 KR 10-2011-0094749 KR 10-2015-0113255 DISCLOSURE Technical Problem During searching a potent microbial insecticide against thrips, the present inventors have found a novel microorganism, named Beauveria bassiana ERL386 strain, shows an insecticidal activity against thrips at the same level as the chemical insecticides. Therefore, the present invention has been completed based on these facts. Also, an object of the present invention is to provide an environmentally friendly microbial insecticide which shows an excellent insecticidal activity against thrips at the same level as the conventional chemical insecticides, and also is easy to handle and use. Technical Solution To solve the above problems, according to one aspect of the present invention, there is provided a microbial insecticide for control of thrips, which includes a Beauveria bassiana ERL836 strain or a spore thereof having entomopathogenicity. According to another aspect of the present invention, there is provided a controlling method against thrips, by applying the microbial insecticide of the present invention to a habitat, a plant to be protected from the insect pest, or soil. Advantageous Effects The microbial insecticide including a Beauveria bassiana ERL836 strain or a spore thereof according to the present invention shows a potent insecticidal activity against thrips at the same level as the conventional chemical insecticides. Also, the microbial insecticide of the present invention especially shows a potent insecticidal activity against pupae of the thrips in the soil. Also, the microbial insecticide of the present invention is environmentally friendly, and easy to handle and produce, thus providing excellent commercial applicability. DESCRIPTION OF DRAWINGS FIG. 1 shows a granular preparation of a microbial insecticide according to the present invention. FIG. 2 shows colonies of a Beauveria bassiana ERL836 strain of the present invention, which is formed in the soil after 7 days when the soil is treated with the microbial insecticide of the present invention. FIG. 3 is an image showing that pupae of thrips in the soil come into active contact with the colonies of the Beauveria bassiana ERL836 strain of the present invention. FIG. 4 shows the comparison of the densities of thrips between a group treated with the microbial insecticide of the present invention (Treatment Group), a group treated with a chemical insecticide (i.e., clothianidin)(Comparison Group), and a group which is not treated with any insecticide (Control Group) (a: after 20 days, b: after 40 days). FIG. 5 shows the comparison of the densities of thrips between a group treated with the microbial insecticide of the present invention (Treated Group), a group treated with a chemical insecticide (i.e., spinetoram)(Comparison Group), and a group which is not treated with any insecticide (Control Group). FIG. 6 shows the comparison of the densities of thrips between a group treated with the microbial insecticide of the present invention (Treated Group), a group treated with a known microbial insecticide (i.e., a Beauveria bassiana GHA strain)(Comparison Group), and a group which is not treated with any insecticide (Control Group). BEST MODE The Beauveria bassiana ERL836 (KCCM11506P) strain of the present invention is isolated by the present inventors. That is, a Beauveria bassiana strain showing a remarkable insecticidal effect against paddy rice insect pests such as Laodelphax striatellus (Fallen), Nilaparvata lugens, Sogatella furcifera, Issorhoptrus oryzophilus Kuschel, is isolated by a biological assay test. The isolated strain is identified morphologically, and analyzed by a genomic DNA sequencing. Since, the isolated strain of this invention shows approximately 98% homology with Beauveria bassiana strain GHA known in the related art, the isolated strain is identified as a Beauveria bassiana strain. The isolated strain is named ‘ERL836’, and deposited in the Korean Culture Center of Microorganisms(KCCM) on Jan. 22, 2014 (Accession Number: KCCM11506P). The Beauveria bassiana ERL836 strain of the present invention is disclosed in detail in KR 10-2015-0113255, the disclosure of which is incorporated herein by reference in its entirety. The Beauveria bassiana ERL836 strain of the present invention may be available from KCCM. The Beauveria bassiana ERL836 strain form white colonies, has very excellent spore-forming ability and spore storage stability. That is, Beauveria bassiana ERL836 strain of this invention shows better than 2 to 3 times spore-forming ability and better than 4 to 6 times spore storage stability than the known Beauveria bassiana GHA strain. When the Beauveria bassiana ERL836 strain of the present invention is attached to a shell of a host insect (i.e., thrips) to germinate, the microorganism of this invention produces chitinases, proteases, lipases, and/or esterases to penetrate a cuticula layer of thrips so that the microorganism of this invention invades an insect pest, and produces toxic substances while growing in the insect pest, thereby hindering an immune response of the insect pest and killing the host insect pest. Surprisingly, it was confirmed in the present invention that the Beauveria bassiana ERL836 strain has a highly excellent insecticidal activity against thrips. Thus the Beauveria bassiana ERL836 strain may be useful in controlling various kinds of thrips, such as Western flower thrips, Melon thrips, Frankliniella intonsa, or Thrips tabaci Lindeman. As described above, it is known that the “Beauveria bassiana ERL836 strain” of the present invention effectively kills paddy rice insect pests such as Laodelphax striatellus (Fallen), and the like. Thrips is an insect pest that generally grows in flowering plants or fruit trees whose flowers bloom and has completely different characteristics to paddy rice insect pests such as Laodelphax striatellus (Fallen), and the like. Therefore, it is very surprising to those skilled in the art that the Beauveria bassiana ERL836 strain of the present invention shows an insecticidal effect against thrips, and the insecticidal effect is not easily predicted from the insecticidal effect against the conventional paddy rice insect pests. In the present invention, it was confirmed that the Beauveria bassiana ERL836 strain has a potent insecticidal effect against thrips. The Beauveria bassiana ERL836 strain shows an equivalent or superior insecticidal effect, compared to the chemical insecticides such as clothianidin or spinetoram, which are known to show potent insecticidal efficacy against thrips (see Examples 4 and 5). Also, the Beauveria bassiana ERL836 strain shows a highly superior insecticidal effect, compared to a previously known Beauveria bassiana strain GHA strain reported to have an insecticidal activity against thrips (see Example 6). The spores of the Beauveria bassiana ERL836 strain according to the present invention may be produced by incubating the Beauveria bassiana ERL836 strain in a solid culture medium. The microbial insecticide of the present invention may be provided in the form of a granular preparation, a liquid-phase preparation, or compost. Specifically, the granular preparation refers to a solid granular form, and may be prepared by incubating the Beauveria bassiana ERL836 strain in a solid culture medium and harvesting the incubated product. The solid culture medium may include any one selected from millet, white rice, wheat bran, Italian millet, sorghum, and a combination thereof. The solid culture medium may be mixed with an organic acid. The solid culture medium mixed with an organic acid may allowed to absorb water by immersing in water at 80 to 100° C. for 0.5 to 1.5 hours. In the present invention, the solid culture medium is prepared by adding an organic acid such as citric acid to Italian millet, allowing the mixture to absorb water for 0.5 to 1.5 hours while being maintained at 80 to 100° C. in a water bath. And then, the immersed solid culture medium is sterilized for 10 to 40 minutes at a temperature of 110 to 130° C. The organic acid may be used without any particular limitation. More specifically, any one selected from citric acid, propionic acid, butylic acid, lactic acid, succinic acid, gluconic acid, valeric acid, caproic acid, and a combination thereof may be used. Preferably, citric acid may be used as the organic acid. The mixing of the solid culture medium with the organic acid may be performed by adding the organic acid to the solid culture medium and mixing the solid culture medium with the organic acid. A culture vessel generally used in the art to which the present invention belongs may be used as a culture vessel for the strain, and types of the culture vessel are not limited. For example, the culture vessel may be attached to an oxygen-supplying filter, which may smoothly supply oxygen to a polyvinyl bag, and then may be used for incubation. The Beauveria bassiana ERL836 strain is seeded in a prepared solid medium, and then cultured at 20 to 30° C. for 6 to 8 days. Preferably, the Beauveria bassiana ERL836 strain is cultured at 25° C. for 7 days. An inoculum which may be used in the solid culture medium may be obtained by subculturing the Beauveria bassiana ERL836 strain, and the culturing of the ERL836 strain may be performed according to a conventional subculturing method. Types of media required for the subculturing are not limited. As one example of subculture medium, a liquid medium including a potato dextrose broth (PDB) medium, rice bran, or wheat bran can be used, but types of the liquid medium are not limited. The harvested solid medium-cultured product is generally produced in the form of granules (see FIG. 1). A liquid-phase preparation refers to a liquid form, and may be prepared by incubating the Beauveria bassiana ERL836 strain in a solid culture medium; putting the incubated product into a filterable bag; and putting the filterable bag into water to elute the Beauveria bassiana ERL836 strain or spores thereof. The filterable bag is a bag composed of water-permeable filterable material. The filterable bag is preferably formed of one or more selected from the group consisting of synthetic fibers such as polyester, nylon, polyethylene, polypropylene, and vinylon; semi-synthetic fibers such as rayon, and the like; woven or non-woven fabrics composed of single or composite fibers of natural fibers of Broussonetia kazinoki and Edgeworthia chrysantha; and mixed drafting paper and paper composed of Manila hemp, wood pulp, polypropylene fiber, and the like. The granular preparation undergoes a production process simpler than the liquid-phase preparation, and thus may be advantageous in terms of period shortening and cost saving. Meanwhile, because the commercially available Beauveria bassiana GHA strain, and the like are already known to be used against thrips, but insect pests in the soil are known to have resistance to that stain. So Beauveria bassiana GHA strain is generally subjected to aerial parts such as leaves, and the like (i. e. foliage treatment). On the other hand, when the granular preparation of the present invention is applied to the soil, the granular preparation showed an excellent control effect against pupae of thrips, as will be described below. Therefore, in addition to the conventional method for treatment of the Beauveria bassiana strain (i.e., foliage treatment), the microbial insecticide as a granular formulation of the present invention is particularly applied to the soil (i. e. soil surface, mixed soil, treated soil surface, treated furrows, and the like) to kill the pupae of thrips, effectively. Also, the strain of the present invention has an advantage in that the strain may quickly form colonies in the soil to continuously show an insecticidal effect, thereby reducing repeated application of the insecticide to a minimum. The microbial insecticide of the present invention may further include an additive available in the related art. Also, the present invention provides a method for control of thrips, which includes applying the microbial insecticide to an insect pest, a habitat thereof, a plant to be protected from the insect pest, or soil. Examples of suitable crops may include all types of crops whose flowers blossom, such as gardening and flowering plant, and the like, for example, Solanaceae crops such as tomato, pepper, eggplant, potato, and the like; vegetable crops such as watermelon, oriental melon, cucumber, pepper, and the like; flowering plants such as lily, carnation, chrysanthemum, gerbera rose, and the like. The microbial insecticide of the present invention may be not only directly applied to thrips (adults, eggs, larvae, and the like) in the aerial part of the plant, but also applied to a subterranean part to control thrips (pupae) present in the soil at the same time. Thereby thrips could be controlled on the all life stages. In particular, the insecticidal microorganism (fungus) of the present invention may be applied to the soil (under the high-humidity conditions, the presence of nutrients) rather than the aerial part to easily proliferate in the soil, and may be settled down in the ecosystem in the long term. Thereby the insecticidal microorganism of the present invention may effectively control the thrips entering the soil. The microbial insecticide including the Beauveria bassiana ERL836 strain or spores thereof according to the present invention is preferably applied at a use amount of 104 to 108 spore/soil g when applied to the soil. When the microbial insecticide is sprayed as a liquid-phase formulation, the microbial insecticide is preferably applied at a use amount of 104 to 108 spores/mL. When the microbial insecticide is used in this range, the microbial insecticide may generally show a sufficient control effect. MODE FOR INVENTION Hereinafter, preferred embodiments are provided to aid in understanding the present invention. However, it should be understood that the following examples are merely intended to provide a better understanding of the present invention, and are not intended to limit the scope of the present invention. Example 1: Preparation of Microbial Insecticide of the Present Invention (Granular Preparation) The Beauveria bassiana ERL836 (KCCM11506P) strain (available from the Korean Culture Center of Microorganisms) was incubated in a liquid PDB medium at room temperature for 3 days to obtain a suspension (concentration: 1×107 conidia/ml). Meanwhile, 200 g of Italian millet was put into a polyvinyl bag for incubation, and 0.16 mL of 50% citric acid was added thereto. Thereafter, the Italian millet was thermally treated at 90° C. for an hour in a water bath so that the Italian millet sufficiently absorbs water, thereby to prepare a solid culture medium. In this case, oxygen was smoothly supplied through an opening of a polyvinyl bag using a paper cup and sterile gauze, and the polyvinyl bag was sterilized at 121° C. for 15 minutes and used. The prepared solid culture medium was cooled to room temperature, and 1 mL of the suspension of Beauveria bassiana ERL836 strain (1×107 conidia/mL) was seeded, incubated at 25° C. for 7 days, and dried at room temperature for one day to obtain the microbial insecticide of the present invention in the form of granules (see FIG. 1). Example 2: Preparation of Microbial Insecticide of the Present Invention (Liquid-Phase Preparation) 10 g of the granules prepared in Example 1 were put into a filterable bag, and sealed, and 10 L of water was added thereto. Thereafter, the resulting mixture was agitated to release the strain and spores into water, thereby to prepare a liquid-phase preparation. Example 3: Confirmation of Soil Settlement and Contact with Thrips after Treatment of Soil with Microbial Insecticide of the Present Invention The soil was treated with 2 g of the microbial insecticide granules of the present invention obtained in Example 1, and the soil settlement of the Beauveria bassiana ERL836 strain and the contact with larvae and pupae of thrips were observed after 7 days. The results are shown in FIG. 2 and FIG. 3, respectively. From the results, it was confirmed that the Beauveria bassiana 836 strain started to grow from 3 days after the soil treatment, and was smoothly colonized in the soil (see FIG. 2). Also, the pupae of thrips present in the soil come into active contact with the strain colonies of the present invention (FIG. 3). Example 4: Confirmation of Insecticidal Effect Against Thrips of Microbial Insecticide of the Present Invention An experiment on the insecticidal effect against thrips was carried out in a tomato crop. A population of the tomato crop having a height of 20 to 25 cm was used, and the tomato crop was put into a plastic cage (30×30×60 cm3) equipped with a sieve with mesh smaller than that of Western flower thrips to prevent Western flower thrips from moving from a treatment zone, and an experiment was then performed. A pot in which a tomato crop was planted, was treated with 2 g of the microbial insecticide granules of the present invention prepared in Example 1. Also, as the comparison group, the tomato crop was treated with an agricultural chemical (i.e., clothianidin) known to show a potent insecticidal effect against thrips at an amount of 0.02 g (i.e., an amount of 3 kg/10 a) per pot, and no insecticide was applied to the pot of the control group. TABLE 1 Thrips density (number/plant) After 20 days After 40 days Untreated control group 14.1 ± 1.7  38.0 ± 5.1  Comparison group 3.7 ± 0.5 2.4 ± 0.4 Inventive insecticide treatment group 4.3 ± 0.3 3.1 ± 0.6 As can be seen in Table 1 and FIG. 4, it was confirmed that the microbial insecticide of the present invention had a potent insecticidal effect against thrips at an equivalent level with respect to clothianidin (85 to 95%). Example 5: Confirmation of Insecticidal Effect of Microbial Insecticide Against Thrips of the Present Invention Under Greenhouse Conditions An insecticidal effect of the microbial insecticide of the present invention against thrips was tested under large greenhouse conditions. Cucumber was regularly planted in a large greenhouse, and a surface of the soil under the cucumber was treated with the insecticide granules (concentration: 107 conidia/g) of the present invention prepared in Example 1 at an input amount of 3 kg/10a. As a comparison group, spinetoram WDG (concentration: 5% by weight, in the form of water-dispersible granules), which was an insecticide known to show a potent insecticidal effect against thrips, was subjected twice to foliage treatment at an input amount of 0.5 g/L. Meanwhile, the control group was not treated with any insecticide. Amounts of thrips produced in the treatment group, the comparison group, and the control group were examined with the naked eye at intervals of one week after treatment with the insecticide, and changes in densities of the populations were analyzed for 6 weeks. The results are shown in FIG. 5. In FIG. 5, the units of an average density are indicated by the number of thrips per plant. Also, the control efficacy was calculated according to the following equation to evaluate the insecticidal efficacy. Control Efficacy=(D Control −D Treated)/D Control×100 wherein Dcontrol represents an average density of thrips in the control group which was not treated with any insecticide, and DTreated represents an average density of thrips in the treatment group which was treated with the insecticide. TABLE 2 Control efficacy (%) Treatment group (ERL836) 91.3 Comparison group (spinetoram WDG- 85.5 treated group) As can be seen in Table 2 and FIG. 5, it was confirmed that the microbial insecticide of the present invention had a superior insecticidal effect against thrips, compared to the spinetoram WDG. Example 6: Comparison Between Insecticidal Effects of ERL836 and GHA Against Thrips (Laboratory Experiment) The insecticidal effect of the Beauveria bassiana ERL836 strain of the present invention against thrips was confirmed with respect to the conventional Beauveria bassiana GHA strain. An insecticidal experiment was performed for a chrysanthemum crop. A population of the chrysanthemum crop having a height of approximately 20 cm was used, and the chrysanthemum crop was put into a plastic cage (30×30×60 cm3) equipped with a sieve with mesh smaller than that of Western flower thrips to prevent Western flower thrips from moving from a treatment zone, and an experiment was then performed. A pot in which a chrysanthemum crop was planted was treated with 2 g of the microbial insecticide granules of the present invention prepared in Example 1. Also, as the comparison group, the chrysanthemum was treated with 2 g of the granules obtained after the GHA strain was grown in the soil in the same manner as in Example 1 with respect to the ERL836. After a week of treatment with the insecticide, five Western flower thrips adults were released per pot in the two microorganism-treated groups and the control group (untreated), and the densities of thrips were examined at intervals of 2 weeks for 6 weeks. The results are listed in the following Table 3 and shown in FIG. 6. TABLE 3 Thrips density (number/plant) Right after After After After treatment 2 weeks 4 weeks 6 weeks Untreated control 5.0 ± 0.0 10.1 ± 2.5  55.8 ± 6.5 102.3 ± 12.0 group Comparison group 5.0 ± 0.0 9.3 ± 2.1 37.0 ± 4.7 54.2 ± 8.1 Inventive insecticide 5.0 ± 0.0 8.6 ± 1.7 10.3 ± 3.5 12.9 ± 3.8 treatment group As can be seen in Table 3 and FIG. 6, it was confirmed that the microbial insecticide of the present invention showed very excellent insecticidal effect against the thrips, compared to the Beauveria bassiana GHA strain known in the related art. 1. A microbial insecticide for control of thrips, comprising Beauveria bassiana ERL836 strain (KCCM11506P) or a spore thereof as an active ingredient. 2. The microbial insecticide of claim 1, wherein the thrips is Western flower thrips, Melon thrips, Frankliniella intonsa, or Thrips tabaci Lindeman. 3. The microbial insecticide of claim 1, which is in the form of solid granules. 4. The microbial insecticide of claim 3, which is in the form of the solid granules obtained by incubating the Beauveria bassiana ERL836 strain (KCCM11506P) in a solid culture medium selected from millet, white rice, wheat bran, Italian millet, sorghum, and a combination thereof. 5. The microbial insecticide of claim 3, which is applied to soil. 6. A method for control of thrips, comprising: applying the microbial insecticide defined in claim 1 to an insect, a habitat thereof, a plant to be protected from the insect pest, or soil. 7. The method of claim 6, wherein the microbial insecticide is applied to the soil.

2017-04-21

en

2020-04-02

US-202017254680-A

Biodegradable vci packaging compositions ABSTRACT A breathable biodegradable volatile corrosion inhibitor polyester composition comprises one or more biodegradable homopolymer polyesters and/or one or more biodegradable random copolymer polyesters, one or more volatile corrosion inhibitors (VCI), and one or more fillers wherein said composition has a higher water-vapor transmission rate than polyethylene. FIELD OF THE INVENTION A breathable biodegradable volatile corrosion inhibitor composition comprises a biodegradable polyester composition that comprises one or more homopolymer polyesters and/or one or more random copolymer polyesters with one or more volatile corrosion inhibitors (VCI), and at least one or more fillers that unexpectedly improve various physical properties of the composition. The total amount of said one or more VCI is generally from about 0.1 wt. % to about 10 wt. % based upon the total weight of all of the biodegradable polyesters excluding said fillers. BACKGROUND OF THE INVENTION An urgent need for biodegradable compositions in this world exists due to the ever increasing amount of waste plastics and polymers that are deposited in land dumps, garbage pits, and municipal and governmental dumps that often pollute and/or admit dangerous and/or toxic compounds into the water table. In oceans and seas a growing amount of waste is proving to be a danger to fish and mammals that consume the same and often die therefrom whereby an important source of food is eliminated. Packaging is an integral part of corrosion protection as environmental elements cause corrosion when in contact with metallic parts, but after the shipment arrives, the packaging which is mostly made out of LDPE and LLDPE thin films, needs to be disposed of, and many recycling facilities do not accept flexible packaging made of LDPE and LLDPE. Therefore, the packaging material end up in landfills, etc. In view of present consumer awareness, there is ever increasing pressure on corporations to reduce their plastic foot-print and one of the ways to so do is to use biodegradable bags for packaging of metals where the shelf life of the product and the other factors allows biodegradable material to be used. U.S. Pat. No. 6,028,160 to Cortec Corporation relates to biodegradable resin products consisting essentially of a polymeric resin of polyethylene, starch, polyesters such as polylactic acid, or other suitable polyesters. In admixture with the resin is a particulate vapor phase corrosion inhibitor selected from amine salts, ammonium benzoate, triazole derivatives, tall oil imidazolines, alkali metal molybdates, alkali dibasic acid salts, and mixtures thereof, and is present in an amount ranging from between 1% and 3% by weight of the polymeric resin. U.S. Pat. No. 6,156,929 to Cortec Corporation relates to biodegradable resin products consisting essentially of a polymeric resin of starch, polyesters of polylactic acid and polycaprolactone. In admixture with the resin is a particulate vapor phase corrosion inhibitor selected from amine salts, ammonium benzoate, triazole derivatives, tall oil imidazolines, alkali metal molybdates, alkali dibasic acid salts, and mixtures thereof, and is present in an amount ranging from between 1% and 3% by weight of the polymeric resin. U.S. Pat. No. 6,617,415 to Cortec Corporation relates to biodegradable resin products consisting essentially of a polymeric resin of starch, polyesters such as polylactic acid, or other suitable polyesters. In admixture with the resin is a particulate vapor phase corrosion inhibitor selected from amine salts, triazole derivatives, alkali dibasic acid salts, and mixtures thereof, and is present in an amount ranging from between 1% and 3% by weight of the polymeric resin and which is shaped into formed articles. U.S. Pat. No. 6,984,426 to Cortec Corporation relates to a biodegradable film formable into biodegradable bags which includes the blended product of polylactic acid and a suitable biodegradable polymeric resin. The blended product includes from about 5% to about 50% by weight polylactic acid. U.S. Publication 2014/0235777 to Purac Biochem B.V. relates to a composition comprising a poly-D-lactic acid (PDLA) polymer and a poly-L-lactic acid (PLLA) polymer. It also relates to a method for the production of a moulded part comprising the steps of heating a mold, and supplying to the mold a composition comprising a poly-D-lactic acid (PDLA) polymer and a poly-L-lactic acid (PLLA) polymer. It further relates to a composition comprising a poly-D-lactic acid (PDLA) polymer and a poly-L-lactic acid (PLLA) polymer for use in injection molding, thermoforming and/or film blowing. It also relates to a composition that can be obtained by heating a composition comprising a poly-D-lactic acid (PDLA) polymer and a poly-L-lactic acid (PLLA) polymer. U.S. Pat. No. 8,008,373 to Northern Technologies International Corporation relates to a biodegradable thermoplastic polymer masterbatch composition comprising a blend of at least one biodegradable thermoplastic polymer containing high loading of a particulate filler uniformly dispersed therein. The amount of the biodegradable thermoplastic polymer is generally from about 25% to about 50% by weight and the amount of the filler is from about 75% to about 50% by weight, based upon the total amount of one biodegradable polymer and the at least one filler. The uniform dispersion of the fillers is obtained by adding small particles of the filler to a melt of the biodegradable polymer and blending using high shear equipment with special screw geometry. The masterbatch composition is then physically blended with additional biodegradable thermoplastic polymer and extrusion processed into final articles such as blown and cast films, molded products, and the like. The masterbatch multi-stage approach results in a product that has improved physical properties and lower costs over that of a one-step blend of the same amount of a biodegradable thermoplastic polymer and a filler that is subsequently heat formed into a final product SUMMARY OF THE INVENTION An aspect of the present invention is to alleviate the above-noted pollution and/or toxic problems. Another aspect is providing a composition that is in the form of a film that can pass EN 13432 and ASTM D6400 which evaluates timely composability of the material in industrial composting facilities. The composition has superior mechanical properties and volatile corrosion inhibition properties compared to PE, unlike the above mention products, so it can truly replace PE based material in the field of corrosion mitigation. Another important aspect of the present invention is to provide a biodegradable VCI packaging composition that effectively prevents corrosion of various items including machines, tools, and metal parts. As one of the essential components for corrosion is water, it is commonly believed that lower water-vapor transmission rates (WVTR) of a VCI packaging composition such as packaging material containing a VCI result in better corrosion inhibition. However, our results show that biodegradable compositions such as in the form of biodegradable polyester plastic bags perform better than polyethylene (PE) bags when containing the same amounts of VCIs therein, despite higher WVTR of the biodegradable bags than PE bags. VCI chemistries like sodium nitrite, salts of carboxylic acids, or ammonium salts react with water to release the VCI and therefore, if more moisture is permeated through the bag faster, more VCI chemistry is activated in a shorter period and the chemistry would reach the surface of metal sooner than in a bag with a lower water vapor transmission rate. The VCI packaging compositions of the present invention containing fillers have improved breathability, showed increased water vapor transmission rates (WVTR), improved process-ability in extrusion equipment, less blocking which allows the bags made with this material to be opened more easily, lower cost without sacrificing the mechanical properties of the product, and better corrosion resistance than compositions containing the same amounts and types of VCIs therein but no fillers. These and other aspects of the present invention are achieved by utilizing a blend of PLA and/or an aromatic aliphatic polyester copolymer with one or more VCI compounds and one or more fillers. A biodegradable volatile corrosion inhibitor polyester composition, comprises one or more biodegradable random copolymer polyesters and/or one or more biodegradable homopolymer polyesters; from about 0.1 wt. % to about 10 wt. % of one or more volatile corrosion inhibitors based upon 100 total parts by weight of said one or more biodegradable random copolymer polyesters and/or said one or more biodegradable homopolymer polyesters; and from about 3 to about 53 parts by weight of at least one filler based upon 100 parts by weight of said one or more biodegradable random copolymer polyesters and/or said one or more biodegradable homopolymer polyesters. DETAILED DESCRIPTION OF THE INVENTION The present invention relates to biodegradable VCI compositions that are desirable for many uses including packaging of various items, apparatus, machines, parts, and the like. Such items are contained within, encased, wrapped, or otherwise exist within the biodegradable VCI packaging compositions of the present invention. The packaging material preferably is in the form of a sheet or film that can be used to form a container, enclosure, or box for the above-noted items to be protected against corrosion. An essential component of the biodegradable VCI composition is one or more biodegradable homopolymer polyesters or one or more random copolymer polyesters, or both. Polymers that can be used as one or more homopolymer polyesters such as a polylactide, polycaprolactone, a blend of PLA and polycaprolactone, a polyglycolide, or polyhydroxyalkanoates (PHA), or any combination thereof, that desirably is relatively pure, that is contains no contaminates or polymers therein. That is, it generally contains less than about 3 or about 1 wt. % of any contaminate, desirably less than about 0.5 wt. %, and preferably less than about 0.1 wt. % or nil, has no contaminates whatsoever that exist. Typical molecular weights of commercial polylactide homopolymers or other homopolymer polyesters can be utilized wherein the weight average molecular weight thereof is from about 100,000 to about 175,000, desirably from about 110,000 to about 150,000, and preferably from about 125,000 to about 140,000 g/mol. One or more polylactides can be utilized that differ in molecular weight, and/or are obtained from a different manufacturer. As by way of example only, a suitable polylactide that can be used in the present invention is PLA 3052D, made by Natureworks. In addition to the one or more biodegradable homopolymer polyesters, or in lieu thereof, one or more random copolymer polyesters such as an aliphatic-aromatic random copolyester or a random aliphatic copolyester can be utilized. The number and type of random copolyesters are large and generally have the formula: where R1, independently comprises= wherein, x, independently, is an integer from about 2 to about 10, or about 34 (dimer fatty acid), wherein, y, independently, is an integer of from 2 to about 8. Desirably, —(CH2)x—can be derived from an adipic acid, sebacic acid, or azelaic acid, and —(CH2)y—can be derived from 1,4-butanediol or ethylene glycol. The number of “m” and “n” repeat units is such that the total weight average molecular weight of the random copolymer is as set forth below. Examples of suitable compostable random copolymer polyesters include polybutylene sebacate-co-terephthalate (PBST), with polybutylene adipate-co-terephthalate (PBAT) being preferred. The weight average molecular weight of the one or more random copolymer polyesters, independently, can range from about 80,000 to about 175, 000 with a desirable weight average molecular weight being from about 90,000 to about 150,000, and preferably from about 100,000 to about 130,000. The weight average molecular weight of the above-noted polylactide homopolymer polyesters as well as the random copolymer polyesters was determined by gel permeation chromatography (GPC) wherein the polymer was dissolved in chloroform, the solvent for GPC was tetrahydrofuran and the temperature was 23° C. It is an important aspect of the present invention that random copolyesters, not contain any repeat units derived from succinic acid. Such compositions have generally been found to have poor physical properties such as low tear resistance as well as low transparency, both of which are important properties for corrosion inhibiting compositions. Also, generally aliphatic-copolyesters such as PBS (poly)(butylene succinate) have poor mechanical properties and are/or also expensive. Hence, if utilized, the amount of any repeat units derived from succinic acid is very small such as less than about 10%, and desirably less than 2% based upon the total number of repeat groups in the copolymer. Preferably nil, that is no copolyesters derived from a succinic acid are utilized whatsoever based upon the total weight of the one or more biodegradable polyesters of the present invention. When a mixture of the one or more random copolymer polyesters is utilized with one or more of the homopolymer polyesters, the amount thereof (i.e. copolymer(s)) is from about 50 wt. % to about 95 wt. %, desirably from about 60 wt. % to about 90 wt. %, and preferably from about 70 wt. % to about 85 wt. % based upon 100 total parts by weight of all of the biodegradable polyesters. The amount of one or more homopolymer-polyester is from about 5 wt. % to about 50 wt. %; desirably from about 10 wt. % to about 40 wt. %, and preferably from about 15 wt. % to about 30 wt. % based on 100 total parts by weight of all of the biodegradable polyesters. If the polyester inhibitor composition is not a blend, the amount of the homopolymer or the random copolymer is of course, 100 wt. %. As an example, it has been found that high ratios of the one or more random copolyesters to the amount of the one or more homopolyesters such as PLA is important with regard to increasing the mechanical performance of the product and shelf life. According to the present invention, biodegradable VCI packaging compositions can be made from one or more homopolymers as noted above, or from one or more copolymers as noted above, or from a blend containing one or more homopolymers with one or more copolymers. Moreover, one or more fillers are generally always utilized with any of the three above-noted blends since they unexpectedly have been found to improve properties thereof as set forth hereinbelow. One or more volatile corrosion inhibitors of the present invention that can be utilized comprise of various triazoles and derivatives thereof such as benzotriazole and tolytriazole; various benzoates such as ammonium benzoate; various ammonium salts; various carbamates; various phosphates; and various alkali acid salts such as set forth in U.S. Pat. Nos. 4,973,448; 5,139,700; 5,715,945; 6,028,160; 6,156,929; 6,617,415; and 6,787,065, hereby fully incorporated by reference. Useful VCI's of the present invention preferably include various inorganic nitrites or alkali metal nitrites with potassium nitrite and sodium nitrite being preferred, as well as various sodium salts such as sodium octanoate, sodium benzoate, various benzoate acid derivatives such as 2 or 3 or 4-hydroxy-benzoic acid, ammonium benzoate and various alkali metal salts (e.g. sodium or potassium) of aliphatic carboxylic acids such as sorbic acid or a dicarboxylic acid. Such acids have from about 5 to about 18 carbon atoms. Fillers are an important aspect of the present invention to provide ease of processing, e.g. extruding the resin and anti-blocking effect for the bags made with such material, cost reduction, retention of tensile strength, reduced density of the end product, and higher stiffness. It has also been found that various one or more fillers such as talc, calcium carbonate, sodium carbonate, silicates, clay, and barites, or any combination thereof, help adjust the WVTR rates. That is, mixing the same into the overall biodegradable VCI packaging compositions improved the porosity and thus promote a desired access of more water molecules to various one or more VCI compounds. It has also been found that the higher water vapor transmission rate (WVTR) of biodegradable polyester films than that of polyethylene (PE) based films allows for lower loadings of VCI compounds for short-term applications of the biodegradable VCI packaging compositions of the present invention. Talc is a preferred filler. The total amount of the one or more fillers is generally from about 3 to about 53 parts by weight, desirably from about 5 to about 33 parts by weight, and preferably from about 5 to about 18 parts by weight based upon 100 total parts by weight of the one or more homopolymer polyesters and/or one or more random copolymer polyesters. Depending on the aspect ratio of the fillers added, they can reduce or increase the breathability than hence help with tailoring desired shelf life and usage life for different applications based on the type of filler used. The present invention is free of starch as a filler, that is, it has no starch. A unique advantage of the present invention due to the various factors that contribute to a high WVTR of the present invention is that only low amounts of such VCI compounds need be utilized. That is, the various one or more VCI's compounds range from about 0.1 wt. % to about 10 wt. %, desirably from about 0.3 wt. % to about 5 wt. %, and preferably from about 0.5 wt. % to about 2 or about 0.9 wt. % based on the total weight, e.g. 100 total parts by weight, of the one or more homopolymer polyesters and/or the one or more random copolymer polyesters. In other words, the total amount of one or more VCI's utilized in the present invention can vary widely. The preparation of the various different formulations of the biodegradable VCI packaging composition of the present invention can generally be carried out in any manner known to the art and to the literature. With respect to the present invention, various pre-masterbatches are initially prepared and then subsequently all are mixed together at a temperature above the melting point biodegradable compounds such as the various types of polyesters disclosed herein above. For example, from about 1 to about 10 parts by weight of one or more VCI's are added to about 20 parts by weight of one or more random polyesters and/or one or more of the homopolymer polyester polymers of the present invention to form a VCI masterbatch. Since the final total amount of VCI in the final composition is less than 10 wt. %, based upon the total weight of the one or more homopolymer polyesters and/or the one or more copolymer polyesters, the amount of VCI masterbatch is subsequently added to an existing fair amount of biodegradable polyesters to yield a biodegradable polyester composition having, as noted above, that is from about 0.1 wt. % to about 10 wt. %, desirably from about 0.3 wt. % to about 5 wt. %, and preferably from about 0.5 wt. % to about 2 wt. % of a VCI therein based on the total weight of only said polyesters. The preparation of the VCI masterbatch can generally be carried out in any heating and mixing device, such as an extruder, an internal mixer, or preferably a twin-screw extruder, wherein the mixing temperatures are above the melting point of the random copolyesters. A filler masterbatch is generally made in the same manner wherein small amounts by weight of the filler are added to a large amount of the one or more random copolyesters, and/or one or more homopolymer polyester polymers. Subsequently, a small amount of the filler masterbatch is added to a larger amount of the biodegradable polyesters to form an end composition having the desired amount of filler therein. Of course, the blending temperature of the one or more fillers to form the filler masterbatch is a temperature above the melting point of the one or more random copolyesters. In other words, to prepare the formulations of the present invention, a composition is made containing 100 parts by weight of the one or more homopolymer polyesters and/or one or more random copolymer polyesters. To this is added an appropriate amount of the VCI so that based upon a final total amount of 100 parts by weight of the desired biodegradable polyesters, the amount of VCI is, as noted above, from about 0.1 wt. % to about 10 wt. % thereof. Then the filler masterbatch added in appropriate amounts so that the total final amount of the one or more biodegradable polyesters is 100 parts by weight and the amount of the one or more fillers is within the above-noted weight ranges. That is, once the various desired masterbatches have been made with respect to the one or more VCI compounds, the one or more filler compounds, all of the necessary masterbatches are mixed together with additional amounts of biodegradable random copolyesters and/or a desired amount of a one or more biodegradable homopolyesters to form the final biodegradable VCI packaging composition. The mixing can be carried out in any desired mixing device such as calender, an extruder, and so forth and shaped either into pellets, granulars, and the like, or directly formed into the end product such as a sheet, bag or wrapper having a desired thickness. With regard to the present invention, sheets having a thickness of from about 0.5 to about 8 mils, and desirably from about 0.8 to about 5.0 mils, and preferably about 1.5 to about 2.5 mil thickness that subsequently can be utilized to form a container, an enclosure, or the like to protect generally a metal article or item from corrosion. Moreover, the packaging composition of the present invention can be one or more laminates having one or more sheets therein. For example, a first sheet can comprise the one or more homopolymer polyester polymers and the above noted one or more random copolymer polyesters that contain a VCI therein and one of the above noted fillers therein. A second sheet of the laminate can comprise only said one or more biodegradable random copolymer polyesters optionally comprising a filler and optionally comprising a VCI. It should be obvious that many other different types of laminates can be made from the biodegradable volatile corrosion inhibitor polyester compositions of the present invention. According to the present invention, breathable biodegradable volatile corrosion inhibitor packaging compositions can be prepared having a broad range of WVTR such as from about 100 to about 2000, desirably from about 300 to about 1000, and preferably from about 400 to about 600[g/(m2 d)] at 38° C./90% RH, normalized to 1 mil according to ASTM F1249. The present invention will be better understood by reference to the following examples which serve to illustrate the present invention, but not to limit the same. The following standard tests realized for determining properties of the prior art as well as the present invention. EXAMPLE 1: PBAT pellets were dried at 50° C., for minimum of 2 hours and mixed with grinded sodium nitrite powder (VCI#1) at 70 to 30 ratio. The mixture was then fed to the feed port of a twin-screw counter-rotating LabTech® extruder having L/D of 44 and screw diameter of 26 mm, in which most of the zones were controlled at temperatures in the range from about 270° F. to 290° F. The die temperature was maintained at 300° F. The motor speed was about 150 rpm and generates a “strand” which was cooled in a water bath, pelletized into pellets about 3.18 mm (0.125 in) and dried. The VCI MB was then mixed with similarly dried PBAT and PBAT/filler pellets and/or PLA at stated in Table 1 and extruded into a film via blown film line, run at 5 ft/min at 60 micron thickness. A control sample was made with a blend of LDPE and LLDPE with comparable level of VCI in it for comparison. In Contact corrosion testing the panel inside the PE based resin, which have lower WVTR showed several corrosion areas along the edges and more than three spots on the panels' body when tested according to IEC 68-2-30 Cyclic Chamber Testing. The panels in PE bags which would be the control received grade 3, while the panels in this example with biodegradable resins, PBAT/filler, and PBAT/PLA/filler blend, showed no corrosion and were graded at 5, after 7 cycles. The WVTR of the LDPE/LLDPE (Control) sample was below 11 [g/(m2·d)] versus above 300 [g/(m2·d)] at 38° C./90% RH for said above Example 1. The VCI testing according to NACE Standard TM0208, showed grade 3 for the biodegradable sample for the present invention and grade 2 for the PE based control sample with comparable VCI content. Example PBAT PLA Filler VCI 1 1 100 0 8.18777 0.98253 1 100 5.77367 8.18777 0.98253 The same drying procedure and compounding equipment and procedure was used for all examples included here. Example 2 Another samples was made in a similar process of making a MB first and then blending that with the film resins in which a different powder mixture chemistry was used and the effectiveness of the chemistry was evaluated. The power mixture was composed of, 68% sodium octanoate, 7% 4-Hydroxy Benzoate, 3% Benzotriazole, and 22% Ammonium benzoate. This mix is going to be called VC1#2 going forward. The mixture was then mixed with PBAT pellets at 70 to 30% ratio to make a master-batch. This was compared to, 87% sodium octanoate, 9% 4-Hydroxy Benzoate, 4% Benzotriazole, called VCI#3. Each powder mixture was then mixed with PBAT pellets at 70 part to 30 part ratio to make the master-batch. After that, the film was made by mixing the above MB at the loadings below with PLA, PBAT and filler through MB and the rest of comprised as PBAT. The contact testing in cyclic atmospheric chamber running according to (IEC 68-2-30) for both examples showed the first mixture VCI#2 to get a grade 4-5 protection compared to the VCI#3 which got grade 2 rating. The NACE Standard TM0208 test showed grade 3 for the first formulation and grade 1 for the second set. Example PBAT PLA Filler VCI 2 VCI 3 2 83.89 16.11 6.44468 1.15237 0 2 83.89 16.11 6.44468 0 1.15237 Example 3 Similar to Example 1 and just with a different VCI chemistry, the VCI#2 was added at similar loading PBAT/filler in one case, and to LDPE/LLDPE blend in another case as the control. The PBAT/VCI film showed no corrosion (grade 5) while quite a few spot (grade 3) was observed in control, LDPE/LLDPE film with comparable VCI concentration after 1 week of testing, 7 cycles of (IEC 68-2-30). Example PBAT PLA Filler VCI 2 3 100 0 8.188 0.98253 Example 4 VCI#2, was added to PBAT/filler mix at the same loading, with the difference between the two set being the filler level, one at lower filler and one at higher filler level. The set with higher filler level showed better protection in the cyclic chamber test running according to (IEC 68-2-30) after two weeks (14 cycles). The rating for the higher filler was 4-5 while it was 3-4 for lower filler samples. The water vapor transmission rate of the higher filler film was 412 [g/(m2 d)] versus the WVTR of the lower loading being 323 [g/(m2 d)] (normalized) tested at 38° C./90% RH. Example PBAT PLA Filler VCI 2 4 100 0 17.417 1.06635 4 100 0 8.18777 0.98253 Example 5 VCI#3 that showed weaker result in example #2, however, when used with higher filler level, showed improved result. While lower filler containing sample showed grade 2 after 14 cycles of (IEC 68-2-30) test, higher filler sample showed grade 3. Example PBAT PLA Filler VCI 3 5 100 0 17.417 1.06635 5 100 0 8.18777 0.98253 While in accordance with the patent statutes, the best mode and preferred embodiment have been set forth, the scope of the invention is not limited thereto, but rather by the scope of the attached claims. 1-20. (canceled) 21. A biodegradable volatile corrosion inhibitor polyester composition, comprising: polyester comprising one or more biodegradable random copolymer polyesters and/or one or more biodegradable homopolymer polyesters; volatile corrosion inhibitors comprising: (i) one or more salts of carboxylic acid, (ii) one or more ammonium salts, and (iii) one or more of benzoic acid, sorbic acid, and a benzoic acid derivative; and at least one filler. 22. The composition of claim 21, comprising one or more copolymer polyesters having the formula: wherein R1, is x is an integer in the range of 2 to 10, y is an integer in the range of 2 to 8; and m and n are selected such that the weight average molecular weight of the copolymer polyester is about 80,000 to about 175,000. 23. The composition of claim 21, comprising one or more copolymer polyesters selected from polybutylene sebacate-co-terephthalate (PBST) and polybutylene adipate-co-terephthalate (PBAT). 24. The composition of claim 21, comprising one or more copolymer polyesters that does not contain any repeat units derived from succinic acid. 25. The composition of claim 21, comprising one or more homopolymer polyesters selected from polylactides, polycaprolactones, polyglycolides, polyhydroxyalkanoates, and combinations thereof. 26. The composition of claim 25, wherein the homopolymer polyester comprises a polylactide and the filler comprises talc. 27. The composition of claim 21, comprising a blend of one or more copolymer polyesters and one or more biodegradable homopolymer polyesters, wherein the total weight of copolymer polyesters is about 50 wt % to about 95 wt % based on the total weight of the blend, and the total amount of homopolymer polyesters is about 5 wt % to about 50 wt % based on the total weight of the blend. 28. The composition of claim 21, wherein the weight average molecular weight of the one or more copolymer polyesters is about 90,000 to about 150,000, and the weight average molecular weight of the one or more homopolymer polyesters is about 125,000 to about 140,000. 29. The composition of claim 21, wherein the volatile corrosion inhibitors are present in a total amount of about 0.1 wt % to about 10 wt % based on the total weight of the polyester. 30. The composition of claim 21, wherein the volatile corrosion inhibitors comprise one or more of sodium octanoate, ammonium benzoate, and sorbic acid. 31. The composition of claim 21, wherein the one or more salts of carboxylic acid comprise one or more alkali metal salts of aliphatic carboxylic acids having 5 to 18 carbon atoms. 32. The composition of claim 21, wherein the volatile corrosion inhibitors consist of: (i) one or more salts of carboxylic acid, (ii) one or more ammonium salts, and (iii) one or more of benzoic acid, sorbic acid, and a benzoic acid derivative. 33. The composition of claim 21, wherein the at least one filler comprises talc, calcium carbonate, a silicate, sodium carbonate, clay, barite, or a combination thereof. 34. The composition of claim 21, comprising about 3 to about 53 parts by weight of filler based on 100 total parts by weight of the polyester. 35. The composition of claim 21, wherein the composition exhibits a corrosion-protective effect of Grade 3 or higher according to NACE Standard TM0208. 36. A film comprising the composition of claim 21, wherein the film has a thickness of about 0.5 mils to about 8 mils. 37. A volatile corrosion inhibitor-containing concentrate, comprising: volatile corrosion inhibitors comprising: (i) one or more salts of carboxylic acid, (ii) one or more ammonium salts, and (iii) one or more of benzoic acid, sorbic acid, and a benzoic acid derivative; and polyester comprising one or more biodegradable random copolymer polyesters and/or one or more biodegradable homopolymer polyesters; wherein a ratio of volatile corrosion inhibitors to polyester in the concentrate is in the range of about 1:20 to about 10:20.

2020-06-30

en

2022-06-16

US-201917613207-A

Assignment of Transceiver Antenna Elements for Channel Sensing ABSTRACT A method is disclosed for a wireless transceiver comprising a plurality of transceiver antenna elements and configured to operate in a communication network. The method comprises dynamically assigning (from the plurality of transceiver antenna elements) a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication, performing channel sensing using the first set of transceiver antenna elements, and operating the wireless transceiver based on a result of the performed channel sensing. For example, dynamically assigning the first and second sets of transceiver antenna elements may comprise (in a non-communication mode of the wireless transceiver) letting the first set comprise all of the transceiver antenna elements and letting the second set be empty, (in a communication transmission mode of the wireless transceiver) letting the first set comprise a first subset of the transceiver antenna elements and letting the second set comprise a second subset of the transceiver antenna elements, wherein the first and second subsets are nonoverlapping, and (in a communication reception mode of the wireless transceiver) letting the first set comprise a third subset of the transceiver antenna elements and letting the second set comprise a fourth subset of the transceiver antenna elements, wherein the third and fourth subsets are non-overlapping or overlapping. Corresponding apparatus, wireless transceiver, access node, user device and computer program product are also disclosed. TECHNICAL FIELD The present disclosure relates generally to the field of wireless communication. More particularly, it relates to channel sensing in wireless communication. BACKGROUND For a communication node (e.g., an access node such as an access point, AP, or a base station, a gNB for example; or a user device such as a user station, STA, or a user equipment, UE) to be allowed to transmit in unlicensed spectrum, it is typically required that the communication node performs a successful clear channel assessment (CCA) procedure (also known as a Listen Before Talk (LBT) procedure) before transmission. To claim this procedure to be successful, it is typically required to sense the medium to be unoccupied (e.g., idle) for a number of time intervals. After sensing the medium to be unoccupied, a communication node is typically allowed to transmit in a burst-like fashion for a maximum amount of time; sometimes referred to as the MCOT (Maximum Channel Occupancy Time). The length of the MCOT may, for example, depend on regulations applicable in the unlicensed spectrum and on the type of LBT that has been performed. The length of the MCOT may typically range from 1 ms to 10 ms. In some scenarios relating to application of MCOT, a gNB can share its channel occupancy (after successfully completing a long LBT procedure) with uplink transmissions from one or more UEs; e.g., may schedule UEs to transmit during the MCOT. One goal with introduction of such a concept of sharing the MCOT is to decrease (e.g., minimize) the need for UEs to perform long LBT procedures prior to transmissions in the uplink. A UE may, when scheduled accordingly, be required to perform a short LBT procedure immediately following a downlink transmission from the gNB. To exemplify the concept of long/short LBT procedure, reference is made to Third Generation Partnership Project (3GPP) technical report TR 36.889, v13.0.0 (see, e.g., section 8.2), where four LBT categories (Categories 1-4) are used. When a long LBT procedure is referred to herein, it may refer to an LBT procedure with random backoff and Category 3 and Category 4 are examples thereof. When a short LBT procedure is referred to herein, Category 2 is one example thereof. Other standardization specifications also deal with the concept of LBT. In general, long or short LBT denotes the time spent to take to access the channel in a fair manner. And in general, Short LBT may be used for high priority traffic that are not too frequent or not that long in duration, and long LBT may be used for background or low priority traffic. High-priority traffic thus has a higher chance of being sent than low-priority traffic. For these and/or other reasons, there is a need for proper channel sensing approaches. SUMMARY It should be emphasized that the term “comprises/comprising” (replaceable by “includes/including”) when used in this specification is taken to specify the presence of stated features, integers, steps, or components, but does not preclude the presence or addition of one or more other features, integers, steps, components, or groups thereof. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. Generally, when an arrangement is referred to herein, it is to be understood as a physical product; e.g., an apparatus. The physical product may comprise one or more parts, such as controlling circuitry in the form of one or more controllers, one or more processors, or the like. It is an object of some embodiments to solve or mitigate, alleviate, or eliminate at least some of the above or other disadvantages. A first aspect is a method for a wireless transceiver comprising a plurality of transceiver antenna elements and configured to operate in a communication network. The method comprises dynamically assigning, from the plurality of transceiver antenna elements, a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication. The method also comprises performing channel sensing using the first set of transceiver antenna elements, and operating the wireless transceiver based on a result of the performed channel sensing. In some embodiments, a transceiver antenna element of the plurality is configured to dynamically switch between transmission operation and reception operation. In some embodiments, a transceiver antenna element of the plurality is configured to dynamically switch between communication operation and sensing operation. In some embodiments, a selection of which transceiver antenna elements belongs to the first and second sets is variable. In some embodiments, cardinalities of the first and second sets are variable. In some embodiments, the cardinality of the second set is variable between zero and the plurality, and can take at least two values which differ from zero and the plurality. In some embodiments, the cardinality of the first set is variable between one and the plurality, and can take at least one value which differs from the plurality. In some embodiments, dynamically assigning the first and second sets of transceiver antenna elements comprises determining cardinalities of the first and second sets based on one or more of: a communication mode of the wireless transceiver, network statistics collected by the wireless transceiver, network statistics collected by one or more other wireless transceivers, one or more previous results of channel sensing performed by the wireless transceiver, and one or more previous results of channel sensing performed by one or more other wireless transceivers. In some embodiments, dynamically assigning the first and second sets of transceiver antenna elements comprises (in a non-communication mode of the wireless transceiver) letting the first set comprise all of the transceiver antenna elements and letting the second set be empty, and/or (in a communication transmission mode of the wireless transceiver) letting the first set comprise a first subset of the transceiver antenna elements and letting the second set comprise a second subset of the transceiver antenna elements, wherein the first and second subsets are non-overlapping, and/or (in a communication reception mode of the wireless transceiver) letting the first set comprise a third subset of the transceiver antenna elements and letting the second set comprise a fourth subset of the transceiver antenna elements, wherein the third and fourth subsets are non-overlapping or overlapping. In some embodiments, a size of the first subset is determined based on one or more previous results of channel sensing performed by the wireless transceiver and/or by one or more other wireless transceivers. In some embodiments, the channel sensing is performed while communication is performed using the second set of transceiver antenna elements in communication transmission and/or reception modes of the wireless transceiver. In some embodiments, the channel sensing comprises omnidirectional channel sensing and/or directional channel sensing. In some embodiments, the channel sensing is performed periodically in time and/or is performed in response to a channel sensing triggering event. In some embodiments, operating the wireless transceiver based on the result of the performed channel sensing comprises (when the performed channel sensing detects an interfering signal in communication transmission mode of the wireless transceiver) determining to continue an ongoing transmission when the interfering signal is detected to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal succeeds, determining to stop the ongoing transmission when the interfering signal is determined to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal fails, and determining to stop the ongoing transmission when the interfering signal is detected to originate from a different communication network. In some embodiments, wherein the channel sensing is directional channel sensing performed in one direction, operating the wireless transceiver based on the result of the performed channel sensing comprises (in communication transmission and/or reception modes of the wireless transceiver) selecting whether or not to use the direction for an upcoming transmission or reception opportunity based on signal detection for the direction during the channel sensing. In some embodiments, wherein the channel sensing is directional channel sensing performed in two or more directions, operating the wireless transceiver based on the result of the performed channel sensing comprises (in communication transmission and/or reception modes of the wireless transceiver) selecting one or more direction of the two or more directions for an upcoming transmission or reception opportunity, wherein the channel sensing of the selected one or more direction detected less interference or lower received signal strength than the channel sensing of at least one of the non-selected directions. In some embodiments, operating the wireless transceiver based on the result of the performed channel sensing comprises transmitting a channel sensing report including the result to one or more other wireless transceivers and/or to a channel sensing statistics server. A second aspect is a computer program product comprising a non-transitory computer readable medium, having thereon a computer program comprising program instructions. The computer program is loadable into a data processing unit and configured to cause execution of the method according to the first aspect when the computer program is run by the data processing unit. A third aspect is an apparatus for a wireless transceiver comprising a plurality of transceiver antenna elements and configured to operate in a communication network. The apparatus comprises controlling circuitry configured to cause dynamic assignment (from the plurality of transceiver antenna elements) of a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication. The controlling circuitry is also configured to cause performance of channel sensing using the first set of transceiver antenna elements, and operation of the wireless transceiver based on a result of the performed channel sensing. A fourth aspect is a wireless transceiver comprising the apparatus of the third aspect. A fifth aspect is an access node comprising one or more of the apparatus of the third aspect and the wireless transceiver of the fourth aspect. A sixth aspect is a user device comprising one or more of the apparatus of the third aspect and the wireless transceiver of the fourth aspect. In some embodiments, any of the above aspects may additionally have features identical with or corresponding to any of the various features as explained above for any of the other aspects. An advantage of some embodiments is that alternative channel sensing approaches are provided. Another advantage of some embodiments is that flexible channel sensing approaches are provided. Thereby, in some embodiments, sensing can be achieved when needed (even during communication—reception or transmission—by the sensing node) while transceiver antenna elements are not tied up for sensing when not needed. Yet an advantage of some embodiments is that channel sensing may be improved (e.g., by obtaining a trade-off between benefits of omnidirectional and directional sensing). A further advantage of some embodiments is that the channel sensing approach entails no, or negligible, signaling overhead. Yet an advantage of some embodiments is that a communication network operating with one or more wireless transceivers according to embodiments presented herein yields higher resilience and/or robustness in the presence of transceiver nodes capable of beamformed transmissions (compared to prior art solutions). BRIEF DESCRIPTION OF THE DRAWINGS Further objects, features and advantages will appear from the following detailed description of embodiments, with reference being made to the accompanying drawings. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the example embodiments. FIG. 1 is a flowchart illustrating example method steps according to some embodiments; FIG. 2 is a schematic drawing illustrating example assignment of transceiver antenna elements according to some embodiments; FIG. 3 is a schematic drawing illustrating an example communication scenario according to some embodiments; FIG. 4 is a schematic block diagram illustrating an example apparatus according to some embodiments; FIG. 5 is a schematic drawing illustrating an example computer readable medium according to some embodiments; FIG. 6 illustrates a telecommunication network connected via an intermediate network to a host computer in accordance with some embodiments; FIG. 7 illustrates a host computer communicating via a base station with a user equipment over a partially wireless connection in accordance with some embodiments; FIG. 8 is a flowchart illustrating example method steps implemented in a communication system including a host computer, a base station and a user equipment in accordance with some embodiments; FIG. 9 is a flowchart illustrating example method steps implemented in a communication system including a host computer, a base station and a user equipment in accordance with some embodiments; FIG. 10 is a flowchart illustrating example method steps implemented in a communication system including a host computer, a base station and a user equipment in accordance with some embodiments; and FIG. 11 is a flowchart illustrating example method steps implemented in a communication system including a host computer, a base station and a user equipment in accordance with some embodiments. DETAILED DESCRIPTION As already mentioned above, it should be emphasized that the term “comprises/comprising” (replaceable by “includes/including”) when used in this specification is taken to specify the presence of stated features, integers, steps, or components, but does not preclude the presence or addition of one or more other features, integers, steps, components, or groups thereof. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. Embodiments of the present disclosure will be described and exemplified more fully hereinafter with reference to the accompanying drawings. The solutions disclosed herein can, however, be realized in many different forms and should not be construed as being limited to the embodiments set forth herein. Generally, when detection of interference is referred to herein, it may encompass any un-wanted signal detection (e.g., detection of one or more signals not intended for the wireless transceiver performing the detection). To exemplify one scenario where embodiments may be beneficial, a problem experienced when using unlicensed spectrum will now be described. The evolution of wireless communication systems, e.g., the concept of new radio (NR), points towards designs that heavily rely on spatial beamforming. Therefore, transceiver nodes, such as gNBs, are typically equipped with many antennas (a.k.a. antenna elements, often arranged in an antenna array). In the context of operation in unlicensed spectrum, beamforming achievable by the many antennas may provide possibilities to enhance link quality (e.g., via array gain) and/or possibilities to increase the spatial reuse. However, a challenge when using beamforming for communication in the context of operation in unlicensed spectrum is that the risk of collision between transmissions from two or more nodes may increase. For omni-directional (i.e., non-beamformed) transmissions, it is likely that all relevant nodes detects ongoing transmission(s) during their LBT procedure since the transmitted power is radiated in every direction and not only steered in the direction(s) towards the intended receiver(s). For beamformed transmissions, it is typically less likely that all relevant nodes detect ongoing transmission(s) during their LBT procedure; especially for nodes in different directions than the intended receiver(s). A node that does not detect ongoing transmissions during its LBT procedure may subsequently start transmitting, which may cause interference problems (e.g., for the receiver(s) of the ongoing transmission(s), inter-cell interference, and/or intra-cell interference). Such a situation may also lead to less power efficient operation at the node itself and/or at other nodes and/or to high latency, since collisions typically result in retransmissions. When communication of a first node uses beamforming, it may seem beneficial to use beamformed sensing (a.k.a., directional sensing) for the first node, for example, since it may seem that it is only relevant that the channel is unoccupied in the direction of the intended transmission of the first node. However, as implicated above such an approach may lead to increased collision risk. On the other hand, omni-directional sensing may not be able to cover as large distances as directional sensing, and may potentially not provide the large degree of spatial reuse that beamformed transmissions can offer. For operation in unlicensed spectrum, omni-directional LBT procedures are typically performed before transmission. There are techniques to enable directional (e.g., beamformed) transmissions: quasi-omni-directional LBT, and directional LBT. For example, IEEE 802.11ad/ay systems perform LBT with energy detection (ED) considering no array gain, which is called quasi-omni-directional LBT. A quasi-omni directional LBT is an LBT performed using a quasi-omni-directional antenna pattern (an operating mode of a directional multiple antenna system, which has the widest beam width attainable). Another example is LBT with energy detection via a narrow beam; which is called directional LBT. This approach typically improves the probability of successful channel access and enhances spatial reuse by focusing on performing directional transmissions. Such an approach may typically involve selecting a direction to transmit by performing LBT in various directions with a configured energy detection threshold in the specific direction, and determining if the channel is busy or idle in that specific direction. While omni-directional LBT and quasi-omni-directional LBT have the drawback that they could cause lower than desired spatial reuse, directional LBT has the drawback that it could cause interference problems as implicated above. There are some approaches for mitigation of the interference problems for directional LBT. However, these typically involve some form of receiver assistance (e.g., Ready-to-send/Clear-to-send, RTS/CTS, signaling) for confirming the channel access state at both transmitter and receiver. Thus, omni-directional LBT and quasi-omni-directional LBT, although enabling directional transmissions, may lead to an overprotected situation with lower than possible spatial reuse. For example, one strong signal sensed from one direction could block the whole channel and prevent transmissions in all other directions even if the prevented transmissions would not interfere with the strong signal. On the other hand, directional LBT may lead to the interference problems exemplified above due to the limited sensing. Moreover, directional LBT needs to cover at least one direction per transmission. Furthermore, the overhead caused by directional LBT could be increased compared with omni-directional LBT or quasi-omnidirectional LBT. Approaches for mitigation of the interference problems for directional LBT are typically based on handshaking procedures and/or channel reservation messages. These approaches may cause signaling overhead for each transmission. Moreover, they are typically originally designed for single antenna nodes and do not exploit the additional spatial degrees of freedom offered by antenna arrays. Another drawback is that the channel may be free during the handshaking procedure, while busy when the actual data needs to be transmitted. In the following, embodiments will be described where various channel sensing approaches are applied. FIG. 1 illustrates an example method 100 according to some embodiments. The method is for a wireless transceiver (e.g., comprised, or comprisable, in an access node or a user device) comprising a plurality of transceiver antenna elements and configured to operate in a communication network. Generally, the plurality of transceiver antenna elements may be any suitable collection of two, three, four, five, six, seven, eight, or more transceiver antenna elements; typically a collection of a relatively large number (e.g., 10 or more, 20 or more, 50 or more, 100 or more, etc.) of transceiver antenna elements. The communication network may typically provide a communication environment requiring channel sensing before transmission. Typically, the communication network may operate in an unlicensed frequency band. Generally, channel sensing may comprise any suitable approach, for example, one or more of: listen-before-talk (LBT), clear channel assessment (CCA), and carrier sense multiple access with collision avoidance (CSMA/CA). For example, the plurality of transceiver elements may be organized in a multi-antenna structure, such as an antenna array or an antenna matrix. FIG. 2 schematically illustrates an example antenna array 200 comprising a plurality of antenna elements 201, 202, 203, 204, 205, 206 in relation to three example assignment scenarios that will be elaborated on later herein. Returning to FIG. 1, the method 100 comprises dynamically assigning, from the plurality of transceiver antenna elements, a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication, as illustrated in step 110. Typically, channel sensing using the first set of transceiver antenna elements can be (partly or fully) simultaneous to communication using the second set of transceiver antenna element. Communication may, for example, comprises communication of payload data, control data, or any other information carrying data. Furthermore, communication may comprise transmission and/or reception. Assigning the first and second sets of transceiver antenna elements may, for example, comprise partitioning the plurality of transceiver antenna elements into two non-overlapping groups of transceiver antenna elements. The two non-overlapping groups may together comprise all transceiver antenna elements in the plurality of transceiver antenna elements, or may together comprise a subset of the transceiver antenna elements in the plurality of transceiver antenna elements. Assigning the first and second sets of transceiver antenna elements may, alternatively or additionally, comprise partitioning the plurality of transceiver antenna elements into two overlapping groups of transceiver antenna elements. The two overlapping groups may together comprise all transceiver antenna elements in the plurality of transceiver antenna elements, or may together comprise a subset of the transceiver antenna elements in the plurality of transceiver antenna elements. In some embodiments, at least one transceiver antenna element of the plurality of transceiver antenna elements is configured to dynamically switch between transmission operation and reception operation, thereby enabling dynamic assignment. For example, a subset, or all, of the transceiver antenna elements of the plurality of transceiver antenna elements may be configured to dynamically switch between transmission operation and reception operation. Thus, each antenna element of the plurality of transceiver antenna elements may be configured to dynamically switch between transmission operation and reception operation according to some embodiments. Alternatively or additionally, in some embodiments, at least one transceiver antenna element of the plurality of transceiver antenna elements is configured to dynamically switch between communication operation and sensing operation, thereby enabling dynamic assignment. For example, a subset, or all, of the transceiver antenna elements of the plurality of transceiver antenna elements may be configured to dynamically switch between communication operation and sensing operation. Thus, each antenna element of the plurality of transceiver antenna elements may be configured to dynamically switch between communication operation and sensing operation according to some embodiments. The dynamic assignment of step 110 may comprise that cardinalities of the first and second sets are variable. Thus, the first set may have a first cardinality in a first assignment and a second cardinality in a second assignment, wherein the first and second cardinalities are different or the same; and correspondingly for the second set. The cardinality of the second set may, according to some embodiments, be variable between zero and the plurality, wherein it can take at least two (e.g., two, three, four, or more) values which differ from zero and the plurality. Thus, there is at least one possible second set not comprising exactly half of the plurality of transceiver antenna elements according to these embodiments. In one example, the second set may be able to have all possible cardinalities between (and including) zero and the plurality. In another example, the second set may be able to have all possible cardinalities between (but excluding at least one of) zero and the plurality. The cardinality of the first set may have similar properties as described above for the cardinality of the second set. Alternatively, the cardinality of the first set may, according to some embodiments, be variable between one and the plurality, wherein it can take at least one (e.g., one, two, three, four, or more) value which differs from the plurality. Thus, there is at least one possible first set not comprising the whole plurality of transceiver antenna elements according to these embodiments. In some of these embodiments, there is further at least one possible first set not comprising exactly half of the plurality of transceiver antenna elements. In one example, the first set may be able to have all possible cardinalities between (and including) one and the plurality. In another example, the first set may be able to have all possible cardinalities between (but excluding at least one of) one and the plurality. Additionally or alternatively to cardinalities of the first and second sets being variable, the dynamic assignment of step 110 may comprise that it is variable which transceiver antenna elements belongs to the first and second sets. For example, even if the first set of two different assignments has the same cardinality, one or more of the transceiver antenna elements of the first set of one of the assignments may differ from the transceiver antenna elements of the first set of the other one of the assignments, and vice versa. Similarly, even if the second set of two different assignments has the same cardinality, one or more of the transceiver antenna elements of the second set of one of the assignments may differ from the transceiver antenna elements of the second set of the other one of the assignments, and vice versa. Varying which transceiver antenna elements belongs to the first and second sets may, for example, improve coverage of the sensing. In some embodiments, dynamically assigning the first and second sets of transceiver antenna elements in step 110 comprises determining cardinalities of the first and second sets and/or which transceiver antenna elements belongs to the first and second sets based on one or more of: a communication mode of the wireless transceiver, network statistics collected by the wireless transceiver, network statistics collected by one or more other wireless transceivers one or more previous results of channel sensing performed by the wireless transceiver, and one or more previous results of channel sensing performed by one or more other wireless transceivers. For example, if the last K channel sensing operations resulted in a ratio between signal detections and clear channel detections which exceeds some threshold value, the number of antenna elements allocated for channel sensing may be increased (and/or the channel sensing may be performed more often). Network statistics may, for example, relate to acknowledgement signaling: a number of acknowledgments (#ACK), a number of negative acknowledgments (#NACK), and/or an acknowledgement rate #ACK/(#ACK+#NACK)—possibly during a specified duration of time (e.g., last p seconds). Alternatively or additionally, network statistics may, for example, relate to an error rate (e.g., a packet error rate, PER, a block error rate, BLER, a bit error rate, BER, etc.). Acknowledgement signaling and/or error rates for the network statistics may relate to the wireless transceiver collecting the statistics, and/or may relate to other wireless transceivers (e.g., the entire network). For example, when the acknowledgement rate is above a first threshold value, the number of antenna elements allocated for channel sensing may be decreased and the number of antenna elements allocated for communication may be increased; while the number of antenna elements allocated for channel sensing may be increased and the number of antenna elements allocated for communication may be decreased when the acknowledgement rate is below a second threshold value. The number of antenna elements allocated for channel sensing and the number of antenna elements allocated for communication may be kept unchanged when the acknowledgement rate is below the first threshold value and above the second threshold value. Alternatively or additionally, the acknowledgement rate may be contrasted against a table that implements a mapping between the acknowledgement rate and the number of antenna elements allocated for channel sensing and communication, respectively. The table may, for example, be built using artificial intelligence algorithms based on, e.g., information on how well the communication network and/or the wireless transceiver has operated previously (e.g., in terms of throughput) for different acknowledgement rates. Example operation modes may comprise one or more of a non-communication mode (e.g., an idle mode or similar), a transmission communication mode (also termed communication transmission mode herein), and a reception communication mode (also termed communication reception mode herein). In some embodiments, dynamically assigning the first and second sets of transceiver antenna elements comprises assignment based on one or more of the wireless transceiver being in non-communication mode, transmission communication mode, and reception communication mode. In a non-communication mode of the wireless transceiver, dynamic assignment may comprise letting the first set comprise all of the transceiver antenna elements and letting the second set be empty. Thus, all antenna elements are allocated for channel sensing (e.g., LBT) in this scenario. In a communication transmission mode of the wireless transceiver, dynamic assignment may comprise letting the first set comprise a first subset of the transceiver antenna elements and letting the second set comprise a second subset of the transceiver antenna elements, wherein the first and second subsets are non-overlapping. Possibly, but not necessarily, the first and second subsets may together comprise all of the transceiver antenna elements of the plurality. In a communication reception mode of the wireless transceiver, dynamic assignment may comprise letting the first set comprise a third subset of the transceiver antenna elements and letting the second set comprise a fourth subset of the transceiver antenna elements, wherein the third and fourth subsets are non-overlapping or (partially or fully) overlapping. Overlap of the third and fourth subsets may imply joint communication and sensing. Possibly, but not necessarily, the third and fourth subsets may together comprise all of the transceiver antenna elements of the plurality. In communication transmission mode and/or in communication reception mode the size of the first and/or second subset may be determined based on one or more previous results of channel sensing performed by the wireless transceiver and/or by one or more other wireless transceivers. After dynamic assignment in step 110, the method 100 comprises performing channel sensing using the first set of transceiver antenna elements, as illustrated in step 120. The channel sensing may comprise any suitable channel sensing approach, such as those used in, for example, LBT, CCA, or CSMA/CA. In various embodiments, the channel sensing may be performed periodically (e.g., with the periodicity depending on sensing results and/or statistics of previous sensing results by the wireless transceiver and/or by one or more other wireless transceivers) in time and/or may be performed aperiodically, e.g., in response to a channel sensing triggering event (e.g., detection of a problematic scenario in terms of channel access). For example, a period for periodically performed channel sensing may be relatively long when sensing results indicate that successful channel sensing (i.e., channel access) is likely, while it may be relatively short when sensing results indicate that successful channel sensing is not so likely. For example, a problematic scenario in terms of channel access may related to high, or otherwise problematic, interference. Detection of a problematic scenario may, for example, be achieved by detection of one or more of: a relatively low received signal strength indicator (RSSI), a relatively low signal-to-interference ratio (SIR), a relatively high bit error rate (BER), a relatively high block error rate (BLER), detection of a high ratio between negative acknowledgement (NACK) and acknowledgement (ACK), or similar. In an example of periodic channel sensing, an ongoing downlink (DL) or uplink (UL) communication takes place across several consecutive orthogonal frequency division multiplexing (OFDM) symbols and the wireless transceiver is an access node or a user device configured to activate the sensing antenna elements in a certain pre-defined number of OFDM symbols in a slot/frame (e.g., in symbol 0 and 6 of each slot). Generally, the sensing antenna elements can be activated periodically across the slot/frame with periodicity ρ OFDM symbols and a sensing length of n OFDM symbols, wherein ρ=2/14 and n=1 results in sensing in symbol 0 and 6 of each slot. Depending on the network conditions, the communication network (or the wireless transceiver) may dynamically change the values of p and/or n so that more or less sensing is performed. Thus, the periodicity ρ and/or the sensing length of n may be variable. For instance, if RSSI of the interference experienced at the wireless transceiver is higher than a threshold value during a period of time, the network can decide to decrease the periodicity ρ and/or increase the sensing length n. Alternatively or additionally, if the number of NACK over a period of time is higher than a threshold value, the network can decide to decrease the periodicity ρ and/or increase the sensing length n. In a communication network with more than one user device, the NACK counter can be based on feedback of a subset, or all, of the user devices. Furthermore, the communication network (or the wireless transceiver) may assign different sensing instances across a slot to different transceivers, which typically increases the probability of detecting problematic situations such as the hidden node problem. In an example of aperiodic channel sensing, the sensing mode is only activated when needed to increase network efficiency. For instance, the sensing mode can be triggered based on received signal strength indicator (RSSI) measurements; if RSSI of the interference experienced at the wireless transceiver is higher than a threshold value during a period of time, the network can decide to activate the sensing mode. Alternatively or additionally, the sensing mode can be triggered based on ACK/NACK history; if the number of NACK over a period of time is higher than a threshold value, the network can decide to activate the sensing mode. In a communication network with more than one user device, the NACK counter can be based on feedback of one, a subset, or all, of the user devices. The channel sensing may comprise omnidirectional channel sensing and/or directional channel sensing according to various embodiments. The dynamic assignment of transceiver antenna elements of the first set may support omnidirectional and/or directional channel sensing. For example, the larger the cardinality of the first set, the narrower beam is possible for directional channel sensing (omnidirectional sensing typically requires only one transceiver antenna element being part of the first set). In some embodiments or scenarios, as illustrated by optional step 130, the channel sensing of step 120 is performed while (e.g., partly or fully simultaneously as) communication is performed using the second set of transceiver antenna elements in communication transmission and/or reception modes of the wireless transceiver. As mentioned before, communication may comprise transmission and/or reception of payload data, control data, or any other information carrying data, for example. When performing channel sensing in communication transmission mode, part of the transmitted signal may be received in the sensing antenna arrays after being reflected back from scattering of the wireless channel. However, since the wireless transceiver has knowledge of the transmitted signal (e.g., reference signals as well as data signals), it can take that into account and remove the influence of the transmitted signal for sensing. Such removal may be achieved, for example, by means of self-interference cancelation schemes or by joint processing schemes (e.g., joint Maximum-Likelihood detection). Alternatively or additionally, the wireless transceiver can place beamforming nulls in the transmit angles where the transmitted signal would eventually reach the sensing antenna elements. When performing channel sensing in communication transmission mode, the sensing and communication reception may, in some typical embodiments, be performed jointly by the entire plurality of transceiver antenna elements; without the reserving some antenna elements exclusively for sensing. As illustrated by step 140, the method comprises—after having performed the channel sensing of step 120—operating the wireless transceiver based on a result of the performed channel sensing. Operating the wireless transceiver based on the result of the performed channel sensing may, for example, comprise to stop or continue an ongoing transmission in communication transmission mode of the wireless transceiver, as illustrated by optional sub-step 142, when the performed channel sensing detects an interfering signal. For example, when the interfering signal is detected to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal succeeds, it may be determined to continue the ongoing transmission. Alternatively or additionally, when the interfering signal is detected to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal fails, it may be determined to stop the ongoing transmission. Yet alternatively or additionally, it may be determined to stop the ongoing transmission when the interfering signal is detected to originate from a different communication network. Thus, some different options are presented herein on how the wireless transceiver may handle detection of a problematic situation (e.g., interference from an interfering transceiver, for example, due to the hidden node problem elaborated on later herein) by sensing using the first set of transceiver antenna arrays. For example, if the interfering transceiver is operating in the same communication network as the wireless transceiver, the wireless transceiver may attempt to decode what the interfering transceiver transmitted. If decoding is successful, the wireless transceiver may resolve the collision based on the decoding. Further, when the interfering transceiver stops its transmission, the wireless transceiver can inform the interfering transceiver regarding when future transmissions of the wireless transceiver will occur so that the interfering transceiver may defer from transmission during those instances. Alternatively or additionally, the wireless transceiver may handle detection of the above problematic situation by one or more of: stopping its own transmission if the interfering transceiver is from a different communication network, stopping its own transmission if the interfering transceiver is from the same communication network and the collision cannot be resolved (e.g., the interfering transmission cannot be decoded by the wireless transceiver and/or an intended receiver cannot decode the transmission from the wireless transceiver), and continuing its own transmission if the interfering transceiver is from the same communication network and the collision can be resolved (e.g., the interfering transmission can be decoded by the wireless transceiver and/or the intended receiver can decode the transmission from the wireless transceiver). When the channel sensing is directional channel sensing performed in one, two, or more direction(s), operating the wireless transceiver based on the result of the performed channel sensing may comprise selecting direction for an upcoming communication opportunity in communication transmission and/or reception modes of the wireless transceiver, as illustrated by optional sub-step 144. For example, operating the wireless transceiver according to sub-step 144 may comprise selecting whether or not to use the direction for an upcoming transmission or reception opportunity based on channel sensing in the direction (e.g., based on signals, such as interference, detected for the direction during the channel sensing). Additionally or alternatively to basing the selection of detected interference, one or more other criteria may be applied. For example, the selection of direction may be based on one or more of: interference, network statistics (e.g., NACK/ACK statistics), channel conditions (e.g., SIR), etc. In a particular example a direction may be selected when it has a good trade-off between low interference, favorable network statistics, and good instantaneous channel conditions between transmitter and receiver. The above (sub-step 144) may be applied for a single direction or for two or more directions. Application in a single direction may comprise selecting whether or not to use the direction for an upcoming transmission or reception opportunity based (only) on channel sensing in the direction. An example use case for selecting in relation to a single direction comprises a gNB performing sensing for one UE before sweeping the beam to another UE. Thus, the gNB only senses for the direction to a particular UE. This may, for example, be applicable if the gNB already succeeded to access the channel in N−1 directions and wishes to add another direction (e.g., for a time-critical application of an UE in this other direction) while having ongoing communication in the N−1 directions. Then, the gNB only needs to sense for the not yet successful direction. When the channel sensing is directional channel sensing performed in two or more directions, operating the wireless transceiver based on the result of the performed channel sensing may comprise selecting one or more direction of the two or more directions for an upcoming communication opportunity in communication transmission and/or reception modes of the wireless transceiver. For example, operating the wireless transceiver according to sub-step 144 may comprise selecting a direction of the two or more directions for an upcoming transmission or reception opportunity based on channel sensing in the direction (e.g., based on signals, such as interference, detected for the directions during the channel sensing). For example, a direction may be selected for which the channel sensing detected less interference than the channel sensing of at least one of the non-selected directions (e.g., a direction with clear channel detection may be selected and/or the direction for which the channel sensing detected the least interference). Additionally or alternatively to basing the selection of detected interference, one or more other criteria may be applied as mentioned before. For example, the selection of direction may be based on one or more of: interference, network statistics (e.g., NACK/ACK statistics), channel conditions (e.g., SIR), etc. In a particular example a direction may be selected when it has a good trade-off between low interference, favorable network statistics, and good instantaneous channel conditions between transmitter and receiver. Alternatively or additionally, operating the wireless transceiver according to sub-step 144 may comprise selecting more than one (e.g., two or more) directions of the two or more directions for an upcoming transmission or reception opportunity based on channel sensing in the direction. Thus, the sensing operation of step 120 may be used to scan one or more directions to determine which direction(s) are suitable for the upcoming transmission and/or reception once the current communication is finalized. Such an approach may be termed predictive sensing. With predictive sensing, a goal is to find a direction which is suitable for the next transmission or reception once the current transmission is finalized; additionally or alternatively to any goal of detecting problematic situations (e.g., relating to the hidden node problem). In an example of predictive sensing, an access node (compare with 301 of FIG. 3) is in communication with (e.g., receiving data from) a user device UD1 (compare with 310 of FIG. 3) and has buffered data for transmission to two user devices UD2, UD3 (compare with 320, 330 of FIG. 3) located in spatially separable directions. While receiving the data from UD1 (compare with step 130 of FIG. 1), the access node senses the interference level in the directions of UD2 and UD3 (compare with step 120 of FIG. 1) to determine the respective interference levels. If, for example, the interference level is high in the direction of UD2 and low in the direction of UD3, the access node may—after finalizing the reception from UD1—perform a directional LBT procedure in the direction towards UD3 since the probability that this will be successful is higher than if a directional LBT procedure in the direction towards UD2 would have been performed (compare with sub-step 144 of FIG. 1). By application of predictive sensing, the probability that the access node will find a free channel is increased, and thereby the total time that the access node can access the channel will increase. Thus, predictive sensing may be applied for scheduling downlink transmissions. The application of predictive sensing is equally applicable for scheduling uplink transmissions. For example, an access node is in communication with (e.g., receiving data from) a user device UD1 and knows that two user devices UD2, UD3 located in spatially separable directions have buffered data for transmission to the access node. While receiving the data from UD1, the access node senses the interference level in the directions of UD2 and UD3 to determine the respective interference levels. If, for example, the interference level is high in the direction of UD2 and low in the direction of UD3, the access node may—after finalizing the reception from UD1—schedule UD3 for uplink transmission. If UD3 needs to perform a (possibly short) LBT procedure before transmitting, the probability that this will be successful (i.e., that UD3 will be able to transmit) is higher than if UD2 performed an LBT procedure. Furthermore, even if UD2 would be able to transmit if scheduled, the interference caused by such transmission is likely to do more harm than a transmission by UD3, since the interference level was high in the direction of UE2 (indicating that some other transmission(s) are probably ongoing in the vicinity of UD2). Typically, predictive sensing while communicating is easier to perform when the sensing device is receiving data rather than transmitting data. Thus, for uplink communication, the sensing of the access node may preferably be performed while receiving uplink data. For downlink communication, the sensing of the access node may preferably be performed while receiving ACK/NACK for downlink data. As illustrated in optional sub-step 146, operating the wireless transceiver based on the result of the performed channel sensing may comprise providing (implicitly or explicitly; e.g., by transmitting)—to one or more other wireless transceivers and/or to a channel sensing statistics server—a channel sensing report including the result. Such channel sensing report may be used to build channel sensing statistics and/or to schedule further communication (e.g., timing and/or beam direction). An example relating to optional sub-step 146 is when a user device (or a plurality of user devices) participate the in sensing procedure for the communication network. If a user device is equipped with multiple antenna elements (e.g., an antenna array), a set of the antenna elements can be configured for sensing in any of the suitable manners otherwise described herein. The user device may (e.g., sporadically) send collected statistics from performed sensing measurements to an access node of the network. For example, if an access node is transmitting to a user device and the user device receives the transmission from a first angle, then the user device can steer its sensing towards another, preferentially orthogonal, second angle. The second angle should preferably be such that the transmission from the access node is received with little or no energy in the second angle. If the combined signal strength of signals received in the second such angle is higher than a threshold value (which can be signaled from the access node), that may be interpreted as there being a parallel transmission taking place—which may be due to hidden node problems. The access node may (e.g., sporadically) send control signals to configure the sensing parameters of user device(s). Such control signaling may, for example, be implemented in new radio (NR) based access to unlicensed spectrum (NR-U) by adding a few extra downlink control information (DCI) bits. Alternatively, the network may allow the user device(s) to configure themselves to collect sensing statistics and report the statistics to the access node. This option may reduce the signaling overhead. It should be noted that optional sub-steps 142, 144, 146 may be seen as alternatives that may be used singly or in any suitable combination. Although not shown in FIG. 1, the method may be repeatedly performed. Thus, the method may return to step 110 after completion of step 140 according to some embodiments. The repetition of the method may be at regular time intervals and/or may be event based. For example, the method may be repeated responsive to a change of operation mode of the wireless transceiver. Example operation modes may comprise one or more of a non-communication mode (e.g., an idle mode or similar), a transmission communication mode, and a reception communication mode. According to some embodiments, the method 100 is applied only after the wireless transceiver has gained access to the channel via a default channel sensing process (e.g., LBT, CCA, or CSMA/CA). The default sensing process may, for example, utilize the entire plurality of transceiver antenna arrays; or a suitable subset thereof. Hence, in such embodiments, the channel sensing of step 120 is not primarily for gaining channel access, but is rather for detecting interference, or similar problematic situations. US20150016309A1 describes a full-duplex wireless device sensing the medium during transmission by itself and selectively continues the transmission when a signal is sensed on the medium. However, in US20150016309A1, there is an antenna specifically configured for reception and one antenna specifically configured for transmission, which teaches away from dynamic allocation. An antenna specifically configured for reception and one antenna specifically configured for transmission cannot be seen as an example of a plurality of transceiver antenna elements. Furthermore, US20150016309A1 mentions that the transmit antenna and receive antenna of a full-duplex wireless device can be configured to be spatially isolated from each other, which makes dynamic assignment of antenna elements impossible. As mentioned before, FIG. 2 schematically illustrates an example antenna array 200 comprising a plurality of antenna elements 201, 202, 203, 204, 205, 206 in relation to three example assignment scenarios; scenario (a) which may, for example, be applicable in a communication transmission mode of the wireless transceiver, scenario (b) which may, for example, be applicable in a non-communication mode of the wireless transceiver, and scenario (c) which may, for example, be applicable in a communication reception mode of the wireless transceiver. The illustrations of FIG. 2 may be seen as examples of the dynamic assignment of step 110 illustrated in FIG. 1, wherein the plurality of antenna elements 201, 202, 203, 204, 205, 206 are assigned to a first set 210 a, 210 b, 210 c allocated for channel sensing and a second set 220 a, 220 b, 220 c allocated for communication. In scenario (a), which may be applicable in a communication transmission mode of the wireless transceiver, the first set 210 a comprises a first set 201, 202 of the transceiver antenna elements and the second set 220 a comprises a second set 203, 204, 250, 206 of the transceiver antenna elements. In this example, the first and second sets are non-overlapping (which is suitable for communication transmission mode since the first set is for sensing—antenna elements in reception mode—and the second set is for communication—antenna elements in transmission mode) and together comprise the plurality of transceiver antenna elements. In other situations, the first and second sets may together comprise less than the plurality of transceiver antenna elements. Typically, the cardinalities of the first and second sets 210 a, 220 a may be varying, e.g., depending on whether omnidirectional or directional channel sensing is applied and/or depending on how narrow beam is for directional beamforming. This variable cardinality is illustrated at 250 in FIG. 2. As mentioned before, and alternatively or additionally to the cardinalities being variable, it may be varied which transceiver antenna elements are comprised in which one of the first and second sets (e.g., which transceiver antenna elements that the first set consists of and which transceiver antenna elements the second set consists of). For example, at a first occasion, the first set may consist of two transceiver antenna elements 201, 206, and, at a second occasion, the first set may comprise two other transceiver antenna elements 204, 205. For example, an access node (e.g., a gNB) AN1 may be equipped with an antenna array with M antenna elements (i.e., the plurality equals M). Then, a sub-array 210 a of m antenna elements may be assigned to operate in transmit (or receive) mode for scenario (a) and a sub-array 220 a of (M−m) antenna elements may be assigned to operate in sensing (i.e., listening/reception) mode. Thus, the sub-array 210 a of m antenna elements can be used to transmit to (or receive from) one or more user devices (e.g., UEs) UD1, UD2 using beamforming; while the sub-array 220 a of (M−m) antenna elements is used for directional channel sensing to listen for interference in one or more directions (e.g., in a direction towards a user device UD3). The choice of m may, for example, depend on past and/or current network states, and/or the history of sensing measurements in the network. In a typical approach, the choice of m may reflect a desired trade-off between benefits (e.g., array gain and spatial reuse) of communication using beamforming and drawbacks (e.g., wasted power usage and intra/inter-cell interference) of unexpected interference from interfering transceivers; which may be due to the hidden node problem elaborated on later herein. For example, if it is determined that the communication network currently has a very low probability of encountering the hidden node problem, then the wireless transceiver may operate with all its antenna elements in communication mode, i.e., m=M. However, if it is determined that the communication network currently has a quite high probability of encountering the hidden node problem, it may be beneficial for the overall network performance if the wireless transceiver assigns some of its antennas for sensing, i.e., m<M. Changing the dimensionality of the sensing sub-array can be performed gradually in time. For example, the wireless transceiver can start by assigning an initial number Ninit of sensing antenna elements, i.e. (m−M)=Ninit, and then—depending on the outcome of the channel sensing—increase or decrease (m−M) gradually by δ antennas, where δ is a positive real integer. Typically, δ may be relatively small compared to (m−M). For example, the positive real integer may be chosen from the set where ceil(x) is the ceiling function, which outputs the smallest integer that is not smaller than x. In scenario (b), which may be applicable in a non-communication mode of the wireless transceiver, the first set 210 b comprises the entire plurality of transceiver antenna elements and the second set 220 b is empty, which is suitable for non-communication mode since the second set is for communication which is not applicable in a non-communication mode. In other situations, the first set may comprise less than the plurality of transceiver antenna elements, while the second set is empty. In scenario (c), which may be applicable in a communication reception mode of the wireless transceiver, the first set 210 c comprises the entire plurality of transceiver antenna elements and the second set 220 c also comprises the entire plurality of transceiver antenna elements. Thus, the first and second sets are fully overlapping in this example, which is suitable for communication reception mode since the first set is for sensing—antenna elements in reception mode—and the second set is for communication—antenna elements in reception mode. In other situations, the first and second sets may be partly overlapping, or non-overlapping (similarly to scenario (a)). Furthermore, the first and second sets together comprise the plurality of transceiver antenna elements in this example, while the first and second sets may together comprise less than the plurality of transceiver antenna elements in other situations. FIG. 3 schematically illustrates an example communication scenario where some embodiments may be applicable. The scenario comprises a plurality of access nodes (AN1, AN2, AN3) 301, 302, 303 of a communication network. The communication network may also comprise a channel sense statistics server (CSSS) 300. The entities of the communication network are operatively connected to each other as illustrated by the schematic connection 390 in FIG. 3. A plurality of user devices (UD1, UD2, UD3) 310, 320, 330 are operating in association with the communication network, and are served by the access node 301 using directional beams 350, 360, 370 respectively. As mentioned before, if user device 330 does not register ongoing communication from the access node 301 to the used device 310 over beam 350 when performing channel sensing, it may start transmission that may cause collision/interference, e.g., at the access node 301 as illustrated by 384 and/or at the user device 310 as illustrated by 382 and/or at any of the other access nodes 302, 303 and/or at any of the other user devices 320. Some embodiments may provide mitigation of this problem by application (e.g., in access node 301) of the method described in connection with FIG. 1 and/or by incorporation (e.g., in access node 301) of the apparatus that will be described in connection with FIG. 4. FIG. 4 schematically illustrates an example apparatus 410 according to some embodiments. For example, the apparatus 410 may be configured to cause performance of (e.g., may be configured to perform) one or more method steps as described in connection with FIG. 1. The apparatus 410 is for a wireless transceiver comprising a plurality of transceiver antenna elements and configured to operate in a communication network. The apparatus may be comprisable (e.g., comprised) in a wireless transceiver such as, for example, an access node or a user device. The apparatus comprises a controller (CNTR; e.g., controlling circuitry or a controlling module) 400 configured to cause dynamic assignment, from the plurality of transceiver antenna elements 431, 432, 433, 434, of a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication (compare with step 110 of FIG. 1). To this end, the controller may comprise, or be otherwise associated with, a dynamic assigner (DA; e.g., dynamic assignment circuitry or a dynamic assignment module) 401. The dynamic assigner may be configured to dynamically assign, from the plurality of transceiver antenna elements, the first set of transceiver antenna elements allocated for channel sensing and the second set of transceiver antenna elements allocated for communication. Dynamic assignment may be based on one or more of: a communication mode of the wireless transceiver, network statistics collected by the wireless transceiver, network statistics collected by one or more other wireless transceivers, one or more previous results of channel sensing performed by the wireless transceiver, and one or more previous results of channel sensing performed by one or more other wireless transceivers. To this end, the controlling circuitry may be configured to acquire channel sensing statistics from and/or to provide channel sensing results to a channel sensing statistics server. The controller 400 is also configured to cause performance of channel sensing using the first set of transceiver antenna elements (compare with step 120 of FIG. 1). To this end, the controller may comprise, or be otherwise associated with, a channel sensor (DA; e.g., channel sensing circuitry or a channel sensing module) 402. The channel sensor may be configured to perform channel sensing using the first set of transceiver antenna elements; typically in cooperation with a receiver (e.g., receiving circuitry or a receiving module), illustrated in FIG. 4 as part of a transceiver (TX/RX) 430, operably connectable (e.g. connected) to the controller 400. The controller 400 is also configured to cause operation of the wireless transceiver based on a result of the performed channel sensing (compare with step 140 of FIG. 1). To this end, the controller may comprise, or be otherwise associated with, an operation controller (OC; e.g., operation controlling circuitry or an operation controlling module) 403. The operation controller may be configured to operate the wireless transceiver based on the result of the performed channel sensing; typically in cooperation with a receiver (e.g., receiver circuitry or a receiver module) and/or a transmitter (e.g., transmitter circuitry or a transmitter module), both illustrated in FIG. 4 as part of a transceiver (TX/RX) 430, operably connectable (e.g. connected) to the controller 400. In some embodiments, the controller 400 may be configured to cause the channel sensing to be performed while communication is performed using the second set of transceiver antenna elements in communication transmission and/or reception modes of the wireless transceiver (compare with step 130 of FIG. 1). The problem with not hearing an ongoing first transmission by a first transceiver when the channel is sensed by a second transceiver (which leads to that the channel is considered free and that a second transmission may be initiated by the second transceiver, which second transmission, in fact, interferes with the first transmission) is sometimes referred to as the hidden node problem. Some embodiments, mitigates the hidden node problem via introduction of a sensing sub-array (the first set) for an antenna array of the first transceiver. Typically the sensing sub-array enables channel sensing while transmission and/or reception is also performed at the first transceiver. Mitigation may, for example, comprise detection at the first transceiver of the second transmission and performing mitigation actions in response thereto. As exemplified above, such mitigation actions may comprise one or more of: stopping the ongoing first transmission, adjusting (increasing or decreasing) a transmit power for the first transmission, resolving the collision between the first and second transmissions, etc. The described embodiments and their equivalents may be realized in software or hardware or a combination thereof. The embodiments may be performed by general purpose circuitry. Examples of general purpose circuitry include digital signal processors (DSP), central processing units (CPU), co-processor units, field programmable gate arrays (FPGA) and other programmable hardware. Alternatively or additionally, the embodiments may be performed by specialized circuitry, such as application specific integrated circuits (ASIC). The general purpose circuitry and/or the specialized circuitry may, for example, be associated with or comprised in an apparatus such as a wireless communication device (e.g., a user device) or a network node (e.g., an access node). Embodiments may appear within an electronic apparatus (such as a wireless communication device or a network node) comprising arrangements, circuitry, and/or logic according to any of the embodiments described herein. Alternatively or additionally, an electronic apparatus (such as a wireless communication device or a network node) may be configured to perform methods according to any of the embodiments described herein. According to some embodiments, a computer program product comprises a computer readable medium such as, for example a universal serial bus (USB) memory, a plug-in card, an embedded drive or a read only memory (ROM). FIG. 5 illustrates an example computer readable medium in the form of a compact disc (CD) ROM 500. The computer readable medium has stored thereon a computer program comprising program instructions. The computer program is loadable into a data processor (PROC; e.g., data processing circuitry or a data processing unit) 520, which may, for example, be comprised in a wireless communication device or a network node 510. When loaded into the data processor, the computer program may be stored in a memory (MEM) 530 associated with or comprised in the data processor. According to some embodiments, the computer program may, when loaded into and run by the data processor, cause execution of method steps according to, for example, any of the methods illustrated in FIG. 1 or otherwise described herein. With reference to FIG. 6, in accordance with an embodiment, a communication system includes telecommunication network QQ410, such as a 3GPP-type cellular network, which comprises access network QQ411, such as a radio access network, and core network QQ414. Access network QQ411 comprises a plurality of base stations QQ412 a, QQ412 b, QQ412 c, such as NBs, eNBs, gNBs or other types of wireless access points, each defining a corresponding coverage area QQ413 a, QQ413 b, QQ413 c. Each base station QQ412 a, QQ412 b, QQ412 c is connectable to core network QQ414 over a wired or wireless connection QQ415. A first UE QQ491 located in coverage area QQ413 c is configured to wirelessly connect to, or be paged by, the corresponding base station QQ412 c. A second UE QQ492 in coverage area QQ413 a is wirelessly connectable to the corresponding base station QQ412 a. While a plurality of UEs QQ491, QQ492 are illustrated in this example, the disclosed embodiments are equally applicable to a situation where a sole UE is in the coverage area or where a sole UE is connecting to the corresponding base station QQ412. Telecommunication network QQ410 is itself connected to host computer QQ430, which may be embodied in the hardware and/or software of a standalone server, a cloud-implemented server, a distributed server or as processing resources in a server farm. Host computer QQ430 may be under the ownership or control of a service provider, or may be operated by the service provider or on behalf of the service provider. Connections QQ421 and QQ422 between telecommunication network QQ410 and host computer QQ430 may extend directly from core network QQ414 to host computer QQ430 or may go via an optional intermediate network QQ420. Intermediate network QQ420 may be one of, or a combination of more than one of, a public, private or hosted network; intermediate network QQ420, if any, may be a backbone network or the Internet; in particular, intermediate network QQ420 may comprise two or more sub-networks (not shown). The communication system of FIG. 6 as a whole enables connectivity between the connected UEs QQ491, QQ492 and host computer QQ430. The connectivity may be described as an over-the-top (OTT) connection QQ450. Host computer QQ430 and the connected UEs QQ491, QQ492 are configured to communicate data and/or signaling via OTT connection QQ450, using access network QQ411, core network QQ414, any intermediate network QQ420 and possible further infrastructure (not shown) as intermediaries. OTT connection QQ450 may be transparent in the sense that the participating communication devices through which OTT connection QQ450 passes are unaware of routing of uplink and downlink communications. For example, base station QQ412 may not or need not be informed about the past routing of an incoming downlink communication with data originating from host computer QQ430 to be forwarded (e.g., handed over) to a connected UE QQ491. Similarly, base station QQ412 need not be aware of the future routing of an outgoing uplink communication originating from the UE QQ491 towards the host computer QQ430. Example implementations, in accordance with an embodiment, of the UE, base station and host computer discussed in the preceding paragraphs will now be described with reference to FIG. 7. In communication system QQ500, host computer QQ510 comprises hardware QQ515 including communication interface QQ516 configured to set up and maintain a wired or wireless connection with an interface of a different communication device of communication system QQ500. Host computer QQ510 further comprises processing circuitry QQ518, which may have storage and/or processing capabilities. In particular, processing circuitry QQ518 may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. Host computer QQ510 further comprises software QQ511, which is stored in or accessible by host computer QQ510 and executable by processing circuitry QQ518. Software QQ511 includes host application QQ512. Host application QQ512 may be operable to provide a service to a remote user, such as UE QQ530 connecting via OTT connection QQ550 terminating at UE QQ530 and host computer QQ510. In providing the service to the remote user, host application QQ512 may provide user data which is transmitted using OTT connection QQ550. Communication system QQ500 further includes base station QQ520 provided in a telecommunication system and comprising hardware QQ525 enabling it to communicate with host computer QQ510 and with UE QQ530. Hardware QQ525 may include communication interface QQ526 for setting up and maintaining a wired or wireless connection with an interface of a different communication device of communication system QQ500, as well as radio interface QQ527 for setting up and maintaining at least wireless connection QQ570 with UE QQ530 located in a coverage area (not shown in FIG. 7) served by base station QQ520. Communication interface QQ526 may be configured to facilitate connection QQ560 to host computer QQ510. Connection QQ560 may be direct or it may pass through a core network (not shown in FIG. 7) of the telecommunication system and/or through one or more intermediate networks outside the telecommunication system. In the embodiment shown, hardware QQ525 of base station QQ520 further includes processing circuitry QQ528, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. Base station QQ520 further has software QQ521 stored internally or accessible via an external connection. Communication system QQ500 further includes UE QQ530 already referred to. Its hardware QQ535 may include radio interface QQ537 configured to set up and maintain wireless connection QQ570 with a base station serving a coverage area in which UE QQ530 is currently located. Hardware QQ535 of UE QQ530 further includes processing circuitry QQ538, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. UE QQ530 further comprises software QQ531, which is stored in or accessible by UE QQ530 and executable by processing circuitry QQ538. Software QQ531 includes client application QQ532. Client application QQ532 may be operable to provide a service to a human or non-human user via UE QQ530, with the support of host computer QQ510. In host computer QQ510, an executing host application QQ512 may communicate with the executing client application QQ532 via OTT connection QQ550 terminating at UE QQ530 and host computer QQ510. In providing the service to the user, client application QQ532 may receive request data from host application QQ512 and provide user data in response to the request data. OTT connection QQ550 may transfer both the request data and the user data. Client application QQ532 may interact with the user to generate the user data that it provides. It is noted that host computer QQ510, base station QQ520 and UE QQ530 illustrated in FIG. 7 may be similar or identical to host computer QQ430, one of base stations QQ412 a, QQ412 b, QQ412 c and one of UEs QQ491, QQ492 of FIG. 6, respectively. This is to say, the inner workings of these entities may be as shown in FIG. 7 and independently, the surrounding network topology may be that of FIG. 6. In FIG. 7, OTT connection QQ550 has been drawn abstractly to illustrate the communication between host computer QQ510 and UE QQ530 via base station QQ520, without explicit reference to any intermediary devices and the precise routing of messages via these devices. Network infrastructure may determine the routing, which it may be configured to hide from UE QQ530 or from the service provider operating host computer QQ510, or both. While OTT connection QQ550 is active, the network infrastructure may further take decisions by which it dynamically changes the routing (e.g., on the basis of load balancing consideration or reconfiguration of the network). Wireless connection QQ570 between UE QQ530 and base station QQ520 is in accordance with the teachings of the embodiments described throughout this disclosure. One or more of the various embodiments improve the performance of OTT services provided to UE QQ530 using OTT connection QQ550, in which wireless connection QQ570 forms the last segment. More precisely, the teachings of these embodiments may improve the channel sensing and thereby provide benefits such as better resolving of collisions. A measurement procedure may be provided for the purpose of monitoring data rate, latency and other factors on which the one or more embodiments improve. There may further be an optional network functionality for reconfiguring OTT connection QQ550 between host computer QQ510 and UE QQ530, in response to variations in the measurement results. The measurement procedure and/or the network functionality for reconfiguring OTT connection QQ550 may be implemented in software QQ511 and hardware QQ515 of host computer QQ510 or in software QQ531 and hardware QQ535 of UE QQ530, or both. In embodiments, sensors (not shown) may be deployed in or in association with communication devices through which OTT connection QQ550 passes; the sensors may participate in the measurement procedure by supplying values of the monitored quantities exemplified above, or supplying values of other physical quantities from which software QQ511, QQ531 may compute or estimate the monitored quantities. The reconfiguring of OTT connection QQ550 may include message format, retransmission settings, preferred routing etc.; the reconfiguring need not affect base station QQ520, and it may be unknown or imperceptible to base station QQ520. Such procedures and functionalities may be known and practiced in the art. In certain embodiments, measurements may involve proprietary UE signaling facilitating host computer QQ510's measurements of throughput, propagation times, latency and the like. The measurements may be implemented in that software QQ511 and QQ531 causes messages to be transmitted, in particular empty or ‘dummy’ messages, using OTT connection QQ550 while it monitors propagation times, errors etc. FIG. 8 is a flowchart illustrating a method implemented in a communication system, in accordance with one embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIGS. 6 and 7. For simplicity of the present disclosure, only drawing references to FIG. 8 will be included in this section. In step QQ610, the host computer provides user data. In substep QQ611 (which may be optional) of step QQ610, the host computer provides the user data by executing a host application. In step QQ620, the host computer initiates a transmission carrying the user data to the UE. In step QQ630 (which may be optional), the base station transmits to the UE the user data which was carried in the transmission that the host computer initiated, in accordance with the teachings of the embodiments described throughout this disclosure. In step QQ640 (which may also be optional), the UE executes a client application associated with the host application executed by the host computer. FIG. 9 is a flowchart illustrating a method implemented in a communication system, in accordance with one embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIGS. 6 and 7. For simplicity of the present disclosure, only drawing references to FIG. 9 will be included in this section. In step QQ710 of the method, the host computer provides user data. In an optional substep (not shown) the host computer provides the user data by executing a host application. In step QQ720, the host computer initiates a transmission carrying the user data to the UE. The transmission may pass via the base station, in accordance with the teachings of the embodiments described throughout this disclosure. In step QQ730 (which may be optional), the UE receives the user data carried in the transmission. FIG. 10 is a flowchart illustrating a method implemented in a communication system, in accordance with one embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIGS. 6 and 7. For simplicity of the present disclosure, only drawing references to FIG. 10 will be included in this section. In step QQ810 (which may be optional), the UE receives input data provided by the host computer. Additionally or alternatively, in step QQ820, the UE provides user data. In substep QQ821 (which may be optional) of step QQ820, the UE provides the user data by executing a client application. In substep QQ811 (which may be optional) of step QQ810, the UE executes a client application which provides the user data in reaction to the received input data provided by the host computer. In providing the user data, the executed client application may further consider user input received from the user. Regardless of the specific manner in which the user data was provided, the UE initiates, in substep QQ830 (which may be optional), transmission of the user data to the host computer. In step QQ840 of the method, the host computer receives the user data transmitted from the UE, in accordance with the teachings of the embodiments described throughout this disclosure. FIG. 11 is a flowchart illustrating a method implemented in a communication system, in accordance with one embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference to FIGS. 6 and 7. For simplicity of the present disclosure, only drawing references to FIG. 11 will be included in this section. In step QQ910 (which may be optional), in accordance with the teachings of the embodiments described throughout this disclosure, the base station receives user data from the UE. In step QQ920 (which may be optional), the base station initiates transmission of the received user data to the host computer. In step QQ930 (which may be optional), the host computer receives the user data carried in the transmission initiated by the base station. Generally, all terms used herein are to be interpreted according to their ordinary meaning in the relevant technical field, unless a different meaning is clearly given and/or is implied from the context in which it is used. Reference has been made herein to various embodiments. However, a person skilled in the art would recognize numerous variations to the described embodiments that would still fall within the scope of the claims. For example, the method embodiments described herein discloses example methods through steps being performed in a certain order. However, it is recognized that these sequences of events may take place in another order without departing from the scope of the claims. Furthermore, some method steps may be performed in parallel even though they have been described as being performed in sequence. Thus, the steps of any methods disclosed herein do not have to be performed in the exact order disclosed, unless a step is explicitly described as following or preceding another step and/or where it is implicit that a step must follow or precede another step. In the same manner, it should be noted that in the description of embodiments, the partition of functional blocks into particular units is by no means intended as limiting. Contrarily, these partitions are merely examples. Functional blocks described herein as one unit may be split into two or more units. Furthermore, functional blocks described herein as being implemented as two or more units may be merged into fewer (e.g. a single) unit. Any feature of any of the embodiments disclosed herein may be applied to any other embodiment, wherever suitable. Likewise, any advantage of any of the embodiments may apply to any other embodiments, and vice versa. Hence, it should be understood that the details of the described embodiments are merely examples brought forward for illustrative purposes, and that all variations that fall within the scope of the claims are intended to be embraced therein. EXAMPLE EMBODIMENTS Group A Embodiments A1. A method for channel sensing performed by a wireless device comprising a plurality of transceiver antenna elements and configured to operate in a communication network, the method comprising: dynamically assigning (110), from the plurality of transceiver antenna elements, a first set (210 a-c) of transceiver antenna elements allocated for channel sensing and a second set (220 a-c) of transceiver antenna elements allocated for communication; performing channel sensing (120) using the first set of transceiver antenna elements; and operating (140) the wireless transceiver based on a result of the performed channel sensing. A2. The method of any of the previous embodiments in Group A, further comprising: providing user data; and forwarding the user data to a host computer via transmission to a base station. Group B Embodiments B1. A method for channel sensing performed by a base station comprising a plurality of transceiver antenna elements and configured to operate in a communication network, the method comprising: dynamically assigning (110), from the plurality of transceiver antenna elements, a first set (210 a-c) of transceiver antenna elements allocated for channel sensing and a second set (220 a-c) of transceiver antenna elements allocated for communication; performing channel sensing (120) using the first set of transceiver antenna elements; and operating (140) the wireless transceiver based on a result of the performed channel sensing. B2. The method of any of the previous embodiments in Group B, further comprising: obtaining user data; and forwarding the user data to a host computer or a wireless device. Group C Embodiments C1. A wireless device for channel sensing, the wireless device comprising a plurality of transceiver antenna elements and being configured to operate in a communication network, the wireless device further comprising: processing circuitry configured to perform any of the steps of any of the Group A embodiments; and power supply circuitry configured to supply power to the wireless device. C2. A base station for channel sensing, the base station comprising a plurality of transceiver antenna elements and configured to operate in a communication network, the base station further comprising: processing circuitry configured to perform any of the steps of any of the Group B embodiments; power supply circuitry configured to supply power to the base station. C3. A user equipment (UE) for channel sensing, the UE comprising a plurality of transceiver antenna elements and being configured to operate in a communication network, the UE further comprising: an antenna configured to send and receive wireless signals; radio front-end circuitry connected to the antenna and to processing circuitry, and configured to condition signals communicated between the antenna and the processing circuitry; the processing circuitry being configured to perform any of the steps of any of the Group A embodiments; an input interface connected to the processing circuitry and configured to allow input of information into the UE to be processed by the processing circuitry; an output interface connected to the processing circuitry and configured to output information from the UE that has been processed by the processing circuitry; and a battery connected to the processing circuitry and configured to supply power to the UE. Group D Embodiments D1. A communication system including a host computer comprising: processing circuitry configured to provide user data; and a communication interface configured to forward the user data to a cellular network for transmission to a user equipment (UE), wherein the cellular network comprises a base station having a radio interface and processing circuitry, the base station's processing circuitry configured to perform any of the steps described for the Group B embodiments. D2. The communication system of embodiment D1 further including the base station. D3. The communication system of any of embodiments D1 through D2, further including the UE, wherein the UE is configured to communicate with the base station. D4. The communication system of any of embodiments D1 through D3, wherein: the processing circuitry of the host computer is configured to execute a host application, thereby providing the user data; and the UE comprises processing circuitry configured to execute a client application associated with the host application. D5. A method implemented in a communication system including a host computer, a base station and a user equipment (UE), the method comprising: at the host computer, providing user data; and at the host computer, initiating a transmission carrying the user data to the UE via a cellular network comprising the base station, wherein the base station performs any of the steps described for the Group B embodiments. D6. The method of embodiment D5, further comprising, at the base station, transmitting the user data. D7. The method of any of embodiments D5 through D6, wherein the user data is provided at the host computer by executing a host application, the method further comprising, at the UE, executing a client application associated with the host application. D8. A user equipment (UE) configured to communicate with a base station, the UE comprising a radio interface and processing circuitry configured to perform the method of any of embodiments D5 through D7. D9. A communication system including a host computer comprising: processing circuitry configured to provide user data; and a communication interface configured to forward user data to a cellular network for transmission to a user equipment (UE), wherein the UE comprises a radio interface and processing circuitry, the UE's components configured to perform any of the steps described for the Group A embodiments. D10. The communication system of embodiment D9, wherein the cellular network further includes a base station configured to communicate with the UE. D11. The communication system of any of embodiments D9 through D10, wherein: the processing circuitry of the host computer is configured to execute a host application, thereby providing the user data; and the UE's processing circuitry is configured to execute a client application associated with the host application. D12. A method implemented in a communication system including a host computer, a base station and a user equipment (UE), the method comprising: at the host computer, providing user data; and at the host computer, initiating a transmission carrying the user data to the UE via a cellular network comprising the base station, wherein the UE performs any of the steps described for the Group A embodiments. D13. The method of embodiment D12, further comprising at the UE, receiving the user data from the base station. D14. A communication system including a host computer comprising: communication interface configured to receive user data originating from a transmission from a user equipment (UE) to a base station, wherein the UE comprises a radio interface and processing circuitry, the UE's processing circuitry configured to perform any of the steps described for the Group A embodiments. D15. The communication system of embodiment D14, further including the UE. D16. The communication system of any of embodiments D14 through D15, further including the base station, wherein the base station comprises a radio interface configured to communicate with the UE and a communication interface configured to forward to the host computer the user data carried by a transmission from the UE to the base station. D17. The communication system of any of embodiments D14 through D16, wherein: the processing circuitry of the host computer is configured to execute a host application; and the UE's processing circuitry is configured to execute a client application associated with the host application, thereby providing the user data. D18. The communication system of any of embodiments D14 through D17, wherein: the processing circuitry of the host computer is configured to execute a host application, thereby providing request data; and the UE's processing circuitry is configured to execute a client application associated with the host application, thereby providing the user data in response to the request data. D19. A method implemented in a communication system including a host computer, a base station and a user equipment (UE), the method comprising: at the host computer, receiving user data transmitted to the base station from the UE, wherein the UE performs any of the steps described for the Group A embodiments. D20. The method of embodiment D19, further comprising, at the UE, providing the user data to the base station. D21. The method of any of embodiments D19 through D20, further comprising: at the UE, executing a client application, thereby providing the user data to be transmitted; and at the host computer, executing a host application associated with the client application. D22. The method of any of embodiments D19 through D21, further comprising: at the UE, executing a client application; and at the UE, receiving input data to the client application, the input data being provided at the host computer by executing a host application associated with the client application, wherein the user data to be transmitted is provided by the client application in response to the input data. D23. A user equipment (UE) configured to communicate with a base station, the UE comprising a radio interface and processing circuitry configured to perform the method of any of embodiments D19 through D22. D24. A communication system including a host computer comprising a communication interface configured to receive user data originating from a transmission from a user equipment (UE) to a base station, wherein the base station comprises a radio interface and processing circuitry, the base station's processing circuitry configured to perform any of the steps described for the Group B embodiments. D25. The communication system of embodiment D24 further including the base station. D26. The communication system of any of embodiments D24 through D25, further including the UE, wherein the UE is configured to communicate with the base station. D27. The communication system of any of embodiments D24 through D25, wherein: the processing circuitry of the host computer is configured to execute a host application; the UE is configured to execute a client application associated with the host application, thereby providing the user data to be received by the host computer. D28. A method implemented in a communication system including a host computer, a base station and a user equipment (UE), the method comprising: at the host computer, receiving, from the base station, user data originating from a transmission which the base station has received from the UE, wherein the UE performs any of the steps described for the Group A embodiments. D29. The method of embodiment D28, further comprising at the base station, receiving the user data from the UE. D30. The method of any of embodiments D28 through D29, further comprising at the base station, initiating a transmission of the received user data to the host computer. D31. A method implemented in a communication system including a host computer, a base station and a user equipment (UE), the method comprising: at the host computer, receiving, from the base station, user data originating from a transmission which the base station has received from the UE, wherein the base station performs any of the steps described for the Group B embodiments. D32. The method of embodiment D31, further comprising at the base station, receiving the user data from the UE. D33. The method of any of embodiments D31 through D32, further comprising at the base station, initiating a transmission of the received user data to the host computer. 1-38. (canceled) 39. A method of controlling a wireless transceiver; the wireless transceiver comprising a plurality N of transceiver antenna elements and configured to operate in a communication network; the method comprising: dynamically assigning, from the plurality N of transceiver antenna elements, a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication; performing channel sensing using the first set of transceiver antenna elements; and operating the wireless transceiver based on a result of the performed channel sensing. 40. The method of claim 39, wherein selection of which transceiver antenna elements belongs to the first and second sets is variable. 41. The method of claim 39: wherein the cardinality of the second set is variable between zero and N, and can take at least two values which differ from zero and N; wherein the cardinality of the first set is variable between one and N, and can take at least one value which differs from N. 42. The method of claim 39, wherein the dynamically assigning comprises determining cardinalities of the first and second sets based on: a communication mode of the wireless transceiver; network statistics collected by the wireless transceiver; network statistics collected by one or more other wireless transceivers; one or more previous results of channel sensing performed by the wireless transceiver; and/or one or more previous results of channel sensing performed by one or more other wireless transceivers. 43. The method of claim 39, wherein dynamically assigning comprises: in a non-communication mode of the wireless transceiver, letting the first set comprise all of the transceiver antenna elements and letting the second set be empty; in a communication transmission mode of the wireless transceiver, letting the first set comprise a first subset of the transceiver antenna elements and letting the second set comprise a second subset of the transceiver antenna elements, wherein the first and second subsets are non-overlapping; and in a communication reception mode of the wireless transceiver, letting the first set comprise a third subset of the transceiver antenna elements and letting the second set comprise a fourth subset of the transceiver antenna elements, wherein the third and fourth subsets are non-overlapping or overlapping. 44. The method of claim 43, wherein a size of the first subset is determined based on one or more previous results of channel sensing performed by the wireless transceiver and/or by one or more other wireless transceivers. 45. The method of claim 39, wherein the channel sensing is performed while communication is performed using the second set of transceiver antenna elements in communication transmission and/or reception modes of the wireless transceiver. 46. The method of claim 39, wherein the operating the wireless transceiver based on the result of the performed channel sensing comprises, when the performed channel sensing detects an interfering signal in communication transmission mode of the wireless transceiver: determining to continue an ongoing transmission when the interfering signal is detected to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal succeeds; determining to stop the ongoing transmission when the interfering signal is detected to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal fails; and determining to stop the ongoing transmission when the interfering signal is detected to originate from a different communication network. 47. The method of claim 39: wherein the channel sensing is directional channel sensing performed in one direction; wherein the operating the wireless transceiver based on the result of the performed channel sensing comprises, in communication transmission and/or reception modes of the wireless transceiver, selecting whether or not to use the direction for an upcoming transmission or reception opportunity based on signal detection for the direction during the channel sensing. 48. The method of claim 39: wherein the channel sensing is directional channel sensing performed in two or more directions; wherein the operating the wireless transceiver based on the result of the performed channel sensing comprises, in communication transmission and/or reception modes of the wireless transceiver, selecting one or more direction of the two or more directions for an upcoming transmission or reception opportunity; wherein the channel sensing of the selected one or more direction detected less interference or lower received signal strength than the channel sensing of at least one of the non-selected directions. 49. An apparatus for a wireless transceiver; the wireless transceiver comprising a plurality N of transceiver antenna elements and configured to operate in a communication network; the apparatus comprising control processing circuitry configured to cause: dynamic assignment, from the plurality N of transceiver antenna elements, of a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication; performance of channel sensing using the first set of transceiver antenna elements; and operation of the wireless transceiver based on a result of the performed channel sensing. 50. The apparatus of claim 49, wherein a selection of which transceiver antenna elements belongs to the first and second sets is variable. 51. The apparatus of claim 49, wherein the control processing circuitry is configured to cause dynamic assignment of the first and second sets of transceiver antenna elements by causing determination of cardinalities of the first and second sets based on: a communication mode of the wireless transceiver; network statistics collected by the wireless transceiver; network statistics collected by one or more other wireless transceivers; one or more previous results of channel sensing performed by the wireless transceiver; and/or one or more previous results of channel sensing performed by one or more other wireless transceivers. 52. The apparatus of claim 49, wherein the control processing circuitry is configured to cause dynamic assignment of the first and second sets of transceiver antenna elements by causing: in a non-communication mode of the wireless transceiver, the first set to comprise all of the transceiver antenna elements and the second set to be empty; in a communication transmission mode of the wireless transceiver, the first set to comprise a first subset of the transceiver antenna elements and the second set to comprise a second subset of the transceiver antenna elements, wherein the first and second subsets are non-overlapping; and/or in a communication reception mode of the wireless transceiver, the first set to comprise a third subset of the transceiver antenna elements and the second set to comprise a fourth subset of the transceiver antenna elements, wherein the third and fourth subsets are non-overlapping or overlapping. 53. The apparatus of claim 52, wherein the control processing circuitry is configured to cause a size of the first subset to be determined based on one or more previous results of channel sensing performed by the wireless transceiver and/or by one or more other wireless transceivers. 54. The apparatus of claim 49, wherein the control processing circuitry is configured to cause the channel sensing to be performed while communication is performed using the second set of transceiver antenna elements in communication transmission and/or reception modes of the wireless transceiver. 55. The apparatus of claim 49, wherein the control processing circuitry is configured to cause the operation of the wireless transceiver based on the result of the performed channel sensing by causing, when the performed channel sensing detects an interfering signal in communication transmission mode of the wireless transceiver: continuation of an ongoing transmission when the interfering signal is detected to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal succeeds; stoppage of the ongoing transmission when the interfering signal is detected to originate from the communication network of the wireless transceiver and an attempt to decode the interfering signal fails; and stoppage of the ongoing transmission when the interfering signal is detected to originate from a different communication network. 56. The apparatus of claim 49: wherein the channel sensing is directional channel sensing performed in one direction; wherein the control processing circuitry is configured to cause the operation of the wireless transceiver based on the result of the performed channel sensing by causing, in communication transmission and/or reception modes of the wireless transceiver, selection of whether or not to use the direction for an upcoming transmission or reception opportunity based on signal detection for the direction during the channel sensing. 57. The apparatus of claim 49: wherein the channel sensing is directional channel sensing performed in two or more directions; wherein the control processing circuitry is configured to cause the operation of the wireless transceiver based on the result of the performed channel sensing by causing, in communication transmission and/or reception modes of the wireless transceiver, selection of one or more direction of the two or more directions for an upcoming transmission or reception opportunity; wherein the channel sensing of the selected one or more direction detected less interference or lower received signal strength than the channel sensing of at least one of the non-selected directions. 58. A wireless transceiver configured to operate in a communication network, the wireless transceiver comprising: a plurality N of transceiver antenna elements control processing circuitry configured to cause: dynamic assignment, from the plurality N of transceiver antenna elements, of a first set of transceiver antenna elements allocated for channel sensing and a second set of transceiver antenna elements allocated for communication; performance of channel sensing using the first set of transceiver antenna elements; and operation of the wireless transceiver based on a result of the performed channel sensing.

2019-05-29

en

2022-07-14

US-10929408-A

Storage Management System ABSTRACT A storage management system is disclosed for managing storage of electronic files in a plurality of storage devices connected during use to the storage management system. The system comprises a storage server connectable to a plurality of storage devices and communicable with at least one client device through a network. Each storage device has storage device attributes indicative of characteristics of the storage device, and the storage server is arranged to export a virtual file structure indicative of the connected storage devices to the at least one client. During storage of a file the storage management system is arranged to compare desired storage requirements for the file with the storage device attributes of storage devices connected during use to the storage server, and to select a storage device for the file based on the comparison. When at least one smart storage device is connected to the storage server, the storage management system is arranged to cascade the desired storage requirements to the or each smart storage device. RELATED APPLICATIONS This patent application claims priority to Indian patent application serial no. 917/CHE/2007, having title “A STORAGE MANAGEMENT SYSTEM”, filed on 30 Apr. 2007 in India, commonly assigned herewith, and hereby incorporated by reference. BACKGROUND OF THE INVENTION A variety of data storage devices are currently available, ranging from simple local internal disks to complex data storage arrays provided with extensive data protection and high speed access mechanisms. Increasingly common are network enabled storage devices which are directly connectable to a computer network so as to provide centralized data access and storage for network clients. Such networked storages devices are commonly referred to as Network Attached Storage (NAS) systems. A NAS system incorporating a NAS server is capable of exporting different types of storage devices as a virtual file system that can be used by networked clients. However, the networked clients see only the exported file system and are not aware of the actual characteristics of the storage devices. As a consequence, the clients are unable to distinguish between a complex expensive and efficient data storage system and low cost internal storage disks, and an effective Quality of Service (QoS) system is therefore difficult to implement. BRIEF DESCRIPTION OF THE DRAWINGS The present invention will now be described, by way of example only, with reference to the accompanying drawings, in which: FIG. 1 is a schematic diagram of a storage management system in accordance with an embodiment of the present invention; FIG. 2 shows example Quality of Service (QoS) data for use with the storage management system shown in FIG. 1; FIG. 3 shows example Quality of Service (QoS) translation rules for use with the storage management system shown in FIG. 1; FIG. 4 shows example translated weighted storage device requirements generated by a policy manager of the storage management system shown in FIG. 1; and FIG. 5 is a flow diagram illustrating a method of managing data storage in accordance with an embodiment of the present invention. DESCRIPTION OF AN EMBODIMENT OF THE INVENTION Referring to the drawings, there is shown a storage management system 10 for managing data storage and retrieval operations with respect to a data storage system 12 of the type provided with a plurality of storage devices 14, 15. The types of storage device 14, 15 used may be different in that respective storage device properties such as cost of storage, access speed, redundancy or derived attributes such as optimized-for-multiple-reads, large-block-size may vary. Some of the storage devices used may include an internal disk, and/or a JBOD type storage device. In addition or alternatively, some of the storage devices used may be smart storage devices 15 which support policy based storage volume (LUN) creation. The smart storage device 15 includes a storage portion 17 and a processor portion 19 arranged to coordinate storage volume creation requests and QoS policy handling tasks. These devices 15 receive storage volume (LUN) creation requests as a QoS policy and create a LUN which best matches the client request. Example smart storage devices 15 include a storage array, an EVA type storage device, a NAS appliance and an iSCSI target. The storage management system 10 comprises a storage server 16 connected to the storage system 12 and arranged to communicate with a plurality of clients 18 through a network 20. In this example, the storage server 16 and the storage system 12 together form a Network Attached Storage (NAS) system. The storage server 16 comprises a storage aggregator 22 which manages the storage devices 14, 15 and generates one or more virtual file structures incorporating the respective file structures of the storage devices 14, 15. The aggregated file structure is exported by the storage server 16 to the clients 18 associated with the network 20 using any suitable protocol 24 such as NFS or CIFS. The storage aggregator 22 also interacts with the storage devices 14, 15 to update storage device attributes 40 indicative of characteristics of the storage devices 14, 15. The storage server 16 also comprises a file system manager 26 and a policy manager 28. The file system manager 26 intercepts file creation requests originating from the clients 18 and coordinates with the policy manager 28 to retrieve translated weighted storage device requirements 38 usable to determine the most appropriate storage device 14, 15 in which to store a file. In one arrangement, the file system manager 26 includes a native file system 29 and a filter driver 31. The filter driver 31 intercepts I/O calls and coordinates with the policy manager 28 to retrieve translated weighted storage requirements 38 for the file. It passes translated weighted storage requirements 38 to the storage aggregator 22 to use to select a storage device 14, 15 which best matches the translated weighted storage requirements 38. The file system manager 26 then uses the native file system 29 to create the file on the selected storage device 14, 15. The main role of the file system manager 26 is to intercept I/O calls and coordinate with the policy manager 28 and the storage aggregator 22 to select an appropriate storage device 14, 15 for the file. In an alternative example, the native file system 29 and the filter driver 31 are omitted and the file system manager 26 is itself a file system which coordinates with the policy manager 28 and the storage aggregator 22 and also performs file system operations and I/O operations in relation to the storage devices 14, 15. On receipt of a request to create a file, the storage server 16 is arranged to select the most appropriate storage device 14, 15 for storage of the file using a predefined Quality of Service (QoS) policy in association with the policy manager 28 and the storage aggregator 22. In this example, the QoS policy is managed by the policy manager 28 which may be integral with or separate to the storage server 16. The QoS policy is based on QoS data 30 and QoS translation rules 34. The QoS data 30 is user centric in that the QoS data defines characteristics for different file types based on the group that the user belongs to. In the present example, the characteristics include criticality and whether the data is transient. In this example, the QoS data 30 is created using policy creation applications 32 hosted by the clients 20, although it will be understood that the QoS data 30 may be created at any suitable location and using any suitable device, such as at the storage server 16. The QoS translation rules 34 are file centric in that the QoS translation rules 34 generically define desired parameters for each file type, such as access time, redundancy, costs, large-block-size or write-once-read-many. An example extract of QoS data 30 is shown in FIG. 2. The QoS data 30 defines QoS requirements specific to technical writer and developer user types. As can be seen, for “.doc” and “.txt” file types, the criticalness parameter is higher for a technical writer type of user than for a developer type of user. An example QoS translation rule 34 is shown in FIG. 3. The QoS translation rule 34 defines generic requirements for file types. As can be seen, the generic parameters in this example are “AccessTime1To5”, “Redundancy1To5”, “Cost1To5”, “Large-block-size” and “Write-once-read-many”. The QoS translation rules 34 are constructed, for example by an administrator, based on statistical data. Ongoing feedback as to storage utilization may be given to the administrator to update the values specified in the translation rules as necessary. The policy manager 28 also stores storage device attributes 40 which define characteristics of the storage devices 14, 15 forming part of the storage system 12. The storage device attributes are usually updated by the storage aggregator 22 by polling the storage devices 14, 15 for their attributes. The storage device attributes 40 may also be updated manually by an administrator. In an example data storage 12 an internal disk, an EVA type storage device and a JBOD type storage device are provided. The storage device attributes 40 are as follows: Block Storage size type Cost Throughput Reliability (KB) Redundancy Internal 2 5 4 128 5 disk EVA 5 4 4 64 4 JBOD 3 2 4 64 5 During use, the QoS data 30 indicative of requirements specific to user groups and the QoS translation rules 34 indicative of generic requirements for file types are used by the policy manager 28 to derive translated weighted storage device requirements 38, as shown in FIG. 4, indicative of both the user group specific QoS data 30 and the generic file specific QoS translation rules 34. In this example, when a particular file type is to be created by a user belonging to a particular user group, the policy manager 28 derives translated weighted storage device requirements 38 for the file proportionate to a criticalness value provided in the QoS data 30. This generates values based on the storage device parameters which are tailored towards the user group. For example, as shown in FIG. 4, the criticalness value for the technical writer user group for project documents is 4. This value is converted to a proportional criticalness value by expressing the value relative to a maximum criticalness score of 5, and each parameter in the QoS translation rule 34 is multiplied by the proportional value to give a weighted storage requirement value. In the present example, project documents are given a criticalness value of 4 out of 5 for the technical writer user group, and the “AccessTime1To5”, “Redundancy1To5”, “Cost1To5”, “Large-block-size” and “Write-once-read-many” parameters for project documents in the QoS translation rule 34 are 4, 5, 4, “No” and “No” respectively. Each numerical value is then multiplied by 4/5 so as to produce translated weighted storage requirements 38, in the present case 3.2, 4 and 3.2 (rounded to 3, 4 and 3). The translated weighted storage requirements 38 are used by the storage aggregator 22 to select the most appropriate storage device for a file. The storage aggregator 22 selects a storage device by comparing the translated weighted storage requirements 38 for the file with the storage device attributes 40 associated with the storage devices 14, 15. In the above example, the translated weighted storage requirements for a technical writer wishing to create a project document are 3, 4, 3, No and No. For AccessTime=3, Redundancy=4 and Large-block-size=No the most appropriate storage device given by the storage device attributes 40 above is EVA. It will be appreciated that the software language used to define the QoS data 30 and QoS translation rules 34 is in this example non-proprietary so as to ensure interoperability between storage servers and clients. In the present embodiment the software language used is XML. It will be understood that the process of comparing QoS requirements with weighted storage device attributes occurs only when a file is created. After file creation, a conventional file handler may be used and the policy manager 28 is not required. If any smart storage device 15 is attached to the storage server 16, the storage aggregator 22 creates a new QoS policy 27 for the smart storage device 15 based on the translated weighted storage requirements 38 and cascades the new QoS policy 27 to the smart storage device 15. When the smart storage device 15 receives the QoS policy 27 from the storage aggregator 22, the smart storage device 15 acknowledges the request by communicating to the storage aggregator 22 the type of storage volume that the smart storage device 15 can create based on the QoS policy 27 sent by the storage aggregator 22. After receiving acknowledgements from all smart storage devices 15, the storage aggregator 22 selects the most appropriate storage device to create the storage volume. If needed the storage aggregator 22 negotiates with the smart storage device 15 to find the best match for the translated storage requirement by changing the QoS policy 27 for the smart storage device. Cascading QoS policy 27 can be implemented only when the storage device supports QoS based management. Otherwise the storage aggregator 22 will select a device based on the data available in the storage device attributes 40. An example method of managing file data storage is shown in a flow diagram 50 in FIG. 5 which illustrates steps 52 to 66 of creating a file on the storage system 12. On receipt of a file I/O request from a user associated with a particular group wishing to carry out an operation in relation to a particular file, the file system manager 26 intercepts the request and determines whether the request is for creation of or to open a file or for execution of other file operations such as file retrieval. If the request is not for creation of a file, the request is handled by a conventional file handler. If the request is for creation or to open of a file, the policy manager 28 extracts the relevant values from the QoS data 32 specific to the user group and file type concerned, and generates translated weighted storage requirements 38 using the extracted values and the QoS translation rules 34. The translated weighted storage requirements are then cascaded to any connected smart storage device 15 as a new QoS policy 27 and each smart storage device responds by indicating the type of storage volume that the smart storage device(s) can create based on the cascaded QoS policy 27. The translated weighted storage requirements are then compared with the storage device attributes 40 of the non-smart storage devices 14 and the responses from the smart storage device(s) 15 and a best fit storage device 14, 15 for the file is selected. If a smart storage device 15 is selected, the selected smart storage device 15 creates the desired storage volume for the file according to the cascaded QoS policy 27. It will be understood that the present embodiment is primarily implemented using one or more software applications. As such, appropriate components would be included in the storage management system in order to enable execution of the applications, such as a processor and associated memory. However, it will be understood that as an alternative, the functions of the storage management system may be implemented at least partly in hardware. Modifications and variations as would be apparent to a skilled addressee are deemed to be within the scope of the present invention. 1. A storage management system for managing storage of electronic files in a plurality of storage devices connected during use to the storage management system, said system comprising: a storage server connectable to a plurality of storage devices and communicable with at least one client device through a network, each storage device having storage device attributes indicative of characteristics of the storage device, and the storage server being arranged to export a virtual file structure indicative of connected storage devices to the at least one client; wherein during storage of a file the storage management system is arranged to compare desired storage requirements for the file with the storage device attributes of storage devices connected during use to the storage server, and to select a storage device for the file based on the comparison; and wherein when at least one smart storage device is connected to the storage server, the storage management system is arranged to cascade the desired storage requirements to the or each smart storage device. 2. A storage management system as claimed in claim 1, wherein the storage management system is arranged to cascade the desired storage requirements to the or each smart storage device connected during use to the storage management system in the form of a Quality of Service (QoS) policy. 3. A storage management system as claimed in claim 2, wherein the storage management system comprises at least one smart storage device, the at least one smart storage device being arranged to create a storage volume on the smart storage device using the QoS policy when the smart storage device is selected by the storage server. 4. A storage management system as claimed in claim 3, wherein each smart storage device is arranged to send to the storage server an acknowledgement communication indicative of the type of storage volume that the smart storage device can create, and the storage server is arranged to select a storage device for the file using the acknowledgement communication. 5. A storage management system as claimed in claim 4, wherein the storage server is arranged to modify the QoS policy cascaded to a smart storage device in order to better match the QoS policy with the selected smart storage device. 6. A storage management system as claimed in claim 1, wherein the storage device requirements are derived from Quality of Service (QoS) data indicative of storage requirements specific to at least one user and Quality of Service (QoS) translation rules indicative of storage requirements specific to file types. 7. A storage management system as claimed in claim 6, wherein the storage device requirements are receivable from a client in communication with the storage server through a network. 8. A storage management system as claimed in claim 6, wherein the QoS data includes a criticalness value, the QoS translation rules comprise translation rules values, and the storage device requirements derived from the QoS data and the QoS translation rules are translated weighted storage device requirements derived by multiplying at least some of the translation rules values by the criticalness value. 9. A storage management system as claimed in claim 8, wherein the QoS translation rules include desired parameters for a file type including access time, redundancy, cost, large-block-size and/or write-once-read-many. 10. A storage management system as claimed in claim 6, wherein the QoS data and the QoS translation rules conform to the same software language format. 11. A storage management system as claimed in claim 10, wherein the software language format is XML. 12. A storage management system as claimed in claim 8, further comprising a policy manager arranged to generate the translated weighted storage device requirements using the QoS data and the QoS translation rules. 13. A storage management system as claimed in claim 1, further comprising a storage aggregator arranged to generate and export the virtual file structure indicative of the connected storage devices to the at least one client, and to select a storage device for a file based on the comparison between the desired storage requirements for the file and the storage device attributes of storage devices connected during use to the storage server. 14. A storage management system as claimed in claim 11, further comprising a file system manager arranged to intercept file creation requests, to pass desired storage requirements for a file to the storage aggregator, and to coordinate creation of the file on a selected storage device.

2008-04-24

en

2008-10-30

US-201515118661-A

In situ control of fluid menisci ABSTRACT A system includes a non-vertical channel containing a fluid forming a fluid meniscus having a capillary length and a contact angle θ. The channel in cross-section has a perimeter length |Σ| and an area |Ω|. The cross-section of the non-vertical channel is selected so as to define a constant Lagrange multiplier λ, where λ=|Σ|cos θ/|Ω|. A functional Φ[Γ*]Ξ|Γ*|−cos θ|Σ*|+(1/a 2 )G*+λ|Ω*| is minimised to define a minimum value Φ 0 =MinΦ. At a critical transition where Φ=0, the fluid defines a smooth arc of length [Γ*] that divides the cross-section of the channel into two parts. |Ω*| is the cross-sectional area of the fluid, which has a curve of length |Σ*| in contact with the channel, and G* represents a vertical position of the centre of mass of the fluid multiplied by the cross-sectional area |Ω*|. How far the fluid meniscus extends along the channel is controlled by one or more parameters of the functional Φ[Γ*]. This invention relates to the control of fluid menisci from mesoscopic to nanoscopic scales, for example for use in micro- to nano-fluidics devices. The interface between a liquid and a gas (or between two coexisting fluids) in a capillary is called the meniscus. The shape and position of the meniscus depends on: 1. The capillary length a 2. The contact angle θ 3. The orientation of the capillary 4. The cross-sectional shape and size of the capillary The capillary length is a physical magnitude that does not refer to any property of the capillary itself (in particular, to the geometrical length of the capillary), but rather refers to the liquid and gas contained in it, and the interface (or meniscus) between them. The capillary length is defined as where σ is the liquid-gas (or fluid-fluid) surface tension, g is the local gravitational acceleration, and Δρ is the density difference between the liquid and the gas (or the two fluids). In turn, the contact angle θ refers to the angle formed by the meniscus with the walls of the capillary, and is defined as σ cos θ=σwg−σwl, in terms of the wall-gas and wall-liquid surface tensions σwg and σwl, respectively. When a capillary filled with liquid is turned to the horizontal, one of two things can happen: either the liquid spills (as water from a tipped glass) or it remains trapped in the capillary (as in a drinking straw). Roughly speaking, if the capillary width is substantially larger than a, the liquid spills, while if it much less than a, it remains trapped. If we consider horizontal capillaries with a given cross-sectional shape but variable cross-sectional size L (for example, a circle of variable radius L, or a square of variable side length L), there exists a critical value of this size LE that separates the two regimes. Above this critical size (L>LE), the meniscus is infinitely long which, in practical terms, means that it has reached the end of the capillary and has spilled out. We say that these menisci are in an unbound state. Below this critical size (L<LE), that is, when the liquid is held in the capillary, we say that the meniscus is in a bound state. In this state, the meniscus is always finite in length, but still can be arbitrarily long depending on the value of the actual cross-sectional size of the capillary L. In fact, the closer L is to the critical value LE, the longer the meniscus is. In addition, the closer L is to this critical value, the more sensitive the meniscus shape is to any change in parameters: it enters a critical state. This phenomenon has recently been discussed in detail for the particular case of a horizontal slit capillary; see, Parry et al. (Phys. Rev. Lett. 108, 246101 (2012)). Previous studies of a liquid trapped in a non-vertical capillary have only considered the critical emptying transition at sizes greater than the capillary length. It is an object of the present invention to exploit the meniscus in a non-vertical capillary in new ways. When viewed from a first aspect, the present invention provides a method of controlling a fluid meniscus in a non-vertical channel, comprising: containing a fluid in a non-vertical channel so as to form a fluid meniscus having a capillary length a and a contact angle θ, the channel in cross-section having a perimeter length |Σ| and an area |Ω|; selecting the cross-section of the non-vertical channel so as to define a constant Lagrange multiplier λ, where minimising a functional  to define a minimum value Φ0=MinΦ, wherein, at a critical transition where Φ0=0, the fluid defines a smooth arc of length |Γ*| that divides the cross-section of the channel into two parts, |Ω*| is the cross-sectional area of the fluid, which has a curve of length |Σ*| in contact with the channel, and G* represents a vertical position of the centre of mass of the fluid multiplied by the cross-sectional area |Ω*|; and controlling how far the fluid meniscus extends along the channel by selecting one or more parameters of the functional Φ[Γ*]. The functional Φ[Γ*] can be related to a fluid “tongue” extending along the non-vertical channel with a controllable meniscus. At the critical transition where the minimum Φ0=0, the tongue of fluid becomes infinitely long. Accordingly, for Φ0≦0 the fluid will empty from the channel regardless of the channel length. But in the regime where Φ0>0 it is possible to control the length of the fluid tongue relative to the channel and hence determine whether emptying occurs or not. This can be controlled through the interrelated variables Γ*, Σ* and Ω*, the Lagrange multiplier λ, and the capillary length a. Thus it can be appreciated by a person skilled in the art that how far the fluid meniscus extends along the channel can be varied by changing the functional parameters listed above, for example in order to change the interfacial area of the meniscus. The extension of the fluid meniscus along the channel can be sensitive to small changes in parameters, particularly when close to critical emptying of the channel. The change in the meniscus can be a reversible change while it is in a bound state, for example increasing the interfacial area of the meniscus in order to carry out a chemical reaction, or it can be an irreversible change, causing the fluid bound by the meniscus to unbind and drain from the channel. Each of the parameters in the above functional have some dependence on Γ*, the arc length of the meniscus (see FIG. 8b ), as they are all related to how far the fluid meniscus extends along the channel. This dependence is shown in the functional Φ[Γ*], where any parameter which is starred is dependent on Γ*. Due to this dependence, most of the parameters cannot be changed independently, as each of the starred parameters will affect one another. What is meant by a non-vertical channel is one in which there is a horizontal component, i.e. the elongate axis of the channel is between 0 and 89° to the horizontal. The method may further comprise selectively emptying the fluid from the non-vertical channel by controlling one or more parameters so that Φ0≦0. At the critical emptying boundary where Φ0=0, the arc Γ* happens to be the section of the infinitely long fluid meniscus extending along the capillary. This is possible even when the channel has a diameter smaller than the capillary length a of the fluid. Previously, draining has only been possible above the capillary length a, but by controlling one or more parameters such as the cross-section of the channel, it is possible to force draining in much smaller channels. This is beneficial as it allows increased control over micro- and nano-fluidics devices. The method can also be used to control how far the fluid meniscus extends along the channel without emptying. The extension of the fluid meniscus can have important consequences for the behaviour of fluids; for example, controlling the extension of a meniscus formed between two different fluids can allow a user to control interfacial processes, such as the rate of a chemical reaction or catalysis carried out at the meniscus. The cross-section of the channel may be chosen based on a number of factors, such as size, shape and/or orientation. However, size may be kept constant while other parameters are varied, and In a set of embodiments, selecting the cross-section of the channel comprises varying the shape and/or orientation of the channel. This allows the cross-section to be varied while remaining with an effective diameter below the capillary length. The cross-section can therefore be used to induce draining in channels which have a diameter smaller than the capillary length of the meniscus formed between the fluids. In a set of embodiments, selecting one or more parameters of the functional Φ[Γ*] comprises selecting or changing one of more fluid parameters. The parameters of the fluid(s) which can be changed may either be absolute or relative parameters. For example, a material parameter such as the capillary length a is absolute, whereas the relationship between the diameter of the channel and the capillary length a of a fluid is a relative parameter that can be modified by changing an absolute parameter of the fluid(s) and/or of the channel. A parameter of the fluid(s) may be changed directly or indirectly. In a set of embodiments, the fluid parameters which can be changed are the contact angle θ between the meniscus and the channel, and the capillary length a. In one example, the contact angle θ is preferably changed by adjusting a material parameter of the fluid, for example by adjusting the density, chemical composition or hydrophobicity of one of the fluids. Alternatively, or in addition, the contact angle θ can be changed by adding a surfactant to the fluid. In another example, alternatively or in addition, the contact angle θ may be changed by adjusting a material parameter of the channel. This preferably comprises modifying the wetting properties of at least a region of the channel surface, for example by applying an electric field. This is known as electrowetting, and allows for the surface tension of the fluids contacting the surfaces to be altered in a highly controllable manner. In addition, or alternatively, in a set of embodiments controlling how far the fluid meniscus extends along the channel comprises changing the capillary length a by altering the fluid. In one example, changing the capillary length a comprises adjusting the temperature of the fluid(s). This can allow the properties of both fluids to be changed at the same time. Alternatively, or in addition, changing the capillary length a may comprise adjusting the density of the fluid(s), for example when sugar is dissolved in water in order to increase the density. Changing the density can allow the capillary length a to be changed without necessarily changing properties of both of the fluids involved. Another method of changing the capillary length a comprises adjusting the composition of the fluid(s), for example by adding a surfactant to one or more of the fluids. This lowers the surface tension of one or more of the fluids, reducing the capillary length. In addition, or alternatively, in a set of embodiments controlling how far the fluid meniscus extends along the channel comprises changing the gravitational acceleration. This impacts upon both the fluids and the channel, and alters the capillary length of the meniscus formed between the two fluids in accordance with the equation above. This could be of use, among other things, to measure the strength of microgravitational fields. In addition or alternatively to the above, indirect methods of changing one or more fluid parameters may include changing the cross-section of the channel, for example using external pressure or piezoelectricity to cause a change of shape and/or dimensions. This may involve changing a local radius of curvature in the channel, which affects how the meniscus forms, as a meniscus will preferentially form over regions of high curvature as this is the most energetically stable position. However, filling conditions might dictate that the meniscus forms elsewhere in the channel. Changing the cross-section of the channel will alter characteristics of the meniscus, for example the length, area or asymmetry of the meniscus formed. In addition, or alternatively, in a set of embodiments the parameters of the functional Φ[Γ*] can be changed by changing the rotational orientation of the channel in a horizontal plane. This will impact on the meniscus if the channel is not rotationally invariant, for example in an elliptical channel. By rotating the channel, the local radius of curvature will change, causing the meniscus formed to change shape. Any of these parameters may be changed alone or in combination. In addition, these parameters may be controlled such that the channel is deformed in at least one step, and then emptied in a subsequent step, e.g. following a chemical reaction. The non-vertical channel could take any shape, for example a pair of parallel plates or a tube with a circular or polygonal (e.g. triangular) cross section. How far the meniscus extends along the channel can then preferably be controlled by changing the cross-section in at least one dimension, preferably in more than one dimension. This can impact upon one or more relative parameters of the fluid(s), for example the relationship between the local radius of curvature and the curvature of the meniscus. The curvature of the meniscus is defined by the Laplace radius, where σ is the surface tension of the fluid and Δp is the change in pressure (the Laplace pressure). In order to change the cross-section, the channel preferably comprises a flexible material and changing the cross-section of the channel comprises applying a pressure to the channel. This pressure could be mechanical or hydraulic, allowing a flexible channel, for example made from PDMS or PMMA, to change shape under the pressure, altering how far the fluid meniscus extends along the channel. In an alternative set of embodiments, the channel comprises a piezoelectric material and changing the cross-section of the channel comprises applying an electric field to the channel. This allows the extension of the fluid meniscus to be changed without putting pressure on the channel. When viewed from a second aspect, the present invention provides a system comprising a non-vertical channel containing a fluid forming a fluid meniscus having a capillary length a and a contact angle θ, the channel in cross-section having a perimeter length |Σ| and an area |Ω|; the cross-section of the non-vertical channel being selected so as to define a constant Lagrange multiplier λ, where a functional  being minimised to define a minimum value Φ0=MinΦ, wherein, at a critical transition where Φ0=0, the fluid defines a smooth arc of length |Γ*| that divides the cross-section of the channel into two parts, |Ω*| is the cross-sectional area of the fluid, which has a curve of length |Σ*| in contact with the channel, and G* represents a vertical position of the centre of mass of the fluid multiplied by the cross-sectional area |Ω*|; wherein, how far the fluid meniscus extends along the channel is controlled by one or more parameters of the functional Φ[Γ*]. Thus it can be seen that how far the fluid meniscus extends along a non-vertical channel according to the invention can be controlled or tuned according to the required purpose, for example to change the size of the interfacial area available for chemical reactions. In a set of embodiments, the system may be arranged such that the fluid is selectively emptied from the channel by one or more parameters being controlled so that Φ0≦0. In another set of embodiments, the system may be arranged such that the fluid meniscus does not extend outside the channel. In other words, one or more parameters of the functional Φ[Γ*] may be controlled so that fluid is not emptied from the channel. By controlling one or more parameters of the functional Φ[Γ*], it can be possible to cause draining of a fluid in a channel with a diameter less than the capillary length a of the fluid. This is because other parameters can be changed in order to reduce the value of Φ0 to below zero, rather than having only one possible variable to cause draining. The non-vertical channel in which the meniscus is formed may have open or closed ends, depending on the size of the channel. The state of the ends is only relevant to the finite size behaviour of the channel, i.e. when the fluid meniscus extends sufficiently close to an end of the channel that it encounters an end to the channel. For channels in which the fluid meniscus is sufficiently far from the ends, they have no bearing on the behaviour or shape of the meniscus. Controlling and manipulating fluid e.g. liquid menisci can be used in a wide variety of fields, including but not limited to medical diagnostics or analytical chemistry. These applications may, for example, make use of the extension of the meniscus through changes to one or more absolute or relative fluid parameters, in order to increase the surface area available for reactions. Alternatively, this method may be used to create nano-fluidics devices which are able to be emptied despite having a cross-sectional size substantially smaller than the capillary length a of a fluid. This may be used in the oil and food industries. The above are simply non-limiting examples of potential uses. Some embodiments of the invention will now be described, by way of example only, with reference to the accompanying drawings in which: FIG. 1 shows a phase diagram for a fluid meniscus between two parallel plates; FIG. 2 shows a series of different shaped menisci, with reference to FIG. 1; FIG. 3 shows three experimental results tied to FIG. 1; FIG. 4 shows a cross-sectional view of fluid menisci in two exemplary elliptical channels; FIG. 5 shows a schematic phase diagram for elliptical channels of semi-axes R and bR (b>1) in two different horizontal dispositions; FIG. 6a shows a cross-sectional view of a fluid meniscus in an exemplary triangular channel; FIG. 6b shows a graph of fluid thickness at emptying over a range of contact angles for the system of FIG. 6a according to an approximate theory; FIGS. 7a-7c show a series of phase diagrams for the channel of FIG. 6a arranged at different angles to the horizontal according to an approximate theory; and FIGS. 8a and 8b illustrate the terms used in the controlling function Φ[Γ]. FIG. 1 shows a phase diagram for the stability of menisci within a channel formed between two parallel plates. The relationship between contact angle (θ) and the ratio (L/a) of plate separation L to capillary length a is shown, with the curve marking the critical position at which the meniscus changes between being bound and unbound, i.e. where Φ[Γ]=0. At this critical point, the meniscus has the largest exposed surface area as can be seen in FIGS. 2 and 3, where points C, F and I are slightly offset from the critical point. At any points above the critical line, the fluid is unbound and will drain from the channel, whereas below the critical line, the fluid will remain bound in the channel, with a meniscus that varies in extension depending on the position of the system in the phase diagram. FIG. 2. shows a series of cross-sectional views through the channel, which correspond to the points shown in FIG. 1. FIGS. 2A, 2D and 2G are all at the same relative distance from the critical curve Φ0[Γ*]=0, with where LE is the distance between the plates at which the channel will empty. This means that they track the curve with changing contact angle, rather than having a set plate distance L. FIGS. 2B, 2E and 2H all have ε=0.25, and FIGS. 2C, 2F and 2I have ε=0.001. As can be seen, the smaller the value of ε, the longer the meniscus. In addition, a larger contact angle means that the meniscus is more highly affected by gravity. FIGS. 2A to 2I demonstrate theoretical results, whereas FIGS. 3A to 3C demonstrate experimental results, in which colloid-rich and polymer-rich solutions of PMMA colloids and non-adsorbing polystyrene polymer in decalin are used to show the deformation of the meniscus under different operating circumstances. In the cases such as FIGS. 2C, 2F, 2I and 3C, the meniscus can be made to span a very large distance without crossing the phase boundary, such that the extension of the meniscus is reversible. While control over a meniscus formed can be carried out through changes in the capillary length as can be seen in FIGS. 1 to 3, this is not the only influential parameter. There is also a dependence on contact angle θ (and on cross-sectional shape) which can be used to alternatively or further control the behaviour of the meniscus. FIGS. 4A and 4B schematically demonstrate the difference in meniscus shape for different shaped channels. In a circular channel as in FIG. 4A (with θ=90°), the meniscus sits across the centre of the height of the channel, with all of the liquid in the lower half. However, when an ellipsoidal channel is used (as in FIG. 4B), the meniscus extends along the points of maximum curvature of the capillary (i.e. the sides), or along the bottom, depending on the parameters. This is because the liquid will pool in regions of high curvature. As the sides of the channel have a much higher radius of curvature than the top and bottom, the liquid forms tongues over these regions, as here the relationship between the local radius of curvature and the Laplace radius R is such that the liquid is able to form a tongue, and does not immediately drain from the channel. It is these regions of high curvature which are the first to drain as fluid parameters are changed to induce drainage. FIG. 5 shows a series of schematic phase diagrams for elliptical channels, in which the eccentricity and orientation of the ellipse are varied. As can be seen, for an eccentricity larger than a critical value, there is a range of contact angles 0≦θ<θ*(b) for which the meniscus is unbound for any size of capillary and, hence, the channel cannot hold any fluid down to microscopic sizes. FIG. 6a shows a channel with a triangular cross-section of height D. A liquid tongue of height z has formed in the lowest vertex, where the triangle is held at an angle α to the horizontal. It is assumed that the liquid tongue is perfectly flat and horizontal, which is an accurate approximation whenever the contact angle θ≈α. However, for θ≈π, this will not be true, and it is expected that there will be features not seen in these figures. FIG. 6b shows how the thickness of the tongue (z) varies with contact angle (θ) for a number of different values of α according to the above approximation. The initial thickness varies according to α, as at α=0°, the lower side of the channel is much wider than at α=89°, as it is a side of the triangle rather than the vertex. However, for all of the values of a shown, as θ increases, the thickness z increases. FIGS. 7a to 7c show phase diagrams for triangular channels at a range of values of α as shown in FIG. 6b , according to the above approximation. For α=0°, the channel can only be emptied by increasing the ratio of height D to capillary length, and will always be filled for D/LC under around 4. However, as α is increased, it becomes possible to empty the capillary at low contact angles for any ratio of D/LC, meaning that micro- and nanoscopic channels can be emptied. At the other extreme, where α=89°, for high contact angles (i.e. θ≧π/2) the channel will remain filled, even for relatively large channels (D/LC>>10). At this extreme (α=89°), for θ<π/2 the channel will not be able to hold fluid, even at microscopic sizes. FIGS. 8a and 8b illustrate the terms used in the controlling function Φ[Γ*]. In FIG. 8a , a channel without any fluid is shown, in which Ω demonstrates the cross-sectional area and Σ shows the perimeter of the channel (without any fluid). In FIG. 8b , a channel containing a fluid is shown, where the fluid has formed a tongue in a region of high curvature dividing the channel into two parts. The tongue therefore has the following parameters when Φ0=0:|Γ*| which is the arc length of the tongue spanning the cross-section of the channel; |Ω*| which is the cross-sectional area of the tongue; and |Σ*| which is the perimeter length of the tongue in contact with the channel. 1. A method of controlling a fluid meniscus in a non-vertical channel, comprising: containing a fluid in a non-vertical channel so as to form a fluid meniscus having a capillary length a and a contact angle θ, the non-vertical channel in cross-section having a perimeter length |Σ| and an area |Ω|; selecting the cross-section of the non-vertical channel so as to define a constant Lagrange multiplier λ, where minimising a functional  to define a minimum value Φ0=MinΦ, wherein, at a critical transition where Φ0=0, the fluid defines a smooth arc of length |Γ*| that divides the cross-section of the non-vertical channel into two parts, |Ω*| is a cross-sectional area of the fluid, which has a curve of length |Σ*| in contact with the non-vertical channel, and G* represents a vertical position of a centre of mass of the fluid multiplied by the cross-sectional area |Ω*|; and controlling how far the fluid meniscus extends along the non-vertical channel by selecting one or more parameters of the functional Φ|Γ*|. 2. The method of claim 1, comprising selectively emptying the fluid from the non-vertical channel by controlling one or more parameters so that Φ0≦0. 3. The method of claim 1, comprising controlling how far the fluid meniscus extends along the non-vertical channel without emptying. 4. The method of claim 1, wherein selecting the cross-section of the non-vertical channel comprises varying a size, shape and/or orientation of the non-vertical channel. 5. The method of claim 1, wherein controlling how far the fluid meniscus extends along the non-vertical channel comprises changing the contact angle θ. 6. The method of claim 5, wherein changing the contact angle θ comprises adjusting a material parameter of the fluid. 7. The method of claim 5, wherein changing the contact angle θ comprises adjusting a material parameter of the non-vertical channel. 8. The method of claim 7, wherein changing the contact angle θ comprises modifying wetting properties of at least a region of a surface of the non-vertical channel. 9. The method of claim 1, wherein controlling how far the fluid meniscus extends along the non-vertical channel comprises changing the capillary length a by altering the fluid. 10. The method of claim 9, wherein changing the capillary length a comprises adjusting a temperature of the fluid. 11. The method of claim 9, wherein changing the capillary length a comprises adjusting a density of the fluid. 12. The method of claim 9, wherein changing the capillary length a comprises adjusting a composition of the fluid. 13. The method of claim 1, wherein controlling how far the fluid meniscus extends along the non-vertical channel comprises changing gravitational acceleration. 14. The method of claim 1, wherein selecting the cross-section of the non-vertical channel comprises changing a rotational orientation of the non-vertical channel in a horizontal plane. 15. The method of claim 1, wherein selecting the cross-section of the non-vertical channel comprises changing a shape of the cross-section in at least one dimension. 16. The method of claim 1, wherein the non-vertical channel comprises a flexible material and selecting the cross-section of the non-vertical channel comprises applying a pressure to the non-vertical channel. 17. The method of claim 1, wherein the non-vertical channel comprises a piezoelectric material and selecting the cross-section of the non-vertical channel comprises applying an electric field to the non-vertical channel. 18. A system comprising a non-vertical channel containing a fluid forming a fluid meniscus having a capillary length a and a contact angle θ, the non-vertical channel in cross-section having a perimeter length |Σ| and an area |Ω|; the cross-section of the non-vertical channel being selected so as to define a constant Lagrange multiplier λ, where a functional  being minimised to define a minimum value Φ0=MinΦ, wherein, at a critical transition where Φ0=0, the fluid defines a smooth arc of length |Γ*| that divides the cross-section of the non-vertical channel into two parts, |Ω*| is a cross-sectional area of the fluid, which has a curve of length |Σ*| in contact with the non-vertical channel, and G* represents a vertical position of a centre of mass of the fluid multiplied by the cross-sectional area |Ω*|; wherein, how far the fluid meniscus extends along the non-vertical channel is controlled by one or more parameters of the functional Φ|Γ*|. 19-34. (canceled)

2015-02-10

en

2017-03-02

US-35859603-A

Copper bath composition for electroless and/or electrolytic filling of vias and trenches for integrated circuit fabrication ABSTRACT The present invention is directed to a copper bath composition and a process for the electroless and/or electrolytic plating of copper to fill vias and trenches during the manufacture of integrated circuits. Specifically, the copper bath composition comprises water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote the electroless reduction of the copper ions to copper metal, and a catalyst to promote the electrolytic reduction copper ions to copper metal. BACKGROUND OF THE INVENTION [0001] This invention relates to the deposition of a copper onto the surface of a semiconductor substrate comprising vias and trenches and, in particular, to the electroless and electrolytic plating of copper onto a copper seed layer in the vias and trenches using the same copper bath. [0002] An integrated circuit (IC) contains a collection of electrical devices, such as transistors, capacitors, resistors, and diodes, within a dielectric material on a semiconductor. Conductive interconnects connecting discrete devices are referred to as trenches. Additionally, two or more conductive layers, each separated by a dielectric, are typically employed within a given IC to increase its overall performance. Conductive interconnects known as vias are used to connect these distinct conductive layers together. Currently, ICs typically have silicon oxide as the dielectric material and copper as the conductive material. [0003] The demand for manufacturing semiconductor IC devices such as computer chips with high circuit speed, high packing density and low power dissipation requires the downward scaling of feature sizes in ultra-large-scale integration (ULSI) and very-large-scale integration (VLSI) structures. The trend to smaller chip sizes and increased circuit density requires the miniaturization of interconnect features, which severely penalizes the overall performance of the structure because of increasing interconnect resistance and reliability concerns such as electromigration. [0004] Traditionally, such structures had used aluminum and aluminum alloys as the metallization on silicon wafers with silicon dioxide being the dielectric material. In general, openings are formed in the dielectric layer in the shape of vias and trenches after metallization to form the interconnects. Increased miniaturization is reducing the openings to submicron sizes (e.g., 0.5 micron and lower). [0005] To achieve further miniaturization of the device, copper has been introduced to replace aluminum as the metal to form the connection lines and interconnects in the chip. Copper metallization is carried out after forming the interconnects. Copper has a lower resistivity than aluminum and the thickness of a copper line for the same resistance can be thinner than that of an aluminum line. Copper-based interconnects, therefore, represent the future trend in the fabrication of such devices. [0006] The use of copper has introduced a number of requirements into the IC manufacturing process. First, copper has a tendency to diffuse into the semiconductor's junctions, thereby disturbing their electrical characteristics. To combat this occurrence, a barrier layer, such as titanium nitride, tantalum or tantalum nitride, is applied to the dielectric prior to the copper layer's deposition. It is also necessary that the copper be deposited on the barrier layer cost-effectively while ensuring the requisite coverage thickness for carrying signals between the IC's devices. As the architecture of ICs continues to shrink, this requirement proves to be increasingly difficult to satisfy. [0007] One conventional semiconductor manufacturing process is the copper damascene system. Specifically, this system begins by etching the circuit architecture into the substrate's dielectric material. The architecture is comprised of a combination of the aforementioned trenches and vias. Next, a barrier layer is laid over the dielectric to prevent diffusion of the subsequently applied copper layer into the substrate's junctions. Copper is then deposited onto the barrier layer using one of a number of processes, including, for example, chemical vapor deposition (CVD), physical vapor deposition (PVD), or electrochemical deposition. After the copper layer has been deposited, excess copper is removed from the facial plane of the dielectric, leaving copper in only the etched interconnect features of the dielectric. Subsequent layers are produced similarly before assembly into the final semiconductor package. [0008] Electrochemical deposition, the currently preferred method for applying copper, requires deposition of a thin copper seed layer prior to electrochemical deposition so that the copper has an electrically conductive surface on which to deposit. The copper seed layer is typically applied by PVD or CVD, both of which often have coverage problems, especially in interconnects in the device, such that the copper seed layer is non-continuous and has voids and gaps. These voids and gaps in the copper seed layer impair the ability to subsequently deposit a continuous copper layer by electrochemical deposition. The copper seed layer is typically exposed to an activator liquid to fill in the voids and gaps in the seed layer. For example, the seed layer may be exposed to palladium-tin colloidal suspension to deposit palladium-tin particles on the seed layer and fill the voids and gaps in the seed layer. The deposited palladium carries current across the voids and gaps, thereby facilitating subsequent electrochemical deposition of a continuous copper layer. [0009] Subsequent to activation of the seed layer, a copper seed enhancement layer is typically deposited using an electroless copper plating solution. After deposition of the seed enhancement layer, the filling of the vias and trenches is completed by depositing copper electrolytically using an electrolytic copper plating solution. After depositing the copper seed enhancement layer, typically about 99 percent of their depth remains unfilled. Thus, the majority of the filling process occurs during the electrolytic plating operation. [0010] Although widely used, electrochemical copper deposition processes have drawbacks. For example, each step requires a different plating solution followed by a water rinse before being immersed in the next plating solution. This typically results in increased raw material costs, increased waste disposal costs, increased manufacturing duration, increased capital investment and increased manufacturing costs all of which increase the cost of each integrated circuit. Thus, a need continues to exist for a less expensive, and more consolidated electrochemical copper deposition process. SUMMARY OF THE INVENTION [0011] Among the several objects of this invention, therefore, is the provision of a solution and process for the electroless and electrolytic plating of copper to fill vias and trenches for the manufacture of integrated circuits; and the provision of an electrochemical copper deposition process which reduces raw material costs, waste disposal costs, decrease manufacturing duration, decreases capital investment costs, and decreases manufacturing costs compared to a conventional two solution electrochemical process. [0012] Briefly, therefore, the invention is directed to a copper plating solution for the electroless or the electrolytic deposition of copper onto a surface of an integrated circuit semiconductor substrate. The copper plating solution comprises water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote the electroless reduction of the copper ions to copper metal, and a catalyst to promote the electrolytic reduction copper ions to copper metal. [0013] The present invention is also directed to copper plating solution for the electroless or electrolytic deposition of copper onto a surface of a substrate. The copper plating solution comprising water, copper ions, a formaldehyde-free reducing agent to promote the electroless reduction of the copper ions to copper metal, and an alkali metal-free hydroxide. The solution also comprises a complexing agent that is a hydroxy lower alkyl lower alkylene amine, diamine, triamine, polyamine, or imine. An organic nitrogen-containing compound selected from the group consisting of 2,2′bipyridyl, hydroxypyridine, and 2′2-dipyridylamine is also included in the solution. Further, the solution comprises an organic divalent sulfur-containing compound selected from the group consisting of 2-mercaptothiazoline, 2-mercaptobenzothiazole, 2-mercaptopyridine, and allyl thiourea. [0014] Additionally, the present invention is directed to a copper plating solution for the electroless or electrolytic deposition of copper onto a surface of a substrate that comprises water, copper ions at a concentration between about 0.02 and about 0.06 M, ethylenediaminetetraacetic acid at a concentration between about 0.04 and about 0.08 M with the molar ratio of copper ions to ethylenediaminetetraacetic acid being between about 1:1 and about 1:1.5. The solution also comprises glyoxylic acid at a concentration between about 0.07 and about 0.14 M. The solution further comprises tetramethylammonium hydroxide at a concentration between about 1.20 and about 2.20 M with the concentration of tetramethylammonium hydroxide being such that the copper plating solution comprises at least about 10 g/l of tetramethylammonium hydroxide that is unreacted after neutralization of acid in the copper plating solution. Additionally, the solution comprises 2,2′bipyridyl at a concentration between about 0.006 and about 0.064 mM, and 2-mercaptothiazoline at a concentration between about 0.0004 and about 0.004 mM. [0015] Further, the present invention is directed to a process for electrolessly plating copper onto a surface of an integrated circuit semiconductor substrate. The process comprises contacting the surface with a copper plating solution to electrolessly deposit copper onto the surface of the integrated circuit semiconductor substrate. This is accomplished using a copper plating solution comprising water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote the electroless reduction of the copper ions to copper metal, and a catalyst to promote the electrolytic reduction copper ions to copper metal. [0016] The present invention is also directed to a process for electroless plating of copper onto a surface of substrate that comprises contacting the surface with a copper plating solution to electrolessly deposit copper onto the surface of the substrate. The copper plating solution comprises water, copper ions, and a complexing agent that is a hydroxy lower alkyl lower alkylene amine, diamine, triamine, polyamine, or imine. Additionally, the solution comprises a formaldehyde-free reducing agent to promote the electroless reduction of the copper ions to copper metal. An alkali metal-free hydroxide is included in the solution along with an organic nitrogen-containing compound selected from the group consisting of 2,2′bipyridyl, hydroxypyridine, and 2′2-dipyridylamine, and an organic divalent sulfur-containing compound selected from the group consisting of 2-mercaptothiazoline, 2-mercaptobenzothiazole, 2-mercaptopyridine, and allyl thiourea. [0017] Still further, the present invention is directed to a process for electrolytic plating of copper onto a surface of an integrated circuit semiconductor substrate. The process comprises contacting the surface with a copper plating solution and applying an external source of electrons to the copper plating solution to electrolytically deposit copper onto the surface. The copper plating solution comprises water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote the electroless reduction of the copper ions to copper metal, and a catalyst to promote the electrolytic reduction copper ions to copper metal. [0018] The present invention is additionally directed to a process for plating copper onto a substrate. The process comprises contacting the substrate with a copper plating solution to electrolessly deposit an electroless copper layer onto the substrate. The copper plating solution comprises water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote the electroless reduction of the copper ions to copper metal, and a catalyst to promote the electrolytic reduction copper ions to copper metal. After electrolessly depositing copper, the process comprises applying an external source of electrons to the copper plating solution to electrolytically deposit an electrolytic copper layer onto the electroless copper layer. [0019] Other objects and features of the invention will be in part apparent, and in part described hereafter. BRIEF DESCRIPTION OF THE DRAWINGS [0020]FIG. 1 is a schematic diagram of a preferred plating system in which the copper bath composition of the present invention may be used. [0021]FIG. 2 is a schematic diagram of a preferred plating system in which the copper bath composition of the present invention may be used. [0022]FIG. 3 is a schematic diagram of a preferred plating system in which the copper bath composition of the present invention may be used. DETAILED DESCRIPTION OF THE INVENTION [0023] The present invention is directed to a copper bath composition which can be used for electroless and/or electrolytic filling of vias and trenches for the manufacture of integrated circuits and a method of using the same. Specifically, the invention involves a bath, or solution, comprising copper ions which, when contacted with a surface such as a barrier layer, electrolessly deposits a copper seed layer. Further, the copper bath may be used to deposit an enhancement layer onto a copper seed layer. Also, if an electrical potential is applied to the surface while in contact with the bath, copper is electrolytically plated onto the surface. [0024] The copper plating solution of the present invention comprises water, copper ions, a reducing agent, hydroxide ions, a complexing agent, a stabilizer, and if used for electrolytic plating, a catalyst. [0025] The copper ions preferably have a valency of +2. Any appropriate electronics grade copper-containing compound may be used to supply the copper ions. For example, the copper-containing compound is preferably selected from the group consisting of copper (II) sulphate, copper (II) chloride, copper (II) acetate, copper (II) nitrate, copper (II) carbonate, copper (II) hydroxide, copper (II) iodide, and hydrates of the foregoing compounds. In a particularly preferred embodiment of the present invention the copper-containing compound is copper (II) sulphate pentahydrate (CuSO4.5H2O). The concentration of copper ions in the solution is preferably between about 0.008 and about 0.08 M, and more preferably between about 0.02 and about 0.06 M. Thus, the amount of copper (II) sulphate pentahydrate in the copper plating solution is preferably between about 2 and about 20 g/l, and more preferably between about 5 and about 15 g/l. [0026] The copper plating solution of the present invention comprises a reducing agent that reduces the copper (II) ions to copper metal to enable electroless plating. Traditionally, electroless copper baths used formaldehyde as the reducing agent, however, due to toxicity concerns it is not preferred. See U.S. Pat. No. 4,617,205 which is hereby incorporated by reference for all purposes. The copper plating solution of the present invention utilizes a reducing agent which is considerably less toxic than formaldehyde. Preferably, the reducing agent of the present invention is selected from the group consisting of glyoxylic acid, dimethylamine borane (DMAB), hypophosphite, borohydride, hydrazine and mixtures thereof. The hypophosphite and borohydride may be present as sodium, potassium, lithium and ammonium salts. Another source of hypophosphite is hypophosphorous acid. Hydrazine sources include hydrazine and the chloride, sulphate and acetate salts of hydrazine. In a preferred embodiment of the present invention, the reducing agent is glyoxylic acid and the concentration of the glyoxylic acid in the solution is between about 0.027 and about 0.27 M (between about 2 and about 20 g/l). In another preferred embodiment, the concentration of the glyoxylic acid is between about 0.07 and about 0.14 M (between about 5 and about 10 g/l). [0027] The hydroxide ions are included in the plating solution to neutralize the hydrogen ions (H+) generated, e.g., by the copper compounds, the complexing agent, and the reducing agent. Additionally, the hydroxide ions participate in the chemical reduction of the copper ions to copper metal. Preferably, the hydroxide ions are supplied from tetramethylammonium hydroxide (TMAH). Although other hydroxide source compounds may be used (e.g., NaOH, KOH, LiOH, etc.), the bath preferably does not contain any mobile ions such as alkali metal ions which may be critical contaminants for CMOS devices, thus, any other hydroxide-containing compounds included in the solution are preferably substantially free of alkali metal atoms and/or ions (i.e., the compounds of the solution do not contain more than the typical impurity level of alkali metal atoms and/or ions for electronics grade materials). [0028] The concentration of TMAH in the copper plating solution is preferably between about 0.39 and about 2.64 M (between about 35 and about 240 g/l). More preferably, the concentration of TMAH in the copper plating solution is between about 1.20 and about 2.20 M (between about 110 and about 200 g/l). Also, the concentration of the TMAH in the copper plating solution is preferably sufficient to yield at least about 10 g/l of unreacted TMAH in the solution after all the acids have been neutralized by the TMAH (e.g., acids from copper compounds, EDTA, and glyoxylic acid). Typically, the pH of the solution is between about 10 and about 14. In one embodiment, the pH of the solution is between about 12.5 and about 13. [0029] The complexing agent is included in the plating solution to prevent the precipitation of copper oxides, copper hydroxides, and insoluble copper salts (e.g., copper oxalate). Preventing the precipitation of copper oxalate is significant because when glyoxylic acid functions as a reducing agent it is oxidized to oxalic acid which can result in a build-up of oxalate ions when the bath is in use. If formed in the plating solution, such precipitates may deposit on the substrate, become incorporated in the copper plate, and result in a rough surface. If the concentration of precipitates is great enough, the layer deposited on the substrate can be powdery and not adhere to the substrate. In general, the complexing agent is capable of forming stable, water-soluble copper complexes under conditions of high pH (e.g., a pH of 12 and higher) and high temperature (e.g., up to boiling). The complexing agent also keeps the concentration of free copper ions low, which tends to prevent decomposition of the bath. The preferred complexing agent is ethylenediaminetetraacetic acid (EDTA), however, other complexing agents may be used with, or in place of, EDTA. Examples of other complexing agents include: hydroxy lower alkyl lower alkylene amines, diamines, triamines and other polyamines or imines, such as tetra-2-hydroxypropyl ethylene diamine (EDTP); lower alkyl carboxylic acid lower alkylene amines, diamines, triamines or polyamines or imines, such as diethylene triamine pentaacetic acid; compounds which have attributes of the foregoing two classes of compounds, e.g., hydroxyalkyl or alkylene carboxylic acid amines, triamines, polyamines or imines, such as N-2-hydroxyethyl ethylene diamine-N,N′,N′-triacetic acid; hydroxy mono-, di-, tri- or tetra-carboxylic acids, having, for example, 1 to 6 carbon atoms other than in the carboxylic groups, e.g., gluconate and glucoheptonate; nitrilotriacetic acid; glycollic acid; iminodiacetic acid; polyimines; and ethanolamine. [0030] Any appropriate EDTA-containing compound may be used to supply the EDTA. For example, the EDTA may be supplied as the acid itself and as EDTA-containing salts such as EDTA-(mono, di, tri, or tetra)-(sodium, potassium, or ammonium) salts. Preferably, the EDTA is supplied as the acid itself. The concentration of EDTA in the solution is preferably between about 0.012 and about 0.12 M (between about 3 and about 30 g/l). More preferably, the concentration of EDTA is between about 0.04 and about 0.08 M (between about 10 and about 20 g/l). To ensure the efficient plating of copper, the concentrations of the copper ions and the EDTA are preferably controlled so that the molar ratio of copper to EDTA is between about 1:1 and about 1:2, and more preferably between about 1:1 and about 1:1.5. [0031] The plating solution also comprises one or more stabilizer compounds to stabilize the solution and control the plating rate during electroless deposition. A stabilizer compound typically forms strong copper (I) complexes that tend to inhibit the formation of copper (I) oxide. An electroless copper stabilizer causes the plating rate at a given copper surface to diminish as the plating time increases. Thus, one reason for including a stabilizer is to prevent uncontrolled copper plating which would rapidly exhaust the plating solution. Specifically, copper particles or solid impurities that may form in the solution will be plated because the electroless plating of copper is autocatalytic, and if the particles are not stabilized, the plating will continue indefinitely until the solution is exhausted. Another benefit of including a stabilizer is that they tend to refine the grain structure of, and improve the ductility of, the plated copper thereby improving the visual appearance of the deposit and enabling easier inspection. Combinations of such stabilizer compounds may be found to be especially preferred. In one embodiment, the plating solution comprises 2,2′bipyridyl as a stabilizer compound. The concentration of 2,2′bipyridyl in the copper plating solution is preferably between about 0.006 and about 0.128 mM (between about 1 and about 20 g/l). More preferably, the concentration of 2,2′bipyridyl in the copper plating solution is between about 0.006 and about 0.064 mM (between about 1 and about 10 mg/l). The 2,2′bipyridyl may be supplied to the solution as itself and/or by an appropriate organic nitrogen-containing compounds such as hydroxypyridine and 2,2′-dipyridylamine. A further reason for including a stabilizer is that they can be used to control the electroless plating rate. For example, 2,2′bipyridyl tends to enhance the plating rate during electroless deposition. [0032] Optionally, the plating solution may comprise a catalyst to ensure that electrolytically deposited copper is well adhered and not powdery. In conventional electrolytic plating, there is no danger of copper (I) oxide formation because the electrolytic plating solution will not compromise a reducing agent and the plating reaction will only take place at the electrodes. During electrolytic plating, copper (I) ions are formed at the cathode and the catalyst is included to ensure that the copper (I) ions are reduced to copper metal before the ions can migrate from the cathode and form insoluble copper (I) oxide precipitates. Organic sulfur-containing compounds in which the sulfur is divalent are particularly well suited catalysts for electrolytic copper plating. Such organic sulfur compounds include 2-mercaptothiazoline (2-MTA), 2-mercapobenzothiazole, 2-mercaptopyridine, and allyl thiourea. Advantageously, a catalyst such as 2-MTA also acts as a stabilizer and as a deposition rate controller during electroless copper plating by decreasing the plating rate. Thus, in one embodiment of the present invention 2-MTA is included in the plating solution that may be used for electroless and electrolytic deposition of copper. The concentration of 2-MTA in the copper plating solution is preferably less than about 0.84 mM (less than about 10 mg/l). More preferably, the concentration of 2-MTA is between about 0.0004 and about 0.004 mM (between about 0.05 and about 0.5 mg/l). [0033] During a plating operation (electroless and/or electrolytic), the copper plating solution is preferably maintained at a temperature between about 20 and about 90° C., and more preferably between about 60 and about 80° C. The copper plating solution preferably electrolessly plates at a rate between about 3 and about 6 μm/hr. As such, to deposit copper on a substrate by electroless deposition, the substrate is typically immersed in, or contacted with, the copper plating solution for a duration that is between about 10 seconds and about 10 minutes. More preferably, the substrate is immersed in the solution for a duration between about 10 and about 60 seconds. In one embodiment of electrolytic plating, the current density is between about 0.01 and about 5 A/dm2 and the plating rate that is between about 0.13 and about 70 μm/hr. In another embodiment of electrolytic plating, the current density is between about 0.25 and about 1 A/dm2 and the plating rate is between about 3.0 and about 13 μm/h. Typically, the thickness of the electrolytically deposited copper is between about 0.1 and about 3 μm which, in view of the foregoing plating rates, corresponds to the substrate being immersed in the solution for a duration between about 30 seconds and about 10 minutes in the former embodiment, and between about 3 and about 6 minutes in the latter embodiment. [0034] Referring to FIG. 1, one preferred plating system for carrying out the invention is shown generally as 10 and is used for electroplating copper onto a substrate 12. The plating system 10 and method are described with reference to plating a silicon wafer using an insoluble anode but it will be appreciated by those skilled in the art that other plating arrangements may be used. [0035] The plating system 10 comprises an electroplating tank 11 which holds copper electrolyte 27 and which is made of a suitable material such as plastic or other material inert to the electrolytic plating solution. The tank is preferably cylindrical especially for wafer plating. A cathode 12 is horizontally disposed at the upper part of tank 11 and may be any type substrate such as a silicon wafer having openings such as trenches and vias. An anode 13 is also preferably circular for wafer plating and is horizontally disposed at the lower part of tank 11 forming a space between the anode 13 and cathode 12. The anode 13 is typically a soluble anode, but may also be an insoluble anode which is not consumed in the process. [0036] The cathode substrate 12 and anode 13 are electrically connected by wiring 14 and 15, respectively, to a rectifier (power supply) 16. The cathode substrate 12 for direct or pulse current has a net negative charge so that copper ions in the solution are reduced at the cathode substrate forming plated copper metal on the cathode surface 12 a. An oxidation reaction takes place at anode 13. The cathode 12 and anode 13 are shown horizontally disposed but may also be vertically disposed in the tank 11. An electrolyte holding tank 19 contains copper electrolyte 27 which is recycled from holding tank 19 through line 17 a, filter 26 and line 17 b to the inlet 11 a of electroplating tank 11. The electrolyte 27 as it enters the tank moves through an opening 13 a in anode 13 and moves as shown by arrows A upward to the outlets 11 b and 11 b′ of electroplating tank 11. The anode is positioned on plate 31. Arrows B show electrolyte being removed from holding tank 11 through outlets 11 b and 11 b′ into recycle transfer lines 18 a and 18 b. It is preferred that outlets 11 b and 11 b′ be proximate the edge of surface 12 a of cathode 12 and more preferred that the outlet be a continuous opening around the periphery of the electroplating tank so that the flow of electrolyte impinging on the cathode surface is uniform across the cathode surface and the electrolyte overflows the opening and is directed to holding tank 19 for recycle. The electrolyte thus flows through the opening 13 a in anode 13 and flows upward through tank 11 and impinges on cathode 12 as it exits the tank 11. A flange or plate 30 holds cathode 12 in position. As shown in the figure, electrolyte contacts only the upper side of anode 13 and only the lower side 12 a of cathode 12. The outlet electrolyte is recycled to holding tank 19. During operation of the plating system to plate cathode substrate 12 with a layer of copper, the electrolyte 27 is preferably continuously recycled through holding tank 19 and electroplating tank 11. This forms a substantially uniform electrolyte composition in the system and contributes to the overall effectiveness of the substrate plating. [0037] During operation of the electroplating system 10, copper metal is plated on surface 12 a of cathode substrate 12 when the rectifier 16 is energized. A pulse current, direct current, reverse periodic current or other suitable current may be employed. The temperature of the electrolyte may be maintained using a heater/cooler 22 whereby electrolyte 27 is removed from holding tank 19 and flows through line 23, heater/cooler 22 and then recycled to holding tank 19 through line 24. [0038] It is an optional feature of the process that the plating system be controlled as described in U.S. Pat. No. 6,024,856 by removing a portion of the electrolyte from the system when a predetermined operating parameter (condition) is met and new electrolyte is added to the system either simultaneously or after the removal in substantially the same amount. The new electrolyte is preferably a single liquid containing all the materials needed to maintain the electroplating bath and system. The addition/removal system maintains a steady-state constant plating system having enhanced plating effects such as constant plating properties. With this system and method the plating bath reaches a steady state where bath components are substantially a steady-state value. [0039] Referring now to FIG. 2, which shows another preferred plating system 10, the plating system 10 is similar to the plating system of FIG. 1 except that a holding tank 19 is not employed. Thus, an electroplating tank 11 has therein a horizontally disposed cathode 12 and anode 13 separated by a space. Electrolyte 27 in the tank is circulated through the tank and removed through outlet lines 18 a and 18 b. The outlet from the tank is recycled to the inlet of the tank through line 17 a, filter 26 and line 17 b into tank 11 at inlet 11 a. The flow of electrolyte 27 into the tank is shown by arrows A and electrolyte flow to outlets 11 b and 11 b′ past cathode 12 as shown by arrows B. Anode 13 has a central opening 13 a. [0040] When a predetermined operating parameter is reached, electrolyte 27 is removed from the apparatus through line 29 into tank or container 21 and a copper containing solution in tank 20 is fed into outlet line 18 a through line 28. A heater or cooler 22 is shown employed in line 18 a. [0041] Referring now to FIG. 3, another preferred plating system 10 that is similar to the foregoing plating systems except that is designed to plate a wafer using a smaller volume of plating solution that is discarded after each wafer is plated rather than recirculating and/or recycling the plating solution. Advantageously, using this plating system allows every wafer to be plated with a volume of fresh copper plating solution thereby avoiding the build up of reaction products in the bath and allows for very consistent plate quality. This also substantially reduces the need for plating system analysis. To avoid an unacceptably large volume of waste, the electroplating tank 11 is preferably sized to use as little copper plating solution as necessary to adequately plate the wafer. [0042] Although a single plating solution tank 20 may be used as depicted in FIGS. 1 and 2, the embodiment depicted in FIG. 3 uses multiple tanks 20 a and 20 b in order to keep one or more components of the electroplating solution that tend to react with each other (e.g., the copper and the reducing agent) separated until just before being used to plate. For example, a portion of the electroplating solution comprising copper 27 a may be kept in tank 20 a and heated using heater/cooler 22 a and a portion of the electroplating solution comprising the reducing agent 27 b may be kept in tank 20 b and heated using heater/cooler 22 b. When needed, the solution portions 27 a and 27 b are delivered through line 28 to the electroplating tank 11, the mixture is used to plate copper, and the solution after the plating operation is evacuated through line 29 to container 21. Although a recirculating flow of copper plating solution through the electroplating tank 11 may be used, the small size of the tank would most likely make it difficult to implement. Adequate mixing or agitation of the copper plating solution, however, can be achieved by the evolution of hydrogen during the electroless plating reaction and the spinning of the wafer while being plated (the wafer spins in most plating tools during the deposition process). [0043] The steps in the invention of a) contacting the substrate with a copper plating solution to electrolessly deposit an electroless copper layer onto the substrate, and b) applying an external source of electrons to the copper plating solution to electrolytically deposit an electrolytic copper layer onto the electroless copper layer, can be carried out in the same vessel or in separate vessels. As such, applying electrons to the copper plating solution encompasses both the situation when it is the same bulk solution as the solution which was used in the electroless step, as well as the situation where it is a different bulk solution in a different vessel. Where the vessels are different, the respective bulk solutions comprise the same components, qualitatively and optionally quantitatively, i.e., water, copper ions, a complexing agent, hydroxide ions, a catalyst, a stabilizer to inhibit the formation of copper (I) oxide, and a reducing agent selected from the group consisting of glyoxylic acid, dimethylamine borane, hypophosphite, borohydride, and hydrazine. This distinct advantage of this process of having the flexibility to carry out the electroless and electrolytic processes in the same or different vessels is possible because the same solutions are used. When separate vessels are used, the fact that the electroless and electrolytic solutions comprise the same composition components qualitatively and optionally quantitatively has the distinct advantage of avoiding cross-contamination between solutions, so that thorough cleaning of the substrate between electroless and electrolytic deposition is not required. This improves efficiency because a cleaning step is avoided or reduced in scope, and reduces waste stream production. EXAMPLE [0044] An aqueous copper plating solution comprising: about 10 g/l of copper sulphate pentahydrate, about 14.4 g/l of EDTA, about 172 g/l of TMAH, about 7.4 g/l of glyoxylic acid, about 5 mg/l of 2,2′bipyridyl and 0.1 mg/l of 2-MTA was prepared and maintained at a temperature of about 70° C. [0045] A silicon wafer with a 25 nm tantalum barrier layer and 250 nm vias was immersed in an alkaline cleaner, rinsed with water, immersed in a solution comprising about 80 g/l dimethylamine borane (at about 65° C.) for about 1 minute, and then rinsed with water. The wafer was then immersed in the copper plating solution (at about 70° C.) for about 1 minute to electrolessly deposit copper on the surface of the wafer. While still in the copper plating solution, a cathodic current was then applied to the wafer to electrolytically deposit copper on the wafer. The current density was maintained at 0.25 A/dm2 for 30 seconds and then increased to 0.75 A/dm2 for 3 minutes. The plated wafer was then removed from the copper plating solution, rinsed with water, and dried with hot air. The copper plating completely filled the vias and the adhesion of the copper plate was good. [0046] It is to be understood that the above description is intended to be illustrative and not restrictive. Many embodiments will be apparent to those of skill in the art upon reading the above description. The scope of the invention should therefore be determined not with reference to the above description alone, but should also be determined with reference to the claims and the full scope of equivalents to which such claims are entitled. What is claimed is: 1. A copper plating solution for electroless or electrolytic deposition of copper onto a surface of an integrated circuit semiconductor substrate, the copper plating solution comprising water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote electroless reduction of the copper ions to copper metal, and a catalyst to promote electrolytic reduction of copper ions to copper metal. 2. The copper plating solution of claim 1 being substantially free of alkali metal atoms or ions. 3. The copper plating solution of claim 1 wherein the concentration of copper ions is between about 0.008 and about 0.08 M. 4. The copper plating solution of claim 1 wherein the concentration of copper ions is between about 0.02 and about 0.06 M. 5. The copper plating solution of claim 1 wherein the copper ions are supplied from a copper-containing compound selected from the group consisting of copper (II) sulphate, copper (II) chloride, copper (II) acetate, copper (II) nitrate, copper (II) carbonate, copper (II) hydroxide, copper (II) iodide, and hydrates thereof. 6. The copper plating solution of claim 5 wherein the copper-containing compound is copper (II) sulphate pentahydrate. 7. The copper plating solution of claim 1 wherein the reducing agent is free of formaldehyde. 8. The copper plating solution of claim 1 wherein the reducing agent is selected from the group consisting of glyoxylic acid, dimethylamine borane, hypophosphite, borohydride, and hydrazine. 9. The copper plating solution of claim 1 wherein the reducing agent is glyoxylic acid. 10. The copper plating solution of claim 9 wherein the concentration of glyoxylic acid is between about 0.027 and about 0.27 M. 11. The copper plating solution of claim 9 wherein the concentration of glyoxylic acid is between about 0.07 and about 0.14 M. 12. The copper plating solution of claim 1 wherein the complexing agent is selected from the group consisting of: ethylenediaminetetraacetic acid; a hydroxy lower alkyl lower alkalene amine, diamine, -triamine, -polyamine, or imine; a lower alkyl carboxylic acid lower alkylene amine, diamine, triamine, polyamine, or imine; a hydroxyalkyl or alkylene carboxylic acid amine, triamine, polyamine, or imine; a hydroxy mono-, di-, tri- or tetra-carboxylic acid, comprising a carbon atom other than in a carboxylic group; nitrilotriacetic acid; glycollic acid; iminodiacetic acid; a polyimine; and ethanolamine. 13. The copper plating solution of claim 12 wherein the complexing agent is ethylenediaminetetraacetic acid. 14. The copper plating solution of claim 13 wherein concentration of ethylenediaminetetraacetic acid is between about 0.012 and about 0.12 M. 15. The copper plating solution of claim 13 wherein concentration of ethylenediaminetetraacetic acid is between about 0.04 and about 0.08 M. 16. The copper plating solution of claim 13 wherein the molar ratio of copper ions to ethylenediaminetetraacetic acid is between about 1:1 and about 1:2. 17. The copper plating solution of claim 13 wherein the molar ratio of copper ions to ethylenediaminetetraacetic acid is between about 1:1 and about 1:1.5. 18. The copper plating solution of claim 13 wherein the hydroxide ions are from tetramethylammonium hydroxide. 19. The copper plating solution of claim 18 wherein the concentration of tetramethylammonium hydroxide is preferably between about 0.39 and about 2.64 M. 20. The copper plating solution of claim 18 wherein the concentration of tetramethylammonium hydroxide is preferably between about 1.20 and about 2.20 M. 21. The copper plating solution of claim 18 wherein the concentration of tetramethylammonium hydroxide is such that the copper plating solution comprises at least about 10 g/I of tetramethylammonium hydroxide that is unreacted after neutralization of acid in the copper plating solution. 22. The copper plating solution of claim 1 wherein the stabilizer comprises 2,2′bipyridyl. 23. The copper plating solution of claim 22 wherein the concentration of 2,2′bipyridyl is between about 0.006 and about 0.128 mM. 24. The copper plating solution of claim 22 wherein the concentration of 2,2′bipyridyl is between about 0.006 and about 0.064 mM. 25. The copper plating solution of claim 1 wherein the catalyst comprises 2-mercaptothiazoline. 26. The copper plating solution of claim 25 wherein the concentration of 2-mercaptothiazoline is less than about 0.84 mM. 27. The copper plating solution of claim 25 wherein the concentration of 2-mercaptothiazoline is between about 0.0004 and about 0.004 mM. 28. A copper plating solution for electroless or electrolytic deposition of copper onto a surface of a substrate, the copper plating solution comprising: water; copper ions; a complexing agent that is a hydroxy lower alkyl lower alkylene amine, diamine, triamine, polyamine, or imine; a formaldehyde-free reducing agent to promote reduction of the copper ions to copper metal; an alkali metal-free hydroxide; an organic nitrogen-containing compound selected from the group consisting of 2,2′bipyridyl, hydroxypyridine, and 2′2-dipyridylamine; and an organic divalent sulfur-containing compound selected from the group consisting of 2-mercaptothiazoline, 2-mercaptobenzothiazole, 2-mercaptopyridine, and allyl thiourea. 29. The copper plating solution of claim 28 wherein the formaldehyde-free reducing agent is selected from the group consisting of glyoxylic acid, dimethylamine borane, hypophosphite, borohydride, and hydrazine, and the alkali metal-free hydroxide is tetramethylammonium hydroxide. 30. A copper plating solution for electroless or electrolytic deposition of copper onto a surface of a substrate, the copper plating solution comprising: water; copper ions at a concentration between about 0.02 and about 0.06 M; ethylenediaminetetraacetic acid at a concentration between about 0.04 and about 0.08 M; a molar ratio of copper ions to ethylenediaminetetraacetic acid that is between about 1:1 and about 1:1.5; glyoxylic acid at a concentration between about 0.07 and about 0.14 M; tetramethylammonium hydroxide at a concentration between about 1.20 and about 2.20 M with the concentration of tetramethylammonium hydroxide being such that the copper plating solution comprises at least about 10 g/l of tetramethylammonium hydroxide that is unreacted after neutralization of acid in the copper plating solution; 2,2′bipyridyl at a concentration between about 0.006 and about 0.064 mM; and 2-mercaptothiazoline at a concentration between about 0.0004 and about 0.004 mM. 31. A process for electroless plating of copper onto a surface of an integrated circuit semiconductor substrate, the process comprising: contacting the surface with a copper plating solution to electrolessly deposit copper onto the surface of the integrated circuit semiconductor substrate, wherein the copper plating solution comprises water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote electroless reduction of the copper ions to copper metal, and an electrolytic copper reduction catalyst. 32. The process of claim 31 comprising maintaining the copper plating solution at a temperature between about 20 and about 90° C. 33. The process of claim 31 comprising contacting the surface with the copper plating solution for a duration between about 10 seconds and 10 minutes. 34. The process of claim 31 wherein the copper deposits on the surface of the substrate at a rate between about 3 and about 13 μm/hr. 35. The process of claim 31 wherein the concentration of copper ions is between about 0.008 and about 0.08 M, the hydroxide ions are from tetramethylammonium hydroxide and the concentration of tetramethylammonium hydroxide is between about 0.39 and about 2.64 M, the complexing agent is ethylenediaminetetraacetic acid and the concentration of the ethylenediaminetetraacetic acid is between about 0.012 and about 0.12 M, the reducing agent is glyoxylic acid and the concentration of glyoxylic acid is between about 0.027 and about 0.27 M, the stabilizer is 2,2′bipyridyl and the concentration of 2,2′bipyridyl is between about 0.006 and about 0.128 mM, and the catalyst is 2-mercaptothiazoline and the concentration of 2-mercaptothiazoline is less than about 0.84 mM. 36. The process of claim 35 wherein the molar ratio of copper ions to ethylenediaminetetraacetic acid is between about 1:1 and about 1:2. 37. The process of claim 35 wherein the concentration of tetramethylammonium hydroxide is such that the copper plating solution comprises at least about 10 g/l of tetramethylammonium hydroxide that is unreacted after neutralization of acids in the copper plating solution. 38. A process for electroless plating of copper onto a surface of substrate, the process comprising: contacting the surface with a copper plating solution to electrolessly deposit copper onto the surface of the substrate, wherein the copper plating solution comprises water, copper ions, a complexing agent that is a hydroxy lower alkyl lower alkylene amine, diamine, triamine, polyamine, or imine, a formaldehyde-free reducing agent to promote the electroless reduction of the copper ions to copper metal, an alkali metal-free hydroxide, an organic nitrogen-containing compound selected from the group consisting of 2,2′bipyridyl, hydroxypyridine, and 2′2-dipyridylamine, and an organic divalent sulfur-containing compound selected from the group consisting of 2-mercaptothiazoline, 2-mercaptobenzothiazole, 2-mercaptopyridine, and allyl thiourea. 39. A process for electrolytic plating of copper onto a surface of an integrated circuit semiconductor substrate, the process comprising: contacting the surface with a copper plating solution comprising water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, an electroless copper plating stabilizer, an electroless copper plating reducing agent, and a catalyst to promote electrolytic reduction copper ions to copper metal; and applying an external source of electrons to the copper plating solution to electrolytically deposit copper onto the surface. 40. The process of claim 39 wherein the supply of electrons has a current density between about 0.01 and about 5 A/dm2. 41. The process of claim 39 wherein the supply of electrons has a current density between about 0.25 and about 1.0 A/dm2. 42. The process of claim 39 wherein the catalyst is an organic divalent sulfur compound. 43. The process of claim 39 wherein the catalyst is 2-mercaptothiazoline. 44. The process of claim 43 wherein the concentration of 2-mercaptothiazoline in the copper plating solution is less than about 0.84 mM. 45. The process of claim 43 wherein the concentration of 2-mercaptothiazoline in the copper plating solution is between about 0.0004 and about 0.004 mM. 46. The process of claim 43 wherein the concentration of 2-mercaptothiazoline in the copper plating solution is between about 0.006 and about 0.128 mM. 47. The process of claim 45 wherein the concentration of copper ions is between about 0.008 and about 0.08 M, the hydroxide ions are from tetramethylammonium hydroxide and the concentration of tetramethylammonium hydroxide is preferably between about 0.39 and about 2.64 M, the complexing agent is ethylenediaminetetraacetic acid and the concentration of the ethylenediaminetetraacetic acid is between about 0.012 and about 0.12 M, the reducing agent is glyoxylic acid and the concentration of glyoxylic acid is between about 0.027 and about 0.27 M, and the stabilizer is 2,2′bipyridyl and the concentration of 2,2′bipyridyl is between about 0.006 and about 0.128 mM. 48. A process for plating copper onto a substrate, the process comprising: contacting the substrate with a copper plating solution to electrolessly deposit an electroless copper layer onto the substrate, wherein the copper plating solution comprises water, copper ions, hydroxide ions, a complexing agent to inhibit the formation of copper oxides, copper hydroxides and copper salts, a stabilizer to control the rate of electroless copper plating, a reducing agent to promote the electroless reduction of the copper ions to copper metal, and a catalyst to promote the electrolytic reduction copper ions to copper metal; and applying an external source of electrons to the copper plating solution to electrolytically deposit an electrolytic copper layer onto the electroless copper layer. 49. The process of claim 48 wherein the electroless copper layer is substantially continuous and has a thickness of at least about 0.005 μm. 50. The process of claim 48 wherein: the substrate is an integrated circuit semiconductor substrate comprising unfilled submicron electrical interconnects; the contacting the substrate with the copper plating solution to electrolessly deposit the electroless copper layer onto the substrate step comprises depositing the electroless copper layer onto interior surfaces of the submicron electrical interconnects; and the applying the external source of electrons to the copper plating solution to electrolytically deposit the electrolytic copper layer onto the electroless copper layer step comprises substantially filling the interconnects to provide an electrical connection therein. 51. The process of claim 48 wherein: the contacting the substrate with the copper plating solution to electrolessly deposit an electroless copper layer onto the substrate step is performed in a coating vessel; and the applying the external source of electrons to the copper plating solution to electrolytically deposit the electrolytic copper layer onto the electroless copper layer step is performed in said coating vessel in which the contacting the substrate with the copper plating solution to electrolessly deposit is performed. 52. The process of claim 48 wherein the composition of the copper plating solution is not modified between the contacting the substrate with the copper plating solution to electrolessly deposit an electroless copper layer onto the substrate step and the applying the external source of electrons to the copper plating solution to deposit an electrolytic copper layer step. 53. The process of claim 48 wherein the concentration of copper ions is between about 0.008 and about 0.08 M, the hydroxide ions are from tetramethylammonium hydroxide and the concentration of tetramethylammonium hydroxide is preferably between about 0.39 and about 2.64 M, the complexing agent is ethylenediaminetetraacetic acid and the concentration of the ethylenediaminetetraacetic acid is between about 0.012 and about 0.12 M, the reducing agent is glyoxylic acid and the concentration of glyoxylic acid is between about 0.027 and about 0.27 M, the catalyst is 2-mercaptothiazoline and the concentration of 2-mercaptothiazoline is less than about 0.84 mM, and the stabilizer is 2,2′bipyridyl and the concentration of 2,2′bipyridyl is between about 0.006 and about 0.128 mM.

2003-02-05

en

2004-08-05

US-201213527330-A

Multiple separation device and method for separating cancer cells in blood using the device ABSTRACT Provided are a multiple separation device and a method of separating cancer cells in blood using the device. In this device and method, twice magnetophoresis separation steps are performed. At a second magnetophoresis separation step, shapes of ferromagnetic patterns are changed to separate cancer cells into cancer kinds. CROSS-REFERENCE TO RELATED APPLICATIONS This U.S. non-provisional patent application claims priority under 35 U.S.C. §119 of Korean Patent Application No. 10-2011-0075410, filed on Jul. 28, 2011, and Korean Patent Application No. 10-2011-0130311, filed on Dec., 07, 2011, the entire contents of which are hereby incorporated by reference. BACKGROUND The present disclosure herein relates to a multiple separation device capable of separating various materials as well as biomaterials. Furthermore, the present invention relates to a method for separating cancer cells in blood using the device. It is required to separate components in cells or cell types as tools for a final objection or other analyses in diagnosis, remedy and study fields of a medicinal discipline. For example, it is needed to analyze a cancer cell. Cancer cells in blood are commonly named as cancer cells existing in peripheral blood of a cancer patient and fall off from an original carcinomatous focus or transition focus. These cancer cells in blood are expected as influential biomarkers for cancer diagnosis, remedy convalescence analysis, fine transition analysis and etc. Furthermore, the analysis of a cancer cell in blood has an advantage that this analysis is a non-invasive method in comparison with a conventional cancer diagnosis method. Therefore, this analysis is very brightly prospected as a future cancer diagnosis method. However, the distribution ratio of the cancer cell in blood is very low. For example, the distribution ratio of the cancer cell in blood is about one cancer cell per the total billion cells or about one cancer cell per about 106˜107 leukocytes. Therefore, the precise analysis is very difficult and an ingenious analysis method is required. There have been studied many methods for separating cancel cells in blood. However, in conventional methods, the test time takes long and the methods only show the existence, the nonexistence and/or the number of the cancer cells. It is difficult to analyze the kind of the cancer. Furthermore, there is an interference problem by non-specifically combined blood corpuscle. SUMMARY The present disclosure provides a multiple separation device capable of separating various materials as well as biomaterials. The present disclosure provides a method for separating cancer cells in blood. Embodiments of the inventive concept provide a multiple separation device including: a first channel where a mixed solution flows in a first direction; and at least one first ferromagnetic pattern which is disposed below a bottom of the first channel and has a first side parallel to the first direction and a second side extending to a second direction crossing the first direction, wherein the first ferromagnetic pattern has a magnetic force changing according to a position on the second side. A width of the first ferromagnetic pattern parallel to the first direction may be changed along a position on the second side. The width of the first ferromagnetic pattern parallel to the first direction may be decreased as going from one point of the second side to the other point thereof. The first ferromagnetic pattern may have a first thickness and the first thickness is changed along a position of the second side. The first thickness may be decreased as going from one point of the second side to the other point thereof. The second side may be curved, and a gradient of a tangent line of the second side is changed along a position of the second side. The gradient may become bigger as going from one point of the second side to the other thereof. A magnetic force of the first ferromagnetic pattern may become weak as going from one point of the second side to the other thereof. The device may further include at least one first permanent magnet disposed to be adjacent to the first channel. The device may further include a preliminary separation passageway connected to the first channel; a second channel connected to the preliminary separation passageway, where a mixed solution flows to the first direction; a first outlet connected to the second channel and separated from the preliminary separation passageway; a mixed solution inlet connected to the second channel, where the mixed solution is injected; a first saline solution inlet connected to the first channel; a second saline solution inlet connected to the second channel; and a second outlet connected to the first channel. The device may further include a second ferromagnetic pattern disposed below a bottom of the second channel and including a third side parallel to the first direction and a fourth side extending to the second direction, wherein a width of the second ferromagnetic pattern parallel to the first direction may be constant at any position on the fourth side. The mixed solution may include a first kind material particle of a first magnetization magnitude, a second kind material particle of a second magnetization magnitude, and a third kind material particle of a third magnetization magnitude. The second magnetization magnitude may be bigger than the first magnetization magnitude and smaller than the third magnetization magnitude. The first kind material particle may be separated from the second and third kind material particles and exhausted through the first outlet. The second outlet further may include a plurality of final separation passageways, and the second and third kind material particles may be separated from the first channel to be transferred to the final separation passageway. The device may further include third ferromagnetic patterns disposed at the final separation passageways, respectively. The mixed solution may be blood. The first kind material particle may be a normal cell. The second and third kind material particles may be cancer cells different from each other to which a magnetic nanoparticle is combined. The cancer cells may include markers of different number, the magnetic nanoparticles may be combined to the markers, and the second and third kind material particles include magnetic nanoparticles of different number, each other. Other embodiments of the inventive concept provide a method of separating a cancer cell in blood, including: mixing blood for a test with a magnetic nanoparticle combined with an antibody capable of specific reaction to a cancer cell; firstly separating cancer cells from normal cells by using a magnetophoresis method; and secondly separating the firstly separated cancer cells into cancer kinds using the multiple separation device. The secondly separating of the firstly separated cancer cells into cancer kinds may include sorting the firstly separated cancer cells into positions on the second side. The method may further include capturing the cancel cells separated by cancer kinds using a ferromagnetic material. The method may further include identifying positions of the captured cancer cells and performing an image analysis with respect to the captured cancer cells to discriminate cancer kinds. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings are included to provide a further understanding of the inventive concept, and are incorporated in and constitute a part of this specification. The drawings illustrate exemplary embodiments of the inventive concept and, together with the description, serve to explain principles of the inventive concept. In the drawings: FIG. 1 is a flowchart illustrating a method of separating cancer cells in blood according to an example of the inventive concept; FIG. 2 shows materials particles contained in a mixed solution according to an example of the inventive concept; FIG. 3 is a schematic plan view showing a multiple separation device according to an example of the inventive concept; FIG. 4A is a detailed plan view of a first magnetophoresis separation part contained in the multiple separation device of FIG. 2; FIG. 4B is a cross-sectional view taken along the line A-A′ of FIG. 4A. FIG. 4C shows movement of a material particle at the first magnetophoresis separation part; FIG. 5A is a detailed plan view of a second megnetophoresis separation part contained in the multiple separation device of FIG. 2 according to an example of the inventive concept; FIG. 5B is a cross-sectional view taken along the B-B′ line of FIG. 5A; FIG. 6A is a detailed plan view of a second megnetophoresis separation part contained in the multiple separation device of FIG. 2 according to another example of the inventive concept; FIG. 6B is a cross-sectional view taken along the C-C′ line of FIG. 6A; FIG. 7A is a detailed plan view of a second megnetophoresis separation part contained in the multiple separation device of FIG. 2 according to still another example of the inventive concept; FIG. 7B is an enlarged plan view of a part of FIG. 7A; and FIGS. 8 and 9 are cross-sectional views of a part of a second magnetophoresis according to other examples of the inventive concept. DETAILED DESCRIPTION OF THE EMBODIMENTS Preferred embodiments of the present invention will be described below in more detail. The invention may, however, be embodied in many different forms and should not be construed as being limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the invention to those skilled in the art. FIG. 1 is a flowchart illustrating a method of separating cancer cells in blood according to an example of the inventive concept. FIG. 2 shows materials particles contained in a mixed solution according to an example of the inventive concept. FIG. 3 is a schematic plan view showing a multiple separation device according to an example of the inventive concept. Referring to FIGS. 1 and 2, in a method of separating cancer cells in blood according to an example of the inventive concept, a blood for a test is mixed with magnetic nanoparticles combined with an antibody which can specifically react to a cancer cell, thereby forming a mixed solution (A first step, S10). The blood may contain a normal cell (a first kind material particle, PU) such as a leukocyte, a cancer cell A (a second kind material particle, PS1) and a cancer cell B (a third material particle, PS2) which are different each other. If the kinds of the cancer cells PS1 and PS2 are different, the numbers of the markers (For example, antigen) expressed to the cancer cells are also different. In a case of EpCAM (epithelial cellular adhesion molecule) marker, the number of EpCAM expression per a cell of a breast cancer cell SKBr-3 is about 500,000, the number of EpCAM expression per a cell of a breast cancer cell PC3-9 is about 50,000, and the number of EpCAM expression per a cell of a bladder cancer cell T-24 is about 2,000. Like this, there is a big difference of the number of the marker expressed per one cancer cell. Therefore, if an antibody which can specifically reacted to the EpCAM is combined with magnetic nanoparticles and these magnetic nanoparticles and blood of a cancer patient are mixed, there is a big difference of a number of the magnetic nanoparticles combined to the cancer cell according to a cancer kind. This difference of the number of the magnetic nanoparticles combined per a cell can be used for separating cancer cells and discriminating cancer kinds using magnetic field. As the number of the magnetic nanoparticles is increased, a magnetization magnitude is increased. The magnetic nanoparticle can be non-specifically combined to a normal cell such as leukocyte. However, the number of the magnetic nanoparticle combined to the leukocyte can be remarkably small than that of the magnetic nanoparticle combined to markers of cancer cells. If the first kind material particle PU, the second kind material particle PS1 and the third kind material particle PS3 have a first magnetization magnitude, a second magnetization magnitude and a third magnetization magnitude, respectively, the second magnetization magnitude is bigger than the first magnetization magnitude and smaller than the third magnetization magnitude. The mixed solution composed of the blood containing the magnetic nanoparticles is separated by using a multiple separation device 100 of FIG. 3. Referring to FIG. 3, the multiple separation device 100 according to an example of the inventive concept includes a first magnetophoresis separation part MP1 and a second magnetophoresis separation part MP2. The first magnetophoresis separation part MP1 includes a first channel CH1 where the mixed solution flows in a first direction X. A mixed solution inlet IP1 where the mixed solution is injected and a first saline solution inlet IP2 are connected to a side of the first channel CH1. A first outlet OP1 and a preliminary separation passageway PSP are connected to the other side of the first channel CH1. The second magnetophoresis separation part MP2 includes a second channel CH2 where the mixed solution flows in the first direction X. A second saline solution inlet IP3 and the preliminary separation passageway PSP are connected to one side of the second channel CH2. A second outlet OP2 is connected to the other side of the second channel CH2. The second outlet OP2 may further include a plurality of final separation passageway FSP which are separated each other by a separation wall IW. A third ferromagnetic pattern FP3 may be disposed in the each of the final separation passageways FSP for capturing the separated cancer cells. The mixed solution includes a first kind material particle PU which may be a normal cell, a second kind material particle PS1 which may be a cancer cell A, and a third kind material particle PS2 which can be a cancer cell B. Although there are two kinds of the cancer cells in this example, three or more kinds thereof are possible. Referring to FIGS. 1 and 3, the mixed solution is injected into the mixed solution inlet IP1, and a saline solution is injected into the first saline solution inlet IP2. Using a magnetophoresis method, normal cells PU and cancer cells PS1 and PS2 in the blood are firstly separated at the first magnetophoresis separation part MP1 (A second step, S20). The firstly separated cancer cells PS1 and PS2 are sent to the preliminary separation passageway PSP and the normal cells PU are exhausted through the first outlet OP1. The cancer cells PS1 and PS2 passing through the preliminary separation passageway PSP are mixed with the saline solution provided through the first saline solution inlet IP1 and passed through the second magnetophoersis separation part MP2. At the second magnetophoresis separation part MP2, the firstly separated cancer cells PS1 and PS2 are secondly separated into cancer kinds (A third step, S30). At the magnetophoresis separation parts MP1 and MP2, the material particles PU, PS1, PS2 are sorted into positions of a second direction Y crossing the first direction X. The secondly separated cancer cells PS1 and PS2 into the cancer kinds are sent to the second outlet OP2. The cancer cell A PS1 and The cancer cell B PS2 are captured at the third ferromagnetic pattern FP3 in each different final separation passageway FSP. The method may further include identifying the positions of the captured cancer cells PS1 and PS2, performing image analyses with respect to the captured cancer cells PS1 and PS2 to discriminate cancer kinds For this, an image analysis device can be used. The first magnetophoresis separation part MP1 is explained in more details. FIG. 4A is a detailed plan view of a first magnetophoresis separation part contained in the multiple separation device of FIG. 2. FIG. 4B is a cross-sectional view taken along the line A-A′ of FIG. 4A. FIG. 4C shows movement of a material particle at the first magnetophoresis separation part. Referring to FIGS. 4A, 4B and 4C, at the first magnetophoresis separation part MP1 a first channel CH1 is disposed. At the first channel CH1, a mixed solution flows in a first direction X. The first channel CH1 can be provided by a substrate SB where a groove is formed and a cover CV covering the substrate SB. Below a bottom surface of the first channel CH1, a first ferromagnetic pattern FP1 is disposed. The first ferromagnetic pattern FP1 includes a first side S1 parallel to the first direction X and a second side S2 extending closely to the second direction Y. At any position on the second side S2, a width of the first ferromagnetic pattern FP1 parallel to the first direction X can be constant. That is, the first ferromagnetic pattern FP1 can have a parallelogram shape in a plan view. The first ferromagnetic pattern FP1 has a constant magnetic force at any position on the second side S2. In order to constantly magnetize the first ferromagnetic pattern FP1 to keep the magnetic force of the first ferroelectric pattern FP1 constant, at least one permanent magnet MG1 and MG2 can be disposed to be adjacent to the first channel 1. The permanent magnets MG1 and MG2 may include a first permanent magnet MG1 and the second permanent magnet MG2. For example, one of the first permanent magnet MG1 and the second permanent magnet MG2 may be the north (N) pole, and the other of them may be the south (S) pole. The first permanent magnet MG1 and the second permanent magnet MG2 may be faced to each other and the first channel CH1 is disposed therebetween. A third direction Z may be orthogonal to both the first direction X and the second direction Y. The substrate SB, the cover CV and the separation layer IW (of FIG. 1) may be formed of the same material. For example, the substrate SB, the cover CV and the separation layer IW may be formed of a material such as glass or plastic which has a low reactivity. A mixed solution provided through the mixed solution inlet IP1 and mixed with the saline solution is sent to the first channel CH1. At this time, since the first kind material particle PU having a first magnetization magnitude of the lowest value includes almost no magnetic nanoparticle, the first kind material particle PU is not captured to the first ferromagnetic pattern FP1 and flows along a low arrow AL showing a flow of the mixed solution. However, the second and third kind material particles PS1 and PS2 containing a lot of the magnetic nanoparticles are captured to the first ferromagnetic pattern FP1. A magnetic force Fm orthogonal to the second side S2 and a force Fd caused by the flow of the mixed solution are applied to the second and the third kind material particles PS1 and PS2 as shown in FIG. 4C. Consequently, the resultant force Fs of the magnetic force Fm and the force Fd is applied to the second and the third kind material particles PS1 and PS2, so that the second and the third kind material particles PS1 and PS2 move along the second side. The magnetic force Fm may have a negative sign which is opposite to that of the force Fd caused by the flow of the mixed solution. The condition that the second and third kind material particles PS1 and PS2 are captured to the first ferromagnetic pattern FP1 can be suggested by the following equation 1. F m +F d cos θ<0 tm <Equation 1> Therefore, as an angle θ between the second side S2 and the first direction X becomes increased, it increases a possibility that the second and third kind material particles PS1 and PS2 are not captured but passed. Again referring to FIG. 4A, the second and third kind material particles PS1 and PS2 can move along an upper arrow AU. Therefore, the first material particle PU is transferred to the first outlet OP1 and the second third kind material particles PS1 and PS2 can be transferred to the preliminary passageway PSP. At the first magnetophoresis separation part MP1, to separate the material particles with or without the magnetism is possible but to precisely separate them along the number of the magnetic nanoparticles is difficult. The second magnetophoresis separation part MP2 may be explained in more details. FIG. 5A is a detailed plan view of a second megnetophoresis separation part contained in the multiple separation device of FIG. 2 according to an example of the inventive concept. FIG. 5B is a cross-sectional view taken along the B-B′ line of FIG. 5A. Referring to FIGS. 5A and 5B, a second channel CH2 is disposed at the second magnetophoresis separation part MP2. A mixed solution flows in a first direction X at the second channel CH2. The second channel CH2 may be provided by a substrate SB having a groove and by a cover CV covering the substrate SB. A second ferromagnetic pattern FP2 is disposed below a bottom surface of the second channel CH2. The second ferromagnetic pattern FP2 forms a direct magnetic density distribution to the second channel CH2. In order to constantly magnetize the second ferromagnetic pattern FP2 to keep the magnetic force of the second ferroelectric pattern FP2 constant, at least one permanent magnet MG3 and MG4 can be disposed to be adjacent to the second channel 2. The permanent magnets MG3 and MG4 may include a third permanent magnet MG3 and the fourth permanent magnet MG4. For example, the third permanent magnet MG3 may be the north (N) pole, and the fourth permanent magnet MG4 may be the south (S) pole. The third permanent magnet MG3 and the fourth permanent magnet MG4 may be faced to each other and the second channel CH2 is disposed therebetween. The second ferromagnetic pattern FP2 includes a third side S3 parallel to the first direction X and a fourth side S4 extending closely to the second direction Y. The second ferromagnetic pattern FP2 has a magnetic force which is changed along a position on the fourth side S4. A width of the second ferromagnetic pattern FP2 parallel to the first direction X is changed along a position on the fourth side S4. Particularly, as going from a start point DS to an end point DE on the fourth side S4, a width of the second ferromagnetic pattern FP2 parallel to the first direction X is decreased. Therefore, the second ferromagnetic pattern FP2 may have a triangular shape. At this time, a thickness of the second ferromagnetic pattern FP2 may be constant. Therefore, a unit volume of the second ferromagnetic pattern FP2 becomes small and a magnetic force (Fm of FIG. 4C) of the second ferromagnetic pattern FP2 becomes also weak as going from a start point DS to an end point DE on the fourth side S4. The third kind material particle PS2 and the second kind material particle PS1 may move along the second ferromagnetic pattern FP2 with being captured on the second ferromagnetic pattern FP2. When the force by a fluid flow (Fd of FIG. 4C) is stronger than the magnetic force (Fm of FIG. 4C), the third kind material particle PS2 and the second kind material particle PS1 may get out of the second ferromagnetic pattern FP2. Since the third kind material particle PS2 has the third magnetization magnitude of a biggest value, the third kind material particle PS2 is well captured to the second ferromagnetic pattern FP2. Therefore, after the third kind material particle PS2 moves up to the end point of the fourth side S4 with being captured onto the second ferromagnetic pattern FP2, the third kind material particle PS2 can get out of the second ferromagnetic pattern FP2. The third kind material particle PS2 can move along a first upper arrow AU1. However, the second kind material particle PS1 can move for a moment along the second ferromagnetic pattern FP2, and then, when the force by a fluid flow (Fd of FIG. 4C) is stronger than the magnetic force (Fm of FIG. 4C), the second kind material particle PS1 may get out of the second ferromagnetic pattern FP2. Therefore, the second material particle PS1 can move along a second or a third upper arrow AU2 or AU3. However, since the first kind material particle PU, which had not been separated at the first magnetophoresis separation part MP1 but entered the preliminary separation passageway PSP, would be not captured onto the second ferromagnetic pattern FP2, the first kind material particle PU can move along a fourth upper arrow AU4. Like this, it is possible to separate cancer cells into cancer kinds by using the number of the magnetic nanoparticles. FIG. 6A is a detailed plan view of a second megnetophoresis separation part contained in the multiple separation device of FIG. 2 according to another example of the inventive concept. FIG. 6B is a cross-sectional view taken along the C-C′ line of FIG. 6A. FIGS. 6A and 6B, in this example, although a width of the second ferromagnetic pattern FP2 in the first direction X is constant along a position on the fourth side S4, a thickness T1 of the second ferromagnetic pattern FP2 is changed. That is, as going from a start point DS to an end point of the fourth side S4, the thickness T1 can become thin. Therefore, as going from a start point DS to an end point of the fourth side S4, a volume of the second ferromagnetic pattern FP2 becomes small so that a magnetic force thereof becomes also weak. Therefore, as explained by referring to FIGS. 5A and 5B, it is possible to separate cancer cells into cancer kinds by using the number of the magnetic nanoparticles. FIG. 7A is a detailed plan view of a second megnetophoresis separation part contained in the multiple separation device of FIG. 2 according to still another example of the inventive concept. FIG. 7B is an enlarged plan view of a part of FIG. 7A. Referring to FIGS. 7A and 7B, a fourth side S4 can be curved and gradients of tangent lines L1, L2, L3 and L4 of the fourth side S4 can be changed along positions on the fourth side S4. Particularly, as going from a start point DS to an end point of the fourth side S4, each angle (θ1,θ2,θ3 and θ4) between the fluid flow direction (for example, the first direction X) and each of the tangent lines L1, L2, L3, L4 can become increased. Therefore, as explained by referring to the equation 1, as going from a start point DS to an end point of the fourth side S4, a possibility that the third and second kind material particles are not captured onto the second ferromagnetic pattern FP2 but passed is increased. The third kind material particle PS2 of the biggest value has a bigger possibility to move up to the end point thereof, so that the third kind material particle PS2 can move along a first upper arrow AU1. The second kind material particle PS1 can move along a second or a third upper arrow AU2 or AU3. The first kind material particle PU can move along a fourth upper arrow AU4. Therefore, as explained by referring to FIGS. 5A and 5B, it is possible to separate cancer cells into cancer kinds by using the number of the magnetic nanoparticles. FIGS. 8 and 9 are cross-sectional views of a part of a second magnetophoresis according to other examples of the inventive concept. Referring to FIG. 8, both the third permanent magnet MG3 and the fourth permanent magnet MG4 may be disposed below the substrate SB. Alternatively, referring to FIG. 9, the third permanent magnet MG3 is disposed over the second channel CH2, and the fourth permanent magnet Mg4 is disposed below the substrate SB. The position of the permanent magnet can be variously changed, and any one out of the north (N) pole and the south (S) pole is possible. In the multiple separation device and the method of separating cancer cells in blood using the device according to the inventive concept, it can simply pronounce a diagnosis with respect to existence or non-existence of cancer and also can discriminate cancer kinds. Furthermore, since it can almost perfectly remove interference by blood corpuscle cells, it can remarkably improve specificity than other technologies. The above-disclosed subject matter is to be considered illustrative and not restrictive, and the appended claims are intended to cover all such modifications, enhancements, and other embodiments, which fall within the true spirit and scope of the inventive concept. Thus, to the maximum extent allowed by law, the scope of the inventive concept is to be determined by the broadest permissible interpretation of the following claims and their equivalents, and shall not be restricted or limited by the foregoing detailed description. 1. A multiple separation device comprising: a first channel where a mixed solution flows in a first direction; and at least one first ferromagnetic pattern which is disposed below a bottom of the first channel and has a first side parallel to the first direction and a second side extending to a second direction crossing the first direction, wherein the first ferromagnetic pattern has a magnetic force changing according to a position on the second side. 2. The device of claim 1, wherein a width of the first ferromagnetic pattern parallel to the first direction is changed along a position on the second side. 3. The device of claim 2, wherein the width of the first ferromagnetic pattern parallel to the first direction is decreased as going from one point of the second side to the other point thereof. 4. The device of claim 1, wherein the first ferromagnetic pattern has a first thickness and the first thickness is changed along a position of the second side. 5. The device of claim 4, wherein the first thickness is decreased as going from one point of the second side to the other point thereof. 6. The device of claim 1, wherein the second side is curved, and a gradient of a tangent line of the second side is changed along a position of the second side. 7. The device of claim 6, wherein the gradient becomes bigger as going from one point of the second side to the other thereof. 8. The device of claim 1, wherein a magnetic force of the first ferromagnetic pattern becomes weak as going from one point of the second side to the other thereof. 9. The device of claim 1, further comprising at least one first permanent magnet disposed to be adjacent to the first channel. 10. The device of claim 1, further comprising: a preliminary separation passageway connected to the first channel; a second channel connected to the preliminary separation passageway, where a mixed solution flows to the first direction; a first outlet connected to the second channel and separated from the preliminary separation passageway; a mixed solution inlet connected to the second channel, where the mixed solution is injected; a first saline solution inlet connected to the first channel; a second saline solution inlet connected to the second channel; and a second outlet connected to the first channel. 11. The device of claim 10, further comprising a second ferromagnetic pattern disposed below a bottom of the second channel and comprising a third side parallel to the first direction and a fourth side extending to the second direction, wherein a width of the second ferromagnetic pattern parallel to the first direction is constant at any position on the fourth side. 12. The device of claim 11, wherein the mixed solution comprises a first kind material particle of a first magnetization magnitude, a second kind material particle of a second magnetization magnitude, and a third kind material particle of a third magnetization magnitude, wherein the second magnetization magnitude is bigger than the first magnetization magnitude and smaller than the third magnetization magnitude, and wherein the first kind material particle is separated from the second and third kind material particles and exhausted through the first outlet. 13. The device of claim 12, wherein the second outlet further comprises a plurality of final separation passageways, and wherein the second and third kind material particles are separated from the first channel to be transferred to the final separation passageway. 14. The device of claim 13, further comprising third ferromagnetic patterns disposed at the final separation passageways, respectively. 15. The device of claim 12, wherein the mixed solution is blood, the first kind material particle is a normal cell, the second and third kind material particles are cancer cells different from each other to which a magnetic nanoparticle is combined. 16. The device of claim 15, wherein the cancer cells include markers of different number, the magnetic nanoparticles are combined to the markers, and the second and third kind material particles include magnetic nanoparticles of different number, each other. 17. A method of separating a cancer cell in blood, comprising: mixing blood for a test with a magnetic nanoparticle combined with an antibody capable of specific reaction to a cancer cell; firstly separating cancer cells from normal cells by using a magnetophoresis method; and secondly separating the firstly separated cancer cells into cancer kinds using the multiple separation device of claim 1. 18. The method of claim 17, wherein the secondly separating of the firstly separated cancer cells into cancer kinds comprising sorting the firstly separated cancer cells into positions on the second side. 19. The method of claim 17, further comprising capturing the cancel cells separated by cancer kinds using a ferromagnetic material. 20. The method of claim 19, further comprising identifying positions of the captured cancer cells and performing an image analysis with respect to the captured cancer cells to discriminate cancer kinds.

2012-06-19

en

2013-01-31

US-201816158652-A

Ganoderma lucidum polysaccharides composite composition ABSTRACT A Ganoderma lucidum polysaccharides composite composition comprising, based on a total composition: 1 to 5 wt. % β-glucan extract, 1 to 5 wt. % Ganoderma lucidum mycelium extract, 1 to 5 wt. % Trametes versicolor mycelium extract, 1 to 5 wt. % Tremella fuciformis Berk extract, 1 to 5 wt. % Auricularia auricula - judae extract, 1 to 5 wt. % Hericium erinaceus extract, 1 to 3 wt. % Ganoderma lucidum fruiting body extract, and water. BACKGROUND OF THE INVENTION Technical Field The present invention is related to a polysaccharides composition, and more particularly to a Ganoderma lucidum polysaccharides composite composition. Description of Related Art Polysaccharides produced by fungi could promote immunity. For example, Ganoderma lucidum is commonly used as raw materials for producing health food products. β-Glucans are naturally occurring polysaccharides and correlate closely with immunomodulatory effects of polysaccharides. Conventional polysaccharides health food products could be single-ingredient products and multi-ingredient products, and the multi-ingredient products would have better immunomodulatory effects. With increasing demand for health food products, it is required to develop polysaccharides products having multiple ingredients and good flavor. BRIEF SUMMARY OF THE INVENTION In view of the above, an object of the present invention is to provide a Ganoderma lucidum polysaccharides composite composition which could promote immunity. To achieve the object mentioned above, the present invention provides a Ganoderma lucidum polysaccharides composite composition comprising, based on a total composition, 1 to 5 wt. % β-glucan extract, 1 to 5 wt. % Ganoderma lucidum mycelium extract, 1 to 5 wt. % Trametes versicolor mycelium extract, 1 to 5 wt. % Tremella fuciformis Berk extract, 1 to 5 wt. % Auricularia auricula-judae extract, 1 to 5 wt. % Hericium erinaceus extract, 1 to 3 wt. % Ganoderma lucidum fruiting body extract, and water. To achieve the object mentioned above, the present invention provides a method for producing a Ganoderma lucidum polysaccharides composite composition, comprising steps of: respectively mixing a fermented culture of Aureobasidium pullulans, a fermented culture of Ganoderma lucidum, a fermented culture of Trametes versicolor, a powdered fruiting body of Tremella fuciformis Berk, a powdered fruiting body of Auricularia auricula-judae, a powdered fruiting body of Hericium erinaceus, and a powdered fruiting body of Ganoderma lucidum with water in a ratio by weight of 10:1 to 40:1 for producing a mixture; stirring each of the mixtures at 70 to 100° C. for 2 to 6 hours; filtering each of the mixtures to remove solids; concentrating and heating each of the mixtures for sterilization for producing a β-glucan extract, a Ganoderma lucidum mycelium extract, a Trametes versicolor mycelium extract, a Tremella fuciformis Berk extract, a Auricularia auricula-judae extract, a Hericium erinaceus extract, and a Ganoderma lucidum fruiting body extract; and mixing the extracts together for producing the Ganoderma lucidum polysaccharides composite composition. The advantage of the present invention is that the multi-ingredient Ganoderma lucidum polysaccharides composite composition could promote the potential immunomodulatory effects on the specific and non-specific immunity. BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS The present invention will be best understood by referring to the following detailed description of some illustrative embodiments in conjunction with the accompanying drawings, in which: FIG. 1 shows the body weight changes during the evaluation study on the specific immunomodulatory effects; FIG. 2 shows the proliferative responses of mouse splenocytes according to the evaluation study on the specific immunomodulatory effects; FIG. 3 shows the IL-2, TNF-α, and IFN-γ production without OVA stimulation according to the evaluation study on the specific immunomodulatory effects; FIG. 4 shows the IL-2 production after OVA stimulation according to the evaluation study on the specific immunomodulatory effects; FIG. 5 shows the TNF-α production after OVA stimulation according to the evaluation study on the specific immunomodulatory effects; FIG. 6 shows the IFN-γ production after OVA stimulation according to the evaluation study on the specific immunomodulatory effects; FIG. 7 shows the anti-OVA IgG2a antibodies production according to the evaluation study on the specific immunomodulatory effects; FIG. 8 shows the body weight changes during the evaluation study on the non-specific immunomodulatory effects; FIG. 9 shows the proliferative responses of mouse splenocytes according to the evaluation study on the non-specific immunomodulatory effects; FIG. 10 shows the NK cell cytolytic activity according to the evaluation study on the non-specific immunomodulatory effects; FIG. 11 shows the phagocytic activity of peritoneal macrophages according to the evaluation study on the non-specific immunomodulatory effects; FIG. 12 shows the IL-2 and IFN-γ production without OVA stimulation according to the evaluation study on the non-specific immunomodulatory effects; FIG. 13 shows the IL-2 production after Con A stimulation according to the evaluation study on the non-specific immunomodulatory effects; FIG. 14 shows the IL-2 production after LPS stimulation according to the evaluation study on the non-specific immunomodulatory effects; FIG. 15 shows the IFN-γ production after Con A stimulation according to the evaluation study on the non-specific immunomodulatory effects; and FIG. 16 shows the IFN-γ production after LPS stimulation according to the evaluation study on the non-specific immunomodulatory effects. DETAILED DESCRIPTION OF THE INVENTION The following illustrative embodiments and drawings are provided to illustrate the disclosure of the present invention, these and other advantages and effects can be clearly understood by persons skilled in the art after reading the disclosure of this specification. A Ganoderma lucidum polysaccharides composite composition comprises a plurality of fungal extracts and water, wherein the plurality of fungal extracts includes a β-glucan extract, a Ganoderma lucidum mycelium extract, a Trametes versicolor mycelium extract, a Tremella fuciformis Berk extract, an Auricularia auricula-judae extract, a Hericium erinaceus extract, and a Ganoderma lucidum fruiting body extract. A method for producing the Ganoderma lucidum polysaccharides composite composition comprises the following steps. (1) Polysaccharides Extracted from Fermented Cultures 1.1 Producing Fermented Culture A microorganism is cultured in a culture medium, wherein the culture medium has a pH of 5.0-6.5 and comprises, based on a total culture medium, 0.5-5.0 wt. % carbon source (e.g., glucose or sucrose), 0.1-1.5 wt. % nitrogen source (e.g., yeast extract, yeast peptones, or soy peptones) and nutrient source (e.g., trace elements and inorganic nutrients). The culture medium is then incubated in air at 20-30° C. for 2-7 days with stirring for producing a fermented culture. 1.2 Producing Polysaccharides Extract The fermented culture is mixed with water in a ratio by weight of 10:1 to 40:1. The mixture is stirred at 70-100° C. for 2-6 hours, and then filtered to remove solids. The filtered mixture is concentrated and then heated for sterilization to produce a polysaccharides extract. (2) Polysaccharides Extracted from Fruiting Bodies 2.1 Producing Fruiting Body Mixture A powdered fruiting body is mixed with water in a ratio by weight of 10:1 to 40:1. The mixture is stirred at 70-100° C. for 2-6 hours. 2.2 Producing polysaccharides extract The mixture is then filtered to remove solids. The filtered mixture is concentrated and then heated for sterilization to produce a polysaccharides extract. (3) Analysis of Polysaccharides 3.1 β-Glucan Content The β-glucan extract is mixed with a buffer solution. The mixture is treated with α-amylase, protease, and amyloglucosidase in sequence, and then precipitated with four times volume of ethanol. β-glucan is precipitated from the solution. The precipitation is collected, washed with ethanol, and then dried. The dried precipitation is treated with strong acid and hydrolyzed at high temperature. The β-glucan content is calculated by analyzing the glucose after acid-base neutralization reaction. 3.2 Polysaccharides Concentration The Ganoderma lucidum mycelium extract, the Trametes versicolor mycelium extract, the Tremella fuciformis Berk extract, the Auricularia auricula-judae extract, the Hericium erinaceus extract, and the Ganoderma lucidum fruiting body extract are respectively diluted to an appropriate concentration and injected into a dialysis membrane (MW: 6000-8000) at a rate of 0.2 L/min for 48 hours. The dialyzed solution is analyzed for polysaccharides concentration by using phenol-sulfuric acid assay. When the carbohydrate is treated with strong acid, the hydroxyl group of the carbohydrate would be combined with the phenol and give an orange color. Whereby, the colorimetric method could be utilized to determine the polysaccharides concentration. (4) Example The microorganism of Aureobasidium pullulans (BCRC number: 930184), the microorganism of Ganoderma lucidum, the microorganism of Trametes versicolor, the fruiting body of Tremella fuciformis Berk, the fruiting body of Auricularia auricula-judae, the fruiting body of Hericium erinaceus, and the fruiting body of Ganoderma lucidum are utilized to respectively produce the polysaccharides extracts according to the aforementioned steps, and the polysaccharides extracts are mixed together to produce the Ganoderma lucidum polysaccharides composite composition of the present invention. The Ganoderma lucidum polysaccharides composite composition comprises the ingredients listed below: Polysaccharides Ingredient By weight % concentration (g/L) β-glucan extract 3.0 10 Ganoderma lucidum 3.0 5 mycelium extract Trametes versicolor mycelium extract 2.5 5 Tremella fuciformis Berk extract 3.0 10 Auricularia auricula-judae extract 2.5 10 Hericium erinaceus extract 0.5 5 Ganoderma lucidum 0.2 5 fruiting body extract citric acid 0.13 — acesulfame potassium 0.035 — orange juice concentrate 3.4 — water 81.735 — Referring to the list, the Ganoderma lucidum polysaccharides composite composition of the present invention further comprises a flavor modulator such as citric acid for example, a sweetener such as acesulfame potassium (Ace-K) for example, and a juice concentrate such as orange juice concentrate for example. The Ganoderma lucidum polysaccharides composite composition of the present invention comprises, based on a total composition, 3 wt. % β-glucan extract, 3 wt. % Ganoderma lucidum mycelium extract, 2.5 wt. % Trametes versicolor mycelium extract, 3 wt. % Tremella fuciformis Berk extract, 2.5 wt. % Auricularia auricula-judae extract, 0.5 wt. % Hericium erinaceus extract, 0.2 wt. % Ganoderma lucidum fruiting body extract, 0.13 wt. % citric acid, 0.035 wt. % acesulfame potassium, 3.4 wt. % orange juice concentrate, and 81.735 wt. % water. Animal experiments are performed to assess the specific and non-specific immunomodulatory effects and the effect of the Ganoderma lucidum polysaccharides composite composition. The term “test article” may be used hereinafter to refer to the Ganoderma lucidum polysaccharides composite composition. (1) Specific Immunomodulatory Effects 1.1 Group Designation and Administration Dose for Mice Female BALB/c mice at 7 weeks old were selected for the animal experiments. As shown in TABLE 1, the mice were divided into 5 groups including negative control group, low dose group, middle dose group, high dose group, and normal control group. Each group had 10 mice. Negative control group mice and normal control group mice were administered sterile water; low dose group mice were administered one fold the recommended human dose of test article; middle dose group mice were administered two fold the recommended human dose of test article, and high dose group mice were administered four fold the recommended human dose of test article. The recommended human dose of the test article was 180 mL/day, and the dose conversion from human to mouse was calculated based on the guidance of the US Food and Drug Administration in 2005, wherein the conversion factor for mouse is 12.3. After freeze-drying, the test article was prepared in sterile water and administered to mice by oral gavage. Mice were administered the test article and negative control article (that is, sterile water) daily via oral gavage for 8 weeks. The administration volume was 10 mL/kg. TABLE 1 Group designation and administration dose for mouse Administration Lyophilized Human dose for mouse dosage dose (mL/kg (g/kg No. of Group Testing sample (Fold) bw/day) bw/day) mice OVA Negative Sterile water — — — 10 + control (NC) Low dose Ganoderma 180 36.9 0.9 10 + (TA-L) lucidum mL/day polysaccharides (1X) composite composition Middle Ganoderma 360 73.8 1.8 10 + dose lucidum mL/day (TA-M) polysaccharides (2X) composite composition High Ganoderma 720 147.6  3.7 10 + dose lucidum mL/day (TA-H) polysaccharides (4X) composite composition Normal Sterile water — — — 10 — control (Bln) “OVA+” mice were immunized with ovalbumin “OVA—” mice were not immunized with ovalbumin Dose of human/60(60 kg adult) × 12.3(conversion factor for mouse) = Dose of mouse(kg b.w./day). 1.2 Immunization Mice were immunized with ovalbumin (OVA) at Week 4 after administration of the test article. Mice were injected intraperitoneally with 100 μL (25 μg) emulsified in the complete Freund's adjuvant (CFA, Sigma-Aldrich, Cat. no. F5881). Two weeks after the first immunization, mice were given a second intraperitoneal injection of 100 μL OVA (25 μg) emulsified with the incomplete Freund's adjuvant (IFA, Sigma-Aldrich, Cat. no. F5506) at a ratio of 1:1 in order to enhance the OVA-specific immune responses. Mice were sacrificed at the end of study, and whole blood samples and spleens were collected and analyzed for immune cell proliferation, cytokines levels, cell surface markers, and serum immunoglobulins. 1.3 Clinical Observations During the study period, no clinical signs of illness were observed, including weight loss, hunched back, bleeding lesions, nasal/ocular discharge, hair loss, etc. The mean of body weight at the beginning of the study was 17.3-17.8 g, and the average weight of each group at the end of study was 20.1-20.7 g. The growth rate of experimental animals from each group was about the same. The mean body weight and spleen-to-body weight ratio were not statistically significant among the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H, as shown in TABLE 2 and FIG. 1. TABLE 2 Body weight changes and spleen-to-body weight ratios Group Week NC TA-L TA-M TA-H Bln Body weight (g) Week 1 17.5 ± 0.6 17.8 ± 0.8 17.5 ± 0.9 17.3 ± 0.8 17.6 ± 0.8 Week 2 18.1 ± 0.4 17.9 ± 0.5 17.7 ± 0.8 17.6 ± 0.7 17.9 ± 0.7 Week 3 18.5 ± 0.5 18.4 ± 0.7 18.1 ± 0.5 18.1 ± 0.7 18.5 ± 0.6 Week 4 18.9 ± 0.7 18.7 ± 0.9 18.5 ± 0.6 18.3 ± 0.8 19.0 ± 0.6 Week 5 19.2 ± 0.7 19.2 ± 0.7 18.7 ± 0.4 18.9 ± 0.8 19.5 ± 0.7 Week 6 19.6 ± 0.4 19.4 ± 0.7 19.1 ± 0.5 19.2 ± 0.9 19.9 ± 0.5 Week 7 19.9 ± 0.4 20.0 ± 0.8 19.3 ± 0.4 19.5 ± 0.9 20.3 ± 0.5 Week 8 20.3 ± 0.3 20.7 ± 0.9 20.2 ± 0.5 20.1 ± 0.8 20.7 ± 0.7 Spleen-to-body weight ratio (%)  0.888 ± 0.191  0.839 ± 0.152  0.868 ± 0.119  0.887 ± 0.205  0.410 ± 0.028 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. Spleen-to-body weight ratio = [spleen weight (g)/body weight (g)] × 100. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose; Bln(blank control) = normal control, without OVA immunization. 1.4 Proliferative Responses of Splenocytes Splenocytes isolated from the spleens were seeded in a 96-well plate at density of 1.0×105 cells/well and treated with OVA for 72 hours. Cell proliferation was measured by OD490nm using the CellTiter 96® AQueous One Solution Cell Proliferation Assay (Promega, Cat. no. G3580). Results were expressed as stimulation index (S.I.), and the formula for calculating S.I. is shown below: As shown in TABLE 3 and FIG. 2, the proliferative responses to OVA stimulation in the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H were significantly increased as compared to the Bln group (p<0.05). Among the OVA-sensitized groups, the proliferative responses induced by OVA were significantly enhanced in the TA-L, TA-M, and TA-H groups in comparison with the NC group (p<0.05). The result indicated that the test article promotes the proliferation of splenocytes stimulated by OVA. TABLE 3 Proliferative responses of mouse splenocytes Dose Stimulation index(S.I.) Group (g/kg/day) OVA(25 μg/mL) NC — 2.16 ± 0.40 TA-L 0.9 2.47 ± 0.30 TA-M 1.8 2.65 ± 0.25 TA-H 3.7 3.03 ± 0.31 Bln — 1.02 ± 0.15 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose; Bln(blank control) = normal control, without OVA immunization. Stimulation index (S.I.) = OD490 nm of OVA-stimulated cells/OD490 nm of unstimulated cells. 1.5 Splenocyte Cytokine Production Splenocytes (0.5 to 2×106 cells/well) were treated with 25 μg/mL OVA in a 24-well plate. After incubation at 37° C., 5% CO2 for 48 to 72 hours, cell-free supernatants were collected after centrifugation (300 g, 4° C., 10 minutes), and cytokines including Interleukin-2 (IL-2, eBioscience, Cat. no. 88-7024), Interleukin-4 (IL-4, eBioscience, Cat. no. 88-7044), Interleukin-5 (IL-5, eBioscience, Cat. no. 88-7054), Interleukin-10 (IL-10, eBioscience, Cat. no. 88-7104), Interferon γ (IFN-γ, eBioscience, Cat. no. 88-7314) were measured by ELISA assay kit after 72 hours OVA stimulation. In addition, Tumor necrosis factor-α(TNF-α, eBioscience, Cat. no. 88-7324) was measured after 48 hours OVA stimulation. 1.5.1 IL-2 As shown in TABLE 4 and FIGS. 3 and 4, there were no significant differences in basal levels (without OVA stimulation) of IL-2 release among all groups (p>0.05). The IL-2 level was significantly increased in the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H as compared to the Bln group (p<0.05), and thus an OVA-sensitization model used in this study was successfully established. After OVA stimulation, the IL-2 level was significantly increased in the TA-L, TA-M, and TA-H groups as compared to the NC group (p<0.05). The result indicated that the test article promotes OVA-induced IL-2 secretion. TABLE 4 Cytokines production Unstimulated basal Group level OVA(25 μg/mL) IL-2(pg/mL) NC 28.4 ± 4.4 429.1 ± 66.7 TA-L 27.2 ± 5.7 590.4 ± 97.8 TA-M 28.8 ± 5.0  683.3 ± 160.8 TA-H 27.7 ± 4.5  771.3 ± 146.4 Bln 23.3 ± 2.6  96.7 ± 13.7 IL-4(pg/mL) NC 31.3 ± 2.4 103.1 ± 16.4 TA-L 31.3 ± 4.7 104.7 ± 19.7 TA-M 32.5 ± 1.8 104.4 ± 24.6 TA-H 33.1 ± 4.7 102.4 ± 21.0 Bln 29.3 ± 1.3  59.3 ± 11.9 IL-5(pg/mL) NC 21.8 ± 2.1 90.0 ± 8.9 TA-L 22.7 ± 1.5  87.1 ± 14.6 TA-M 20.6 ± 2.6 87.4 ± 8.7 TA-H 20.9 ± 3.2  80.7 ± 11.6 Bln 19.3 ± 3.4 42.5 ± 2.8 IL-10(pg/mL) NC 213.6 ± 19.0 1251.1 ± 140.5 TA-L 202.5 ± 17.2 1195.6 ± 195.7 TA-M 211.6 ± 17.9 1178.9 ± 188.1 TA-H 213.3 ± 15.7 1156.7 ± 178.8 Bln 196.9 ± 5.2  355.6 ± 43.8 TNF-α NC 22.9 ± 5.6 243.2 ± 29.8 TA-L 21.8 ± 6.2 245.2 ± 25.5 TA-M 21.2 ± 3.5 264.0 ± 32.3 TA-H 23.0 ± 3.3 273.7 ± 36.4 Bln 17.6 ± 2.6 77.3 ± 7.9 IFN-γ NC  63.9 ± 16.6 1651.6 ± 349.7 TA-L 63.5 ± 9.4 2477.1 ± 403.7 TA-M  63.7 ± 12.8 2986.9 ± 518.9 TA-H  65.4 ± 11.8 3423.3 ± 517.4 Bln  58.3 ± 12.2 482.7 ± 73.5 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose; Bln(blank control) = normal control, without OVA immunization. 1.5.2 IL-4 Further referring to TABLE 4, there were no significant differences in basal levels (without OVA stimulation) of IL-4 release among all groups (p>0.05). The IL-4 level was significantly increased in the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H as compared to the Bln group (p<0.05), and thus an OVA-sensitization model used in this study was successfully established. After OVA stimulation, there were no significant differences in IL-4 level among the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H (p>0.05). 1.5.3 IL-5 Further referring to TABLE 4, there were no significant differences in basal levels (without OVA stimulation) of IL-5 release among all groups (p>0.05). The IL-5 level was significantly increased in the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H as compared to the Bln group (p<0.05), and thus an OVA-sensitization model used in this study was successfully established. After OVA stimulation, there were no significant differences in IL-5 level among the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H (p>0.05). 1.5.4 IL-10 Further referring to TABLE 4, there were no significant differences in basal levels (without OVA stimulation) of IL-10 release among all groups (p>0.05). The IL-10 level was significantly increased in the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H as compared to the Bln group (p<0.05), and thus an OVA-sensitization model used in this study was successfully established. After OVA stimulation, there were no significant differences in IL-10 level among the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H (p>0.05). 1.5.5 TNF-α Further referring to TABLE 4 and FIGS. 3 and 5, there were no significant differences in basal levels (without OVA stimulation) of TNF-α release among all groups (p>0.05). The TNF-α level was significantly increased in the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H as compared to the Bln group (p<0.05), and thus an OVA-sensitization model used in this study was successfully established. After OVA stimulation, TNF-α level was increased in a dose-dependent manner, and a significant difference was found in the TA-H group as compared to the NC group (p<0.05). 1.5.6 IFN-γ Further referring to TABLE 4 and FIGS. 3 and 6, there were no significant differences in basal levels (without OVA stimulation) of IFN-γ release among all groups (p>0.05). IFN-γ level was significantly increased in the OVA-sensitized groups including NC, TA-L, TA-M, and TA-H as compared to the Bln group (p<0.05), and thus an OVA-sensitization model used in this study was successfully established. After OVA stimulation, the IFN-γ level was significantly increased in the TA-L, TA-M, and TA-H groups as compared to the NC group (p<0.05). The result indicated that the test article promotes OVA-induced IFN-γ secretion. 1.6 Serum Levels of Immunoglobulins Serum samples were collected after the whole blood sample was centrifugated, and stored at −80° C. for further analysis for anti-OVA IgG2a, anti-OVA IgG1, and anti-OVA IgE antibodies detected by an indirect ELISA. Briefly, 96-well plates were coated with OVA at 4° C. for 24 hours. After washing, serum samples were added to triplicate wells. The plates were incubated at 37° C. for 1 hour, and then washed with phosphate buffered saline with Tween 20 (PBST). After incubation with secondary antibody conjugated with horseradish peroxidase (HRP), substrate 3,3′,5,5′-tetramethylbenzidine (TMB) (SureBlue Reserve TMB Microwell Peroxidase Substrate) was added to each well after washing with PBST. Optical density (OD) was detected at 450 nm with ELISA reader. Levels of OVA-specific antibodies were expressed as ELISA unit (EU) and calculated as follows: ELISA Unit (EU)=(A sample −A blank)/(A positive −A blank) As shown in TABLE 5 and FIG. 7, serum levels of anti-OVA IgG2a, anti-OVA IgG1, and anti-OVA IgE antibodies in all OVA-sensitized groups including NC, TA-L, TA-M, and TA-H were significantly increased (p<0.05) as compared to the Bln group (without OVA stimulation), and thus an OVA-sensitization model used in this study was successfully established. Anti-OVA IgG2a antibodies were significantly increased in the TA-L, TA-M, and TA-H groups as compared to the NC group (p<0.05). The result indicated that the test article promotes the production of anti-OVA IgG2a antibodies in OVA-sensitized mice. TABLE 5 OVA-specific antibody levels OVA-specific antibody (ELISA unit, EU) Group anti-OVA IgG1 anti-OVA IgG2a anti-OVA IgE NC 2.09 ± 0.09 2.77 ± 0.67 0.07 ± 0.03 TA-L 2.10 ± 0.08 3.62 ± 0.57 0.06 ± 0.02 TA-M 2.08 ± 0.07 4.25 ± 0.42 0.06 ± 0.01 TA-H 2.01 ± 0.15 4.76 ± 0.85 0.05 ± 0.02 Bln 0.03 ± 0.01 0.05 ± 0.01 0.03 ± 0.01 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose; Bln(blank control) = normal control, without OVA immunization. 1.7 Cell Surface Marker Analysis Splenocytes (5×105 cells/well) were stained with fluorescence-conjugated monoclonal antibodies against T4 cells markers (CD4+/CD3+), T8 cells markers (CD8+/CD3+), T cells markers (CD3+/CD45+), B cells markers (CD19+/CD45+), and NK cells markers (PanNK+/CD45+). Different lymphocyte populations by cell surface markers were quantified by flow cytometry. As shown in TABLE 6, there were no significant differences among all groups. TABLE 6 Cell surface marker analysis Immune cell type (%) T4 cell T8 cell Tcell Group (CD4+, CD3+) (CD8+, CD3+) (CD3+, CD45+) NC 23.40 ± 2.14 11.30 ± 1.83 36.29 ± 3.35 TA-L 21.83 ± 2.25 10.46 ± 2.59 35.74 ± 3.68 TA-M 23.66 ± 3.14 11.02 ± 2.69 35.67 ± 4.57 TA-H 23.85 ± 3.03 11.53 ± 1.35 38.29 ± 4.09 Bln 25.71 ± 2.94 11.56 ± 2.00 39.52 ± 2.98 Cell surface marker analysis Immune cell type (%) Bcell NK cell Group (CD19+, CD45+) (PanNK+, CD45+) NC 53.28 ± 3.22 6.94 ± 0.81 TA-L 53.91 ± 3.27 7.15 ± 0.83 TA-M 53.23 ± 4.35 7.00 ± 0.92 TA-H 52.13 ± 5.44 8.14 ± 1.41 Bln 50.84 ± 3.88 7.50 ± 0.86 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose; Bln(blank control) = normal control, without OVA immunization. With the aforementioned results, as shown in TABLE 7, the test article could promote OVA-induced lymphocyte proliferation and the production of anti-OVA IgG2a antibodies. In addition, after OVA stimulation, the test article could promote the production of IL-2, IFN-γ, and TNF-α. Whereby, the Ganoderma lucidum polysaccharides composite composition has the potential immunomodulatory effects on specific immunity TABLE 7 Summary of the immunomodulatory effects of the Ganoderma lucidum polysaccharides composite composition on the specific immunity Testing parameters TA-L TA-M TA-H Splenocyte proliferation OVA p < 0.05↑ p < 0.05↑ p < 0.05↑ stimu- lation Cytokines IL-2 Yes p < 0.05↑ p < 0.05↑ p < 0.05↑ production IL-4 Yes — — — IL-5 Yes — — — IL-10 Yes — — — TNF-α Yes — — p < 0.05↑ IFN-γ Yes p < 0.05↑ p < 0.05↑ p < 0.05↑ Spleen T4 cell — — — lymphocyte T8 cell — — — populations T cell — — — B cell — — — NK cell — — — Serum anti-OVA p < 0.05↑ p < 0.05↑ p < 0.05↑ antibody IgG2a anti-OVA — — — IgG1 anti-OVA — — — IgE —: no significant difference as compared to the NC group p < 0.05↑: significantly increased as compared to the NC group p < 0.05↓: significantly decreased as compared to the NC group (2) Non-Specific Immunomodulatory Effects 2.1 Group Designation and Administration Dose for Mice Female BALB/c mice at 7 weeks old were selected for the animal experiments. As shown in TABLE 8, the mice were divided into 4 groups including negative control group, low dose group, middle dose group, and high dose group. Each group had 10 mice. Negative control group mice were administered sterile water; low dose group mice were administered one fold the recommended human dose of test article; middle dose group mice were administered two fold the recommended human dose of test article, and high dose group mice were administered four fold the recommended human dose of test article. The recommended human dose of test article was 180 mL/day, and the dose conversion from human to mouse was calculated based on the guidance of the US Food and Drug Administration in 2005, wherein the conversion factor for mouse is 12.3. After freeze-drying, the test article was prepared in sterile water and administered to mice by oral gavage. Mice were administered the test article and negative control article (that is, sterile water) daily via oral gavage for 6 weeks. The administration volume was 10 mL/kg. TABLE 8 Group designation and administration dose for mouse Lyoph- Administration ilized Human dose for mouse dosage Testing dose (mL/kg (g/kg No. of Group sample (Fold) bw/day) bw/day) mice Negative Sterile water — — — 10 control (NC) Low dose Ganoderma 180 36.9 0.9 10 (TA-L) lucidum mL/day polysaccharides (1X) composite composition Middle Ganoderma 360 73.8 1.8 10 dose lucidum mL/day (TA-M) polysaccharides (2X) composite composition High Ganoderma 720 147.6 3.7 10 dose lucidum mL/day (TA-H) polysaccharides (4X) composite composition Dose Of human/60(60 kg adult) × 12.3(conversion factor for mouse) = Dose of mouse(kg b.w./day). 2.2 Test Sample Collections Mice were sacrificed at the end of study, and whole blood samples, spleens, and macrophages isolated from the abdominal cavity were collected and analyzed for immune cell proliferation, cytokines levels, cell surface markers, natural killer (NK) cell cytolytic activity, serum immunoglobulins, and phagocytic activity. 2.3 Clinical Observations During the study period, no clinical signs of illness were observed, including weight loss, hunched back, bleeding lesions, nasal/ocular discharge, hair loss, etc. The mean of body weight at the beginning of the study was 17.7-17.9 g, and the average weight of each group at the end of study was 19.8-20.6 g. The growth rate of experimental animals from each group was about the same (p>0.05). The mean body weight and spleen-to-body weight ratio were not statistically significant among all study groups, as shown in TABLE 9 and FIG. 8. TABLE 9 Body weight changes and spleen-to-body weight ratios Group Week NC TA-L TA-M TA-H Body weight (g) Week 17.7 ± 0.5 17.8 ± 0.7 17.8 ± 0.7 17.9 ± 0.8 1 Week 18.1 ± 1.1 17.9 ± 0.8 18.1 ± 0.8 18.2 ± 1.1 2 Week 18.9 ± 1.1 18.3 ± 0.7 18.5 ± 0.8 18.6 ± 1.1 3 Week 19.6 ± 1.1 19.0 ± 0.8 19.2 ± 1.0 19.1 ± 1.2 4 Week 20.0 ± 1.0 19.4 ± 0.9 19.5 ± 1.0 19.5 ± 1.2 5 Week 20.6 ± 0.9 19.8 ± 0.8 20.1 ± 1.0 20.2 ± 1.4 6 Spleen-to-body weight ratio (%)  0.448 ± 0.051  0.444 ± 0.046  0.462 ± 0.049  0.461 ± 0.040 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. Spleen-to-body weight ratio = [spleen weight (g)/body weight (g)] × 100. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose. 2.4 Proliferative Responses of Splenocytes Splenocytes (2.0×105 cells/well) isolated from the spleens were treated with mitogen Concanavalin A (Con A) and lipopolysaccharide (LPS) for 72 hours to stimulate T cells and B cells proliferation. Cell proliferation was measured by OD490nm using CellTiter 96® AQueous One Solution Cell Proliferation Assay (Promega, Cat. no. G3580). Results were expressed as stimulation index (S.I.), and the formula for calculating S.I. is shown below: As shown in TABLE 10 and FIG. 9, the proliferative responses to Con A stimulation in the TA-L, TA-M, and TA-H groups were significantly increased as compared to the NC group (p<0.05). In addition, only the TA-H group showed a significant increase in cell proliferation after LPS stimulation. The result indicated that the test article promotes the proliferation of splenocytes stimulated by Con A and LPS. TABLE 10 Proliferative responses of mouse splenocytes Stimulation index(S.I.) Dose Con A LPS Group (g/kg/day) (5.0 μg/mL) (10.0 μg/mL) NC — 2.53 ± 0.39 3.62 ± 0.78 TA-L 0.9 3.60 ± 0.95 4.02 ± 0.59 TA-M 1.8 4.33 ± 0.90 4.25 ± 0.69 TA-H 3.7 5.29 ± 1.66 4.76 ± 0.74 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose. 2.5 NK Cell Cytolytic Activity YAC-1 cells (mouse lymphoma cells) were used as target cells for mouse NK cells, and pre-labeled with PKH67 dye by using PKH67 Fluorescent Cell Linker Kits (Sigma-Aldrich). Splenocytes were incubated with PKH67-labeled NK-sensitive YAC-1 target cells at a ratio of 10:1 and 25:1 at 37° C. for 4 hours, and then treated with 50 μL Propidium iodine (PI) solution (0.1 mg/mL). NK cell-mediated cytotoxicity against pre-labeled YAC-1 cells was measured by flow cytometry following PI staining. As shown in TABLE 11 and FIG. 10, NK cell cytolytic activity was significantly induced in the TA-L, TA-M, and TA-H groups as compared to the NC group at the ratio of 10:1 and 25:1 (p<0.05). The result indicated that the splenic NK cell activity was significantly enhanced by the test article. TABLE 11 NK cell cytolytic activity Dose E/T ratio Group (g/kg/day) 10:1 25:1 NC — 14.7 ± 1.5 23.1 ± 1.5 TA-L 0.9 17.1 ± 1.6 26.5 ± 2.4 TA-M 1.8 19.6 ± 1.9 27.5 ± 2.3 TA-H 3.7 21.1 ± 2.2 30.2 ± 2.2 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose. E/T ratio = Effector cell (NKcell)/target cell (YAC-1 cell) ratio 2.6 Phagocytic Activity of Peritoneal Macrophages Macrophages isolated from the abdominal cavity of mice were incubated with fluorescein-labeled opsonized E. coli at 37° C. for 2 hours at multiplicity of infection (M.O.I.) of 12.5, 25, and 50. Phagocytosis was assessed by flow cytometry. As shown in TABLE 12 and FIG. 11, the phagocytic activity at M.O.I. of 12.5 was significantly enhanced in the TA-M and TA-H groups as compared to the NC group (p<0.05). In addition, a significant increase of the phagocytic activity of peritoneal macrophages was observed in the TA-L, TA-M, and TA-H groups as compared to the NC group at M.O.I. of 25 and 50 (p<0.05). The result indicated that the phagocytic activity was significantly enhanced by the test article. TABLE 12 Phagocytic activity of peritoneal macrophages Phagocytic activity (%) Dose M.O.I. Group (g/kg/day) 12.5 25 50 NC — 2.37 ± 1.17 6.09 ± 1.59 14.31 ± 3.89 TA-L 0.9 4.06 ± 1.42 15.15 ± 3.54 22.25 ± 3.22 TA-M 1.8 5.82 ± 1.86 17.04 ± 4.46 26.05 ± 5.68 TA-H 3.7 7.25 ± 2.86 19.25 ± 4.21 30.68 ± 5.24 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose. Phagocytic activity was indicated as the percentage of macrophages with phagocytized fluorescein-labeled E. coli. 2.7 Splenocyte Cytokine Production Splenocytes (0.5 to 1×106 cells/well) were treated with Con A and LPS. After incubation at 37° C. for 72 hours, cell-free supernatants were collected after centrifugation (300 g, 4° C., 10 minutes), and cytokines including IL-2 (eBioscience, Cat. no. 88-7024), IL-4 (eBioscience, Cat. no. 88-7044), IL-5 (eBioscience, Cat. no. 88-7054), IL-10 (eBioscience, Cat. no. 88-7104), IFN-γ (eBioscience, Cat. no. 88-7314) were measured by ELISA assay kit after 72 hours Con A and LPS stimulation. In addition, TNF-α (eBioscience, Cat. no. 88-7324) was measured after 48 hours Con A and LPS stimulation. 2.7.1 IL-2 As shown in TABLE 13 and FIGS. 12 to 14, there were no significant differences in basal levels (without mitogen stimulation) of IL-2 release among all groups (p>0.05). After Con A stimulation, the IL-2 level was significantly increased in the TA-L, TA-M, and TA-H groups as compared to the NC group (p<0.05). In addition, after LPS stimulation, the IL-2 level was significantly increased in the TA-H group as compared to the NC group (p<0.05). The result indicated that the test article promotes IL-2 secretion after mitogen stimulation. TABLE 13 Cytokines production Unstimulated basal Mitogen stimulation Group level Con A(5 μg/mL) LPS(10 μg/mL) IL-2(pg/mL) NC 26.3 ± 3.3 640.7 ± 83.1 58.3 ± 7.1 TA-L 27.3 ± 5.0 1015.9 ± 156.4 61.5 ± 8.0 TA-M 26.4 ± 4.3 1463.7 ± 499.6  65.1 ± 15.0 TA-H 26.5 ± 4.2 1846.3 ± 566.4  89.4 ± 14.0 IL-4(pg/mL) NC 22.8 ± 3.6 271.1 ± 87.9  88.2 ± 25.5 TA-L 22.7 ± 2.8 247.9 ± 75.9  78.6 ± 23.2 TA-M 23.3 ± 4.0 232.3 ± 63.3  74.1 ± 18.9 TA-H 23.1 ± 3.8 222.9 ± 57.6  67.6 ± 17.8 IL-5(pg/mL) NC 14.0 ± 1.3 206.6 ± 37.7 39.6 ± 7.3 TA-L 14.4 ± 1.9 206.8 ± 44.4 39.4 ± 8.0 TA-M 13.9 ± 1.1 200.1 ± 33.3 33.7 ± 3.9 TA-H 14.6 ± 1.8 198.2 ± 39.6 34.7 ± 4.6 IL-10(pg/mL) NC 133.3 ± 20.2 2291.4 ± 188.0 356.6 ± 36.1 TA-L 133.8 ± 20.1 2114.3 ± 437.6 345.2 ± 85.0 TA-M 133.8 ± 18.5 2100.0 ± 386.9 342.9 ± 73.9 TA-H 135.8 ± 22.7 2020.0 ± 283.5 337.2 ± 47.0 TNF-α(pg/mL) NC  8.6 ± 2.5 253.5 ± 31.6 361.4 ± 63.4 TA-L  7.8 ± 1.8 261.0 ± 50.4 392.5 ± 59.0 TA-M  8.6 ± 2.0 267.0 ± 45.2 407.0 ± 65.4 TA-H  8.7 ± 2.1 277.7 ± 41.2 429.4 ± 56.4 IFN-γ(pg/mL) NC 35.8 ± 8.1 12648.6 ± 2323.4  2796.5 ± 1096.7 TA-L  36.9 ± 10.4 20041.4 ± 4689.3  2816.5 ± 1177.3 TA-M  36.4 ± 10.1 25768.6 ± 3434.9  3177.6 ± 1024.5 TA-H 35.5 ± 6.5 27848.6 ± 4467.0 3300.6 ± 842.5 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose. 2.7.2 IL-4 Further referring to TABLE 13, there were no significant differences in basal levels (without mitogen stimulation) of IL-4 release among all groups (p>0.05). After Con A and LPS stimulation, no significant differences were found among all groups for IL-4 levels (p>0.05). 2.7.3 IL-5 Further referring to TABLE 13, there were no significant differences in basal levels (without mitogen stimulation) of IL-5 release among all groups (p>0.05). After Con A and LPS stimulation, no significant differences were found among all groups for IL-5 levels (p>0.05). 2.7.4 IL-10 Further referring to TABLE 13, there were no significant differences in basal levels (without mitogen stimulation) of IL-10 release among all groups (p>0.05). After Con A and LPS stimulation, no significant differences were found among all groups for IL-10 levels (p>0.05). 2.7.5 TNF-α Further referring to TABLE 13, there were no significant differences in basal levels (without mitogen stimulation) of TNF-α release among all groups (p>0.05). After Con A and LPS stimulation, TNF-α level was increased in a dose-dependent manner, but no significant differences were found among all groups (p>0.05). 2.7.6 IFN-γ As shown in TABLE 13 and FIGS. 12 and 15-16, there were no significant differences in basal levels (without mitogen stimulation) of IFN-γ release among all groups (p>0.05). After Con A stimulation, IFN-γ level in the TA-L, TA-M, and TA-H groups was significantly increased as compared to the NC group (p<0.05). In addition, IFN-γ level was increased in a dose-dependent manner, but no significant differences were found among all groups (p>0.05). 2.8 Serum Levels of Immunoglobulins After the whole blood samples were centrifugated at 2200 g for 15 minutes, serum samples were collected for further analysis for serum immunoglobulins using mouse IgM, IgE, IgA, and IgG ELISA Quantitation Set (Bethyl Laboratories, Cat. no. E90-101, E90-103, E90-115, and E90-131). As shown in TABLE 14, there were no significant differences among all groups for IgM, IgE, IgA, and IgG levels (p>0.05). TABLE 14 Serum immunoglobulins levels Serum antibody (μg/mL) Group IgG IgM IgA IgE NC 3609.7 ± 207.1 312.4 ± 32.9 253.2 ± 40.9 0.26 ± 0.10 TA-L 3670.5 ± 206.2 315.5 ± 26.3 253.8 ± 43.0 0.26 ± 0.11 TA-M 3629.5 ± 194.6 317.1 ± 52.1 262.4 ± 25.1 0.23 ± 0.09 TA-H 3783.7 ± 276.0 314.3 ± 36.5 272.4 ± 60.6 0.27 ± 0.14 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose. 2.9 Cell Surface Marker Analysis Splenocytes (5×105 cells/well) were stained with fluorescence-conjugated monoclonal antibodies against T4 cells markers (CD4+/CD3+), T8 cells markers (CD8+/CD3+), T cells markers (CD3+/CD45+), B cells markers (CD19+/CD45+), and NK cells markers (PanNK+/CD45+). Different lymphocyte populations by cell surface markers were quantified by flow cytometry. As shown in TABLE 15, there were no significant differences among all groups. TABLE 15 Cell surface marker analysis Immune cell type (%) T4 cell T8 cell B cell Group (CD4+, CD3+) (CD8+, CD3+) (CD19+, CD45+) NC 30.0 ± 1.7 12.5 ± 1.7 47.4 ± 1.8 TA-L 31.7 ± 3.5 12.6 ± 1.5 48.2 ± 2.7 TA-M 31.6 ± 1.8 12.1 ± 1.4 47.2 ± 3.3 TA-H 31.3 ± 2.8 12.9 ± 1.8 48.8 ± 2.7 Cell surface marker analysis Immune cell type (%) T cell NK cell Group (CD3+, CD45+) (PanNK+, CD45+) NC 42.1 ± 3.5 7.5 ± 0.9 TA-L 43.9 ± 4.7 7.2 ± 0.8 TA-M 44.5 ± 3.3 7.3 ± 1.1 TA-H 42.9 ± 4.5 7.7 ± 0.9 Data were expressed as mean ± standard deviation (S.D.) of 10 mice, and analyzed using one-way ANOVA followed by Duncan's multiple range test. NC = negative control; TA-L = test article low dose; TA-M = test article middle dose; TA-H = test article high dose. With the aforementioned results, as shown in TABLE 16, the test article could promote the proliferative response of splenic lymphocytes, the phagocytic activity of peritoneal macrophages, and the cytolytic activity of NK cells. In addition, after mitogen stimulation, the test article could promote the production of IL-2 and IFN-γ. Whereby, the Ganoderma lucidum polysaccharides composite composition has the potential immunomodulatory effects on non-specific immunity. TABLE 16 Summary of the immunomodulatory effects of the Ganoderma lucidum polysaccharides composite composition on the non-specific immunity Testing parameters TA-L TA-M TA-H Splenocyte proliferation Con A p < 0.05↑ p < 0.05↑ p < 0.05↑ LPS — — p < 0.05↑ Cytokines IL-2 Con A p < 0.05↑ p < 0.05↑ p < 0.05↑ production LPS — — p < 0.05↑ IL-4 Con A — — — LPS — — — IL-5 Con A — — — LPS — — — IL-10 Con A — — — LPS — — — TNF-α Con A — — — LPS — — — IFN-γ Con A p < 0.05↑ p < 0.05↑ p < 0.05↑ LPS — — — Spleen T4 cell — — — lymphocyte T8 cell — — — populations T cell — — — B cell — — — NK cell — — — Serum IgG — — — antibody IgM — — — IgA — — — IgE — — — NK cell E/T ratio = p < 0.05↑ p < 0.05↑ p < 0.05↑ activity 10:1 E/T ratio = p < 0.05↑ p < 0.05↑ p < 0.05↑ 25:1 Phagocytic M.O.I. = — p < 0.05↑ p < 0.05↑ activity 12.5 M.O.I. = 25 p < 0.05↑ p < 0.05↑ p < 0.05↑ M.O.I. = 50 p < 0.05↑ p < 0.05↑ p < 0.05↑ —: no significant difference as compared to the NC group p < 0.05↑: significantly increased as compared to the NC group p < 0.05↑: significantly decreased as compared to the NC group With the aforementioned results, the Ganoderma lucidum polysaccharides composite composition has the potential immunomodulatory effects on the specific and non-specific immunity. It must be pointed out that the embodiments described above are only some embodiments of the present invention. All equivalent structures which employ the concepts disclosed in this specification and the appended claims should fall within the scope of the present invention. What is claimed is: 1. A Ganoderma lucidum polysaccharides composite composition comprising, based on a total composition: 1 to 5 wt. % β-glucan extract, 1 to 5 wt. % Ganoderma lucidum mycelium extract, 1 to 5 wt. % Trametes versicolor mycelium extract, 1 to 5 wt. % Tremella fuciformis Berk extract, 1 to 5 wt. % Auricularia auricula-judae extract, 1 to 5 wt. % Hericium erinaceus extract, 1 to 3 wt. % Ganoderma lucidum fruiting body extract, and water. 2. The Ganoderma lucidum polysaccharides composite composition of claim 1, wherein the β-glucan extract further comprises a β-glucan extract of Aureobasidium pullulans. 3. The Ganoderma lucidum polysaccharides composite composition of claim 1, further comprising a flavor modulator, wherein the flavor modulator comprises citric acid. 4. The Ganoderma lucidum polysaccharides composite composition of claim 1, further comprising a sweetener, wherein the sweetener comprises acesulfame potassium. 5. The Ganoderma lucidum polysaccharides composite composition of claim 1, further comprising a juice concentrate, wherein the juice concentrate comprises orange juice concentrate. 6. The Ganoderma lucidum polysaccharides composite composition of claim 1, wherein the composition is provided in a powder form, a beverage form, or an encapsulated form. 7. A method for producing a Ganoderma lucidum polysaccharides composite composition, comprising steps of: respectively mixing a fermented culture of Aureobasidium pullulans, a fermented culture of Ganoderma lucidum, a fermented culture of Trametes versicolor, a powdered fruiting body of Tremella fuciformis Berk, a powdered fruiting body of Auricularia auricula-judae, a powdered fruiting body of Hericium erinaceus, and a powdered fruiting body of Ganoderma lucidum with water in a ratio by weight of 10:1 to 40:1 for producing a mixture; stirring each of the mixtures at 70 to 100° C. for 2 to 6 hours; filtering each of the mixtures to remove solids; concentrating and heating each of the mixtures for sterilization for producing a β-glucan extract, a Ganoderma lucidum mycelium extract, a Trametes versicolor mycelium extract, a Tremella fuciformis Berk extract, a Auricularia auricula-judae extract, a Hericium erinaceus extract, and a Ganoderma lucidum fruiting body extract, respectively; and mixing the extracts together for producing the Ganoderma lucidum polysaccharides composite composition. 8. The method of claim 7, wherein the fermented culture of Aureobasidium pullulans, the fermented culture of Ganoderma lucidum, and the fermented culture of Trametes versicolor are produced by respectively culturing a microorganism of Aureobasidium pullulans, a microorganism of Ganoderma lucidum, and a microorganism of Trametes versicolor in a culture medium, wherein the culture medium has a pH of 5.0 to 6.5 and comprises, based on a total culture medium, 0.5 to 5.0 wt. % carbon source, 0.1 to 1.5 wt. % nitrogen source and trace elements; and each of the culture media is then incubated in air at 20 to 30° C. for 2 to 7 days with stirring for producing the fermented culture. 9. The method of claim 7, wherein the extracts are mixed together according to the following percentages: 3 wt. % β-glucan extract, 3 wt. % Ganoderma lucidum mycelium extract, 2.5 wt. % Trametes versicolor mycelium extract, 3 wt. % Tremella fuciformis Berk extract, 2.5 wt. % Auricularia auricula-judae extract, 0.5 wt. % Hericium erinaceus extract, and 0.2 wt. % Ganoderma lucidum fruiting body extract. 10. The method of claim 7, wherein polysaccharides concentration of the β-glucan extract is 10 g/L, polysaccharides concentration of the Ganoderma lucidum mycelium extract is 5 g/L, polysaccharides concentration of the Trametes versicolor mycelium extract is 5 g/L, polysaccharides concentration of the Tremella fuciformis Berk extract is 10 g/L, polysaccharides concentration of the Auricularia auricula-judae extract is 10 g/L, polysaccharides concentration of the Hericium erinaceus extract is 5 g/L, and polysaccharides concentration of the Ganoderma lucidum fruiting body extract is 5 g/L.

2018-10-12

en

2020-01-23

US-201213626767-A

Signaling three-dimensional video information in communication networks ABSTRACT Embodiments of the present disclosure describe devices, methods, computer-readable media and systems configurations for signaling stereoscopic three-dimensional video content capabilities of a device in a communications network. Other embodiments may be described and claimed. CROSS REFERENCE TO RELATED APPLICATIONS The present application claims priority to U.S. Provisional Patent Application No. 61/621,939, filed Apr. 9, 2012, entitled “ADVANCED WIRELESS COMMUNICATION SYSTEMS AND TECHNIQUES” and U.S. Provisional Patent Application No. 61/679,627 filed Aug. 3, 2012, entitled “ADVANCED WIRELESS COMMUNICATION SYSTEMS AND TECHNIQUES,” the entire disclosures of which are hereby incorporated by reference. FIELD Embodiments of the present invention relate generally to the field of communications, and more particularly, to signaling three-dimensional video information in communication networks. BACKGROUND Three-dimensional (3-D) video offers a high-quality and immersive multimedia experience, which has only recently become feasible on consumer electronics and mobile platforms through advances in display technology, signal processing, transmission technology, and circuit design. It is currently being introduced to the home through various channels, including by Blu-ray Disc™, cable and satellite transmission, etc., as well as to mobile networks through 3-D enabled smartphones, etc. Concepts related to delivery of such content through wireless networks are being developed. BRIEF DESCRIPTION OF THE DRAWINGS Embodiments will be readily understood by the following detailed description in conjunction with the accompanying drawings. To facilitate this description, like reference numerals designate like structural elements. Embodiments are illustrated by way of example and not by way of limitation in the figures of the accompanying drawings. FIG. 1 schematically illustrates a wireless communication network in accordance with various embodiments. FIGS. 2 a-b illustrate adaptation of streamed content and/or associated session description and metadata files in accordance with various embodiments. FIG. 3 illustrates a setup of a streaming session in accordance with an embodiment. FIG. 4 illustrates frame compatible packing formats in accordance with various embodiments. FIG. 5 illustrates a method of signaling 3-D video device capabilities in accordance with various embodiments. FIG. 6 illustrates a method of signaling 3-D video content in accordance with various embodiments. FIG. 7 schematically depicts an example system in accordance with various embodiments. DETAILED DESCRIPTION Illustrative embodiments of the present disclosure include, but are not limited to, methods, systems, computer-readable media, and apparatuses for signaling stereoscopic three-dimensional video content capabilities of a client device in a communication network. Some embodiments of this invention in this context could be on methods, systems, computer-readable media, and apparatuses for signaling stereoscopic three-dimensional video content capabilities of a mobile device in a wireless communications network. Various aspects of the illustrative embodiments will be described using terms commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art. However, it will be apparent to those skilled in the art that alternate embodiments may be practiced with only some of the described aspects. For purposes of explanation, specific numbers, materials, and configurations are set forth in order to provide a thorough understanding of the illustrative embodiments. However, it will be apparent to one skilled in the art that alternate embodiments may be practiced without the specific details. In other instances, well-known features are omitted or simplified in order not to obscure the illustrative embodiments. Further, various operations will be described as multiple discrete operations, in turn, in a manner that is most helpful in understanding the illustrative embodiments; however, the order of description should not be construed as to imply that these operations are necessarily order dependent. In particular, these operations need not be performed in the order of presentation. The phrase “in some embodiments” is used repeatedly. The phrase generally does not refer to the same embodiments; however, it may. The terms “comprising,” “having,” and “including” are synonymous, unless the context dictates otherwise. The phrase “A and/or B” means (A), (B), or (A and B). The phrases “A/B” and “A or B” mean (A), (B), or (A and B), similar to the phrase “A and/or B”. The phrase “at least one of A, B and C” means (A), (B), (C), (A and B), (A and C), (B and C) or (A, B and C). The phrase “(A) B” means (B) or (A and B), that is, A is optional. Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that a wide variety of alternate and/or equivalent implementations may be substituted for the specific embodiments shown and described, without departing from the scope of the embodiments of the present disclosure. This application is intended to cover any adaptations or variations of the embodiments discussed herein. Therefore, it is manifestly intended that the embodiments of the present disclosure be limited only by the claims and the equivalents thereof. As used herein, the term “module” may refer to, be part of, or include an Application Specific Integrated Circuit (ASIC), an electronic circuit, a processor (shared, dedicated, or group) and/or memory (shared, dedicated, or group) that execute one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality Significant improvements in video compression capability have been demonstrated with the introduction of the H.264/MPEG-4 advanced video coding (AVC) standard. Since developing the standard, the joint video team of the ITU-T Video Coding Experts Group (VCEG) and the International Organization for Standardization (ISO)/International Electrotechnical Commission (IEC) Moving Picture Experts Group (MPEG) has also standardized an extension of AVC that is referred to as multiview video coding (MVC). MVC provides a compact representation for multiple views of the video scene, such as multiple synchronized video cameras. In stereoscopic 3-D video applications, two views are displayed. One for the left eye and one for the right eye. There are various ways of formatting the views of stereoscopic 3-D video content. In one embodiment, the encoding of stereo-paired 3-D video may be a special case of MVC, where left and right eye views are produced via MVC. Other encoding formats of producing 3-D video content are also possible. Various devices may have different capabilities with respect to decoding and rendering these different formats. Embodiments described herein provide for various parameters of a device capability exchange that may facilitate delivery and viewing of the 3-D video content in a communication network such as a wireless network, e.g., an evolved universal terrestrial radio access network (EUTRAN). FIG. 1 schematically illustrates a network environment 100 in accordance with various embodiments. The network environment 100 includes a user equipment (UE) 104, which may also be referred to as a client terminal or mobile device, wirelessly coupled with a radio access network (RAN) 108. The RAN 108 may include an enhanced node base station (eNB) 112 configured to communicate with the UE 104 via an over-the-air (OTA) interface. The RAN 108 may be part of a third generation partnership project (3GPP) long-term evolution (LTE) advanced network and may be referred to as an EUTRAN. In other embodiments, other radio access network technologies may be utilized. The UE 104 may communicate with a remote media server 116 through the RAN 108. While the eNB 112 is shown communicating directly with the media server, it will be understood that the communications may flow through a number of intermediate networking components, e.g., switches, routers, gateways, etc., in various embodiments. For example, in some embodiments, the RAN 108 may be coupled with a core services network (CSN) that communicatively couples the RAN 108 with a larger network, e.g., a wide area network, of which the media server 116 may be considered a part. While FIG. 1 describes the network environment as a wireless communication network, other embodiments may be used in other types of networks, e.g., wire-line networks. It may be understood that other network environments in which embodiments of the present invention may be employed may include additional, fewer, or different components than those explicitly shown in the example depicted in FIG. 1. For example, embodiments of the present invention employed in a wire-line network, may have the media server 116 and the UE 104 communicating with one another without the RAN 108. The UE 104 and media server 116 may have a number of components that are configured to facilitate access, storage, transmission, and display of 3-D video content. For example, the UE 104 may include a content management module 120, a media player 124 having a streaming application 126, and a display 128. The streaming application 126 may have sufficient functionality to receive 3-D video content and associated information; decode, unpack, and otherwise re-assemble the 3-D video; and render the 3-D video on the display 128. In various embodiments, the streaming application 126 may be referred to in the context of the streaming technology employed. For example, in embodiments in which the content is streamed by a packet-switched streaming service (PSS), the streaming application 126 may be referred to as a PSS application. The content management module 120 may negotiate or otherwise communicate streaming parameters including, e.g., device capability parameters, to enable receipt of the data in manner that facilitates operation of the media player 124. The media server 116 may include content delivery module 132 having a streaming application 134, a content management module 136, and a content storage 140. The content delivery module 132 may encode, pack, or otherwise assemble 3-D video content, stored in the content storage 140, for transmission to one or more UEs, e.g., UE 104. The content management module 136 may negotiate or otherwise communicate streaming parameters including, e.g., device capability parameters, and control the content delivery module 132 in a manner to facilitate delivery of the 3-D content. In some embodiments, one or more of the components that are shown as being part of the media server 116 may be disposed separately from the media server 116 and communicatively coupled with the media server over a communication link. For example, in some embodiments, content storage 140 may be disposed remotely from the content delivery module 132 and the content management module 136. In some embodiments, the content delivery module 132 may deliver, through eNB 112 in one example, the 3-D video content to the UE 104 in accordance with a 3GPP streaming standard. For example, the 3-D video content may be transmitted in accordance with a PSS standard, e.g., 3GPP TS 26.234 V11.0.0 (Mar. 16, 2012), a dynamic adaptive streaming over HTTP (DASH) standard, e.g., 3GPP TS 26.247 V.11.0.0 (Mar. 16, 2012), a multimedia broadcast and multicast service (MBMS) standard, e.g., TS 26.346 V11.1.0 (Jun. 29, 2012), and/or an IMS-based PSS and MBMS services (IMS_PSS_MBMS) standard, e.g., TS 26.237 V.11.0.0 (Jun. 29, 2012). The streaming application 126 may be configured to receive the 3-D video content over any of a number of transport protocols, e.g., real-time transport protocol (RTP), hypertext transport protocol (HTTP), etc. Capability exchange enables media streaming servers, such as media server 116, to provide a wide range of devices with video content suitable for the particular device in question. To facilitate server-side content negotiation for streaming, the media server 116 may determine the specific capabilities of the UE 104. The content management module 120 and the content management module 136 may negotiate or otherwise communicate parameters of a 3-D video content streaming session. This negotiation may take place through session-level signaling via the RAN 108. In some embodiments, the session-level signaling may include transmissions related to device capability information that includes stereoscopic 3-D video decoding and rendering capabilities of the media player 124. In various embodiments, the device capability information may further include pre-decoder buffer size, initial buffering, decoder capability, display properties (screen size, resolution, bit depth, etc.), streaming method (real-time streaming protocol (RTSP), HTTP, etc.) adaptation support, quality of experience (QoE) support, extended real-time transport protocol (RTCP) reporting support, fast content switching support, supported RTP profiles, session description protocol (SDP) attributes, etc. During the setup of the streaming session, the content management module 136 may use the device capability information to control the content delivery module 132 in a manner to provide the UE 104 with the proper type of multimedia content. For example, the media server 116 may determine which variants of multiple available variants of a video stream are desired based on the actual capabilities of the UE 104 to determine the best-suited streams for that terminal. This may allow for improved delivery of 3-D video content and associated session description and metadata files, for example SDP file or a media presentation description (MPD) file, to the UE 104. The content delivery module 132 may access the content in the content storage 140 and adapt the content and/or associated session description and metadata files, e.g., SDP/MPD files, according to the negotiated session parameters prior to delivery of the content/associated files. The content, when delivered to the UE 104, may be decoded by the media player 124 and rendered on the display 128. Adaptation of content and/or associated session description and metadata files is shown in accordance with some specific examples with reference to FIGS. 2 a-b, while setup of streaming session is shown in accordance with a specific example with reference to FIG. 3. FIG. 2 a illustrates a DASH-based streaming embodiment with adaptation of 3-D video formats in accordance with some embodiments. In particular, FIG. 2 a illustrates an HTTP server 204 in communication with a DASH client 208 and implementing a pull-based streaming embodiment, in which the streaming control is maintained by the client rather than the server, where the client downloads content from the server through a series of HTTP-based request-response transactions after the inspection of the MPD. In DASH-based streaming, the MPD metadata file provides information on the structure and different versions of the media content representations stored in the HTTP server 204 (including different bitrates, frame rates, resolutions, codec types, etc.). Based on this MPD metadata information that describes the relation of the segments and how they form a media presentation, DASH client 208 may request the media segments using HTTP GET or partial GET methods. The HTTP server 204 and DASH client 208 may be similar to and substantially interchangeable with media server 116 and UE 104, respectively. In DASH, the set of 3-D video formats and corresponding content information may be signaled to the DASH client 208 in the MPD. Depending on the capability profile of the DASH client 208 and its supported 3-D formats, the HTTP server 204 may offer different formatted content, e.g., the HTTP server 204 may exclude the 3-D formats that are not supported by the DASH client 208 in the MPD and only include those that are supported by the DASH client 208. In this context, the HTTP server 204 may provide the content optimized for different 3-D video formats to the DASH client 208. In doing this, the HTTP server 204 may use the device capability exchange signaling from the DASH client 208 describing the various supported 3-D video formats. The DASH client 208 may then request the corresponding versions of the 3-D video content supported by the DASH client 208. Moreover, when retrieving an MPD with HTTP, the DASH client 208 may include 3-D video codec and format information in a GET request, including any temporary adjustments to the 3-D video formats based on profile difference (ProfDiff). In an example, the difference may be configured to temporarily modify one or more MPD parameters for a content presentation session. For example, the difference may be configured to modify the MPD until the content presentation session ends or a subsequent difference (corresponding to the first communicated difference) is communicated to the HTTP server 204. This way the HTTP server 204 may deliver an optimized MPD to the DASH client 208. FIG. 2 b illustrates an RTSP-based streaming embodiment with adaptation of 3-D video formats in accordance with some embodiments. In particular, FIG. 2 b illustrates a server 212 and a client 216 implementing a push-based streaming method, in which the streaming and session control are maintained by the server 212 rather than the client 216. The server 212 and client 216 may be similar to and substantially interchangeable with media server 116 and UE 104, respectively. Examples of push-based streaming include PSS and IMS_PSS_MBMS services based on the RTSP and session initiation protocol (SIP), respectively. In this context, the server 212 receives the set of supported 3-D video codecs and formats from the client 216 and adapts the content based on this information, e.g., the server 212 selects the most suited content version among stored content versions or dynamically transcodes the content based on the supported 3-D video formats and streams the content to the client 216. The session-related metadata carried in the SDP may carry the 3-D video format information for the streamed content. FIG. 3 illustrates a service discovery with subscribe/notify for IMS_PSS_MBMS service in accordance with some embodiments. In particular, FIG. 3 illustrates interactions between a UE 304, an IP Multimedia (IM) Core Network (CN) subsystem 308, and a service discovery function (SDF) 312. The UE 304 may be similar to and substantially interchangeable with UE 104. The IM CN subsystem 308 and the SDF 312 may be part of a core network domain that interfaces with the access network domain, e.g., the RAN 108. In the IMS_PSS_MBMS service, the UE 304 can send device capability information, e.g., supported 3-D video codecs and formats, in a SIP SUBSCRIBE message to the IM CN Subsystem 308 during service discovery. The IM CN subsystem 308 may then forward the message to the SDF 312. The SDF 312 determines the proper service discovery information, e.g. according to the capabilities of the UE 304 as described in the user's profile (Personalized Service Discovery). The SDF 312 may then send a SIP 200 OK message to the IM CN subsystem 308, which is relayed to the UE 304 to confirm the session initialization based on the sent device capability information that also includes the supported 3-D video codecs and formats. Afterward, the SDF 312 may send a SIP NOTIFY message, with service discovery information, to the IM CN subsystem 308, which relays the SIP NOTIFY message back to the UE 304. The UE 304 may then respond by sending a SIP 200 OK message to the IM CN subsystem 308, which is then relayed to the SDF 312. Such a framework enables optimized service discovery utilizing the supported 3-D video formats in IMS-based PSS and MBMS user services. Later during the IMS session, the UE 304 may also use SIP signaling to indicate updates including any temporary adjustments to the set of supported 3-D video codecs and formats based on ProfDiff (e.g., if the current device orientation is different from the default device orientation). This may be done by refreshing the subscription through further SIP SUBSCRIBE messages including information on the updates to the 3-D video format information. Referring again to FIG. 1, in some embodiments, the media server 116 may be coupled with a device profile server 144 that has profile information of the UE 104. The profile information may include some or all of the device capability information. In such embodiments, the media server 116 may receive identification information from the UE 104 and then retrieve the profile information from the device profile server 144. This may be done as part of the session-level signaling. In some embodiments, the UE 104 may supplement the profile information retrieved from the device profile server 144 with extra attributes or overrides for attributes already defined in its device capability profile, based on ProfDiff signaling. In one example, such a temporary adjustment may be triggered by user preferences, for example if the user for a particular session only would like to receive two-dimensional (2-D) video even though the terminal is capable of rendering 3-D video. The streaming application 134 may encode the 3-D video content for transmission in the network environment 100 in accordance with a number of different stream types, with each stream type having associated frame types. Frame types could include frame packing, simulcast, or 2-D plus auxiliary frame types. Frame packing may include frame-compatible packing formats and full-resolution per view (FRPV) packing format. In frame-compatible packet formats, the streaming application 134 may spatially pack constituent frames of a stereo pair into a single frame and encode the single frame. Output frames produced by the streaming application 126 contain constituent frames of a stereo pair. The spatial resolution of the original frames of each view and the packaged single frame may be the same. In this case, the streaming application 134 may down-sample the two constituent frames before the packing operation. The frame-compatible packing formats may use a vertical interleaving, horizontal interleaving, side-by-side, top-bottom, or checkerboard format as illustrated in FIGS. 4 a-e, respectively, and the down sampling may be performed accordingly. In some embodiments, the streaming application 134 may indicate the frame-packing format that was used by including one or more frame packing arrangement supplemental enhancement information (SEI) messages as specified in the H.264/AVC standard into the bitstream. The streaming application 126 may decode the frame, unpack the two constituent frames from the output frames of the decoder, up sample the frames to revert the encoder side down sampling process, and render the constituent frames on the display 128. A FRPV packing format may include temporal interleaving. In temporal interleaving, the 3-D video may be encoded at double the frame rate of the original video with each parent and subsequent pictures constituting a stereo pair (left and right view). The rendering of the time interleaved stereoscopic video may typically be performed at a high frame rate, where active (shutter) glasses are used to blend the incorrect view in each eye. This may rely on accurate synchronization between the glasses and the screen. In embodiments using simulcast frame types, the left and the right views may be transmitted in separate, simulcast streams. The separately transmitted streams may be combined by the streaming application 126 and jointly decoded. In embodiments using 2-D plus auxiliary frame types, 2-D video content may be sent by the streaming application 134 in conjunction with auxiliary information that may be used by the streaming application 126 to render 3-D video on the display 128. This auxiliary information may be, e.g., a depth/parallax map that is a 2-D map with each pixel defining a depth/parallax of one or more pixels in an associated 2-D video frame. In some embodiments, other frame types may be used. For example, in some embodiments the streaming application 134 may be capable of encoding stereoscopic views into a base view stream and a non-base view stream, which may be transmitted in the same or different streams. In some embodiments, this may be referred to as MVC-based for stereoscopic video. The non-base view stream may include inter-view prediction frames that provide spatial/temporal predictive information. The base view stream may be sufficient for a single-view, e.g., 2-D, decoder to render the base view as 2-D video, while the non-base view stream may provide 3-D decoders, e.g., streaming application 126, with sufficient information to render 3-D video. If the media server 116 is aware of UEs' capabilities, it can omit sending the non-base view stream to a device that does not support 3-D video or does not have sufficient bitrate to support 3-D video. In various embodiments, the device capability information, transmitted from content management module 120 and/or device profile server 144 to content management module 136, may include a 3-D format attribute that includes a list of one or more formats relevant for streaming of stereoscopic 3-D video over relevant transmission protocol, e.g., RTP or HTTP, supported by the streaming application 126. In some embodiments, the 3-D format attribute may be a streaming frame packing format for RTP or HTTP having an integer value “1” for vertical interleaving, “2” for horizontal interleaving, “3” for side-by-side, “4” for top-bottom, “0” for checkerboard, or “5” for temporal interleaving. In some embodiments, the same 3-D format attributes may be used to indicate frame packing formats supported in a specific file or container format. In some embodiments, the 3-D format attribute may include a more generalized value, e.g., “FP” for frame packing. In some embodiments, the 3-D format attribute may be another streaming format having a value “SC” for simulcast or “2DA” for 2-D video plus auxiliary information. In embodiments in which the UE 104 supports more than one format type, it may further indicate one or more preferred format types. This could be done by listing the format types in an order of preference, associating a preference indicator with select format types, etc. In some embodiments, in addition to providing a frame type attribute, the content management module 120 and/or the device profile server 144 may provide one or more component type attributes. The component type attributes may provide additional details about specific types of video components, which are constituent elements of the stereoscopic 3-D video, supported and/or preferred by the streaming application 126. The component type attributes may have a value “C” for indicating a center-view stream, “CD” for indicating a center-view stream and a depth map, “CP” for indicating a center-view stream and a parallax map, “D” for indicating a depth map, “P” for indicating a parallax map, “L” for indicating a left-view stream, “LD” for indicating a left-view stream and a depth map, “LIL” for indicating video frames that include alternating scan lines from the left and right views, “LP” for indicating a left-view stream and a parallax map, “R” for indicating a right-view stream, “Seq” to indicate frame sequential (e.g., video stream that includes alternating frames from the left and right streams—additional signaling, e.g., AVC SEI messages, may be needed to signal which frames contain left and right views), “SbS” for indicating side-by-side, and “TaB” for indicating top and bottom. Each format type attribute may be associated with a respective set of component type attributes. For example, if the format type is SC, the associated component type may be L or R to indicate left and right views, respectively. The device capability exchange signaling capability in the PSS specification 3GPP TS 24.234 enables servers to provide a wide range of devices with content suitable for the particular device in question. In order to improve delivery of stereoscopic 3-D video content to the client terminal, the present disclosure describes a new set of attributes that may be included in the PSS vocabulary for device capability exchange signaling. These proposed attributes may describe the 3-D video decoding and rendering capabilities of the client terminal, including which 3-D video frame packing formats the client supports. This may for example allow the server and network to provide an optimized RTSP SDP or DASH MPD to the client terminal, as well as to perform the appropriate transcoding and 3-D format conversions in order to match the transmitted 3-D video content to the capabilities of the client device. The device capability exchange signaling of supported 3-D video codecs and formats may be enabled in 3GPP TS 26.234 with the inclusion of three new attributes in the PSS vocabulary: (1) for Streaming component, two attributes indicating the list of supported frame packing formats relevant for streaming of stereoscopic 3-D video over RTP and HTTP, respectively, and (2) for ThreeGPFileFormat component, one attribute indicating the list of supported frame packing formats relevant for stereoscopic 3-D video that can be included in a 3GPP file format (3GP) file, which is a multimedia container format commonly used for 3GPP-based multimedia services. The details of the attribute definitions are presented below in accordance with some embodiments. Attribute Name: StreaminFramePackinFormatsRTP Attribute definition: List of supported frame packing formats relevant for streaming of stereoscopic 3-D video over RTP supported by the PSS application. The frame packing formats within scope for stereoscopic 3-D video include: Frame Compatible Packing Formats: 1=Vertical interleaving, 2=Horizontal interleaving. 3=Side-by-Side, 4=Top-Bottom, 0=Checkerboard Full-Resolution per View Packing Formats: 5=Temporal Interleaving Component: Streaming Type: Literal (Bag) Legal values: List of integer values corresponding to the supported frame packing formats. Resolution rule: Append Example <StreamingFramePackingFormatsRTP> <rdf:Bag> <rdf:li>3</rdf:li> <rdf:li>4</rdf:li> </rdf:Bag> </StreamingFramePackingFormatsRTP> Attribute Name: StreaminFramePackinFormatsHTTP Attribute definition: List of supported frame packing formats relevant for streaming of stereoscopic 3-D video over HTTP supported by the PSS application. The frame packing formats within scope for stereoscopic 3-D video include: Frame Compatible Packing Formats: 1=Vertical interleaving, 2=Horizontal interleaving. 3=Side-by-Side, 4=Top-Bottom, 0=Checkerboard Full-Resolution per View Packing Formats: 5=Temporal Interleaving Component: Streaming Type: Literal (Bag) Legal values: List of integer values corresponding to the supported frame packing formats. Resolution rule: Append Example <StreamingFramePackingFormatsHTTP> <rdf:Bag> <rdf:li>3</rdf:li> <rdf:li>4</rdf:li> </rdf:Bag> </StreamingFramePackingFormatsHTTP> Attribute Name: ThreeGPFramePackinFormats Attribute definition: List of supported frame packing formats relevant for stereoscopic 3-D video that can be included in a 3GP file and handled by the PSS application. Component: ThreeGPFileFormat Type: Literal (Bag) Legal values: List of integer values corresponding to the supported frame packing formats. Integer values shall be either 3 or 4 corresponding to the Side-by-Side and Top-and-Bottom frame packing formats respectively. Resolution rule: Append Example <ThreeGPFramePackingFormats> <rdf:Bag> <rdf:li>3</rdf:li> <rdf:li>4</rdf:li> </rdf:Bag> </ThreeGPFramePackingFormats> In some embodiments, a media presentation, as described in MPD, for example, may include attributes and elements common to Adaptation Set, Representation, and SubRepresentation. One such common element may be a FramePacking element. A FramePacking element may specify frame packing arrangement information of the video media component type. When no FramePacking element is provided for a video component, frame-packing may not be used for the video media component. The FramePacking element may include an @schemeIdUri attribute that includes a uniform resource indicator (URI) to identify the frame packing configuration scheme employed. In some embodiments, the FramePacking element may further include an @ value attribute to provide a value for the descriptor element. In some embodiments, multiple FramePacking elements may be present. If so, each element may contain sufficient information to select or reject the described representation. If the scheme or the value of all FramePacking elements are not recognized, the client may ignore the described Representations. A client may reject the Adaptation Set on the basis of observing a FramePacking element. For Adaptation Sets or Representations that contain a video component that conforms to ISO/IEC Information technology—Coding of audio-visual objects—Part 10: Advanced Video Coding (ISO/IEC 14496-10:2012), a uniform resource number for FramePackin@schemeldUri may be urn:mpeg:dash:14496:10:frame_packing_arrangement_type:2011, that may be defined to indicate the frame-packing arrangement as defined by Table D-8 of the ISO/IEC 14496-10:2012 ('Defintion of frame_packing_arrangement_type') to be contained in the FramePacking element. The @ value may be the ‘Value’ column as specified in Table D-8 of the ISO/IEC 14496-10:2012 and may be interpreted according to the ‘Interpretation’ column in the same table. FIG. 5 illustrates a method 500 of signaling 3-D video device capabilities in accordance with some embodiments. Method 500 may be performed by components of a UE, e.g., UE 104. In some embodiments, the UE may include and/or have access to one or more computer-readable media having instructions stored thereon, that, when executed, cause the UE, or components thereof, to perform the method 500. At 504, the UE may determine device capability information. As described above, the device capability information may include information as to the decoding and rendering capabilities of a media player. In some embodiments, a content management module, located on the UE or elsewhere, may determine this information by running one or more scripts on the UE to directly test the capabilities. In other embodiments, the content management module may access one or more stored files that contain the relevant information. At 508, the UE may provide device capability information to the media server 116 or device profile server 144, including stereoscopic 3-D video decoding and rendering capabilities of the media player at the UE. As described above, the device capability information may include one or more format type attributes that represent a list of frame types supported by a streaming application of the UE. In some embodiments, the device capability information may be provided prior to or after the request at 512. In some embodiments, some or all of the device capability information may be provided to the media server by another entity, e.g., a device profile server. At 512, the UE may request 3-D video content. In some embodiments, the request may be in accordance with appropriate streaming/transport protocols, e.g., HTTP, RTP, RTSP, DASH, MBMS, PSS, IMS_PSS_MBMS, etc. The request may be directed to the media server and may include a uniform resource locator (URL) or some other indicator of the requested content or portions thereof. In some embodiments, the temporary adjustment to device capability information (e.g., via ProfDiff signaling) may also be provided along with the request at 508. Accordingly, the UE may supplement the profile information retrieved from the device profile server with extra attributes or overrides for attributes already defined in its device capability profile, based on ProfDiff signaling. In one example, such a temporary adjustment may be triggered by user preferences, for example if the user for a particular session only would like to receive two-dimensional (2-D) video even though the terminal is capable of rendering 3-D video. At 516, the UE may receive the requested 3-D video content and render the content on a display of the UE. The rendering of the content may include a variety of processes such as, but not limited to, decoding, upconverting, unpacking, sequencing, etc. FIG. 6 illustrates a method 600 of signaling 3-D video content in accordance with some embodiments. Method 600 may be performed by components of a media server, e.g., media server 116. In some embodiments, the media server may include and/or have access to one or more computer-readable media having instructions stored thereon, that, when executed, cause the media server, or components thereof, to perform the method 600. At 604, the media server may determine device capability information. In some embodiments, the media server may determine the device capability information by receiving, e.g., as part of session-level signaling, the information from the UE or a device profile server. At 608, the media server may receive a request for 3-D video content. In some embodiments, the request may be in accordance with appropriate streaming/transport protocols, e.g., HTTP, RTP, RTSP, DASH, MBMS, PSS, IMS_PSS_MBMS, etc. The request may be from the UE and may include a universal resource locator (URL) or some other indicator of the requested content or portions thereof. In some embodiments, the request received at 608 may occur simultaneously with determination of the device capability information 604, before the determination, or after the determination. In some embodiments, the temporary adjustment to device capability information (e.g., via ProfDiff signaling) may also be received along with the request at 608. Accordingly, the media server may be supplemented with the profile information retrieved from the device profile server with extra attributes or overrides for attributes already defined in its device capability profile, based on ProfDiff signaling. At 612, the media server may generate session description and/or metadata files to establish a streaming session, for example SDP file or a media presentation description (MPD) based on the device capability information accounting for the stereoscopic 3-D video decoding and rendering capabilities of the media player at the UE. At 616, the media server may encode the 3-D video content in a format type indicated as being supported by the UE in the device capability information. The 3-D video content may then be streamed to the mobile device. The components described herein, e.g., UE 104, media server 116, and/or device profile server 144, may be implemented into a system using any suitable hardware and/or software to configure as desired. FIG. 7 illustrates, for one embodiment, an example system 700 comprising one or more processor(s) 704, system control logic 708 coupled with at least one of the processor(s) 704, system memory 712 coupled with system control logic 708, non-volatile memory (NVM)/storage 716 coupled with system control logic 708, a network interface 720 coupled with system control logic 708, and input/output (I/O) devices 732 coupled with system control logic 708. The processor(s) 704 may include one or more single-core or multi-core processors. The processor(s) 704 may include any combination of general-purpose processors and dedicated processors (e.g., graphics processors, application processors, baseband processors, etc.). System control logic 708 for one embodiment may include any suitable interface controllers to provide for any suitable interface to at least one of the processor(s) 704 and/or to any suitable device or component in communication with system control logic 708. System control logic 708 for one embodiment may include one or more memory controller(s) to provide an interface to system memory 712. System memory 712 may be used to load and store data and/or instructions, e.g., logic 724. System memory 712 for one embodiment may include any suitable volatile memory, such as suitable dynamic random access memory (DRAM), for example. NVM/storage 716 may include one or more tangible, non-transitory computer-readable media used to store data and/or instructions, e.g., logic 724. NVM/storage 716 may include any suitable non-volatile memory, such as flash memory, for example, and/or may include any suitable non-volatile storage device(s), such as one or more hard disk drive(s) (HDD(s)), one or more compact disk (CD) drive(s), and/or one or more digital versatile disk (DVD) drive(s), for example. The NVM/storage 716 may include a storage resource physically part of a device on which the system 700 is installed or it may be accessible by, but not necessarily a part of, the device. For example, the NVM/storage 716 may be accessed over a network via the network interface 720 and/or over Input/Output (I/O) devices 732. The logic 724, when executed by at least one of the processors 704 may cause the system to perform the operations described herein with respect to the UE 104, media server 116, and/or device profile server 144. The logic 724 may be disposed additionally/alternatively in other components of the system, e.g., in system control logic 708, and may include any combination of hardware, software, or firmware components. Network interface 720 may have a transceiver 722 to provide a radio interface for system 700 to communicate over one or more network(s) and/or with any other suitable device. In various embodiments, the transceiver 722 may be integrated with other components of system 700. For example, the transceiver 722 may include a processor of the processor(s) 704, memory of the system memory 712, and NVM/Storage of NVM/Storage 716. Network interface 720 may include any suitable hardware and/or firmware. Network interface 720 may include a plurality of antennas to provide a multiple input, multiple output radio interface. Network interface 720 for one embodiment may include, for example, a wired network adapter, a wireless network adapter, a telephone modem, and/or a wireless modem. For one embodiment, at least one of the processor(s) 704 may be packaged together with logic for one or more controller(s) of system control logic 708. For one embodiment, at least one of the processor(s) 704 may be packaged together with logic for one or more controllers of system control logic 708 to form a System in Package (SiP). For one embodiment, at least one of the processor(s) 704 may be integrated on the same die with logic for one or more controller(s) of system control logic 708. For one embodiment, at least one of the processor(s) 704 may be integrated on the same die with logic for one or more controller(s) of system control logic 708 to form a System on Chip (SoC). In various embodiments, the I/O devices 732 may include user interfaces designed to enable user interaction with the system 700, peripheral component interfaces designed to enable peripheral component interaction with the system 700, and/or sensors designed to determine environmental conditions and/or location information related to the system 700. In various embodiments, the user interfaces could include, but are not limited to, a display for rendering 3-D video (e.g., a liquid crystal display, a touch screen display, an auto-stereoscopic display, etc.), a speaker, a microphone, one or more cameras (e.g., a still camera and/or a video camera), a flashlight (e.g., a light emitting diode flash), and a keyboard. In various embodiments, the peripheral component interfaces may include, but are not limited to, a non-volatile memory port, a universal serial bus (USB) port, an audio jack, and a power supply interface. In various embodiments, the sensors may include, but are not limited to, a gyro sensor, an accelerometer, a proximity sensor, an ambient light sensor, and a positioning unit. The positioning unit may also be part of, or interact with, the network interface 720 to communicate with components of a positioning network, e.g., a global positioning system (GPS) satellite. In various embodiments, the system 700 may be a mobile computing device such as, but not limited to, a laptop computing device, a tablet computing device, a netbook, a smartphone, etc. In various embodiments, system 700 may have more or less components, and/or different architectures. Although certain embodiments have been illustrated and described herein for purposes of description, a wide variety of alternate and/or equivalent embodiments or implementations calculated to achieve the same purposes may be substituted for the embodiments shown and described without departing from the scope of the present disclosure. This application is intended to cover any adaptations or variations of the embodiments discussed herein. Therefore, it is manifestly intended that embodiments described herein be limited only by the claims and the equivalents thereof. 1. One or more computer-readable media having instructions that, when executed, cause a device to: obtain, from a network entity, a streaming frame packing format attribute that includes a list of frame packing formats, supported by a client terminal of a wireless communication network, relevant for streaming of stereoscopic 3-D video over a transport protocol supported by a packet-switched streaming service (PSS) application on the client terminal, wherein the transport protocol is a real-time transport protocol (RTP) or a hypertext transfer protocol (HTTP); adapt content based on the streaming frame packing format attribute; generate a session description or metadata file to establish a streaming session based on the streaming frame packing format attribute; and transmit the adapted content and the generated session description or metadata file to the client terminal. 2. The one or more computer-readable media of claim 1, wherein the list of frame packing formats includes an indication of a vertical interleaving frame compatible packing format, a horizontal interleaving frame compatible packing format, a side-by-side frame compatible packing format, a top-bottom frame compatible packing format, a checkerboard frame compatible packing format, or a temporal interleaving full-resolution per view packing format. 3. The one or more computer-readable media of claim 1, wherein the list comprises a list of one or more integer values that respectively correspond to one or more supported frame packing formats. 4. The one or more computer-readable media of claim 3, wherein the list of one or more integer values includes a 1 to correspond to a vertical interleaving frame compatible packing format, a 2 to correspond to a horizontal interleaving frame compatible packing format, a 3 to correspond to a side-by-side frame compatible packing format, a 4 to correspond to a top-bottom frame compatible packing format, a 0 to correspond to a checkerboard frame compatible packing format, or a 5 to correspond to a temporal interleaving full-resolution per view packing format. 5. The one or more computer-readable media of claim 1, wherein the transport protocol comprises an RTP. 6. The one or more computer-readable media of claim 1, wherein the transport protocol comprises an HTTP. 7. The one or more computer-readable media of claim 1, wherein the session description or metadata file is a real-time streaming protocol (RTSP) session description protocol (SDP) file or a dynamic adaptive streaming over hypertext transport protocol (DASH) media presentation description (MPD) file. 8. The one or more computer-readable media of claim 1, wherein content is 3-D video content and the instructions, when executed, further cause the device to: transcode the 3-D video content or convert a format of the 3-D video content based on the streaming frame packing format attribute. 9. The one or more computer-readable media of claim 1, wherein the network entity is a device profile server or a user equipment that comprises the client terminal. 10. One or more computer-readable media having instructions that, when executed, cause a device to: obtain, from a network entity, a frame packing format attribute that includes a list of one or more frame packing formats, supported by a user equipment, relevant for stereoscopic 3-D video that can be included in a 3rd Generation Partnership Project file format (3GP) file and handled by a packet-switched streaming service (PSS) application on the user equipment; and transmit content to the user equipment based on the frame packing format attribute. 11. The one or more computer-readable media of claim 10, wherein the list of frame packing formats includes an indication of a side-by-side frame packing format or a top-bottom frame packing format. 12. The one or more computer-readable media of claim 10, wherein the list comprises a list of one or more integer values that respectively correspond to one or more frame packing formats. 13. The one or more computer-readable media of claim 12, wherein the list of one or more integer values includes a 3 to correspond to side-by-side frame packing format or a 4 to correspond to a top-bottom frame packing format. 14. An apparatus comprising: a media player to decode and render stereoscopic three-dimensional (3-D) video content, wirelessly received by a mobile device, on a display of the mobile device; and a content management module to: determine device capability information including 3-D video codecs and formats supported by the media player; transmit one or more messages to a media server or a device profile server, the one or more messages including the device capability information; transmit at least one message to a media server, the at least one message including a request for stereoscopic 3-D video content and any temporary adjustments on the device capability information. 15. The apparatus of claim 14, wherein the device capability information has a 3-D format attribute that includes a format type supported by the media player circuitry. 16. The apparatus of claim 15, wherein the format type is a frame-packing format type that corresponds to a frame compatible packing format or a full-resolution per view packing format, a simulcast format type, or a two-dimensional plus auxiliary format type. 17. The apparatus of claim 16, wherein the format type is a frame-packing format type that is a frame compatible packing format with a value to indicate vertical interleaving, horizontal interleaving, side-by-side, top-bottom, or checkerboard. 18. The apparatus of claim 14, wherein the 3-D video content is wirelessly received by the mobile device via a packet-switched streaming service. 19. The apparatus of claim 14, wherein the content management module is to transmit device capability information in a session initiation protocol (SIP) SUBSCRIBE message to an Internet Protocol Multimedia Core Network subsystem during service discovery. 20. The apparatus of claim 19, wherein, subsequent to service discovery, the content management module is to use SIP signaling to update set of supported 3-D video codecs and formats. 21. The apparatus of claim 14, wherein the media player is further configured to: receive a stream including the requested stereoscopic 3-D video content, wherein the media player is further configured to receive the stream according to a dynamic adaptive streaming over hypertext transport portocol (DASH) protocol; a packet-switched streaming (PSS) protocol; or an Internet protocol multimedia subsystem (IMS)-based PSS and multimedia broadcast/multicast (MBMS) services protocol. 22. The apparatus of claim 21, wherein the media player is further configured to receive a session description protocol (SDP) file or a media presentation description (MPD) metadata file associated with the stream. 23. A mobile device comprising the apparatus of claim 14. 24. The mobile device of claim 23, further comprising: an auto-stereoscopic display to render the 3-D video content under control of the media player. 25. One or more computer-readable media having instructions that, when executed, cause a device to: obtain a request for 3-D capability information related to a user equipment; and provide a streaming frame packing format attribute that includes a list of frame packing formats, supported by the user equipment, relevant for streaming of stereoscopic 3-D video over a transport protocol supported by a packet-switched streaming service (PSS) application on the user equipment, wherein the transport protocol is a real-time transport protocol (RTP) or a hypertext transfer protocol (HTTP). 26. The one or more computer-readable media of claim 25, wherein the list of frame packing formats includes an indication of a vertical interleaving frame compatible packing format, a horizontal interleaving frame compatible packing format, a side-by-side frame compatible packing format, a top-bottom frame compatible packing format, a checkerboard frame compatible packing format, or a temporal interleaving full-resolution per view packing format. 27. The one or more computer-readable media of claim 25, wherein the transport protocol comprises an RTP. 28. The one or more computer-readable media of claim 25, wherein the transport protocol comprises an HTTP. 29. The one or more computer-readable media of claim 25, wherein the list comprises a list of one or more integer values that respectively correspond to one or more supported frame packing formats. 30. The one or more computer-readable media of claim 29, wherein the list of one or more integer values includes a 1 to correspond to a vertical interleaving frame compatible packing format, a 2 to correspond to a horizontal interleaving frame compatible packing format, a 3 to correspond to a side-by-side frame compatible packing format, a 4 to correspond to a top-bottom frame compatible packing format, a 0 to correspond to a checkerboard frame compatible packing format, or a 5 to correspond to a temporal interleaving full-resolution per view packing format.

2012-09-25

en

2013-10-10

US-201815899303-A

Biological and Chemical Process Utilizing Chemoautotrophic Microorganisms for the Chemosynthetic Fixation of Carbon Dioxide and/or Other Inorganic Carbon Sources into Organic Compounds and the Generation of Additional Useful Products ABSTRACT The invention described herein presents compositions and methods for a multistep biological and chemical process for the capture and conversion of carbon dioxide and/or other forms of inorganic carbon into organic chemicals including biofuels or other useful industrial, chemical, pharmaceutical, or biomass products. One or more process steps utilizes chemoautotrophic microorganisms to fix inorganic carbon into organic compounds through chemosynthesis. An additional feature described are process steps whereby electron donors used for the chemosynthetic fixation of carbon are generated by chemical or electrochemical means, or are produced from inorganic or waste sources. An additional feature described are process steps for the recovery of useful chemicals produced by the carbon dioxide capture and conversion process, both from chemosynthetic reaction steps, as well as from non-biological reaction steps. FIELD OF THE INVENTION The present invention falls within the technical areas of biofuels, bioremediation, carbon capture, carbon dioxide-to-fuels, carbon recycling, carbon sequestration, energy storage, and renewable/alternative and/or low carbon dioxide emission sources of energy. Specifically the present invention involves in certain aspects a unique use of biocatalysts within a biological and chemical process to fix carbon dioxide and/or other forms of inorganic carbon into organic chemical products through chemosynthesis. In addition certain embodiments of the present invention involve the production of chemical co-products that are co-generated through chemosynthetic reaction steps and/or non-biological reaction steps as part of an overall carbon capture and conversion process. The present invention can enable the effective capture of carbon dioxide from the atmosphere or from a point source of carbon dioxide emissions for the production of liquid transportation fuel and/or other organic chemical products, which can help address greenhouse gas induced climate change and contribute to the domestic production of renewable liquid transportation fuels without any dependence upon agriculture. BACKGROUND OF THE INVENTION The amazing technological and economic progress achieved in the past 100 years has largely been powered by fossil fuels. However the sustainability of this progress is now coming into question, both due to the rise in greenhouses gases caused by fossil fuel combustion, and the increasing scarcity of fossil fuel resources. Hydrogen which can be generated through a number of different inorganic renewable energy technologies including solar, wind, and geothermal has been proposed as a replacement for hydrocarbon fuels. But hydrogen has its own set of problems including most notably problems with storage. Ironically the best chemical storage medium for hydrogen both in terms of volumetric and gravimetric energy densities is quite possibly hydrocarbons such as gasoline, suggesting that the quest for hydrogen fuel may simply lead full circle back to hydrocarbons. Biofuels are a promising type of renewable hydrocarbon generally made through the capture and conversion of CO2 into organic matter by photosynthetic organisms. Since the current transportation fleet and infrastructure is designed for fossil fuels with similar properties to biofuels, it can be more readily be adapted to biofuels, than to inorganic energy storage products such as hydrogen or batteries. A further advantage of biofuels, and hydrocarbons in general, is that they have some of the highest volumetric and gravimetric energy densities found for any form of chemical energy storage—substantially higher than that achieved with current lithium battery and hydrogen storage technologies. However, biofuels produced through photosynthesis have their own set of problems. Most biofuel currently produced relies on agriculture. The heavy requirements of large scale agricultural biofuel projects for arable land, fresh water, and other resources required for plant growth have been blamed for rapidly increasing food prices and loss of natural habitat [The Price of Biofuels: The Economics Behind Alternative Fuels, Technology Review, January/February 2008]. As an alternative to higher order plants, photosynthetic microorganisms such as algae and cyanobacteria are being looked at for applications converting CO2 into biofuels or other organic chemicals [Sheehan et al, 1998, “A Look Back at the U.S. Department of Energy's Aquatic Species Program—Biodiesel from Algae”]. Algal and cyanobacterial technologies benefit from relatively high growth rates, far surpassing higher order plants in their rate of carbon fixation per unit standing biomass. In one promising application of algal technology a high rate of carbon fixation and biomass production is achieved by directing a concentrated stream of CO2, such as is emitted from industrial point sources, through algae containing bioreactors [Bayless et al. U.S. Pat. No. 6,667,171]. Technologies based on photosynthetic microbes share the drawback common to all photosynthetic systems in that carbon fixation only happens with light exposure. If the light level is deficient, an algal system can actually become a net producer of CO2 emissions. A bioreactor or pond used to grow photosynthetic microbes such as algae must have a high surface area to volume ratio in order to allow each cell to receive enough light for carbon fixation and cell growth. Otherwise light blockage by cells on the surface will leave cells located towards the center of the volume in darkness—turning them into net CO2 emitters. This high surface area to volume ratio needed for efficient implementation of the algal and cyanobacterial technologies generally results in either a large land footprint (ponds) or high material costs (bioreactors). The types of materials that can be used in algal bioreactor construction is limited by the requirement that walls lying between the light source and the algal growth environment need to be transparent. This requirement restricts the use of construction materials that would normally be preferred for use in large scale projects such as concrete, steel and earthworks. In addition to the biological CO2 fixation processes that have been discussed, there are also fully chemical processes for fixing CO2 to organic compounds (LBNL Helios; LANL Green Freedom; Sandia Sunshine to Petrol; PARC). The fully chemical technologies are currently hindered by the catalysts that are needed for the relatively complicated reaction of CO2 to fixed carbon, especially C2 and longer hydrocarbons. Chemoautotrophic microorganisms are known that catalyzing the carbon fixation reaction without photosynthesis. The chemosynthetic reactions performed by chemoautotrophs for the fixation of CO2, and other forms of inorganic carbon, to organic compounds, is powered by potential energy stored in inorganic chemicals, rather than by the radiant energy of light [Shively et al, 1998; Smith et al, 1967; Hugler et al, 2005; Hugker et al., 2005; Scott and Cavanaugh, 2007]. Carbon fixing biochemical pathways that occur in chemoautotrophs include the reductive tricarboxylic acid cycle, the Calvin-Benson-Bassham cycle [Jessup Shively, Geertje van Kaulen, Wim Meijer, Annu. Rev. Microbiol., 1998, 191-230], and the Wood-Ljungdahl pathway [Ljungdahl, 1986; Gottschalk, 1989; Lee, 2008; Fischer, 2008]. Prior work is known relating to certain applications of chemoautotrophic microorganisms in the capture and conversion of CO2 gas to fixed carbon [U.S. Pat. No. 4,596,778 “Single cell protein from sulfur energy sources” Hitzman, Jun. 24, 1986], [U.S. Pat. No. 4,859,588 “Production of a single cell protein”, Sublette Aug. 22, 1989], [U.S. Pat. No. 5,593,886 “Clostridium strain which produces acetic acid from waste gases Gaddy”, Jan. 14, 1997], [U.S. Pat. No. 5,989,513 “Biologically assisted process for treating sour gas at high pH”, Rai Nov. 23, 1999]. However, each of these conventional approaches have suffered shortcomings that have limited the effectiveness, economic feasibility, practicality and commercial adoption of the described processes. The present invention in certain aspects addresses one or more of the aforementioned shortcomings. Chemoautotrophic microorganisms have also been used to biologically convert syngas into C2 and longer organic compounds including acetic acid and acetate, and biofuels such as ethanol and butanol [Gaddy, 2007; Lewis, 2007; Heiskanen, 2007; Worden, 1991; Klasson, 1992; Ahmed, 2006; Cotter, 2008; Piccolo, 2008, Wei, 2008]; however, in such approaches the feedstock is strictly limited to fixed carbon (either biomass or fossil fuel), which is gasified and then biologically converted to another form of fixed carbon—biofuel, and the carbon source and energy source utilized in the process come from the same process input, either biomass or fossil fuel, and are completely intermixed within the syngas in the form of H2, CO, and CO2. The present inventors have recognized in the context of the present invention that a need exists for processes that do not require any fixed carbon feedstock, only CO2 and/or other forms of inorganic carbon and/or utilize a carbon source and energy source that are derived from separate process inputs. SUMMARY OF THE INVENTION In response to a need in the art that the inventors have recognized in making the invention, a novel combined biological and chemical process for the capture and conversion of inorganic carbon to organic compounds that uses chemosynthetic microorganisms for carbon fixation and that is designed to couple the efficient production of high value organic compounds such as liquid hydrocarbon fuel with the capture of CO2 emissions, making carbon capture a revenue generating process is described. Described herein are biological and chemical processes for the capture and conversion of carbon dioxide and/or other sources of inorganic carbon, into organic compounds comprising: introducing carbon dioxide gas, either alone and/or dissolved in a mixture or solution further comprising carbonate ion and/or bicarbonate ion, and/or introducing inorganic carbon contained in a solid phase into an environment suitable for maintaining chemoautotrophic organisms and/or chemoautotroph cell extracts; and fixing the carbon dioxide and/or inorganic carbon into organic compounds within the environment via at least one chemosynthetic carbon fixing reaction utilizing obligate and/or facultative chemoautotrophic microorganisms and/or cell extracts containing enzymes from chemoautotrophic microorganisms; wherein where the chemosynthetic carbon fixing reaction is driven by chemical and/or electrochemical energy provided by electron donors and electron acceptors that have been generated chemically and/or electrochemically and/or or are introduced into the environment from at least one source external to the environment. The carbon source may be separated from the energy source in certain embodiments of the present invention which enables it to function as a far more general energy conversion technology than syngas to liquid fuel conversions. This is because the electron donors used in the present invention can be generated from a wide array of different CO2-free energy sources, both conventional and alternative, while for syngas conversions to biofuel, all the energy stored in the biofuel is ultimately derived from photosynthesis (with additional geochemical energy in the case of fossil fuel feedstock). The present invention, in certain embodiments, provides compositions and methods for the capture of carbon dioxide from carbon dioxide-containing gas streams and/or atmospheric carbon dioxide or carbon dioxide in dissolved, liquefied or chemically-bound form through a chemical and biological process that utilizes obligate or facultative chemoautotrophic microorganisms and particularly chemolithoautotrophic organisms, and/or cell extracts containing enzymes from chemoautotrophic microorganisms in one or more carbon fixing process steps. The present invention, in certain embodiments, provides compositions and methods for the recovery, processing, and use of the chemical products of chemosynthetic reactions performed by chemoautotrophs to fix inorganic carbon into organic compounds. The present invention, in certain embodiments, provides compositions and methods for the generation, processing and delivery of chemical nutrients needed for chemosynthesis and maintenance of chemoautotrophic cultures, including but not limited to the provision of electron donors and electron acceptors needed for chemosynthesis. The present invention, in certain embodiments, provides compositions and methods for the maintenance of an environment conducive for chemosynthesis and chemoautotrophic growth, and the recovery and recycling of unused chemical nutrients and process water. The present invention, in certain embodiments, provides compositions and methods for chemical process steps that occur in series and/or in parallel with the chemosynthetic reaction steps that: convert unrefined raw input chemicals to more refined chemicals that are suited for supporting the chemosynthetic carbon fixing step; that convert energy inputs into a chemical form that can be used to drive chemosynthesis, and specifically into chemical energy in the form of electron donors and electron acceptors; that direct inorganic carbon captured from industrial or atmospheric or aquatic sources to the carbon fixation steps of the process under conditions that are suitable to support chemosynthetic carbon fixation; that further process the output products of the chemosynthetic carbon fixation steps into a form suitable for storage, shipping, and sale, and/or safe disposal in a manner that results in a net reduction of gaseous CO2 released into the atmosphere. The fully chemical process steps combined with the chemosynthetic carbon fixation steps constitute the overall carbon capture and conversion process of certain embodiments of the present invention. The present invention, in certain embodiments, utilizes the integration of chemoautotrophic microorganisms into a chemical process stream as a biocatalyst, as compared to other lifeforms. This unique capability arises from the fact that chemoautotrophs naturally act at the interface of biology and chemistry through their chemosynthetic lifestyle. One feature of certain embodiments of the present invention is the inclusion of one or more process steps within a chemical process for the capture of inorganic carbon and conversion to fixed carbon products, that utilize chemoautotrophic microorganisms and/or enzymes from chemoautotrophic microorganisms as a biocatalyst for the fixation of carbon dioxide in carbon dioxide-containing gas streams or the atmosphere or water and/or dissolved or solid forms of inorganic carbon, into organic compounds. In these process steps carbon dioxide containing flue gas, or process gas, or air, or inorganic carbon in solution as dissolved carbon dioxide, carbonate ion, or bicarbonate ion including aqueous solutions such as sea water, or inorganic carbon in solid phases such as but not limited to carbonates and bicarbonates, may be pumped or otherwise added to a suitable environment, such as a vessel or enclosure containing nutrient media and chemoautotrophic microorganisms. In these process steps chemoautotrophic microorganisms perform chemosynthesis to fix inorganic carbon into organic compounds using the chemical energy stored in one or more types of electron donor pumped or otherwise provided to the nutrient media including but not limited to one of more of the following: ammonia; ammonium; carbon monoxide; dithionite; elemental sulfur; hydrocarbons; hydrogen; metabisulfites; nitric oxide; nitrites; sulfates such as thiosulfates including but not limited to sodium thiosulfate or calcium thiosulfate; sulfides such as hydrogen sulfide; sulfites; thionate; thionite; transition metals or their sulfides, oxides, chalcogenides, halides, hydroxides, oxyhydroxides, sulfates, or carbonates, in soluble or solid phases; as well as valence or conduction electrons in solid state electrode materials. The electron donors are oxidized by electron acceptors in the chemosynthetic reaction. Electron acceptors that may be used at the chemosynthetic reaction step include but are not limited to one or more of the following: carbon dioxide, ferric iron or other transition metal ions, nitrates, nitrites, oxygen, sulfates, or holes in solid state electrode materials. The chemosynthetic reaction step or steps of certain inventive processes wherein carbon dioxide and/or inorganic carbon is fixed into organic carbon in the form of organic compounds and biomass can be performed in aerobic, microaerobic, anoxic, anaerobic, or facultative conditions. A facultative environment is considered to be one where the water column is stratified into aerobic layers and anaerobic layers. The oxygen level maintained spatially and temporally in the system will depend upon the chemoautotrophic species used, and the desired chemosynthesis reactions to be performed. An additional feature of certain embodiments of the present invention regards the source, production, or recycling of the electron donors used by the chemoautotrophic microorganisms to fix carbon dioxide into organic compounds. The electron donors used for carbon dioxide capture and carbon fixation can be produced or recycled in the present invention electrochemically or thermochemically using power from a number of different renewable and/or low carbon emission energy technologies including but not limited to: photovoltaics, solar thermal, wind power, hydroelectric, nuclear, geothermal, enhanced geothermal, ocean thermal, ocean wave power, tidal power. The electron donors can also be of mineralogical origin including but not limited to reduced S and Fe containing minerals. The present invention enables the use of a largely untapped source of energy—inorganic geochemical energy. The electron donors used in the present invention can also be produced or recycled through chemical reactions with hydrocarbons that may or may not be a non-renewable fossil fuel, but where said chemical reactions produce low or zero carbon dioxide gas emissions. Such electron donor generating chemical reactions that can be used as steps in the process certain embodiments of the present invention include but are not limited to: the thermochemical reduction of sulfate reaction or TSR [Evaluating the Risk of Encountering Non-hydrocarbon Gas Contaminants (CO2, N2, H2S) Using Gas Geochemistry, www.gaschem.com/evalu.html] or the Muller-Kuhne reaction; the reduction of metal oxides including iron oxide, calcium oxide, and magnesium oxide. The reaction formula for TSR is CaSO4+CH4→CaCO3+H2O+H2S. In this case the electron donor product that can be used by chemoautotrophic microorganisms for CO2 fixation is hydrogen sulfide. The solid carbonate product also formed can be easily sequestered resulting in no release of carbon dioxide into the atmosphere. There are similar reactions reducing sulfate to sulfide that involve longer chain hydrocarbons [Changtao Yue, Shuyuan Li, Kangle Ding, Ningning Zhong, Thermodynamics and kinetics of reactions between C1-C3 hydrocarbons and calcium sulfate in deep carbonate reservoirs, Geochem. Jour., 2006, 87-94]. An additional feature of certain embodiments of the present invention regards the formation and recovery of useful organic and/or inorganic chemical products from the chemosynthetic reaction step or steps including but not limited to one ore more of the following: acetic acid, other organic acids and salts of organic acids, ethanol, butanol, methane, hydrogen, hydrocarbons, sulfuric acid, sulfate salts, elemental sulfur, sulfides, nitrates, ferric iron and other transition metal ions, other salts, acids or bases. These chemical products can be applied to uses including but not limited to one or more of the following: as a fuel; as a feedstock for the production of fuels; in the production of fertilizers; as a leaching agent for the chemical extraction of metals in mining or bioremediation; as chemicals reagents in industrial or mining processes. An additional feature of certain embodiments of the present invention regards the formation and recovery of biochemicals and/or biomass from the chemosynthetic carbon fixation step or steps. These biochemical and/or biomass products can have applications including but not limited to one or more of the following: as a biomass fuel for combustion in particular as a fuel to be co-fired with fossil fuels such as coal in pulverized coal powered generation units; as a carbon source for large scale fermentations to produce produce various chemicals including but not limited to commercial enzymes, antibiotics, amino acids, vitamins, bioplastics, glycerol, or 1,3-propanediol; as a nutrient source for the growth of other microbes or organisms; as feed for animals including but not limited to cattle, sheep, chickens, pigs, or fish; as feed stock for alcohol or other biofuel fermentation and/or gasification and liquefaction processes including but not limited to direct liquefaction, Fisher Tropsch processes, methanol synthesis, pyrolysis, transesterification, or microbial syngas conversions, for the production of liquid fuel; as feed stock for methane or biogas production; as fertilizer; as raw material for manufacturing or chemical processes such as but not limited to the production of biodegradable/biocompatible plastics; as sources of pharmaceutical, medicinal or nutritional substances; soil additives and soil stabilizers. An additional feature of certain embodiments of the present invention regards using modified chemoautotrophic microorganisms in the chemosynthesis process step/steps such that a superior quantity and/or quality of organic compounds, biochemicals, or biomass is generated through chemosynthesis. The chemoautotrophic microbes used in these steps may be modified through artificial means including but not limited to accelerated mutagenesis (e.g. using ultraviolet light or chemical treatments), genetic engineering or modification, hybridization, synthetic biology or traditional selective breeding. Other advantages and novel features of the present invention will become apparent from the following detailed description of various non-limiting embodiments of the invention when considered in conjunction with the accompanying figures. All publications, patent applications and patents mentioned in the text are incorporated by reference in their entirety. In cases where the present specification and a document incorporated by reference include conflicting and/or inconsistent disclosure, the present specification shall control. BRIEF DESCRIPTION OF THE FIGURES Non-limiting embodiments of the present invention will be described by way of example with reference to the accompanying figures, which are schematic and are not intended to be drawn to scale. For purposes of clarity, not every component is labeled in every figure, nor is every component of each embodiment of the invention shown where illustration is not necessary to allow those of ordinary skill in the art to understand the invention. In the figures: FIG. 1 is a general process flow diagram for one embodiment of this invention for a carbon capture and fixation process; FIG. 2 is process flow diagram for another embodiment of the present invention with capture of CO2 performed by hydrogen oxidizing chemoautotrophs resulting in the production of ethanol; FIG. 3 shows the mass balance calculated for the embodiment of FIG. 2 reacting CO2 with H2 to produce ethanol; FIG. 4 shows the enthalpy flow calculated for the embodiment of FIG. 2 reacting CO2 with H2 to produce ethanol; FIG. 5 shows the energy balance calculated for the embodiment of FIG. 2 reacting CO2 with H2 to produce ethanol; FIG. 6. is a process flow diagram for the capture of CO2 by sulfur oxidizing chemoautotrophs and production of biomass and sulfuric acid, according to one embodiment; FIG. 7. is a process flow diagram for the capture of CO2 by sulfur oxidizing chemoautotrophs and production of biomass and sulfuric acid through the chemosynthetic reaction and calcium carbonate via the Muller-Kuhne reaction, according to one embodiment; FIG. 8 is a process flow diagram for the capture of CO2 by sulfur oxidizing chemoautotrophs and production of biomass and calcium carbonate and recycling of thiosulfate electron donor via the Muller-Kuhne reaction, according to one embodiment; FIG. 9 is a process flow diagram for the capture of CO2 by sulfur and iron oxidizing chemoautotrophs and production of biomass and sulfuric acid using an insoluble source of electron donors, according to one embodiment; FIG. 10 is a process flow diagram for the capture of CO2 by sulfur and hydrogen oxidizing chemoautotrophs and production of biomass, sulfuric acid, and ethanol using an insoluble source of electron donors, according to one embodiment; and FIG. 11 is a process flow diagram for the capture of CO2 by iron and hydrogen oxidizing chemoautotrophs and production of biomass, ferric sulfate, carbonate and ethanol using coal or another hydrocarbon to generate electron donors in a process that does not emit gaseous CO2 emissions, according to one embodiment. DETAILED DESCRIPTION The present invention provides, in certain embodiments, compositions and methods for the capture and fixation of carbon dioxide from carbon dioxide-containing gas streams and/or atmospheric carbon dioxide or carbon dioxide in liquefied or chemically-bound form through a chemical and biological process that utilizes obligate or facultative chemoautotrophic microorganisms and particularly chemolithoautotrophic organisms, and/or cell extracts containing enzymes from chemoautotrophic microorganisms in one or more process steps. Cell extracts include but are not limited to: a lysate, extract, fraction or purified product exhibiting chemosynthetic enzyme activity that can be created by standard methods from chemoautotrophic microorganisms. In addition the present invention, in certain embodiments, provides compositions and methods for the recovery, processing, and use of the chemical products of chemosynthetic reaction step or steps performed by chemoautotrophs to fix inorganic carbon into organic compounds. Finally the present invention, in certain embodiments, provides compositions and methods for the production and processing and delivery of chemical nutrients needed for chemosynthesis and chemoautotrophic growth, and particularly electron donors and acceptors to drive the chemosynthetic reaction; compositions and methods for the maintenance of a environment conducive for chemosynthesis and chemoautotrophic growth; and compositions and methods for the removal of the chemical products of chemosynthesis from the chemoautotrophic growth environment and the recovery and recycling of unused of chemical nutrients. The genus of chemoautotrophic microorganisms that can be used in one or more process steps of the present invention include but are not limited to one or more of the following: Acetoanaerobium sp., Acetobacterium sp., Acetogenium sp., Achromobacter sp., Acidianus sp., Acinetobacter sp., Actinomadura sp., Aeromonas sp., Alcaligenes sp., Alcaligenes sp., Arcobacter sp., Aureobacterium sp., Bacillus sp., Beggiatoa sp., Butyribacterium sp., Carboxydothermus sp., Clostridium sp., Comamonas sp., Dehalobacter sp., Dehalococcoide sp., Dehalospirillum sp., Desulfobacterium sp., Desulfomonile sp., Desulfotomaculum sp., Desulfovibrio sp., Desulfurosarcina sp., Ectothiorhodospira sp., Enterobacter sp., Eubacterium sp., Ferroplasma sp., Halothibacillus sp., Hydrogenobacter sp., Hydrogenomonas sp., Leptospirillum sp., Metallosphaera sp., Methanobacterium sp., Methanobrevibacter sp., Methanococcus sp., Methanosarcina sp., Micrococcus sp., Nitrobacter sp., Nitrosococcus sp., Nitrosolobus sp., Nitrosomonas sp., Nitrosospira sp., Nitrosovibrio sp., Nitrospina sp., Oleomonas sp., Paracoccus sp., Peptostreptococcus sp., Planctomycetes sp., Pseudomonas sp., Ralstonia sp., Rhodobacter sp., Rhodococcus sp., Rhodocyclus sp., Rhodomicrobium sp., Rhodopseudomonas sp., Rhodospirillum sp., Shewanella sp., Streptomyces sp., Sulfobacillus sp., Sulfolobus sp., Thiobacillus sp., Thiomicrospira sp, Thioploca sp., Thiosphaera sp., Thiothrix sp. Also chemoautotrophic microorganisms that are generally categorized as sulfur-oxidizers, hydrogen-oxidizers, iron-oxidizers, acetogens, methanogens, as well as a consortiums of microorganisms that include chemoautotrophs. The different chemoautotrophs that can be used in the present invention may be native to a range environments including but not limited to hydrothermal vents, geothermal vents, hot springs, cold seeps, underground aquifers, salt lakes, saline formations, mines, acid mine drainage, mine tailings, oil wells, refinery wastewater, coal seams, the deep sub-surface, waste water and sewage treatment plants, geothermal power plants, sulfatara fields, soils. They may or may not be extremophiles including but not limited to thermophiles, hyperthermophiles, acidophiles, halophiles, and psychrophiles. FIG. 1 illustrates the general process flow diagram for certain embodiments of the present invention that have a process step for the generation of electron donors suitable for supporting chemosynthesis from an energy input and raw inorganic chemical input; followed by recovery of chemical products from the electron donor generation step; delivery of generated electron donors along with electron acceptors, water, nutrients, and CO2 from a point industrial flue gas source, into chemosynthetic reaction step or steps that make use of chemoautotrophic microorganisms to capture and fix carbon dioxide, creating chemical and biomass co-products through chemosynthetic reactions; followed by process steps for the recovery of both chemical and biomass products from the process stream; and recycling of unused nutrients and process water, as well as cell mass needed to maintain the chemoautotrophic culture back into the chemosynthetic reaction steps. In the embodiment illustrated in FIG. 1, the CO2 containing flue gas is captured from a point source or emitter. Electron donors needed for chemosynthesis may be generated from input inorganic chemicals and energy. The flue gas is pumped through bioreactors containing chemoautotrophs along with electron donors and acceptors to drive chemosynthesis and a medium suitable to support a chemoautotrophic culture and carbon fixation through chemosynthesis. The cell culture may be continuously flowed into and out of the bioreactors. After the cell culture leaves the bioreactors the cell mass is separated from the liquid medium. Cell mass needed to replenish the cell culture population at a functional or an optimal level is recycled back into the bioreactor. Surplus cell mass may be dried to form a dry biomass product. Following the cell separation step chemical products of the chemosynthetic reaction may be removed from the process flow and recovered. Then any undesirable waste products that might be present may be removed. Following this, in the illustrated embodiment, the liquid medium and any unused nutrients are recycled back into the bioreactors. Many of the reduced inorganic chemicals upon which chemoautotrophs grow (e.g. H2, H2S, ferrous iron, ammonium, Mn2+) can be readily produced using electrochemical and/or thermochemical processes known in the art of chemical engineering that may optionally be powered by a variety carbon dioxide emission-free or low-carbon emission and/or renewable sources of power including wind, hydroelectric, nuclear, photovoltaics, or solar thermal. Certain embodiments of the present invention use carbon dioxide emission-free or low-carbon emission and/or renewable sources of power in the production of electron donors including but not limited to one or more of the following: photovoltaics, solar thermal, wind power, hydroelectric, nuclear, geothermal, enhanced geothermal, ocean thermal, ocean wave power, tidal power. In certain embodiments of the present invention that draw upon carbon dioxide emission-free or low-carbon emission and/or renewable sources of power in the production of electron donors, chemoautotrophs function as biocatalysts for the conversion of renewable energy into liquid hydrocarbon fuel, or high energy density organic compounds generally, with CO2 captured from flue gases, or from the atmosphere, or ocean serving as a carbon source. These embodiments of the present invention can provide renewable energy technologies with the capability of producing a transportation fuel having significantly higher energy density than if the renewable energy sources are used to produce hydrogen gas—which must be stored in relatively heavy storage systems (e.g. tanks or storage materials)—or if it is used to charge batteries which have relatively low energy density. Additionally the liquid hydrocarbon fuel product of certain embodiments of the present invention may be more compatible with the current transportation infrastructure compared to these other energy storage options. The ability of chemoautotrophs to use inorganic sources of chemical energy also enables the conversion of inorganic carbon into liquid hydrocarbon fuels using non-hydrocarbon mineralogical sources of chemical energy, i.e. reduced inorganic minerals (such as hydrogen sulfide, pyrite), which represent a largely untapped store of geochemical energy. Hence certain embodiments of the present invention use mineralogical sources of chemical energy which are pre-processed ahead of the chemosynthetic reaction steps into a form of electron donor and method of electron donor delivery that is suitable or optimal for supporting chemoautotrophic carbon fixation. The position of the process step or steps for the generation of electron donors in the general process flow of the present invention is illustrated in FIG. 1 by the box 2. labeled “Electron Donor Generation”. Electron donors produced in the present invention using electrochemical and/or thermochemical processes known in the art of chemical engineering and/or generated from natural sources include but are not limited to one or more of the following: ammonia; ammonium; carbon monoxide; dithionite; elemental sulfur; hydrocarbons; hydrogen; metabisulfites; nitric oxide; nitrites; sulfates such as thiosulfates including but not limited to sodium thiosulfate or calcium thiosulfate; sulfides such as hydrogen sulfide; sulfites; thionate; thionite; transition metals or their sulfides, oxides, chalcogenides, halides, hydroxides, oxyhydroxides, sulfates, or carbonates, in soluble or solid phases; as well as valence or conduction electrons in solid state electrode materials. Certain embodiments of the present invention use molecular hydrogen as electron donor. Hydrogen electron donor may be generated by methods known in to art of chemical and process engineering including but not limited to more or more of the following: through electrolysis of water including but not limited to approaches using Proton Exchange Membranes (PEM), liquid electrolytes such as KOH, high-pressure electrolysis, high temperature electrolysis of steam (HTES); thermochemical splitting of water through methods including but not limited to the iron oxide cycle, cerium(IV) oxide-cerium(III) oxide cycle, zinc zinc-oxide cycle, sulfur-iodine cycle, copper-chlorine cycle, calcium-bromine-iron cycle, hybrid sulfur cycle; electrolysis of hydrogen sulfide; thermochemical splitting of hydrogen sulfide; other electrochemical or thermochemical processes known to produce hydrogen with low- or no-carbon dioxide emissions including but not limited to: carbon capture and sequestration enabled methane reforming; carbon capture and sequestration enabled coal gasification; the Kværner-process and other processes generating a carbon-black product; carbon capture and sequestration enabled gasification or pyrolysis of biomass; and the half-cell reduction of H+ to H2 accompanied by the half-cell oxidization of electron sources including but not limited to ferrous iron (Fe2+) oxidized to ferric iron (Fe3+) or the oxidation of sulfur compounds whereby the oxidized iron or sulfur can be recycled to back to a reduced state through additional chemical reaction with minerals including but not limited to metal sulfides, hydrogen sulfide, or hydrocarbons. Certain embodiments of the present invention utilize electrochemical energy stored in solid-state valence or conduction electrons within an electrode or capacitor or related devices, alone or in combination with chemical electron donors and/or electron mediators to provide the chemoautotrophs electron donors for the chemosynthetic reactions by means of direct exposure of said electrode materials to the chemoautotrophic culturing environment. Certain embodiments of the present invention that use electrical power for the generation of electron donors, receive the electrical power from carbon dioxide emission-free or low-carbon emission and/or renewable sources of power in the production of electron donors including but not limited to one or more of the following: photovoltaics, solar thermal, wind power, hydroelectric, nuclear, geothermal, enhanced geothermal, ocean thermal, ocean wave power, tidal power. A feature of certain embodiments of the present invention regards the production, or recycling of electron donors generated from mineralogical origin including but not limited electron donors generated from reduced S and Fe containing minerals. Hence the present invention, in certain embodiments, enables the use of a largely untapped source of energy—inorganic geochemical energy. There are large deposits of sulfide minerals that could be used for this purpose located in all the continents and particularly in regions of Africa, Asia, Australia, Canada, Eastern Europe, South America, and the USA. Geological sources of S and Fe such as hydrogen sulfide and pyrite, constitute a relatively inert and sizable pool of S and Fe in the respective natural cycles of sulfur and iron. Sulfides can be found in igneous rocks as well as sedimentary rocks or conglomerates. In some cases sulfides constitute the valuable part of a mineral ore, in other cases such as with coal, oil, methane, or precious metals the sulfides are considered to be impurities. In the case of fossil fuels, regulations such as Clean Air Act require the removal of sulfur impurities to prevent sulfur dioxide emissions. The use of inorganic geochemical energy facilitated by certain embodiments of the present invention appears to be largely unprecedented, and hence the present invention represents a novel alternative energy technology. The electron donors used in the present invention may be refined from natural mineralogical sources which include but are not limited to one or more of the following: elemental Fe0; siderite (FeCO3); magnetite (Fe3O4); pyrite or marcasite (FeS2), pyrrhotite (Fe(1-x)S (x=0 to 0.2), pentlandite (Fe,Ni)9S8, violarite (Ni2FeS4), bravoite (Ni,Fe)S2, arsenopyrite (FeAsS), or other iron sulfides; realgar (AsS); orpiment (As2S3); cobaltite (CoAsS); rhodochrosite (MnCO3); chalcopyrite (CuFeS2), bornite (Cu5FeS4), covellite (CuS), tetrahedrite (Cu8Sb2S7), enargite (Cu3AsS4), tennantite (Cu12As4.S13), chalcocite (Cu2S), or other copper sulfides; sphalerite (ZnS), marmatite (ZnS), or other zinc sulfides; galena (PbS), geocronite (Pb5(Sb,As2)S8), or other lead sulfides; argentite or acanthite (Ag2S); molybdenite (MoS2); millerite (NiS), polydymite (Ni3S4) or other nickel sulfides; antimonite (Sb2S3); Ga2S3; CuSe; cooperite (PtS); laurite (RuS2); braggite (Pt,Pd,Ni)S; FeCl2. The generation of electron donor from natural mineralogical sources includes a preprocessing step in certain embodiments of the present invention which can include but is not limited to comminuting, crushing or grinding mineral ore to increase the surface area for leaching with equipment such as a ball mill and wetting the mineral ore to make a slurry. In these embodiments of the present invention where electron donors are generated from natural mineral sources, it may be advantageous if particle size is controlled so that the sulfide and/or other reducing agents present in the ore may be concentrated by methods known to the art including but not limited to: flotation methods such as dissolved air flotation or froth flotation using flotation columns or mechanical flotation cells; gravity separation; magnetic separation; heavy media separation; selective agglomeration; water separation; or fractional distillation. After the production of crushed ore or slurry, the particulate matter in the leachate or concentrate may be separated by filtering (e.g. vacuum filtering), settling, or other well known techniques of solid/liquid separation, prior to introducing the electron donor containing solution to the chemoautotrophic culture environment. In addition anything toxic to the chemoautotrophs that is leached from the mineral ore may be removed prior to exposing the chemoautotrophs to the leachate. The solid left after processing the mineral ore may be concentrated with a filter press, disposed of, retained for further processing, or sold depending upon the mineral ore used in the particular embodiment of the invention. The electron donors in the present invention may also be refined from pollutants or waste products including but are not limited to one or more of the following: process gas; tail gas; enhanced oil recovery vent gas; biogas; acid mine drainage; landfill leachate; landfill gas; geothermal gas; geothermal sludge or brine; metal contaminants; gangue; tailings; sulfides; disulfides; mercaptans including but not limited to methyl and dimethyl mercaptan, ethyl mercaptan; carbonyl sulfide; carbon disulfide; alkanesulfonates; dialkyl sulfides; thiosulfate; thiofurans; thiocyanates; isothiocyanates; thioureas; thiols; thiophenols; thioethers; thiophene; dibenzothiophene; tetrathionate; dithionite; thionate; dialkyl disulfides; sulfones; sulfoxides; sulfolanes; sulfonic acid; dimethyl sulfoniopropionate; sulfonic esters; hydrogen sulfide; sulfate esters; organic sulfur; sulfur dioxide and all other sour gases. In addition to mineralogical sources, electron donors are produced or recycled in certain embodiments of the present invention through chemical reactions with hydrocarbons that may be of fossil origin, but which are used in chemical reactions producing low or zero carbon dioxide gas emissions. These reactions include thermochemical and electrochemical processes. Such chemical reactions that are used in these embodiments of the present invention include but are not limited to: the thermochemical reduction of sulfate reaction or TSR and the Muller-Kuhne reaction; methane reforming-like reactions utilizing metal oxides in place of water such as but not limited to iron oxide, calcium oxide, or magnesium oxide whereby the hydrocarbon is reacted to form solid carbonate with little or no emissions of carbon dioxide gas along with hydrogen electron donor product. The reaction formula for TSR is CaSO4+CH4→CaCO3+H2O+H2S. In this case the electron donor product that can be used by chemoautotrophic microorganisms for CO2 fixation is hydrogen sulfide (H2S) or the H2S can by further reacted electrochemically or thermochemically to produce H2S electron donor using processes known in the art of chemical engineering. The solid carbonate product (CaCO3) also formed in the TSR can be easily sequestered and applied to a number of different applications, resulting in essentially no release of carbon dioxide into the atmosphere. There are similar reactions reducing sulfate to sulfide that involve longer chain hydrocarbons including short- and long-chain alkanes and complex aliphatic and aromatic compounds [Changtao Yue, Shuyuan Li, Kangle Ding, Ningning Zhong, Thermodynamics and kinetics of reactions between C1-C3 hydrocarbons and calcium sulfate in deep carbonate reservoirs, Geochem. Jour., 2006, 87-94]. The Muller-Kuhne reaction formula is 2C+4CaSO4→2CaO+2CaCO3+4SO2. The SO2 produced can be further reacted with S and a base including but not limited to lime, magnesium oxide, iron oxide, or some other metal oxide to produce an electron donor such as thiosulfate (S2O3 2−) usable by chemoautotrophs. In certain embodiments, the base used in the reaction to form (S2O3 2−) is produced from a carbon dioxide emission-free source such as natural sources of basic minerals including but not limited to calcium oxide, magnesium oxide, olivine containing a metal oxide, serpentine containing a metal oxide, ultramafic deposits containing metal oxides, and underground basic saline aquifers. For embodiments of the present invention using variations of the TSR or Muller-Kuhne, hydrocarbons sources may be utilized which have little or no current economic value such as tar sand or oil shale. Examples of reactions between metal oxides and hydrocarbons to produce a hydrogen electron donor product and carbonates include but are not limited to 2CH4+Fe2O3+3H2O→2FeCO3+7H2 or CH4+CaO+2H2O→CaCO3+4H2. Since reactions like the TSR are exothermic, for embodiments of the present invention that utilize the TSR for electron donor generation heat energy released by the TSR may be recovered using heat exchange methods known in the art of process engineering, to improve the efficiency of the overall process. One embodiment of the invention uses heat released by the TSR as a heat source for maintaining the proper bioreactor temperature or drying the biomass. In certain embodiments, the generated electron donors are oxidized in the chemosynthetic reaction step or steps by electron acceptors that include but are not limited to one or more of the following: carbon dioxide, ferric iron or other transition metal ions, nitrates, nitrites, oxygen, sulfates, or holes in solid state electrode materials. The position of the chemosynthetic reaction step or steps in the general process flow of the present invention is illustrated in FIG. 1 by the box 3. labeled “Chemoautotroph bioreactor”. At each step in the process where chemosynthetic reactions occur one or more types of electron donor and one or more types of electron acceptor may be pumped or otherwise added to the reaction vessel as either a bolus addition, or periodically, or continuously to the nutrient medium containing chemoautotrophic organisms. The chemosynthetic reaction driven by the transfer of electrons from electron donor to electron acceptor fixes inorganic carbon dioxide into organic compounds and biomass. In certain embodiments of the present invention electron mediators may be included in the nutrient medium to facilitate the delivery of reducing equivalents from electron donors to chemoautotrophic organisms in the presence of electron acceptors and inorganic carbon in order to kinetically enhance the chemosynthetic reaction step. This aspect of the present invention is particularly applicable to embodiments of the present invention using poorly soluble electron donors such as but not limited to H2 gas or electrons in solid state electrode materials. The delivery of reducing equivalents from electron donors to the chemoautotrophic organisms for the chemosynthetic reaction or reactions can be kinetically and/or thermodynamically enhanced in the present invention through means including but not limited to: the introduction of hydrogen storage materials into the chemoautotrophic culture environment that can double as a solid support media for microbial growth—bringing absorbed or adsorbed hydrogen electron donors into close proximity with the hydrogen-oxidizing chemoautotrophs; the introduction of electron mediators known in the art such as but not limited to cytochromes, formate, methyl-viologen, NAD+/NADH, neutral red (NR), and quinones into the chemoautotrophic culture media; the introduction of electrode materials that can double as a solid growth support media directly into the chemoautotrophic culture environment—bringing solid state electrons into close proximity with the microbes. The culture broth used in the chemosynthetic steps of certain embodiments of the present invention may be an aqueous solution containing suitable minerals, salts, vitamins, cofactors, buffers, and other components needed for microbial growth, known to those skilled in the art [Bailey and Ollis, Biochemical Engineering Fundamentals, 2nd ed; pp 383-384 and 620-622; McGraw-Hill: New York (1986)]. These nutrients can be chosen to facilitate or maximize chemoautotrophic growth and promote the chemosynthetic enzymatic pathways. Alternative growth environments such as used in the arts of solid state or non-aqueous fermentation may be used in certain embodiments. In certain embodiments that utilize an aqueous culture broth, salt water, sea water, or other non-potable sources of water are used when tolerated by the chemoautotrophic organisms. The chemosynthetic pathways may be controlled and optimized in certain embodiments of the present invention for the production of chemical products and/or biomass by maintaining specific growth conditions (e.g. levels of nitrogen, oxygen, phosphorous, sulfur, trace micronutrients such as inorganic ions, and if present any regulatory molecules that might not generally be considered a nutrient or energy source). Depending upon the embodiment of the invention the broth may be maintained in aerobic, microaerobic, anoxic, anaerobic, or facultative conditions depending upon the requirements of the chemoautotrophic organisms and the desired products to be created by the chemosynthetic process. A facultative environment is considered to be one having aerobic upper layers and anaerobic lower layers caused by stratification of the water column. The source of inorganic carbon used in the chemosynthetic reaction process steps of certain embodiments of the present invention includes but is not limited to one or more of the following: a carbon dioxide-containing gas stream that may be pure or a mixture; liquefied CO2; dry ice; dissolved carbon dioxide, carbonate ion, or bicarbonate ion in solutions including aqueous solutions such as sea water; inorganic carbon in a solid form such as a carbonate or bicarbonate minerals. Carbon dioxide and/or other forms of inorganic carbon may be introduced to the nutrient medium contained in reaction vessels either as a bolus addition or periodically or continuously at the steps in the process where chemosynthesis occurs. In certain embodiments of the present invention, carbon dioxide containing flue gases are captured from the smoke stack at temperature, pressure, and gas composition characteristic of the untreated exhaust, and directed with minimal modification into the reaction vessel(s) where chemosynthesis occurs. Particularly for embodiments where impurities harmful to chemoautotrophic organisms are not present in the flue gas, modification of the flue gas upon entering the reaction vessels may be substantially limited to compression needed to pump the gas through the reactor system and heat exchange needed to lower the gas temperature to one suitable for the microorganisms. Gases in addition to carbon dioxide that are dissolved into the culture broth of certain embodiments of the present invention may include gaseous electron donors in certain embodiments such as but not limited to hydrogen, carbon monoxide, hydrogen sulfide or other sour gases; and for certain aerobic embodiments of the present invention, oxygen electron acceptor, generally from air (e.g. 20.9% oxygen): The dissolution of these and other gases into solution may be achieved using a system of compressors, flowmeters, and flow valves known to one of skilled in the art of bioreactor scale microbial culturing, that feed into one of more of the following widely used systems for pumping gas into solution: sparging equipment; diffusers including but not limited to dome, tubular, disc, or doughnut geometries; coarse or fine bubble aerators; venturi equipment. In certain embodiments of the present invention surface aeration may also be performed using paddle aerators and the like. In certain embodiments of the present invention gas dissolution is enhanced by mechanical mixing with an impeller or turbine, as well as hydraulic shear devices to reduce bubble size. Following passage through the reactor system holding chemoautotrophic microorganisms which capture the carbon dioxide, the scrubbed flue gas, which is generally comprised primarily of inert gases such as nitrogen, may be released into the atmosphere. In certain embodiments of the present invention utilizing hydrogen as electron donor, hydrogen gas is fed to the chemoautotrophic bioreactor either by bubbling it through the culture medium, or by diffusing it through a membrane that bounds the culture medium. The latter method may be safer in certain cases, since hydrogen accumulating in the gas phase can potentially create explosive conditions (the range of explosive hydrogen concentrations in air is 4 to 74.5% and may be avoided in certain embodiments of the present invention). In certain aerobic embodiments of the present invention that require the pumping of air or oxygen into the culture broth in order to maintain oxygenated levels, oxygen bubbles are injected into the broth at an appropriate or optimal diameter for mixing and oxygen transfer. In one exemplary embodiment, the average diameter of the oxygen bubbles is selected to be about 2 mm, which has been found to be optimal in certain cases [Environment Research Journal May/June 1999 pgs. 307-315]. In certain aerobic embodiments of the present invention a process of shearing the oxygen bubbles is used to achieve this bubble diameter as described in U.S. Pat. No. 7,332,077. In certain embodiments, bubble size is controlled to yield values a no larger than 7.5 mm average diameter without substantial slugging. Additional chemicals to facilitate chemoautotrophic maintenance and growth as known in the art may be added to the culture broth of certain embodiments of the present invention. The concentrations of nutrient chemicals, and particularly the electron donors and acceptors, may be maintained as close as possible to their respective optimal levels for maximum chemoautotrophic growth and/or carbon uptake and fixation and/or production of organic compounds, which varies depending upon the chemoautotrophic species utilized but is known or determinable without undue experimentation to one of skilled in the art of culturing chemoautotrophs. Along with nutrient levels, the waste product levels, pH, temperature, salinity, dissolved oxygen and carbon dioxide, gas and liquid flow rates, agitation rate, and pressure in the chemoautotrophic culture environment may be controlled in certain embodiments of the present invention as well. The operating parameters affecting chemoautotrophic growth may be monitored with sensors (e.g. dissolved oxygen probe or oxidation-reduction probe to gauge electron donor/acceptor concentrations), and controlled either manually or automatically based upon feedback from sensors through the use of equipment including but not limited to actuating valves, pumps, and agitators. The temperature of the incoming broth as well as incoming gases may be regulated by unit operations such as but not limited to heat exchangers. Agitation of the culture broth in certain embodiments of the present invention may be provided for mixing and may be accomplished by equipment including but not limited to: recirculation of broth from the bottom of the container to the top via a recirculation conduit; sparging with carbon dioxide plus in certain embodiments electron donor gas (e.g. H2 or H2S), and for certain aerobic embodiments of the present invention oxygen or air as well; a mechanical mixer such as but not limited to an impeller (100-1000 rpm) or turbine. In certain embodiments, the chemoautotrophic microorganism containing nutrient medium is removed from the chemosynthetic reactors partially or completely, periodically or continuously, and is replaced with fresh cell-free medium to maintain the cell culture in exponential growth phase and/or replenish the depleted nutrients in the growth medium and/or remove inhibitory waste products. The production of useful chemical products through the chemosynthetic reaction step or steps reacting electron donors and acceptors to fix carbon dioxide is a feature of certain embodiments of the present invention. These useful chemical products, both organic and inorganic, can include but are not limited to one or more of the following: acetic acid, other organic acids and salts of organic acids, ethanol, butanol, methane, hydrogen, hydrocarbons, sulfuric acid, sulfate salts, elemental sulfur, sulfides, nitrates, ferric iron and other transition metal ions, other salts, acids or bases. Optimizing the production of a desired chemical product of chemosynthesis may be achieved in certain embodiments of the present invention through control of the parameters in the chemoautotrophic culture environment including but not limited to: nutrient levels, waste levels, pH, temperature, salinity, dissolved oxygen and carbon dioxide, gas and liquid flow rates, agitation rate, and pressure The high growth rate of certain chemoautotrophic species enables them to equal or even surpass the highest rates of carbon fixation, and biomass production per standing unit biomass attainable by photosynthetic microbes. Consequently the production of surplus biomass is a feature of certain embodiments of the present invention. Surplus growth of cell mass may be removed from the system to produce a biomass product, and in order to maintain an optimal microbial population and cell density in the chemoautotrophic culture for continued high carbon capture and fixation rates. Another feature of certain embodiments of the present invention is the vessels used to contain the chemosynthetic reaction environment in the carbon capture and fixation process. The types of culture vessels that can be used in the present invention to culture and grow the chemoautotrophic bacteria for carbon dioxide capture and fixation are generally known in the art of large scale microbial culturing. These culture vessels, which may be of natural or artificial origin, include but are not limited to: airlift reactors; biological scrubber columns; bioreactors; bubble columns; caverns; caves; cisterns; continuous stirred tank reactors; counter-current, upflow, expanded-bed reactors; digesters and in particular digester systems such as known in the prior arts of sewage and waste water treatment or bioremediation; filters including but not limited to trickling filters, rotating biological contactor filters, rotating discs, soil filters; fluidized bed reactors; gas lift fermenters; immobilized cell reactors; lagoons; membrane biofilm reactors; mine shafts; pachuca tanks; packed-bed reactors; plug-flow reactors; ponds; pools; quarries; reservoirs; static mixers; tanks; towers; trickle bed reactors; vats; wells—with the vessel base, siding, walls, lining, or top constructed out of one or more materials including but not limited to bitumen, cement, ceramics, clay, concrete, epoxy, fiberglass, glass, macadam, plastics, sand, sealant, soil, steels or other metals and their alloys, stone, tar, wood, and any combination thereof. In embodiments of the present invention where the chemoautotrophic microorganisms either require a corrosive growth environment and/or produce corrosive chemicals through the chemosynthetic metabolism corrosion resistant materials may be used to line the interior of the container contacting the growth medium. Certain embodiments of the present invention will minimize material costs by using chemosynthetic vessel geometries having a low surface area to volume ratio, such as but not limited to substantially cubic, cylindrical shapes with medium aspect ratio, substantially ellipsoidal or “egg-shaped”, substantially hemispherical, or substantially spherical shapes, unless material costs are superseded by other design considerations (e.g. land footprint size). The ability to use compact reactor geometries is enabled by the absence of a light requirement for chemosynthetic reactions, in contrast to photosynthetic technologies where the surface area to volume ratio must be large to provide sufficient light exposure. The chemoautotrophs lack of dependence on light also can allow plant designs with a much smaller footprint than photosynthetic approaches allow. In situations where the plant footprint needs to be minimized due to restricted land availability, certain embodiments of the present invention may use a long vertical shaft bioreactor system for chemoautotrophic growth and carbon capture. A bioreactor of the long vertical shaft type is described in U.S. Pat. Nos. 4,279,754, 5,645,726, 5,650,070, and 7,332,077. Unless superseded by other considerations, certain embodiments of the present invention may advantageously minimize vessel surfaces across which high losses of water, nutrients, and/or heat may occur, or which potentially permit the introduction of invasive predators into the reactor. The ability to minimize such surfaces, in certain embodiments, is enabled by the lack of light requirements for chemosynthesis. In certain embodiments of the present invention the chemoautotrophic microorganisms are immobilized within their growth environment. This may be accomplished using any suitable media known in the art of microbial culturing to support colonization by chemoautotrophic microorganisms including but not limited to growing the chemoautotrophs on a matrix, mesh, or membrane made from any of a wide range of natural and synthetic materials and polymers including but not limited to one or more of the following: glass wool, clay, concrete, wood fiber, inorganic oxides such as ZrO2, Sb2O3, or Al2O3, the organic polymer polysulfone, or open-pore polyurethane foam having high specific surface area. The chemoautotrophic microorganisms in the present invention may also be grown on the surfaces of unattached objects distributed throughout the growth container as are known in the art of microbial culturing that include but are not limited to one or more of the following: beads; sand; silicates; sepiolite; glass; ceramics; small diameter plastic discs, spheres, tubes, particles, or other shapes known in the art; shredded coconut hulls; ground corn cobs; activated charcoal; granulated coal; crushed coral; sponge balls; suspended media; bits of small diameter rubber (elastomeric) polyethylene tubing; hanging strings of porous fabric, Berl saddles, Raschig rings. Inoculation of the chemoautotrophic culture into the culture vessel, in certain embodiments, may be performed by methods including but not limited to transfer of culture from an existing chemoautotrophic culture inhabiting another carbon capture and fixation system of the present invention, or incubation from a seed stock raised in an incubator. The seed stock of chemoautotrophic strains, in certain embodiments, may be transported and stored in forms including but not limited to a powder, liquid, frozen, or freeze-dried form as well as any other suitable form, which may be readily recognized by one skilled in the art. When establishing a culture in a very large reactor it may be advantageous in certain cases to grow and establish cultures in progressively larger intermediate scale containers prior to inoculation of the full scale vessel. The position of the process step or steps for the separation of cell mass from the process stream in the general process flow of the embodiment of the present invention illustrated in FIG. 1 is shown by the box 4. labeled “Cell Separation”. Separation of cell mass from liquid suspension in certain embodiments of the present invention can be performed by methods known in the art of microbial culturing [Examples of cell mass harvesting techniques are given in International Patent Application No. WO08/00558, published Jan. 8, 1998; U.S. Pat. No. 5,807,722; U.S. Pat. No. 5,593,886 and U.S. Pat. No. 5,821,111.] including but not limited to one or more of the following: centrifugation; flocculation; flotation; filtration using a membranous, hollow fiber, spiral wound, or ceramic filter system; vacuum filtration; tangential flow filtration; clarification; settling; hydrocyclone. In embodiments where the cell mass is immobilized on a matrix it may be harvested by methods including but not limited to gravity sedimentation or filtration, and separated from the growth substrate by liquid shear forces. In certain embodiments of the present invention, if an excess of cell mass has been removed from the culture, it is recycled back into the cell culture as indicated by the process arrow labeled “Recycled Cell Mass” in FIG. 1., along with fresh broth such that sufficient biomass is retained in the chemosynthetic reaction step or steps for continued optimal inorganic carbon uptake and growth or metabolic rate. The cell mass recovered by the harvesting system may be recycled back into the culture vessel using, for example, an airlift or geyser pump. In certain embodiments, the cell mass recycled back into the culture vessel has not been exposed to flocculating agents, unless those agents are non-toxic to the chemoautotrophs. In certain embodiments of the present invention the chemoautotrophic system is maintained, using continuous influx and removal of nutrient medium and/or biomass, in substantially steady state where the cell population and environmental parameters (e.g. cell density, chemical concentrations) are targeted at a substantially constant suitable or optimal level over time. Cell densities may be monitored in certain embodiments of the present invention either by direct sampling, by a correlation of optical density to cell density, or with a particle size analyzer. The hydraulic and biomass retention times can be decoupled so as to allow independent control of both the broth chemistry and the cell density in certain embodiments. Dilution rates may be kept high enough so that the hydraulic retention time is relatively low compared to the biomass retention time, resulting in a highly replenished broth for cell growth. Dilution rates may be set at an appropriate or optimal trade-off between culture broth replenishment, and increased process costs from pumping, increased inputs, and other demands that rise with dilution rates. To assist in the processing of the biomass product into biofuels or other useful products, the surplus microbial cells in certain embodiments of the invention are broken open following the the cell separation step using methods including but not limited to ball milling, cavitation pressure, sonication, or mechanical shearing. The harvested biomass in certain embodiments of the present invention is dried in the process step or steps of box 7. labeled “Dryer” in the general process flow illustrated in FIG. 1. Surplus biomass drying may be performed in certain embodiments of the present invention using technologies including but not limited to centrifugation, drum drying, evaporation, freeze drying, heating, spray drying, vacuum drying, vacuum filtration. Heat waste from the industrial source of flue gas may be used in drying the biomass in certain embodiments. In addition the chemosynthetic oxidation of electron donors is exothermic and generally produces waste heat. In certain embodiments of the present invention waste heat can be used in drying the biomass. In certain embodiments of the invention, the biomass is further processed following drying to aid the production of biofuels or other useful chemicals through the separation of the lipid content or other targeted biochemicals from the chemoautotrophic biomass. The separation of the lipids may be performed by using nonpolar solvents to extract the lipids such as, but not limited to, hexane, cyclohexane, ethyl ether, alcohol (isopropanol, ethanol, etc.), tributyl phosphate, supercritical carbon dioxide, trioctylphosphine oxide, secondary and tertiary amines, or propane. Other useful biochemicals may be extracted in certain embodiments using solvents including but not limited to: chloroform, acetone, ethyl acetate, and tetrachloroethylene. The broth left over following the removal of cell mass may be pumped to a system for removal of the products of chemosynthesis and/or spent nutrients which may be recycled or recovered to the extent possible, or else disposed of. The position of the process step or steps for the recovery of chemical products from the process stream in the general process flow of the embodiment of present invention illustrated in FIG. 1 is indicated by the box 6. labeled “Separation of chemical products”. Recovery and/or recycling of chemosynthetic chemical products and/or spent nutrients from the aqueous broth solution may be accomplished in certain embodiments of the present invention using equipment and techniques known in the art of process engineering, and targeted towards the chemical products of particular embodiments of the present invention, including but not limited to: solvent extraction; water extraction; distillation; fractional distillation; cementation; chemical precipitation; alkaline solution absorption; absorption or adsorption on activated carbon, ion-exchange resin or molecular sieve; modification of the solution pH and/or oxidation-reduction potential, evaporators, fractional crystallizers, solid/liquid separators, nanofiltration, and all combinations thereof. Following the recovery of useful or valuable products from the process stream, according to certain embodiments, the removal of the waste products may be performed as indicated by the box 8. labeled “Waste removal” in FIG. 1. The remaining broth may be returned to the culture vessel along with replacement water and nutrients, if desired [see the process arrow labeled “Recycled H2O+nutrients” in FIG. 1]. In embodiments of the present invention involving chemoautotrophic oxidization of electron donors extracted from the mineral ore, there will in certain embodiments remain a solution of oxidized metal cations following the chemosynthetic reaction steps. A solution rich in dissolved metal cations can also result from a particularly dirty flue gas input to the process such as from a coal fired plant. In certain of these embodiment of the present invention the process stream may be stripped of metal cations by methods including but not limited to: cementation on scrap iron, steel wool, copper or zinc dust; chemical precipitation as a sulfide or hydroxide precipitate; electrowinning to plate a specific metal; absorption on activated carbon or an ion-exchange resin, modification of the solution pH and/or oxidation-reduction potential, solvent extraction. In certain embodiments of the present invention the recovered metals can be sold for an additional stream of revenue. Chemicals that are used in processes for the recovery of chemical products, the recycling of nutrients and water, and the removal of waste, may advantageously be selected in certain embodiments to have low toxicity for humans, and if exposed to the process stream that is recycled back into the growth container, low toxicity for the chemoautotrophs being used. In certain embodiments of the present invention there is an acid co-product of chemosynthesis. Neutralization of acid in the broth can be accomplished in certain embodiments by the addition of bases including but not limited to: limestone, lime, sodium hydroxide, ammonia, caustic potash, magnesium oxide, iron oxide. In certain embodiments, the base may be produced from a carbon dioxide emission-free source such as naturally occurring basic minerals including but not limited to calcium oxide, magnesium oxide, iron oxide, iron ore, olivine containing a metal oxide, serpentine containing a metal oxide, ultramafic deposits containing metal oxides, and underground basic saline aquifers. In addition to carbon dioxide captured through the chemosynthetic fixation of carbon, additional carbon dioxide can be captured and converted to carbonates or biominerals through the catalytic action of chemoautotrophic microorganisms in certain embodiments of the present invention. For embodiments of the invention that augment the carbon captured through chemosynthesis with biocatalyzed mineral carbon sequestration, the use of chemoautotrophic microorganisms capable of withstanding a high pH solution where carbon dioxide is thermodynamically favored to precipitate as carbonate may be advantageous in certain cases. Any carbonate or biomineral precipitate produced may be removed periodically or continuously from the system using, for example, solid/liquid separation techniques known in the art of process engineering. An additional feature of certain embodiments of the present invention relates to the uses of chemical products generated through the chemo synthetic carbon capture and fixation process of certain embodiments of the invention. The chemical products of certain embodiments of the present invention can be applied to uses including but not limited to one or more of the following: as biofuel; as feedstock for the production of biofuels; in the production of fertilizers; as a leaching agent for the chemical extraction of metals in mining or bioremediation; as chemicals reagents in industrial or mining processes. An additional feature of certain embodiments of the present invention relates to the uses of biochemicals or biomass produced through the chemosynthetic process step or steps of certain embodiments of the present invention. Uses of the biomass product include but are not limited to: as a biomass fuel for combustion in particular as a fuel to be co-fired with fossil fuels such as coal in pulverized coal powered generation units; as a carbon source for large scale fermentations to produce produce various chemicals including but not limited to commercial enzymes, antibiotics, amino acids, vitamins, bioplastics, glycerol, or 1,3-propanediol; as a nutrient source for the growth of other microbes or organisms; as feed for animals including but not limited to cattle, sheep, chickens, pigs, or fish; as feed stock for alcohol or other biofuel fermentation and/or gasification and liquefaction processes including but not limited to direct liquefaction, Fisher Tropsch processes, methanol synthesis, pyrolysis, transesterification, or microbial syngas conversions, for the production of liquid fuel; as feed stock for methane or biogas production; as fertilizer; as raw material for manufacturing or chemical processes such as but not limited to the production of biodegradable/biocompatible plastics; as sources of pharmaceutical, medicinal or nutritional substances; soil additives and soil stabilizers. An additional feature of certain embodiments of the present invention relates to the optimization of chemoautotrophic organisms for carbon dioxide capture, carbon fixation into organic compounds, and the production of other valuable chemical co-products. This optimization can occur through or including methods known in the art of artificial breeding including but not limited to accelerated mutagenesis (e.g. using ultraviolet light or chemical treatments), genetic engineering or modification, hybridization, synthetic biology or traditional selective breeding. For embodiments of the present invention utilizing a consortium of chemoautotrophs, the community can be enriched with desirable organisms using methods known in the art of microbiology through growth in the presence of target electron donors, acceptors, and environmental conditions. An additional feature of certain embodiments of the present invention relates to modifying biochemical pathways in chemoautotrophs for the production of targeted organic compounds. This modification can be accomplished, for example, by manipulating the growth environment, or through methods known in the art of artificial breeding including but not limited to accelerated mutagenesis (e.g. using ultraviolet light or chemical treatments), genetic engineering or modification, hybridization, synthetic biology or traditional selective breeding. The organic compounds produced through the modification may include but are not limited to: biofuels including but not limited to biodiesel or renewable diesel, ethanol, gasoline, long chain hydrocarbons, methane and pseudovegetable oil produced from biological reactions in vivo; or organic compounds or biomass optimized as a feedstock for biofuel and/or liquid fuel production through chemical processes. In order to give specific examples of the overall biological and chemical process for using chemoautotrophic microorganisms to capture CO2 and produce biomass and other useful co-products, a number of process flow diagrams describing various embodiments of the present invention are now described. These specific examples should not be construed as limiting the present invention in any way and are provided for the sole purpose of illustration. FIG. 2 is process flow diagram for an exemplary embodiment of the present invention for the capture of CO2 by hydrogen oxidizing chemoautotrophs and production of ethanol. A carbon dioxide rich flue gas is captured from an emission source such as a power plant, refinery, or cement producer. The flue gas is then compressed and pumped into cylindrical anaerobic digesters containing one or more hydrogen oxidizing acetogenic chemoautotrophs such as but not limited to Acetoanaerobium noterae, Acetobacterium woodii, Acetogenium kivui, Butyribacterium methylotrophicum, Butyribacterium rettgeri, Clostridium aceticum, Clostridium acetobutylicum, Clostridium acidi-urici, Clostridium autoethanogenum, Clostridium carboxidivorans, Clostridium formicoaceticum, Clostridium kluyveri, Clostridium ljungdahlii, Clostridium thermoaceticum, Clostridium thermoautotrophicum, Clostridium thermohydrosulfuricum, Clostridium thermosaccharolyticum, Clostridium thermocellum, Eubacterium limosum, Peptostreptococcus productus. Hydrogen electron donor is added continuously to the growth broth along with other nutrients required for chemoautotrophic growth and maintenance that are pumped into the digester. In certain embodiments, the hydrogen source is a carbon dioxide emission-free process. This could be electrolytic or thermochemical processes powered by energy technologies including but not limited to photovoltaics, solar thermal, wind power, hydroelectric, nuclear, geothermal, enhanced geothermal, ocean thermal, ocean wave power, tidal power. Carbon dioxide serves as an electron acceptor in the chemosynthetic reaction. The culture broth is continuously removed from the digesters and flowed through membrane filters to separate the cell mass from the broth. The cell mass is then either recycled back into the digesters or pumped to driers depending upon the cell density in the digesters which is monitored by a controller. Cell mass directed to the dryers is then centrifuged and dried with evaporation. The dry biomass product is collected from the dryers. Cell-free broth which has passed through the cell mass removing filters is directed to vessels where the ethanol product is distilled and put through a molecular sieve to produce anhydrous ethanol using standard techniques known in the art of distillation. The broth left over after distillation is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. The remaining water and nutrients are then pumped back into the digesters. A process model is given in FIGS. 3, 4 and 5 for the embodiment of FIG. 2. The mass balance, enthalpy flow, energy balance, and plant economics have been calculated for this [R. K. Sinnott, Chemical Engineering Design volume 6, 4th ed. (Elsevier Butterworth-Heinemann, Oxford, 2005)] preferred embodiment for the present invention. The model was developed using established results in the scientific literature for the H2 oxidizing acetogens and for the process steps known from the art of chemical engineering. The inputs for the model regarding microorganism performance taken from the scientific literature [Gaddy, James L., et al. “Methods for increasing the production of ethanol from microbial fermentation”. U.S. Pat. No. 7,285,402. Oct. 23 2007; Lewis, Randy S., et al. “Indirect or direct fermentation of biomass to fuel alcohol”. US Patent Application 20070275447. Nov. 29 2007; Heiskanen, H., Virkajarvi, I., Viikari, L., 2007: The effect of syngas composition on the growth and product formation of Butyribacterium methylotrophicum. 41: 362-367] for acetogenic microorganisms were as follows: 1) stoichiometry of chemosynthetic reaction producing ethanol: 3H2+CO2→0.5C2H5OH+1.5H2O; 2) conversion of H2 each pass through bioreactor: 83%; 3) stoichiometry of acetic acid side reaction: 2H2+CO2→0.5C2H5OH+H2O; 4) Cell growth rate in plateau phase steady state ˜0; 5) percent of fixed carbon going to ethanol during steady state: 99.99%; 6) growth medium concentration of ethanol at steady state: 10 grams/liter; 7) ethanol productivity at steady state: 10 grams/liter/day; 8) concentration of acetic acid at steady state: 2 grams/liter; 9) cell mass concentration at steady state: 1.5 grams/liter. The mass balance indicates that 1 ton of ethanol will be produced for every 2 tons of CO2 pumped into the system. This amounts to over 150 gallons of ethanol produced per ton of CO2 intake. The energy balance indicates that for every 1 GJ of H2 chemical energy input there is 0.8 GJ of ethanol chemical energy out, i.e. the chemical conversion is expected to be around 80% efficient. Overall efficiency of ethanol production from H2 and CO2 including electric power and process heat is predicted with the model to be about 50%. FIG. 6 is process flow diagram for an exemplary embodiment involving the capture of CO2 by sulfur oxidizing chemoautotrophs and production of biomass and gypsum. A carbon dioxide rich flue gas is captured from an emission source such as a power plant, refinery, or cement producer. The flue gas is then compressed and pumped into cylindrical aerobic digesters containing one or more sulfur oxidizing chemoautotrophs such as but not limited to Thiomicrospira crunogena, Thiomicrospira strain MA-3, Thiomicrospira thermophila, Thiobacillus hydrothermalis, Thiomicrospira sp. strain CVO, Thiobacillus neapolitanus, Arcobacter sp. strain FWKO B. One or more electron donors such as but not limited to thiosulfate, hydrogen sulfide, or sulfur are added continuously to the growth broth along with other nutrients required for chemoautotrophic growth and air is pumped into the digester to provide oxygen as an electron acceptor. The culture broth is continuously removed from the digesters and flowed through membrane filters to separate the cell mass from the broth. The cell mass is then either recycled back into the digesters or pumped to driers depending upon the cell density in the digesters which is monitored by a controller. Cell mass directed to the dryers is then centrifuged and dried with evaporation. The dry biomass product is collected from the dryers. Cell-free broth which has passed through the cell mass removing filters is directed to vessels where the sulfuric acid produced by the chemosynthetic metabolism is neutralized with lime, precipitating out gypsum (CaSO4). The lime may be produced in certain embodiments by a carbon dioxide emission-free process rather than through the heating of limestone. Such carbon dioxide emission-free processes include the recovery of natural sources of basic minerals including but not limited to minerals containing a metal oxide, serpentine containing a metal oxide, ultramafic deposits containing metal oxides, and underground basic saline aquifers. Alternative bases may be used for neutralization in this process including but not limited to magnesium oxide, iron oxide, or some other metal oxide. The gypsum is removed by solid-liquid separation techniques and pumped to dryers. The final product is dried gypsum. The broth left over after the sulfate is precipitated out is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. The remaining water and nutrients are then pumped back into the digesters. FIG. 7 is process flow diagram for an exemplary embodiment involving the capture of CO2 by sulfur oxidizing chemoautotrophs and production of biomass and sulfuric acid and calcium carbonate via the Muller-Kuhne reaction. A carbon dioxide rich flue gas is captured from an emission source such as a power plant, refinery, or cement producer. The flue gas is then compressed and pumped into cylindrical aerobic digesters containing one or more sulfur oxidizing chemoautotrophs such as but not limited to Thiomicrospira crunogena, Thiomicrospira strain MA-3, Thiomicrospira thermophila, Thiobacillus hydrothermalis, Thiomicrospira sp. strain CVO, Thiobacillus neapolitanus, Arcobacter sp. strain FWKO B. One or more electron donors such as but not limited to thiosulfate, hydrogen sulfide, or sulfur are added continuously to the growth broth along with other nutrients required for chemoautotrophic growth and air is pumped into the digester to provide oxygen as an electron acceptor. The culture broth is continuously removed from the digesters and flowed through membrane filters to separate the cell mass from the broth. The cell mass is then either recycled back into the digesters or pumped to driers depending upon the cell density in the digesters which is monitored by a controller. Cell mass directed to the dryers is then centrifuged and dried with evaporation. The dry biomass product is collected from the dryers. Cell-free broth which has passed through the cell mass removing filters is directed to vessels where the sulfuric acid produced by the chemosynthetic metabolism is neutralized with lime (CaO), precipitating out gypsum (CaSO4). The lime may be produced in certain embodiments by a carbon dioxide emission-free process rather than through the heating of limestone. Such carbon dioxide emission-free processes include the recovery of natural sources of basic minerals including but not limited to minerals containing a metal oxide, iron ore, serpentine containing a metal oxide, ultramafic deposits containing metal oxides, and underground basic saline aquifers. Alternative bases may be used for neutralization in this process including but not limited to magnesium oxide, iron oxide, or some other metal oxide. The gypsum is removed by solid-liquid separation techniques and pumped to kilns where the Muller-Kuhne process is carried out with the addition of coal. The net reaction for the Muller-Kuhne process is as follows 2C+4CaSO4→2CaO+2CaCO3+4SO2. The produced CaCO3 is collected and the CaO is recycled for further neutralization. The SO2 gas produced is directed to a reactor for the contact process where sulfuric acid is produced. The broth left over after the sulfate is precipitated out is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. The remaining water and nutrients are then pumped back into the digesters. FIG. 8 is a process flow diagram for an exemplary embodiment involving the capture of CO2 by sulfur oxidizing chemoautotrophs and production of biomass and calcium carbonate and recycling of thiosulfate electron donor via the Muller-Kuhne reaction. A carbon dioxide rich flue gas is captured from an emission source such as a power plant, refinery, or cement producer. The flue gas is then compressed and pumped into cylindrical aerobic digesters containing one or more sulfur oxidizing chemoautotrophs such as but not limited to Thiomicrospira crunogena, Thiomicrospira strain MA-3, Thiomicrospira thermophila, Thiobacillus hydrothermalis, Thiomicrospira sp. strain CVO, Thiobacillus neapolitanus, Arcobacter sp. strain FWKO B. Calcium thiosulfate is the electron donor added continuously to the growth broth along with other nutrients required for chemoautotrophic growth and air is pumped into the digester to provide oxygen as an electron acceptor. The culture broth is continuously removed from the digesters and flowed through membrane filters to separate the cell mass from the broth. The cell mass is then either recycled back into the digesters or pumped to driers depending upon the cell density in the digesters which is monitored by a controller. Cell mass directed to the dryers is then centrifuged and dried with evaporation. The dry biomass product is collected from the dryers. Cell-free broth which has passed through the cell mass removing filters is directed to vessels where the sulfuric acid produced by the chemosynthetic metabolism is neutralized with lime (CaO), precipitating out gypsum (CaSO4). The lime may be produced in certain embodiments by a carbon dioxide emission-free process rather than through the heating of limestone. Such carbon dioxide emission-free processes include the recovery of natural sources of basic minerals including but not limited to minerals containing a metal oxide, serpentine containing a metal oxide, ultramafic deposits containing metal oxides, and underground basic saline aquifers. Alternative bases may be used for neutralization in this process including but not limited to magnesium oxide, iron oxide, or some other metal oxide. The gypsum is removed by solid-liquid separation techniques and pumped to kilns where the Muller-Kuhne process is carried out with the addition of coal. The net reaction for the Muller-Kuhne process is as follows 2C+4CaSO4→2CaO+2CaCO3+4SO2. The produced CaCO3 is collected and the CaO is recycled for further reaction. The SO2 gas produced is directed to a reactor where it is reacted with CaO or some other metal oxide such as iron oxide, and sulfur to recycle the thiosulfate (calcium thiosulfate if CaO is used). The broth left over after the sulfate is precipitated out is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. The remaining water and nutrients are then pumped back into the digesters. FIG. 9 is process flow diagram for an exemplary embodiment involving the capture of CO2 by sulfur and iron oxidizing chemoautotrophs and production of biomass and sulfuric acid using an insoluble source of electron donors. A carbon dioxide rich flue gas is captured from an emission source such as a power plant, refinery, or cement producer. The flue gas is then compressed and pumped into one set of cylindrical aerobic digesters containing one or more sulfur oxidizing chemoautotrophs such as but not limited to Thiomicrospira crunogena, Thiomicrospira strain MA-3, Thiomicrospira thermophila, Thiobacillus hydrothermalis, Thiomicrospira sp. strain CVO, Thiobacillus neapolitanus, Arcobacter sp. strain FWKO B, and another set of cylindrical aerobic digesters containing one or more iron oxidizing chemoautotrophs such as but not limited to Leptospirillum ferrooxidans or Thiobacillus ferrooxidans. One or more insoluble sources of electron donors such as but not limited to elemental sulfur, pyrite, or other metal sulfides are sent to a anaerobic reactor for reaction with a ferric iron solution. Optionally chemoautotrophs such as but not limited to Thiobacillus ferrooxidans and Sulfolobus sp. can be present in this reactor to help biocatalyze the attack of the insoluble electron donor source with ferric iron. A leachate of ferrous iron and thiosulfate flow out of the reactor. The ferrous iron is separated out of the process stream by precipitation. The thiosulfate solution is then flowed into the S-oxidizer digesters and the ferrous iron is pumped into the Fe-oxidizer digesters as the electron donor for each type of chemoautotroph respectively. Air and other nutrients required for chemoautotrophic growth are also pumped into the digesters. The culture broth is continuously removed from the digesters and flowed through membrane filters to separate the cell mass from the broth. The cell mass is then either recycled back into the digesters or pumped to driers depending upon the cell density in the digesters which is monitored by a controller. Cell mass directed to the dryers is then centrifuged and dried with evaporation. The dry biomass product is collected from the dryers. In the S-oxidizer process stream the cell-free broth which has passed through the cell mass removing filters is directed to sulfuric acid recovery systems such employed in the refinery or distillery industries where the sulfuric acid product of chemosynthetic metabolism is concentrated. This sulfuric acid concentrate is then concentrated further using the contact process to give a concentrated sulfuric acid product. The broth left over after the sulfate and sulfuric acid have been removed is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. In the Fe-oxidizer process stream the cell-free broth which has passed through the cell mass removing filters is then stripped of ferric iron by precipitation. This ferric iron is then sent back for further reaction with the insoluble source of electron donors (e.g. S, FeS2). The remaining water and nutrients in both process streams are then pumped back into their respective digesters. FIG. 10 is a process flow diagram for an exemplary embodiment involving the capture of CO2 by sulfur and hydrogen oxidizing chemoautotrophs and production of biomass, sulfuric acid, and ethanol using an insoluble source of electron donors. A carbon dioxide rich flue gas is captured from an emission source such as a power plant, refinery, or cement producer. The flue gas is then compressed and pumped into one set of cylindrical aerobic digesters containing one or more sulfur oxidizing chemoautotrophs such as but not limited to Thiomicrospira crunogena, Thiomicrospira strain MA-3, Thiomicrospira thermophila, Thiobacillus hydrothermalis, Thiomicrospira sp. strain CVO, Thiobacillus neapolitanus, Arcobacter sp. strain FWKO B, and another set of cylindrical anaerobic digesters containing one or more hydrogen oxidizing acetogenic chemoautotrophs such as but not limited to Acetoanaerobium noterae, Acetobacterium woodii, Acetogenium kivui, Butyribacterium methylotrophicum, Butyribacterium rettgeri, Clostridium aceticum, Clostridium acetobutylicum, Clostridium acidi-urici, Clostridium autoethanogenum, Clostridium carboxidivorans, Clostridium formicoaceticum, Clostridium kluyveri, Clostridium ljungdahlii, Clostridium thermoaceticum, Clostridium thermoautotrophicum, Clostridium thermohydrosulfuricum, Clostridium thermosaccharolyticum, Clostridium thermocellum, Eubacterium limosum, Peptostreptococcus productus. One or more insoluble sources of electron donors such as but not limited to elemental sulfur, pyrite, or other metal sulfides are sent to an anaerobic reactor for reaction with a ferric iron solution. Optionally chemoautotrophs such as but not limited to Thiobacillus ferrooxidans and Sulfolobus sp. can be present in this reactor to help biocatalyze the attack of the insoluble electron donor source with ferric iron. A leachate of ferrous iron and thiosulfate flow out of the reactor. The ferrous iron is separated out of the process stream by precipitation. The thiosulfate solution is then flowed into the S-oxidizer digesters as an electron donor and the ferrous iron is pumped into an anaerobic electrolysis reactor. In the electrolysis reactor hydrogen gas is formed by the electrochemical reaction 2H++Fe2+→H2+Fe3+. The open cell voltage for this reaction is 0.77 V which is substantially lower than the open cell voltage for the electrolysis of water (1.23 V). Furthermore the kinetics of the oxidation of ferrous iron to ferric iron is much simpler than that for the reduction of oxygen in water to oxygen gas, hence the overvoltage for the iron reaction is lower. These factors combined provides an energy savings for the production of hydrogen gas by using ferrous iron compared to electrolysis of water. The hydrogen produced is fed into the H-oxidizer digesters as the electron donor. The other nutrients required for chemoautotrophic growth are also pumped into the digesters. The culture broth is continuously removed from the digesters and flowed through membrane filters to separate the cell mass from the broth. The cell mass is then either recycled back into the digesters or pumped to driers depending upon the cell density in the digesters which is monitored by a controller. Cell mass directed to the dryers is then centrifuged and dried with evaporation. The dry biomass product is collected from the dryers. In the S-oxidizer process stream the cell-free broth which has passed through the cell mass removing filters is directed to sulfuric acid recovery systems such as employed in the refinery and distillation industries where the sulfuric acid product of chemosynthetic metabolism is concentrated. This sulfuric acid concentrate is then concentrated further using the contact process to give a concentrated sulfuric acid product. The broth left over after the sulfate and sulfuric acid have been removed is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. In the H-oxidizer process stream the cell-free broth which has passed through the cell mass removing filters is directed to vessels where the acetic acid produced is reacted with ethanol to produce ethyl acetate which is removed from solution by reactive distillation. The ethyl acetate is converted to ethanol by hydrogenation. Part, e.g. half, of the ethanol is recycled for further reaction in the reactive distillation process. The other part is put through a molecular sieve which separates anhydrous ethanol by adsorbtion from dilute ethanol. The anhydrous ethanol is then collected and the dilute ethanol is returned for further reaction in the reactive distillation step. The broth left over after the acetic acid is reactively distilled out is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. The remaining water and nutrients in both process streams are then pumped back into their respective digesters. FIG. 11 is process flow diagram for an exemplary embodiment involving the capture of CO2 by iron and hydrogen oxidizing chemoautotrophs and production of biomass, ferric sulfate, calcium carbonate and ethanol using coal or another hydrocarbon as the energy input for the production of electron donors without the release of gaseous CO2. A carbon dioxide rich flue gas is captured from an emission source such as a power plant, refinery, or cement producer. The flue gas is then compressed and pumped into one set of cylindrical aerobic digesters containing one or more iron oxidizing chemoautotrophs such as but not limited to Leptospirillum ferrooxidans or Thiobacillus ferrooxidans, and another set of cylindrical anaerobic digesters containing one or more hydrogen oxidizing acetogenic chemoautotrophs such as but not limited to Acetoanaerobium noterae, Acetobacterium woodii, Acetogenium kivui, Butyribacterium methylotrophicum, Butyribacterium rettgeri, Clostridium aceticum, Clostridium acetobutylicum, Clostridium acidi-urici, Clostridium autoethanogenum, Clostridium carboxidivorans, Clostridium formicoaceticum, Clostridium kluyveri, Clostridium ljungdahlii, Clostridium thermoaceticum, Clostridium thermoautotrophicum, Clostridium thermohydrosulfuricum, Clostridium thermosaccharolyticum, Clostridium thermocellum, Eubacterium limosum, Peptostreptococcus productus. Hydrogen gas produced by the water shift reaction is fed into the H-oxidizer digesters as the electron donor. Ferrous sulfate synthesized through the reaction of ferrous oxide (FeO), sulfur dioxide and oxygen is pumped into the Fe-oxidizer digesters as the electron donor. The other nutrients required for chemoautotrophic growth are also pumped into the digesters for each respective type of chemoautotroph. The culture broth is continuously removed from the digesters and flowed through membrane filters to separate the cell mass from the broth. The cell mass is then either recycled back into the digesters or pumped to driers depending upon the cell density in the digesters which is monitored by a controller. Cell mass directed to the dryers is then centrifuged and dried with evaporation. The dry biomass product is collected from the dryers. In the Fe-oxidizer process stream the cell-free broth which has passed through the cell mass removing filters is directed to ferric sulfate recovery systems such as employed in the steel industry where the ferric sulfate product of chemosynthetic metabolism is concentrated into a salable product. The broth left over after the sulfate has been removed is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. In the H-oxidizer process stream the cell-free broth which has passed through the cell mass removing filters is directed to vessels where the acetic acid produced is reacted with ethanol to produce ethyl acetate which is removed from solution by reactive distillation. The ethyl acetate is converted to ethanol by hydrogenation. Part, e.g. half, of the ethanol is recycled for further reaction in the reactive distillation process. The other part of the ethanol is put through a molecular sieve which separates anhydrous ethanol by adsorbtion from dilute ethanol. The anhydrous ethanol is then collected and the dilute ethanol is returned for further reaction in the reactive distillation step. The broth left over after the acetic acid is reactively distilled out is then subjected to any desired additional waste removal treatments which depends on the source of flue gas. The remaining water and nutrients in both process streams are then pumped back into their respective digesters. Both the hydrogen gas and ferrous sulfate electron donors are ultimately generated through the oxidation of coal or some other hydrocarbon. The oxidation drives two reactions that occur in parallel, one is the reduction of iron ore (Fe2O3) to ferrous oxide (FeO) accompanied by the release of carbon monoxide which is water shifted to produce hydrogen gas and carbon dioxide, the other is the reduction of gypsum (CaSO4) to sulfur dioxide and quicklime accompanied by the release of carbon dioxide. The carbon dioxide from both process streams is reacted with the quicklime to produce calcium carbonate. In parallel with the production of calcium carbonate is the production of ferrous sulfate through the reaction of ferrous oxide with sulfur dioxide and oxygen. It should be noted that in all of the previously described embodiments with a sulfuric acid product the sulfuric acid may alternatively be neutralized, in certain embodiments with a base that is not a carbonate (so as to not release carbon dioxide in the acid base reaction) and this carbonate may be produced by a carbon dioxide emission-free process. Such bases include but are not limited to natural basic minerals containing a metal oxide, serpentine containing a metal oxide, ultramafic deposits containing metal oxides, underground basic saline aquifers, and naturally occurring calcium oxide, magnesium oxide, iron oxide, or some other metal oxide. The metal sulfate which results from the acid-base reaction may be recovered from the process stream and preferably refined into a salable product, while the water produced by the acid-base reaction may be recycled back into the chemosynthesis reactors. The following example is intended to illustrate certain features or advantages of at least one embodiment of the present invention, but do not exemplify the full scope of the invention. Example A specific working example is provided to demonstrate the carbon capture and fixation capabilities of chemoautotrophic microorganisms that play a central part in the overall carbon capture and fixation process of the present invention. Tests were performed on the sulfur-oxidizing chemoautotroph Thiomicrospira crunogena ATCC #35932 acquired as a freeze dried culture from American Type Culture Collection (ATCC). The organisms were grown on the recommended ATCC medium—the #1422 broth. This broth consisted of the following chemicals dissolved in 1 Liter of distilled water: NaCl, 25.1 g; (NH4)2SO4, 1.0 g; MgSO4.7H2O, 1.5 g; KH2PO4, 0.42 g; NaHCO3, 0.20 g; CaCl2.2H2O, 0.29 g; Tris-hydrochloride buffer, 3.07 g; Na2S2O3.5H2O, 2.48 g; Visniac and Santer Trace Element Solution, 0.2 ml; 0.5% Phenol Red, 1.0 ml; The #1422 broth was adjusted to pH 7.5 and filter-sterilized prior to innoculation. The freeze dried culture of Thiomicrospira crunogena was rehydrated according to the procedure recommended by ATCC and transferred first to a test tube with 5 ml broth #1422 and placed on a shaker. This culture was used to innoculate additional test tubes. NaOH was added as needed to maintain the pH near 7.5. Eventually the cultures were transferred from the test tube to 1 liter flasks filled with 250 ml of #1422 broth and placed in a New Brunswick Scientific Co. shake flask incubator set to 25 Celsius. The determination of growth rate for Thiomicrospira crunogena was performed using the following procedure: 1) Three (1 litre) flasks containing 95 ml ATCC 1422 medium were innoculated with 5 ml of the above cultures diluted to an optical density ˜0.025. Optical densities were determined using a Milton Roy Spectronic 1001 Spectrophotometer; 2) Two ml samples of cultures were withdrawn from each flask from t=0 to t=48 hours at every 2 hour intervals and optical density measured. Optical density was correlated with dry weight weighing twice centrifuged and washed, 1 mL liquid broth oven dried samples in pre-weighed aluminum dishes. From the growth curve is was found that in the exponential phase the doubling time for Thiomicrospira crunogena was one hour. This is about 4 to 6 times shorter doubling time than the fastest growth rates reported for algae in the exponential phase [Sheehan et al, 1998, “A Look Back at the U.S. Department of Energy's Aquatic Species Program—Biodiesel from Algae”]. The cell mass density present in the flask experiments when the microorganisms were in the exponential growth phase reached 0.5 g dry weight/liter, and in the plateau phase the cell mass density reached 1 g dry weight/liter. This indicates that in a continuous system that maintains the culture in the exponential growth state with continuous cell removal, these microorganisms have the potential to produce 12 g dry weight/liter/day of biomass. This is about 4-12 times faster than the highest daily rates of biomass production reported for algae [Valcent, 2007; CNN, 2008]. Furthermore, in a continuous bioreactor substantially higher cell densities should be able to be sustained in the exponential phase than what can be achieved at the flask level with T. crunogena. This experiment supports the far higher rates of carbon fixation that are attainable with chemoautotrophic than photosynthetic microbes. Specific preferred embodiments of the present invention have been described here in sufficient detail to enable those skilled in the art to practice the full scope of invention. However it is to be understood that many possible variations of the present invention, which have not been specifically described, still fall within the scope of the present invention and the appended claims. Hence these descriptions given herein are added only by way of example and are not intended to limit, in any way, the scope of this invention. More generally, those skilled in the art will readily appreciate that all parameters, dimensions, materials, and configurations described herein are meant to be exemplary and that the actual parameters, dimensions, materials, and/or configurations will depend upon the specific application or applications for which the teachings of the present invention is/are used. Those skilled in the art will recognize, or be able to ascertain using no more than routine experimentation, many equivalents to the specific embodiments of the invention described herein. It is, therefore, to be understood that the foregoing embodiments are presented by way of example only and that, within the scope of the appended claims and equivalents thereto, the invention may be practiced otherwise than as specifically described and claimed. The present invention is directed to each individual feature, system, article, material, kit, and/or method described herein. In addition, any combination of two or more such features, systems, articles, materials, kits, and/or methods, if such features, systems, articles, materials, kits, and/or methods are not mutually inconsistent, is included within the scope of the present invention. The indefinite articles “a” and “an,” as used herein in the specification and in the claims, unless clearly indicated to the contrary, should be understood to mean “at least one.” The phrase “and/or,” as used herein in the specification and in the claims, should be understood to mean “either or both” of the elements so conjoined, i.e., elements that are conjunctively present in some cases and disjunctively present in other cases. Other elements may optionally be present other than the elements specifically identified by the “and/or” clause, whether related or unrelated to those elements specifically identified unless clearly indicated to the contrary. Thus, as a non-limiting example, a reference to “A and/or B,” when used in conjunction with open-ended language such as “comprising” can refer, in one embodiment, to A without B (optionally including elements other than B); in another embodiment, to B without A (optionally including elements other than A); in yet another embodiment, to both A and B (optionally including other elements); etc. As used herein in the specification and in the claims, “or” should be understood to have the same meaning as “and/or” as defined above. For example, when separating items in a list, “or” or “and/or” shall be interpreted as being′ inclusive, i.e., the inclusion of at least one, but also including more than one, of a number or list of elements, and, optionally, additional unlisted items. Only terms clearly indicated to the contrary, such as “only one of” or “exactly one of,” or, when used in the claims, “consisting of,” will refer to the inclusion of exactly one element of a number or list of elements. In general, the term “or” as used herein shall only be interpreted as indicating exclusive alternatives (i.e. “one or the other but not both”) when preceded by terms of exclusivity, such as “either,” “one of,” “only one of,” or “exactly one of” “Consisting essentially of,” when used in the claims, shall have its ordinary meaning as used in the field of patent law. In the claims, as well as in the specification above, all transitional phrases such as “comprising,” “including,” “carrying,” “having,” “containing,” “involving,” “holding,” and the like are to be understood to be open-ended, i.e., to mean including but not limited to. Only the transitional phrases “consisting of” and “consisting essentially of” shall be closed or semi-closed transitional phrases, respectively. What is claimed is: 1.-26. (canceled) 27. A biological and chemical process for the capture and conversion of carbon dioxide and/or other sources of inorganic carbon, into organic compounds, comprising: introducing carbon dioxide gas, either alone and/or dissolved in a mixture or solution further comprising carbonate ion and/or bicarbonate ion, and/or introducing inorganic carbon contained in a solid phase into an environment suitable for maintaining chemoautotrophic organisms and/or chemoautotroph cell extracts; and fixing the carbon dioxide and/or inorganic carbon into organic compounds within the environment via at least one chemosynthetic carbon fixing reaction utilizing obligate and/or facultative chemoautotrophic microorganisms; wherein where the chemosynthetic carbon fixing reaction is driven by chemical and/or electrochemical energy provided by electron donors and electron acceptors that have been generated chemically and/or electrochemically and/or or are introduced into the environment from at least one source external to the environment, wherein biomass and/or biochemicals are produced by the at least one chemosynthetic reaction, and wherein the biomass and/or biochemicals are separated from the environment and are processed into a product comprising an animal feed, a fertilizer, a soil additive, a soil stabilizer, a carbon source for large scale fermentations, and/or a nutrient source for the growth of other microbes or organisms. 28. A process according to claim 27, wherein the animal feed product is a feed for cattle, sheep, chickens, pigs, and/or fish. 29. A process according to claim 27, wherein said biomass and/or biochemicals are processed into a carbon source for a large scale fermentation and/or a nutrient source for the growth of other microbes or organisms, wherein said large scale fermentation and/or said other microbes or organisms produce one or more of: commercial enzymes, antibiotics, amino acids, vitamins, and bioplastics. 30. A process according to claim 27, wherein said biomass and/or biochemicals are processed into a nutrient source for the growth of fish. 31. A process according to claim 27, wherein molecular hydrogen acts as an electron donor. 32. A process according to claim 31, wherein said hydrogen is generated through electrolysis of water and/or thermochemical splitting of water. 33. A process according to claim 32, wherein said electrolysis of water comprises at least one of: Proton Exchange Membranes (PEM); a liquid electrolyte; high-pressure electrolysis; and high temperature electrolysis of steam (HTES). 34. A process according to claim 33, wherein said electrolyte comprises potassium hydroxide. 35. A process according to claim 32, wherein said thermochemical splitting of water comprises at least one of: iron oxide cycle; cerium(IV) oxide-cerium(III) oxide cycle; zinc zinc-oxide cycle; sulfur-iodine cycle; copper-chlorine cycle; calcium-bromine-iron cycle; and hybrid sulfur cycle. 36. A process according to claim 31, wherein said hydrogen is generated through one or more of: electrolysis of hydrogen sulfide; thermochemical splitting of hydrogen sulfide; and the half-cell reduction of H+ to H2 accompanied by the half-cell oxidization of electron sources comprising ferrous iron (Fe2+) oxidized to ferric iron (Fe3+ and/or the oxidation of sulfur compounds, wherein the oxidized iron or sulfur is recycled to back to a reduced state through additional chemical reactions with minerals comprising at least one of a metal sulfide, hydrogen sulfide, and a hydrocarbon. 37. A process according to claim 31, wherein said hydrogen is generated through an electrochemical or thermochemical process known to produce hydrogen with low- or no-carbon dioxide emissions, comprising at least one of: carbon capture and sequestration enabled methane reforming; carbon capture and sequestration enabled coal gasification; the Kværner process; a process that generates a carbon-black product; and carbon capture and sequestration enabled gasification or pyrolysis of biomass. 38. A process according to claim 27, wherein said electron donors and/or electron acceptors are generated or recycled using renewable, alternative, or conventional sources of power that are low in greenhouse gas emissions, and wherein said sources of power comprise at least one of: photovoltaic, solar thermal, wind, hydroelectric, nuclear, geothermal, enhanced geothermal, ocean thermal, ocean wave, and tidal power sources. 39. A process according to claim 27, wherein said electron donor comprises one or more of: ammonia; ammonium; carbon monoxide; dithionite; elemental sulfur; a hydrocarbon; hydrogen; a sulfide; a sulfite; a thionate; a thionite; a transition metal and/or its sulfide; an oxide; a chalcogenide; a halide; a hydroside; an oxyhydroxide; a phosphate; a sulfate; a carbonate; and a conduction or valence band electron in a solid state electrode material. 40. A process according to claim 27, wherein said electron donor is generate within or recycled to the environment through non- or low-carbon dioxide emitting chemical reactions with hydrocarbons, comprising one or more of: thermochemical reduction of sulfate reaction (TSR); the Muller-Kuhne reaction for the production of hydrogen sulfide or reduced sulfur; and methane reforming-like reactions utilizing metal oxides in place of water, wherein the metal oxides comprise one or more of: iron oxide, calcium oxide, and magnesium oxide, and wherein the hydrocarbon is reacted to form solid carbonate with little or no emission of carbon dioxide gas along with hydrogen electron donor product. 41. A process according to claim 27, wherein said electron acceptor comprises one or more of: carbon dioxide; oxygen; a nitrite; a nitrate; a transition metal ion; a sulfate; and a valence or conduction band hole in a solid state electrode material. 42. A process according to claim 27, wherein the fixing step is followed by one or more process steps in which unused nutrients and/or process water left after removal of chemoautotrophic cell mass and/or chemical co-products of chemosynthesis and/or waste products or contaminants of the process stream produced during the fixing step are recycled back into a reactor system in which the chemosynthetic carbon fixing reaction is performed to support further chemosynthesis. 43. A process according to claim 27, wherein the chemoautotrophic microorganisms comprise one or more of: Acetoanaerobium sp.; Acetobacterium sp.; Acetogenium sp.; Achromobacter sp.; Acidianus sp.; Acinetobacter sp.; Actinomadura sp.; Aeromonas sp.; Alcaligenes sp.; Arcobacter sp.; Aureobacterium sp.; Bacillus sp.; Beggiatoa sp.; Butyribacyerium sp.; Carboxydothermus sp.; Clostridium sp.; Comamonas sp.; Dehalobacter sp.; Dehalococcoides sp.; Dehalosprillum sp.; Desulfobacterium sp.; Desulfomonile sp.; Desulfotomaculum sp.; Desulfovibrio sp.; Desulfurosarcina sp.; Ectothiorhodospira sp.; Enterobacter sp.; Eubacterium sp.; Ferroplasma sp.; Halothibacillus sp.; Hydrogenbacter sp.; Hydrogenomonas sp.; Leptospirillum sp.; Metallosphaera sp.; Methanobacterium sp.; Methanobrevibacter sp.; Methanococcus sp.; Methanosarcina sp.; Micrococcus sp.; Nitrobacter sp.; Nitrosococcus sp.; Nitrosolobus sp.; Nitrosomonas sp.; Nitrosospira sp.; Nitrosovibrio sp.; Nitrospina sp.; Oleomonas sp.; Paracoccus sp.; Peptostreptococcus sp.; Planctomycetes sp.; Pseudomonas sp.; Ralstonia sp.; Rhodobacter sp.; Rhodococcus sp.; Rhodocyclus sp.; Rhodomicrobium sp.; Rhodopseudomonas sp.; Rhodospirillum sp.; Shewanella sp.; Streptomyces sp.; Sulfobacillus sp.; Sulfolobus sp.; Thiobacillus sp.; Thiomicrospira sp.; Thioploca sp.; Thiosphaera sp.; Thiothrix sp.; sulfur-oxidizer; hydrogen-oxidizers; iron-oxidizers; acetogens; methanogens; consortiums of microorganism that include chemoautotrophs; chemoautotrophs native to at least one of hydrothermal vents, geothermal vents, hot springs, cold seeps, underground aquifers, salt lakes, saline formations, mines, acid mine drainage, mine tailings, oil wells, refinery wastewater, coal seams, deep sub-surface, waste water and sewage treatment plants, geothermal power plants, sulfatara fields, and soils; and extremophiles selected from one or more of thermophiles, hyperthermophiles, acidophiles, halophiles, and psychrophiles. 44. A process according to claim 27, wherein said at least one chemosynthetic carbon fixing reaction is performed by chemoautotrophic microorganisms that have been improved, optimized or engineered for the fixation of carbon dioxide and/or other forms of inorganic carbon and the production of organic compounds. 45. A process according to claim 27, wherein said electron donor is generated from pollutants or waste products selected from one or more of: process gas; tail gas; enhanced oil recovery vent gas; biogas; acid mine drainage; landfill leachate; landfill gas; geothermal gas; geothermal sludge or brine; metal contaminants; gangue; tailings; sulfides; disulfides; mercaptans selected from one or more of methyl mercaptan, dimethyl mercaptan, and ethyl mercaptan; carbonyl sulfide; carbon disulfide; alkanesulfonates dialkyl sulfides; thiosulfate; thiofurans; thiocyanates; isothiocyanates; thioureas; thiols; thiophenols; thioethers; thiophene; dibenzothiophene; tetrathionate; dithioite; thionate; dialkyl disulfides; sulfones; sulfoxides; sulfolanes; sulfonic acid; dimethylsulfoniopropionate; sulfonic esters; hydrogen sulfide; sulfate esters; organic sulfur; and sour gases. 46. A process according to claim 27, wherein delivery of reducing equivalents from the electron donor to the chemoautotrophic microorganisms for the chemosynthetic reaction during the fixing step is kinetically and/or thermodynamically enhanced by one or more of: introduction of hydrogen storage materials into the environment in the form of a solid support media for microbial growth that facilitates bringing absorbed or adsorbed hydrogen electron donors into close proximity with the chemoautotrophic organisms; introduction of electron mediators comprising one or more of: cytochromes, formate methyl-viologen, NAD+/NADH, neutral red (NR), and quinones to help transfer reducing power from a poorly soluble electron donor comprising H2 gas or electrons in solid state electrode materials into chemoautotrophic culture media in the environment; and introduction of electrode materials in the form of a solid growth support media directly into the environment to facilitate bringing solid state electrons into close proximity with the chemoautotrophic microorganisms. 47. A process according to claim 27, wherein said environment comprises a bioreactor, and wherein said microorganisms are maintained in a culture medium in said bioreactor. 48. A process according to claim 47, wherein said bioreactor is formed at least in part by a microbial culture apparatus selected from: an airlift reactor; a biological scrubber column; a bubble column; a continuous stirred tank reactor; a counter-current, upflow, expanded-bed reactor; a digestor for a sewage and/or waste water treatment or bioremediation system; one or more filters; a fluidized bed reactor; a gas lift fermenter; an immobilized cell reactor; a membrane biofilm reactor; a mine shaft; a Pachuca tank; a packed-bed reactor; a plug-flow reactor; a static mixer; a tank; a trickle bed reactor; a vat; and/or a vertical shaft bioreactor. 49. A process according to claim 27, further comprising prior to the fixing step, a step of reacting carbon dioxide with minerals to form a carbonate or bicarbonate product, which is then used in the fixing step. 50. A process according to claim 27, comprising fixing the carbon dioxide and/or inorganic carbon into the organic compounds via at least one chemosynthetic carbon fixing reaction within a reactor system, wherein the electron donor utilized in the chemosynthetic carbon fixing reaction is produced via a non-biological process in the reactor system. 51. A process according to claim 27, wherein the chemosynthetic microorganisms are obligate anaerobes. 52. A process for the capture and conversion of carbon dioxide and/or other sources of inorganic carbon, into organic compounds, comprising: introducing a carbon source in the form of flue gas comprising carbon dioxide and/or in the form of an aqueous solution comprising inorganic carbon into an environment in a bioreactor that is suitable for maintaining chemoautotrophic microorganisms; introducing an electron donor that is separate from the carbon source into the environment in the bioreactor; fixing the carbon dioxide in the flue gas and/or inorganic carbon in the aqueous solution into the organic compounds within the environment in the bioreactor via at least one chemosynthetic carbon fixing reaction utilizing chemoautotrophic microorganisms and using at least one electron donor and at least one electron acceptor; and wherein said electron donor and/or said electron acceptor are generated and/or refined from at least one inorganic chemical, wherein said electron donor is generated separately from the carbon source and externally to the bioreactor using a renewable, alternative, or low CO2 emission power source, wherein said electron donor is molecular hydrogen that is generated using said power source, through electrolysis of water, wherein biomass and/or biochemicals are produced by the at least one chemosynthetic reaction, and wherein the biomass and/or biochemicals are separated from the environment and are processed into a product comprising an animal feed, a fertilizer, a soil additive, a soil stabilizer, a carbon source for large scale fermentations, and/or a nutrient source for the growth of other microbes or organisms. 53. A process according to claim 52, wherein the process for capture and conversion of carbon dioxide or inorganic carbon results in a net reduction of gaseous CO2 released to the atmosphere. 54. A process according to claim 52, wherein the animal feed product is a feed for cattle, sheep, chickens, pigs, and/or fish. 55. A process according to claim 52, wherein said biomass and/or biochemicals are processed into a carbon source for a large scale fermentation and/or a nutrient source for the growth of other microbes or organisms, wherein said large scale fermentation and/or said other microbes or organisms produce one or more of: commercial enzymes, antibiotics, amino acids, vitamins, and bioplastics. 56. A process according to claim 52, wherein said biomass and/or biochemicals are processed into a nutrient source for the growth of fish.

2018-02-19

en

2018-06-28

US-44655703-A

Image display apparatus and method, transmitting apparatus and method, image display system, recording medium, and program ABSTRACT In an image display system, optical beacons are arranged to become vertices of a rectangle on a wall. An external image is transformed in accordance with the shape of an external image display area defined by the optical beacons on an image capturing area. Subsequently, the external image is merged with the external image display area and the merged image is displayed. The position at which the external image display area is displayed is changed in accordance with the movement of an image display unit and the movement of the image capturing area. BACKGROUND OF THE INVENTION [0001] The present invention relates to image display apparatuses and methods, transmitting apparatuses and methods, image display systems, recording media, and programs. More particularly, the present invention relates to an image display apparatus and method, a transmitting apparatus and method, an image display system, a recording medium, and a program for displaying an image as if it were displayed on an object in real space. Nowadays, large-screen television sets and projectors are used to enable viewers to appreciate television broadcast images with high realism and impressive quality. Since these products are expensive and large and occupy a large amount of space, these products are not widely used among users who do not have enough space available. There is an increasing demand for television sets that enable users to appreciate television broadcast images with high realism and impressive quality even in a small space. [0002] In response to this demand, an apparatus is proposed that displays a video image on a head mounted display (HMD), thus enabling the user to feel as if a large display were provided before the user's eyes. The HMD is an eyeglass-like display. The user wears this eyeglass-like display as if wearing eyeglasses and becomes able to experience an impressive sense of realism just as if the images were displayed on a large display. Since the HMD is an eyeglass-like display, the user can view displayed images in any posture. [0003] The above-described HMD only displays predetermined images and cannot display images responsive to the HMD's movement. For example, if the user moves his/her head, the image displayed on the HMD is unresponsive to the movement of the head (the image does not change even when the head moves). Since the same image is displayed on the left and right eyeglasses, the user cannot perceive a sense of distance based on parallax. As a result, the HMD only makes the user feel as if a small display, whose size is equivalent to a pair of eyeglasses, is provided before the user's eyes, rather than making the user feel as if the user were looking at a large-screen display. Therefore, the user may think that the HMD fails to provide high realism and impressive quality. [0004] The user wearing the HMD (looking at images displayed on the HMD) is isolated from the external world since the display portions cover the user's eyes. As a result, the user may feel as if he or she were confined in a small and enclosed space. In view of this, a system has been proposed where a display is provided with a “see-through” or transparent portion enabling the user to see the external world. Since an image is displayed at the center of such a display, there is almost no transparent portion to see the external world. Therefore, this system does not provide much of an improvement. [0005] Technology referred to as augmented reality (AR) has been proposed. AR merges an image captured by a camera aligned with the user's view with another image to create a merged image in which the directions and positions of the two images are matched with each other. Using AR, an image of a large screen is captured as an image in real space, and a desired image is merged with the captured screen image, thus representing the desired image as if it were displayed on a large screen. [0006] This method involves arranging beforehand three or more markers defining three-dimensional positions in an image captured by a camera that is aligned with the user's view. Therefore, preliminary calibration involving measuring the positions of the given markers is necessary. AR technology thus cannot actually be applied to domestic use. SUMMARY OF THE INVENTION [0007] Accordingly, it is an object of the present invention to display an image with high realism and impressive quality by displaying the image as if it were displayed on a portion in real space. [0008] According to an aspect of the present invention, an image display apparatus is provided including an image capturing unit for capturing an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detector for detecting the image-captured positions of the plurality of transmitting apparatuses, the image being captured by the image capturing unit; an input unit for inputting a first image; a transformer for transforming the first image on the basis of the image-captured positions of the transmitting apparatuses, the image-captured positions being detected by the detector; and a display unit for displaying the first image transformed by the transformer at a display position associated with the image-captured positions of the transmitting apparatuses. [0009] The image display apparatus may further include an analyzer for analyzing the data included in the predetermined flashing patterns emitted by the plurality of transmitting apparatuses. The data may include link data, content data, or group data indicating a group to which the plurality of transmitting apparatuses belong. The link data may include a link target on a network, at which information on the first information resides. [0010] The image display apparatus may further include an obtaining unit for accessing the link target included in the link data and obtaining the first image. The content data may include information on the first image. The input unit may input the first image included in the content data. [0011] The transformer may transform the first image on the basis of the captured-image positions of four transmitting apparatuses including the same group data. When the first image is a quadrilateral, the display unit may display the first image transformed by the transformer at the display position so that four corners of the first image are associated with the image-captured positions of the four transmitting apparatuses. The image capturing unit may capture a second image, in addition to the image of the plurality of transmitting apparatuses emitting light in the predetermined flashing patterns to transmit the data. [0012] The image display apparatus may further include a merged image generator for merging the second image with the first image transformed by the transformer and generating a merged image. The display unit may display the merged image so that the first image included in the merged image is displayed at the display position associated with the image-captured positions of the transmitting apparatuses. [0013] The display unit may include a transparent screen; and a light-shielded-area generator for generating a light-shielded area at the display position associated with the image-captured positions of the transmitting apparatuses on the screen. The first image transformed by the transformer may be displayed in the light-shielded area. [0014] The image-capturing unit, the input unit, the transformer, and the display unit may be provided in pairs for the human eyes. The refresh rate of the image-capturing unit may be higher than the refresh rate of the display unit. The transformer may transform the first image by projective transformation based on the image-captured positions of the transmitting apparatuses. [0015] According to another aspect of the present invention, an image display method is provided including an image capturing step of capturing an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detection step of detecting the image-captured positions of the plurality of transmitting apparatuses, the image being captured in the image capturing step; an input step of inputting a first image; a transformation step of transforming the first image on the basis of the image-captured positions of the transmitting apparatuses, the image-captured positions being detected in the detection step; and a display step of displaying the first image transformed in the transformation step at a display position associated with the image-captured positions of the transmitting apparatuses. [0016] According to a further aspect of the present invention, a first recording medium having recorded thereon a program is provided. The program includes an image capturing control step of controlling capturing of an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detection control step of controlling detection of the image-captured positions of the plurality of transmitting apparatuses, the image capturing being controlled in the image capturing control step; an input control step of controlling inputting of a first image; a transformation control step of controlling transformation of the first image on the basis of the image-captured positions of the transmitting apparatuses, the detection of the image-captured positions being controlled in the detection control step; and a display control step of controlling displaying of the transformed first image, whose transformation is controlled in the transformation control step, at a display position associated with the image-captured positions of the transmitting apparatuses. [0017] According to yet another aspect of the present invention, a program for causing a computer to perform a process is provided. The process includes an image capturing control step of controlling capturing of an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detection control step of controlling detection of the image-captured positions of the plurality of transmitting apparatuses, the image capturing being controlled in the image capturing control step; an input control step of controlling inputting of a first image; a transformation control step of controlling transformation of the first image on the basis of the image-captured positions of the transmitting apparatuses, the detection of the image-captured positions being controlled in the detection control step; and a display control step of controlling displaying of the transformed first image, whose transformation is controlled in the transformation control step, at a display position associated with the image-captured positions of the transmitting apparatuses. [0018] According to another aspect of the present invention, a transmitting apparatus is provided including a pattern generator for generating a predetermined flashing pattern associated with data; and a light-emitting unit for emitting light in the predetermined flashing pattern generated by the pattern generator. The data may include link data, content data, or group data indicating a group to which the transmitting apparatus belongs. The link data may include a link target on a network, at which information on an image displayed on an image display apparatus resides. The content data may include information on an image displayed on an image display apparatus. [0019] According to a further aspect of the present invention, a transmitting method is provided including a pattern generating step of generating a predetermined flashing pattern associated with data; and a light-emitting step of emitting light in the predetermined flashing pattern generated in the pattern generating step. [0020] According to yet another aspect of the present invention, a second recording medium having recorded thereon a program is provided. The program includes a pattern generation control step of controlling generation of a predetermined flashing pattern associated with data; and a light-emission control step of controlling emission of light in the predetermined flashing pattern generated in the pattern generation control step. [0021] According to another aspect of the present invention, a program for causing a computer to perform a process is provided. The process includes a pattern generation control step of controlling generation of a predetermined flashing pattern associated with data; and a light-emission control step of controlling emission of light in the predetermined flashing pattern generated in the pattern generation control step. [0022] According to a further aspect of the present invention, an image display system is provided including an image display apparatus and a transmitting apparatus. The image display apparatus includes an image capturing unit for capturing an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detector for detecting the image-captured positions of the plurality of transmitting apparatuses, the image being captured by the image capturing unit; an input unit for inputting an image; a transformer for transforming the image on the basis of the image-captured positions of the transmitting apparatuses, the image-captured positions being detected by the detector; and a display unit for displaying the image transformed by the transformer at a display position associated with the image-captured positions of the transmitting apparatuses. The transmitting apparatus includes a pattern generator for generating the predetermined flashing pattern associated with the data; and a light-emitting unit for emitting light in the predetermined flashing pattern generated by the pattern generator. [0023] According to an image display apparatus and method and a program therefor of the present invention, an image of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data is captured.. The image-captured positions of the transmitting apparatuses are detected. A first image is input. The first image is transformed on the basis of the image-captured positions of the transmitting apparatuses. The transformed first image is displayed at a display position associated with the image-captured positions of the transmitting apparatuses. [0024] According to a transmitting apparatus and method and a program therefor of the present invention, a predetermined flashing pattern associated with data is generated. Light is emitted in the generated predetermined flashing pattern. [0025] According to an image display system of the present invention, an image display apparatus captures an image of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data, detects the image-captured positions of the plurality of transmitting apparatuses, inputs an image, transforms the image on the basis of the detected image-captured positions of the transmitting apparatuses, and displays the transformed image at a display position associated with the image-captured positions of the transmitting apparatuses. Each of the transmitting apparatuses generates the predetermined flashing pattern associated with the data and emits light in the generated predetermined flashing pattern. [0026] According to the present invention, an external image is merged and displayed on a captured image as if the image were displayed on a surface of an object in real space. [0027] Additional features and advantages of the present invention are described in, and will be apparent from, the following Detailed Description of the Invention and the figures. BRIEF DESCRIPTION OF THE DRAWINGS [0028]FIG. 1 is a block diagram of an image merging display system according to an embodiment of the present invention; [0029]FIG. 2 is a block diagram of an ID recognizing camera shown in FIG. 1; [0030]FIG. 3 is a block diagram of an image decoding processor shown in FIG. 2; [0031]FIG. 4 is a block diagram of an ID decoding processor shown in FIG. 2; [0032]FIG. 5 is a block diagram of an optical beacon shown in FIG. 1; [0033]FIG. 6 is a block diagram of the optical beacon shown in FIG. 1; [0034]FIG. 7 is a diagram for describing the operation of the ID recognizing camera; [0035]FIG. 8 is a diagram for describing the operation of the ID recognizing camera generating an image signal; [0036]FIG. 9 is a diagram for describing the operation of the ID recognizing camera generating the image signal; [0037]FIG. 10 is an illustration for describing the operation of the ID recognizing camera decoding a flashing pattern; [0038]FIG. 11 is a flowchart of an image merging display process; [0039]FIG. 12 is a flowchart of an image transforming process; [0040]FIG. 13 is an illustration of the image transforming process; [0041]FIG. 14 is an illustration of the image transforming process; [0042]FIG. 15 is an illustration of the image transforming process; [0043]FIG. 16 is an illustration of an image merging process; [0044]FIG. 17 is an illustration of an HMD using image merging display apparatuses; [0045]FIG. 18 is a block diagram of another configuration of the image merging display apparatus; [0046]FIG. 19 is an illustration of an example in which optical beacons are arranged on a curved surface of a vase; [0047]FIG. 20 is an illustration of the optical beacon arrangement and parameters of an external image; [0048]FIG. 21 is an illustration of the external image; [0049]FIG. 22 is a flowchart of the image merging display process; [0050]FIG. 23 is an illustration of an example in which the external image is merged and displayed; [0051]FIG. 24 is a block diagram of another configuration of the image merging display apparatus; [0052]FIG. 25 is a flowchart of the image merging display process; [0053]FIG. 26 is an illustration of an example in which a plurality of external images are merged and displayed; [0054]FIG. 27 is a diagram showing media; and [0055]FIG. 28 is a diagram showing media. DESCRIPTION OF THE PREFERRED EMBODIMENTS [0056]FIG. 1 is a block diagram of the configuration of an image merging display system according to an embodiment of the present invention. The image merging display system includes an image merging display apparatus 1 and optical beacons 2-1 to 2-4. [0057] When the image merging display apparatus 1 of the image merging display system captures an image of an image capturing area (an area that becomes an actually displayed image) including the optical beacons 2-1 to 2-4, the image merging display apparatus 1 recognizes an external image display area 4 defined by the optical beacons 2-1 to 2-4 on the image capturing area 3, transforms an external image so as to fit the external image display area 4, merges the external image with the image capturing area 3, and finally displays the resultant image on an image display unit 15. In other words, the image merging display apparatus 1 uses the external image display area 4 defined by the optical beacons 2-1 to 2-4 in real space, as if the external image display area 4 were a screen arranged in real space, and merges an external image with a captured image to display a merged image. [0058] The optical beacons 2-1 to 2-4 transmit data by emitting light using predetermined light-emitting patterns. The data is referred to as ID data for discriminating among the optical beacons 2-1 to 2-4. Since the data capacity that can be transferred by the optical beacons 2-1 to 2-4 provides some extra space, the optical beacons 2-1 to 2-4 can transmit additional data. For example, the ID data can include content data (image data, audio data, text data, or the like), link target data (URL (Uniform Resource Locator), address, host name, or the like), and group identifying data for identifying a group to which each of the optical beacons 2-1 to 2-4 belongs. The ID data is not limited to the above-described types of data. The optical beacons 2-1 to 2-4 can transmit any data that can be handled as electronic data. As discussed above, the optical beacons 2-1 to 2-4 can transmit not only the ID data but also various types of data by changing the light-emitting patterns. [0059] The group identifying data for identifying a group to which each of the optical beacons 2-1 to 2-4 belongs will now be described. For example, referring to FIG. 1, there is only one external image display area 4. If there is a plurality of external image display areas, a set of the plural optical beacons 2 defining the individual external image display area 4 is referred to as a group, and data for identifying the group is referred to as the group identifying data. In this case, the optical beacons 2-1 to 2-4 belong to the same group, and the same group identifying data is thus transmitted. A case in which a plurality of external images is displayed will be described later. It is assumed that the optical beacons 2-1 to 2-4 are arranged to form the vertices of a rectangle on a wall 5. [0060] In the following description, when it is unnecessary to distinguish among the optical beacons 2-1 to 2-4, they are collectively referred to as the optical beacons 2. The same applies to the other components. An ID (Identifier) recognizing camera 11 and the optical beacons 2 will be described later with reference to FIGS. 2 to 10. [0061] The configuration of the image merging display apparatus 1 will now be described. The ID recognizing camera 11 outputs image data generated by capturing an image of the above-described image capturing area 3 to an image merger 14, generates ID data and position data from the light-emitting patterns emitted from the captured optical beacons 2 (whose image has been captured), and outputs the ID data to a link target data analyzer 16 and an ID image converter 20 and the image-captured position data to a display position obtaining unit 12. The display position obtaining unit 12 obtains the position data indicating the positions of the optical beacons 2-1 to 2-4 in the image capturing area 3 and outputs the positions as displayed position information on the external image display area 4 to an image transformer 13. [0062] Of the data transmitted along with the light-emitting patterns of the optical beacons 2, the link target data analyzer 16 analyzes the ID data and, if the ID data includes link target data, the link target data analyzer 16 extracts the link target data and outputs the link target data to a link target image obtaining unit 17. [0063] The link target image obtaining unit 17 includes, for example, a modem. The link target image obtaining unit 17 accesses a link target via a network (not shown), such as the Internet, on the basis of the link target data received from the link target data analyzer 16, obtains an external image stored at the link target, and outputs the obtained external image to an external image input unit 18. [0064] When the ID data includes an external image serving as content data, the ID image converter 20 converts the ID data into the external image (extracts the external image from the ID data) and outputs the external image to the external image input unit 18. A storage unit 19 stores a pre-received external image and supplies the stored external image to the external image input unit 18. [0065] The external image input unit 18 reads the external image designated by the user by operating an input unit 21, the designated external image being one of the external image obtained from the link target, the external image included in the ID data received from the ID image converter 20, and the external image stored in the storage unit 19, and outputs the external image to the image transformer 13. [0066] The image transformer 13 appropriately uses a memory 13 a and obtains the shape of the external image display area 4 (the shape on a captured image) from the image-captured positions of the optical beacons 2-1 to 2-4, which are received from the display position obtaining unit 12, transforms the external image received from the external image input unit 18 so as to fit the obtained shape, and outputs the transformed external image to the image merger 14. [0067] The image merger 14 merges an image captured by the ID recognizing camera 11 (image of the image capturing area 3) with the transformed external image, that is, merges the transformed external image, which is transformed to fit the external image display area 4, with the captured image of the image capturing area 3, outputs the resultant image to the image display unit 15, and displays the resultant image. [0068] Referring to FIG. 2, the detailed configuration of the ID recognizing camera 11 will now be described. A light receiving section 41 of an image sensor 31 performs photoelectric conversion of light from the image capturing area 3, an image of which is to be captured, into an electrical signal and outputs the electrical signal to an arithmetic unit 42. A light receiving element 51 of the light receiving section 41 includes a CMOS (Complementary Metal-Oxide Semiconductor) element and operates at a higher speed than a known CCD (Charge Coupled Device) element. More specifically, the light receiving element 51 performs photoelectric conversion of light from the image capturing area 3, an image of which is to be captured, and outputs the resultant electrical signal to an amplifier 52. The amplifier 52 amplifies the electrical signal, which is generated by photoelectric conversion and received from the light receiving element 51, and outputs the amplified signal to the arithmetic unit 42. [0069] A storage unit 61 of the arithmetic unit 42 stores the amplified electrical signal, which is received from the light receiving section 41, and appropriately outputs the electrical signal to a comparator 62. The comparator 62 performs an arithmetic operation based on the value of the electrical signal stored in the storage unit 61, compares the operation result with a predetermined reference value (=reference signal level), and outputs the comparison result to an output unit 63. The output unit 63 generates a sensor output signal on the basis of the comparison result and outputs the sensor output signal to a data generator 32. The content of the processing by the arithmetic unit 42 differs in two operation modes, namely, an image mode and an ID mode. The content of the processing in two different operation modes will be described in detail below. [0070] In the image mode, an image decoding processor 71 of the data generator 32 decodes the sensor output signal to generate a captured image and outputs the captured image to the image merger 14. In the ID mode, an ID decoding processor 72 decodes the sensor output signal to generate ID data and position data and outputs the ID data to the link data analyzer 16 and the ID image converter 20 and the position data to the display position obtaining unit 12. [0071] Referring to FIG. 3, the detailed configuration of the image decoding processor 71 will now be described. A pixel value determining unit 81 of the image decoding processor 71 determines a pixel value on the basis of the sensor output signal and stores the determined pixel value at a corresponding pixel position in a frame memory 82. The frame memory 82 stores pixel values over one frame. The frame memory 82 stores the pixel value at each pixel position. When the pixel values over one frame are stored in the frame memory 82, an output unit 83 sequentially reads and outputs the pixel values as pixel data. [0072] Referring to FIG. 4, the detailed configuration of the ID decoding processor 72 will now be described. An ID decoder circuit 111 of an ID decoder 101 includes devices, such as an IC (Integrated Circuit), ASIC (Application Specific Integrated Circuit), FPGA (Field Programmable Gate Array), and the like. The ID decoder circuit 111 restores each pixel's ID data from the sensor output signal received from the image sensor 31. When a microprocessor or a DSP (Digital Signal Processor) has sufficient throughput, the ID decoder circuit 111 may include such a microprocessor or DSP using software. A flag register 112 stores flags necessary for decoding the ID data. A data register 113 stores an ID being decoded or a decoded ID. [0073] Referring to FIG. 4, only one ID decoder 101 is shown. Alternatively, for example, the ID decoder 101 may be provided for each pixel, depending on the required processing speed. Alternatively, the ID decoder 101 may be provided for each line in the vertical direction or the horizontal direction. [0074] A timing controller 102 outputs a timing control signal for controlling the timing required for the overall operation of the ID decoding processor 72. More specifically, the timing controller 102 synchronizes the timing of the sensor output signal with the ID decoder circuit 111. In response to a desired sensor output signal, the timing controller 102 generates a timing control signal for loading corresponding flag data and ID data in a frame memory 103 into the flag register 112 and the data register 113, respectively, and for carrying out ID decoding and supplies the timing control signal to the ID decoder 101 (namely, the ID decoder circuit 111, the flag register 112, and the data register 113 in the ID decoder 101). At the same time, the timing controller 102 generates and supplies an address signal and a read/write timing control signal to the frame memory 103. Also, the timing controller 102 generates and supplies a timing control signal for controlling the timing to an ID register 121 and an ID centroid computing circuit 122 in a centroid calculator 104 and to an ID coordinate storage memory 105. [0075] The frame memory 103 stores the ID data and the flag data generated by decoding the sensor output signal computed for each light receiving element 51 or each arithmetic unit 42. When the image sensor 31 has one arithmetic unit 42 for each pixel, the frame memory 103 has the same size as that of the image size of the image sensor 31, that is, M pixel×N pixel. The data width of the frame memory 103 is the sum of the bit width of the flag register 112 and the bit width of the data register 113. Referring to FIG. 4, the coordinates corresponding to the position of each pixel are represented by the I axis and the J axis. At each coordinate position, the ID data and the flag data are stored. [0076] The centroid calculator 104 calculates the coordinates at the centroid position of pixels on a captured image, the pixels having the same ID data, adds the position data serving as the detected positions of the optical beacons 2 (position data on the optical beacons 2 on the captured image) to the ID data, and outputs the resultant data. More specifically, the ID register 121 of the centroid calculator 104 reads ID data stored in the frame memory 103 on the basis of a timing control signal that is received from the timing controller 102 and that indicates that predetermined ID data is decoded by the ID decoder 101 and outputs the read ID data to the ID centroid computing circuit 122. For each piece of the received ID data, the ID centroid computing circuit 122 sequentially adds the I coordinates and the J coordinates at the coordinate positions of the corresponding pixels and the number of pieces of data (the number of pixels) and stores the sums in the ID coordinate storage memory 105. When the data over one frame is stored in the frame memory 103, for each ID, the ID centroid computing circuit 122 divides the sum of the I coordinates and the sum of the J coordinates in the ID coordinate storage memory 105 by the number of pieces of data (the number of pixels), thus computing the coordinates at the centroid position, and outputs the coordinates along with the ID data. [0077] With reference to FIGS. 5 and 6, the configuration of each of the optical beacons 2 will now be described. The optical beacon 2 shown in FIG. 5 includes a transmission data storage memory 151, a flashing controller 152, and a light emitting unit 153. The transmission data storage memory 151 stores in advance transmission data. The transmission data storage memory 151 appropriately reads the transmission data and outputs the read transmission data to the flashing controller 152. The flashing controller 152 includes a transmitter and digital circuits including an IC, ASIC, FPGA, and one-chip microcomputer. On the basis of the content of the data stored in the transmission data storage memory 151, the flashing controller 152 generates a flashing pattern and causes the light emitting unit 153 to emit light in accordance with the generated flashing pattern. The light emitting unit 153 only needs to function as a light source that flashes on and off at high speed. The output wavelength of the light emitted by the light emitting unit 153 only needs to be within a sensor responsive range of the image sensor 31. Light emitted by the light emitting unit 153 includes not only visible light but also infrared light. In view of the response speed and life, an LED (Light Emission Diode) is one optimal light source. [0078]FIG. 6 shows another configuration of the optical beacon 2 for changing data by communicating with another apparatus via a network (not shown). Referring to FIG. 6, the optical beacon 2 includes, in place of the transmission data storage memory 151, a data transmitter/receiver 161. The network refers to an environment that enables data communication with another apparatus via a communication medium such as a wired or wireless communication line, e.g., a telephone line, ISDN (Integrated Services Digital Network), RS-232C, RS-422, Ethernet(R) (10 base-T and 100 base-T), USB (Universal Serial Bus), IEEE (Institute of Electrical and Electronics Engineers) 1394, IEEE 802.11a, IEEE 802.11b, and Bluetooth. The data transmitter/receiver 161 includes a data communication IC and a driver corresponding to the communication medium. The data transmitter/receiver 161 outputs transmission data received from the optical beacon 2 via the network to the flashing controller 152. The flashing on/off controller 152 generates a flashing pattern on the basis of the transmission data and causes the light emitting unit 153 to flash on/off in accordance with the flashing pattern associated with the data. [0079] The operation of the ID recognizing camera 11 will now be described. The light receiving element 51 of the light receiving section 41 performs photoelectric conversion of light into an electrical signal and outputs the electrical signal to the amplifier 52. The amplifier 52 amplifies the electrical signal and outputs the amplified signal to the arithmetic unit 42. The storage unit 61 of the arithmetic unit 42 sequentially stores electrical signals received from the light receiving section 41 and stores the electrical signals over four frames. When the storage unit 61 becomes full, the storage unit 61 erases an electrical signal in the oldest frame and stores an electrical signal in the most recent frame. This operation is repeated to allow the storage unit 61 to store electrical signals over the most recent four frames at all times. The storage unit 61 outputs the electrical signals over the four frames to the comparator 62. [0080] The operation of the comparator 62 differs in the image mode and the ID mode. The operation mode may be switched by a controller (not shown), as shown in FIG. 7, at predetermined time intervals. Alternatively, the operation mode may be switched between the image mode and the ID mode at a known frame rate of 30 fps (frame per second) or 60 fps. The ID mode has an ID decoding section in which the ID data is decoded and an ID centroid computing section in which the position data serving as the coordinate position of a pixel having the decoded ID data is computed. [0081] Referring to FIG. 7, the image mode and the ID mode have the same period of time. Alternatively, each operation mode may or may not have the same time period. As shown in the lower part of FIG. 7, at the time subsequent to each image mode, the image decoding processor 71 decodes a sensor output signal and outputs image data on a captured image. At the time subsequent to each ID mode, the ID decoding processor 72 decodes a sensor output signal and outputs ID data and position data. [0082] The operation in the image mode will now be described. In the image mode, the comparator 62 of the image sensor 31 compares a signal level indicating each pixel's luminance detected by the light receiving section 41 (electrical signal stored in the storage unit 61) with a reference signal level. Referring to FIG. 9, a signal that becomes active (“1” in FIG. 9) when the luminance signal level becomes lower than the reference signal level, as shown in FIG. 8, is output. [0083]FIG. 8 shows the luminance signal level, and FIG. 9 shows the sensor output signal. The luminance signal level effectively indicates a change in charging voltage of the light receiving element 51. A predetermined reset level voltage, whose polarity is opposite to the charging voltage of the light receiving element 51 applied at a predetermined time, is applied to the light receiving element 51. At a subsequent time, the voltage level decreases in accordance with the electrical charge accumulated by the light receiving element 51. Referring to FIG. 8, zero electrical charge is accumulated at time 0. The luminance signal level is thus the reset level (predetermined level). As time passes from this state, electrical charge is accumulated, and the luminance signal level decreases. In this case, the straight line denoted by H in FIG. 8 refers to a pixel value at a relatively high luminance signal level (bright), and the straight line denoted by L refers to a pixel value at a relatively low luminance signal level (dark). [0084] The pixel value at the high luminance signal level H changes in such a manner that, at time TH, at which period TH has elapsed from time 0, electrical charge reaching the reference signal level is accumulated. In contrast, the pixel value at the low luminance signal level L changes in such a manner that, at time TL, at which period TL has elapsed from time 0, electrical charge reaching the reference signal level is accumulated. [0085] In other words, referring to FIG. 8, the brighter the pixel, the shorter the time it takes to reach the reference signal level (TH in FIG. 8). The darker the pixel, the longer the time it takes to reach the reference signal level (TL in FIG. 8) (TH<TL). The comparator 62 outputs the comparison result (comparator output) indicating whether or not each pixel's electrical signal (luminance signal) output from the light receiving section 41 actually reaches the reference signal level as a binary sensor output signal, as shown in FIG. 9. With such processing, the image sensor 31 captures an image at high speed, compares the image with a reference signal, and outputs the results over one frame as a sensor output signal. [0086] In order to measure the time periods TH and TL, the pixel value determining unit 81 of the image decoding processor 71 counts the results in units of frames, which are output in units of frames by the image sensor 31, encodes the sensor output signal indicating, for each pixel, at which frame the sensor output signal becomes active, as shown in FIG. 9, and outputs the encoded sensor output signal as image data. In this case, the sensor output signal at time TH has the number of frames F(H), and the sensor output signal at time TL has the number of frames F(L). [0087] More specifically, in the image mode, in order to convert the sensor output signal into a value with appropriate luminosity, the pixel value determining unit 81 of the image decoding processor 71 decodes the sensor output signal into image data by computing, for each pixel, the reciprocal of the time (number of frames) required by the sensor output signal to reach the reference signal level and stores the image data in the frame memory 82. After the image data for one frame have been accumulated, the output unit 83 sequentially reads the pixel values stored in the frame memory 82 and outputs the pixel values as image data. With this operation, the ID recognizing camera 11 outputs image data in the image mode (for details, please see ”48 Kframe/s CMOS Image Sensor for Real-time 3-D Sensing and Motion Detection”, ISSCC Digest of Technical Papers, pp. 94-95, February 2001, and Japanese Unexamined Patent Application Publication No. 2001-326857). [0088] When operating in the ID mode, the comparator 62 uses electrical signals over four time-sequential frames, which are stored in the storage unit 61, as luminance signals and performs an arithmetic operation expressed by: V(N)=F(N)+F(N−1)−F(N−2)−F(N−3) . . .   (1) [0089] where N denotes the frame number; V(N) denotes the comparison value at the time the luminance value in the N-th frame is input; and F(N) denotes the luminance accumulated in the light receiving section 41 in the N-th frame. With the arithmetic operation, a change in the light is detected. The operation result is output as a sensor output signal to the data generator 32. The data generator 32 uses the sensor output signal to perform ID decoding, which will be described below, to restore the ID data including the flashing pattern. Accordingly, the ID data from the optical beacon 2 is generated. [0090] The operation performed by the comparator 62 is not limited to equation (1). Alternatively, another operation (such as a first derivation or binary image comparison) is performed. In the following description, it is assumed that equation (1), which is reliable in detecting optical change, is used. [0091] The operation of the ID decoding processor 72 will now be described. The ID decoder circuit 111 of the ID decoder 101 restores each pixel's ID data from the sensor output signal received from the image sensor 31 on the basis of a timing control signal that is received from the timing controller 102 and that is for synchronizing with the timing of the sensor output signal. The ID decoder circuit 111 controls the flag register 112 in accordance with the timing control signal, decodes the ID data from the sensor output signal using the flag data loaded into the frame memory 103, and stores the ID being decoded or the decoded ID in the data register 113. The frame memory 103 stores the decoded flag data and the ID data at the corresponding coordinate position. [0092] The ID register 121 of the centroid calculator 104 causes the ID centroid computing circuit 122 to read the ID data information stored in the frame memory 103 on the basis of the timing control signal, which is received from the timing controller 102 and which indicates that the predetermined ID data is decoded by the ID decoder 101. [0093] The ID centroid computing circuit 122 sequentially adds the I coordinates and the J coordinates at the coordinate positions of pixels corresponding to the read ID data, appends information indicating the number of pixels to the sum of the I coordinates and the sum of the J coordinates, and stores the resultant data in the ID coordinate storage memory 105. This processing is repeated. [0094] When data in one frame is stored in the frame memory 103, the ID centroid computing circuit 122 divides, for each ID, the sum of the I coordinates and the sum of the J coordinates from the ID coordinate storage memory 105 by the number of pieces of data (the number of pixels) to compute the coordinates at the centroid position serving as position data, and outputs the position data along with the corresponding ID data. [0095] With the above-described operation, for example, as shown in FIG. 10, when the two optical beacons 2-1 to 2-2 transmit data while flashing on and off, the ID recognizing camera 11 receives optical signals at pixels located at positions on the captured image, the positions being associated with the physical positions of the optical beacons 2-1 and 2-2 in real space, as shown in the upper portion of FIG. 10. For example, it is assumed that light emitted from the optical beacon 2-1 is received by the light receiving element 51 at the coordinate position (10, 10), and light emitted from the optical beacon 2-2 is received by the light receiving element 51 at the coordinate position (90, 90). The light receiving elements 51 at the coordinate positions (10, 10) and (90, 90) in the corresponding light receiving sections 41 receive signals serving as temporal changes in the intensity (brightness) of the received light in accordance with the flashing patterns of the optical beacons 2-1 and 2-2, respectively. In this case, the pixel corresponding to the position data at the coordinates (10, 10) has the ID data “321” serving as the decoded result, and the pixel corresponding to the position data at the coordinates (90, 90) has the ID data “105” serving as the decoded result. As a result, binarization of the change in the intensity of the received light in accordance with equation (1) or the like gives ID data consisting of a bit string of 1's and 0's. [0096] Referring to the flowchart of FIG. 11, an image merging display process by the image merging display apparatus 1 will now be described. In step S1, the ID recognizing camera 11 captures, for example, as shown in FIG. 1, an image of the image capturing area 3, obtains ID data and position data on the optical beacons 2-1 to 2-4 included in the image capturing area 3, generates captured image data on the captured image, and outputs the ID data to the link target data analyzer 16 and the ID image converter 20, the position data to the display position obtaining unit 12, and the captured image data to the image merger 14. [0097] In step S2, the display position obtaining unit 12 obtains a display position at which an external image is to be displayed on the basis of the position data received from the ID recognizing camera 11 and outputs information on the display position to the image transformer 13. Specifically, when an image including the optical beacons 2-1 to 2-4 is captured, a quadrilateral defined by four points corresponding to the optical beacons 2-1 to 2-4 becomes the external image display area 4. Depending on the positional relationship between the ID recognizing camera 11 and the optical beacons 2-1 to 2-4 in real space, the shape of the external image display area 4 on the captured image and the position of the external image display area 4 in the image capturing area 3 change. On the basis of the position data on the optical beacons 2-1 to 2-4 in the image capturing area 3, the display positions for determining the positions of four corners of the external image display area 4 (positions of the optical beacons 2-1 to 2-4 in the image capturing area 3) are obtained. [0098] In step S3, the link target data analyzer 16 analyzes the ID data and outputs the analysis result to the link target image obtaining unit 17. In step S4, when the analysis result of the ID data shows that the ID data includes link target data, the link target image obtaining unit 17 accesses a link target on the basis of the link target data, obtains an external image, and outputs the obtained external image to the external image input unit 18. When the ID data includes no link target data, this processing is skipped. When the ID data includes external image data, in step S5, the ID image converter 20 extracts the external image data, converts the extracted external image data into an external image, and outputs the external image to the external image input unit 18. [0099] In step S6, the external image input unit 18 determines whether or not the input unit 21 is operated to select the external image at the link target. For example, when the external image at the link target is selected, the process proceeds to step S7. In step S7, the external image input unit 18 outputs the external image received from the link target image obtaining unit 17 to the image transformer 13. In step S8, the image transformer 13 transforms the external image received from the external image input unit 18 on the basis of the display position data received from the display position obtaining unit 12, that is, the position data on the four corners of the external image display area 4. [0100] With reference to the flowchart of FIG. 12, an image transformation process will now be described. In step S31, the image transformer 13 reads the coordinates r1, r2, r3, and r4 of four corners of the received external image display area 4 into the memory 13 a. In other words, the coordinate positions of the optical beacons 2-1 to 2-4 on the captured image are read into the memory 13 a. In step S32, as shown in FIG. 13, the image transformer 13 denotes the coordinates of four corners of an external image P as: r1′=(x1′, y1′), r2′=(xh′, y1′), r3′=(x1′, yh′), and r4′=(xh′, yh′). In step S33, the image transformer 13 expresses the relationship between the coordinates of the four corners of the external image P and the coordinates of the four corners of the received external image display area 4 as r′=Hr. [0101] As is well known, transformation of four points r1, r2, r3, and r4 defining an arbitrary quadrilateral into four points r1′, r2′, r3′, and r4′ defining another arbitrary quadrilateral is represented by projective transformation. Specifically, the coordinates r1, r2, r3, and r4 of the four corners of the received external image display area 4 are transformed into the coordinates r1′, r2′, r3′, and r4′ of four corners of the image from the external image input unit 18: λr′=Hr   (3) [0102] [0103] where r denotes the homogeneous coordinates prior to the projective transformation, that is, the coordinates (xp, yp) on the received external image display area; and r′ denotes the homogeneous coordinates subsequent to the projective transformation, that is, the coordinates (xp′, yp′) on the image from the external image input unit 18. By substituting the coordinates (xp, yp) of the four corners of the received external image display area 4 and the corresponding coordinates (xp′, yp′) of the four corners of the image from the external image input unit 18 for equation (3), the matrix H is calculated. [0104] In step S34, the image transformer 13 initializes all areas of the memory 13 a corresponding to the output image data P (px, py). In other words, all areas in which the transformed external image is stored are initialized. In step S35, the image transformer 13 initializes built-in counters xp and yp. In step S36, the image transformer 13 computes a point (xp′, yp′) corresponding to a point (xp, yp) in the received external image display area 4 using equations (3) and (4). [0105] In step S37, in a case in which w′≠0, if the computed xp′ and yp′ are within the area defined by the four corners of the external image P, that is, if w′≠0, x1′≦xp′≦xh′, and y1′≦yp′≦yh′ hold true, in step S38, the image transformer 13 replaces the pixel value at the coordinates (xp′, yp′) on an external image P′ by the pixel value at the coordinates (xp, yp) on the external image display area 4 and stores the replaced pixel value in the memory 13 a. In other words, as shown in FIG. 13, the pixel value of the external image displayed on the external image display area 4 is determined. [0106] In step S39, the image transformer 13 increments the counter xp by one. In step S40, it is determined whether or not the current value of the counter xp matches the size of the external image display area 4 in the x direction. If the determination is negative, the process returns to step S36. If it is determined in step S40 that the current value of the counter xp matches the size of the external image display area 4 in the x direction, the process proceeds to step S41. [0107] In step S41, the image transformer 13 increments the counter yp by one and initializes the counter xp. In step S42, it is determined whether or not the current value of the counter yp matches the size of the external image display area 4 in the y direction. If the determination is negative, the process returns to step S36. If it is determined in step S42 that the current value of the counter yp matches the size of the external image display area 4 in the y direction, that is, if all the coordinates within the external image display area 4 are subjected to the processing in steps S36 to S38 due to the processing in step S39 to S42, in step S43, the image transformer 13 outputs the transformed external image stored in the memory 13 a to the image merger 14. [0108] When w′≠0, x1′≦xp′≦xh′, and yl′≦yp′≦yh′ do not hold true in step S37, the computed xp′ and yp′ are not within the area defined by the four corners of the external image P. Therefore, the processing in step S38 is skipped. In other words, the computed xp′ and yp′ are not the coordinates within the external image display area 4, and the pixel value replacement processing is thus skipped. [0109] The above-described process is to perform projective transformation. With the projective transformation, each pixel value of the external image is replaced by the pixel value in the external image display area 4 being transformed depending on the image-captured positions, thus effectively transforming the external image. In other words, for example, when an external image shown in FIG. 14 is used, if the external image display area 4 shown in FIG. 1 is formed, the external image shown in FIG. 14 is transformed, as shown in FIG. 15, into the shape of the external image display area 4 shown in FIG. 1. [0110] The description returns to the flowchart of FIG. 11. In step S9, the image merger 14 merges the transformed external image with the captured image to generate a merged image and outputs the merged image to the image display unit 15. In step S10, the image display unit 15 displays the merged image received from the image merger 14. The process returns to step S1, and the processing from this step onward is repeated. [0111] When it is determined in step S6 that the image at the link target is not selected, in step S11, the external image input unit 18 determines whether or not the input unit 21 is operated to select the external image generated from the external image data included in the ID data. When the external image included in the ID data is selected, the process proceeds to step S12. [0112] In step S12, the external image input unit 18 reads the external image included in the ID data received from the ID image converter 20 and outputs the external image to the image transformer 13. The process proceeds to step S8. [0113] If it is determined in step S11 that the image included in the ID data is not selected, in step S13, the external image input unit 18 reads the external image that is stored in advance in the storage unit 19 and outputs the external image to the image transformer 13. The process proceeds to step S8. [0114] With the above-described process, for example, as shown in FIG. 15, the transformed external image is merged, as shown in FIG. 16, and an image displayed on the image capturing area 3 is displayed on the image display unit 15. Since the process is repeated, even when the direction of the ID recognizing camera 11 changes to change the image capturing area 3 to, as shown in FIG. 16, an image capturing area 3 a or 3 b, the external image display area 4 remains within the rectangle defined by the optical beacons 2-1 to 2-4. As a result, an image is displayed as if a screen displaying the image were provided on the wall 5. Since the external image display area 4 is determined by the positions of the optical beacons 2 in the image capturing area 3, so-called calibration for defining beforehand the positional relationship between the image merging display apparatus 1 and the optical beacons 2 is unnecessary. Accordingly, use of the system becomes easier. [0115] Referring to FIG. 17, the image merging display apparatus 1 may be in the shape of eyeglasses, thus serving as a so-called HMD. In other words, an HMD shown in FIG. 17 includes a pair of image merging display apparatuses 1 a and 1 b and a pair of display units 15 a and 15 b (images are displayed toward the rear of the drawing on the page) in accordance with the parallax between the left and right eyes. [0116] With this arrangement, the image merging display apparatuses 1 a and 1 b, which are associated with the parallax between the left and right eyes, each capture an image of the optical beacons 2. The external image display area 4 thus represents the parallax between the left and right eyes, making the displayed external image appear three-dimensional. [0117] The display units 15 a and 15 b may have so-called “see-through” or transparent structures. Specifically, the display units 15 a and 15 b each have a light shielding portion that blocks light from entering the external image display area 4 and that displays an external image and a “see-through” (transparent or semi-transparent) portion allowing the user to see through the display units 15 a and 15 b. With this arrangement, the captured image need not be displayed, and thus processing by the image merger 14 becomes unnecessary. Only the external image needs to be displayed on the external image display area 4. Since the display units 15 a and 15 b have “see-through” structures, the user experiences less stress as a result of feeling confined in a small and enclosed space even when the user is wearing the HMD. Moreover, the user can view the merged image in any posture. [0118] With reference to the block diagram of FIG. 18, another example of the configuration of an image merging display apparatus 1 for adding parameters s and t to data emitted from the optical beacons 2 and causing the optical beacons 2 to emit light in accordance with predetermined flashing patterns will now be described. Referring to FIG. 18, the same reference numerals are given to components corresponding to those of the image merging display apparatus 1 in FIG. 1, and repeated descriptions of the common portions are omitted. [0119] Basically, the configuration of the image merging display apparatus 1 shown in FIG. 18 is similar to that shown in FIG. 1 except for the fact that a parameter obtaining unit 171 is provided and that an image transformer 172 is provided in place of the image transformer 13. The parameter obtaining unit 171 obtains parameters s and t included in the ID data emitted from each of the optical beacons 2 and outputs the parameters s and to the image transformer 172. The image transformer 172 divides the external image received from the external image input unit 18 into a plurality of areas on the basis of the parameters s and t received from the parameter obtaining unit 171, transforms the individual areas of the external image, and outputs the transformed areas to the image merger 14. [0120] Referring to FIG. 19, it is assumed that optical beacons 2-11 and 2-19 are provided on a curved surface of a vase 181. Along the curved surface of the vase 181, the optical beacons 2-11 and 2-19 are arranged in such a manner that the optical beacons 2-11 to 2-13; 2-14 to 2-16; 2-17 to 2-19; 2-11, 2-14, and 2-17; 2-12, 2-15, and 2-19 are arranged at regular intervals. (If the surface of the vase 181 is a flat surface, the optical beacons 2-11 to 2-19 are arranged in a grid. However, since the optical beacons 2-11 to 2-19 are arranged along the curved surface, the grid is slightly distorted.) In this case, the external image display area 4 is, as shown in FIG. 19, a region defined by the optical beacons 2-11 to 2-14 and 2-16 to 2-19, when viewed from the image-captured positions. [0121] In this state, the optical beacons 2-11 to 2-19 emit light in accordance with predetermined flashing patterns including the parameters s and t indicating their positions on the external image. For example, as shown in FIG. 20, the parameters (s, t) of the optical beacons 2-11 to 2-19 are (0, 0), (0.5, 0), (1, 0), (0, 0.5), (0.5, 0.5), (0, 1) (0.5, 1), and (1, 1), respectively. [0122] With reference to the flowchart of FIG. 22, an image merging display process for displaying an external image shown in FIG. 21 on the external image display area 4 shown in FIG. 19 will now be described. Since the processing in steps S61 to S67, S70, and S72 to S76 is similar to steps S1 to S13 of FIG. 11, descriptions thereof are omitted. [0123] In step S68, the parameter obtaining unit 171 obtains information on parameters s and t from the ID data and outputs the obtained parameters s and t to the image transformer 172. Specifically, in this case, the parameter obtaining unit 171 obtains, for the optical beacons 2-11 to 2-19, the parameters (s, t), that is, (0, 0), (0.5, 0), (1, 0), (0, 0.5), (0.5, 0.5), (1, 0.5), (0, 1), (0.5, 1), and (1, 1), and outputs the obtained parameters (s, t) to the image transformer 172. [0124] In step S69, the image transformer 172 divides, as shown in FIG. 21, the external image data into areas 191-1 to 191-4 on the basis of the parameters s and t. Specifically, in this case, the image transformer 172 divides the received external image into four areas 191-1 to 191-4, whose size is half the length of each side of the original external image. [0125] In step S70, the image transformer 172 individually transforms the separate areas 191-1 to 191-4. In step S71, the image transformer 172 determines, as shown in FIG. 23, whether or not all the areas 191-1 to 191-4 are transformed to fit external image display areas 4-1 to 4-4, respectively. The transformation processing in step S70 is repeated until all the areas 191 are transformed. [0126] With this processing, as shown in FIG. 23, the image display unit 15 generates a display effect for the user as if the external image were displayed along the curved surface of the vase 181 (as if the external image fits the curved surface). In the above case, there are nine optical beacons 2. The number of optical beacons 2 may be greater. In the case of providing such optical beacons 2 on a curved surface, the larger the curvature of the curved surface, the more numerous the optical beacons 2 provided. As a result, an external image is merged with the curved surface more smoothly (fits the curved surface more properly). [0127] In the above example, one external image is merged with the captured image. Alternatively, a plurality of external images is displayed. [0128]FIG. 24 shows an image merging display apparatus 1 for displaying a plurality of external images. Referring to FIG. 24, the same reference numerals are given to components corresponding to those of the image merging display apparatus 1 in FIG. 1, and repeated descriptions of the common portions are appropriately omitted. Basically, the configuration of the image merging display apparatus 1 shown in FIG. 24 is similar to that shown in FIG. 1 except for the fact that a group recognizing unit 201 is additionally provided, that an external image input unit 202 is provided in place of the external image input unit 18, and an image transformer 203 is provided in place of the image transformer 13. [0129] The group recognizing unit 201 reads group identifying data for the optical beacons 2 associated with each external image display area 4, the group identifying data being included in the ID data, and outputs the group identifying data to the external image input unit 202 and the image transformer 203. More specifically, the group recognizing unit 201 distinguishes each group (external image) by adding a group number to each group (external image) identified by the group identifying data. [0130] The external image input unit 202 reads external images designated by the user by operating the input unit 21, the designated external images being one of external images obtained from a link target for each group identifying data, external images included in the ID data received from the ID image converter 20, and external images that are stored in advance in the storage unit 19, and outputs the read external images to the image transformer 203. [0131] For each group, the image transformer 203 transforms the external images (external image data received from the external image input unit 202 ) on the basis of the group identifying data and outputs the transformed external images to the image merger 14. [0132] With reference to the flowchart of FIG. 25, an image merging display process of merging and displaying a plurality of external images will now be described. Since the processing in steps S91 to S95, S97 to S99, and S101 and S105 is similar to the processing in step S1 to S13 of the flowchart shown in FIG. 11, descriptions thereof are omitted. [0133] In step S96, the group recognizing unit 201 obtains group identifying data included in the ID data for all the individual optical beacons 2 and outputs the group identifying data to the external image input unit 202 and the image transformer 203. Subsequent to the processing in step S97 to S99 and S103 to S105, in step S100, the image transformer 203 determines whether or not external images belonging to all groups are transformed. If it is determined that not all external images are transformed, the process returns to step S97. The processing in step S97 to S99 and S103 to S105 is repeated until it is determined that all external images are transformed. When it is determined in step S100 that external images belonging to all groups are transformed, the process proceeds to step S101. The processing from step S101 onward is repeated. [0134] With the above-described process, for example, as shown in FIG. 26, external image A is displayed on an external image display area 4-11 defined by optical beacons 2-31 to 2-34, and external image B is displayed on an external image display area 4-12 defined by optical beacons 2-41 to 2-44. Two external images A and B are thus displayed. In this case, the group identifying data indicating that the optical beacons 2-31 to 2-34 belong to the same group forming the external image display area 4-11 and the group identifying data indicating that the optical beacons 2-41 to 2-44 belong to the same group forming the external image display area 4-12 are included and transmitted with the ID data. The image merging display apparatus 1 generates external image display areas associated with the corresponding groups in accordance with the group identifying data included in the ID data and merges and displays individual external images. The number of external images to be displayed may be greater than the number in the above example. [0135] With the foregoing processing, the parameters s and t of each of the optical beacons 2 on the external image are transmitted as the ID data. An external image is transformed and displayed as if it were displayed on a curved surface in real space. Accordingly, an image is merged and displayed as if it were displayed on a curved surface in real space. [0136] According to the present invention, the optical beacons are arranged in real space, and an external image is transformed and merged in accordance with the arrangement of the optical beacons on a captured image. This generates an effect as if the merged external image were displayed in real space. [0137] Since the group identifying data is included in the ID data transmitted from the optical beacons by emitting light, a plurality of external images is simultaneously merged and displayed. [0138] Since the ID data includes the link target data to an external image to be displayed, changing the data transmitted from the optical beacons 2 causes a different external image to be merged and displayed. [0139] Since the data transmitted from the optical beacons includes image data, an external image is merged and displayed without providing another communication medium for receiving an external image. [0140] Since an HMD including a pair of image merging display apparatuses 1 is provided while taking into consideration the parallax between the human eyes, a merged external image represents the parallax between the eyes. As a result, the external image with high realism and impressive quality is merged and displayed. [0141] Since a plurality of optical beacons having parameters indicating their positions on the external image are arranged on a curved surface in real space, an external image is merged and displayed in such a manner that the external image fits the curved surface more satisfactorily. [0142] The above described series of processes can be performed by hardware or by software. When performing the series of processes by software, a program including the software is installed from a recording medium or the like into a computer included in dedicated hardware or into a general-purpose personal computer capable of executing various programs by installing such various programs. [0143]FIG. 27 shows the configuration of an embodiment of a personal computer in a case in which the image merging display apparatus 1 is implemented using software. FIG. 28 shows the configuration of an embodiment of a personal computer in a case in which the optical beacons 2 are implemented using software. CPUs 211 and 231 of the personal computers control the overall operation of the personal computers. The CPU 211 and 231 execute programs stored in ROMs (Read Only Memory) 212 and 232 in response to commands input from users through input units 216 and 236 including keyboards and mice via buses 214 and 234 and input/output interfaces 215 and 235. Alternatively, the CPUs 211 and 231 load into RAMs (Random Access Memory) 203 and 233 programs that are read from magnetic disks 221 and 251, optical disks 222 and 252, magneto-optical disks 223 and 253, or semiconductor memories 224 and 254 connected to drives 220 and 240 and that are installed in storage units 208 and 238 and the CPUs 211 and 231 execute the programs, and output units 217 and 237 output the execution results. The CPUs 211 and 231 control communication units 219 and 239 to communicate with the outside and exchange data. [0144] As shown in FIGS. 27 and 28, the recording media having recorded thereon the programs include not only packaged media that are distributed to provide the programs to the users, including the magnetic disks 221 and 251 (including flexible disks), the optical disks 222 and 252 (including CD-ROM (Compact Disc-Read Only Memory) and DVD (Digital Versatile Disc), the magneto-optical disks 223 and 253 (including MD (Mini-Disc)), or the semiconductor memories 234 and 254 having recorded thereon the programs, but also include the ROMs 212 and 232 and hard disks included in the storage units 218 and 238, which have recorded thereon the programs and which are incorporated in advance in the computers and provided to the users. [0145] In the present description, the steps for writing the programs provided by the recording media include not only time-series processing performed in accordance with the described order but also include parallel or individual processing, which may not necessarily be performed in time series. In the present specification, the system refers to the entirety of an apparatus including a plurality of apparatuses. [0146] It should be understood that various changes and modifications to the presently preferred embodiments described herein will be apparent to those skilled in the art. Such changes and modifications can be made without departing from the spirit and scope of the present invention and without diminishing its intended advantages. It is therefore intended that such changes and modifications be covered by the appended claims. What is claimed is: 1. An image display apparatus comprising: image capturing means for capturing an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; detection means for detecting the image-captured positions of the plurality of transmitting apparatuses from position data obtained from the image capturing means; input means for inputting a first image; transformation means for transforming the first image to correspond to a shape obtained on the basis of the image-captured positions of the transmitting apparatuses; and display means for displaying the first image transformed by the transformation means at a display position associated with the image-captured positions of the transmitting apparatuses. 2. An image display apparatus according to claim 1, further comprising analysis means for analyzing the data included in the predetermined flashing patterns emitted by the plurality of transmitting apparatuses. 3. An image display apparatus according to claim 2, wherein the data includes link data, content data, or group data indicating a group to which the plurality of transmitting apparatuses belong. 4. An image display apparatus according to claim 3, wherein the link data includes a link target on a network, in which information on the first image resides. 5. An image display apparatus according to claim 4, further comprising obtaining means for accessing the link target included in the link data and obtaining the first image. 6. An image display apparatus according to claim 3, wherein the content data includes information on the first image. 7. An image display apparatus according to claim 6, wherein the input means inputs the first image included in the content data. 8. An image display apparatus according to claim 3, wherein the transformation means transforms the first image on the basis of the image-captured positions of four transmitting apparatuses including the same group data, and when the first image is a quadrilateral, the display means displays the first image transformed by the transformation means at the display position so that four corners of the first image are associated with the image-captured positions of the four transmitting apparatuses. 9. An image display apparatus according to claim 1, wherein the image capturing means captures a second image, in addition to the image of the plurality of transmitting apparatuses emitting light in the predetermined flashing patterns to transmit the data. 10. An image display apparatus according to claim 9, further comprising merged image generating means for merging the second image with the first image transformed by the transformation means and generating a merged image, wherein the display means displays the merged image so that the first image included in the merged image is displayed at the display position associated with the image-captured positions of the transmitting apparatuses. 11. An image display apparatus according to claim 1, wherein the display means includes: a transparent screen; and light-shielded-area generating means for generating a light-shielded area at the display position associated with the image-captured positions of the transmitting apparatuses on the screen, and the first image transformed by the transformation means is displayed in the light-shielded area. 12. An image display apparatus according to claim 1, wherein the image capturing means, the input means, the transformation means, and the display means are provided on a pair of glasses. 13. An image display apparatus according to claim 1, wherein a refresh rate of the image capturing means is higher than a refresh rate of the display means. 14. An image display apparatus according to claim 1, wherein the transformation means transforms the first image by projective transformation based on the image-captured positions of the transmitting apparatuses. 15. An image display method comprising: an image capturing step of capturing an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detection step of detecting the image-captured positions of the plurality of transmitting apparatuses; an input step of inputting a first image; a transformation step of transforming the first image to correspond to a shape obtained on the basis of the image-captured positions of the transmitting apparatuses; and a display step of displaying the first image transformed in the transformation step at a display position associated with the image-captured positions of the transmitting apparatuses. 16. A recording medium having recorded thereon a computer-readable program, the program comprising: an image capturing control step of controlling capturing of an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detection control step of controlling detection of the image-captured positions of the plurality of transmitting apparatuses; an input control step of controlling inputting of a first image; a transformation control step of controlling transformation of the first image to correspond to a shape obtained on the basis of the image-captured positions of the transmitting apparatuses; and a display control step of controlling displaying of the transformed first image at a display position associated with the image-captured positions of the transmitting apparatuses. 17. A program for causing a computer to perform a process comprising: an image capturing control step of controlling capturing of an image of a plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; a detection control step of controlling detection of the image-captured positions of the plurality of transmitting apparatuses; an input control step of controlling inputting of a first image; a transformation control step of controlling transformation of the first image to correspond to a shape obtained on the basis of the image-captured positions of the transmitting apparatuses; and a display control step of controlling displaying of the transformed first image at a display position associated with the image-captured positions of the transmitting apparatuses. 18. A transmitting apparatus for transmitting data by emitting light in a predetermined flashing pattern, comprising; pattern generating means for generating the predetermined flashing pattern associated with the data; and light-emitting means for emitting light in the predetermined flashing pattern generated by the pattern generating means. 19. A transmitting apparatus according to claim 18, wherein the data includes link data, content data, or group data indicating a group to which the transmitting apparatus belongs. 20. A transmitting apparatus according to claim 19, wherein the link data includes a link target on a network, in which information on an image displayed on an image display apparatus resides. 21. A transmitting apparatus according to claim 19, wherein the content data includes information on an image displayed on an image display apparatus. 22. A transmitting method for a transmitting apparatus that transmits data by emitting light in a predetermined flashing pattern, comprising; a pattern generating step of generating the predetermined flashing pattern associated with the data; and a light-emitting step of emitting light in the predetermined flashing pattern generated in the pattern generating step. 23. A recording medium having recorded thereon a computer-readable program for controlling a transmitting apparatus that transmits data by emitting light in a predetermined flashing pattern, the program comprising; a pattern generation control step of controlling generation of the predetermined flashing pattern associated with the data; and a light-emission control step of controlling emission of light in the predetermined flashing pattern generated in the pattern generation control step. 24. A program for causing a computer that controls a transmitting apparatus that transmits data by emitting light in a predetermined flashing pattern to perform a process comprising: a pattern generation control step of controlling generation of the predetermined flashing pattern associated with the data; and a light-emission control step of controlling emission of light in the predetermined flashing pattern generated in the pattern generation control step. 25. An image display system comprising; an image display apparatus including, image capturing means for capturing an image of the plurality of transmitting apparatuses that emit light in predetermined flashing patterns to transmit data; detection means for detecting the image-captured positions of the plurality of transmitting apparatuses; input means for inputting an image; transformation means for transforming the image to correspond to a shape obtained on the basis of the image-captured positions of the transmitting apparatuses; and display means for displaying the image transformed by the transformation means at a display position associated with the image-captured positions of the transmitting apparatuses, wherein each of the plurality of transmitting apparatuses includes, pattern generating means for generating the predetermined flashing pattern associated with the data; and light-emitting means for emitting light in the predetermined flashing pattern generated by the pattern generating means.

2003-05-28

en

2004-01-01

US-201314416055-A

Methods and Kits to Create Protein Substrate˜HECT-Ubiquitin Ligase Pairs ABSTRACT Methods and kits to use in the isolation and identification of crosslinked protein substrate ubiquitin ligase complexes are disclosed. More specifically the methods and kits disclosed herein describe the use of bifunctional thiol-and-amine crosslinkers to covalently bind an endogenous or exogenous HECT-ubiquitin ligase to a downstream protein substrate, preferably in a cell lysate. CROSS-REFERENCE TO RELATED APPLICATIONS This application claims benefit of priority under 35 U.S.C. 119 from U.S. Provisional Application No. 61/674,152, filed Jul. 20, 2012 and entitled “METHODS AND KITS TO CREATE PROTEIN SUBSTRATE˜HECT-UBIQUITIN LIGASE PAIRS,” the contents of which are incorporated by reference in its entirety. FIELD Methods and kits to use in the identification of crosslinked protein substrate ubiquitin ligase complexes are disclosed. More specifically, the methods and kits disclosed herein describe the use of bifunctional thiol-and-amine crosslinkers to covalently bind endogenous or exogenous HECT-ubiquitin ligases to a downstream protein substrate, preferably in cell lysate. BACKGROUND Protein ubiquitination is a reversible, enzymatic, posttranslational modification process that regulates signal transduction, transcription, and protein lifespan. More and more, misregulation of the ubiquitination cascade has been observed in a host of mammalian diseases including cancer, neurodegenerative disorders, and hypertensive disorders. For example, mutations and amplifications in HECT ubiquitination ligase (E3) genes have been demonstrated to cause neurodegenerative diseases (e.g. Angelman syndrome), hypertensive disorders (e.g., Liddle's syndrome), and cancers. There are currently two known methods to isolate protein substrate HECT-ubiquitin ligase pairs. These include the in vitro assay and the immunoprecipitation assay. Each of these assays has its disadvantages. For example, the in vitro assay demonstrates particularity in its protein substrate HECT-ubiquitin ligase interactions, but is not conducted in cell lysate. Moreover, this assay requires the inefficient and time-consuming step of immobilizing candidate protein substrates onto proteome arrays before isolating the protein substrate HECT-ubiquitin ligase pairs. The immunoprecipitation assay, on the other hand, does not require the immobilization of candidate protein substrates onto arrays, and is run in cell lysate, but does not demonstrate particularity with respect to isolating protein substrate HECT-ubiquitin ligase pairs. For example, it is common to co-precipitate undesired ubiquitin ligase protein pairs along with the protein substrate HECT-ubiquitin ligase pairs of interest. SUMMARY In a first aspect, a method for forming a crosslinked protein substrate˜HECT-ubiquitin ligase complex is disclosed herein. The method involves providing a buffer solution, adding a thiol-and-amine crosslinker to the buffer solution, reacting the resultant mixture to create a crosslinked protein substrate˜HECT-ubiquitin complex. The method includes an optional step of adding a quenching solution to the mixture. In this aspect, the buffer solution may include a mammalian cell lysate. Alternatively, the buffer solution may include a HECT-ubiquitin ligase, such that specific interactions between a particular HECT-ubiquitin ligase and varying protein substrates can be investigated. The HECT-ubiquitin ligases that can be incorporated in the method include, but are not limited to: Rsp5; Ufd4; Hu15; Tom1; Hu14; NEDD4; NEDD4L; ITCH; WWP1; WWP2; SMURF1; SMURF2; NEDL1; NEDL2; E6AP; HECTD2; KIAA0614; TRIP12; G2E3; EDD; HACE1; HECTD1; UBE3B; UBEC; KIAA0317; HUWE1; HECTD3; HERC1; HERC2; HERC3; HERC4; HERC5; HERC6; SopA; and NIeL. The thiol-and-amine crosslinkers that can be used in this aspect include, but are not limited to, compounds 10-16 disclosed in FIG. 3. The quenching solution may be include Laemmli loading buffer, β-mercaptoethanol, tris buffer, and combinations thereof. In a second aspect, a kit for forming a crosslinked protein substrate˜HECT-ubiquitin ligase complex in cell lysate is disclosed herein. In this aspect, the kit includes a thiol-and-amine crosslinker and a set of instructions to use the thiol-and-amine crosslinker to crosslink an endogenous protein substrate with an endogenous HECT-ubiquitin ligase resulting in the formation of a crosslinked protein substrate˜HECT-ubiquitin ligase complex. In this aspect, the thiol-and-amine crosslinker that can be used in the kit include, but are not limited to, compounds 10-16 disclosed in FIG. 3. In a third aspect, a kit for forming a crosslinked protein substrate˜HECT-ubiquitin ligase complex in a buffer solution is disclosed herein. The kit includes a buffer solution, a thiol-and-amine crosslinker, and instructions to use said thiol-and-amine crosslinker to crosslink a protein substrate with a HECT-ubiquitin ligase resulting in the formation of a crosslinked protein substrate˜HECT-ubiquitin ligase complex. In this aspect, the buffer solution may include a mammalian cell lysate. Alternatively, the buffer solution may include a HECT-ubiquitin ligase, such that specific interactions between a particular HECT-ubiquitin ligase and varying protein substrates can be identified. The HECT-ubiquitin ligases that can be incorporated in the kit include, but are not limited to: Rsp5; Ufd4; Hu15; Tom1; Hu14; NEDD4; NEDD4L; ITCH; WWP1; WWP2; SMURF1; SMURF2; NEDL1; NEDL2; E6AP; HECTD2; KIAA0614; TRIP12; G2E3; EDD; HACE1; HECTD1; UBE3B; UBEC; KIAA0317; HUWE1; HECTD3; HERC1; HERC2; HERC3; HERC4; HERC5; HERC6; SopA; and NIeL. Finally, the thiol-and-amine crosslinkers that can be used in this method include, but are not limited to, compounds 10-16 disclosed in FIG. 3. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 depicts the normal protein substrate ubiquitination process. FIG. 2 depicts the use of a thiol-and-amine crosslinker to isolate a downstream protein substrate of a HECT-ubiquitin ligase. FIG. 3 illustrates SDS-PAGE data showing the dependence of forming a crosslinked protein substrate˜HECT-ubiqutin ligase complex in the absence (“none”) or presence of different thiol-and-amine crosslinkers (10, 11, 12, 13, 14, 15 and 16) with a test protein substrate (GFP-Sic60) and different forms of a yeast HECT-ubiquitin ligase (Rsp5, C777A, Δ3C and Δ4C). FIG. 4 illustrates the domain structure of yeast HECT-ubiquitin ligase, Rsp5 (17), and mutant forms, Rsp5 C777A (18), Rsp5 Δ3C (19), and Rsp Δ4C (20). FIG. 5 illustrates SDS-PAGE data demonstrating the dependence of forming a crosslinked protein substrate˜HECT-ubiquitin ligase complex (band at ˜130 kDa) upon a thiol-and-amine crosslinker (10) with a test protein substrate (GFP-Sic60) and a HECT-ubiquitin ligase (Rsp5) in the presence of a cell lysate (HeLa extract). FIG. 6A depicts the domain structure for a HECT-ubiquitin ligase (Rsp5) and a test protein substrate (Sic60-GFP). FIG. 6B illustrates SDS-PAGE data showing the ubiquitination cascade reaction that occurs using these molecules in the absence (“−”) or presence (“+”) of ATP. FIG. 7A illustrates SDS-PAGE data demonstrating the dependence of forming a crosslinked protein substrate˜HECT-ubiqutin ligase complex (band at ˜130 kDa) upon a thiol-and-amine crosslinker (10) with a test protein substrate (Sic60-GFP) and a HECT-ubiquitin ligase (Rsp5) in the presence of a buffer. FIG. 7B illustrates SDS-PAGE data of control reactions showing the lack of crosslinked complex formation with a yeast HECT-ubiquitin ligase (Rsp5) alone or with a test protein substrate (Sic60-GFP) alone in the absence (“−”) or presence (“+”) of a thiol-and-amine crosslinker (10). FIG. 8A illustrates the domain structure of yeast HECT-ubiquitin ligase, Rsp5, and mutant forms, Rsp5 C777A, Rsp5 Δ3C, and Rsp Δ4C. FIG. 8B illustrates SDS-PAGE data showing the ubiquitination cascade reaction that occurs using these molecules in the absence (“−”) or presence (“+”) of ATP. FIG. 8C illustrates data showing the relative amount of crosslinked fluorescent product (band at ˜130 kDa) formed between test protein substrate Sic60-GFP and yeast HECT-ubiquitin ligase Rsp5 in the presence of crosslinker 10 in the absence (“−”) or presence (“+”) of HeLa cell lysate. FIG. 9 illustrates the extent of crosslinking of Rsp5 HECT-ubiquitin ligase (lanes 1, 5) and of Rsp5 mutants C777A (lanes 2, 6), Δ3C (lanes 3, 7) and Δ4C (lanes 4, 8) with Sic60-GFP in the absence (lanes 1-4) or presence (lanes 5-8) of crosslinker 8 (disuccinimidyl glutarate). FIG. 10A depicts the domain structure of the Rsp5 HECT-ubiquitin ligase and a modified mutant form of the Rsp5 HECT-ubiquitin ligase (Rsp5ΔWW). FIG. 10B illustrates SDS-PAGE data for the ubiquitination activity of the Rsp5ΔWW mutant HECT-ubiquitin ligase with the test protein substrate Sic60-GFP in the absence (“−”) or presence (“+”) of ATP. FIG. 11A depicts the domain structure of the Sic60-GFP test protein substrate and a modified mutant form of the Sic60-GFP test protein substrate (Sic60-GFPΔPY). FIG. 11B illustrates SDS-PAGE data for the ubiquitination activity of Rsp5 with the Sic60-GFPΔPY test protein substrate in the absence (“−”) or presence (“+”) of ATP. DETAILED DESCRIPTION The method disclosed herein is a novel approach to crosslink a protein substrate with a HECT-ubiquitin ligase so that protein substrates of HECT-ubiquitin ligases can be identified. This robust method allows one to identify protein substrates of HECT-ubiquitin ligases without having to immobilize candidate protein substrates onto proteome arrays. Moreover, the method disclosed herein solves the long-felt but unresolved need for identifying protein substrates of HECT-ubiquitin ligases in cell lysate without the additional isolation of protein substrates of non-HECT ubiquitin ligases. Finally, the method enables one to rapidly identify protein substrates of HECT-ubiquitin ligase important for use as reagents and markers for various purposes, including uses for diagnostic and therapeutic applications. Referring to FIG. 1, in a normal ubiquitination cascade, a protein substrate site 1 comes into close proximity with a ubiquitin ligase active site 2. The physical proximity of the sites to each other in the ubiquitination process transfers ubiquitin 3 from the ubiquitin ligase molecule 4 to the protein substrate 5. Referring to FIG. 2, in a first embodiment disclosed herein, a thiol-and-amine crosslinker 6 may be used to covalently crosslink the protein substrate site 7 with the HECT-ubiquitin ligase active site 8 to create a crosslinked protein substrate˜HECT-ubiquitin ligase complex in the form of a crosslinked protein substrate˜HECT-ubiquitin ligase pair 9. The crosslinked protein substrate˜HECT-ubiquitin ligase complex may be separated from non-crosslinked materials in a subsequent step. A thiol-and-amine crosslinker used herein to crosslink a protein substrate with a HECT-ubiquitin ligase has a thiol reactive group. The thiol reactive group can be chosen from amongst any electrophilic moiety that interacts with cysteine, and can include preferably one moiety selected from the following group: wherein X can be a halogen. Additionally, R5 can be chosen from the group including hydrogen, substituted alkyl, unsubstituted alkyl, substituted heteroalkyl, substituted cycloalkyl, unsubstituted cycloalkyl, substituted heterocycloalkyl, substituted heteroaryl, or unsubstituted heteroaryl. The thiol-and-amine crosslinker disclosed herein to crosslink a protein substrate with a HECT-ubiquitin ligase also has an amine reactive group. The amine reactive group can be chosen from amongst any electrophilic moiety that interacts with lysine, and can include preferably one moiety selected from the following group: wherein X is a halogen. More specifically, and now referring to FIG. 3, in an embodiment disclosed herein, the thiol-and-amine crosslinker used herein may be chosen preferably from the following group of bifunctional crosslinking reagents, each of which includes a thiol reactive group and an amine reactive group as described previously: (10) Still referring to FIG. 3, the thiol-and-amine crosslinkers disclosed herein can be used to crosslink a protein substrate with a HECT-ubiquitin ligase to form a crosslinked protein substrate˜HECT-ubiquitin ligase complex. For this representative example, the illustrative HECT-ubiquitin ligase Rsp5 was chosen. The illustrative protein substrate chosen was Sic60-GFP and was tagged with GFP so that in-gel fluorescence imaging could be used to more easily monitor the existence of crosslinking. The ubiquitin ligase Rsp5 has a molecular weight of approximately 92 kDa, and the substrate Sic60-GFP has a molecular weight of approximately 34 kDa. Thus, a band at approximately 130 kDa (that is, the combined molecular weight of the ubiquitin ligase and protein substrate) demonstrates the existence of 1:1 crosslinking ratio between the two molecules to form a crosslinked protein substrate˜HECT-ubiquitin ligase complex that includes a protein substrate˜HECT-ubiquitin ligase pair. Still referring to FIG. 3, and starting in the upper left-hand corner of the figure, in the first representative experiment between Rsp5 and Sic60-GFP, no thiol-and-amine crosslinker (that is, the absence of any of crosslinkers 10-16) was used. The lack of a band at 130 kDa demonstrates the lack of crosslinking between a protein substrate and ubiquitin ligase in the absence of a thiol-and-amine crosslinker. Now, moving one box to the right, crosslinker 10 was added to the mixture containing Sic60-GFP and Rsp5. In contrast to the previous assay mixture lacking an included thiol-and-amine crosslinker, Sic60-GFP and Rsp5 formed a crosslinked Sic60-GFP˜Rsp5 complex, as demonstrated by the existence of a band at approximately 130 kDa. Still referring to FIG. 3, and now moving through the remainder of the figure, the existence of a 130 kDa band for the remaining mixtures that contain Rsp5 and Sic60-GFP in the presence of crosslinkers 11-16 demonstrates that crosslinked Sic60-GFP˜Rsp5 complexes form from the individual Sic60-GFP and Rsp5 molecules in the presence of the crosslinkers 11-16. Now referring to FIG. 4, three different types of mutant Rsp5 molecules were prepared to determine whether crosslinking occurred due to the presence of catalytic or surface cysteine sites on the ubiquitin ligase molecule. Species 17 is the normal Rsp5 molecule, which has the full complement of catalytic and surface cysteine sites. Species 18 is a first mutant ubiquitin ligase denoted as C777A, and it has the full complement of surface cysteine sites, but has its catalytic cysteine site removed. Species 19 is a second mutant denoted as Δ3C, and it has all of its surface cysteine sites removed, but retains its catalytic cysteine site. Lastly, species 20 is the final mutant denoted as Δ4C, and it has each of its surface and active cysteine sites removed. Still referring to FIGS. 3 and 4, a Sic60-GFP˜Rsp5 complex forms between the normal Rsp5 molecule 17 and protein substrate Sic60-GFP in the presence of crosslinkers 10-16. Still referring to FIG. 3, a dramatic decrease in crosslinking is observed when the catalytic cysteine is removed from the ubiquitin ligase, as is demonstrated in the crosslinking interactions for C777A 18 and Δ4C 20. Without being bound or limited to any particular theory governing the mechanism of crosslinker action, one or more residues in or near the catalytic site is one factor for forming a crosslinked complex between a HECT-ubiquitin ligase and protein substrate when using a thiol-and-amine crosslinker, and more specifically with the use of the crosslinkers 10-16. Lastly, still referring to FIGS. 3 and 4, a strong band at 130 kDa is demonstrated for when Δ3C 19 is used in the crosslinking mixture. This observation further supports the view that crosslinked protein substrate˜HECT-ubiquitin ligase complexes preferably result when the catalytic site is used. Now referring to FIG. 5, in an alternative embodiment of the crosslinking procedure disclosed herein, the procedure using the aforementioned Rsp5 and Sic60-GFP molecules may be conducted in the presence of cell lysate, which contains the full complement of competing mammalian proteins, many of which possess catalytically active cysteine residues as well as lysines. As demonstrated in FIG. 5, the characteristic band for crosslinking is seen at 130 kDa even in the presence of HeLa cell lysate. Moreover, and still referring to FIG. 5, the data demonstrates that the crosslinking does not occur without the presence of crosslinker, thus demonstrating that the competing mammalian proteins themselves do not lead to crosslinking between the HECT-ubiquitin ligase and protein substrate. The representative HECT-ubiquitin ligase Rsp5 was chosen to demonstrate the proof-of-concept for the disclosed method, as well as to illustrate the specificity and robustness of the thiol-and-amine crosslinker reagents for an exemplary HECT-ubiquitin ligase and test protein substrate. Without being bound or limited to any particular theory regarding the mechanism of action, one factor in using the crosslinking embodiment disclosed herein is the presence of a catalytic cysteine site on the HECT-ubiquitin ligase of interest. Thus, in alternative embodiments of the crosslinking interaction disclosed herein, additional HECT-ubiquitin ligases can be used. Such alternative HECT-ubiquitin ligases include yeast HECT ligases, HECTE3 ubiquitin ligases, and HECT-like ubiquitin ligases. Rsp5 is a yeast HECT ligase, and additional yeast HECT ligases within the scope of this disclosure include, but are not limited to: Ufd4; Hu15; Tom1; and Hu14. HECTE3 ubiquitin ligases within the scope of this disclosure include, but are not limited to one of the following: NEDD4; NEDD4L; ITCH; WWP1; WWP2; SMURF1; SMURF2; NEDL1; NEDL2; E6AP; HECTD2; KIAA0614; TRIP12; G2E3; EDD; HACE1; HECTD1; UBE3B; UBEC; KIAA0317; HUWE1; HECTD3; HERC1; HERC2; HERC3; HERC4; HERC5; and HERC6. Lastly, the HECT-like ubiquitin ligases within the scope of this disclosure include, but are not limited to SopA and NIeL. In additional embodiments disclosed herein, kits for identifying a crosslinked protein substrate˜HECT-ubiquitin ligase complex are disclosed. The first kit disclosed herein includes a thiol-and-amine crosslinker, and a set of instructions for a protocol to use the thiol-and-amine crosslinker to crosslink a protein substrate with a HECT-ubiquitin ligase to form a crosslinked protein substrate˜HECT-ubiquitin ligase complex in a cell lysate, when both the HECT-ubiquitin ligase and protein substrate are endogenous to the cell lysate. The thiol-and-amine crosslinker in this embodiment may include, but is not limited to, one of the following reagents: However, the thiol-and-amine crosslinker only needs to have a thiol reactive group and an amine reactive group. The thiol reactive group of the thiol-and-amine crosslinker can include preferably one moiety chosen from the following group: wherein X can be a halogen. Additionally, R5 can be chosen from the group including hydrogen, substituted alkyl, unsubstituted alkyl, substituted heteroalkyl, substituted cycloalkyl, unsubstituted cycloalkyl, substituted heterocycloalkyl, substituted heteroaryl, or unsubstituted heteroaryl. The amine reactive group of the thiol-and-amine crosslinker can include preferably one moiety chosen from the following group: wherein X is a halogen. In this embodiment, the kit may be used to crosslink endogenous HECTE3 ubiquitin ligases including, but not limited to, one of the following: NEDD4; NEDD4L; ITCH; WWP1; WWP2; SMURF1; SMURF2; NEDL1; NEDL2; E6AP; HECTD2; KIAA0614; TRIP12; G2E3; EDD; HACE1; HECTD1; UBE3B; UBEC; KIAA0317; HUWE1; HECTD3; HERC1; HERC2; HERC3; HERC4; HERC5; and HERC6. A second kit disclosed herein includes a buffer solution, a thiol-and-amine crosslinker, and a set of instructions for a protocol to use the thiol-and-amine crosslinker to crosslink a protein substrate with a HECT-ubiquitin ligase resulting in a crosslinked protein substrate˜HECT-ubiquitin ligase complex in the provided buffer solution. In a first aspect of this kit, the buffer solution includes mammalian cell lysate. In an additional aspect, the buffer solution includes a HECT-ubiquitin ligase. The HECT-ubiquitin ligase may be a yeast HECT ligase, a HECT-like ubiquitin ligase, or a HECTE3 ubiquitin ligase. Yeast HECT ligases that may be incorporated include, but are not limited to: Rsp5; Ufd4; Hu15; Tom1; and Hu14. HECT-like ubiquitin ligases that may be incorporated include, but are not limited to SopA and NIeL. The HECTE3 ubiquitin ligases that may be incorporated include, but are not limited to: NEDD4; NEDD4L; ITCH; WWP1; WWP2; SMURF1; SMURF2; NEDL1; NEDL2; E6AP; HECTD2; KIAA0614; TRIP12; G2E3; EDD; HACE1; HECTD1; UBE3B; UBEC; KIAA0317; HUWE1; HECTD3; HERC1; HERC2; HERC3; HERC4; HERC5; and HERC6. In this kit embodiment, the thiol-and-amine crosslinker in the kit may include, but is not limited to, one of the following: However, the thiol-and-amine crosslinker only needs to have a thiol reactive group and an amine reactive group. The thiol reactive group of the thiol-and-amine crosslinker can include preferably one moiety chosen from the following group: wherein X can be a halogen. Additionally, R5 can be chosen from the group including hydrogen, substituted alkyl, unsubstituted alkyl, substituted heteroalkyl, substituted cycloalkyl, unsubstituted cycloalkyl, substituted heterocycloalkyl, substituted heteroaryl, or unsubstituted heteroaryl. The amine reactive group of the thiol-and-amine crosslinker can include preferably one moiety chosen from the following group: wherein X is a halogen. These methods also provide a robust and general means for identifying a protein substrate for a HECT-ubiquitin ligase. The method includes providing a sample suspected to contain a protein substrate for a HECT-ubiquitin ligase; adding a buffer solution to the sample to form a first mixture; adding a thiol-and-amine crosslinker to the first mixture to create a second mixture; reacting the second mixture under conditions to create a crosslinked protein substrate HECT-ubiquitin ligase pair; and adding a quenching solution to the mixture. The presence of the crosslinked protein substrate HECT-ubiquitin ligase pair is indicative of a protein substrate for a HECT-ubiquitin ligase. The crosslinked protein substrate˜HECT-ubiquitin ligase complex may be isolated using a variety of techniques, including the use of affinity-tag reagents that retrieve pre-labeled HECT-ubiquitin ligase containing a tag (for example, hexahistidine motif, a GST moiety, a biotin moiety, etc.) or use of an anti-HECT-ubiquitin ligase antibody in conjunction with immunoprecipitation or affinity chromatography methods. Such HECT-ubiquitin ligase reagents can be generated readily by molecular biological, genetic and immunological approaches, all of which are known in the art or that may be available from commercial sources. The use of a reversible or cleavable thiol-and-amine crosslinker is preferred in such assays to enable release of the protein substrate from the HECT-ubiquitin ligase in the crosslinked protein substrate˜HECT-ubiquitin ligase complex. The released protein substrate can then be identified based upon limited protein sequencing analyses of the protein, coupled to molecular biology and recombinant, molecular genetic approaches as well as proteomic and genomic database searching tools. This method may enable for rapid identification of proteins important for use as reagents and markers for various purposes, including without limitation, uses for diagnostic and therapeutic applications. Examples Reagents and Materials UBE1(yeast) and UbcH5a (human recombinant) were purchased from R&D Systems. Ubiquitin (from bovine erythrocytes) was purchased from Sigma-Aldrich. All bifunctional, thiol-and-amine crosslinkers were purchased from Pierce Biotechnology (Rockford, Ill.). Such bifunctional crosslinking reagents are also available from other commercial sources including the following: Calbiochem (San Diego, Calif.); G-Biosciences (St. Louis, Mo.); Life Technologies (Grand Island, N.Y.); ProteoChem, Inc. (Denver, Colo.); PrimeTech (Minsk, Belarus); and Biomol GmbH (Hamburg, Del.). The purchased proteins were used without further purification. Precast 12% and 7.5% SDS gels were purchased from Biorad (Mini-PROTEAN precast gels). In-gel fluorescence imaging was performed on a Typhoon 9600 (GE Healthcare). All gels were visualized with the Colloidal Blue Staining Kit (Invitrogen). GST-Rsp5 in pGEX-6p-1 and Sic60-GFP in pET3a vectors were gifts from Prof. Andreas Matouschek, and Rsp5ΔWW in pGEX-6p-1 was a gift from Prof. Linda Hicke, both of Northwestern University. For MS/MS analysis, excised protein bands of interest were reduced by DTT, alkylated with iodoacetamide, and then digested with trypsin. The extracted peptides were analyzed by nano-capillary LC-MS using a 100 mm×75 μm C18 column in-line with a 7T LTQ-FT (ThermoFisher, San Jose, Calif.). Example 1 Purification of Rsp5 and Mutant Forms BL21(DE3)pLysS cells (Novagen) were transformed with GST-Rsp5 in pGEX-6p-1 vector, and were induced to express with IPTG (0.5 mM). Induction of GST-Rsp5 was performed at 18° C. overnight. Cells were then harvested and lysed by sonication in phosphate-buffered saline (PBS) with protease inhibitors (Complete Mini Protease Inhibitor Cocktail, Roche). The supernatant was incubated with glutathione agarose beads (Pierce Biotechnology) for 1-2 hr at 4° C. The beads were washed three times with PBS and incubated with PreScission Protease overnight at 4° C. to elute Rsp5 (50 mM HEPES, 150 mM NaCl, 0.1 mM EDTA). Rsp5 C777A, Rsp5 Δ3C, Rsp5 Δ4C mutant proteins were prepared using the same protocol. Mutations of surface and catalytic cysteines in Rsp5 were performed with a QuickChange kit (Stratagene). Example 2 Purification of Sic60-GFP and Mutant Forms BL21(DE3)pLysS cells (Novagen) were transformed with Sic60-GFP in pET3a vector, and were induced to express with IPTG (1.0 mM). Induction of Sic60-GFP was performed at 37° C. for 4 hr. Cells were then harvested and lysed by sonication in Buffer A (50 mM NaPO4, 300 mM NaCl, pH 7) with protease inhibitors (Complete Mini Protease Inhibitor Cocktail, EDTA free, Roche). The resulting supernatant was incubated with HisPur Ni-NTA Resin (Pierce Biotechnology) at 4° C. for 1-2 hr. Beads were then washed with PBS, Buffer B (50 mM NaPO4, 300 mM NaCl, 10 mM imidazole, pH 7) prior to eluting protein with Buffer C (50 mM NaPO4, 300 mM NaCl, 150 mM imidazole, pH 7). The elution fraction was dialyzed against buffer D (50 mM HEPES, 150 mM NaCl, 0.1 mM EDTA) overnight. Sic60-GFPΔPY mutant protein was prepared using the same protocol. Mutations of Tyr9 to Ala9 residues in Sic60-GFP were performed with a QuickChange kit (Stratagene). An illustration of this mutant protein is depicted in FIG. 11A and the ubiquitination activity using this mutant protein as a substrate is illustrated in FIG. 11B. Example 3 Enzymatic Activity Assay for Rsp5, Rsp5 C777A, Rsp5 Δ3C, and Rsp5Δ4C All enzymatic reactions (30 μL total volume) were performed in buffer containing HEPES (25 mM. pH 7.6), NaCl (50 mM), MgCl2 (4 mM) with the indicated amount of UBE1, UbcH5a, ubiquitin, Rsp5 and substrates. Upon addition of ATP (4 mM), reactions were incubated for 2 hr and were then quenched with 6 μL of 6x Laemmli loading buffer, resolved by 12% or 7.5% SDS-PAGE, and imaged by in-gel scanning fluorescence imaging (Typhoon 9600, GE Healthcare). In the negative control reactions, the corresponding volume of water was added instead of ATP. Colloidal Coomassie staining reagent was also used to visualize ubiquitinated proteins. For examples of these assays, see FIGS. 6B, 8B, 10B and 11B. Example 4 Crosslinking Assay All crosslinking reactions (30 μL total volume) were performed in buffer that contains HEPES (25 mM, pH 7.6), NaCl (50 mM), MgCl2 (4 mM) and Triton X (1.0%) with indicated amounts of Rsp5 and substrate. Crosslinking reactions were initiated by adding 0.24 μL of a thiol-and-amine crosslinking agent stock solution (10 mM thiol-and-amine crosslinking agent in DMSO) to the reaction mixture. After incubating the reaction mixture at room temperature for 1 hr, reactions were quenched by adding 6 μL of 6x Laemmli loading buffer, 1 μL of β-mercaptoethanol and 1.5 μL of 1 M Tris buffer (pH 7.6). For the reductively cleavable crosslinker 16, β-mercaptoethanol was not used in the quench. The sample mixtures (12.0 μL total) were resolved by 7.5% SDS-PAGE and imaged by in-gel scanning fluorescence (Typhoon 9600, GE Healthcare). In the negative control reactions, the corresponding volume of DMSO was added instead of the crosslinkers. Colloidal Coomassie staining reagent was also used to visualize crosslinked proteins. Examples of the crosslinking assays are illustrated, for example, in FIGS. 3, 5, 7, 8C and 9. Example 5 Purification of Intact GST-Rsp5 HECT-Ubiquitin Ligase (Prophetic) GST-Rsp5 HECT-ubiquitin ligase will be purified from bacterial expression lysates with the GST tag intact on the recombinant GST-Rsp5 HECT-ubiquitin ligase using the following procedure. Bacterial expression lysate containing recombinant GST-Rsp5 HECT-ubiquitin ligase will be incubated with glutathione agarose beads (Pierce Biotechnology) at 4° C. for 1-2 hr. The beads will be washed three times with buffer (50 mM Tris, 150 mM NaCl, pH 8.0) and subjected to chromatography using a gradient of 1 mM to 50 mM reduced glutathione in buffer (50 mM Tris, 150 mM NaCl, pH 8.0) at 4° C. to elute the GST-Rsp5 HECT-ubiquitin ligase. The GST-Rsp5 HECT-ubiquitin ligase will be subjected to dialysis and concentration against glutathione-free buffer to remove the glutathione. Example 6 Identifying Protein Substrates for a HECT-Ubiquitin Ligase (Prophetic) Two different procedures are presented that use different thiol-and-amine crosslinkers to capture the protein substrates of a HECT-ubiquitin ligase. In the first procedure, an acid-labile thiol-and-amine crosslinker will be used. In the second procedure, a thiol-cleavable thiol-and-amine crosslinker will be used. Procedure 1: A volume (100 μL) of clarified yeast cellular extract containing 100 μg of whole cell yeast protein will be introduced into a 1.5 mL microfuge tube. This volume will be adjusted with a concentrated buffer solution to provide a final buffer solution consisting of HEPES (25 mM. pH 7.6), NaCl (50 mM), MgCl2 (4 mM) and Triton X (1.0%) to form a first mixture. A 10 μL volume of recombinant GST-Rsp5 HECT-ubiquitin ligase (1 mg/mL), which will be prepared according to Example 5, will be added to the first mixture to form a second mixture. After incubating the second mixture at a temperature ranging from 4° C. to 30° C. for 5-10 min, a volume (10 μL) of 25 mM Succinimidyl 3-(bromoacetamido)-propionate (Pierce/Thermo Scientific Catalog #22339) will be added to the second mixture to form the crosslinking reaction mixture. After incubating the crosslinking reaction mixture at room temperature for 1 hr, the crosslinking reaction will be quenched by adding 10 μL of 50 mM β-mercaptoethanol and 10 μL of 1 M Tris buffer (pH 7.6) to the crosslinking reaction mixture to form a quenched reaction mixture. The quenched reaction mixture will be incubated at room temperature for 10 min. The crosslinked protein substrate˜GST-Rsp5 complex(es) will be purified from the quenched reaction mixture by incubating the quenched reaction mixture with glutathione agarose beads (Pierce Biotechnology) at 4° C. for 1-2 hr. The beads will be washed three times with PBS to remove any uncrosslinked proteins. The crosslinked protein substrate˜GST-Rsp5 HECT-ubiquitin ligase complex(es) bound to the glutathione agarose beads will be subjected to mild acid hydrolysis to cleave the crosslinker. The initial supernatant from this mild acid treatment and subsequent, mildly acidic washes of the glutathione agarose beads will contain released protein substrate(s) free of the recombinant GST-Rsp5 HECT-ubiquitin ligase. The initial and subsequent wash supernatants will be combined and neutralized with appropriately pH buffer at a suitable concentration. Procedure 2: The same methods will be used for the second procedure as described for the first procedure, except for three differences in method details. First, the second procedure will use a volume (10 μL) of 25 mM thiol-and-amine crosslinker 16 in place of the Succinimidyl 3-(bromoacetamido)propionate (Pierce/Thermo Scientific Catalog #22339) that is described in the first procedure. Second, the second procedure will use a quenching solution lacking β-mercaptoethanol, which is present in the quenching solution of the first procedure. This is an important modification because the thiol-and-amine crosslinker 16 contains a disulfide bond that is sensitive to cleavage by β-mercaptoethanol. So inclusion of β-mercaptoethanol prior to purification of the crosslinked protein substrate˜GST-Rsp5 HECT-ubiquitin ligase complexes would result in premature loss of the crosslinked protein substrate(s) before purification of the complexes. Third, the second procedure will use β-mercaptoethanol (10 mM -100 mM) rather than acid to cleave the crosslinker, thereby releasing the protein substrate(s) from the crosslinked protein substrate˜GST-Rsp5 HECT-ubiquitin ligase complexes following their purification (that is, when the complexes are immobilized on the glutathione column). The solution containing released protein substrate(s) from foregoing procedures will be concentrated or precipitated using standard methods. The released protein substrate(s) will be resuspended in loading buffer and chromatographically resolved by gel electrophoresis on SDS-PAGE gels. Following silver staining of the gels after electrophoresis, bands corresponding to individual protein species will be excised for protein sequence analyses according to standard techniques. The identity of the protein species will be deduced based upon a combination of protein sizing, protein sequence analysis, as well as genomic and proteomic bioinformatics. These proteins may then be selected for expression and use as reagents for diagnostic and/or therapeutic applications. It should be understood that the methods, procedures, operations, devices, and systems illustrated in the figures may be modified without departing from the spirit of the present disclosure. For example, these methods, procedures, operations, devices and systems may include more or fewer steps or components than appear herein, and these steps or components may be combined with one another, in part or in whole. Furthermore, the present disclosure is not to be limited in terms of the particular embodiments described in this application, which are intended as illustrations of various aspects. Many modifications and variations can be made without departing from its scope and spirit. Functionally equivalent methods and apparatuses within the scope of the disclosure, in addition to those enumerated herein, will be apparent to those skilled in the art from the foregoing descriptions. TERMINOLOGY AND DEFINITIONS The terminology used herein is for the purpose of describing particular embodiments only, and is not intended to be limiting. With respect to the use of substantially, any plural and/or singular terms herein, those having skill in the art can translate from the plural as is appropriate to the context and/or application. The various singular/plural permutations may be expressly set forth herein for the sake of clarity. Terms used herein are intended as “open” terms. For example, the term “including” also means “including but not limited to;” the term “having” also means “having at least;” and the term “includes” also means “includes but is not limited to.” Furthermore, in those instances where a convention analogous to “at least one of A, B and C, etc.” is used, in general such a construction is intended in the sense of one having ordinary skill in the art would understand the convention (e.g., “a system having at least one of A, B and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together.). It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description or figures, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or ‘B or “A and B.” All language such as “up to,” “at least,” “greater than,” “less than,” and the like, includes the number recited and refer to ranges which can subsequently be broken down into sub-ranges as discussed above. A range includes each individual member. Thus, for example, a group having 1-3 members refers to groups having 1, 2, or 3 members. Similarly, a group having 5 members refers to groups having 1, 2, 3, 4, or 5 members, and so forth. The phrase “thiol-and-amine crosslinker” refers to a crosslinking regent having at least one thiol-reactive group and at least one amine-reactive group. Preferred thiol-and-amine crosslinkers are bifunctional crosslinking reagents having one thiol-reactive group and one amine-reactive group. As used herein, the phrase “crosslinked protein substrate˜HECT-ubiquitin ligase complex” refers to at least one covalent species that contains at least one protein substrate for a HECT-ubiquitin ligase and at least one HECT-ubiquitin ligase, wherein the at least one protein substrate for a HECT-ubiquitin ligase is covalently-coupled to the at least one HECT-ubiquitin ligase through reaction with at least one bifunctional thiol-and-amine crosslinker. As used herein, “crosslinked protein substrate˜HECT-ubiquitin ligase complex” includes a protein substrate˜HECT-ubiquitin ligase pair formed through reaction between one protein substrate for a HECT-ubiquitin ligase and one HECT-ubiquitin ligase with at least one bifunctional thiol-and-amine crosslinker. Finally, “crosslinked protein substrate˜HECT-ubiquitin ligase complex” also includes higher order covalent species that contain more than one protein substrate for a HECT-ubiquitin ligase and/or more than one HECT-ubiquitin ligase coupled together through reaction with one or more bifunctional thiol-and-amine crosslinkers. The phrase “protein substrate˜HECT-ubiquitin ligase pair” refers to a complex between one protein substrate for a HECT-ubiquitin ligase and one HECT-ubiquitin ligase that are covalently-coupled together with at least one bifunctional thiol-and-amine crosslinker. Several terms having the same meaning are used interchangeably as described herein. The following pairs of terms have the same meaning with respect to that pair: Rsp5 C777A and C777A; Rsp5 Δ3C and Δ3C; Rsp Δ4C and Δ4C; and GFP-Sic60 and Sic60-GFP. What is claimed is: 1. A method for forming a crosslinked protein substrate˜HECT-ubiquitin ligase complex in a buffer solution, comprising: providing a buffer solution; adding a thiol-and-amine crosslinker to the buffer solution to create a mixture; and reacting the mixture to create a crosslinked protein substrate˜HECT-ubiquitin ligase complex. 2. The method of claim 1, wherein the buffer solution comprises a mammalian cell lysate. 3. The method of claim 1 or 2, wherein the buffer solution comprises at least one HECT-ubiquitin ligase. 4. The method of claim 3, wherein the at least one HECT-ubiquitin ligase comprises a HECTE3 ubiquitin ligase. 5. The method of claim 4, wherein the HECTE3 ubiquitin ligase is selected from the group consisting of NEDD4L, ITCH, WWP1, WWP2, SMURF1, SMURF2, NEDL1, NEDL2, E6AP, HECTD2, KIAA0614, TRIP12, G2E3, EDD, HACE1, HECTD1, UBE3B, UBEC, KIAA0317, HUWE1, HECTD3, HERC1, HERC2, HERC3, HERC4, HERC5 and HERC6. 6. The method of claim 3, where the at least one HECT-ubiquitin ligase comprises a HECT-like ligase. 7. The method of claim 6, wherein the HECT-like ligase is SopA or NIeL. 8. The method of claim 3, wherein the at least one HECT-ubiquitin ligase comprises a yeast HECT ligase. 9. The method of claim 8, wherein the yeast HECT ligase is selected from the group consisting of Rsp5, Ufd4, Hu15, Tom1 and Hu14. 10. The method of any of the preceding claims, wherein the buffer solution comprises a protein substrate of at least one HECT-ubiquitin ligase. 11. The method of any of the preceding claims, wherein the crosslinked protein substrate˜HECT-ubiquitin ligase complex comprises a crosslinked protein substrate˜HECT-ubiquitin ligase pair. 12. The method of the preceding claims, wherein the thiol-and-amine crosslinker is selected from the group consisting of: 13. The method of any of claims 1-11, wherein the thiol-and-amine crosslinker is: 14. The method of claim 1, further comprising a step of adding a quenching solution to the mixture. 15. A method of claim 14, wherein the quenching solution comprises a loading buffer, β-mercaptoethanol and tris buffer. 16. A method of claim 14, wherein the quenching solution comprises of loading buffer and tris buffer. 17. A kit for forming a crosslinked protein substrate˜HECT-ubiquitin ligase complex in a cell lysate, comprising: a thiol-and-amine crosslinker; and instructions to use the thiol-and-amine crosslinker in a cell lysate to crosslink an endogenous protein substrate with an endogenous HECT-ubiquitin ligase resulting in the formation of a crosslinked protein substrate˜HECT-ubiquitin ligase complex. 18. The kit of claim 17, wherein the thiol-and-amine crosslinker is selected from the group consisting of 19. The kit of claim 17 or 18, wherein the crosslinked protein substrate˜HECT-ubiquitin ligase complex comprises a crosslinked protein substrate˜HECT-ubiquitin ligase pair. 20. A kit for forming a crosslinked protein substrate˜HECT-ubiquitin ligase complex in buffer solution, comprising: a buffer solution; a thiol-and-amine crosslinker; and instructions to use said thiol-and-amine crosslinker to crosslink a protein substrate with a HECT-ubiquitin ligase in said buffer solution resulting in the formation of a crosslinked protein substrate˜HECT-ubiquitin ligase complex. 21. The kit of claim 20, wherein the crosslinked protein substrate˜HECT-ubiquitin ligase complex comprises a crosslinked protein substrate˜HECT-ubiquitin ligase pair. 22. The kit of claims 20 and 21, wherein the buffer solution comprises a mammalian cell lysate. 23. The kit of any one of claims 20-22, wherein the buffer solution comprises at least one HECT-ubiquitin ligase. 24. The kit of claim 23, wherein the at least one HECT-ubiquitin ligase comprises a HECTE3 ubiquitin ligase. 25. The kit of claim 24, wherein the HECTE3 ubiquitin ligase is selected from the group consisting of NEDD4, NEDD4L, ITCH, WWP1, WWP2, SMURF1, SMURF2, NEDL1, NEDL2, E6AP, HECTD2, KIAA0614, TRIP12, G2E3, EDD, HACE1, HECTD1, UBE3B, UBEC, KIAA0317, HUWE1, HECTD3, HERC1, HERC2, HERC3, HERC4, HERC5 and HERC6. 26. The kit of claim 23, wherein the at least one HECT-ubiquitin ligase comprises a HECT-like ubiquitin ligase. 27. The kit of claim 26, wherein the HECT-like ubiquitin ligase is SopA or NIeL. 28. The kit of claim 23, wherein the at least one HECT-ubiquitin ligase comprises a yeast HECT ligase. 29. The kit of claim 28, wherein the yeast HECT ligase is selected from the group consisting of Rsp5, Ufd4, Hu15, Tom1 and Hu14. 30. The kit of any one of claims 20-29, wherein the thiol-and-amine crosslinker is selected from the group consisting of:

2013-07-18

en

2015-06-25

US-368301-A

Systems and methods for using distributed interconnects in information management enviroments ABSTRACT A distributed interconnect may be employed in information management environments to distribute functionality, for example, among processing engines of an information management system and/or processing modules thereof. Distributive interconnects such as switch fabrics and virtual distributed interconnect backplanes, may be employed to establish independent paths from node to node and thus may be used to facilitate parallel and independent operation of each processing engine of a multi-processing engine information management system, e.g. to provide peer-to-peer communication between the engines on an as-needed basis. These and other features of distributed interconnects may be advantageously employed to optimize information management systems operations in a variety of system configurations. [0001] This application is a continuation-in-part of co-pending U.S. patent application Ser. No. 09/879,810 filed on Jun. 12, 2001 which is entitled “SYSTEMS AND METHODS FOR PROVIDING DIFFERENTIATED SERVICE IN INFORMATION MANAGEMENT ENVIRONMENTS,” and also claims priority from co-pending Provisional Application Serial No. 60/285,211 filed on Apr. 20, 2001 which is entitled “SYSTEMS AND METHODS FOR PROVIDING DIFFERENTIATED SERVICE IN A NETWORK ENVIRONMENT,” and also claims priority from co-pending Provisional Application Serial No. 60/291,073 filed on May 15, 2001 which is entitled “SYSTEMS AND METHODS FOR PROVIDING DIFFERENTIATED SERVICE IN A NETWORK ENVIRONMENT,” the disclosures of each of the forgoing applications being incorporated herein by reference. This application also claims priority from co-pending U.S. patent application Ser. No. 09/797,200 filed on Mar. 1, 2001 which is entitled “SYSTEMS AND METHODS FOR THE DETERMINISTIC MANAGEMENT OF INFORMATION” which itself claims priority from Provisional Application Serial No. 60/187,211 filed on Mar. 3, 2000 which is entitled “SYSTEM AND APPARATUS FOR INCREASING FILE SERVER BANDWIDTH,” the disclosures of each of the forgoing applications being incorporated herein by reference. This application also claims priority from co-pending Provisional Application Serial No. 60/246,401 filed on Nov. 7, 2000 which is entitled “SYSTEM AND METHOD FOR THE DETERMINISTIC DELIVERY OF DATA AND SERVICES,” the disclosure of which is incorporated herein by reference. BACKGROUND OF THE INVENTION [0002] The present invention relates generally to computing systems, and more particularly to network connected computing systems. [0003] Most network computing systems, including servers and switches, are typically provided with a number of subsystems that interact to accomplish the designated task/s of the individual computing system. Each subsystem within such a network computing system is typically provided with a number of resources that it utilizes to carry out its function. In operation, one or more of these resources may become a bottleneck as load on the computing system increases, ultimately resulting in degradation of client connection quality, severance of one or more client connections, and/or server crashes. [0004] Network computing system bottlenecks have traditionally been dealt with by throwing more resources at the problem. For example, when performance degradation is encountered, more memory, a faster CPU (central processing unit), multiple CPU's, or more disk drives are added to the server in an attempt to alleviate the bottlenecks. Such solutions therefore typically involve spending more money to add more hardware. Besides being expensive and time consuming, the addition of hardware often only serves to push the bottleneck to a different subsystem or resource. [0005] Issues associated with thin last mile access networks are currently being addressed by technologies such as DSL and cable modems, while overrun core networks are being improved using, for example, ultra-high speed switching/routing and wave division multiplexing technologies. However, even with the implementation of such technologies, end user expectations of service quality per device and content usage experience is often not met due to network equipment limitations encountered in the face of the total volume of network usage. Lack of network quality assurance for information management applications such as content delivery makes the implementation of mission-critical or high quality content delivery undesirable on networks such as the Internet, limiting service growth and profitability and leaving content delivery and other information management applications as thin profit commodity businesses on such networks. [0006] Often the ultimate network bottleneck is the network server itself. For example, to maintain high-quality service for a premium customer necessarily requires that the traditional video server be under-utilized so that sufficient bandwidth is available to deliver a premium video stream without packet loss. However, to achieve efficient levels of utilization the server must handle multiple user sessions simultaneously, often including both premium and non-premium video streams. In this situation, the traditional server often becomes overloaded, and delivers all streams with equal packet loss. Thus, the premium customer has the same low quality experience as a non-premium customer. [0007] A number of standards, protocols and techniques have been developed over the years to provide varying levels of treatment for different types of traffic on local area networks (“LANs”). These standards have been implemented at many Open System Interconnection (“OSI”) levels. For example, Ethernet has priority bits in the 802.1 p/q header, and. TCP/IP has TOS bits. Presumably, switches and routers would use these bits to give higher priority to packets labeled with one set of bits, as opposed to another. RSVP is a signaling protocol that is used to reserve resources throughout the LAN (from one endpoint to another), so that bandwidth for a connection can be guaranteed. Many of these protocols have being considered for use within the Internet. SUMMARY OF THE INVENTION [0008] Disclosed herein are systems and methods for the deterministic management of information, such as management of the delivery of content across a network that utilizes computing systems such as servers, switches and/or routers. Among the many advantages provided by the disclosed systems and methods are increased performance and improved predictability of such computing systems in the performance of designated tasks across a wide range of loads. Examples include greater predictability in the capability of a network server, switch or router to process and manage information such as content requests, and acceleration in the delivery of information across a network utilizing such computing systems. [0009] Deterministic embodiments of the disclosed systems and methods may be implemented to achieve substantial elimination of indeterminate application performance characteristics common with conventional information management systems, such as conventional content delivery infrastructures. For example, the disclosed systems and methods may be advantageously employed to solve unpredictability, delivery latencies, capacity planning, and other problems associated with general application serving in a computer network environment, for example, in the delivery of streaming media, data and/or services. Other advantages and benefits possible with implementation of the disclosed systems and methods include maximization of hardware resource use for delivery of content while at the same time allowing minimization of the need to add expensive hardware across all functional subsystems simultaneously to a content delivery system, and elimination of the need for an application to have intimate knowledge of the hardware it intends to employ by maintaining such knowledge in the operating system of a deterministically enabled computing component. [0010] In one exemplary embodiment, the disclosed systems and methods may be employed with network content delivery systems to manage content delivery hardware in a manner to achieve efficient and predictable delivery of content. In another exemplary embodiment, deterministic delivery of data through a content delivery system may be implemented with end-to-end consideration of QoS priority policies within and across all components from storage disk to wide area network (WAN) interface. In yet another exemplary embodiment, delivery of content may be tied to the rate at which the content is delivered from networking components. These and other benefits of the disclosed methods and systems may be achieved, for example, by incorporating intelligence into individual system components. [0011] The disclosed systems and methods may be implemented to utilize end-to-end consideration of quality assurance parameters so as to provide scalable and practical mechanisms that allow varying levels of service to be differentially tailored or personalized for individual network users. Consideration of such quality assurance parameters may be used to advantageously provide end-to-end network systems, such as end-to-end content delivery infrastructures, with network based mechanisms that provide users with class of service (“CoS”), quality of service (“QoS”), connection admission control, etc. This ability may be used by service providers (“xSPs”) to offer their users premium information management services for premium prices. Examples of such xSPs include, but are not limited to, Internet service providers (“ISPs”), application service providers (“ASPs”), content delivery service providers (“CDSPs”), storage service providers (“SSPs”), content providers (“CPs”), Portals, etc. [0012] Certain embodiments of the disclosed systems and methods may be advantageously employed in network computing system environments to enable differentiated service provisioning, for example, in accordance with business objectives. Examples of types of differentiated service provisioning that may be implemented include, but are not limited to, re-provisioned and real time system resource allocation and management, service, metering, billing, etc. In other embodiments disclosed herein, monitoring, tracking and/or reporting features may be implemented in network computing system environments. Advantageously, these functions may be implemented at the resource, platform subsystem, platform, and/or application levels, to fit the needs of particular network environments. In other examples, features that may be implemented include, but are not limited to, system and Service Level Agreement (SLA) performance reporting, content usage tracking and reporting (e.g., identity of content accessed, identity of user accessing the content, bandwidth at which the content is accessed, frequency and/or time of day of access to the content, etc.), bill generation and/or billing information reporting, etc. Advantageously, the disclosed systems and methods make possible the delivery of such differentiated information management features at the edge of a network (e.g., across single or multiple nodes), for example, by using SLA policies to control system resource allocation to service classes (e.g., packet processing) at the network edge, etc. [0013] In one disclosed embodiment, an information management system platform may be provided that is capable of delivering content, applications and/or services to a network with service guarantees specified through policies. Such a system platform may be advantageously employed to provide an overall network infrastructure the ability to provide differentiated services for bandwidth consumptive applications from the xSP standpoint, advantageously allowing implementation of rich media audio and video content delivery applications on such networks. [0014] In a further embodiment disclosed herein, a separate operating system or operating system method may be provided that is inherently optimized to allow standard/traditional network-connected compute system applications (or other applications designed for traditional I/O intensive environments) to be run without modification on the disclosed systems having multi-layer asymmetrical processing architecture, although optional modifications and further optimization are possible if so desired. Examples include, but are not limited to, applications related to streaming, HTTP, storage networking (network attached storage (NAS), storage area network (SAN), combinations thereof, etc.), data base, caching, life sciences, etc. [0015] In yet another embodiment disclosed herein, a utility-based computing process may be implemented to manage information and provide differentiated service using a process that includes provisioning of resources (e.g., based on SLA policies), tracking and logging of provisioning statistics (e.g., to measure how well SLA policies have been met), and transmission of periodic logs to a billing system (e.g., for SLA verification, future resource allocation, bill generation, etc.). Such a process may also be implemented so as to be scalable to bandwidth requirements (network (NET), compute, storage elements, etc.), may be deterministic at various system levels (below the operating system level, at the application level, at the subsystem or subscriber flow level, etc.), may be implemented across all applications hosted (HTTP, RTSP, NFS, etc.), as well as across multiple users and multiple applications, systems, and operating system configurations. [0016] Advantageously, the scalable and deterministic aspects of certain embodiments disclosed herein may be implemented in a way so as to offer surprising and significant advantages with regard to differentiated service, while at the same time providing reduced total cost of system use, and increased performance for system cost relative to traditional computing and network systems. Further, these scalable and deterministic features may be used to provide information management systems capable of performing differentiated service functions or tasks such as service prioritization, monitoring, and reporting functions in a fixed hardware implementation platform, variable hardware implementation platform or distributed set of platforms (either full system or distributed subsystems across a network), and which may be further configured to be capable of delivering such features at the edge of a network in a manner that is network transport independent. [0017] In one specific example, deterministic management of information may be implemented to extend network traffic management principles to achieve a true end-to-end quality experience, for example, all the way to the stored content in a content delivery system environment. For example, the disclosed systems and methods may be implemented in one embodiment to provide differentiated service functions or tasks (e.g., that may be content-aware, user-aware, application-aware, etc.) in a storage spindle-to-WAN edge router environment, and in doing so make possible the delivery of differentiated information services and/or differentiated business services. [0018] In other embodiments, distributed interconnects may be employed in information management environments to distribute functionality, for example, among processing engines of an information management system and/or processing modules thereof Distributive interconnects such as switch fabrics and virtual distributed interconnect backplanes, may be employed to establish independent paths from node to node and thus may be used to facilitate parallel and independent operation of each processing engine of a multi-processing engine information management system, e.g., to provide peer-to-peer communication between the engines on an as-needed basis. [0019] In one respect, disclosed herein is a system for loading an executable image on to at least one image receiver, the system including at least one image source, the image source having access to at least one executable image; and the system also including at least one image receiver coupled to the at least one image source by a distributed interconnect, with the at least one image source being capable of communicating the executable image to the at least one image receiver across the distributed interconnect for loading on to the at least one image receiver. Exemplary types of distributed interconnects that may be employed in the system include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0020] In another respect, disclosed herein is a method of loading an executable image on to at least one image receiver. The method may include the steps of: communicating the executable image from at least one image source to the at least one image receiver; and loading the executable image on to the image receiver; with the at least one image source and the at least one image receiver being coupled together by a distributed interconnect, and with the executable image being communicated from the at least one image source to the at least one image receiver across the distributed interconnect. Exemplary types of distributed interconnects that may be employed in the practice of the method include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0021] In another respect, disclosed herein is a system for interfacing a first processing object with a second processing object, the system including: a first processing engine, the first processing engine having the first processing object residing thereon; and a second processing engine coupled to the first processing engine by a distributed interconnect, the second processing engine having the second processing object residing thereon; with the second processing object being specific to the first processing object, and with the first object being capable of interfacing with the second object across the distributed interconnect. Exemplary types of distributed interconnects that may be employed in the system include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0022] In another respect, disclosed herein is a method of interfacing a first processing object with a second processing object, the method including interfacing the second processing object with the first processing object across a distributed interconnect; with the second processing object being specific to the first processing object. Exemplary types of distributed interconnects that may be employed in the practice of the method include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0023] In another respect, disclosed herein is a system for managing a processing object, the system including: a first processing engine, the first processing engine having at least one first processing object residing thereon; and a management entity coupled to the first processing engine by a distributed interconnect, the management entity capable of managing the first processing object residing on the first processing engine across the distributed interconnect. Exemplary types of distributed interconnects that may be employed in the system include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0024] In another respect, disclosed herein is a method of managing at least one processing object, the method including managing the processing object across a distributed interconnect. Exemplary types of distributed interconnects that may be employed in the practice of the method include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0025] In another respect, disclosed herein is a method of coordinating a group of multiple processing engines in the performance of an operating task, the method including broadcasting a multicast message to the group of multiple processing engines across a distributed interconnect, the multicast facilitating the performance of the operating task. Exemplary types of distributed interconnects that may be employed in the practice of the method include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0026] In another respect, disclosed herein is a method of analyzing software code running on a first processing engine, the method including communicating debug information associated with the code from the first processing engine to a second processing engine across a distributed interconnect. Exemplary types of distributed interconnects that may be employed in the practice of the method include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. [0027] In another respect, disclosed herein is a method of managing the manipulation of information among a group of multiple processing engines in an information management environment, each of the processing engines being capable of performing one or more information manipulation tasks, the method including: receiving first and second requests for information management; selecting a first processing flow path among the group of processing engines in order to perform a first selected combination of information manipulation tasks associated with the first request for information management; and selecting a second processing flow path among the group of processing engines in order to perform a second selected combination of information manipulation tasks associated with the second request for information management; wherein the group of multiple processing engines are coupled together by a distributed interconnect, wherein the first processing flow path may be different from the second processing flow path, and wherein the first and second processing flow paths are each selected using the distributed interconnect. Exemplary types of distributed interconnects that may be employed in the practice of the method include, but are not limited to, at least one of a switch fabric, a virtual distributed interconnect, or a combination thereof. BRIEF DESCRIPTION OF THE DRAWINGS [0028]FIG. 1A is a representation of components of a content delivery system according to one embodiment of the disclosed content delivery system. [0029]FIG. 1B is a representation of data flow between modules of a content delivery system of FIG. 1A according to one embodiment of the disclosed content delivery system. [0030]FIG. 1C is a simplified schematic diagram showing one possible network content delivery system hardware configuration. [0031]FIG. 1D is a simplified schematic diagram showing a network content delivery engine configuration possible with the network content delivery system hardware configuration of FIG. 1C. [0032]FIG. 1E is a simplified schematic diagram showing an alternate network content delivery engine configuration possible with the network content delivery system hardware configuration of FIG. 1C. [0033]FIG. 1F is a simplified schematic diagram showing another alternate network content delivery engine configuration possible with the network content delivery system hardware configuration of FIG. 1C. [0034] FIGS. 1G-1J illustrate exemplary clusters of network content delivery systems. [0035]FIG. 2 is a simplified schematic diagram showing another possible network content delivery system configuration. [0036]FIG. 2A is a simplified schematic diagram showing a network endpoint computing system. [0037]FIG. 2B is a simplified schematic diagram showing a network endpoint computing system. [0038]FIG. 3 is a functional block diagram of an exemplary network processor. [0039]FIG. 4 is a functional block diagram of an exemplary interface between a switch fabric and a processor. [0040]FIG. 5 is a flow chart illustrating a method for the deterministic delivery of content according to one embodiment of the present invention. [0041]FIG. 6 is a simplified schematic diagram illustrating a data center operable to perform deterministic delivery of content according to one embodiment of the present invention. [0042]FIG. 7 is a simplified representation illustrating interrelation of various functional components of an information management system and method for delivering differentiated service according to one embodiment of the present invention. [0043]FIG. 8 is a flow chart illustrating a method of providing differentiated service based on defined business objectives according to one embodiment of the present invention. [0044]FIG. 9A is a simplified representation illustrating an endpoint information management node and data center connected to a network according to one embodiment of the disclosed content delivery system. [0045]FIG. 9B is a simplified representation illustrating a traffic management node connected to a network according to one embodiment of the disclosed content delivery system. [0046]FIG. 9C is a simplified representation of multiple edge content delivery nodes connected to a network according to one embodiment of the disclosed content delivery system. [0047]FIG. 9D is a representation of components of an information management system interconnected across a network according to one embodiment of the disclosed content delivery system. [0048]FIG. 10 is a simplified representation of an initial image source coupled to image receiver via a distributed interconnect according to one embodiment of the disclosed systems and methods. [0049]FIG. 11 is a simplified representation of a first processing engine coupled to a second processing engine via a distributed interconnect according to one embodiment of the disclosed systems and methods. [0050]FIG. 12 is a simplified representation of multiple first processing engines coupled to multiple second processing engines via a distributed interconnect according to one embodiment of the disclosed systems and methods. [0051]FIG. 13 is a representation of data flow between modules of a content delivery system across a distributed interconnect according to one embodiment of the disclosed systems and methods. [0052]FIG. 14 is a representation of data flow between modules of a content delivery system across a distributed interconnect according to one embodiment of the disclosed systems and methods. [0053]FIG. 15 is a representation of data flow between modules of a content delivery system across a distributed interconnect according to one embodiment of the disclosed systems and methods. [0054]FIG. 16 is a representation of data flow between modules of a content delivery system across a distributed interconnect according to one embodiment of the disclosed systems and methods. DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS [0055] Disclosed herein are systems and methods for operating network connected computing systems. The network connected computing systems disclosed provide a more efficient use of computing system resources and provide improved performance as compared to traditional network connected computing systems. Network connected computing systems may include network endpoint systems. The systems and methods disclosed herein may be particularly beneficial for use in network endpoint systems. Network endpoint systems may include a wide variety of computing devices, including but not limited to, classic general purpose servers, specialized servers, network appliances, storage area networks or other storage medium, content delivery systems, corporate data centers, application service providers, home or laptop computers, clients, any other device that operates as an endpoint network connection, etc. [0056] Other network connected systems may be considered a network intermediate node system. Such systems are generally connected to some node of a network that may operate in some other fashion than an endpoint. Typical examples include network switches or network routers. Network intermediate node systems may also include any other devices coupled to intermediate nodes of a network. [0057] Further, some devices may be considered both a network intermediate node system and a network endpoint system. Such hybrid systems may perform both endpoint functionality and intermediate node functionality in the same device. For example, a network switch that also performs some endpoint functionality may be considered a hybrid system. As used herein such hybrid devices are considered to be a network endpoint system and are also considered to be a network intermediate node system. [0058] For ease of understanding, the systems and methods disclosed herein are described with regards to an illustrative network connected computing system. In the illustrative example the system is a network endpoint system optimized for a content delivery application. Thus a content delivery system is provided as an illustrative example that demonstrates the structures, methods, advantages and benefits of the network computing system and methods disclosed herein. Content delivery systems (such as systems for serving streaming content, HTTP content, cached content, etc.) generally have intensive input/output demands. [0059] It will be recognized that the hardware and methods discussed below may be incorporated into other hardware or applied to other applications. For example with respect to hardware, the disclosed system and methods may be utilized in network switches. Such switches may be considered to be intelligent or smart switches with expanded functionality beyond a traditional switch. Referring to the content delivery application described in more detail herein, a network switch may be configured to also deliver at least some content in addition to traditional switching functionality. Thus, though the system may be considered primarily a network switch (or some other network intermediate node device), the system may incorporate the hardware and methods disclosed herein. Likewise a network switch performing applications other than content delivery may utilize the systems and methods disclosed herein. The nomenclature used for devices utilizing the concepts of the present invention may vary. The network switch or router that includes the content delivery system disclosed herein may be called a network content switch or a network content router or the like. Independent of the nomenclature assigned to a device, it will be recognized that the network device may incorporate some or all of the concepts disclosed herein. [0060] The disclosed hardware and methods also may be utilized in storage area networks, network attached storage, channel attached storage systems, disk arrays, tape storage systems, direct storage devices or other storage systems. In this case, a storage system having the traditional storage system functionality may also include additional functionality utilizing the hardware and methods shown herein. Thus, although the system may primarily be considered a storage system, the system may still include the hardware and methods disclosed herein. The disclosed hardware and methods of the present invention also may be utilized in traditional personal computers, portable computers, servers, workstations, mainframe computer systems, or other computer systems. In this case, a computer system having the traditional computer system functionality associated with the particular type of computer system may also include additional functionality utilizing the hardware and methods shown herein. Thus, although the system may primarily be considered to be a particular type of computer system, the system may still include the hardware and methods disclosed herein. [0061] As mentioned above, the benefits of the present invention are not limited to any specific tasks or applications. The content delivery applications described herein are thus illustrative only. Other tasks and applications that may incorporate the principles of the present invention include, but are not limited to, database management systems, application service providers, corporate data centers, modeling and simulation systems, graphics rendering systems, other complex computational analysis systems, etc. Although the principles of the present invention may be described with respect to a specific application, it will be recognized that many other tasks or applications performed with the hardware and methods. [0062] Disclosed herein are systems and methods for delivery of content to computer-based networks that employ functional multi-processing using a “staged pipeline” content delivery environment to optimize bandwidth utilization and accelerate content delivery while allowing greater determination in the data traffic management. The disclosed systems may employ individual modular processing engines that are optimized for different layers of a software stack. Each individual processing engine may be provided with one or more discrete subsystem modules configured to run on their own optimized platform and/or to function in parallel with one or more other subsystem modules across a high speed distributive interconnect, such as a switch fabric, that allows peer-to-peer communication between individual subsystem modules. The use of discrete subsystem modules that are distributively interconnected in this manner advantageously allows individual resources (e.g., processing resources, memory resources) to be deployed by sharing or reassignment in order to maximize acceleration of content delivery by the content delivery system. The use of a scalable packet-based interconnect, such as a switch fabric, advantageously allows the installation of additional subsystem modules without significant degradation of system performance. Furthermore, policy enhancement/enforcement may be optimized by placing intelligence in each individual modular processing engine. [0063] The network systems disclosed herein may operate as network endpoint systems. Examples of network endpoints include, but are not limited to, servers, content delivery systems, storage systems, application service providers, database management systems, corporate data center servers, etc. A client system is also a network endpoint, and its resources may typically range from those of a general purpose computer to the simpler resources of a network appliance. The various processing units of the network endpoint system may be programmed to achieve the desired type of endpoint. [0064] Some embodiments of the network endpoint systems disclosed herein are network endpoint content delivery systems. The network endpoint content delivery systems may be utilized in replacement of or in conjunction with traditional network servers. A “server” can be any device that delivers content, services, or both. For example, a content delivery server receives requests for content from remote browser clients via the network, accesses a file system to retrieve the requested content, and delivers the content to the client. As another example, an applications server may be programmed to execute applications software on behalf of a remote client, thereby creating data for use by the client. Various server appliances are being developed and often perform specialized tasks. [0065] As will be described more fully below, the network endpoint system disclosed herein may include the use of network processors. Though network processors conventionally are designed and utilized at intermediate network nodes, the network endpoint system disclosed herein adapts this type of processor for endpoint use. [0066] The network endpoint system disclosed may be construed as a switch based computing system. The system may further be characterized as an asymmetric multi-processor system configured in a staged pipeline manner. [0067] Exemplary System Overview [0068]FIG. 1A is a representation of one embodiment of a content delivery system 1010, for example as may be employed as a network endpoint system in connection with a network 1020. Network 1020 may be any type of computer network suitable for linking computing systems. Content delivery system 1010 may be coupled to one or more networks including, but not limited to, the public internet, a private intranet network (e.g., linking users and hosts such as employees of a corporation or institution), a wide area network (WAN), a local area network (LAN), a wireless network, any other client based network or any other network environment of connected computer systems or online users. Thus, the data provided from the network 1020 may be in any networking protocol. In one embodiment, network 1020 may be the public internet that serves to provide access to content delivery system 1010 by multiple online users that utilize internet web browsers on personal computers operating through an internet service provider. In this case the data is assumed to follow one or more of various Internet Protocols, such as TCP/IP, UDP, HTTP, RTSP, SSL, FTP, etc. However, the same concepts apply to networks using other existing or future protocols, such as IPX, SNMP, NetBios, Ipv6, etc. The concepts may also apply to file protocols such as network file system (NFS) or common internet file system (CIFS) file sharing protocol. [0069] Examples of content that may be delivered by content delivery system 1010 include, but are not limited to, static content (e.g., web pages, MP3 files, HTTP object files, audio stream files, video stream files, etc.), dynamic content, etc. In this regard, static content may be defined as content available to content delivery system 1010 via attached storage devices and as content that does not generally require any processing before delivery. Dynamic content, on the other hand, may be defined as content that either requires processing before delivery, or resides remotely from content delivery system 1010. As illustrated in FIG. 1A, content sources may include, but are not limited to, one or more storage devices 1090 (magnetic disks, optical disks, tapes, storage area networks (SAN's), etc.), other content sources 1100, third party remote content feeds, broadcast sources (live direct audio or video broadcast feeds, etc.), delivery of cached content, combinations thereof, etc. Broadcast or remote content may be advantageously received through second network connection 1023 and delivered to network 1020 via an accelerated fiowpath through content delivery system 1010. As discussed below, second network connection 1023 may be connected to a second network 1024 (as shown). Alternatively, both network connections 1022 and 1023 may be connected to network 1020. [0070] As shown in FIG. 1A, one embodiment of content delivery system 1010 includes multiple system engines 1030, 1040, 1050, 1060, and 1070 communicatively coupled via distributive interconnection 1080. In the exemplary embodiment provided, these system engines operate as content delivery engines. As used herein, “content delivery engine” generally includes any hardware, software or hardware/software combination capable of performing one or more dedicated tasks or sub-tasks associated with the delivery or transmittal of content from one or more content sources to one or more networks. In the embodiment illustrated in FIG. 1A content delivery processing engines (or “processing blades”) include network interface processing engine 1030, storage processing engine 1040, network transport/protocol processing engine 1050 (referred to hereafter as a transport processing engine), system management processing engine 1060, and application processing engine 1070. Thus configured, content delivery system 1010 is capable of providing multiple dedicated and independent processing engines that are optimized for networking, storage and application protocols, each of which is substantially self-contained and therefore capable of functioning without consuming resources of the remaining processing engines. [0071] It will be understood with benefit of this disclosure that the particular number and identity of content delivery engines illustrated in FIG. 1A are illustrative only, and that for any given content delivery system 1010 the number and/or identity of content delivery engines may be varied to fit particular needs of a given application or installation. Thus, the number of engines employed in a given content delivery system may be greater or fewer in number than illustrated in FIG. 1A, and/or the selected engines may include other types of content delivery engines and/or may not include all of the engine types illustrated in FIG. 1A. In one embodiment, the content delivery system 1010 may be implemented within a single chassis, such as for example, a 2U chassis. [0072] Content delivery engines 1030, 1040, 1050, 1060 and 1070 are present to independently perform selected sub-tasks associated with content delivery from content sources 1090 and/or 1100, it being understood however that in other embodiments any one or more of such subtasks may be combined and performed by a single engine, or subdivided to be performed by more than one engine. In one embodiment, each of engines 1030, 1040, 1050, 1060 and 1070 may employ one or more independent processor modules (e.g., CPU modules) having independent processor and memory subsystems and suitable for performance of a given function/s, allowing independent operation without interference from other engines or modules. Advantageously, this allows custom selection of particular processor-types based on the particular sub-task each is to perform, and in consideration of factors such as speed or efficiency in performance of a given subtask, cost of individual processor, etc. The processors utilized may be any processor suitable for adapting to endpoint processing. Any “PC on a board” type device may be used, such as the ×86 and Pentium processors from Intel Corporation, the SPARC processor from Sun Microsystems, Inc., the PowerPC processor from Motorola, Inc. or any other microcontroller or microprocessor. In addition, network processors (discussed in more detail below) may also be utilized. The modular multi-task configuration of content delivery system 1010 allows the number and/or type of content delivery engines and processors to be selected or varied to fit the needs of a particular application. [0073] The configuration of the content delivery system described above provides scalability without having to scale all the resources of a system. Thus, unlike the traditional rack and stack systems, such as server systems in which an entire server may be added just to expand one segment of system resources, the content delivery system allows the particular resources needed to be the only expanded resources. For example, storage resources may be greatly expanded without having to expand all of the traditional server resources. [0074] Distributive Interconnect [0075] Still referring to FIG. 1A, distributive interconnection 1080 may be any multi-node I/O interconnection hardware or hardware/software system suitable for distributing functionality by selectively interconnecting two or more content delivery engines of a content delivery system including, but not limited to, high speed interchange systems such as a switch fabric or bus architecture. Examples of switch fabric architectures include cross-bar switch fabrics, Ethernet switch fabrics, ATM switch fabrics, etc. Examples of bus architectures include PCI, PCI-X, S-Bus, Microchannel, VME, etc. Generally, for purposes of this description, a “bus” is any system bus that carries data in a manner that is visible to all nodes on the bus. Generally, some sort of bus arbitration scheme is implemented and data may be carried in parallel, as n-bit words. As distinguished from a bus, a switch fabric establishes independent paths from node to node and data is specifically addressed to a particular node on the switch fabric. Other nodes do not see the data nor are they blocked from creating their own paths. The result is a simultaneous guaranteed bit rate in each direction for each of the switch fabric's ports. [0076] The use of a distributed interconnect 1080 to connect the various processing engines in lieu of the network connections used with the switches of conventional multi-server endpoints is beneficial for several reasons. As compared to network connections, the distributed interconnect 1080 is less error prone, allows more deterministic content delivery, and provides higher bandwidth connections to the various processing engines. The distributed interconnect 1080 also has greatly improved data integrity and throughput rates as compared to network connections. [0077] Use of the distributed interconnect 1080 allows latency between content delivery engines to be short, finite and follow a known path. Known maximum latency specifications are typically associated with the various bus architectures listed above. Thus, when the employed interconnect medium is a bus, latencies fall within a known range. In the case of a switch fabric, latencies are fixed. Further, the connections are “direct”, rather than by some undetermined path. In general, the use of the distributed interconnect 1080 rather than network connections, permits the switching and interconnect capacities of the content delivery system 1010 to be predictable and consistent. [0078] One example interconnection system suitable for use as distributive interconnection 1080 is an 8/16 port 28.4 Gbps high speed PRIZMA-E non-blocking switch fabric switch available from IBM. It will be understood that other switch fabric configurations having greater or lesser numbers of ports, throughput, and capacity are also possible. Among the advantages offered by such a switch fabric interconnection in comparison to shared-bus interface interconnection technology are throughput, scalability and fast and efficient communication between individual discrete content delivery engines of content delivery system 1010. In the embodiment of FIG. 1A, distributive interconnection 1080 facilitates parallel and independent operation of each engine in its own optimized environment without bandwidth interference from other engines, while at the same time providing peer-to-peer communication between the engines on an as-needed basis (e.g., allowing direct communication between any two content delivery engines 1030, 1040, 1050, 1060 and 1070). Moreover, the distributed interconnect may directly transfer inter-processor communications between the various engines of the system. Thus, communication, command and control information may be provided between the various peers via the distributed interconnect. In addition, communication from one peer to multiple peers may be implemented through a broadcast communication which is provided from one peer to all peers coupled to the interconnect. The interface for each peer may be standardized, thus providing ease of design and allowing for system scaling by providing standardized ports for adding additional peers. [0079] Network Interface Processing Engine [0080] As illustrated in FIG. 1A, network interface processing engine 1030 interfaces with network 1020 by receiving and processing requests for content and delivering requested content to network 1020. Network interface processing engine 1030 may be any hardware or hardware/software subsystem suitable for connections utilizing TCP (Transmission Control Protocol) IP (Internet Protocol), UDP (User Datagram Protocol), RTP (Real-Time Transport Protocol), Internet Protocol (IP), Wireless Application Protocol (WAP) as well as other networking protocols. Thus the network interface processing engine 1030 may be suitable for handling queue management, buffer management, TCP connect sequence, checksum, IP address lookup, internal load balancing, packet switching, etc. Thus, network interface processing engine 1030 may be employed as illustrated to process or terminate one or more layers of the network protocol stack and to perform look-up intensive operations, off loading these tasks from other content delivery processing engines of content delivery system 1010. Network interface processing engine 1030 may also be employed to load balance among other content delivery processing engines of content delivery system 1010. Both of these features serve to accelerate content delivery, and are enhanced by placement of distributive interchange and protocol termination processing functions on the same board. Examples of other functions that may be performed by network interface processing engine 1030 include, but are not limited to, security processing. [0081] With regard to the network protocol stack, the stack in traditional systems may often be rather large. Processing the entire stack for every request across the distributed interconnect may significantly impact performance. As described herein, the protocol stack has been segmented or “split” between the network interface engine and the transport processing engine. An abbreviated version of the protocol stack is then provided across the interconnect. By utilizing this functionally split version of the protocol stack, increased bandwidth may be obtained. In this manner the communication and data flow through the content delivery system 1010 may be accelerated. The use of a distributed interconnect (for example a switch fabric) further enhances this acceleration as compared to traditional bus interconnects. [0082] The network interface processing engine 1030 may be coupled to the network 1020 through a Gigabit (Gb) Ethernet fiber front end interface 1022. One or more additional Gb Ethernet interfaces 1023 may optionally be provided, for example, to form a second interface with network 1020, or to form an interface with a second network or application 1024 as shown (e.g., to form an interface with one or more server/s for delivery of web cache content, etc.). Regardless of whether the network connection is via Ethernet, or some other means, the network connection could be of any type, with other examples being ATM, SONET, or wireless. The physical medium between the network and the network processor may be copper, optical fiber, wireless, etc. [0083] In one embodiment, network interface processing engine 1030 may utilize a network processor, although it will be understood that in other embodiments a network processor may be supplemented with or replaced by a general purpose processor or an embedded microcontroller. The network processor may be one of the various types of specialized processors that have been designed and marketed to switch network traffic at intermediate nodes. Consistent with this conventional application, these processors are designed to process high speed streams of network packets. In conventional operation, a network processor receives a packet from a port, verifies fields in the packet header, and decides on an outgoing port to which it forwards the packet. The processing of a network processor may be considered as “pass through” processing, as compared to the intensive state modification processing performed by general purpose processors. A typical network processor has a number of processing elements, some operating in parallel and some in pipeline. Often a characteristic of a network processor is that it may hide memory access latency needed to perform lookups and modifications of packet header fields. A network processor may also have one or more network interface controllers, such as a gigabit Ethernet controller, and are generally capable of handling data rates at “wire speeds”. [0084] Examples of network processors include the C-Port processor manufactured by Motorola, Inc., the IXP1200 processor manufactured by Intel Corporation, the Prism processor manufactured by SiTera Inc., and others manufactured by MMC Networks, Inc. and Agere, Inc. These processors are programmable, usually with a RISC or augmented RISC instruction set, and are typically fabricated on a single chip. [0085] The processing cores of a network processor are typically accompanied by special purpose cores that perform specific tasks, such as fabric interfacing, table lookup, queue management, and buffer management. Network processors typically have their memory management optimized for data movement, and have multiple I/O and memory buses. The programming capability of network processors permit them to be programmed for a variety of tasks, such as load balancing, network protocol processing, network security policies, and QoS/CoS support. These tasks can be tasks that would otherwise be performed by another processor. For example, TCP/IP processing may be performed by a network processor at the front end of an endpoint system. Another type of processing that could be offloaded is execution of network security policies or protocols. A network processor could also be used for load balancing. Network processors used in this manner can be referred to as “network accelerators” because their front end “look ahead” processing can vastly increase network response speeds. Network processors perform look ahead processing by operating at the front end of the network endpoint to process network packets in order to reduce the workload placed upon the remaining endpoint resources. Various uses of network accelerators are described in the following U.S. patent applications: Ser. No. 09/797,412, filed Mar. 1, 2001 and entitled “Network Transport Accelerator,” by Bailey et. al; Ser. No. 09/797,507 filed Mar. 1, 2001 and entitled “Single Chassis Network Endpoint System With Network Processor For Load Balancing,” by Richter et. al; and Ser. No. 09/797,411 filed Mar. 1, 2001 and entitled “Network Security Accelerator,” by Canion et. al; the disclosures of which are all incorporated herein by reference. When utilizing network processors in an endpoint environment it may be advantageous to utilize techniques for order serialization of information, such as for example, as disclosed in U.S. patent application Ser. No. 09/797,197, filed Mar. 1, 2001 and entitled “Methods and Systems For The Order Serialization Of Information In A Network Processing Environment,” by Richter et. al, the disclosure of which is incorporated herein by reference. [0086]FIG. 3 illustrates one possible general configuration of a network processor. As illustrated, a set of traffic processors 21 operate in parallel to handle transmission and receipt of network traffic. These processors may be general purpose microprocessors or state machines. Various core processors 22-24 handle special tasks. For example, the core processors 22-24 may handle lookups, checksums, and buffer management. A set of serial data processors 25 provide Layer 1 network support. Interface 26 provides the physical interface to the network 1020. A general purpose bus interface 27 is used for downloading code and configuration tasks. A specialized interface 28 may be specially programmed to optimize the path between network processor 12 and distributed interconnection 1080. [0087] As mentioned above, the network processors utilized in the content delivery system 1010 are utilized for endpoint use, rather than conventional use at intermediate network nodes. In one embodiment, network interface processing engine 1030 may utilize a MOTOROLA C-Port C-5 network processor capable of handling two Gb Ethernet interfaces at wire speed, and optimized for cell and packet processing. This network processor may contain sixteen 200 MHz MIPS processors for cell/packet switching and thirty-two serial processing engines for bit/byte processing, checksum generation/verification, etc. Further processing capability may be provided by five co-processors that perform the following network specific tasks: supervisor/executive, switch fabric interface, optimized table lookup, queue management, and buffer management. The network processor may be coupled to the network 1020 by using a VITESSE GbE SERDES (serializer-deserializer) device (for example the VSC7123) and an SFP (small form factor pluggable) optical transceiver for LC fiber connection. [0088] Transport/Protocol Processing Engine [0089] Referring again to FIG. 1A, transport processing engine 1050 may be provided for performing network transport protocol sub-tasks, such as processing content requests received from network interface engine 1030. Although named a “transport” engine for discussion purposes, it will be recognized that the engine 1050 performs transport and protocol processing and the term transport processing engine is not meant to limit the functionality of the engine. In this regard transport processing engine 1050 may be any hardware or hardware/software subsystem suitable for TCP/UDP processing, other protocol processing, transport processing, etc. In one embodiment transport engine 1050 may be a dedicated TCP/UDP processing module based on an INTEL PENTIUM III or MOTOROLA POWERPC 7450 based processor running the Thread-X RTOS environment with protocol stack based on TCP/IP technology. [0090] As compared to traditional server type computing systems, the transport processing engine 1050 may off-load other tasks that traditionally a main CPU may perform. For example, the performance of server CPUs significantly decreases when a large amount of network connections are made merely because the server CPU regularly checks each connection for time outs. The transport processing engine 1050 may perform time out checks for each network connection, session management, data reordering and retransmission, data queuing and flow control, packet header generation, etc. off-loading these tasks from the application processing engine or the network interface processing engine. The transport processing engine 1050 may also handle error checking, likewise freeing up the resources of other processing engines. [0091] Network Interface/Transport Split Protocol [0092] The embodiment of FIG. 1A contemplates that the protocol processing is shared between the transport processing engine 1050 and the network interface engine 1030. This sharing technique may be called “split protocol stack” processing. The division of tasks may be such that higher tasks in the protocol stack are assigned to the transport processor engine. For example, network interface engine 1030 may processes all or some of the TCP/IP protocol stack as well as all protocols lower on the network protocol stack. Another approach could be to assign state modification intensive tasks to the transport processing engine. [0093] In one embodiment related to a content delivery system that receives packets, the network interface engine performs the MAC header identification and verification, IP header identification and verification, IP header checksum validation, TCP and UDP header identification and validation, and TCP or UDP checksum validation. It also may perform the lookup to determine the TCP connection or UDP socket (protocol session identifier) to which a received packet belongs. Thus, the network interface engine verifies packet lengths, checksums, and validity. For transmission of packets, the network interface engine performs TCP or UDP checksum generation, IP header generation, and MAC header generation, IP checksum generation, MAC FCS/CRC generation, etc. [0094] Tasks such as those described above can all be performed rapidly by the parallel and pipeline processors within a network processor. The “fly by” processing style of a network processor permits it to look at each byte of a packet as it passes through, using registers and other alternatives to memory access. The network processor's “stateless forwarding” operation is best suited for tasks not involving complex calculations that require rapid updating of state information. [0095] An appropriate internal protocol may be provided for exchanging information between the network interface engine 1030 and the transport engine 1050 when setting up or terminating a TCP and/or UDP connections and to transfer packets between the two engines. For example, where the distributive interconnection medium is a switch fabric, the internal protocol may be implemented as a set of messages exchanged across the switch fabric. These messages indicate the arrival of new inbound or outbound connections and contain inbound or outbound packets on existing connections, along with identifiers or tags for those connections. The internal protocol may also be used to transfer identifiers or tags between the transport engine 1050 and the application processing engine 1070 and/or the storage processing engine 1040. These identifiers or tags may be used to reduce or strip or accelerate a portion of the protocol stack. [0096] For example, with a TCP/IP connection, the network interface engine 1030 may receive a request for a new connection. The header information associated with the initial request may be provided to the transport processing engine 1050 for processing. That result of this processing may be stored in the resources of the transport processing engine 1050 as state and management information for that particular network session. The transport processing engine 1050 then informs the network interface engine 1030 as to the location of these results. Subsequent packets related to that connection that are processed by the network interface engine 1030 may have some of the header information stripped and replaced with an identifier or tag that is provided to the transport processing engine 1050. The identifier or tag may be a pointer, index or any other mechanism that provides for the identification of the location in the transport processing engine of the previously setup state and management information (or the corresponding network session). In this manner, the transport processing engine 1050 does not have to process the header information of every packet of a connection. Rather, the transport interface engine merely receives a contextually meaningful identifier or tag that identifies the previous processing results for that connection. [0097] In one embodiment, the data link, network, transport and session layers (layers 2-5) of a packet may be replaced by identifier or tag information. For packets related to an established connection the transport processing engine does not have to perform intensive processing with regard to these layers such as hashing, scanning, look up, etc. operations. Rather, these layers have already been converted (or processed) once in the transport processing engine and the transport processing engine just receives the identifier or tag provided from the network interface engine that identifies the location of the conversion results. [0098] In this manner an identifier label or tag is provided for each packet of an established connection so that the more complex data computations of converting header information may be replaced with a more simplistic analysis of an identifier or tag. The delivery of content is thereby accelerated, as the time for packet processing and the amount of system resources for packet processing are both reduced. The functionality of network processors, which provide efficient parallel processing of packet headers, is well suited for enabling the acceleration described herein. In addition, acceleration is further provided as the physical size of the packets provided across the distributed interconnect may be reduced. [0099] Though described herein with reference to messaging between the network interface engine and the transport processing engine, the use of identifiers or tags may be utilized amongst all the engines in the modular pipelined processing described herein. Thus, one engine may replace packet or data information with contextually meaningful information that may require less processing by the next engine in the data and communication flow path. In addition, these techniques may be utilized for a wide variety of protocols and layers, not just the exemplary embodiments provided herein. [0100] With the above-described tasks being performed by the network interface engine, the transport engine may perform TCP sequence number processing, acknowledgement and retransmission, segmentation and reassembly, and flow control tasks. These tasks generally call for storing and modifying connection state information on each TCP and UDP connection, and therefore are considered more appropriate for the processing capabilities of general purpose processors. [0101] As will be discussed with references to alternative embodiments (such as FIGS. 2 and 2A), the transport engine 1050 and the network interface engine 1030 may be combined into a single engine. Such a combination may be advantageous as communication across the switch fabric is not necessary for protocol processing. However, limitations of many commercially available network processors make the split protocol stack processing described above desirable. [0102] Application Processing Engine [0103] Application processing engine 1070 may be provided in content delivery system 1010 for application processing, and may be, for example, any hardware or hardware/software subsystem suitable for session layer protocol processing (e.g., HTTP, RTSP streaming, etc.) of content requests received from network transport processing engine 1050. In one embodiment application processing engine 1070 may be a dedicated application processing module based on an INTEL PENTIUM III processor running, for example, on standard ×86 OS systems (e.g., Linux, Windows NT, FreeBSD, etc.). Application processing engine 1070 may be utilized for dedicated application-only processing by virtue of the off-loading of all network protocol and storage processing elsewhere in content delivery system 1010. In one embodiment, processor programming for application processing engine 1070 may be generally similar to that of a conventional server, but without the tasks off-loaded to network interface processing engine 1030, storage processing engine 1040, and transport processing engine 1050. [0104] Storage Management Engine [0105] Storage management engine 1040 may be any hardware or hardware/software subsystem suitable for effecting delivery of requested content from content sources (for example content sources 1090 and/or 1100) in response to processed requests received from application processing engine 1070. It will also be understood that in various embodiments a storage management engine 1040 may be employed with content sources other than disk drives (e.g., solid state storage, the storage systems described above, or any other media suitable for storage of data) and may be programmed to request and receive data from these other types of storage. [0106] In one embodiment, processor programming for storage management engine 1040 may be optimized for data retrieval using techniques such as caching, and may include and maintain a disk cache to reduce the relatively long time often required to retrieve data from content sources, such as disk drives. Requests received by storage management engine 1040 from application processing engine 1070 may contain information on how requested data is to be formatted and its destination, with this information being comprehensible to transport processing engine 1050 and/or network interface processing engine 1030. The storage management engine 1040 may utilize a disk cache to reduce the relatively long time it may take to retrieve data stored in a storage medium such as disk drives. Upon receiving a request, storage management engine 1040 may be programmed to first determine whether the requested data is cached, and then to send a request for data to the appropriate content source 1090 or 1100. Such a request may be in the form of a conventional read request. The designated content source 1090 or 1100 responds by sending the requested content to storage management engine 1040, which in turn sends the content to transport processing engine 1050 for forwarding to network interface processing engine 1030. [0107] Based on the data contained in the request received from application processing engine 1070, storage processing engine 1040 sends the requested content in proper format with the proper destination data included. Direct communication between storage processing engine 1040 and transport processing engine 1050 enables application processing engine 1070 to be bypassed with the requested content. Storage processing engine 1040 may also be configured to write data to content sources 1090 and/or 1100 (e.g., for storage of live or broadcast streaming content). [0108] In one embodiment storage management engine 1040 may be a dedicated block-level cache processor capable of block level cache processing in support of thousands of concurrent multiple readers, and direct block data switching to network interface engine 1030. In this regard storage management engine 1040 may utilize a POWER PC 7450 processor in conjunction with ECC memory and a LSI SYMFC929 dual 2 GBaud fibre channel controller for fibre channel interconnect to content sources 1090 and/or 1100 via dual fibre channel arbitrated loop 1092. It will be recognized, however, that other forms of interconnection to storage sources suitable for retrieving content are also possible. Storage management engine 1040 may include hardware and/or software for running the Fibre Channel (FC) protocol, the SCSI (Small Computer Systems Interface) protocol, iSCSI protocol as well as other storage networking protocols. [0109] Storage management engine 1040 may employ any suitable method for caching data, including simple computational caching algorithms such as random removal (RR), first-in first-out (FIFO), predictive read-ahead, over buffering, etc. algorithms. Other suitable caching algorithms include those that consider one or more factors in the manipulation of content stored within the cache memory, or which employ multi-level ordering, key based ordering or function based calculation for replacement. In one embodiment, storage management engine may implement a layered multiple LRU (LMLRU) algorithm that uses an integrated block/buffer management structure including at least two layers of a configurable number of multiple LRU queues and a two-dimensional positioning algorithm for data blocks in the memory to reflect the relative priorities of a data block in the memory in terms of both recency and frequency. Such a caching algorithm is described in further detail in U.S. patent application Ser. No. 09/797,198, entitled “Systems and Methods for Management of Memory” by Qiu et. al, the disclosure of which is incorporated herein by reference. [0110] For increasing delivery efficiency of continuous content, such as streaming multimedia content, storage management engine 1040 may employ caching algorithms that consider the dynamic characteristics of continuous content. Suitable examples include, but are not limited to, interval caching algorithms. In one embodiment, improved caching performance of continuous content may be achieved using an LMLRU caching algorithm that weighs ongoing viewer cache value versus the dynamic time-size cost of maintaining particular content in cache memory. Such a caching algorithm is described in further detail in U.S. patent application Ser. No. 09/797,201, filed Mar. 1, 2001 and entitled “Systems and Methods for Management of Memory in Information Delivery Environments” by Qiu et. al, the disclosure of which is incorporated herein by reference. [0111] System Management Engine [0112] System management (or host) engine 1060 may be present to perform system management functions related to the operation of content delivery system 1010. Examples of system management functions include, but are not limited to, content provisioning/updates, comprehensive statistical data gathering and logging for sub-system engines, collection of shared user bandwidth utilization and content utilization data that may be input into billing and accounting systems, “on the fly” ad insertion into delivered content, customer programmable sub-system level quality of service (“QoS”) parameters, remote management (e.g., SNMP, web-based, CLI), health monitoring, clustering controls, remote/local disaster recovery functions, predictive performance and capacity planning, etc. In one embodiment, content delivery bandwidth utilization by individual content suppliers or users (e.g., individual supplier/user usage of distributive interchange and/or content delivery engines) may be tracked and logged by system management engine 1060, enabling an operator of the content delivery system 1010 to charge each content supplier or user on the basis of content volume delivered. [0113] System management engine 1060 may be any hardware or hardware/software subsystem suitable for performance of one or more such system management engines and in one embodiment may be a dedicated application processing module based, for example, on an INTEL PENTIUM III processor running an ×86 OS. Because system management engine 1060 is provided as a discrete modular engine, it may be employed to perform system management functions from within content delivery system 1010 without adversely affecting the performance of the system. Furthermore, the system management engine 1060 may maintain information on processing engine assignment and content delivery paths for various content delivery applications, substantially eliminating the need for an individual processing engine to have intimate knowledge of the hardware it intends to employ. [0114] Under manual or scheduled direction by a user, system management processing engine 1060 may retrieve content from the network 1020 or from one or more external servers on a second network 1024 (e.g., LAN) using, for example, network file system (NFS) or common internet file system (CIFS) file sharing protocol. Once content is retrieved, the content delivery system may advantageously maintain an independent copy of the original content, and therefore is free to employ any file system structure that is beneficial, and need not understand low level disk formats of a large number of file systems. [0115] Management interface 1062 may be provided for interconnecting system management engine 1060 with a network 1200 (e.g., LAN), or connecting content delivery system 1010 to other network appliances such as other content delivery systems 1010, servers, computers, etc. Management interface 1062 may be by any suitable network interface, such as 10/100 Ethernet, and may support communications such as management and origin traffic. Provision for one or more terminal management interfaces (not shown) for may also be provided, such as by RS-232 port, etc. The management interface may be utilized as a secure port to provide system management and control information to the content delivery system 1010. For example, tasks which may be accomplished through the management interface 1062 include reconfiguration of the allocation of system hardware (as discussed below with reference to FIGS. 1C-1F), programming the application processing engine, diagnostic testing, and any other management or control tasks. Though generally content is not envisioned being provided through the management interface, the identification of or location of files or systems containing content may be received through the management interface 1062 so that the content delivery system may access the content through the other higher bandwidth interfaces. [0116] Management Performed by the Network Interface [0117] Some of the system management functionality may also be performed directly within the network interface processing engine 1030. In this case some system policies and filters may be executed by the network interface engine 1030 in real-time at wirespeed. These polices and filters may manage some traffic/bandwidth management criteria and various service level guarantee policies. Examples of such system management functionality of are described below. It will be recognized that these functions may be performed by the system management engine 1060, the network interface engine 1030, or a combination thereof. [0118] For example, a content delivery system may contain data for two web sites. An operator of the content delivery system may guarantee one web site (“the higher quality site”) higher performance or bandwidth than the other web site (“the lower quality site”), presumably in exchange for increased compensation from the higher quality site. The network interface processing engine 1030 may be utilized to determine if the bandwidth limits for the lower quality site have been exceeded and reject additional data requests related to the lower quality site. Alternatively, requests related to the lower quality site may be rejected to ensure the guaranteed performance of the higher quality site is achieved. In this manner the requests may be rejected immediately at the interface to the external network and additional resources of the content delivery system need not be utilized. In another example, storage service providers may use the content delivery system to charge content providers based on system bandwidth of downloads (as opposed to the traditional storage area based fees). For billing purposes, the network interface engine may monitor the bandwidth use related to a content provider. The network interface engine may also reject additional requests related to content from a content provider whose bandwidth limits have been exceeded. Again, in this manner the requests may be rejected immediately at the interface to the external network and additional resources of the content delivery system need not be utilized. [0119] Additional system management functionality, such as quality of service (QoS) functionality, also may be performed by the network interface engine. A request from the external network to the content delivery system may seek a specific file and also may contain Quality of Service (QoS) parameters. In one example, the QoS parameter may indicate the priority of service that a client on the external network is to receive. The network interface engine may recognize the QoS data and the data may then be utilized when managing the data and communication flow through the content delivery system. The request may be transferred to the storage management engine to access this file via a read queue, e.g., [Destination IP][Filename][File Type (CoS)][Transport Priorities (QoS)]. All file read requests may be stored in a read queue. Based on CoS/QoS policy parameters as well as buffer status within the storage management engine (empty, full, near empty, block seq#, etc), the storage management engine may prioritize which blocks of which files to access from the disk next, and transfer this data into the buffer memory location that has been assigned to be transmitted to a specific IP address. Thus based upon QoS data in the request provided to the content delivery system, the data and communication traffic through the system may be prioritized. The QoS and other policy priorities may be applied to both incoming and outgoing traffic flow. Therefore a request having a higher QoS priority may be received after a lower order priority request, yet the higher priority request may be served data before the lower priority request. [0120] The network interface engine may also be used to filter requests that are not supported by the content delivery system. For example, if a content delivery system is configured only to accept HTTP requests, then other requests such as FTP, telnet, etc. may be rejected or filtered. This filtering may be applied directly at the network interface engine, for example by programming a network processor with the appropriate system policies. Limiting undesirable traffic directly at the network interface off loads such functions from the other processing modules and improves system performance by limiting the consumption of system resources by the undesirable traffic. It will be recognized that the filtering example described herein is merely exemplary and many other filter criteria or policies may be provided. [0121] Multi-Processor Module Design [0122] As illustrated in FIG. 1A, any given processing engine of content delivery system 1010 may be optionally provided with multiple processing modules so as to enable parallel or redundant processing of data and/or communications. For example, two or more individual dedicated TCP/UDP processing modules 1050 a and 1050 b may be provided for transport processing engine 1050, two or more individual application processing modules 1070 a and 1070 b may be provided for network application processing engine 1070, two or more individual network interface processing modules 1030 a and 1030 b may be provided for network interface processing engine 1030 and two or more individual storage management processing modules 1040 a and 1040 b may be provided for storage management processing engine 1040. Using such a configuration, a first content request may be processed between a first TCP/UDP processing module and a first application processing module via a first switch fabric path, at the same time a second content request is processed between a second TCP/UDP processing module and a second application processing module via a second switch fabric path. Such parallel processing capability may be employed to accelerate content delivery. [0123] Alternatively, or in combination with parallel processing capability, a first TCP/UDP processing module 1050 a may be backed-up by a second TCP/UDP processing module 1050 b that acts as an automatic fail over spare to the first module 1050 a. In those embodiments employing multiple-port switch fabrics, various combinations of multiple modules may be selected for use as desired on an individual system-need basis (e.g., as may be dictated by module failures and/or by anticipated or actual bottlenecks), limited only by the number of available ports in the fabric. This feature offers great flexibility in the operation of individual engines and discrete processing modules of a content delivery system, which may be translated into increased content delivery acceleration and reduction or substantial elimination of adverse effects resulting from system component failures. [0124] In yet other embodiments, the processing modules may be specialized to specific applications, for example, for processing and delivering HTTP content, processing and delivering RTSP content, or other applications. For example, in such an embodiment an application processing module 1070 a and storage processing module 1040 a may be specially programmed for processing a first type of request received from a network. In the same system, application processing module 1070 b and storage processing module 1040 b may be specially programmed to handle a second type of request different from the first type. Routing of requests to the appropriate respective application and/or storage modules may be accomplished using a distributive interconnect and may be controlled by transport and/or interface processing modules as requests are received and processed by these modules using policies set by the system management engine. [0125] Further, by employing processing modules capable of performing the function of more than one engine in a content delivery system, the assigned functionality of a given module may be changed on an as-needed basis, either manually or automatically by the system management engine upon the occurrence of given parameters or conditions. This feature may be achieved, for example, by using similar hardware modules for different content delivery engines (e.g., by employing PENTIUM III based processors for both network transport processing modules and for application processing modules), or by using different hardware modules capable of performing the same task as another module through software programmability (e.g., by employing a POWER PC processor based module for storage management modules that are also capable of functioning as network transport modules). In this regard, a content delivery system may be configured so that such functionality reassignments may occur during system operation, at system boot-up or in both cases. Such reassignments may be effected, for example, using software so that in a given content delivery system every content delivery engine (or at a lower level, every discrete content delivery processing module) is potentially dynamically reconfigurable using software commands. Benefits of engine or module reassignment include maximizing use of hardware resources to deliver content while minimizing the need to add expensive hardware to a content delivery system. [0126] Thus, the system disclosed herein allows various levels of load balancing to satisfy a work request. At a system hardware level, the functionality of the hardware may be assigned in a manner that optimizes the system performance for a given load. At the processing engine level, loads may be balanced between the multiple processing modules of a given processing engine to further optimize the system performance. [0127] Clusters of Systems [0128] The systems described herein may also be clustered together in groups of two or more to provide additional processing power, storage connections, bandwidth, etc. Communication between two individual systems each configured similar to content delivery system 1010 may be made through network interface 1022 and/or 1023. Thus, one content delivery system could communicate with another content delivery system through the network 1020 and/or 1024. For example, a storage unit in one content delivery system could send data to a network interface engine of another content delivery system. As an example, these communications could be via TCP/IP protocols. Alternatively, the distributed interconnects 1080 of two content delivery systems 1010 may communicate directly. For example, a connection may be made directly between two switch fabrics, each switch fabric being the distributed interconnect 1080 of separate content delivery systems 1010. [0129] FIGS. 1G-1J illustrate four exemplary clusters of content delivery systems 1010. It will be recognized that many other cluster arrangements may be utilized including more or less content delivery systems. As shown in FIGS. 1G-1J, each content delivery system may be configured as described above and include a distributive interconnect 1080 and a network interface processing engine 1030. Interfaces 1022 may connect the systems to a network 1020. As shown in FIG. 1G, two content delivery systems may be coupled together through the interface 1023 that is connected to each system's network interface processing engine 1030. FIG. 1H shows three systems coupled together as in FIG. 1G. The interfaces 1023 of each system may be coupled directly together as shown, may be coupled together through a network or may be coupled through a distributed interconnect (for example a switch fabric). [0130]FIG. 11 illustrates a cluster in which the distributed interconnects 1080 of two systems are directly coupled together through an interface 1500. Interface 1500 may be any communication connection, such as a copper connection, optical fiber, wireless connection, etc. Thus, the distributed interconnects of two or more systems may directly communicate without communication through the processor engines of the content delivery systems 1010. FIG. 1J illustrates the distributed interconnects of three systems directly communicating without first requiring communication through the processor engines of the content delivery systems 1010. As shown in FIG. 1J, the interfaces 1500 each communicate with each other through another distributed interconnect 1600. Distributed interconnect 1600 may be a switched fabric or any other distributed interconnect. [0131] The clustering techniques described herein may also be implemented through the use of the management interface 1062. Thus, communication between multiple content delivery systems 1010 also may be achieved through the management interface 1062 [0132] Exemplary Data and Communication Flow Paths [0133]FIG. 1B illustrates one exemplary data and communication flow path configuration among modules of one embodiment of content delivery system 1010. The flow paths shown in FIG. 1B are just one example given to illustrate the significant improvements in data processing capacity and content delivery acceleration that may be realized using multiple content delivery engines that are individually optimized for different layers of the software stack and that are distributively interconnected as disclosed herein. The illustrated embodiment of FIG. 1B employs two network application processing modules 1070 a and 1070 b, and two network transport processing modules 1050 a and 1050 b that are communicatively coupled with single storage management processing module 1040 a and single network interface processing module 1030 a. The storage management processing module 1040 a is in turn coupled to content sources 1090 and 1100. In FIG. 1B, interprocessor command or control flow (i.e. incoming or received data request) is represented by dashed lines, and delivered content data flow is represented by solid lines. Command and data flow between modules may be accomplished through the distributive interconnection 1080 (not shown), for example a switch fabric. [0134] As shown in FIG. 1B, a request for content is received and processed by network interface processing module 1030 a and then passed on to either of network transport processing modules 1050 a or 1050 b for TCP/UDP processing, and then on to respective application processing modules 1070 a or 1070 b, depending on the transport processing module initially selected. After processing by the appropriate network application processing module, the request is passed on to storage management processor 1040 a for processing and retrieval of the requested content from appropriate content sources 1090 and/or 1100. Storage management processing module 1040 a then forwards the requested content directly to one of network transport processing modules 1050 a or 1050 b, utilizing the capability of distributive interconnection 1080 to bypass network application processing modules 1070 a and 1070 b. The requested content may then be transferred via the network interface processing module 1030 a to the external network 1020. Benefits of bypassing the application processing modules with the delivered content include accelerated delivery of the requested content and off loading of workload from the application processing modules, each of which translate into greater processing efficiency and content delivery throughput. In this regard, throughput is generally measured in sustained data rates passed through the system and may be measured in bits per second. Capacity may be measured in terms of the number of files that may be partially cached, the number of TCP/IP connections per second as well as the number of concurrent TCP/IP connections that may be maintained or the number of simultaneous streams of a certain bit rate. In an alternative embodiment, the content may be delivered from the storage management processing module to the application processing module rather than bypassing the application processing module. This data flow may be advantageous if additional processing of the data is desired. For example, it may be desirable to decode or encode the data prior to delivery to the network. [0135] To implement the desired command and content flow paths between multiple modules, each module may be provided with means for identification, such as a component ID. Components may be affiliated with content requests and content delivery to effect a desired module routing. The data-request generated by the network interface engine may include pertinent information such as the component ID of the various modules to be utilized in processing the request. For example, included in the data request sent to the storage management engine may be the component ID of the transport engine that is designated to receive the requested content data. When the storage management engine retrieves the data from the storage device and is ready to send the data to the next engine, the storage management engine knows which component ID to send the data to. [0136] As further illustrated in FIG. 1B, the use of two network transport modules in conjunction with two network application processing modules provides two parallel processing paths for network transport and network application processing, allowing simultaneous processing of separate content requests and simultaneous delivery of separate content through the parallel processing paths, further increasing throughput/capacity and accelerating content delivery. Any two modules of a given engine may communicate with separate modules of another engine or may communicate with the same module of another engine. This is illustrated in FIG. 1B where the transport modules are shown to communicate with separate application modules and the application modules are shown to communicate with the same storage management module. [0137]FIG. 1B illustrates only one exemplary embodiment of module and processing flow path configurations that may be employed using the disclosed method and system. Besides the embodiment illustrated in FIG. 1B, it will be understood that multiple modules may be additionally or alternatively employed for one or more other network content delivery engines (e.g., storage management processing engine, network interface processing engine, system management processing engine, etc.) to create other additional or alternative parallel processing flow paths, and that any number of modules (e.g., greater than two) may be employed for a given processing engine or set of processing engines so as to achieve more than two parallel processing flow paths. For example, in other possible embodiments, two or more different network transport processing engines may pass content requests to the same application unit, or vice-versa. [0138] Thus, in addition to the processing flow paths illustrated in FIG. 1B, it will be understood that the disclosed distributive interconnection system may be employed to create other custom or optimized processing flow paths (e.g., by bypassing and/or interconnecting any given number of processing engines in desired sequence/s) to fit the requirements or desired operability of a given content delivery application. For example, the content flow path of FIG. 1B illustrates an exemplary application in which the content is contained in content sources 1090 and/or 1100 that are coupled to the storage processing engine 1040. However as discussed above with reference to FIG. 1A, remote and/or live broadcast content may be provided to the content delivery system from the networks 1020 and/or 1024 via the second network interface connection 1023. In such a situation the content may be received by the network interface engine 1030 over interface connection 1023 and immediately rebroadcast over interface connection 1022 to the network 1020. Alternatively, content may be proceed through the network interface connection 1023 to the network transport engine 1050 prior to returning to the network interface engine 1030 for re-broadcast over interface connection 1022 to the network 1020 or 1024. In yet another alternative, if the content requires some manner of application processing (for example encoded content that may need to be decoded), the content may proceed all the way to the application engine 1070 for processing. After application processing the content may then be delivered through the network transport engine 1050, network interface engine 1030 to the network 1020 or 1024. [0139] In yet another embodiment, at least two network interface modules 1030 a and 1030 b may be provided, as illustrated in FIG. 1A. In this embodiment, a first network interface engine 1030 a may receive incoming data from a network and pass the data directly to the second network interface engine 1030 b for transport back out to the same or different network. For example, in the remote or live broadcast application described above, first network interface engine 1030 a may receive content, and second network interface engine 1030 b provide the content to the network 1020 to fulfill requests from one or more clients for this content. Peer-to-peer level communication between the two network interface engines allows first network interface engine 1030 a to send the content directly to second network interface engine 1030 b via distributive interconnect 1080. If necessary, the content may also be routed through transport processing engine 1050, or through transport processing engine 1050 and application processing engine 1070, in a manner described above. [0140] Still yet other applications may exist in which the content required to be delivered is contained both in the attached content sources 1090 or 1100 and at other remote content sources. For example in a web caching application, not all content may be cached in the attached content sources, but rather some data may also be cached remotely. In such an application, the data and communication flow may be a combination of the various flows described above for content provided from the content sources 1090 and 1100 and for content provided from remote sources on the networks 1020 and/or 1024. [0141] The content delivery system 1010 described above is configured in a peer-to-peer manner that allows the various engines and modules to communicate with each other directly as peers through the distributed interconnect. This is contrasted with a traditional server architecture in which there is a main CPU. Furthermore unlike the arbitrated bus of traditional servers, the distributed interconnect 1080 provides a switching means which is not arbitrated and allows multiple simultaneous communications between the various peers. The data and communication flow may by-pass unnecessary peers such as the return of data from the storage management processing engine 1040 directly to the network interface processing engine 1030 as described with reference to FIG. 1B. [0142] Communications between the various processor engines may be made through the use of a standardized internal protocol. Thus, a standardized method is provided for routing through the switch fabric and communicating between any two of the processor engines which operate as peers in the peer to peer environment. The standardized internal protocol provides a mechanism upon which the external network protocols may “ride” upon or be incorporated within. In this manner additional internal protocol layers relating to internal communication and data exchange may be added to the external protocol layers. The additional internal layers may be provided in addition to the external layers or may replace some of the external protocol layers (for example as described above portions of the external headers may be replaced by identifiers or tags by the network interface engine). [0143] The standardized internal protocol may consist of a system of message classes, or types, where the different classes can independently include fields or layers that are utilized to identify the destination processor engine or processor module for communication, control, or data messages provided to the switch fabric along with information pertinent to the corresponding message class. The standardized internal protocol may also include fields or layers that identify the priority that a data packet has within the content delivery system. These priority levels may be set by each processing engine based upon system-wide policies. Thus, some traffic within the content delivery system may be prioritized over other traffic and this priority level may be directly indicated within the internal protocol call scheme utilized to enable communications within the system. The prioritization helps enable the predictive traffic flow between engines and end-to-end through the system such that service level guarantees may be supported. [0144] Other internally added fields or layers may include processor engine state, system timestamps, specific message class identifiers for message routing across the switch fabric and at the receiving processor engine(s), system keys for secure control message exchange, flow control information to regulate control and data traffic flow and prevent congestion, and specific address tag fields that allow hardware at the receiving processor engines to move specific types of data directly into system memory. [0145] In one embodiment, the internal protocol may be structured as a set, or system of messages with common system defined headers that allows all processor engines and, potentially, processor engine switch fabric attached hardware, to interpret and process messages efficiently and intelligently. This type of design allows each processing engine, and specific functional entities within the processor engines, to have their own specific message classes optimized functionally for the exchanging their specific types control and data information. Some message classes that may be employed are: System Control messages for system management, Network Interface to Network Transport messages, Network Transport to Application Interface messages, File System to Storage engine messages, Storage engine to Network Transport messages, etc. Some of the fields of the standardized message header may include message priority, message class, message class identifier (subtype), message size, message options and qualifier fields, message context identifiers or tags, etc. In addition, the system statistics gathering, management and control of the various engines may be performed across the switch fabric connected system using the messaging capabilities. [0146] By providing a standardized internal protocol, overall system performance may be improved. In particular, communication speed between the processor engines across the switch fabric may be increased. Further, communications between any two processor engines may be enabled. The standardized protocol may also be utilized to reduce the processing loads of a given engine by reducing the amount of data that may need to be processed by a given engine. [0147] The internal protocol may also be optimized for a particular system application, providing further performance improvements. However, the standardized internal communication protocol may be general enough to support encapsulation of a wide range of networking and storage protocols. Further, while internal protocol may run on PCI, PCI-X, ATM, IB, Lightening I/O, the internal protocol is a protocol above these transport-level standards and is optimal for use in a switched (non-bus) environment such as a switch fabric. In addition, the internal protocol may be utilized to communicate devices (or peers) connected to the system in addition to those described herein. For example, a peer need not be a processing engine. In one example, a peer may be an ASIC protocol converter that is coupled to the distributed interconnect as a peer but operates as a slave device to other master devices within the system. The internal protocol may also be as a protocol communicated between systems such as used in the clusters described above. [0148] Thus a system has been provided in which the networking/server clustering/storage networking has been collapsed into a single system utilizing a common low-overhead internal communication protocol/transport system. [0149] Content Delivery Acceleration [0150] As described above, a wide range of techniques have been provided for accelerating content delivery from the content delivery system 1010 to a network. By accelerating the speed at which content may be delivered, a more cost effective and higher performance system may be provided. These techniques may be utilized separately or in various combinations. [0151] One content acceleration technique involves the use of a multi-engine system with dedicated engines for varying processor tasks. Each engine can perform operations independently and in parallel with the other engines without the other engines needing to freeze or halt operations. The engines do not have to compete for resources such as memory, I/O, processor time, etc. but are provided with their own resources. Each engine may also be tailored in hardware and/or software to perform specific content delivery task, thereby providing increasing content delivery speeds while requiring less system resources. Further, all data, regardless of the flow path, gets processed in a staged pipeline fashion such that each engine continues to process its layer of functionality after forwarding data to the next engine/layer. [0152] Content acceleration is also obtained from the use of multiple processor modules within an engine. In this manner, parallelism may be achieved within a specific processing engine. Thus, multiple processors responding to different content requests may be operating in parallel within one engine. [0153] Content acceleration is also provided by utilizing the multi-engine design in a peer to peer environment in which each engine may communicate as a peer. Thus, the communications and data paths may skip unnecessary engines. For example, data may be communicated directly from the storage processing engine to the transport processing engine without have to utilize resources of the application processing engine. [0154] Acceleration of content delivery is also achieved by removing or stripping the contents of some protocol layers in one processing engine and replacing those layers with identifiers or tags for use with the next processor engine in the data or communications flow path. Thus, the processing burden placed on the subsequent engine may be reduced. In addition, the packet size transmitted across the distributed interconnect may be reduced. Moreover, protocol processing may be off-loaded from the storage and/or application processors, thus freeing those resources to focus on storage or application processing. [0155] Content acceleration is also provided by using network processors in a network endpoint system. Network processors generally are specialized to perform packet analysis functions at intermediate network nodes, but in the content delivery system disclosed the network processors have been adapted for endpoint functions. Furthermore, the parallel processor configurations within a network processor allow these endpoint functions to be performed efficiently. [0156] In addition, content acceleration has been provided through the use of a distributed interconnection such as a switch fabric. A switch fabric allows for parallel communications between the various engines and helps to efficiently implement some of the acceleration techniques described herein. [0157] It will be recognized that other aspects of the content delivery system 1010 also provide for accelerated delivery of content to a network connection. Further, it will be recognized that the techniques disclosed herein may be equally applicable to other network endpoint systems and even non-endpoint systems. [0158] Exemplary Hardware Embodiments [0159] FIGS. 1C-1F illustrate just a few of the many multiple network content delivery engine configurations possible with one exemplary hardware embodiment of content delivery system 1010. In each illustrated configuration of this hardware embodiment, content delivery system 1010 includes processing modules that may be configured to operate as content delivery engines 1030, 1040, 1050, 1060, and 1070 communicatively coupled via distributive interconnection 1080. As shown in FIG. 1C, a single processor module may operate as the network interface processing engine 1030 and a single processor module may operate as the system management processing engine 1060. Four processor modules 1001 may be configured to operate as either the transport processing engine 1050 or the application processing engine 1070. Two processor modules 1003 may operate as either the storage processing engine 1040 or the transport processing engine 1050. The Gigabit (Gb) Ethernet front end interface 1022, system management interface 1062 and dual fibre channel arbitrated loop 1092 are also shown. [0160] As mentioned above, the distributive interconnect 1080 may be a switch fabric based interconnect. As shown in FIG. 1C, the interconnect may be an IBM PRIZMA-E eight/sixteen port switch fabric 1081. In an eight port mode, this switch fabric is an 8×3.54 Gbps fabric and in a sixteen port mode, this switch fabric is a 16×1.77 Gbps fabric. The eight/sixteen port switch fabric may be utilized in an eight port mode for performance optimization. The switch fabric 1081 may be coupled to the individual processor modules through interface converter circuits 1082, such as IBM UDASL switch interface circuits. The interface converter circuits 1082 convert the data aligned serial link interface (DASL) to a UTOPIA (Universal Test and Operations PHY Interface for ATM) parallel interface. FPGAs (field programmable gate array) may be utilized in the processor modules as a fabric interface on the processor modules as shown in FIG. 1C. These fabric interfaces provide a 64/66 Mhz PCI interface to the interface converter circuits 1082. FIG. 4 illustrates a functional block diagram of such a fabric interface 34. As explained below, the interface 34 provides an interface between the processor module bus and the UDASL switch interface converter circuit 1082. As shown in FIG. 4, at the switch fabric side, a physical connection interface 41 provides connectivity at the physical level to the switch fabric. An example of interface 41 is a parallel bus interface complying with the UTOPIA standard. In the example of FIG. 4, interface 41 is a UTOPIA 3 interface providing a 32-bit 110 Mhz connection. However, the concepts disclosed herein are not protocol dependent and the switch fabric need not comply with any particular ATM or non ATM standard. [0161] Still referring to FIG. 4, SAR (segmentation and reassembly) unit 42 has appropriate SAR logic 42 a for performing segmentation and reassembly tasks for converting messages to fabric cells and vice-versa as well as message classification and message class-to-queue routing, using memory 42 b and 42 c for transmit and receive queues. This permits different classes of messages and permits the classes to have different priority. For example, control messages can be classified separately from data messages, and given a different priority. All fabric cells and the associated messages may be self routing, and no out of band signaling is required. [0162] A special memory modification scheme permits one processor module to write directly into memory of another. This feature is facilitated by switch fabric interface 34 and in particular by its message classification capability. Commands and messages follow the same path through switch fabric interface 34, but can be differentiated from other control and data messages. In this manner, processes executing on processor modules can communicate directly using their own memory spaces. [0163] Bus interface 43 permits switch fabric interface 34 to communicate with the processor of the processor module via the module device or I/O bus. An example of a suitable bus architecture is a PCI architecture, but other architectures could be used. Bus interface 43 is a master/target device, permitting interface 43 to write and be written to and providing appropriate bus control. The logic circuitry within interface 43 implements a state machine that provides the communications protocol, as well as logic for configuration and parity. [0164] Referring again to FIG. 1C, network processor 1032 (for example a MOTOROLA C-Port C-5 network processor) of the network interface processing engine 1030 may be coupled directly to an interface converter circuit 1082 as shown. As mentioned above and further shown in FIG. 1C, the network processor 1032 also may be coupled to the network 1020 by using a VITESSE GbE SERDES (serializer-deserializer) device (for example the VSC7123) and an SFP (small form factor pluggable) optical transceiver for LC fibre connection. [0165] The processor modules 1003 include a fibre channel (FC) controller as mentioned above and further shown in FIG. 1C. For example, the fibre channel controller may be the LSI SYMFC929 dual 2 GBaud fibre channel controller. The fibre channel controller enables communication with the fibre channel 1092 when the processor module 1003 is utilized as a storage processing engine 1040. Also illustrated in FIGS. 1C-1F is optional adjunct processing unit 1300 that employs a POWER PC processor with SDRAM. The adjunct processing unit is shown coupled to network processor 1032 of network interface processing engine 1030 by a PCI interface. Adjunct processing unit 1300 may be employed for monitoring system parameters such as temperature, fan operation, system health, etc. [0166] As shown in FIGS. 1C-1F, each processor module of content delivery engines 1030, 1040, 1050, 1060, and 1070 is provided with its own synchronous dynamic random access memory (“SDRAM”) resources, enhancing the independent operating capabilities of each module. The memory resources may be operated as ECC (error correcting code) memory. Network interface processing engine 1030 is also provided with static random access memory (“SRAM”). Additional memory circuits may also be utilized as will be recognized by those skilled in the art. For example, additional memory resources (such as synchronous SRAM and non-volatile FLASH and EEPROM) may be provided in conjunction with the fibre channel controllers. In addition, boot FLASH memory may also be provided on the of the processor modules. [0167] The processor modules 1001 and 1003 of FIG. 1C may be configured in alternative manners to implement the content delivery processing engines such as the network interface processing engine 1030, storage processing engine 1040, transport processing engine 1050, system management processing engine 1060, and application processing engine 1070. Exemplary configurations are shown in FIGS. 1D-1F, however, it will be recognized that other configurations may be utilized. [0168] As shown in FIG. 1D, two Pentium III based processing modules may be utilized as network application processing modules 1070 a and 1070 b of network application processing engine 1070. The remaining two Pentium III-based processing modules are shown in FIG. 1D configured as network transport/protocol processing modules 1050 a and 1050 b of network transport/protocol processing engine 1050. The embodiment of FIG. 1D also includes two POWER PC-based processor modules, configured as storage management processing modules 1040 a and 1040 b of storage management processing engine 1040. A single MOTOROLA C-Port C-5 based network processor is shown employed as network interface processing engine 1030, and a single Pentium III-based processing module is shown employed as system management processing engine 1060. [0169] In FIG. 1E, the same hardware embodiment of FIG. 1C is shown alternatively configured so that three Pentium III-based processing modules function as network application processing modules 1070 a, 1070 b and 1070 c of network application processing engine 1070, and so that the sole remaining Pentium III-based processing module is configured as a network transport processing module 1050 a of network transport processing engine 1050. As shown, the remaining processing modules are configured as in FIG. 1D. [0170] In FIG. 1F, the same hardware embodiment of FIG. 1C is shown in yet another alternate configuration so that three Pentium III-based processing modules function as application processing modules 1070 a, 1070 b and 1070 c of network application processing engine 1070. In addition, the network transport processing engine 1050 includes one Pentium III-based processing module that is configured as network transport processing module 1050 a, and one POWER PC-based processing module that is configured as network transport processing module 1050 b. The remaining POWER PC-based processor module is configured as storage management processing module 1040 a of storage management processing engine 1040. [0171] It will be understood with benefit of this disclosure that the hardware embodiment and multiple engine configurations thereof illustrated in FIGS. 1C-1F are exemplary only, and that other hardware embodiments and engine configurations thereof are also possible. It will further be understood that in addition to changing the assignments of individual processing modules to particular processing engines, distributive interconnect 1080 enables the various processing flow paths between individual modules employed in a particular engine configuration in a manner as described in relation to FIG. 11B. Thus, for any given hardware embodiment and processing engine configuration, a number of different processing flow paths may be employed so as to optimize system performance to suit the needs of particular system applications. [0172] Single Chassis Design [0173] As mentioned above, the content delivery system 1010 may be implemented within a single chassis, such as for example, a 2U chassis. The system may be expanded further while still remaining a single chassis system. In particular, utilizing a multiple processor module or blade arrangement connected through a distributive interconnect (for example a switch fabric) provides a system that is easily scalable. The chassis and interconnect may be configured with expansion slots provided for adding additional processor modules. Additional processor modules may be provided to implement additional applications within the same chassis. Alternatively, additional processor modules may be provided to scale the bandwidth of the network connection. Thus, though describe with respect to a 1 Gbps Ethernet connection to the external network, a 10 Gbps, 40 Gbps or more connection may be established by the system through the use of more network interface modules. Further, additional processor modules may be added to address a system's particular bottlenecks without having to expand all engines of the system. The additional modules may be added during a systems initial configuration, as an upgrade during system maintenance or even hot plugged during system operation. [0174] Alternative Systems Configurations [0175] Further, the network endpoint system techniques disclosed herein may be implemented in a variety of alternative configurations that incorporate some, but not necessarily all, of the concepts disclosed herein. For example, FIGS. 2 and 2A disclose two exemplary alternative configurations. It will be recognized, however, that many other alternative configurations may be utilized while still gaining the benefits of the inventions disclosed herein. [0176]FIG. 2 is a more generalized and functional representation of a content delivery system showing how such a system may be alternately configured to have one or more of the features of the content delivery system embodiments illustrated in FIGS. 1A-1F. FIG. 2 shows content delivery system 200 coupled to network 260 from which content requests are received and to which content is delivered. Content sources 265 are shown coupled to content delivery system 200 via a content delivery flow path 263 that may be, for example, a storage area network that links multiple content sources 265. A flow path 203 may be provided to network connection 272, for example, to couple content delivery system 200 with other network appliances, in this case one or more servers 201 as illustrated in FIG. 2. [0177] In FIG. 2 content delivery system 200 is configured with multiple processing and memory modules that are distributively interconnected by inter-process communications path 230 and inter-process data movement path 235. Inter-process communications path 230 is provided for receiving and distributing inter-processor command communications between the modules and network 260, and interprocess data movement path 235 is provided for receiving and distributing inter-processor data among the separate modules. As illustrated in FIGS. 1A-1F, the functions of inter-process communications path 230 and inter-process data movement path 235 may be together handled by a single distributive interconnect 1080 (such as a switch fabric, for example), however, it is also possible to separate the communications and data paths as illustrated in FIG. 2, for example using other interconnect technology. [0178]FIG. 2 illustrates a single networking subsystem processor module 205 that is provided to perform the combined functions of network interface processing engine 1030 and transport processing engine 1050 of FIG. 1A. Communication and content delivery between network 260 and networking subsystem processor module 205 are made through network connection 270. For certain applications, the functions of network interface processing engine 1030 and transport processing engine 1050 of FIG. 1A may be so combined into a single module 205 of FIG. 2 in order to reduce the level of communication and data traffic handled by communications path 230 and data movement path 235 (or single switch fabric), without adversely impacting the resources of application processing engine or subsystem module. If such a modification were made to the system of FIG. 1A, content requests may be passed directly from the combined interface/transport engine to network application processing engine 1070 via distributive interconnect 1080. Thus, as previously described the functions of two or more separate content delivery system engines may be combined as desired (e.g., in a single module or in multiple modules of a single processing blade), for example, to achieve advantages in efficiency or cost. [0179] In the embodiment of FIG. 2, the function of network application processing engine 1070 of FIG. 1A is performed by application processing subsystem module 225 of FIG. 2 in conjunction with application RAM subsystem module 220 of FIG. 2. System monitor module 240 communicates with server/s 201 through flow path 203 and Gb Ethernet network interface connection 272 as also shown in FIG. 2. The system monitor module 240 may provide the function of the system management engine 1060 of FIG. 1A and/or other system policy/filter functions such as may also be implemented in the network interface processing engine 1030 as described above with reference to FIG. 1A. [0180] Similarly, the function of network storage management engine 1040 is performed by storage subsystem module 210 in conjunction with file system cache subsystem module 215. Communication and content delivery between content sources 265 and storage subsystem module 210 are shown made directly through content delivery flowpath 263 through fibre channel interface connection 212. Shared resources subsystem module 255 is shown provided for access by each of the other subsystem modules and may include, for example, additional processing resources, additional memory resources such as RAM, etc. [0181] Additional processing engine capability (e.g., additional system management processing capability, additional application processing capability, additional storage processing capability, encryption/decryption processing capability, compression/decompression processing capability, encoding/decoding capability, other processing capability, etc.) may be provided as desired and is represented by other subsystem module 275. Thus, as previously described the functions of a single network processing engine may be sub-divided between separate modules that are distributively interconnected. The sub-division of network processing engine tasks may also be made for reasons of efficiency or cost, and/or may be taken advantage of to allow resources (e.g. memory or processing) to be shared among separate modules. Further, additional shared resources may be made available to one or more separate modules as desired. [0182] Also illustrated in FIG. 2 are optional monitoring agents 245 and resources 250. In the embodiment of FIG. 2, each monitoring agent 245 may be provided to monitor the resources 250 of its respective processing subsystem module, and may track utilization of these resources both within the overall system 200 and within its respective processing subsystem module. Examples of resources that may be so monitored and tracked include, but are not limited to, processing engine bandwidth, Fibre Channel bandwidth, number of available drives, IOPS (input/output operations per second) per drive and RAID (redundant array of inexpensive discs) levels of storage devices, memory available for caching blocks of data, table lookup engine bandwidth, availability of RAM for connection control structures and outbound network bandwidth availability, shared resources (such as RAM) used by streaming application on a per-stream basis as well as for use with connection control structures and buffers, bandwidth available for message passing between subsystems, bandwidth available for passing data between the various subsystems, etc. [0183] Information gathered by monitoring agents 245 may be employed for a wide variety of purposes including for billing of individual content suppliers and/or users for pro-rata use of one or more resources, resource use analysis and optimization, resource health alarms, etc. In addition, monitoring agents may be employed to enable the deterministic delivery of content by system 200 as described further herein. [0184] In operation, content delivery system 200 of FIG. 2 may be configured to wait for a request for content or services prior to initiating content delivery or performing a service. A request for content, such as a request for access to data, may include, for example, a request to start a video stream, a request for stored data, etc. A request for services may include, for example, a request for to run an application, to store a file, etc. A request for content or services may be received from a variety of sources. For example, if content delivery system 200 is employed as a stream server, a request for content may be received from a client system attached to a computer network or communication network such as the Internet. In a larger system environment, e.g., a data center, a request for content or services may be received from a separate subcomponent or a system management processing engine, that is responsible for performance of the overall system or from a sub-component that is unable to process the current request. Similarly, a request for content or services may be received by a variety of components of the receiving system. For example, if the receiving system is a stream server, networking subsystem processor module 205 might receive a content request. Alternatively, if the receiving system is a component of a larger system, e.g., a data center, system management processing engine may be employed to receive the request. [0185] Upon receipt of a request for content or services, the request may be filtered by system monitor 240. Such filtering may serve as a screening agent to filter out requests that the receiving system is not capable of processing (e.g., requests for file writes from read-only system embodiments, unsupported protocols, content/services unavailable on system 200, etc.). Such requests may be rejected outright and the requestor notified, may be re-directed to a server 201 or other content delivery system 200 capable of handling the request, or may be disposed of any other desired manner. [0186] Referring now in more detail to one embodiment of FIG. 2 as may be employed in a stream server configuration, networking processing subsystem module 205 may include the hardware and/or software used to run TCP/IP (Transmission Control Protocol/Internet Protocol), UDP/IP (User Datagram Protocol/Internet Protocol), RTP (Real-Time Transport Protocol), Internet Protocol (IP), Wireless Application Protocol (WAP) as well as other networking protocols. Network interface connections 270 and 272 may be considered part of networking subsystem processing module 205 or as separate components. Storage subsystem module 210 may include hardware and/or software for running the Fibre Channel (FC) protocol, the SCSI (Small Computer Systems Interface) protocol, iSCSI protocol as well as other storage networking protocols. FC interface 212 to content delivery fiowpath 263 may be considered part of storage subsystem module 210 or as a separate component. File system cache subsystem module 215 may include, in addition to cache hardware, one or more cache management algorithms as well as other software routines. [0187] Application RAM subsystem module 220 may function as a memory allocation subsystem and application processing subsystem module 225 may function as a stream-serving application processor bandwidth subsystem. Among other services, application RAM subsystem module 220 and application processing subsystem module 225 may be used to facilitate such services as the pulling of content from storage and/or cache, the formatting of content into RTSP (Real-Time Streaming Protocol) or another streaming protocol as well the passing of the formatted content to networking subsystem 205. [0188] As previously described, system monitor module 240 may be included in content delivery system 200 to manage one or more of the subsystem processing modules, and may also be used to facilitate communication between the modules. [0189] In part to allow communications between the various subsystem modules of content delivery system 200, inter-process communication path 230 may be included in content delivery system 200, and may be provided with its own monitoring agent 245. Inter-process communications path 230 may be a reliable protocol path employing a reliable IPC (Interprocess Communications) protocol. To allow data or information to be passed between the various subsystem modules of content delivery system 200, inter-process data movement path 235 may also be included in content delivery system 200, and may be provided with its own monitoring agent 245. As previously described, the functions of inter-process communications path 230 and inter-process data movement path 235 may be together handled by a single distributive interconnect 1080, that may be a switch fabric configured to support the bandwidth of content being served. [0190] In one embodiment, access to content source 265 may be provided via a content delivery flow path 263 that is a fibre channel storage area network (SAN), a switched technology. In addition, network connectivity may be provided at network connection 270 (e.g., to a front end network) and/or at network connection 272 (e.g., to a back end network) via switched gigabit Ethernet in conjunction with the switch fabric internal communication system of content delivery system 200. As such, that the architecture illustrated in FIG. 2 may be generally characterized as equivalent to a networking system. [0191] One or more shared resources subsystem modules 255 may also be included in a stream server embodiment of content delivery system 200, for sharing by one or more of the other subsystem modules. Shared resources subsystem module 255 may be monitored by the monitoring agents 245 of each subsystem sharing the resources. The monitoring agents 245 of each subsystem module may also be capable of tracking usage of shared resources 255. As previously described, shared resources may include RAM (Random Access Memory) as well as other types of shared resources. [0192] Each monitoring agent 245 may be present to monitor one or more of the resources 250 of its subsystem processing module as well as the utilization of those resources both within the overall system and within the respective subsystem processing module. For example, monitoring agent 245 of storage subsystem module 210 may be configured to monitor and track usage of such resources as processing engine bandwidth, Fibre Channel bandwidth to content delivery flow path 263, number of storage drives attached, number of input/output operations per second (IOPS) per drive and RAID levels of storage devices that may be employed as content sources 265. Monitoring agent 245 of file system cache subsystem module 215 may be employed monitor and track usage of such resources as processing engine bandwidth and memory employed for caching blocks of data. Monitoring agent 245 of networking subsystem processing module 205 may be employed to monitor and track usage of such resources as processing engine bandwidth, table lookup engine bandwidth, RAM employed for connection control structures and outbound network bandwidth availability. Monitoring agent 245 of application processing subsystem module 225 may be employed to monitor and track usage of processing engine bandwidth. Monitoring agent 245 of application RAM subsystem module 220 may be employed to monitor and track usage of shared resource 255, such as RAM, which may be employed by a streaming application on a per-stream basis as well as for use with connection control structures and buffers. Monitoring agent 245 of inter-process communication path 230 may be employed to monitor and track usage of such resources as the bandwidth used for message passing between subsystems while monitoring agent 245 of inter-process data movement path 235 may be employed to monitor and track usage of bandwidth employed for passing data between the various subsystem modules. [0193] The discussion concerning FIG. 2 above has generally been oriented towards a system designed to deliver streaming content to a network such as the Internet using, for example, Real Networks, Quick Time or Microsoft Windows Media streaming formats. However, the disclosed systems and methods may be deployed in any other type of system operable to deliver content, for example, in web serving or file serving system environments. In such environments, the principles may generally remain the same. However for application processing embodiments, some differences may exist in the protocols used to communicate and the method by which data delivery is metered (via streaming protocol, versus TCP/IP windowing). [0194]FIG. 2A illustrates an even more generalized network endpoint computing system that may incorporate at least some of the concepts disclosed herein. As shown in FIG. 2A, a network endpoint system 10 may be coupled to an external network 11. The external network 11 may include a network switch or router coupled to the front end of the endpoint system 10. The endpoint system 10 may be alternatively coupled to some other intermediate network node of the external network. The system 10 may further include a network engine 9 coupled to an interconnect medium 14. The network engine 9 may include one or more network processors. The interconnect medium 14 may be coupled to a plurality of processor units 13 through interfaces 13 a. Each processor unit 13 may optionally be couple to data storage (in the exemplary embodiment shown each unit is couple to data storage). More or less processor units 13 may be utilized than shown in FIG. 2A. [0195] The network engine 9 may be a processor engine that performs all protocol stack processing in a single processor module or alternatively may be two processor modules (such as the network interface engine 1030 and transport engine 1050 described above) in which split protocol stack processing techniques are utilized. Thus, the functionality and benefits of the content delivery system 1010 described above may be obtained with the system 10. The interconnect medium 14 may be a distributive interconnection (for example a switch fabric) as described with reference to FIG. 1A. All of the various computing, processing, communication, and control techniques described above with reference to FIGS. 1A-1F and 2 may be implemented within the system 10. It will therefore be recognized that these techniques may be utilized with a wide variety of hardware and computing systems and the techniques are not limited to the particular embodiments disclosed herein. [0196] The system 10 may consist of a variety of hardware configurations. In one configuration the network engine 9 may be a stand-alone device and each processing unit 13 may be a separate server. In another configuration the network engine 9 may be configured within the same chassis as the processing units 13 and each processing unit 13 may be a separate server card or other computing system. Thus, a network engine (for example an engine containing a network processor) may provide transport acceleration and be combined with multi-server functionality within the system 10. The system 10 may also include shared management and interface components. Alternatively, each processing unit 13 may be a processing engine such as the transport processing engine, application engine, storage engine, or system management engine of FIG. 1A. In yet another alternative, each processing unit may be a processor module (or processing blade) of the processor engines shown in the system of FIG. 1A. [0197]FIG. 2B illustrates yet another use of a network engine 9. As shown in FIG. 2B, a network engine 9 may be added to a network interface card 35. The network interface card 35 may further include the interconnect medium 14 which may be similar to the distributed interconnect 1080 described above. The network interface card may be part of a larger computing system such as a server. The network interface card may couple to the larger system through the interconnect medium 14. In addition to the functions described above, the network engine 9 may perform all traditional functions of a network interface card. [0198] It will be recognized that all the systems described above (FIGS. 1A, 2, 2A, and 2B) utilize a network engine between the external network and the other processor units that are appropriate for the function of the particular network node. The network engine may therefore offload tasks from the other processors. The network engine also may perform “look ahead processing” by performing processing on a request before the request reaches whatever processor is to perform whatever processing is appropriate for the network node. In this manner, the system operations may be accelerated and resources utilized more efficiently. [0199] Deterministic Information Management [0200] In certain embodiments, the disclosed methods and systems may be advantageously employed for the deterministic management of information (e.g., content, data, services, commands, communications, etc.) at any level (e.g., file level, bit level, etc.). Examples include those described in U.S. patent application Ser. No. 09/797,200, filed Mar. 1, 2001 and entitled “Systems And Methods For The Deterministic Management of Information,” by Johnson et al., the disclosure of which is incorporated herein by reference. [0201] As used herein, “deterministic information management” includes the manipulation of information (e.g., delivery, routing or re-routing, serving, storage, caching, processing, etc.) in a manner that is based at least partially on the condition or value of one or more system or subsystem parameters. Examples of such parameters will be discussed further below and include, but are not limited to, system or subsystem resources such as available storage access, available application memory, available processor capacity, available network bandwidth, etc. Such parameters may be utilized in a number of ways to deterministically manage information. For example, requests for information delivery may be rejected or queued based on availability of necessary system or subsystem resources, and/or necessary resources may be allocated or reserved in advance of handling a particular information request, e.g., as part of an end-to-end resource reservation scheme. Managing information in a deterministic manner offers a number of advantages over traditional information management schemes, including increased hardware utilization efficiency, accelerated information throughput, and greater information handling predictability. Features of deterministic information management may also be employed to enhance capacity planning and to manage growth more easily. [0202] Deterministic information management may be implemented in conjunction with any system or subsystem environment that is suitable for the manipulation of information, including network endpoint systems, intermediate node systems and endpoint/intermediate hybrid systems discussed elsewhere herein. Specific examples of such systems include, but are not limited to, storage networks, servers, switches, routers, web cache systems, etc. It will be understood that any of the information delivery system embodiments described elsewhere herein, including those described in relation to FIGS. 1A and 2, may be employed to manage information in a deterministic manner. [0203]FIG. 5 is a flow diagram illustrating one embodiment of a method 100 for deterministic delivery of content in response to a request for the same. Although FIG. 5 is described in relation to content delivery, it will be understood with benefit of this disclosure that the deterministic methods and systems described herein may be used in a wide variety of information management scenarios, including application serving, and are therefore not limited to only processing requests for content. It will also be understood that the types of content that may be deterministically managed or delivered include any types of content described elsewhere herein, e.g., static content, dynamic content, etc. [0204] With regard to deterministic content delivery methods such as that illustrated in FIG. 5, it will be understood that different types of content may be deterministically managed in different ways to achieved optimum efficiency. For example, when employed to deliver streaming content, such as video or audio streams, the disclosed methods may be advantageously employed to provide increased stability and predictability in stream delivery by, among other things, predicting the capacity of a content delivery system to deliver many long-lived streams. Each such stream requires a certain amount of resources, which may be identified at the time the stream is opened. For web page delivery, such as HTTP serving, requests may be handled as aggregates. [0205] When employed with an information management system such as the content delivery system embodiment illustrated in FIG. 2, method 100 of FIG. 5 may be used to allow a system monitor, a plurality of subsystems and one or more shared resources of a system to effectively interact and provide deterministic delivery of data and services. However, it will be understood that method 100 may be implemented with a variety of other information management system configurations to allow deterministic interaction between system components, for example, between the multiple content delivery engines described in relation to FIG. 1A. Furthermore, FIG. 5 represents just one exemplary set of method steps that may be employed to implement deterministic interaction between system components, with it being understood that any other number, type and/or sequence of method steps suitable for enabling deterministic interaction between two or more components of an information management system may be employed. Selection of suitable steps may be made based on a variety of individual system characteristics, for example, system hardware, system function and environment, system cost and capabilities, etc. [0206] Method 100 of FIG. 5 generally begins at step 105 where a request for content, is awaited. A request for content, as is the case with a request for other information (e.g., data, services, etc.), may be received from a variety of sources. For example, if the system is employed in a stream server environment, the request for content may be received from a client system attached to a computer network or communication network such as the Internet, or any of the other sources of requests described elsewhere herein, including from an overloaded subcomponent of the system which is presently unable to process the current request for content. [0207] Upon receipt of a request for content at step 105, the request for content may be filtered at step 110 by, for example, one or more processing engines or modules that perform the function of a system monitor. Filtering the request for content may serve a variety of purposes. For example, the filtering performed at step 110 may serve as a screening agent to reject requests for content that the receiving system is not capable of processing. Step 110 may also be employed as a first parsing of the received requests for content such that a subsequent level of filtering is employed to further direct the work or requests for content to an appropriate subsystem or system area for processing. It will be understood that other filtering techniques and purposes may also be employed in conjunction with the disclosed systems and methods. [0208] Once the request for content has been filtered, method 100 proceeds to step 115 where the filtered request for content is evaluated. Evaluation of the request for content may be performed by, for example, a system monitor or another subsystem or combination of subsystems capable of evaluating a request for content. With regard to step 115, a request for content may be evaluated in a number of different ways in relation to one or more system or subsystem parameters. For example, a request for content may be evaluated in relation to the requirements for fulfilling the request, e.g., the identified resources that are going to be required to process the particular request for content. As an illustration, a request for access to a streaming video file may be evaluated in relation to one or more of the following requirements: a need for access to storage, a need for processor usage, a need for network bandwidth to enable the data to be streamed from storage, as well as a need for other resources. Evaluation of a request in this manner may be used to enable a system monitor to determine the availability of the required resources, by first identifying what resources will be required to process the request for content. Additional details regarding evaluation of a request for content will be discussed below. [0209] After the resources required to process the current request for content have been identified at step 115, method 100 proceeds to step 120. At step 120, the required resources identified in step 115 may be polled to determine whether the current workload of the required resources is such that the required resources will be available to process the current request for content upon its acceptance. Available resources may be defined, for example, as those required resources that are immediately available to process a request for content, or those resources that will be available within a predefined amount of time. Polling of each of the required resources may occur in parallel or serial manner. [0210] Using the embodiment of FIG. 2 to illustrate, a system operable to process a request for content may include a system monitor 240, a plurality of subsystems (e.g., 210, 215, etc.) and one or more shared resources 255. Each subsystem may include one or more resources 250 that enable that subsystem to perform its respective tasks, and a monitoring agent 245 that is configured to monitor, control, reserve and otherwise manage those resources. In this embodiment, the polling at step 120 may involve the system monitor 240 communicating its resource needs to the monitoring agent 245 of the subsystem having the required resources to process the current request for content. Upon receipt of such communication, the monitoring agent 245 evaluates the workload of the resources 250 for which it is responsible to determine whether there is or there will be enough available resources to process the request for content under consideration. [0211] For example, if the system monitor 240 has indicated that it needs four 4 (four) MB (megabytes) of memory from an application RAM (Random Access Memory) subsystem and the monitoring agent 245 of the application RAM subsystem 220 determines that only 1 MB of memory is available, the system monitor 240 will be notified by the monitoring agent 245 of the unavailability of the application RAM subsystem 220. As a result of the polling of the required resources, a response indicative of the availability of the required resources may be generated by the monitoring agent 245, and transferred to the polling unit, i.e., the system monitor 240. It will be understood that similar interaction between system monitor 240 and respective monitoring agents 245 of other subsystems may occur as appropriate for a given system configuration and a given information request. [0212] In an alternate embodiment, instead of polling the subsystems, a system monitor may receive notifications generated by and transmitted from one or more of the various subsystems. Such notifications may be indicative of the availability of the resources of the various subsystems. For example, if RAM subsystem 220 of FIG. 2 has no available memory, RAM subsystem 220 may automatically notify the system monitor 240 that it is out of memory and therefore unable to take on additional requests for processing. When RAM subsystem resources become or are becoming available, RAM subsystem 220 may automatically generate and transmit a notification to the system monitor 240 indicative of the fact that the RAM subsystem is now or is becoming available to take on additional requests for processing. [0213] Using the above-described automatic notification scheme, a given subsystem may inform a system monitor that the subsystem has reached a threshold of utilization and that the system monitor should slow down on accepting requests. Once a subsystem frees up some of its resources, the given subsystem may then notify the system monitor that it is available or is becoming available and that the system monitor may resume normal operation. Such an implementation allows the system monitor to maintain an awareness of the availability of the subsystems and their resources without requiring the system monitor to poll the subsystems, although it will be understood that both polling and notification functions may be employed together in a given system embodiment. Thus, it will be understood that the various methods and systems disclosed herein may be implemented in various ways to accomplish communication of the status of subsystem resource availability in any manner suitable for accomplishing the deterministic management of information disclosed herein. [0214] At step 125 of method 100, the system monitor accumulates the responses to the resource polls or resource notifications for later evaluation. In one embodiment of method 100, optional step 130 may also be included. At step 130, method 100 loops until all responses or notifications have been received from concerning the identified required resources before allowing method 100 to proceed to step 135. [0215] At step 135, the responses to the resource polls or resource notifications are evaluated, for example, by a system monitor. Evaluation of the resource responses or notifications may involve evaluation of any one or more desired characteristics of the resources including, but not limited to, current availability or estimated time until availability of adequate resources, capability of available resources in relation to a particular request, etc. In one embodiment, evaluation may involve determining whether adequate resources are available, or will be available within a specific time, to process the request for content under consideration. For example, method 100 may require that all of the resources required to process a request for content be immediately available, prior to proceeding toward acceptance of a content request. [0216] Alternatively, evaluation of the responses from the polled resources may entail ensuring that a defined minimum portion of the required resources are immediately available or will become available in a specified amount of time. Such a specified amount of time may be defined on a system-level basis, automatically set by policy on a system-level basis, and/or automatically set by policy on a request-by-request basis. For example, a policy may be implemented to set a maximum allowable time frame for delivery of content based on one or more parameters including, but not limited to, type of request, type of file or service requested, origin of request, identification of the requesting user, priority information (e.g., QoS, Service Level Agreement (“SLA”), etc.) associated with a particular request, etc. A specified maximum allowable time frame may also be set by policy on a system level basis based on one or more parameters including, but not limited to, workload of the present system, resource availability or workload of other linked systems, etc. It will be understood that other guidelines or definitions for acceptable resource availability may be employed. [0217] If, at step 135, the required resources are determined to be available within the guidelines specified for method 100 by one or more system policies, method 100 may proceed to step 140. At step 140, the resources required to process the request for content under consideration may be reserved. For example, using FIG. 2 as an illustration again, reservation of identified required resources 250 may be accomplished by the system monitor 240 or, alternatively, by a combination of the system monitor 240 and the appropriate monitoring agents 245 responsible for each of the identified required resources 250. In one embodiment, reservation of resources includes setting aside that portion of the available resources, or of the resources that will become available within a given time, that has been determined to be required to process the request for content, e.g., a block of memory, a portion of processor power, a portion of network and storage access bandwidth, etc. Reservation of the required resources may be employed to ensure that the current request for content will be readily processed. [0218] Once the required resources have been reserved at step 140, method 100 proceeds to step 145. At step 145, the request for content may be queued for processing by the reserved resources. Upon queuing the request for content at step 145, method 100 returns to step 105 where receipt of a subsequent request for content is awaited by the system. [0219] If, at step 135, it is determined that the required resources are not available to process the request for content, method 100 may proceed to step 150. At step 150, one or more handling policies may be evaluated to determine the proper disposition of the request for content. In this regard, a variety of handling policies (e.g., steps 155, 160 and 165 of FIG. 5) may be made available to properly dispose of requests for content for which the identified resources required to process a request are not available. A given handling policy may be implemented according to one or more system or subsystem parameters in any manner appropriate for the given system environment. [0220] Examples of possible parameters that may be evaluated at step 150 to determine the appropriate handling policy for a given request include, but are not limited to, resource availability and capability of other content delivery systems (e.g., one or more other clustered systems), capability and/or anticipated time until availability of resources in the present content delivery system, the source of the request, the request priority (e.g., SLA, QoS bit set), etc. [0221] In one exemplary embodiment, it is possible at step 150 to select a given policy (e.g., 155, 160 or 165) on a request-by-request or user-by-user basis, for example, based on a specified maximum allowable content delivery time frame that may vary for each request according to one or more parameters such as type of request, type of file or service requested, origin of request, identification of the requesting user, priority information (e.g., QoS, Service Level Agreement (“SLA”), etc.) associated with a particular request, etc. For example, requests from different users and/or requests having different priority codes may be individually associated with different maximum time frame values for delivery of content. When it is determined at step 135 that system resources for the current system won't be available for a given period of time, this given period of time may be compared with the maximum allowable content delivery time frame associated with each request to determine disposition of that request on an individualized basis. Thus, depending on the maximum allowable time frame associated with each request, it is possible that individual requests may be disposed of at step 150 via different policies even when the resource availability time determined at step 135 is the same for each request, e.g., some requests may be immediately transferred to another system via step 155, some requests may be rejected via step 160 and/or some requests may be re-considered via step 165. It will be understood that combinations of different policies and/or maximum content delivery time frames may be implemented in a variety of ways as necessary to achieve desired disposition of different requests. [0222] As illustrated in FIG. 5, evaluation of the handling policies may lead to step 155 where disposal of the requests for content entails transferring the request to another system for processing when identified required resources of the present system are not immediately available or will not become available within a specified period of time. For example, the request for content may be transferred, i.e., by the system monitor, to a separate content delivery system that is known to have resources immediately available or available within a specified period of time. Alternatively, the request for content may be transferred to the next sequential system in a chain of content delivery systems, and where the next system proceeds through a method similar to method 100 to determine its ability to process the request for content. [0223] Upon transferring the request for content to another system at step 155, method 100 of the system returns to step 105 where a subsequent request for content is awaited. It will be understood that a request for content may be transferred to another system that is similarly configured as the present system (e.g., as in a cluster of similar content delivery systems), or to another type of system that is configured differently (e.g., with differing resource types and/or capabilities). In the case of clustered systems, system monitors (or other appropriate subsystem modules) of the individual systems of a cluster may be configured to communicate with each other for purposes of sharing system capability and/or resource availability information with other systems to facilitate efficient transference and handling of requests within a system cluster. [0224] It will also be understood that inter-system transfer of information (e.g., data, content, requests for content, commands, resource status information, etc.) between two or more clustered systems may be managed in a deterministic fashion in a manner similar to that described herein for the intra-system transfer of information between individual processing engines within a single information management system. Deterministic management of intersystem information transfer may be enhanced by distributive interconnection of multiple clustered systems, either internally (e.g., by distributive interconnection of individual distributed interconnects as shown in FIG. 1J) or externally (e.g., by distributive interconnection of individual system network interface processing engines as shown in FIG. 1H). In either case, deterministic transfer of information between individual systems may be managed in a deterministic fashion using any suitable management processing configuration, for example, by using a separate dedicated inter-system management processing module or by using one or more of the existing system monitor processing modules of the individual clustered systems. Individual clusters of systems may in turn be distributively interconnected and information transfer therebetween deterministically managed in a similar fashion, with the number of superimposed levels of deterministic information management being virtually unlimited. Thus, the disclosed methods and systems for deterministic management of information may be advantageously implemented on a variety of scales and/or at multiple system levels as so desired. [0225] Another exemplary policy that may be implemented to address situations in which the current system is unable to process a request for content is illustrated at step 160 where the request for content may be rejected. Similar to step 155, a request for content may be so rejected when the identified required resources of the present system are not immediately available or will not be available within a specified period of time. Such a policy may be implemented, for example, where no other separate clustered system is known to be capable of handling the request, and/or is known to have the necessary resources immediately available or available within a specified period of time. In addition to rejecting the request for content, step 155 may also include notifying the source of the request for content of the rejection and of the inability of the present system to process the request for content. Once the request for content has been rejected at step 160, method 100 returns to step 105 where a subsequent request for content is awaited. [0226] Yet another exemplary policy that may be implemented based on the evaluation step 150 is indicated generally at step 165. At step 165, a request for content may be re-queued for reconsideration by the present system. Re-queuing of a request may include returning to step 115 where the request for content is re-evaluated to identify the resources required for its processing. Such a re-queue may be desirable, for example, when the identified required resources of the present system and of other systems are not immediately available or will not be available within a specified period of time, but when such resources are anticipated to become available at some point in the future. Furthermore, selected types of requests may also be targeted for re-queue rather than rejection when resources are not available. For example, higher priority requests (e.g., based on SLA or QoS bit set) may be re-queued for expedited processing, while similar but lower priority requests are rejected. [0227] It will be understood with benefit of this disclosure that the three handling policies described above in relation to step 150 are exemplary only, and that not all three need be present at step 150. Further, it will be understood that other types of handling policies may be implemented at step 150 as desired to fit the needs of a particular application environment, including additional or alternative policies for treatment of requests other than those described above, and policies that consider alternate or additional system or subsystem parameters. [0228] Turning now to FIG. 2 in greater detail, it will be understood in view of the above discussion that the subsystems of content delivery system 200 may be configured to interact in a deterministic manner if so desired. The ability to manage information in a deterministic fashion may be made possible by virtue of the fact that each subsystem module has a monitoring agent 245 that is aware of one or more subsystem module resources 250 and the utilization of those resources within the respective subsystem and/or overall system 200. [0229] As mentioned above, monitoring agents 245 of each subsystem may be configured to be capable of evaluating the current workload of the resources 250 of the respective subsystem and of reporting the availability of such resources to system monitor 240, either automatically or upon a polling by system monitor 240. Upon receipt of a request, system monitor 240 and one or more individual monitoring agents 245 may individually or together function to either accept the request and reserve the required resources 250 for the request if the resources are available, or to reject the request if one or more subsystem resources 250 required to process the request are not available. [0230] In one embodiment, content delivery system 200 of FIG. 2 may be configured to deterministically deliver content (e.g., one or more video streams) by employing individual monitoring agents 245 in the following roles. Monitoring agent 245 of storage subsystem module 210 may be configured to monitor and reserve such resources as processing engine bandwidth, Fiber Channel bandwidth to content delivery flow path 263, number of available storage devices 265, number of IOPS available per device, and taking into account RAID levels (hardware or software). Monitoring agent 245 of file system caching subsystem module 215 may be configured to monitor and reserve such resources as processing engine bandwidth and memory available for caching blocks of data. Monitoring agent 245 of networking subsystem processing module 205 may be configured to monitor and reserve such resources as processing engine bandwidth, table lookup engine bandwidth, availability of RAM for connection control structures and outbound network bandwidth availability. Monitoring agent 245 of application processing subsystem module 225 may be configured to monitor and reserve processing engine bandwidth. Monitoring agent 245 of other subsystem module 275 may be configured to monitor and reserve resources appropriate to the processing engine features provided therein. [0231] With regard to shared resources 255 of FIG. 2, it will be understood that in a deterministic content delivery embodiment, shared resources 255 may be provided and controlled by individual monitoring agents 245 of each subsystem module sharing the resources 255. Specifically, monitoring agents 245 of each subsystem may be configured to be capable of determining the workload of shared resources 255, and of reserving at least a portion of shared resources 255 that is to be employed by the reserving subsystem to process a request for content. For example, monitoring agent 245 of application RAM subsystem module 220 may be configured to monitor and reserve shared resource 255, such as RAM, for use by streaming application on a per-stream basis as well as for use with connection control structures and buffers. In addition to deterministic interaction between individual subsystem modules of FIG. 2, communications (e.g., IPC protocol) and data movement between the modules may also be deterministic. In this regard, control messaging and data movement between subsystems may be configured to exhibit deterministic characteristics, for example, by employing one or more distributive interconnects (e.g., switch fabrics) to support deterministic data delivery and communication across the range of delivered loads. In one embodiment, separate distributive interconnects may be employed, for example, to deterministically perform the separate respective functions of inter-process communications path 230 and inter-process data movement path 235 of FIG. 2. In another embodiment, these separate functions may be combined and together deterministically performed by a single distributive interconnect, such as a single distributive interconnect 1080 of FIG. 1A. In either case, a distributive interconnect may be configured to support the bandwidth of communications and/or data (e.g., content) being transmitted or served so that added latency is not incurred. [0232] As shown in FIG. 2, a separate monitoring agent 245 may be employed for each distributive interconnect present in a given system, with each interconnect being treated as a separate subsystem module. For example, in the exemplary embodiment of FIG. 2, monitoring agent 245 of inter-process communication path 230 may be configured to monitor and reserve such resources as the bandwidth available for message passing between subsystems while monitoring agent 245 of inter-process data movement path 235 may be configured to monitor and reserve the bandwidth available for passing data between the various subsystems. In another example, multiple distributive interconnects may be provided with monitoring agents to monitor and reserve either communication or data movement flow paths on an assigned or as-needed basis between subsystem modules, or between other distributive interconnects (e.g., in the case of internally clustered systems). Alternatively, a monitoring agent of a single distributive interconnect may be configured to monitor and reserve message-passing and data-passing bandwidth when these functions are handled by a single distributive interconnect, such as a single switch fabric. [0233] Still referring to FIG. 2, method 100 of FIG. 5 may be implemented by system 200 as follows. System 200 begins by waiting for a request at step 105. In this regard, networking subsystem module 205 or some other subsystem module of system 200 may receive a request for content or a request for services from source 260, or from any of the other possible sources previously mentioned. As previously described, a request for content may include such requests as a request to start a video stream, a request for stored data, etc. A request for services may include, for example, a request for a database query, a request for a process to start, a request for an application to be run, etc. [0234] At step 110, system monitor 240 filters the request for content as previously described. In this capacity, system monitor 240 may be configured to coordinate deterministic actions of system 200 by acting as a central clearing house or evaluator of content requests, and by directing the disposition of same. Although described in relation to system monitor 240, it will be understood that coordination of deterministic tasks may be performed by any subsystem module or combination of subsystem modules suitable for performing one or more of the tasks described herein as being performed by system monitor 240. For example, filtering tasks may be performed in whole or in part by application processing subsystem module 225. Furthermore, it will also be understood that one or more deterministic coordination tasks may be performed by processors or combinations of processors that are integral and/or external to a given system 200. For example, a processing module (e.g., system monitor 240) integral to a single system 200 may perform the deterministic coordination tasks for a cluster of linked systems. In an alternate example, a separate dedicated external processing module may be employed to perform the deterministic coordination tasks for a single system 200, or a cluster of such systems. [0235] Once a request has been filtered at step 110 and the resources 250 required to process the request have been identified at step 115, system monitor 240 proceeds to step 120 and polls all of the monitoring agents 245 of the subsystem modules having the resources 250 that have been identified as being required to interact to process the given request, and accumulates responses from monitoring agents 245 at step 125. In response to this polling, a given subsystem module may be configured to refuse to take on additional requests unless it currently has, or will have within a specified period of time, the resources 250 available to process the new request without degradation to requests that it is already processing. [0236] The monitoring tasks of monitoring agents 245 may be performed by any processor or combination of processors suitable for performing one or more of the monitoring tasks as described elsewhere herein. In this regard, monitoring tasks may be performed by one or more processors integral to a given monitored subsystem module as illustrated in FIG. 2, or may alternatively be performed by one or more processors external to the given subsystem module, or even external to system 200 itself. Furthermore, it is possible that a combination of monitoring tasks and deterministic coordination tasks may be performed by the same individual processor (e.g., both functions performed by system monitor 240), or by a combination of processors. Thus, it will be understood that the disclosed methods and systems may be implemented using a wide variety of hardware and/or logical configurations suitable for achieving the deterministic management of information as described herein. [0237] After the responses from monitoring agents 245 are accumulated in step 125, system monitor 240 evaluates the responses at step 135 to determine if adequate resources are available as previously described, although evaluation may be accomplished in any other suitable manner, such as by using a different processing module or a combination of processing modules. For example, application processing subsystem module 225 may communicate with system monitor 240 and evaluate responses based on the resource responses or notifications that have been accumulated by system monitor 240 in step 125. [0238] As previously mentioned, system monitor 240 may then participate in reserving and queuing the resources of each subsystem at steps 140 and 145 if the monitoring agents 245 of the appropriate subsystems have indicated that they have the identified resources 250 available that are required to process the request. Alternatively, individual monitoring agents 245 may reserve the required resources based upon requirements communicated to monitoring agents 245 by system monitor 240 or other processing module/s. An individual processing queue for each subsystem module may be maintained by its appropriate monitoring agent, and/or a centralized processing queue may be maintained for one or more modules by the system monitor. [0239] As previously mentioned with respect to step 150, disposition of requests that a information management system is immediately unable to process or will not be able to process within a specified period of time may be determined by consulting one or more handling policies. For example, a request for content may be rejected in step 160, re-directed to another server 201 with capacity to spare in step 155, or queued for later processing in step 165. As with other exemplary steps of method 100, handling policy evaluation step 150 may be performed by system monitor 240, and/or other suitable processing module/s (e.g., application processing subsystem module 225). [0240] The disclosed methods of deterministic information management may be accomplished using a variety of control schemes. For example, in one embodiment an application itself (e.g., video streaming) may be configured to have intimate knowledge of the underlying hardware/resources it intends to employ so as to enable identification, evaluation and reservation of required hardware/resources. However, in another embodiment the operating system employed by an information management system may advantageously be configured to maintain the necessary knowledge of the information management system hardware and hide such details from the application. In one possible embodiment, such an approach may be implemented for more general deployment in the following manner. An operating system vendor or a standards body may define a set of utilization metrics that subsystem vendors would be required to support. Monitoring and reservation of these resources could then be ‘built-in’ to the operating system for application developers to use. As one specific example, network interface card vendors might be required to maintain percent utilization of inbound and outbound bandwidth. Thus, if a request is received by a content delivery system for delivery of an additional 300 kb/s (kilobit per second) video stream, and the outbound networking path is already 99% utilized, such a request for content may be rejected. [0241] Deterministic management of information has been described herein in relation to particular system embodiments implemented with multiple subsystem modules distributively interconnected in a single chassis system, or in relation to embodiments including a cluster of such systems. However, it will be understood that information may be deterministically managed using a variety of different hardware and/or software types and may be implemented on a variety of different scales. FIG. 6 illustrates just one example of such an alternate embodiment in which the concept of a series of distributively interconnected subsystems may be extrapolated from optimization of resources within a single chassis information management system (e.g., server, router, etc.) to optimization of server resources in a data center 300. Such an implementation may involve deterministically managing communications and information flow between a number of separate devices within data center 300, although it may also be implemented to deterministically manage communication and information flow between similar-type devices integrated into the same chassis. [0242] As shown in FIG. 6, data center 300 may include a device or blade, such as load balancing device 305, that is responsible for load-balancing traffic requests received from network 307 across a number of servers 310 and/or content routers 311 (e.g., within the same chassis or a number of chassis), and in which load-balancing device 305 communicates with servers 310 and/or content routers 311 over a distributively interconnected control/data path 315. In such an embodiment, load balancing device 305 may communicate with system monitors 320 and 330 of respective servers 310 and content routers 311 to determine whether servers 310 or content routers 311 have resources available. Such resources may include, for example, available bandwidth of storage area networks 312 and/or 313 to handle additional requests. In this regard, load balancing device 305 may filter and evaluate requests, poll data center 300 resources, evaluate the responses and dispose of the requests in a deterministic manner similar to that described elsewhere herein, e.g., for system monitor 240 of FIG. 2. [0243] In a further possible embodiment, one or more of servers 310 and/or content routers 311 may be internally configured with subsystem modules that are distributively interconnected and deterministically managed, for example, in a manner as described in relation to FIGS. 1A and 2. In such an implementation, each server 310 and content router 311 itself (in terms of delivering streams or pages) is capable of monitoring its resources and interacting with an external agent in a way that is analogous to the way that the internal subsystems of individual servers 310 and/or content routers 311 are interacting. [0244] In other further embodiments, the disclosed deterministic information management concept may be applied to many different technologies where the concept of a server may be generalized. For example, implementation of the present invention may apply to a device that routes data between a gigabit Ethernet connection to a Fiber Channel connection. In such an implementation, the subsystems may be a networking subsystem, a Fiber Channel subsystem and a routing subsystem. An incoming request for a SCSI (Small Computer System Interface) block would appear at the networking subsystem. The system monitor would then poll the system devices to determine if resources are available to process the request. If not, the request is rejected, or else the necessary resources are reserved and the request is subsequently processed. [0245] Finally, although various embodiments described herein disclose monitoring each individual processing engine of an information management system, such as each subsystem module of content delivery system 200 of FIG. 2, such extensive monitoring may not be necessary in particular application environments. For example, if one or more processing engines has sufficient resources to handle virtually any workload that the information management system is able to provide, it may be unnecessary to track the availability of those resources. In such an implementation, the processing power that may have been utilized to monitor, poll, track, etc. the resources of such a processing engine may be conserved or eliminated. Such a reduction in monitoring and processing power may reduce the overall system cost as well as reduce system design costs. [0246] Differentiated Services [0247] The disclosed systems and methods may be advantageously employed to provide one or more differentiated services in an information management environment, for example, a network environment. In this regard, examples of network environments in which the disclosed systems and methods may be implemented or deployed include as part of any node, functionality or combination of two or more such network nodes or functionalities that may exist between a source of information (e.g., content source, application processing source, etc.) and a user/subscriber, including at an information source node itself (e.g., implemented at the block level source) and/or up to a subscriber node itself. As used herein, the term “differentiated service” includes differentiated information management/manipulation services, functions or tasks (i.e., “differentiated information service”) that may be implemented at the system and/or processing level, as well as “differentiated business service” that may be implemented, for example, to differentiate information exchange between different network entities such as different network provider entities, different network user entities, etc. These two types of differentiated service are described in further detail below. In one embodiment, either or both types of differentiated service may be further characterized as being network transport independent, meaning that they may be implemented in a manner that is not dependent on a particular network transport medium or protocol (e.g., Ethernet, TCP/IP, Infiniband, etc.), but instead in a manner that is compatible with a variety of such network transport mediums or protocols. [0248] As will be described further herein, in one embodiment the disclosed systems and methods may be implemented to make possible session-aware differentiated service. Session-aware differentiated service may be characterized as the differentiation of information management/manipulation services, functions or tasks at a level that is higher than the individual packet level, and that is higher than the individual packet vs. individual packet level. For example, the disclosed systems and methods may be implemented to differentiate information based on status of one or more parameters associated with an information manipulation task itself, status of one or more parameters associated with a request for such an information manipulation task, status of one or more parameters associated with a user requesting such an information manipulation task, status of one or more parameters associated with service provisioning information, status of one or more parameters associated with system performance information, combinations thereof, etc. Specific examples of such parameters include class identification parameters, system performance parameters, and system service parameters described further herein. In one embodiment, session-aware differentiated service includes differentiated service that may be characterized as resource-aware (e.g., content delivery resource-aware, etc.) and, in addition to resource monitoring, the disclosed systems and methods may be additionally or alternatively implemented to be capable of dynamic resource allocation (e.g., per application, per tenant, per class, per subscriber, etc.) in a manner as described further herein. [0249] Deterministic capabilities of the disclosed systems and methods may be employed to provide “differentiated information service” in a network environment, for example, to allow one or more tasks associated with particular requests for information processing to be provisioned, monitored, managed and/or reported differentially relative to other information processing tasks. The term “differentiated information service” includes any information management service, function or separate information manipulation task/s that is performed in a differential manner, or performed in a manner that is differentiated relative to other information management services, functions or information manipulation tasks, for example, based on one or more parameters associated with the individual service/function/task or with a request generating such service/function/task Included within the definition of “differentiated information service” are, for example, provisioning, monitoring, management and reporting functions and tasks as described elsewhere herein. Specific examples include, but are not limited to, prioritization of data traffic flows, provisioning of resources (e.g., disk IOPs and CPU processing resources), etc. [0250] As previously mentioned, business services (e.g., between network entities) may also be offered in a differentiated manner. In this regard, a “differentiated business service” includes any information management service or package of information management services that may be provided by one network entity to another network entity (e.g., as may be provided by a host service provider to a tenant and/or to an individual subscriber/user), and that is provided in a differential manner or manner that is differentiated between at least two network entities. In this regard, a network entity includes any network presence that is or that is capable of transmitting, receiving or exchanging information or data over a network (e.g., communicating, conducting transactions, requesting services, delivering services, providing information, etc.) that is represented or appears to the network as a networking entity including, but not limited to, separate business entities, different business entities, separate or different network business accounts held by a single business entity, separate or different network business accounts held by two or more business entities, separate or different network ID's or addresses individually held by one or more network users/providers, combinations thereof, etc. A business entity includes any entity or group of entities that is or that is capable of delivering or receiving information management services over a network including, but not limited to, host service providers, managed service providers, network service providers, tenants, subscribers, users, customers, etc. [0251] A differentiated business service may be implemented to vertically differentiate between network entities (e.g., to differentiate between two or more tenants or subscribers of the same host service provider/ISP, such as between a subscriber to a high cost/high quality content delivery plan and a subscriber to a low cost/relatively lower quality content delivery plan), or may be implemented to horizontally differentiate between network entities (e.g., as between two or more host service providers/ISPs, such as between a high cost/high quality service provider and a low cost/relatively lower quality service provider). Included within the definition of “differentiated business service” are, for example, differentiated classes of service that may be offered to multiple subscribers. Although differentiated business services may be implemented using one or more deterministic and/or differentiated information service functions/tasks as described elsewhere herein, it will be understood that differentiated business services may be provided using any other methodology and/or system configuration suitable for enabling information management or business services to be provided to or between different network entities in a differentiated manner. [0252] As described herein above, the disclosed methods and systems may be implemented to deterministically manage information based at least in part on parameters associated with particular processed information, or with a particular request for information such as a request for content or request for an information service. Examples of such parameters include, but are not limited to, priority level or code, identity of the requesting user, type of request, anticipated resources required to process the request, etc. As will be further described herein below, in one embodiment these deterministic features may be implemented to provide differentiated information service, for example, in the provisioning of resources and/or prioritization of resources for the processing of particular requests or for performing other tasks associated with management of information. In such an implementation, deterministic management may be configured to be user programmable and/or may be implemented at many system levels, for example, below the operating system level, at the application level, etc. Such deterministic features may be advantageously implemented, for example, to bring single or multi subscriber class of service and/or single or multi content class of service capability to both single and multi-tenant (e.g., shared chassis or data center) environments. [0253] In one differentiated information service embodiment disclosed herein, differentially managing an individual information processing request relative to other such requests allows provisioning of shared resources on a request-by-request, user-by-user, subscriber-by-subscriber or tenant-by-tenant basis based on SLA terms or other priority level information. Differentially monitoring or tracking resource usage for a particular request or particular user/customer allows reporting and verification of actual system performance relative to SLA terms or other standards set for the particular user or customer, and/or allows billing for shared resource usage to be based on the differential use of such resources by a particular user/customer relative to other users/customers. Thus, differentiation between information requests may be advantageously employed to increase efficiency of information management by allowing processing of a particular request to be prioritized and/or billed according to its value relative to other requests that may be simultaneously competing for the same resources. By providing the capability to differentiate between individual information management/manipulation tasks, maximum use of shared resources may be ensured, increasing profitability for the information management system operator and providing users with information management services that are predictable and prioritized, for example, based on the user's desired service level for a given request. In this way, deterministic information management may be employed to enable service providers to differentiate and optimize customer service levels (i e., the customer experience) by allocating content delivery resources based on business objectives, such as bandwidth per connection, duration of event, quality of experience, shared system resource consumption, etc. [0254] The ability to differentiate between information requests may be especially advantageous during periods of high demand, during which it is desirable that an e-business protect its most valuable customers from unpredictable or unacceptable service levels. As described elsewhere herein, system resources (bandwidth, storage processing, application processing, network protocol stack processing, host management processing, memory or storage capacity, etc.) may be adaptively or dynamically allocated or re-allocated according to service level objectives, enabling proactive SLA management by preserving or allocating more resources for a given customer when service levels are approaching SLA thresholds or when system resource utilization is approaching threshold levels, thus assuring SLA performance and generating substantial savings in SLA violation penalties. [0255] Capability to deliver differentiated information service may be implemented using any suitable system architectures, such as one or more of the system architecture embodiments described herein, for example, asymmetrical processing engine configuration, peer-to-peer communication between processing engines, distributed interconnection between multiple processing engines, etc. For example, when implemented in an embodiment employing asymmetrical multi-processors that are distributively interconnected, differentiated management and tracking of resource usage may be enabled to deliver predictable performance without requiring excessive processing time. Furthermore, management and tracking may be performed in real-time with changing resource and/or system load conditions, and the functions of management and tracking may be integrated so that, for example, real time management of a given information request may be based on real time resource usage tracking data. [0256] The disclosed differentiated service capability may be implemented in any system/subsystem network environment node that is suitable for the manipulation of information, including network endpoint systems, intermediate node systems and endpoint/intermediate hybrid systems discussed elsewhere herein. Such capability may also be implemented, for example, in single or multiple application environments, single or multi CoS environments, etc. It will also be understood that differentiated service capability may be implemented across any given one or more separate system nodes and/or across any given separate components of such system nodes, for example, to differentially provision, monitor, manage and/or report information flow therebetween. For example, the disclosed systems and methods may be implemented as a single node/functionality of a multi-node/functionality networking scheme, may be implemented to function across any two or more multiple nodes/functionalities of a multi-node/functionality networking scheme, or may be implemented to function as a single node/functionality that spans the entire network, from information source to an information user/subscriber. [0257] As will be further described herein, the disclosed differentiated services may be advantageously provided at one or more nodes (e.g., endpoint nodes, intermediate nodes, etc.) present outside a network core (e.g., Internet core, etc.). Examples of intermediate nodes positioned outside a network core include, but are not limited to cache devices, edge serving devices, traffic management devices, etc. In one embodiment such nodes may be described as being coupled to a network at “non-packet forwarding” or alternatively at “non-exclusively packet forwarding” functional locations, e.g., nodes having functional characteristics that do not include packet forwarding functions, or alternatively that do not solely include packet forwarding functions, but that include some other form of information manipulation and/or management as those terms are described elsewhere herein. [0258] Examples of particular network environment nodes at which differentiated services (i.e., differentiated business services and/or differentiated information services) may be provided by the disclosed systems and methods include, but are not limited to, traffic sourcing nodes, intermediate nodes, combinations thereof, etc. Specific examples of nodes at which differentiated service may be provided include, but are not limited to, switches, routers, servers, load balancers, web-cache nodes, policy management nodes, traffic management nodes, storage virtualization nodes, node between server and switch, storage networking nodes, application networking nodes, data communication networking nodes, combinations thereof, etc. Specific examples of such systems include, but are not limited to, any of the information delivery system embodiments described elsewhere herein, including those described in relation to FIGS. 1A and 2. Further examples include, but are not limited to, clustered system embodiments such as those illustrated in FIGS. 1G through 1J. Such clustered systems may be implemented, for example, with content delivery management (“CDM”) in a storage virtualization node to advantageously provide differentiated service at the origin and/or edge, e.g., between disk and a client-side device such as a server or other node. [0259] Advantageously, the disclosed systems and methods may be implemented in one embodiment to provide session-aware differentiated information service (e.g., that is content-aware, user-aware, request-aware, resource-aware, application aware, combinations thereof, etc.) in a manner that is network transport independent. For example, differentiated information service may be implemented at any given system level or across any given number of system levels or nodes (e.g., across any given number of desired system components or subsystem components) including, but not limited to, from the storage side (spindle) up to the WAN edge router level, from the storage side up to the service router level, from the storage side up to the core router level, from server to router level (e.g., service router, edge router, core router), etc. Furthermore, the disclosed systems and methods may be implemented to provide differentiated information service in such environments on a bi-directional information flow basis (e.g., they are capable of differentially managing both an incoming request for content as well as the outgoing delivery of the requested content), although uni-directional differentiated information service in either direction is also possible if so desired. The disclosed differentiated services not only may be provided at any given system level or across any given number of system levels or nodes as described above, but as described further herein also may be implemented to provide functions not possible with conventional standards or protocols, such as Ethernet priority bits, Diffserv, RSVP, TOS bits, etc. TCP/IP and Ethernet are conventional communication protocols that make use of priority bits included in the packet, e.g., Ethernet has priority bits in the 802.1 p/q header, and TCP/IP has TOS bits. [0260] In one specific implementation, a serving endpoint may be provided with the ability to not only distinguish between a number of service classes of traffic/application/service, but also to make admission-control and other decisions based on this information. In such a case, policies may be employed to direct the operational behavior of the server endpoint. [0261] In another specific implementation, statistical data gathering and logging may be employed to track resource provisioning and/or shared resource usage associated with particular information manipulation tasks such as may be associated with processing of particular requests for information. Data collected on resource provisioning and shared resource usage may in turn be employed for a number of purposes, including for purposes of billing individual users or suppliers according to relative use of shared resources; tracking actual system performance relative to SLA service guarantees; capacity planning; activity monitoring at the platform, platform subsystem, and/or application levels; real time assignment or reassignment of information manipulation tasks among multiple sub-systems and/or between clustered or linked systems; fail-over subsystem and/or system reassignments; etc. Such features may be implemented in accordance with business objectives, such as bandwidth per subscriber protection, other system resource subscriber protection, chargeable time for resource consumption above a sustained rate, admission control policies, etc. [0262] It will be understood that differentiated information service functions, such as resource management and other such functions described herein, may be performed at any system level or combination of system levels suitable for implementing one or more of such functions. Examples of levels at which differentiated information service functions may be implemented include, but are not limited to, at the system BIOS level, at the operating system level, service manager infrastructure interface level. Furthermore, differentiated information service capability may be implemented within a single system or across a plurality of systems or separate components. [0263] A simplified representation showing the functional components of one exemplary embodiment of an information management system 1110 capable of delivering differentiated information service is shown in FIG. 7. Functional components of system 1110 include hardware system architecture 1120, system BIOS 1130, operating system 1140, management application program interface API 1160, application API 1150, network content delivery applications 1180, and differentiated service management infrastructure 1190. System architecture 1120 may be any information system architecture having deterministic and/or asymmetric processing capabilities, for example, as described elsewhere herein. [0264] In one embodiment, system architecture 1120 may include multiple system engines that are distributively interconnected, for example, in a manner as illustrated and described relation to FIG. 1A or FIG. 2. System architecture 1120 may also include system software that has state knowledge of resource utilization within the architecture and that is capable of imparting deterministic capabilities (e.g., instructions) to system architecture 1120, for example, by deterministically controlling interaction between distributively interconnected system engines of system architecture 1120. As described in relation to FIG. 2, monitoring agents 245 may be provided within each subsystem module and the system architecture 1120 may include a system monitor 240 that performs system management functions, such as maintaining service policies, collecting real-time utilization data from all subsystem modules, etc. System architecture 1120 may be capable of supporting a discrete family of applications or multiple concurrent applications (e.g., streaming applications such as QuickTime, RealNetwork and/or Microsoft Media, edge cache-related, NAS-related, etc.). [0265] System calls may be employed to OS-extensions to determine characteristics of one or more parameters associated with processing engines/resources of a system architecture 1120 (e.g., as in FIGS. 1A and 2) so as to enable deterministic information management and/or to provide differentiated information service functions in a manner described elsewhere herein. In one embodiment, calls to OS-extensions may be made to implement necessary system resource utilization and user priority information. As an example, referring back to FIG. 2, monitoring agent 245 of storage subsystem module 210 may be employed to monitor the workload on each content source 265, as well as the status of other resources 250 of module 210 such as workload on the system CPU doing the caching and block operations, as well as the available memory for caching. Monitoring of this information makes possible calls to storage processing subsystem module 210, for example, to determine availability of IOPs on the drive(s) upon which a requested content stream resides. Similarly, calls may be made to networking subsystem processor module 205 having its own monitoring agent 245 to determine how much bandwidth on the outbound connection is already being used, as well as to determine if sufficient additional resources are available to add another connection. A call may also be made to determine whether sufficient RAM is available in file system cache subsystem module 215 to support this operation, which is also provided with a monitoring agent 245. [0266] As will be described in further detail below, system calls may also be employed to understand parameters, such as priority, associated with individual connections, requests for information, or specific content sets. Examples of such parameters include, but are not limited to, those associated with classes based on content, classes based on application, classes based on incoming packet priority (e.g., utilizing Ethernet priority bits, TCP/IP TOS bits, RSVP, MPLS, etc.), classes based on user, etc. It will be understood that the possible system calls described above are exemplary only, and that many other types of calls or combinations thereof may be employed to deterministically manage information and/or to provide differentiated information service capability in a manner as described elsewhere herein. It will also be understood that where a system monitor 240 collects and maintains monitored subsystem module information, system calls may be handled by system monitor 240 rather than by the individual subsystem modules as described above. [0267] Thus, the capability of monitoring individual subsystem or processing engine resources provided by the disclosed deterministic information management systems may be advantageously implemented in one embodiment to make possible policy-based management of service classes and guarantees in a differentiated manner from a server endpoint. One possible implementation of such an embodiment may be characterized as having the following features. All subsystems that represent a potential bottleneck to complete the requested information management are configured to support prioritized transactions. Any given transaction (e.g., video stream, FTP transfer, etc.) is provided a unique ID that is maintained in the OS or in the application, which includes a priority indicator (or other class of service indicator). OS extensions or other API's are provided for applications to access this information, and an I/O architecture configured to support prioritized transactions. [0268] As further illustrated in FIG. 7, optional system BIOS 1130 may be present to manage system calls made to processing engines of architecture 1120 from applications 1180 through optional APIs 1160 and/or 1150 and through operating system 1140. In this regard system BIOS 1130 enables applications 1180 to utilize architecture 1120 in a deterministic manner by providing access to data presented by individual engines or subsystem modules of architecture 1120, and by ensuring calls are made properly to individual engines or subsystem modules of architecture 1120 in a manner as described above. System BIOS 1130 may make this possible, for example, by responding to application requests for resources with availability information, rerouting information, or SLA choice information. System BIOS 1130 may be implemented as hardware, software or a combination thereof, and may include the IPC. [0269] In one embodiment, operating system 1140 may be a conventional operating system (e.g., Linux-based operating system), to which applications 1180 may be directly ported or may be ported through optional application APIs 1150 and/or 1160 as described below. In this regard, optional APIs 1150 may be provided to enhance performance of one or more applications on system 1110, including, but not limited to, network content delivery applications 1180 as illustrated in FIG. 7. As shown, examples of network content delivery applications include, but are not limited to, applications related to HTTP, streaming content, storage networking, caching, protocol software level switching (e.g., Layer 3 through Layer 7), load balancing, content delivery management (CDM), etc. It will be understood that these listed applications are exemplary only, and that other applications or other combinations of applications (e.g., greater or lesser number, and/or combinations of different applications and/or types of applications, etc.) are also possible. Just a few example of other possible network content delivery applications or internet applications include, but are not limited to, applications related to database, FTP, origin, proxy, other continuous content, etc Although some performance advantages are possible when conventional applications 1180 are directly ported to conventional operating system 1140, application and operating system functions are thus executed in a manner that is essentially unaware of the asymmetric and deterministic capabilities of architecture 1120. Thus, optional application APIs 1150 may be configured as system and/or subsystem-aware functional components that when present at the application/operating system interface may provide significant enhancement and accelerated system performance by streamlining communication and data flow between the application level and the other levels of system 1110 in a manner as described elsewhere herein. Optional management APIs 1160 may also be present to perform a similar function at the operating system/BIOS interface. Although illustrated in FIG. 7 as separate functional components from conventional operating system 1140, it will be understood that functionality of BIOS 1130, API 1160 and/or API 1150 may be built-into or resident within an operating system. [0270] In yet another embodiment, one or more of applications 1180 may be written as system and/or subsystem-aware components themselves, further enhancing and accelerating system performance. For example, code may be included in a selected application that not only utilizes calls into operating system 1140 that indicate the relative priority of each connection or request, but that also utilizes calls indicating the availability of necessary resources or subsystems in architecture 1120 to support each stream. In this manner, the application is enabled to make smart decisions about how to handle various classes of customers in times of system congestion. [0271] Although not illustrated, an operating system may be configured to enable deterministic/differential system performance through a direct interface between applications 1180 and system architecture 1120, e.g., without the need for BIOS 1130. In such a case, system calls may be implemented and managed in the operating system itself. Advantageously, the unique deterministic nature of the system architectures disclosed herein (e.g., FIGS. 1A and 2) make possible such operating system features by enabling monitoring on the subsystem level without excessive processing overhead. [0272] Still referring to FIG. 7, differentiated service management infrastructure 1190 may be provided to enable differentiated service functions or tasks including, but not limited to, service provisioning, service level agreement protocols, QoS and CoS policies, performance monitoring, reporting/billing, usage tracking, etc. These particular management functions will be described in further detail herein, however it will be understood that any other information management function/s that act in a way to differentiate service and/or flow of information may also be implemented using the disclosed systems and methods. [0273] Individual differentiated information service functions of service management infrastructure 1190 may be performed within system 1110 (e.g., by a system management processing engine 1060 described elsewhere herein) and/or may be performed a separate network-connected management system/s (e.g., via interface support to an external data center for service management), such as a separate system running IBM Tivoli, HP Open View, etc. For example, in one embodiment service provisioning, QoS, and performance monitoring functions may be performed by a host processing unit 1122 (e.g., a system management processing engine 1060 as described elsewhere herein) within architecture 1120, while billing and usage tracking functions may be performed by a separate externally connected network component/system based on performance monitoring data supplied by system 1110 (e.g., via a management interface 1062). When information is so provided to an external system for further processing, such information may be output (e.g., such as flat file, SNMP, web-based, CLI, etc.), or selected management APIs 1160 may be present to interface and enhance communications between system 1110 and the external system by providing performance monitoring/usage data in an optimized format for the particular application type/s running on the external system. [0274] It will be understood that FIG. 7 illustrates only one exemplary functional representation of an information management system capable of delivering differentiated service, and that differentiated service capability may be implemented in a variety of other ways, using other combinations of the functional components illustrated in FIG. 7, and/or using different functional components and various combinations thereof. For example, operating system 1140 and/or BIOS 1130 may be extended beyond the boundary of system 1110 to deterministically interface with systems, subsystems or components that are external to system 1110, including systems, subsystems or components that are physically remote from system 1110 (e.g., located in separate chassis, located in separate buildings, located in separate cities/countries etc.) and/or that are not directly coupled to system 1110 through a common distributed interconnect. Examples of such external systems, subsystems or components include, but are not limited to, clustered arrangements of geographically remote or dispersed systems, subsystems or components. [0275]FIG. 8 illustrates one embodiment of a method for implementing differentiated service capability based on defined business objectives, for example, in a competitive service differentiation implementation. As shown, the method includes defining business objectives in step 1210, defining a system configuration in step 1220, purchasing and installing the configured system in step 1230, provisioning service in step 1240, monitoring/tracking service in step 1250, managing information processing in step 1260 and/or reporting service information in step 1270. It will be understood that the method steps of FIG. 8 are exemplary only, and that embodiments of the disclosed systems and methods may be implemented with any one of the steps, or with any combination of two or more of the steps illustrated in FIG. 8. It will be further understood that the disclosed methods and systems may be implemented with other steps not illustrated in FIG. 8, or with combinations of such other steps with any one or more of the steps illustrated in FIG. 8. [0276] The embodiment of FIG. 8 may be implemented, for example, to allow a host service provider (“HSP”) to use the disclosed methods and systems to provide one or more differentiated business services for one or more tenants, who in turn may provide services to subscribers. Examples of HSP's include, but are not limited to, a data center owner who provides co-located or managed services to one or more tenants. Examples of tenants include, but are not limited to, xSPs (such as ISP, ASP, CDSP, SSP, CP or Portal), Enterprise providers providing service to employees, suppliers, customers, investors, etc. A tenant may be co-located or under HSP Managed Service. Subscribers include, for example, residential and/or business customers who access a network content delivery system to play audio/video streams, read web pages, access data files, etc. It will be understood that these examples are exemplary only, and that the embodiment of FIG. 8 may be implemented to allow entities other than an HSP to provide differentiated business services using the disclosed methods and systems. [0277] Referring now to FIG. 8 in more detail, business objectives may be defined in step 1210 and may include objectives such as service definition objectives (e.g., delivery of continuous broadcast, non-continuous and/or stored information, management of unique/non-unique information, anticipated number of simultaneous subscribers and/or simultaneous streams, event (e.g., stream) duration, system resources (e.g. bandwidth) per subscriber, etc.), service differentiation objectives (e.g., horizontal and/or vertical differentiation between different entities, differentiation based on quality/cost plan, differentiation based on type of information request, differentiation based on user/subscriber and/or user/subscriber characteristics, etc.), service level agreement objectives (e.g., CoS priority, QoS etc.), service metering objectives and/or service monitoring objectives (e.g., subscriber flow performance, tenant class performance or individual tenant performance, aggregate system performance, individual subsystem performance, etc.), service reporting objectives (e.g., billing log generation, tracking adherence to SLA, tracking utilization of system and/or subsystems, tracking subscriber and/or content activity, etc.), information processing management objectives (e.g., admission and/or prioritization of requests based on tenant class or individual tenant identity, overflow treatment, etc.), and/or service classes (e.g., desired number and/or types of service classes, etc.). Such objectives may be defined in any manner suitable for communicating the same, for example, from a system purchaser/user to an information management system supplier. Types of objectives that may be defined include one or more pre-defined types of variables, and/or may include one or more custom objective aspects. [0278] Still referring to FIG. 8, a system configuration may be defined in step 1220 based at least partly on business objectives defined in step 1210, for example, by a system manufacturer based on system objectives provided by a purchaser in step 1210. In this regard step 1220 may include, but is not limited to, planning a system configuration to meet objectives such as anticipated capacity, and engineering system characteristics to implement the defined configuration, etc. For example, a system configuration may be planned to meet capacity objectives including, but not limited to, anticipated system throughput objectives, service level protection objectives, maximum number of customer objectives, etc. Examples of solution engineering parameters include, but are not limited to, implementing the system configuration by engineering types and number of system and subsystem hardware components, quality of service objectives, billing and metering objectives, etc. In one exemplary embodiment, specific examples of information system characteristics that may be so configured for a content delivery system include, but are not limited to, storage characteristics (e.g., storage capacity, mirroring, bandwidth attach rate, protocol, etc.); compute characteristics (e.g., CPU speed, management responsibility, application processing capability, etc.); and network characteristics (e.g., admission control, policy management, number of classes, etc.), combinations thereof, etc. [0279] Advantageously, embodiments of the disclosed systems may be configured in consideration of many factors (e.g., quality of service capability, desired SLA policies, billing, metering, admission control, rerouting and other factors reflective of business objectives) that go beyond the simple capacity-oriented factors considered in traditional server design (e.g., anticipated number of requests per hour, duration of stream event, etc.). An information management system may be so configured in this manner based on verbal or written communication of such factors to a system supplier and system configuration accomplished by the supplier based thereupon, and/or a system may be configured using an automated software program that allows entry of such factors and that is, for example, running locally on a supplier's or customer's computer or that is accessible to a customer via the Internet. [0280] In one exemplary embodiment, possible system configurations that may be provided in step 1220 based on business objectives or other defined variables include, but are not limited to, configuration of subsystem components within a single box or chassis (e.g., using subsystem modules that are pluggable into a distributed interconnect backplane), configuration of a cluster of systems in a box to box manner (e.g., internally or externally clustered systems), configuration of data system components using distributively interconnected data center components, etc. Possible system configurations include, but are not limited to, data center system configurations or other content points of presence (“POPs”) suitable for providing delivery traffic management policies and/or for implementing SLA policies to multiple components of a data center concurrently (e.g., switch, storage, application server, router, etc.), and to any selected point/s therebetween. Examples of such content POPs include, but are not limited to, telephone central offices, cable head-ends, wireless head-ends, etc. Thus a system such as shown in FIGS. 1A or 2 may be configured with an optimization of the allocation of resources between processor engines, the types and quantity of processor modules per engine, etc. [0281] As further shown in FIG. 8, system configuration may be defined or modified in step 1220 based at least partly on service monitoring information obtained in step 1250. For example, an existing system configuration may be modified at least partly on service monitoring information obtained for that same system while in actual operation. A new system may be configured based on service monitoring information obtained for one or more existing system/s while in actual operation (e.g., for existing systems similar to the new system and/or for systems operating under network conditions similar to the anticipated network conditions for the new system). Service monitoring step 1250 is described in further detail below, and includes, but is not limited to, historical tracking of system performance parameters such as resource availability and/or usage, adherence to provisioned SLA policies, content usage patterns, time of day access patterns, etc. In this regard step 1220 may include, but is not limited to, capacity planning and/or solution engineering based on historically monitored system throughput, service level adherence, maximum number of concurrent subscribers, etc. [0282] It will be understood that a system configuration definition may be based on any desired combination of business objective information and service monitoring information. In this regard, one or more individual monitored performance parameters (e.g., resource availability and/or usage, adherence to provisioned SLA policies, content usage patterns, time of day access patterns, or other parameters anticipated to be similar for the new system) may be combined with one or more individual business objectives (e.g., objectives reflecting performance parameters expected to differ for the new system, new service differentiation objectives, new service level agreement objectives, new service metering objectives, new service monitoring objectives, new service reporting objectives new information processing management objectives, and/or new service class information, etc.). Further, it will be understood that such service monitoring information and/or business objective information may be varied and/or combined in many ways, for example, to “trial and error” model different implementation scenarios, e.g., for the optimization of the final configuration. [0283] Turning temporarily from FIG. 8 to FIGS. 9A-9D, illustrated are exemplary embodiments of information management configurations of the many different configurations that are possible using the disclosed systems and methods. These exemplary embodiments serve to illustrated just a few of the many configurations in which the disclosed systems and methods may be employed to provide deterministic information management and/or delivery of differentiated services, such as differentiated information services or differentiated business services. In addition to the illustrated embodiments, It will be understood that the disclosed methods and systems described herein (e.g., including the embodiments of FIGS. 9A-9D) may be employed in a variety of network and/or information management environments including, but not limited to, in edge network environments, direct broadcast network environments, etc. For example, the disclosed methods and systems may be implemented in endpoint, intermediate and/or edge node devices that are interconnected to or form a part of an edge network, as well as in one or more nodes within an edge node backbone. In this regard, an edge network may be wired, wireless, satellite-based, etc. [0284] As an example, FIG. 9A illustrates multiple users 1410 that are connected to a network 1400, which may be a LAN or a WAN such as the Internet. An endpoint information management node 1440 (e.g., network endpoint content delivery system) is shown connected to network 1400 via intermediate nodes 1430 that may be, for example, routers, load balancers, web switches, etc. Optional content source 1450 is also shown connected to endpoint information management node 1440. In the embodiment of FIG. 9A, differentiated information services and/or differentiated business services may be delivered to one or more of users 1410 from an origin serving point (e.g., endpoint information management node 1440), for example, when system 1440 is configured as a deterministic system such as that described in relation to FIGS. 1A and 2. In such an embodiment, endpoint information management node controls the information source and may be configured to be capable of handling incoming packets and/or outgoing traffic generated by the incoming packets in a differentiated manner based on parameters or classifications associated with the packets. Such an endpoint information management node may also be capable of marking or tagging outgoing packets with classification information for use by other intermediate or core network nodes. [0285] In an alternate embodiment of FIG. 9A, nodes 1430, 1440 and 1450 of FIG. 9A may be components of an information management data center 1420 or other system capable of performing one or more of the indicated functions in a deterministic manner, for example, as described in relation to FIG. 6. In such a case, differentiated information services and/or differentiated business services may be provided through the data center and delivered to the network core with no other intermediate equipment. Both of the described embodiments of FIG. 9A (i.e., endpoint information management node 1440 or information management data center node 1420) may be configured to manage information (e.g., control system behavior, and serve and deliver content) in a differentiated fashion. Thus, as FIG. 9A indicates, the disclosed systems and methods may be implemented, for example, to provide differentiated service in a content delivery system/server role, or in a device that converges from the content source (e.g., storage disk) to the network. [0286]FIG. 9B illustrates multiple users 1610 that are connected to a network 1602, which may be a LAN or a WAN such as the Internet. Also shown is an intermediate traffic management node 1620 that is present between a conventional data center/content server 1630 and the core of network 1602, and which may be configured to have one more distributive and/or deterministic features of an information management system as described elsewhere herein (e.g., network interface processing engine, etc.). In this embodiment, traffic management node 1620 does not control the information source (e.g., content source) but may be configured as a “gate keeper” to perform such session-aware differentiated service functions or tasks as session-aware service level management, session-aware classification and logging of traffic between the network core and conventional data center/content server 1630. Specific examples of differentiated service functions or tasks that may be performed by such a traffic management node include, but are not limited to, redirection decisions, packet classification, tracking and billing functions relative to traffic flow through traffic management node 1620, policy-equipped router, policy-based switch, etc. Although not shown, it will be understood that other optional intermediate nodes (e.g., edge routers, etc.) may be present between traffic management node 1620 and network 1602 if so desired, that traffic management node 1620 may be subsystem component of a router, etc. [0287]FIG. 9C illustrates multiple edge information management nodes 1520 that are connected to a network 1502, which may be a LAN or a WAN such as the Internet. Also shown are multiple users 1510 that may be connected to network 1502 in a manner similar to that shown in FIGS. 9A and 9B. Edge information management nodes 1520 may be of any system configuration suitable for performing information management functions/tasks, for example, as described elsewhere herein. Specific examples of types of edge information management nodes that are possible include, but are not limited to, edge content delivery nodes, edge application processing nodes, content delivery and/or application processing nodes associated with an edge network, edge content cache and/or replication nodes, etc. As shown, an edge information management node may be configured to interface with network 1502 to receive and fulfill requests for information management, such as content delivery or application processing. In this regard, an edge content delivery node may be configured to have a content source, as well as other processing engines, such as those described in relation to FIGS. 1A and 2, and/or may be configured to perform differentiated service functions or tasks as described elsewhere herein. [0288] In FIG. 9C, multiple edge information management nodes 1520 are shown interconnected with an intelligent signal path or network IPC 1530 that links nodes 1520 in a clustered configuration, for example, in a manner to achieve the benefits and functionalities of clustered configurations described elsewhere herein. In this regard, signal path 1530 represents any communication device or method that is suitable for linking multiple nodes 1520 including, but not limited to, wired connection path, wireless communication path, virtual connection path across network 1502, standards-based signaling techniques, proprietary signaling techniques, combinations thereof, etc. Signal path 1530 may be present as shown to enable deterministic and intelligent communication between the clustered nodes 1520 of FIG. 9C, thus enabling differentiated information services and differentiated business services to be delivered from edge endpoint to the core of network 1502 without the need for intermediate nodes such as routers, load balancers, servers, etc. [0289] It will be understood that two or more nodes 1520 may be physically remote components located in a common facility, such as phone or communication system office with access to various forms of communication, e.g., DSL, wireless, etc. Alternatively, or in addition to physically remote nodes located in a common facility, one or more of nodes 1520 may be physically remote from one or more other nodes located, in separate facilities of the same building, facilities in different buildings within the same campus, etc. Nodes that are physically remote from each other may also include nodes in locations that are geographically remote from each other (e.g., facilities in different buildings within the same city, facilities in different cities, facilities in different states, facilities in different countries, ground and space satellite facilities, etc.) In any case, it is possible that two or more nodes 1520 may be interconnected as part of an edge network configuration. [0290] In one example, the information management embodiment of FIG. 9C may function in a manner that enables a given user 1510 to be served from the particular information management node 1520 that corresponds, for example, to a node containing the specific information requested by the user, a node assigned to particular SLA policies associated with the user or the user's request (e.g., allowing particular nodes 1520 to maintain excess resources for immediately and quickly serving requests associated with high cost/high quality SLA policies), and other nodes 1520 having oversubscribed resources that must be allocated/queued for more slowly serving requests associated with lower cost/lower quality SLA policies, etc. [0291] Also possible are configurations of separate processing engines, such as those of FIG. 1A or 2, that are distributively interconnected across a network, such as a LAN or WAN (e.g., using the disclosed distributed and deterministic system BIOS and/or operating system) to create a virtual distributed interconnect backplane between individual subsystem components across the network that may, for example, be configured to operate together in a deterministic manner as described elsewhere herein. This may be achieved, for example, using embodiments of the disclosed systems and methods in combination with technologies such as wavelength division multiplexing (“WDM”) or dense wavelength division multiplexing (“DWDM”) and optical interconnect technology (e.g., in conjunction with optic/optic interface-based systems), INFINIBAND, LIGHTNING I/O or other technologies. In such an embodiment, one or more processing functionalities may be physically remote from one or more other processing functionalities (e.g., located in separate chassis, located in separate buildings, located in separate cities/countries etc.). Advantageously such a configuration may be used, for example, to allow separate processing engines to be physically remote from each other and/or to be operated by two or more entities (e.g., two or more different service providers) that are different or external in relation to each other. In an alternate embodiment however, processing functionalities may be located in a common local facility if so desired. [0292]FIG. 9D illustrates one possible embodiment of deterministic information management system 1302 having separate processing engines 1310, 1320 and 1330 distributively interconnected across network 1340 that is equipped with fiber channel-based DWDM communication equipment and flow paths 1350 in combination with optic/optic interfaces. In this embodiment, functions or tasks of a system management processing engine may be performed by host processing functionality 1330 located in city A and may include, for example, billing, metering, service level management (SLM) and CDM functions or tasks. Functions or tasks of a storage management processing engine may be performed by storage service provider (SSP)/storage farm functionality 1310 located in city B, functions or tasks of an application processing engine may be performed by application service provider (ASP)/compute farm functionality 1320 located in city C, etc. For example, a request for content may be received from a user 1360 by host processing functionality 1330. Host processing functionality 1330 may then process the request and any SLA-related information associated with the request, and then notify the appropriate storage service provider functionality 1310 to deliver the requested content directly to user 1360. In a similar manner, asymmetric, deterministic and/or direct path information management flow may advantageously occur between any two or more processing engines that may be present on a network and interconnected via a virtual distributed interconnect backplane. [0293] Advantages offered by the network-distributed processing engines of the embodiment of FIG. 9D include the ability of a service provider to focus on one or more particular aspects of service delivery/utility (e.g., content storage, application processing, billing/metering, etc.) without having to worry about other infrastructure components that are maintained by other service providers. Thus, shared resources (e.g., storage capacity, processing capacity, etc.) may be purchased and virtually exchanged (e.g., with usage tracking of same) between service providers on an as-needed basis, thus allowing real time maximization of resource utilization and efficiency, as well as facilitating real time allocation of resources based on relative value to the network community. Advantageously then, a service provider need only consume an amount of a given resource as needed at any given time, and without having to maintain and waste excess resources that would otherwise be required to ensure adequate performance during periods of peak resource demand. Further, a given provider is enabled to sell or exchange any excess resources maintained by the provider during periods of lower demand, if the characteristics of the provider's business change, etc. [0294] It will be understood that the individual components, layout and configuration of FIG. 9D is exemplary only, and that a variety of different combinations and other system configurations are possible. Thus, any number and/or type of system components suitable for performing one or more types of processing engine functions or tasks, may be provided in communication across a network using any connection/interface technology suitable for providing distributed interconnection therebetween, e.g., to allow deterministic information management and/or differentiated services to be provided as described elsewhere herein. [0295] In one embodiment a virtual distributively interconnected system may be configured to allow, for example, system management functions (e.g., such as billing, data mining, resource monitoring, queue prioritization, admission control, resource allocation, SLA compliance, etc.) or other client/server-focused applications to be performed at one or more locations physically remote from storage management functions, application processing functions, single system or multi network management subsystems, etc. This capability may be particularly advantageous, for example, when it is desired to deterministically and/or differentially manage information delivery from a location in a city or country different from that where one or more of the other system processing engines reside. Alternatively or in addition, this capability also makes possible existence of specialized facilities or locations for handling an individual processing engine resource or functionality, or subset of processing engine resources or functionalities, for example, allowing distributed interconnection between two or more individual processing engines operated by different companies or organizations that specialize in such commodity resources or functionalities (e.g., specialized billing company, specialized data mining company, specialized storage company, etc.). [0296] It will be understood that in the delivery of differentiated services using the disclosed systems and methods, including those illustrated in FIGS. 9A-9D, any packet classification technology (e.g., WAN packet classification technology) that is suitable for classifying or differentiating packets of data may be employed to enable such delivery of differentiated services. Such technologies may be employed to allow the disclosed systems and methods to read incoming packet markings/labels representative of one or more policy-indicative parameters associated with information management policy (e.g., class identification parameters, etc.), to allow the disclosed systems and methods to mark or tag outgoing packets with markings/labels representative of one or more policy-indicative parameters associated with information management policy, or a combination thereof. With regard to packet classification technologies, the disclosed differentiated service functionalities may be implemented using principals that are compatible with, or that apply to, any suitable types of layer two through layer seven packet classification technologies including, but not limited to, Ethernet 802.1 P/Q, Diffserv, IPv6, MPLS, Integrated Services (RSVP, etc.), ATM QoS, etc. In one embodiment, the disclosed systems and methods may be advantageously enabled to perform such packet classification functionalities by virtue of the presence and functionality of a network interface processing engine as is described in relation to FIGS. 1A and 2 herein. [0297] Thus, the disclosed systems and methods may be implemented to not only provide new and unique differentiated service functionalities across any given one or more separate network nodes (e.g., in one or more nodes positioned outside a network core), but may also be implemented in a manner that interfaces with, or that is compatible with existing packet classification technologies when applied to information traffic that enters a network core. However, it will be understood that the disclosed systems and methods may be advantageously implemented to deliver session-aware differentiated service in information management environments that is not possible with existing packet classification technologies and existing devices that employ the same (e.g., that function at the individual packet level, or at the individual packet vs. individual packet level). [0298] It is possible to employ packet classification technologies in a variety of different ways to perform the desired differentiated service functions or tasks for a given implementation, including each of the embodiments illustrated in FIGS. 9A-9D. For example, an endpoint information management system 1440 of FIG. 9A may search incoming packets for tags or markings representative of one or more parameters and handle each such packet according to a policy associated with the parameter/s. In this regard, each incoming packet may be differentially handled, for example, in a deterministic manner as previously described. [0299] Similarly, outgoing packets may be classified by the endpoint information management system 1440 by marking the outgoing packets with labels or tags that are related, for example, to service and/or application information or other parameters associated with the packet, and that indicate how the packet should be handled by one or more other components of the edge and/or core of network 1400. An endpoint information management system 1440 may then deliver the labeled packets to the intermediate nodes 1430 and core of network 1400, where the packet labels may be read by other nodes, such as routers, and routed/treated in a manner dictated by the individual labels or markings associated with each packet (e.g., queue position dictated by MPLS tag, Diffserv tag, IPv6 tag, etc.). Advantageously, when endpoint information management system 1440 is configured to be application-aware (e.g., as described in relation to the systems of FIGS. 1A and 2), packet classification may advantageously be made in way that is application-aware. A similar packet classification methodology may be employed in data center embodiments, such as data center 1420 of FIG. 9A. In such embodiments, classified outgoing packets may be delivered directly to core components of network 1400. It will also be understood, however, that the disclosed systems and methods may be practiced in which one or more conventional types of packet classification functions are performed by external intermediate nodes (e.g., conventional intermediate edge routing nodes), rather than the above-described packet classification functions of the disclosed information management systems, or a combination of the two may be employed. [0300] Similar packet classification methodology may be employed for incoming and/or outgoing packets by edge information management nodes 1520 of FIG. 9C, or by any other information management system of the disclosed systems and methods. It will be understood with benefit of this disclosure that classification methodology may be selected to fit the needs or characteristics of a particular network configuration. For example, outgoing packet classification as described above may be particularly desirable in the case of a network having limited core resources. On the other hand, outgoing packet classification may not be as desirable in the case of network having substantially unlimited core resources. [0301] Returning now to FIG. 8, once objectives and system configuration have been defined in steps 1210 and 1220, an information management system may be assembled/manufactured according to the system configuration, purchased and installed as shown in step 1230 of FIG. 8. As previously described, a system may be installed in an HSP facility to provide differentiated business services for one or more tenants. [0302] After an information system has been purchased and installed in step 1230, provisioning of system service parameters may be made in step 1240. Examples of such parameters include, but are not limited to, aggregate bandwidth ceiling, internal and/or external service level agreement (“SLA”) policies (e.g., policies for treatment of particular information requests based on individual request and/or individual subscriber, class of request and/or class of subscriber, including or based on QoS, CoS and/or other class/service identification parameters associated therewith, etc.), admission control policy, information metering policy, classes per tenant, system resource allocation (e.g., bandwidth, processing and/or storage resource allocation per tenant and/or class for a number of tenants and/or number of classes, etc.), etc. [0303] Any parameter or combination of parameters suitable for partitioning system capacity, system use, system access, etc. in the creation and implementation of SLA policies may be considered. In this regard, the decision of which parameter(s) is/are most appropriate depends upon the business model selected by the host utilizing the system or platform, as well as the type of information manipulation function/s or applications (e.g., streaming data delivery, HTTP serving, serving small video clips, web caching, database engines, application serving, etc.) that are contemplated for the system. [0304] Examples of capacity parameters that may be employed in streaming data delivery scenarios include, but are not limited to delivered bandwidth, number of simultaneous N kbit streams, etc. Although delivered Mbit/s is also a possible parameter upon which to provision and bill non-streaming data applications, an alternate parameter for such applications may be to guarantee a number (N) of simultaneous connections, a number (N) of HTTP pages per second, a number (N) of simultaneous video clips, etc. In yet another example, an network attached storage (“NAS”) solution may be ported to an information management system platform. In such a case, files may be delivered by NFS or CIFS, with SLA policies supplied either in terms of delivered bandwidth or file operations per second. It will be understood that the forgoing examples are exemplary and provided to illustrate the wide variety of applications, parameters and combinations thereof under with which the disclosed systems and methods may be advantageously employed. [0305] Referring to FIG. 8 in more detail, a description of exemplary system service parameters that may be defined and provisioned in step 1240 follows. System bandwidth ceiling may be provisioned at step 1240, and may represent a desired bandwidth ceiling defined by a Tenant or HSP that is below the actual system bandwidth ceiling capability. For example, a system may be capable of supporting a maximum bandwidth of from 335 Mbps (20 Kbps×16,800 connections) to 800 Mbps (1 Mbps×800 connections), but the Tenant or HSP may elect to place a bandwidth ceiling underneath these maximums. [0306] SLA policies that may be created at step 1240 may be based on any parameter or combination of parameters suitable, for example, for the creation of a useful business model for ISP/enterprise. Examples of SLA policies include, but are not limited to, class/service identification parameters such as CoS, QoS, combinations thereof, etc. A combination or sum of CoS and QoS may be used to define an SLA per class or flow (subscriber) within a system. Thus, in one embodiment, policy options may be stored in the system, and acted upon relative to state information within the system architecture, such as information on resource availability and/or capability. Examples of other SLA policies that may that may be created in step 1240 include, but are not limited to, protocols for receipt, adherence and acknowledgment of requests for information such as content. For example, a content delivery system may be configured to receive an SLA request from another network element (e.g., including, for example, CoS and QoS requirements), and to respond back to the external entity with available service alternatives based on the available system resources and the SLA requirements of the request. The system may then be configured to receive explicit selection of alternative from the external entity, and to take action on the connection request based thereon. [0307] SLA policies may be internally maintained (e.g., database policy maintained within an information management system), may be externally maintained (e.g., maintained on external network-connected user policy server, content policy server, etc.), or may be a combination thereof. Where external SLA information is employed or accessed by one or more processing engines of an information management system, suitable protocols may be provided to allow communication and information transfer between the system and external components that maintain the SLA information. [0308] SLA policies may be defined and provisioned in a variety of ways, and may be based on CoS and QoS parameters that may be observed under a variety of congestion states. For example, both single class-based and multiple class-based SLAs (e.g., three SLAs per class, etc.) are possible. Alternatively, an SLA may be defined and provisioned on a per-subscriber or per-connection basis. Furthermore, SLA policy definition and adherence management may be applied to subscribers or content, for example, in a manner that enables a content owner to force a particular SLA policy to all sessions/flows requesting access to a particular piece of content or other information. [0309] SLA policies may also be implemented to distinguish different CoS's based on a variety of different basis besides based on content (e.g., content-aware service level agreements). For example, in the case of platform serving applications, the CoS may be based upon application. For a platform serving HTTP as multiple hosts, the CoS may be based upon host. NAS applications may also be based easily on content, or upon host (volume) in the case of one platform serving many volumes. Other CoS basis may include any other characteristic or combination of characteristics suitable for association with CoS, e.g., time of day of request, etc. [0310] Further, it is also possible to direct a system or platform to create classes based on subscriber. For example, a system login may be required, and a user directed to a given URL reflective of the class to which the user belongs (e.g., gold, silver, bronze, etc.). In such an implementation, the login process may be used to determine which class to which the user belongs, and the user then directed to a different URL based thereon. It is possible that the different URL's may all in fact link ultimately to the same content, with the information management system configured to support mapping the different URL's to different service levels. [0311] In yet other examples, more simplistic CoS schemes may be employed, for example, defining CoSs through the use of access control lists based on IP address (e.g. ISP service log-ins, client side metadata information such as cookies, etc.),. This may be done manually, or may be done using an automated tool. Alternatively, a service class may be created based on other factors such as domain name, the presence of cookies, etc. Further, policies may be created that map priority of incoming requests based on TOS bits to a class of service for the outbound response. Similarly, other networking methods may be used as a basis for CoS distinction, including MPLS, VLAN's, 802.1P/Q, etc. Thus, it will be understood that the forgoing examples are exemplary only, and that SLAs may be implemented by defining CoSs based on a wide variety of different parameters and combinations thereof, including parameters that are content-based, user-based, application-based, request-based, etc. [0312] In one exemplary embodiment, a number n of single Tenant per system classes of service (COS) may be defined and provisioned at step 1240 (e.g., where n=from about 1 to about 32). In this regard, a single CoS may be considered an aggregate amount of bandwidth to be allocated to a number of connections when congestion dictates that bandwidth and system resource allocation decisions must be made. For example, a single CoS may be an aggregate bandwidth allocated to a number of connections m, e.g., where m=from about 1 to about 16,800. QoS may be considered a packet loss/latency provision that may, for example, be assigned or provisioned on a per subscriber or per CoS basis, either alone or in combination with other QoS policies, as will be described in more detail below. For content delivery embodiments, characteristics of QoS policy may also be selected based on type of content (e.g., minimum loss/latency policy for non-continuous content delivery, zero loss/latency policy for continuous content delivery, etc.). [0313] Policies such as per flow even egress bandwidth consumption (traffic shaping) may be defined and provisioned in step 1240, for example, for each CoS according to one or more possible network class types: Three specific examples of such possible class types are as follows. 1) Sustained rate (bps) provisioned to be equal to peak rate, i.e., so that available bandwidth is not oversubscribed within the CoS so that packets do not see any buffer delay. This may be described as being analogous to a continuous bit rate (“CBR”) connection. 2) Sustained rate (bps) allocated below its peak rate and oversubscribed within the CoS, i.e., bandwidth is allocated statistically. This may be described as being analogous to a variable bit rate (“VBR”) connection. In such a VBR embodiment, over-subscription may be controlled through the review of sustained and peak rate provisioning for individual connections, as well as the system aggregate of sustained and peak rate within the class. 3) No provisioned sustained or peak bandwidth per connection where class aggregate bandwidth is the only parameter provisioned and controlled, i.e., any number of connections, up to the maximum number set for a given class, are allowed to connect but must share the aggregate bandwidth without sustained or peak protection from other connections within the same class. This may be described as being analogous to a “best effort” class connection. It will be understood that the possible class types described above are exemplary only, and that other class types, as well as combinations of two or more class types may be defined and provisioned as desired. [0314] In another exemplary embodiment, bandwidth allocation, e.g., maximum and/or minimum bandwidth per CoS, may be defined and provisioned in step 1240. In this regard, maximum bandwidth per CoS may be described as an aggregate policy defined per CoS for class behavior control in the event of overall system bandwidth congestion. Such a parameter may be employed to provide a control mechanism for connection admission control (“CAC”), and may be used in the implementation of a policy that enables CBR-type classes to always remain protected, regardless of over-subscription by VBR-type and/or best effort-type classes. For example, a maximum bandwidth ceiling per CoS may be defined and provisioned to have a value ranging from about 0 Mbps up to about 800 Mbps in increments of about 25 Mbps. In such an embodiment, VBR-type classes may also be protected if desired, permitting them to dip into bandwidth allocated for best effort-type classes, either freely or to a defined limit. [0315] Minimum bandwidth per CoS may be described as an aggregate policy per CoS for class behavior control in the event of overall system bandwidth congestion. Such a parameter may also be employed to provide a control mechanism for CAC decisions, and may be used in the implementation of a policy that enables CBR-type and/or VBR-type classes to borrow bandwidth from a best effort-type class down to a floor value. For example, a floor or minimum bandwidth value for a VBR-type or for a best effort-type class may be defined and provisioned to have a value ranging from about 0 Mbps up to 800 Mbps in increments of about 25 Mbps. [0316] It will be understood that the above-described embodiments of maximum and minimum bandwidth per CoS are exemplary only, and that values, definition and/or implementation of such parameters may vary, for example, according to needs of an individual system or application, as well as according to identity of actual per flow egress bandwidth CoS parameters employed in a given system configuration. For example an adjustable bandwidth capacity policy may be implemented allowing VBR-type classes to dip into bandwidth allocated for best effort-type classes either freely or to a defined limit. Other examples of bandwidth allocation-based CoS policies that may be implemented may be found in Examples 1-3 disclosed herein. [0317] As previously mentioned, a single QoS or combination of QoS policies may be defined and provisioned on a per CoS, or on a per subscriber basis. For example, when a single QoS policy is provisioned per CoS, end subscribers who “pay” for, or who are otherwise assigned to a particular CoS are treated equally within that class when the system is in a congested state, and are only differentiated within the class by their particular sustained/peak subscription. When multiple QoS policies are provisioned per CoS, end subscribers who “pay” for, or who are otherwise assigned to a certain class are differentiated according to their particular sustained/peak subscription and according to their assigned QoS. When a unique QoS policy is defined and provisioned per subscriber, additional service differentiation flexibility may be achieved. In one exemplary embodiment, QoS policies may be applicable for CBR-type and/or VBR-type classes whether provisioned and defined on a per CoS or on a per QoS basis. It will be understood that the embodiments described herein are exemplary only and that CoS and/or QoS policies as described herein may be defined and provisioned in both single tenant per system and multi-tenant per system environments. [0318] Further possible at step 1240 is the definition and provisioning of CAC policies per CoS, thus enabling a tenant or HSP to define policies for marginal connection requests during periods of system congestion. In this regard, possible policy alternatives include acceptance or rejection of a connection within a particular requested class. For example, a particular request may be accepted within a class up to a sustained bandwidth ceiling limitation for that class. As previously described, sustained bandwidth allocation may be equal to peak bandwidth allocated for a CBR-type class. For a VBR-type class, sustained bandwidth allocation may be less than allocated peak bandwidth and may be defined as a percentage of total bandwidth allocated. In the event the sustained bandwidth limitation has been exceeded, one or more different CAC policies may be implemented. For example, a connection may be rejected altogether, or may be rejected only within the requested class, but offered a lower class of service. Alternatively, such a connection may be accepted and other active connections allowed to service degrade (e.g., unspecified bit rate “UBR”, etc.). As described elsewhere herein, resource state information (e.g., resource availability, capability, etc.) may be considered in the decision whether to accept or reject particular requests for information, such as particular subscriber requests for content. Resources may also be re-allocated or exchanged as desired to support particular requests, e.g., borrowed from lower class to support higher class request, stolen from lower class to support higher class request, etc. Alternatively, requests may be redirected to alternative systems or nodes. [0319] Summarizing with respect to step 1240, priority-indicative class/service identification parameters may be assigned to indicate the priority of service that a client on an external network is to receive, and a system may be provided with policies in step 1240 to prioritize and manage incoming and/or outgoing data and communication traffic flow through the system based on the characteristics of the class/service identification parameters associated therewith. Examples of such policies include, but are not limited to, policies capable of directing priority of system information retrieval from storage to satisfy a particular request having a class/service identification parameter relative to other pending requests for information, policies associating maximum time frame values for delivery of content based on class/service identification parameters associated with a particular request, and disposal of such a request based on the availability of system resources and the characteristics of the particular class/service identification parameters associated with the request. [0320] Further, admission control policies may be provisioned in step 1240 as previously described to consider, for example, the above-described class/service identification parameters, separate admission control policy priority parameters associated with particular information requests, current resource availability of the system, and/or may be implemented to consider one or more inherent characteristics associated with individual requests (e.g., type of information requested, resources required to satisfy a particular information request, identity of information requester, etc.). [0321] In one embodiment, an optional provisioning utility may be provided that may be employed to provide guidance as to the provisioning of a system for various forms of service level support. For example, a host may initially create SLA policies in step 1240 using the optional provisioning tool which identifies provisioning issues during the process. In such an implementation, the provisioning tool may be provided to inform the host if policies have been selected that conflict, that exceed the capacity of the system platform as currently configured, etc. For example, a host may be defining policies based on bandwidth allocation, but fail to recognize that the system storage elements lack the capacity to handle the guaranteed rates. The optional provisioning utility may inform the host of the conflict or other provisioning issue. Further, the utility may be configured to provide suggestions to resolve the issue. For example, under the above scenario the utility may suggest adding more mirrors, adding another FC loop, etc. In addition, a provisioning utility may be further configured to function in real time, for example, to assist and guide a host in making changes in service level provisioning after a system is placed in operation. Such real time provisioning may include optimization of SLA policies based on actual system performance and/or usage characteristics, changes to SLA policies as otherwise desired by user and/or host, etc. Specific examples include, but are not limited to, configuration of service quality per subscriber, class, tenant, box, etc.; decisions to allow over-provisioning; decisions to allow over-provisioning in combination with re-direction of new requests, etc. In yet a further embodiment, such a provisioning utility may be adapted to analyze and provide suggested changes to service level provisioning based on actual system performance. [0322] Step 1250 of FIG. 8 illustrates how system performance parameters related to information management, such as content delivery, may be differentially monitored. As indicated, monitoring may include both real time and historical tracking of system performance. System performance parameters that may be so monitored or tracked include, but are not limited to, resource availability and/or usage, adherence to provisioned SLA policies, content usage patterns, time of day access patterns, etc. As will be further described, such parameters may be monitored on the basis of the characteristics of a particular hardware/software system configuration, characteristics of an individual session, characteristics of a particular class, characteristics of a particular subscriber, characteristics of a particular tenant, subsystem or system performance, individual resource consumption, combinations thereof, etc. For example, service monitoring step 1250 may be performed on a system basis (e.g., single box/chassis configuration, data center configuration, distributed cluster configuration, etc.), performed on a per tenant basis (e.g., in the case of multiple tenants per system), performed on a per class basis (e.g., in the case of multiple classes per tenant), performed on a per subscriber basis (e.g., in the case of multiple subscribers per class), or a combination thereof. Thus, in one embodiment, service monitoring may be performed in a manner that considers each of the forgoing levels (i.e. service monitoring for a particular subscriber of particular class of a particular tenant of a particular system). [0323] Adherence to SLA policies may be monitored for an individual session or flow in real time and/or on a historical basis. In one exemplary embodiment, SLA adherence may be monitored or tracked by measuring packet throughput relative to sustained and peak rates per connection. For example, throughput statistics may be captured in specified time intervals (e.g., five-minute increments). In another example, behavior of a particular class relative to aggregate assigned sustained and peak bandwidth allocation may be monitored or tracked in real time, or may be monitored or tracked over a period of time (e.g., ranging from one hour to one day in one hour increments). In yet another example, behavior of an individual subsystem or an entire system relative to aggregate assigned sustained and peak bandwidth allocation may be monitored or tracked in real time, or may be monitored or tracked over a period of time (e.g., ranging from one hour to one day in one hour increments). [0324] It will be understood that the forgoing examples of adherence monitoring are exemplary only, and that a variety of other parameters and combinations of parameters may be monitored or tracked in step 1250 of FIG. 8. Furthermore, it will be understood that monitored parameters may be displayed or otherwise communicated or recorded in any suitable manner. For example, current bandwidth consumption may be monitored in real time and presented, for example, via graphical user interface (“GUI”), data file, external report, or any other suitable means. [0325] Also illustrated in FIG. 8 is information processing management step 1260, which may include managing disposition and/or prioritization of information manipulation tasks, such as any those of those information manipulation tasks described elsewhere herein. In this regard, information processing management step 1260 may involve system, inter-system and/or subsystem management of tasks including, but not limited to, admission control, resource allocation, queue prioritization, request transfer, etc. Furthermore, information manipulation tasks may be managed based on class/service identification parameters associated with particular information and/or requests for the same including, but not limited to, SLA policies or CoS/QoS parameters that may be defined and provisioned, for example, as described in relation to step 1240. As described elsewhere herein, such parameters may be defined and provisioned based on virtually any characteristic or combinations of characteristic associated with a particular information manipulation task including, but not limited to, identity or class of user or request, type of request, resource requirement associated with a particular request, etc. [0326] As illustrated in FIG. 8, information processing management step 1260 may optionally utilize performance monitoring information obtained in step 1250, for example, to help make real time information processing management decisions (e.g., based on subsystem, resource, and/or overall system behavior or usage), to adjust processing management behavior based on real time or historical monitored service levels (e.g., to bring service level into adherence with SLA policy), etc. [0327] In service reporting step 1270, a wide variety of performance and/or resource usage information may be collected and reported or otherwise communicated for the use of HSP, Tenants, Subscribers, etc. Such information may be utilized, for example, for purposes related to billing, demonstrating SLA policy adherence, system performance optimization, etc. and may be reported via GUI, data file, external report, or using any other suitable means (e.g., reports viewable through in-system WEB-based GUI or through external Report Writer/Viewer utility). Information that may be reported in step 1270 includes virtually any type of information related to operating or usage characteristics of an information management system, its subsystems and/or its resources, as well as information related to processing of individual requests or classes of requests, such as application and/or SLA performance. [0328] Reporting functions possible in step 1270 include, but are not limited to, generation of any type of billing report based at least in part on collected performance and/or resource usage information, from generation of intermediate level reports (e.g., flat file reports, etc.) that third party entities may use to convert to desired billing format, to generation of finalized billing reports that may be forwarded directly to customers. Also possible are third party agents or client devices configured to receive billing information from the disclosed systems and configured to convert the information into desired format for passing onto a billing server. Such a scheme is also possible in which the disclosed systems are configured to output the billing information in desired format for transmittal to a billing server, without the need for a third party client. [0329] In one example, service configuration information may be reported, and may include all configured attributes such as CoSs and their parameters, QoSs and their parameters, individual subscriber SLAs, system resource consumption, etc. System performance information may also be reported and may include, for example, periodic (e.g., hourly, daily, monthly, etc.) totals of system resource utilization metrics. Application or SLA performance data may also be reported and may include information related to SLA activity, such as packets transmitted, packets dropped, latency statistics, percentage of time at or below sustained level, percentage of time above sustained and at or below peak level, etc. In this regard, application or SLA performance data may also be reported on a periodic basis (e.g., hourly, daily, monthly totals, etc.). SLA performance data may also be reported, for example, as aggregate performance statistics for each QoS, CoS and system as whole. [0330] Types of billing information that may be reported in step 1270 includes, but is not limited to, any type of information related to consumption or use of one or more system resources. In this regard, billing information may be generated on any desired detail level, for example, anywhere from a per-subscriber, per-request or per transaction basis to a per-class or per-tenant basis. Billing information may also be generated based on any desired fee basis, e.g., fixed per use basis, relative resource consumption basis, percentage-service guarantee basis, time of day basis, SLA conformance basis, performance level basis, combinations thereof, etc. Advantageously, billing basis may be static and/or dynamic as described further herein. [0331] Examples of static resource consumption based billing include both application level billing information and system resource level billing information. Specific examples include, but are not limited to, static billing parameters such as fixed or set fees for processing cycles consumed per any one or more of subscriber/class/tenant/system, storage blocks retrieved per any one or more of subscriber/class/tenant/system, bandwidth consumed per any one or more of subscriber/class/tenant/system, combinations thereof, etc. Advantageously, resource consumption based billing is possible from any information source location (e.g., content delivery node location, application serving node location, etc.) using the disclosed systems and methods, be it a origin or edge storage node, origin or edge application serving node, edge caching or content replication node, etc. [0332] Examples of dynamic billing basis include, but are not limited to, SLA conformance basis billing such as standard rate applied for actual performance that meets SLA performance guarantee with reduced billing rate applied for failure to meet SLA performance guarantee, sliding scale schedule providing reductions in billing rate related or proportional to the difference between actual performance and SLA performance guarantee, sliding scale schedule providing reductions in billing rate related or proportional to the amount of time actual performance fails to meet SLA performance guarantee, combinations thereof, etc. Other examples of dynamic billing basis include performance level basis billing, such as sliding scale schedule providing multiple billing rate tiers that are implicated based on actual performance, e.g., higher rates applied for times of higher system performance and vice-versa. [0333] Furthermore, SLA performance information may be used as a billing basis or used to generate a fee adjustment factor for billing purposes. As is the case for other types of information, information necessary for generating billing information and billing information itself, may be reported on a periodic basis (e.g., hourly, daily, monthly totals, etc.) if so desired. [0334] In one embodiment, standard bandwidth information may be reported as billing data and may reflect, for example, allocated sustained and peak bandwidth per subscriber, percentage of time at or below sustained bandwidth level, percentage of time above sustained bandwidth level and at or below peak bandwidth level, etc. In another embodiment, content usage information may be tracked and reported including, but not limited to, information on identity and/or disposition of content requests. Specific examples of such information includes, for example, record of content requests honored/rejected, record of content requests by subscriber, content request start time and content request fulfillment finish time, etc. [0335] Among the many advantages offered by the differentiated service methodology of the embodiment illustrated in FIG. 8 is the capability of providing value-added and flexible SLA policies and “no penalty” service management capabilities that may make possible, among other things, competitive service differentiation and enhanced revenue generation. As used herein, “no penalty” is used to describe a capability (e.g., differentiated service infrastructure capability) that may be offered in conjunction with basic information management functions (e.g., content delivery, service delivery) with little or substantially no increase in required application/subsystem processing time relative to processing time required to perform the basic information management function alone. Just a few examples of specific flexible SLA policies that may be so provided include, but are not limited to, guaranteed system and/or subscriber capacity support, QoS assurance, CoS, adaptive CoS, etc. Examples of real time “no penalty” service management capabilities include, but are not limited to, configuration, capacity planning, system and application performance monitoring, billing, usage tracking, etc. [0336] In one embodiment, these advantageous characteristics are made possible by employing system-aware and/or subsystem-aware application program interfaces (“APIs”), so that state and load knowledge may be monitored on a system and/or subsystem basis and application decisions made with real time, intimate knowledge concerning system and/or subsystem resources, for example, in a deterministic manner as described elsewhere herein. In this regard, “no penalty” state and load management may be made possible by virtue of API communication that does not substantially consume throughput resources, and may be further enhanced by conveyance IPC communication protocol that supports prioritized I/O operations (i.e., so that higher priority traffic will be allowed to flow in times of congestion) and overcomes weaknesses of message-bus architectures. Furthermore, features such as application offloading, flow control, and rate adaptation are enhanced by the true multi-tasking capability of the distributively interconnected asymmetrical multi-processor architectures described elsewhere herein. Among other things, these extensible and flexible architectures make possible optimized application performance including allowing application-aware scalability and intelligent performance optimization. Other advantages that may be realized in particular implementations of systems with these architectures include, but are not limited to, reduced space and power requirements as compared to traditional equipment, intelligent application ports, fast and simple service activation, powerful service integration, etc. [0337] As previously described, differentiated business services, including those particular examples described herein, may be advantageously provided or delivered in one embodiment at or near an information source (e.g., at a content source or origin serving point or node, or at one or more nodes between a content source endpoint and a network core) using system embodiments described herein (e.g., FIGS. 1A or 2), or using any other suitable system architecture or configuration. In one embodiment, a network core may be the public Internet and an associated information source may be, for example, a capacity-constrained content source such as storage network, storage virtualization node, content server, content delivery data center, edge content delivery node, or similar node in communication with the network core. In this embodiment, differentiated business services may be provided to allocate resources and/or costs at the content source and/or at a point or node anywhere between the content source and the network core, even in those cases where the core and last mile of the network provide relatively inexpensive and unlimited bandwidth and other resources for content delivery. Thus, a method of differentiating business services outside of a network core, and/or at a location upstream of the core is advantageously provided herein. The ability to differentiate business services under such circumstances provides a method for allocating resources and enhancing revenue generation that is not available using conventional network systems and methods. [0338] Although the delivery of differentiated business services may be described herein in relation to exemplary content delivery source embodiments, the practice of the disclosed methods and systems is not limited to content delivery sources, but may include any other type of suitable information sources, information management systems/nodes, or combinations thereof, for example, such as application processing sources or systems. For example, the description of content delivery price models and content delivery quality models is exemplary only, and it will be understood that the same principals may be employed in other information management embodiments (e.g., application processing, etc.) as information management price models, information management quality models, and combinations thereof. Further, the disclosed systems and method may be practiced with information sources that include, for example, one or more network-distributed processing engines in an embodiment such as that illustrated in FIG. 9D, for example. Such network-distributed information sources may also be described as being outside the network core. [0339] In one differentiated content delivery embodiment, the disclosed differentiated business services may be implemented to provide differentiated services at a content source based on one or more priority-indicative parameters associated with an individual subscriber, class of subscribers, individual request or class of request for content, etc. Such parameters include those types of parameters described elsewhere herein (e.g., SLA policy, CoS, QoS, etc.), and may be user-selected, system-assigned, pre-determined by user or system, dynamically assigned or re-assigned based on system/network load, etc. Further, such parameters may be selected or assigned on a real time basis, for example, based on factors such as subscriber and/or host input, network and/or system characteristics and utilization, combinations thereof, etc. For example, a content subscriber may be associated with a particular SLA policy or CoS for all content requests (e.g., gold, silver, bronze, etc.) in a manner as previously described, or may be allowed to make real time selection of desired SLA policy or CoS on a per-content request basis as described further herein. It will be understood that the forgoing description is exemplary only and that priority indicative parameters may be associated with content delivery or other information management/manipulation tasks in a variety of other ways. [0340] In one exemplary implementation of user-selected differentiated content delivery, a user may be given the option of selecting content delivery (e.g., a theatrical movie) via one of several pre-defined quality models, price/payment models, or combination thereof. In such an example, a high quality model (e.g., gold) may represent delivery of the movie to the subscriber with sufficient stream rate and QoS to support a high quality and uninterrupted high definition television (“HDTV”) presentation without commercials or ad insertion, and may be provided to the subscriber using a highest price payment model. A medium quality model (e.g., silver) may be provided using a medium price payment model and may represent delivery of the movie to the subscriber with a lower stream rate and QoS, but without commercials or ad insertion. A lowest quality model (e.g., bronze) may be provided using a lowest price payment model and may represent delivery of the movie to the subscriber with a lower stream rate and QoS, and with commercials or ad insertion. Quality/price models may so implemented in a multitude of ways as desired to meet needs of particular information management environments, e.g., business objectives, delivery configurations (e.g., movie download delivery rather than streaming delivery), etc. [0341] When user selectable quality/price models are offered, a subscriber may choose a particular quality model based on the price level and viewing experience that is desired, e.g., gold for a higher priced, high quality presentation of a first run movie, and bronze for a lower priced, lower quality presentation of a second run movie or obscure sporting event, e.g. such as will be played in the background while doing other things. Such a selection may be may be based on a pre-defined or beforehand choice for all content or for particular types or categories of content delivered to the subscriber, or the subscriber may be given the option of choosing between delivery quality models on a real time or per-request basis. In one example, a GUI menu may be provided that allows a subscriber to first select or enter a description of desired content, and that then presents a number of quality/payment model options available for the selected content. The subscriber may then select the desired options through the same GUI and proceed with delivery of content immediately or at the desired time/s. If desired, a subscriber may be given the opportunity to change or modify quality/price model selection after content delivery is initiated. Examples of categories of content that may be associated with different quality and/or price models include, but are not limited to, news shows, situation comedy shows, documentary films, first run movies, popular or “hot” first run movies, old movies, general sports events, popular or “hot” sports events, etc.). Delivery of content at the selected quality/price model may be tracked and billed, for example, using system and method embodiments described elsewhere herein. [0342] In another exemplary embodiment, multiple-tiered billing rates may be offered that are based on information management resource consumption that is controllable or dictated by the user. For example, a user may be offered a first billing rate tier linked to, for example, maximum amount of resource consumption for non-streaming or non-continuous content (e.g., maximum number of website hits/month, maximum number of HTTP files downloaded per month, maximum number of bytes of content streamed/month or downloaded/month from NAS, maximum amount of processing time consumed/month, etc.). In such an embodiment, resource consumption below or up to a defined maximum consumption rate may be delivered for a given flat fee, or may be delivered at a given cost per unit of resource consumption. One or more additional billing rate tiers (e.g., incremental flat fee, higher/lower cost per unit of resource consumption, etc.) may be triggered when the user's resource consumption exceeds the first tier maximum resource consumption level. It will be understood that such an embodiment may be implemented with a number of different billing rate tiers, and that more than two such billing rate tiers may be provided. [0343] In another exemplary embodiment for content delivery, content delivery options may be offered to subscribers that are customized or tailored based on network and/or system characteristics such as network infrastructure characteristics, system or subsystem resource availability, application mix and priority, combinations thereof, etc. For example, a subscriber's last mile network infrastructure may be first considered so that only those content delivery options are offered that are suitable for delivery over the particular subscriber's last mile network infrastructure (e.g., subscriber's local connection bandwidth, computer processor speed, bandwidth guarantee, etc.). Such infrastructure information may be ascertained or discovered in any manner suitable for gathering such information, for example, by querying the subscriber, querying the subscriber's equipment, querying metadata (e.g., cookies) contained on the subscriber's computer, xSP, policy server, etc. [0344] In one example, this concept may be applied to the user selectable quality/price model embodiment described above. In such a case, a subscriber with relatively slow dial-up or ISDN network access, and/or having a relatively slow computer processor, may only be given the option of a lowest quality model (e.g., bronze) due to restricted maximum stream rate. In another example, a subscriber may be provided with a plurality of content delivery options and recommendations or assessments of, for example, those particular content delivery options that are most likely to be delivered to the individual subscriber at high performance levels given the particular subscriber's infrastructure, and those that are not likely to perform well for the subscriber. In this case, the subscriber has the option of making an informed choice regarding content delivery option. The above approaches may be employed, for example, to increase the quality of a subscriber's viewing experience, and to reduce possible disappointment in the service level actually achieved. [0345] In another example, customized or tailored content delivery options may be offered to subscribers based on characteristics associated with a particular request for content. In such an implementation, payment model and/or quality model may be host-assigned, system-assigned, etc. based on characteristics such as popularity of the requested content, category/type of the requested content (e.g., first run movie, documentary film, sports event, etc.), time of day the request is received (e.g., peak or off-time), overall system resource utilization at the time of the requested content delivery, whether the request is for a future content delivery event (e.g., allowing pre-allocation of necessary content delivery resources) or is a request for immediate content delivery (e.g., requiring immediate allocation of content delivery resources), combinations thereof, etc. For example, “hot” content such as highly popular first run movies and highly popular national sporting events that are the subject of frequent requests and kept in cache memory may be assigned a relatively lower price payment model based on the cost of delivery from cache or edge content delivery node, whereas more less popular or obscure content that must be retrieved from a storage source such as disk storage may be assigned a higher price payment model to reflect higher costs associated with such retrieval. Alternatively, it may be desirable to assign payment models and/or quality models based on a supply and demand approach, i.e., assigning higher price payment models to more popular content selections, and lower price payment models to less popular content selections. Whatever the desired approach, assignment of payment models may advantageously be made in real time based on real time resource utilization, for example, using the differentiated service capabilities of the disclosed systems and methods. [0346] By offering customized or tailored content delivery options as described above, content may be made available and delivered on price and quality terms that reflect value on a per-request or per-content selection basis, reducing transaction costs and allowing, for example, content providers to recover costs required to maintain large libraries of content (e.g., a large number of theatrical movies) for video on demand or other content delivery operations. The disclosed methods thus provide the ability to match price with value and to recover content storage/delivery costs. This ability may be advantageously implemented, for example, to allow a large number of content selections to be profitably stored and made available to subscribers, including highly popular content selections as well as obscure or marginally popular content selections. [0347] Utilizing the systems and methods disclosed herein makes possible the delivery of differentiated service and/or deterministic system behavior across a wide variety of application types and system configurations. Application types with which the disclosed differentiated service may be implemented include I/O intensive applications such as content delivery applications, as well as non-content delivery applications. [0348] Advantageously, the disclosed systems and methods may be configured in one embodiment to implement an information utility service management infrastructure that may be controlled by an information utility provider that provides network resources (e.g., bandwidth, processing, storage, etc.). Such an information utility provider may use the capabilities of the disclosed systems and methods to maintain and optimize delivery of such network resources to a variety of entities, and in a manner that is compatible with a variety of applications and network users. Thus, network resources may be made available to both service providers and subscribers in a manner similar to other resources such as electricity or water, by an information utility provider that specializes in maintaining the network infrastructure and its shared resources only, without the need to worry or to become involved with, for example, application-level delivery details. Instead, such application-level details may be handled by customers of the utility (e.g., application programmers, application developers, service providers, etc.) who specialize in the delivery and optimization of application services, content, etc. without the need to worry or to become involved with network infrastructure and network resource details, which are the responsibility of the utility provider. [0349] The utility provider service management characteristics of the above-described embodiment is made possible by the differentiated service capabilities of the disclosed systems and methods that advantageously allow differentiated service functions or tasks associated with the operation of such a utility (e.g., provisioning, prioritization, monitoring, metering, billing, etc.) to be implemented at virtually all points in a network and in a low cost manner with the consumption of relatively little or substantially no extra processing time. Thus, optimization of network infrastructure as well as applications that employ that infrastructure is greatly facilitated by allowing different entities (e.g., infrastructure utility providers and application providers) to focus on their individual respective specialties. [0350] In one exemplary content delivery embodiment, such a utility provider service management infrastructure may be made possible by implementing appropriate content delivery management business objectives using an information management system capable of delivering the disclosed differentiated information services and that may be configured and provisioned as disclosed herein, for example, to have a deterministic system architecture including a plurality of distributively interconnected processing engines that are assigned separate information manipulation tasks in an asymmetrical multi-processor configuration, and that may be deterministically enabled or controlled by a deterministic system BIOS and/or operating system. [0351] Uses of Distributed Interconnects [0352] As previously described, one or more distributed interconnects may be employed in information management environments to distribute functionality, for example, among processing engines of an information management system and/or processing modules thereof. Distributive interconnects such as switch fabrics and virtual distributed interconnect backplanes, may be employed to establish independent paths from node to node and thus may be used to facilitate parallel and independent operation of each processing engine of a multi-processing engine information management system, e.g., to provide peer-to-peer communication between the engines on an as-needed basis. Besides data, a distributed interconnect may also transfer command and control information between the various peers via the distributed interconnect, and may be implemented to allow communication from one peer to multiple peers through a broadcast or multicast communication which is provided from one peer to multiple peers coupled to the interconnect (e.g., broadcast to all peers coupled to the interconnect). These and other features of distributed interconnects may be advantageously employed to optimize information management systems operations in a variety of system configurations, such as is described in the exemplary embodiments which follow. It will be understood that any description or illustration herein of embodiments employing single distributed interconnects are exemplary only, and that multiple interconnected distributed interconnects may be alternatively employed therein. [0353] In one exemplary embodiment, a distributed interconnect may be employed to download or otherwise communicate an executable image from one or more image sources to one or more image receivers, such as one or more processing engines of an information management system. Examples of such executable images include, but are not limited to, initial images including one or more components such as boot code, operating system, management or application API's, applications, etc. One example of the interrelation of such components in an information management system environment is illustrated and described herein in relation to FIG. 7. The capability of communicating and downloading initial images to a processing engine or other type of image receiver across a distributed interconnect eliminates the need for providing each image receiver component of a multi-component system with separate storage (e.g., disk drive, additional FLASH memory, etc.) for storing its initial image. Instead, initial images for multiple image receivers may be accessible via a single image source or a relatively small number of image sources (e.g., stored and maintained for access by a single image source or by a relatively small number of image sources). Depending on system configuration, this capability may translate into one or more significant advantages such as fewer required system components, simplified system architecture and operation, increased ease of image update/revision, and cost savings. [0354]FIG. 10 shows an initial image source 2000 that may be, for example, a management processing (or host) engine 1060 as described elsewhere herein, or any other processing engine or other entity suitable for storing or otherwise accessing and communicating executable images to other processing engines or entities. Image source 2000 is shown distributively interconnected to image receiver 2020 via distributed interconnect 2010 that may be, for example, a switch fabric or other distributed interconnect 1080 as described elsewhere herein, and that may be coupled to a plurality of processing engines (not shown). Image receiver 2020 may be any processing engine or other entity that is capable of receiving and loading an executable image from image source 2000. Examples of processing engines that may be an image receiver 2020 include, but are not limited to, those processing engines of an information management system described elsewhere herein, such as application processing engine 1070, storage processing engine 1040, network processing engine 1030, transport processing engine 1050, combinations thereof, etc. [0355] Although not illustrated, it is possible that multiple image sources 2000 and/or multiple image receivers 2020 (e.g., of same and/or differing types) may be distributively coupled together by one or more distributed interconnects 2010. For example, executable images for multiple image receivers 2020 and/or multiple types of image receivers may be stored/consolidated or otherwise accessible via a single image source 2000 or a fewer corresponding number of image sources 2000. Such a configuration may be implemented, for example, to minimize image storage requirements and/or to facilitate ease of image update/revision by allowing such to be performed on a single system or fewer number of systems. Also possible are multiple image sources 2000 that are capable of communicating executable images across distributed interconnect 2010 on an as-needed basis to one or more image receivers 2020. Such a configuration may be implemented, for example, to allow images of different types to be stored on (or to be otherwise accessible by) different image sources 2000, and to be selected and communicated to an appropriate image receiver 2020 when needed. In one such implementation, images may be selected and communicated without delay or with minimized delay from an available image source 2000 to an image receiver 2020, for example, when other image sources 2020 are busy or not capable of handling image download operations. [0356] It will be understood that image receiver/s and corresponding image receiver/s may be implemented as components of any of the information management configuration embodiments described elsewhere herein. For example, image source/s and corresponding image receiver/s may be implemented as part of the same information management system, may reside in separate information management systems (e.g., clustered systems), may be separate components of a data center, may be separate components of an information management system that are in communication across a network via a virtual distributed interconnect, may be combinations thereof, etc. [0357] Still referring to the exemplary embodiment of FIG. 10, image source 2000 is shown provided with an optional storage device 2002 that may be, for example, an Integrated Drive Electronics (“IDE”) disk, or other storage device/s and/or storage media suitable for storing and providing access to image source/s for one or more image receivers 2020. As shown in FIG. 10, image receiver 2020 may be provided with optional minimal boot code 2022 that may be stored locally on image receiver 2022, for example, in read-only memory (e.g., FLASH memory, etc.). Minimal boot code 2022 may be employed to provide image receiver 2022 with the knowledge required to listen for and receive further code from image source 2000 across distributed interconnect 2010. Upon start up, image receiver 2020 may load minimal boot code 2022 and enter a listen state in which it then begins listening for further information from image source 2000. In one embodiment, minimal boot code 2022 may include, or make up a portion of, system BIOS 1130 described in relation to FIG. 7. [0358] As shown in FIG. 10, after minimal boot code 2022 is loaded, interim operating system 2024 may be communicated or sent from image source 2000 across distributed interconnect 2010 and loaded by image receiver 2020 on top of minimal boot code 2022. [0359] Interim operating system 2024 may be loaded to provide image receiver 2020 with a transition from boot state to operating state (i.e., after loading operating system 2026). In this regard, an interim operating system 2024 may be any code suitable for providing image receiver 2020 with additional functionality required to download further code, such as operating system 2026 and optional management/application API's 2028 and 2030, across distributed interconnect 2010. Examples of suitable interim operating system codes include, but are not limited to, real time operating system codes based on “Thread-X” available from Express Logic, “Vx Works” and “pSOS” available from WindRiver, embedded systems such as “EMBEDDED NT” and “WINDOWS CE” available from Microsoft, etc. [0360] In one exemplary implementation, image receiver 2020 may optionally notify image source 2000 of receipt and download of an executable image such as interim operating system 2024 or any other executable image described herein. Such a downloaded executable image received from image source 2000 may then remain quiescent on image receiver 2020 until receipt of an execution signal sent across distributed interconnect 2010 to image receiver 2020. An execution signal may be transmitted by image source 2000 or any processing engine or other entity capable of communicating such a signal to image receiver 2020 over distributed interconnect 2010. Upon receipt of such an execution signal, image receiver 2020 begins execution of the executable image. [0361] After interim operating system 2024 is downloaded, operating system 2026 may be communicated from image source 2000 across distributed interconnect 2010 and loaded by image receiver 2020 to replace interim operating system 2024, as shown in FIG. 10. [0362] Operating system 2026 may be any operating system suitable for providing an operating environment that enables image receiver 2020 to perform its desired role (e.g., to interface/port one or more applications, API's, etc.). Examples of suitable operating systems 2026 include, but are not limited to, operating systems based on Linux, Windows NT, FreeBSD, etc. Optional management API's 2028 and/or optional application API's 2030 may be downloaded with operating system 2026, or may downloaded on top of operating system 2026. Examples and further information on suitable operating systems and API's are described elsewhere herein, for example, in relation to FIG. 7. [0363] After downloading of operating system 2026 (and optional management and/or application API's 2028 and 2030 if desired) to image receiver 2020, one or more applications 2028 may be downloaded on top of operating system 2026. Examples of such applications include, but are not limited to, one or more of those network content delivery applications 1180 described herein in relation to FIG. 7. One specific example of application 2028 is “RealServer” available from RealNetworks. [0364] As previously mentioned, one or more components of an initial image may be updated or revised. In this regard, image update/revision may be performed on an image that is maintained on image source 2000, for example, by modifying an image stored on storage device/s 2002. The updated/revised image may then be loaded by image receiver 2020 on the next system start-up, for example, in a manner as previously described. Alternatively, an updated/revised image may be communicated from image source 2000 to image receiver 2020 across distributed interconnect 2010 on a real time basis. When performed on a real time basis, some components of the image (e.g., one or more applications 2032, one or more API's 2030 or 2028) may be communicated and loaded by image receiver 2010 without rebooting. Update/revision of other components on image receiver 2020 (e.g., operating system 2026) may require re-boot, although it is possible to selectively re-boot only those image receivers which require update/revised images without rebooting all components of a given information management system. It will also be understood that minimal boot code 2022 residing on image receiver 2022 may be updated across distributed interconnect 2010. [0365] Whether or not re-boot is required, image source 2000 may initiate real time update/revision of an image stored on a image receiver by notifying or instructing image receiver 2020 that an image update/revision is pending. Depending on the desired implementation, image receiver 2020 may respond by immediately taking steps to receive the image update/revision (e.g., including re-boot if necessary) or by waiting until image update/revision is possible without interruption to ongoing operations. Alternatively, image source 2000 may be aware of ongoing operations performed by image receiver 2020 and/or the overall system and wait until update/revision is possible without interrupting ongoing operations. In another case, image receiver 2020 may become aware of internal problems and/or need for updated/revised images, and may notify image source 2000 of the same. A wide variety of other image update/revision policies are also possible including, but not limited to, only performing image update/revision during designated periods or systems downtime, performing critical updates/revisions on an expedited or immediate basis even if system interruptions are incurred and performing non-critical image updates/revisions as system activity levels permit so that system interruptions are not incurred, using image source 2000 as a management processing engine that manages system activity (e.g. content requests) by selectively diverting activity from a given image receiver 2020 to other image receivers 2020 or to other systems so that image update/revision to the given image receiver 2020 may be accomplished without interruptions to users (e.g., content viewers), etc. [0366] In an alternate embodiment, one or more diagnostic features may be loaded by image receiver 2020 as executable images and then executed, rather than loading operating system 2026 to replace interim operating system 2024. Such diagnostic images may be part of interim operating system 2024 (e.g., THREAD-X diagnostics, etc.), or may be loaded on top of interim operating system 2024 instead of operating system 2026. In a manner similar to image updates/revisions, such diagnostic images may be communicated from image source 2000 to image receiver 2020 across distributed interconnect 2010 on a real-time or as-needed basis, and may be initiated by image source 2000 and/or image receiver 2020, for example, when a problem or other need for diagnostics are recognized by image source 2000 and/or image receiver 2020. Diagnostic image-loading policies may also be implemented, and may be similar to those policies described in the preceding paragraph for loading of image updates/revisions, i.e., using the same policies described above for image update/revisions but applied instead to diagnostic image-loading. [0367] In another exemplary embodiment, a second processing object that is specific to a first processing object (e.g., a second processing object configured, selected or otherwise designated to work with a particular first processing object/s or type of first processing object/s) may be interfaced (e.g., accessed and/or managed, etc.) by such a first processing object/s across a distributed interconnect. In the practice of this embodiment, a first processing object may be any processing object that is suitable for interacting with a second processing object (e.g. suitable for interchanging data, commands, or other information with a second processing object, suitable for coordinating together to accomplish one or more information manipulation tasks, etc.) Specific examples of first processing objects include, but are not limited to application objects, file system objects, etc. Examples of second processing objects include, but are not limited to, buffer/cache objects, logical volume management objects, etc. [0368] In an exemplary implementation, an application specific buffer/cache (e.g., a buffer/cache based on an algorithm optimized to work with the access pattern of a certain type of application) and/or file system specific logical volume management object (e.g., a logical volume manager configured to work with a certain type of file system) may be interfaced with a respective selected or otherwise designated application or file system across a distributed interconnect. It will be understood that these examples of first and second processing objects are exemplary only, and that a given processing object may be specific to two or more other processing objects. For example, a logical volume management object may be application specific (e.g., a logical volume manager implementing one or more RAID levels that are particular to, or address the needs of, a given application) and/or may be both file system specific and application specific. [0369] In the exemplary embodiment of FIG. 11, a first processing engine 2100 is shown distributively interconnected to a second processing engine 2120 via distributed interconnect 2110 that may be, for example, a switch fabric or other distributed interconnect 1080 as described elsewhere herein, and that may be coupled to a plurality of processing engines (not shown). Second processing engine 2120 may be coupled via a storage device or disk controller (not shown) to one or more storage devices/content sources 2130 which may be, for example, any one or more of those storage devices or content sources described elsewhere herein. First processing engine 2100 may be any processing engine that is capable of executing an application and/or implementing a file system, such as application processing engine 1070 described elsewhere herein. Second processing engine 2120 may be any processing engine that is capable of providing access to storage device/content source 2130, executing buffer/cache algorithms, and/or executing logical volume management tasks. In one implementation, second processing engine 2120 may be, for example, a storage processing engine 1040 as described elsewhere herein. [0370] Still referring to FIG. 11, first processing engine 2100 is shown executing an application 2102. Application 2102 may be any application that may reside on and be executed by an application processing engine. Examples of such applications include, but are not limited to, streaming media application (e.g., applications for Real Networks, Quick Time or Microsoft Windows Media streaming formats), an HTTP service application (e.g., web cache, web server or web proxy application such as “APACHE”, “NETSCAPE”, “MICROSOFT IIS”, etc.), a network attached storage (NAS) application, etc. First processing engine 2100 is also shown having a file system 2104 that may be, for example, “LINUX EXT-2”, “NTFS”, “HPFS”, etc. [0371] As shown in FIG. 11, second processing engine 2120 may be provided with a buffer/cache 2122 that may be application specific to application 2102, and/or may be provided with a logical volume manager 2124 that may be file system specific to file system 2104. As used herein, “application specific” means that a particular buffer/cache 2122 is designed for, designated for, or is otherwise more suitable for use with, at least one corresponding application 2102 than is another given buffer/cache 2122 (e.g., non-application specific cache such as a conventional general purpose/generic disk cache, or a disk cache that is designed or designated for use with a different given application 2102). For example, a buffer/cache 2122 tailored to the access pattern of one or more streaming media content applications may be considered application specific for use with such streaming media application/s. Similarly, a buffer/cache 2122 designed for database applications may be considered application specific for use with database applications, and a buffer/cache 2122 designed for an HTTP Service application may be considered application specific for use with web cache, web server or web proxy applications. [0372] By “file system specific” it is meant that a particular logical volume manager 2124 is designed for, designated for, or is otherwise more suitable for use with, at least one corresponding file system 2104 than is another given buffer/cache or logical volume manager 2124 (e.g., non-file system specific logical volume manager such as a conventional general purpose/generic logical volume manager, or a logical volume manager that is designed or designated for use with a different file system 2104). Implementing logical volume manager capability on second processing engine 2120 and accessing same across distributed interconnect 2110 advantageously allows processing workload to be offloaded from first processing engine 2100, which may be for example, an application processing engine as described elsewhere herein. [0373] In the embodiment illustrated in FIG. 11, second processing engine 2120 may be implemented to provide first processing engine 2100 (and application 2102 running thereon) with access to data (e.g., cached data) or other information available from storage device/content source 2130. Buffer/cache 2122 may reside on and be implemented on processing engine 2130 using any suitable method, e.g. algorithm, etc. In this regard, buffer/cache 2122 may include, for example, any memory management method, system or structure suitable for logically or physically organizing and/or managing memory. [0374] Examples of the many types of memory management environments with which the disclosed methods and systems may be employed include, but are not limited to, integrated logical memory management structures such as those described in U.S. patent application Ser. No. 09/797,198 filed on Mar. 1, 2001 which is entitled SYSTEMS AND METHODS FOR MANAGEMENT OF MEMORY; and in U.S. patent application Ser. No. 09/797,201 filed on Mar. 1, 2001 which is entitled SYSTEMS AND METHODS FOR MANAGEMENT OF MEMORY IN INFORMATION DELIVERY ENVIRONMENTS, each of which is incorporated herein by reference. Such integrated logical memory management structures may include, for example, at least two layers of a configurable number of multiple memory queues (e.g., at least one buffer layer and at least one cache layer), and may also employ a multi-dimensional positioning algorithm for memory units in the memory that may be used to reflect the relative priorities of a memory unit in the memory, for example, in terms of both recency and frequency. Memory-related parameters that may be may be considered in the operation of such logical management structures include any parameter that at least partially characterizes one or more aspects of a particular memory unit including, but are not limited to, parameters such as recency, frequency, aging time, sitting time, size, fetch (cost), operator-assigned priority keys, status of active connections or requests for a memory unit, etc. [0375] Besides being suitable for use with integrated memory management structures having separate buffer and cache layers, the disclosed methods and systems may also be implemented with memory management configurations that organize and/or manage memory as a unitary pool, e.g., implemented to perform the duties of buffer and/or cache and/or other memory task/s. In one exemplary embodiment, such memory management structures may be implemented, for example, by a second processing engine 2120 in a manner such that read-ahead information and cached information are simultaneously controlled and maintained together by the processing engine. In this regard, “buffer/cache” is used herein to refer to any type of memory or memory management scheme that may be employed to store retrieved information prior to transmittal of the stored information to a first processing engine 2100. Examples include, but are not limited to, memory or memory management schemes related to unitary memory pools, integrated or partitioned memory pools, memory pools comprising two or more physically separate memory media, memory capable of performing cache and/or buffer (e.g., read-ahead buffer) tasks, etc. [0376] Other examples of suitable systems and methods (e.g., using algorithms) that may be implemented as cache 2122 in first processing engine 2100 include, but are not limited to, systems and methods such as are described in U.S. patent application Ser. No. 09/947,869 filed on Sep. 6, 2001 and entitled “SYSTEMS AND METHODS FOR RESOURCE MANAGEMENT IN INFORMATION STORAGE ENVIRONMENTS”, by Chaoxin C. Qiu et al., which is incorporated herein by reference. Such methods may be employed to manage information management system I/O resources based on modeled and/or monitored I/O resource information and may be implemented to optimize information management system I/O resources for the delivery of a variety of data object types, including continuous streaming media data files. These methods and systems may be implemented in an adaptive manner that is capable of optimizing information management system I/O performance by dynamically adjusting information management system I/O operational parameters to meet changing requirements or demands of a dynamic application or information management system I/O environment using a resource management architecture. The resource management architecture may include, for example, a resource manager, a resource model, a storage device workload monitor and/or a storage device capacity monitor. The resource model may be configured to generate system performance information based on monitored storage device workload and/or storage device capacity information. The resource manager may be configured to manage information management system I/O operation and/or resources using the system performance information. [0377] It will be understood that first processing engine/s 2100 and second processing engine/s 2120 may be implemented as components of any of the information management configuration embodiments described elsewhere herein. For example, first processing engine/s 2100 and second processing engine/s 2120 may be implemented as part of the same information management system, may be implemented in separate information management systems (e.g., clustered systems), may be separate components of a data center, may be separate components of an information management system that are in communication across a network via a virtual distributed interconnect, may be combinations thereof, etc. Although not illustrated in FIG. 11, one or more buffer/cache algorithms may reside on one or more second processing engines 2120 (e.g., on one or more storage processing engines), and one or more applications 2102 may reside on one or more first processing engines 2100 (e.g., on one or more application processing engines). For example, it is possible that multiple first processing engines 2100 and/or multiple second processing engines may be coupled together by one or more distributed interconnects 2110. [0378] In operation of the embodiment of FIG. 11, a particular buffer/cache 2122 or logical volume manager 2124 that is application or file system specific to a corresponding respective application 2102 or file system 2104 may be selected or otherwise configured for use with the corresponding respective application 2102 or file system 2104 in any suitable manner, including by pre-assignment, and/or by assignment or reassignment on a real time basis. Although, the following example describes an example of the selection of a particular buffer/cache 2122 that is application specific for use with a given application 2102, it will be understood that the same or similar methodology may be followed for selection of a particular logical volume manager 2124 that is file specific for use with a given file system 2104. In this example, a single first processing engine 2100 executing an application 2102 may be coupled across a distributed interconnect 2110 to a single second processing engine 2120 having a buffer/cache 2122 that is assigned or otherwise designated to be application specific to the application 2102 running on the first processing engine 2100. In this example, application 2102 and buffer/cache 2122 may be pre-assigned or installed initially on respective first processing engine 2100 and second processing engine 2120 (e.g., during original system configuration and installation). [0379] In the preceding example, it is also possible that application 2102, file system 2104, buffer/cache 2122, and/or logical volume manager 2124 may be replaced or modified after original configuration/installation on respective processing engine 2100 and/or second processing engine 2120, for example, on a real time or dynamic basis over distributed interconnect 2110. For example, a buffer/cache 2122 or logical volume manager 2124 may be modified or replaced so as to be application specific or file system specific to a new or modified respective application 2102 or file system 2104, or vice-versa. Alternatively, both buffer/cache 2122 and corresponding application 2102 and/or both logical volume manager 2124 and corresponding file system 2104 may be replaced or modified together in a manner that maintains the application specific or file system specific relationship. Exemplary methods of configuration and/or provisioning, including real time/dynamic reconfiguration and/or re-provisioning, may be found described and illustrated elsewhere herein, for example, in relation to steps 1220 through 1250 of FIG. 8. [0380] In the exemplary embodiment illustrated in FIG. 12, multiple first processing engines 2100 (1) to 2100 (x), each executing at least one respective application 2102 (1) to 2102 (x), may be distributively interconnected to multiple second processing engines 2120 (1) to 2120 (y), each having at least one respective buffer/cache algorithm 2102 (1) to 2102 (y), via distributed interconnect 2110. As shown, each of multiple first processing engines 2100 (1) to 2100 (x) may also be provided with at least one respective file system 2104 (1) to 2104 (x) and each of multiple second processing engines 2120 (1) to 2120 (y) may also be provided with at least one respective logical volume manager algorithm 2124 (1) to 2124 (y). In FIG. 12, each of multiple second processing engines 2120 (1) to 2120 (y) is also shown coupled to a respective storage device/content source 2130 (1) to 2130 (y). [0381] In the embodiment of FIG. 12, the number of first processing engines may be at least two (i.e., x≧2), the number of second processing engines may be at least two (i.e., y≧2), and the number of first processing engines may be different than the number of second processing engines (i.e., the value of x may differ from the value of y). Although not illustrated, it is also possible that a single first processing engine 2100 may be distributively interconnected to two or more second processing engines 2120, or that a single second processing engine 2120 may be distributively interconnected to two or more first processing engines 2100 via distributed interconnect 2110. It is also possible that first processing engine/s 2100 may be distributively interconnected to second processing engine/s 2120 by more than one distributed interconnect 2110. Furthermore, it is possible that one or more second processing engines 2120 may be distributively interconnected to two or more storage device/content sources 2130, and/or that two or more second processing engines 2120 may be distributively interconnected to one or more of the same storage device/content sources 2130 (e.g., so that the same storage device/content sources 2130 may be selectably accessed by two or more second processing engines 2120 using different buffer/cache algorithms 2122 and/or logical volume management algorithms 2124). [0382] The embodiment of FIG. 12 may be implemented so that the characteristics of the buffer/cache and/or logical volume management algorithms of at least one of the multiple second processing engines 2120 differs from the characteristics of the buffer/cache and/or logical volume management algorithms of at least one of the other second processing engines 2120, but is at the same time assigned or otherwise designated to be application specific or file system specific to at least one of the respective applications 2102 and/or file systems 2104 residing on multiple first processing engines 2100. Such a configuration may be implemented, for example, to allow a particular first processing engine 2100 that is executing a given application 2102 to retrieve information/data (e.g., content) from a particular storage device/content source 2130 using a selected second processing engine 2120 having a buffer/cache algorithm 2124 optimized for the particular access pattern of the given application 2102 running on the particular first processing engine 2120, and/or having a given logical volume management algorithm 2124 that is optimized for the given file system 2104 residing on the particular first processing engine 2120. [0383] With regard to FIG. 12, it will be understood that one or more first processing engines 2100 may be selectably interconnected to one or more selected second processing engines 2120 using one or more distributed interconnects 2110, and that selective interconnection of first and second processing engines in the previously described manner may occur on a real time or as-needed basis depending on a variety of different criteria including, but not limited to, depending on the characteristics of a given application 2102 and/or file system 2104 residing on a particular first processing engine 2100 and the corresponding availability of application specific buffer/cache 2122 and/or file system specific logical volume manager 2124 residing on a particular second processing engine 2120, depending on the characteristics of data/content to be retrieved from a particular storage device/content source 2130, depending on the performance of a particular processing object residing on a given processing engine (e.g., performance of a particular buffer/cache and/or logical volume management object residing on a particular second processing engine 2120), depending on the storage functionality of a particular second processing engine 2120 (e.g. RAID functionality), depending on the data/content access characteristics of a particular second processing engine 2120 (e.g., access speed), depending on the capability of a particular processing object and/or processing engine (e.g., audio processing capability for building a web page having audio characteristics), combinations thereof, etc. It is also possible that two or more first processing engines 2100 may simultaneously each be selectably interconnected in the previously described manner to respective selected second processing engine/s 2120 (e.g., multiple first processing engines each being selectably interconnected to different second processing engines or being selectably interconnected to the same second processing engine), and vice-versa. [0384] Furthermore, differentiated information management methodology described elsewhere herein may be employed to manage selective interconnection of one or more first processing engines 2100 to one or more selected second processing engines 2120 using one or more distributed interconnects 2110. For example, selective interconnection between any given first processing engine/s 2100 and any given second processing engine/s 2120 to access particular information/data from a given storage device/content source/s 2130 to satisfy a first need or request for information management (e.g. request for content delivery) may be managed relative to (e.g. prioritized relative to) other such selective interconnection operations required to satisfy a second need or request for information management based on one or more parameters associated with the individual first and second needs/requests for information management. Such parameters may include any of those parameters described elsewhere herein as suitable for differentiating information management tasks and may specifically include, for example, priority-indicative parameters associated with prioritizing communications across distributed interconnect 2110 that are extended or transferred so as to prioritize operations performed by first processing engine/s 2100 and/or second processing engine/s 2120 (e.g., the services/functions/tasks performed thereon). [0385] As described in relation to FIG. 11, one or more applications 2102, one or more file systems 2104, one or more buffer/cache algorithms 2122, and/or one or more logical volume managers 2124 may be replaced or modified after original configuration/installation on a real time or dynamic basis over distributed interconnect 2110, for example, using the exemplary methods of configuration and/or provisioning described and illustrated in relation to steps 1220 through 1250 of FIG. 8. [0386] In addition to selectably interconnecting particular first processing engine/s 2100 to particular second processing engine/s 2120 using one or more distributed interconnect/s 2110, it is also possible to manage operations of an application specific buffer/cache 2122 and/or a file system specific logical volume manager 2124 over one or more distributed interconnect/s 2110 via a separate reserved or dedicated communication path across the distributed interconnect 2110. In this regard, operations of a buffer/cache 2122 that may be so managed include, but are not limited to, configuration, gathering performance characteristics or data (e.g., to verify proper functioning), specifying security levels/gates (e.g., passwords, etc.). Operations of a logical volume manager 2124 that may be so managed include, but are not limited to, configuration (e.g., defining logical volumes and/or characteristics of logical volumes, such as defining number of RAID mirrors and size), loading content on to the logical volume manager (e.g., without interfering with user-access to data), etc. Advantageously, this embodiment may be used to provide a separate or reserved communication path for buffer/cache and/or logical volume manager management communication between a first processing engine 2100 and a second processing engine 2120 (e.g., inter-processor command communication between an application processing engine and a storage processing engine) that does not interfere with or reduce bandwidth for data/information (e.g., content) exchange between the first processing engine 2100 and the second processing engine 2120. [0387] Still referring to FIGS. 11 and 12, management of one or more processing objects (e.g., buffer/cache algorithms 2122 and/or logical volume management algorithms 2124) may be implemented over a distributed interconnect 2110 using any processing engine configuration/methodology and/or information management system configuration/methodology suitable for effecting such management including, for example, any such configuration or methodology described elsewhere herein. In this regard, management of one or more processing objects such as buffer/cache algorithms 2122 and/or logical volume management algorithms 2124 over a distributed interconnect 2110 may be provided using any management entity suitable for managing a given processing object. Examples of suitable management entities include, but are not limited to, a separate processing engine, combination of processing engines, a separate system, combination of systems, manual/operator input, combinations thereof, etc. [0388] In one exemplary embodiment, buffer/cache algorithms 2122 and/or logical volume management algorithms 2124 may be managed across a distributed interconnect 2110 by a management processing engine (host) (not illustrated in FIGS. 11 and 12) coupled to distributive interconnect 2110 in a manner such as described elsewhere herein. One example of such an embodiment may be implemented as follows using the system embodiments of FIGS. 1A or 1B. Referring to FIGS. 1A and 1B in conjunction with FIGS. 11 and 12, first processing engine/s 2100 may be application processing engine/s 1070 and second processing engine/s 2120 may be storage processing engine/s 1040, with management of buffer/cache algorithms 2122 and/or logical volume management algorithms 2124 being supplied by management processing engine 1060 over distributed interconnection 1080. [0389] In another alternative embodiment, a distributed interconnect may be advantageously employed to facilitate coordination between multiple processing engines, e.g., in the performance of one or more operating tasks. In this regard, an operating task may be any task suitably performed in a coordinated manner between two or more members of a group of processing engines distributively interconnected by one or more distributed interconnects. Examples of operating tasks include, but are not limited to, fail over operations, load balancing operations, debugging operations, status monitoring operations, etc. [0390] In one example, this capability may be advantageously employed between multiple processing engines executing the same or similar-type of applications, e.g., to implement operating tasks such as those employed for fail over and/or load-balancing purposes. In another example, a processing engine/s may utilize a distributed interconnect to monitor or query for the status of other needed resources (e.g., other applications or services), for example, on which the processing engine/s depends. In this embodiment, multiple processing engines may be distributively interconnected by a distributed interconnect in a variety of system configurations, including those described elsewhere herein. For example, multiple application processing engines of an information management system (e.g., content delivery system) may be distributively interconnected by a distributed interconnect, as illustrated and described in relation to FIGS. 1A through 1F. Multiple processing engines of multiple information management systems may be distributively interconnected by one or more distributed interconnects in clustered configurations, such as illustrated and described in relation to FIGS. 1G-1J. Multiple processing engines or one or more information management systems may also be distributively interconnected by virtual distributed interconnections, such as across a network as illustrated and described in relation to FIG. 9D. [0391] In the presently described embodiment, multiple processing engines and/or processing modules thereof may coordinate across one or more distributed interconnections in any suitable manner that takes advantage of the distributive nature of the interconnection including, but not limited to, by employing multi-cast messaging between individual processing engines and/or modules thereof across the distributed interconnection/s. In such an example, communication, command and/or control information may be multicast from one peer to multiple peers (e.g. a multicast to all peers or to a selected or defined group of peers coupled to the distributed interconnect). This capability may be advantageously employed to facilitate failover operations, for example, upon the loss of one or more members of a group of multiple processing engines and/or modules thereof that are distributively interconnected by a distributed interconnect. In such a case, a group of multiple processing engines or modules thereof may include components of the same information management system, may include components of multiple information management systems (e.g., two or more clustered information management systems), and/or may include individual components operating in stand-alone manner. [0392] In one example, a group of multiple processing engines may include multiple processing engines performing the same or similar information management tasks, and/or capable of performing the same or similar information tasks. One example of such a group may include two or more processing modules of a processing engine as described and illustrated in relation to FIG. 1A (e.g., a group of two or more network interface processing modules 1030 a and 1030 b, a group of two or more storage processing modules 1040 a and 1040 b, a group of two or more transport processing modules 1050 a and 1050 b, a group of two or more system management processing modules 1060 a and 1060 b, a group of two or more application processing modules 1070 a and 1070 b). [0393] In another example, a group of multiple processing modules may include two or more processor modules capable of performing the same or similar information tasks as described and illustrated in relation to FIGS. 1C through 1F (e.g., a group of two or more processor modules 1003 capable of performing tasks of either a storage processing engine 1040 or a transport processing engine 1050, a group of two or more processor modules 1001 capable of performing tasks of either a transport processing engine 1050 or an application processing engine 1070). In this regard, such processor modules may be capable of being reconfigured or re-assigned (e.g., on a real time basis) to implement different processing engine functionalities upon failover of another processor module/s, and/or to implement load balancing among the processor modules. [0394] In yet another example, a group of multiple processing engines may include two or more processing engines as described and illustrated in relation to FIG. 1J (e.g., a group of two or more processing engines 1030 distributively interconnected by distributed interconnects 1600 and 1080, etc.). Yet another example of such a group may include two or more processing engines as described and illustrated in relation to FIG. 9D (e.g., a group of two or more processing engines 1310 that are distributively interconnected across network 1340, etc.). It will be understood that the preceding examples are exemplary only, and that a group of multiple processing engines and/or processing modules thereof may include other processing engine configurations. [0395] To facilitate failover operations among a group of multiple processing engines and/or modules thereof, the group may be kept apprised of the status of one or more individual members of the group (i.e., individual processing engines and/or modules) using a variety of multicasting techniques over one or more distributed interconnects. For example, each member of the group may stay in contact with other members of the group during normal operations, for example, by periodic multicast communications between members of the group. Alternatively, a failed processing engine or module may broadcast a failure alarm by multicast communication to other members of the group that indicates it has already failed or that failure is imminent. Upon loss of contact with a given processing engine or module (e.g., due to failure of the given processing engine or module), or upon receipt of a multicast failure alarm, one or more of the other members of the group may be configured to pick up or otherwise assume the load or tasks of the failed engine or module. In either case, protocol may be implemented to designate or otherwise select which remaining member/s pick up the tasks of the failed processing member (e.g., based on relative magnitude of the existing workload of each of the remaining members, based on a pre-designated failover sequence assigned to the remaining members, combinations thereof, etc.). [0396] Alternatively, one or more designated members of a group (e.g., one or more designated processing engines/modules of the group, a designated processing engine/module separate from the group such as a system management processing engine, etc.) may monitor operations of one or more other members of the group (e.g., by periodic query, periodic notification received from other members of the group, by failure alarm received from a failed or failing member of the group, etc.). Upon notice of failure or imminent failure of a given member of the group, the designated member may broadcast a failure alarm by multicast communication across a distributed interconnect to other members of the group indicating the failure of the given member. [0397] When implemented to facilitate load balancing among the individual members of a group of multiple processing engines and/or modules thereof, similar methodologies as employed for failover operations may be implemented. However, instead of multicast failure alarms, one or more individual members of the group may broadcast processing engine workload level details by multicast communication over one or more distributed interconnects to other members of the group, which may then act accordingly to balance the information management load among the members of the group. For example, such multicast workload level communications may be broadcast by a given processing engine or processing module to notify other members of the group that the given processing engine/module has a relatively light workload, a relatively heavy workload, to otherwise indicate the magnitude of the workload, etc. Upon receipt of such a multicast workload level communication, one or more other members of the group may then act in a manner similar to that described for failover operations as appropriate to achieve load balancing among the processing engines by transferring workload, e.g., to assume or take over additional information management workload from a heavily loaded member, to offload information management workload to a lightly loaded member, etc. [0398] As with failover operations, protocols may be implemented to direct how information management loads are transferred or redistributed among members of a group of multiple processing engines and/or processing modules (e.g., based on relative magnitude of the existing workload of each member of the group, based on a pre-designated load balance sequence assigned to the members of the group, combinations thereof, etc.). Furthermore, it is also possible that a designated member of the group may monitor operations of one or more other members of the group, and may implement load balancing among the members of the group by multicast communication in a manner similar to that described for failover operations. [0399] In addition to the above-described failover and load balancing embodiments, it is also possible to employ broadcast of multicast communications among multiple processing engines and/or processing modules across one or more distributed interconnects to establish or otherwise identify other processing engines and/or processing modules having one or more certain defined characteristic/s. Such characteristic/s may include, but are not limited to, common processing characteristics (e.g., an application running on a given processing engine/module may query for another instance/s of itself running on other processing engines/modules by sending a multicast message over a distributed interconnect), different but related processing characteristics (e.g., an application running on a given processing engine/module may query for services or other applications on which it depends and which are running on other processing engines/modules by sending a multicast message over the distributed interconnect), combinations thereof, etc. In some embodiments, use of multicast communications to establish/identify other members of a group having defined characteristic/s may be employed in conjunction with load balancing and/or failover operations as described above (e.g., to establish one or more members of a group of multiple processing engines/modules having common characteristics such as application being executed, processing capability, etc.). In other embodiments, use of multicast communications to establish/identify other members of a group having defined characteristic/s may be employed in a stand-alone manner, without using multicast communications for load balancing or failover operations. [0400] When implemented together with load balancing and/or failover operations, it is possible in yet another embodiment that a heavily loaded and/or failing processing engine and/or processing module may broadcast a multicast query communication to other processing engines/modules of a group that requests certain information from the other members of the group (e.g., identity of application running on each processing engine/module, capability of each processing engine/module, workload of each processing engine/module, etc.). Upon receipt of information from other members of the group in response to the multicast query, the heavily loaded and/or failing processing engine/module may offload some or all of its workload to one or more of the other processing engines/modules of the group in any suitable manner, for example, based on pre-defined protocol, based on relative magnitude of workload of the other members of the group (e.g., more work offloaded to members with relatively lighter loads), combinations thereof, etc. [0401] Applying a similar methodology under different circumstances, it is possible that a lightly loaded or newly added processing engine/module may issue a multicast query communication to other processing engines/modules of a group that requests information from the other members of the group (e.g., application identity, processing capability, processing workload, etc.). Upon receipt of information from other members of the group, the lightly loaded or newly added processing engine/module may assume workload from one or more of the other members of the group in any suitable manner, for example, based on pre-defined protocol, based on relative magnitude of workload of the other members of the group (e.g., more work assumed from members with relatively heavier loads), combinations thereof, etc. [0402] In yet another embodiment, a specialized processing engine capable of performing specialized processing tasks my issue a multicast communication to other processing engines to signal the availability of its specialized processing capabilities. One or more other processing engines (e.g., less specialized processing engines) may respond by forwarding processing workload that can benefit from the specialized capabilities of the specialized processing engine. Such workload may be transferred by, for example, less specialized processing engines that are capable of performing the specialized processing tasks but in a less efficient manner, or by less specialized processing engines that are incapable of performing the specialized processing tasks. In an alternate embodiment, a less specialized processing engine may issue a multicast query asking for notification of specialized capability and/or an alert indicating need for specialized processing capability. In response, specialized processing engine/s may respond by indicating availability of specialized processing capability, and may then assume processing workload transferred from the less specialized processing engine. [0403] Thus, it will be understood with benefit of this disclosure that multicast communications broadcast across one or more distributed interconnects among a group of multiple processing engines and/or processing modules may be implemented in a wide variety of ways and combinations thereof in order to identify processing characteristics and/or capabilities, to share processing workloads, to implement load balancing and/or failover operations, to identify need for additional type of processing capability and to increase the availability of that type of needed capability (e.g., including the identification of need for increased capability of performing a particular type of information management task, and achieving an increase in the capability for performing that particular type of information management task by notifying one or more processing engines capable of multiple information management functionalities of the need to switch to the information management type for which additional capability is needed), combinations thereof, etc. In each case, transfer of processing workload and/or processing capability among multiple processing engines/modules using multicast communications between the multiple processing engines/modules across one or more distributed/s may be advantageously implemented in real time and/or on an as-needed basis, for example, to continuously optimize system utilization, efficiency, and/or performance. [0404] In yet another embodiment, code running on a first processing engine (e.g., running on an application processing engine or at least one module thereof) may be debugged or otherwise analyzed by sending debug messages/information from the first processing engine across one or more distributed interconnects to a second processing engine (e.g., a management processing engine or host), where the debug messages/information may be viewed, analyzed, and/or stored. Examples of such debug information include, but are not limited to, interprocessor communications and/or messages that are not otherwise visible beyond the communicating processors themselves and which may be analyzed to diagnose problems in code execution, “state” information (e.g., data structure state in RAM memory), information on program-type events that have occurred (e.g., programming level language, functions called, data structure changes, etc.), etc. In one implementation of this embodiment, debug information for a given processing engine of an information management system may be made accessible on the second processing engine, e.g., for analysis by human operator and/or for further external processing and analysis. In this regard, debug information may be retrieved from or otherwise communicated from the second processing engine, which may optionally store the debug information and/or communicate it in real time. Alternatively or additionally, debug information may be analyzed by the second processing engine itself, for example, using algorithms capable of performing protocol analysis to detect problems, capable of processing the information into human-readable form for manual viewing and diagnosis, combinations thereof, etc. [0405] In one exemplary debugging configuration, a first processing engine may be, for example, an application processing engine 1070, and a second processing engine may be a management processing engine (or host) 1060 of an information management system (e.g., content delivery system) 1010 such as illustrated and described in relation to FIG. 1A and FIGS. 1C through 1F. In such a configuration, debug information may be transmitted or otherwise communicated externally from management processing engine 1060 using management interface 1062. In another exemplary debugging configuration, a first processing engine may be, for example, an application processing functionality 1320, and a second processing engine may be a host processing functionality 1330 of an information management system 1302, such as illustrated and described in relation to FIG. 9D. [0406] In other embodiments, the disclosed systems and methods may utilize distributed interconnects to facilitate debugging tasks in additional ways. For example communications or messaging between two or more processing engines (e.g., between an application processing engine and a storage management processing engine or transport processing engine) may be multicast across one or more distributed interconnects and monitored or retrieved by a third processing engine (e.g., management processing engine). In one embodiment this may occur, for example, in response to a command or request issued by the third processing engine that instructs the first and/or second processing engine to multicast event-based and/or state-based debug information, and then listens for same. In this regard the third processing engine may also optionally specify the particular type/s of debug information to be broadcast. The third processing engine may in turn store, analyze and/or communicate externally these inter-processing engine communications, for example, in a manner as described above in relation to debug information. Inter-processing engine communications may be analyzed externally and/or by a third processing engine, for example, in a diagnostic manner to debug and/or optimize the code running on the two or more communicating processing engines. In this regard, a third processing engine may be configured to identify problems and/or inefficiencies between the communicating processing engines, to take corrective action to address problems and/or inefficiencies, to report an external alarm or other notification of problems, or a combination thereof. [0407] In the practice of one embodiment of the disclosed systems and methods, one or more distributed interconnects may be utilized to selectably vary processing flow path configurations used, for example, to perform one or more information manipulation tasks associated with a given request for information management relative to another given request for information management. The capability of selecting processing flowpaths may be used to tailor or select the identity of processing engines, and the combination of information manipulation tasks, that are implemented to satisfy a given request for information processing. Advantages that may be realized by so tailoring flow path configurations include, for example, reduction in bandwidth between processing engines that do not need to communicate to satisfy a given request for information processing, acceleration of processing by eliminating such unnecessary communication steps, and/or the ability to tailor combinations of information manipulation tasks on a request by request basis in order to efficiently handle varying types of such requests using the processing engines of a common information system. [0408] FIGS. 13-16 illustrate exemplary data and communication flow path configurations possible among processing engines or processing modules of one exemplary embodiment of an information management system 2200, in this exemplary case a content delivery system such has been previously described herein. The illustrated embodiment of FIGS. 12-15 employs a number of processing engines distributively interconnected, for example, using a distributed interconnect (not shown) such as a switch fabric. The processing engines of FIGS. 12-15 include a group of basic processing engines capable of performing basic information manipulation tasks (i.e., those information manipulation tasks that are needed to accomplish the designated information management task of content delivery). In the exemplary embodiment of FIGS. 12-15, the group of basic processing engines includes network application processing engine 1070, network transport processing engine 1050, storage management processing engine 1040, and network interface processing engine 1030. Storage management processing engine 1040 is shown coupled to content sources 1090 and 1100. It will be understood that the group of basic processing engines illustrated in FIGS. 1215 is exemplary only and that members of such a group may vary from embodiment to embodiment, depending on the particular needs of a designated information management task. [0409] In FIGS. 13-16, additional processing engines 2210, 2220 and 2230 are also shown, and may include processing engines capable of performing selectable information manipulation tasks different than the basic information manipulation tasks performed by processing engines 1030, 1040, 1050 and 1070. Selectable information manipulation tasks may be any information manipulation task that is optional or otherwise additional to basic information manipulation tasks that are required to accomplish the designated information management task, in this exemplary embodiment, delivery of content. Examples of such additional selectable information manipulation tasks include, but are not limited to, tasks such as data encryption, data compression, security functions, transcoding, content filtering, content transformation, filtering based on metadata, metadata transformation, etc. It will be understood that although a particular exemplary content delivery system embodiment having three additional processing engines 2210, 2220 and 2230 is illustrated in FIGS. 12-15, that other types of information management system configurations having greater or fewer number of distributively interconnected additional processing engines may be implemented. Furthermore, it will be understood that types of information management other than content delivery, and that types/configurations of information management systems other than content delivery systems, may be implemented using this embodiment including any of the information management systems or combinations of such systems described elsewhere herein. [0410] In FIGS. 13-16, inter-processor command or control flow (i.e. incoming or received data request) is represented by dashed lines, and delivered content data flow is represented by solid lines. As previously described herein, command and data flow between modules may be accomplished through the distributed interconnect that is coupled to each of the processing engines of system 2200. In this regard, FIG. 13 illustrates a request for content that is received and processed by network interface processing engine 1030 and then passed on to network transport processing engine 1050, then on to application processing engine 1070 and to storage management processing engine 1040 for processing and retrieval of the requested content from appropriate content sources 1090 and/or 1100. As shown, storage management processing engine 1040 then forwards the requested content directly to network transport processing engine 1050, which is then transferred via network interface processing engine 1030 to, for example, an external network 1020. As shown in FIG. 13, command and data flow bypasses additional processing engines 2210, 2220 and 2230 by virtue of the distributed interconnect to achieve a content delivery data flow similar to that described and illustrated in relation to FIG. 1B. [0411] Selective bypassing of one or more processing engines using a distributed interconnect may be achieved in a manner as described elsewhere herein. For example, a data-request generated by network interface engine 1030 may include pertinent information such as the component ID of the various processing engines to be utilized in processing the request. Such information may be based on a variety of different parameters, e.g., based on one or more parameters associated with a particular request for information management, one or more parameters associated with a particular type of information management requested, one or more parameters associated with a particular user or class of users, one or more parameters associated with system workload, combinations thereof etc. Such information may also include identifiers or tags associated with requests for information that may be recognized and acted on, or revised/replaced by one or more processing engines coupled to the distributed interconnect so as to achieve selective routing between the processing engines. [0412] It is also possible that one or more individual processing engines may be capable of recognizing or identifying one or more parameters or characteristics associated with the information being managed and in response, altering the data flow path between processing engines based thereon. Such parameters or characteristics may include substantive characteristics such as objectionable subject matter included in requested content, particular language of text in requested content, security-sensitive information such as social security numbers or bank account numbers included in requested content, premium subject matter included in content requested by a non-premium user, user-identified subject matter included in the requested content (i.e., specific types of subject matter included in content requested by a user who has indicated that such types of subject matter are undesirable or that should otherwise be processed using particular information manipulation task/s, etc.). Combinations of these and other parameters/characteristics may considered and used to selectively route the data flow between processing engines. [0413]FIG. 14 illustrates an alternate data and communication flow path configuration that may be implemented using the same information management system embodiment of FIG. 13, this time using the distributed interconnect to route requested content from storage processing engine 1040 to additional processing engine 2220, prior to forwarding it to transport processing engine 1050. Additional processing engine 2220 may, for example, be capable of at least one of filtering the content (e.g., filtering out objectionable images from the content, filtering out premium subject matter from the content, filtering out pre-selected word-types or other pre-selected undesirable characteristics of the content), transforming the content (e.g., transforming text of content from one language to another), encrypting the content (e.g. encoding the content for security purposes), combinations thereof, etc. For example, objectionable subject matter contained in retrieved content may be identified by storage management processing engine 1040 and sent to additional processing engine 2220 for filtering. Storage management processing engine 1040 may also make the decision to route the content to additional processing 2220 prior to transport processing engine 1050 based on a request having, for example, a parental control parameter for restricting access to such subject matter. Alternatively, this routing decision may also be based on such a parental control parameter associated with the request, in combination with the identification of objectionable subject matter by storage management processing engine 1040. Similar methodology (e.g., using parameters associated with an information management request and/or identification of parameters/characteristics associated with the information itself) may be applied to routing decisions made based on need for content transformation, need for content encryption, etc. [0414]FIG. 15 illustrates an alternate data and communication flow path configuration that may be implemented using the same information management system embodiment of FIGS. 13 and 14, this time using the distributed interconnect to route requested content from storage processing engine 1040 to additional processing engines 2220 and 2230, prior to forwarding it to transport processing engine 1050. Such a data flow path may be implemented, for example, when need for multiple separate additional information manipulation tasks (e.g., filtering and encryption, filtering and transformation, encryption and transformation, etc.) is identified based on one or more parameters as previously described. Although not shown, another possible data flow path may include routing content through all three additional processing engines 2210, 2220 and 2230 prior to transport processing engine 1050 where need for the processing capabilities of all three of the additional processing engines is recognized and/or dictated as described elsewhere herein. Thus, multiple additional processing engines may be provided (e.g., each possessing different additional processing capabilities), and multiple alternative data flow paths generated therebetween as necessary or desired for individual information management tasks based on a variety of different parameters/characteristics and combinations thereof as described elsewhere herein. [0415]FIG. 16 illustrates yet another data and communication flow path configuration that may be implemented using the same information management system embodiment of FIGS. 13-15, this time using the distributed interconnect to route command/control flow (i.e., incoming or received data request) to additional processing engine 2220 rather than application processing engine 1070, prior to forwarding the request on to storage processing engine 1040. Such a flow path may be implemented, for example, to tailor a particular type of information management request to a corresponding processing capability, to differentiate between processing of different information management requests based on priority-indicative parameters associated therewith (e.g., higher priority requests to higher speed processors and vice-versa), to distribute processing load among multiple processors, to assign particular class or subset of request to particular processing engines (e.g., to optimize buffer/cache availability and/or data hit ratio), combinations thereof, etc. [0416] Thus, it will be understood with benefit of this disclosure that one or more distributed interconnects, such as switch fabrics, may be implemented in a variety of information management embodiments, and combinations of such embodiments, to allow asymmetric and/or independent interaction and/or communication between processing engines and/or processing modules thereof to achieve a wide range of advantages including, but not limited to, increased system efficiencies, accelerated performance, deterministic behavior, differentiated service, etc. Examples of just a few of such embodiments described elsewhere herein or that may be otherwise implemented include, but are not limited to, the following embodiments. [0417] Accessing one or more applications (e.g., media streaming applications, HTTP serving applications, NAS applications, HTTP proxy/caching applications, streaming media proxy/caching applications, etc.) using a network transport processor that receives requests for these service from external clients/users over a distributed interconnect, such as a switch fabric. [0418] Using a management processing engine to command one or more other processing engines (e.g., storage processing engine, application processing engine, network transport processing engine, network interface processing engine, etc.) to reboot by issuing such a command over a distributed interconnect, such as a switch fabric. [0419] Using an agent that measures resource utilization (e.g., utilization of CPU, memory, fabric bandwidth, etc.) and reports the measured utilization over a distributed interconnect, such as a switch fabric. [0420] Processing admission control requests/responses over a distributed interconnect, such as switch fabric, for example as follows: 1) A particular processing engine such as storage processing engine receives a request for service; 2) Before servicing the request it checks with a management processing engine to determine whether it should service the request; 3) The management processing engine may base its decision and response to the storage processing engine on any number of factors including, but not limited to, the current load the system is servicing, whether the request comes from an authorized user, identity of content the request will access, etc. [0421] An application processing engine may mount a disk drive directly connected to a management processing engine using a transport protocol that runs over a distributed interconnect, such as a switch fabric. [0422] A firmware image residing in ROM (e.g., FLASH) memory may be updated with a new image that is sent over a distributed interconnect, such as a switch fabric. [0423] Messages/communications used to manage an application may be sent to/from a management processing engine to an application processing engine over a distributed interconnect, such as a switch fabric. [0424] Activity (e.g., aliveness) of an application may be polled by a management processing engine by sending messages to the application over a distributed interconnect, such as a switch fabric. [0425] An application may log access events to a management processing engine over a distributed interconnect, such as a switch fabric. EXAMPLES [0426] The following hypothetical examples are illustrative and should not be construed as limiting the scope of the invention or claims thereof. [0427] Examples 1-3 relate to an application that is delivering streams (e.g., video streams) of long duration. In the following examples, it is assumed that one subdirectory contains premium content (subdirectory P), and that other subdirectories on the file system have non-premium content. An external authorization scheme is provided to direct premium customers to the/P directory, and to deny access to this directory for non-premium users. In the scenario of the following examples, all policies are based on two priorities, and do not take into account other parameters that may be considered such as delivered bandwidth, storage or FC utilization, utilization of other system resources, etc. Example 1 Strict Bandwidth Allocation Policy [0428] In this example, the admission control policy states that 100 Mbit/s is reserved for premium content. No additional bandwidth is to be used for premium content. There are multiple logical conditions that must be detected and responses considered. 1000 Mbit/s is the maximum deliverable bandwidth. [0429] Under the admission control policy of this example, a premium stream will be admitted if the total premium bandwidth after admission will be less than or equal to 100 Mbit/s, but will be denied admission if the total premium bandwidth after admission will exceed 100 Mbit/s. A non-premium stream will be admitted if total non-premium bandwidth after admission will be less than or equal to 900 Mbit/s, but will be denied admission if the total non-premium bandwidth after admission will be greater than 900 Mbit/s. Example 2 Additional Premium Bandwidth Allocation Policy [0430] In this example, the admission control policy states that 100 Mbit/s is reserved for premium content, but premium content will be allowed to peak to 200 Mbit/s, where bandwidth allocation to premium content greater than 100 Mbit/s will generate incremental billable traffic. Bandwidth from non-premium content is decreased in support of any additional premium bandwidth admitted. Therefore, in this example the platform is not oversubscribed. [0431] Under the admission control policy of this example, a premium stream will be admitted if the total premium bandwidth after admission will be less than or equal to 200 Mbit/s, but will be denied admission if the total premium bandwidth after admission will exceed 200 Mbit/s. A log event will occur if total premium bandwidth admitted is greater than 100 Mbit/s. A non-premium stream will be admitted if total non-premium bandwidth after admission will be less than or equal to 800 Mbit/s, but will be denied admission if the total non-premium bandwidth after admission will be greater than 800 Mbit/s. Example 3 Bandwidth Allocation Policy with Oversubscription [0432] In this example, the admission control policy states that 100 Mbit/s is reserved for premium content. No additional bandwidth is to be used for premium content. Additional non-premium streams will be accepted if total bandwidth already being served is greater than 900 Mbit/s, and under the condition that premium users are NOT currently utilizing the full 100 Mbit/s. This scenario requires not only admission control behavior, but also requires system behavior modification should premium users request access when some of the 100 Mbit/s is being employed for non-premium streams. [0433] Under the admission control policy of this example, a premium stream will be admitted if the total premium bandwidth after admission will be less than or equal to 100 Mbit/s, but will be denied admission if the total premium bandwidth after admission will exceed 100 Mbit/s. If the new total bandwidth after admission of a new premium stream will be greater than 1000 Mbit/s, non-premium streams will be degraded so that the total delivered bandwidth will be less than or equal to 1000 Mbit/s. A non-premium stream will be admitted if total admitted bandwidth (i.e., premium plus non-premium) after admission will be less than or equal to 1000 Mbit/s, but will be denied admission if the total admitted bandwidth after admission will be greater than 1000 Mbit/s. [0434] To implement the policy of this example, bandwidth degradation of non-premium pool of streams may be accomplished, for example, by dropping one or more connections or typically more desirably, by degrading the rate at which one or more non-premium streams are delivered. In the latter case, once some of the premium bandwidth frees up, the non-premium streams may again be upgraded if so desired. [0435] The three forms of policies represented in the foregoing examples may be used to handle an almost infinite number of possible configurations of an information management system or platform, such as a system of the type described in relation to the embodiment of FIG. 7. Furthermore, it will be understood that the principles utilized by these examples may be extended to cover a variety of information management scenarios including, but not limited to, for content delivery of multiple premium ‘channels’, for content delivery of multiple levels of premium channel, for metering bandwidth from a device serving files for multiple customers (e.g., where the customers have different classes of service), etc. Furthermore, an information management system utilizing the methodology of the above examples may also include an optional utility as previously described herein that helps a HSP who is deploying the platform to choose an optimum configuration for maximizing revenue. [0436] It will be understood with benefit of this disclosure that although specific exemplary embodiments of hardware and software have been described herein, other combinations of hardware and/or software may be employed to achieve one or more features of the disclosed systems and methods. For example, various and differing hardware platform configurations may be built to support one or more aspects of deterministic functionality described herein including, but not limited to other combinations of defined and monitored subsystems, as well as other types of distributive interconnection technologies to interface between components and subsystems for control and data flow. Furthermore, it will be understood that operating environment and application code may be modified as necessary to implement one or more aspects of the disclosed technology, and that the disclosed systems and methods may be implemented using other hardware models as well as in environments where the application and operating system code may be controlled. [0437] Thus, while the invention may be adaptable to various modifications and alternative forms, specific embodiments have been shown by way of example and described herein. However, it should be understood that the invention is not intended to be limited to the particular forms disclosed. Rather, the invention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the appended claims. Moreover, the different aspects of the disclosed apparatus, systems and methods may be utilized in various combinations and/or independently. Thus the invention is not limited to only those combinations shown herein, but rather may include other combinations. What is claimed is: 1. A system for loading an executable image on to at least one image receiver, said system comprising: at least one image source, said image source having access to at least one executable image; and at least one image receiver coupled to said at least one image source by a distributed interconnect; wherein said at least one image source is capable of communicating said executable image to said at least one image receiver across said distributed interconnect for loading on to said at least one image receiver. 2. The system of claim 1, wherein said distributed interconnect comprises a switch fabric. 3. The system of claim 1, wherein said distributed interconnect comprises a virtual distributed interconnect. 4. The system of claim 2, wherein said executable image comprises a diagnostic image. 5. The system of claim 2, wherein said executable image comprises an initial image. 6. The system of claim 5, wherein said image source comprises a management processing engine, and wherein said image receiver comprises an application processing engine. 7. The system of claim 6, wherein said initial image comprises at least one of a boot code, an operating system, an application program interface, an application, , or a combination thereof. 8. The system of claim 6, wherein said image source and said image receiver comprise components of an information management system. 9. The system of claim 6, wherein said information management system comprises multiple image sources, multiple image receivers, or a combination thereof; and wherein said multiple image sources are coupled to at least one image receiver by said switch fabric, wherein said multiple image receivers are coupled to at least one image source by said switch fabric, or a combination thereof. 10. The system of claim 8, wherein said information management system comprises a content delivery system. 11. The system of claim 10, wherein said content delivery system comprises an endpoint content delivery system. 12. The system of claim 2, wherein said image source has access to a plurality of different executable images; wherein said image receiver comprises a first image receiver; and wherein said method comprises selecting and communicating a first one of said plurality of executable images from said image source to said first image receiver across said switch fabric. 13. The system of claim 12, wherein said method further comprises selecting and communicating a second one of said plurality of executable images from said image source across said switch fabric to a second image receiver coupled to said image source by said switch fabric. 14. The system of claim 2, wherein a first image source has access to a first executable image, and a second image source has access to a second executable image, said first and second executable images being different from each other; wherein said first and second image sources are coupled to said at least one image receiver by said switch fabric; and wherein said method comprises selecting and communicating at least one of said first or second executable images from said respective first or second image source to said image receiver across said switch fabric. 15. A method of loading an executable image on to at least one image receiver, said method comprising: communicating said executable image from at least one image source to said at least one image receiver; and loading said executable image on to said image receiver; wherein said at least one image source and said at least one image receiver are coupled together by a distributed interconnect; and wherein said executable image is communicated from said at least one image source to said at least one image receiver across said distributed interconnect. 16. The method of claim 15, wherein said distributed interconnect comprises a switch fabric. 17. The method of claim 15, wherein said distributed interconnect comprises a virtual distributed interconnect. 18. The method of claim 16, wherein said executable image comprises a diagnostic image. 19. The method of claim 16, wherein said executable image comprises an initial image. 20. The method of claim 19, wherein said image source comprises a management processing engine, and wherein said image receiver comprises an application processing engine. 21. The method of claim 20, wherein said initial image comprises at least one of a boot code, an operating system, an application program interface, an application, or a combination thereof. 22. The method of claim 20, wherein said image source and said image receiver comprise components of an information management system. 23. The method of claim 22, wherein said information management system comprises a content delivery system. 24. The method of claim 23, wherein said content delivery system comprises an endpoint content delivery system. 25. The method of claim 16, wherein said executable image remains quiescent after said loading on said image receiver; and wherein said method further comprises communicating an execution signal to said image receiver across said switch fabric, said execution signal instructing said image receiver to being execution of said executable image. 26. The method of claim 16, wherein said image source has access to a plurality of different executable images; wherein said image receiver comprises a first image receiver; and wherein said method comprises selecting and communicating a first one of said plurality of executable images from said image source to said first image receiver across said switch fabric. 27. The method of claim 26, wherein said method further comprises selecting and communicating a second one of said plurality of executable images from said image source across said switch fabric to a second image receiver coupled to said image source by said switch fabric. 28. The method of claim 16, wherein a first image source has access to a first executable image, and a second image source has access to a second executable image, said first and second executable images being different from each other; wherein said first and second image sources are coupled to said at least one image receiver by said switch fabric; and wherein said method comprises selecting and communicating at least one of said first or second executable images from said respective first or second image source to said image receiver across said switch fabric. 29. A system for interfacing a first processing object with a second processing object, said system comprising: a first processing engine, said first processing engine having said first processing object residing thereon; and a second processing engine coupled to said first processing engine by a distributed interconnect, said second processing engine having said second processing object residing thereon; wherein said second processing object is specific to said first processing object, and wherein said first object is capable of interfacing with said second object across said distributed interconnect. 30. The system of claim 29, wherein said distributed interconnect comprises a switch fabric. 31. The system of claim 29, wherein said distributed interconnect comprises a virtual distributed interconnect. 32. The system of claim 30, wherein said interfacing comprises accessing, managing, or a combination thereof. 33. The system of claim 32, wherein said first processing engine comprises an application processing engine; and wherein said second processing comprises a storage processing engine. 34. The system of claim 33, wherein said first processing object comprises an application object; and wherein said second processing object comprises a buffer/cache object that is specific to said application object. 35. The system of claim 33, wherein said first processing object comprises a file system object; and wherein said second processing object comprises a logical volume management object that is specific to said file system object. 36. The system of claim 34, wherein said first processing engine further has a file system object residing thereon, and said second processing engine further has a logical volume management object residing thereon; wherein said logical volume management object is specific to said file system object; and wherein said file system object is capable of interfacing with said logical volume management object across said distributed interconnect. 37. The system of claim 36, further comprising at least one content source coupled to said storage processing engine; and wherein said second processing engine is capable of providing said first processing engine with access to content available from said content source across said distributed interconnect. 38. The system of claim 33, wherein said first processing engine and said second processing engine comprise components of an information management system. 39. The system of claim 38 wherein said information management system comprises a content delivery system. 40. The system of claim 39, wherein said content delivery system comprises an endpoint content delivery system. 41. The system of claim 30, wherein said interfacing comprises managing, and wherein said managing occurs over said distributed interconnect via a separate designated communication path. 42. The system of claim 30, wherein said system comprises: at least two first processing engines, each of said first processing engines having at least one respective first processing object residing thereon; at least two second processing engines, each of said second processing engines having at least one respective second processing object residing thereon; wherein said first objects are capable of interfacing with said second objects across said distributed interconnect; wherein the characteristics of a given second processing object residing on at least one of said second processing engines differs from the characteristics of an other second processing object residing on an other one of said second processing engines; and wherein said given second processing object is specific to a given first processing object residing on at least one of said first processing engines, and wherein said other second processing object is specific to an other first processing object residing on at least one of said first processing engines. 43. The system of claim 42, wherein any one of said first processing engines is selectably interconnectable to any one of said second processing engines across said distributed interconnect so that a selected first processing object residing on one of said first processing engines may be selectably interfaced with a selected second processing object residing on one of said second processing engines that is specific to said selected first processing object. 44. The system of claim 43, wherein any one of said first processing engines is selectably interconnectable to any one of said second processing engines across said distributed interconnect so that a selected first processing object residing on one of said first processing engines may be selectably interfaced with a selected second processing object residing on one of said second processing engines on a dynamic basis. 45. The system of claim 44, wherein said selected first processing object is selectably interfaceable with said second processing object in response to a first request for information management, relative to selective interfacing operations between first processing objects and second processing objects in response to a second request for information management, in a manner based at least in part on one or more parameters associated with individual respective requests for information management. 46. The system of claim 43, wherein each of said first processing engines comprises a first application processing engine of a content delivery system, and wherein each of said second processing engines comprises a storage processing engine of said content delivery system; wherein said selected first processing object may be selectably interfaced with said selected second processing object to allow a first processing engine on which said selected first processing object resides to retrieve content from a content source using a second processing engine on which said selected second processing object resides. 47. The system of claim 46, wherein said selected first processing object comprises a selected application processing object and wherein said selected second processing object comprises a selected buffer/cache processing object specific to said selected application processing object; wherein said selected first processing object comprises a selected file system processing object and wherein said selected second processing object comprises a selected logical volume management processing object specific to said selected file system processing object; or a combination thereof. 48. The system of claim 47, wherein said content delivery system comprises an endpoint content delivery system. 49. A method of interfacing a first processing object with a second processing object, said method comprising interfacing said second processing object with said first processing object across a distributed interconnect; wherein said second processing object is specific to said first processing object. 50. The method of claim 49, wherein said first processing object resides on a first processing engine; wherein said second processing object resides on a second processing engine; and wherein said interfacing comprises coupling said first processing engine to said second processing engine using said distributed interconnect. 51. The method of claim 50, wherein said distributed interconnect comprises a switch fabric. 52. The method of claim 50, wherein said distributed interconnect comprises a virtual distributed interconnect. 53. The method of claim 51, wherein said interfacing comprises accessing, managing, or a combination thereof. 54. The method of claim 53, wherein said first processing engine comprises an application processing engine; and wherein said second processing comprises a storage processing engine. 55. The method of claim 54, wherein said first processing object comprises an application object; and wherein said second processing object comprises a buffer/cache object that is specific to said application object. 56. The method of claim 54, wherein said first processing object comprises a file system object; and wherein said second processing object comprises a logical volume management object that is specific to said file system object. 57. The method of claim 55, wherein said first processing engine further has a file system object residing thereon, and said second processing engine further has a logical volume management object residing thereon; wherein said logical volume management object is specific to said file system object; and wherein said method further comprises interfacing said logical volume management object with said file system object across said distributed interconnect. 58. The method of claim 57, wherein said storage processing engine is coupled to at least one content source; and wherein said method further comprises providing using said storage processing engine to provide said first processing engine with access to content available from said content source across said distributed interconnect. 59. The method of claim 54, wherein said first processing engine and said second processing engine comprise components of an information management system. 60. The method of claim 59, wherein said information management system comprises a content delivery system. 61. The method of claim 60, wherein said content delivery system comprises an endpoint content delivery system. 62. The method of claim 51, wherein said interfacing comprises managing, and wherein said managing occurs over said distributed interconnect via a separate designated communication path. 63. The method of claim 51, wherein: said first processing engine and said second processing engine comprise part of a system having at least two first processing engines and at least two second processing engines, each of said first processing engines having at least one respective first processing object residing thereon, and each of said second processing engines having at least one respective second processing object residing thereon; wherein the characteristics of a given second processing object residing on at least one of said second processing engines differs from the characteristics of an other second processing object residing on an other one of said second processing engines; wherein said given second processing object is specific to a given first processing object residing on at least one of said first processing engines, and wherein said other second processing object is specific to an other first processing object residing on at least one or said first processing engines; and wherein said interfacing comprises interfacing a first processing object residing on one of said first processing engines with a second processing object residing on one or said second processing engines. 64. The method of claim 63, wherein any one of said first processing engines is selectably interconnectable to any one of said second processing engines across said distributed interconnect, and wherein said interfacing comprises using said distributed interconnect to selectably interface a selected first processing object residing on one of said first processing engines with a selected second processing object residing on one of said second processing engines that is specific to said selected first processing object. 65. The method of claim 64, wherein said interfacing comprises selectably interfacing said selected first processing object with said second processing object on a dynamic basis. 66. The method of claim 65, wherein said method further comprises managing said selectable interfacing of said selected first processing object with said second processing object in response to a first request for information management, relative to selective interfacing operations between first processing objects and second processing objects in response to a second request for information management, in a manner based at least in part on one or more parameters associated with individual respective requests for information management. 67. The method of claim 64, wherein each of said first processing engines comprises a first application processing engine of a content delivery system, and wherein each of said second processing engines comprises a storage processing engine of said content delivery system; and wherein said method comprises selectably interfacing said selected first processing object with said selected second processing object to allow a first processing engine on which said selected first processing object resides to retrieve content from a content source using a second processing engine on which said selected second processing object resides. 68. The method of claim 67, wherein said selected first processing object comprises a selected application processing object and wherein said selected second processing object comprises a selected buffer/cache processing object specific to said selected application processing object; wherein said selected first processing object comprises a selected file system processing object and wherein said selected second processing object comprises a selected logical volume management processing object specific to said selected file system processing object; or a combination thereof. 69. The method of claim 68, wherein said content delivery system comprises an endpoint content delivery system. 70. A system for managing a processing object, said system comprising: a first processing engine, said first processing engine having at least one first processing object residing thereon; and a management entity coupled to said first processing engine by a distributed interconnect, said management entity capable of managing said first processing object residing on said first processing engine across said distributed interconnect. 71. The system of claim 70, wherein said distributed interconnect comprises a switch fabric. 72. The system of claim 70, wherein said distributed interconnect comprises a virtual distributed interconnect. 73. The system of claim 71, wherein said management entity comprises at least one of a separate processing engine, a separate system, a manual input, or a combination thereof. 74. The method of claim 73, wherein said management entity comprises a separate processing engine. 75. The system of claim 74, wherein said separate processing engine comprises a system management processing engine; wherein said first processing engine comprises a storage processing engine; and wherein said at least one first processing object comprises a buffer cache algorithm, logical volume management algorithm, or a combination thereof. 76. The system of claim 75, further comprising a second processing engine, said second processing engine being coupled to said first processing engine by said distributed interconnect; wherein said second processing engine has at least one second processing object residing thereon; wherein said first processing object is specific to said second processing object; and wherein said first processing object is capable of interfacing with said second processing object across said distributed interconnect. 77. The system of claim 76, wherein said second processing engine comprises an application processing engine; wherein said second processing object comprises an application object; and wherein said first processing object comprises a buffer/cache object that is specific to said application object. 78. The system of claim 76, wherein said second processing engine comprises an application processing engine; wherein said second processing object comprises a file system object; and wherein said first processing object comprises a logical volume management object that is specific to said file system object. 79. The system of claim 76, wherein said second processing engine comprises an application processing engine; wherein said at least one second processing object comprises an application object and a file system object; and wherein said at least one first processing object comprises a buffer/cache object that is specific to said application object, and a logical volume management object that is specific to said file system object. 80. The system of claim 77, wherein said first processing engine and said second processing engine comprise components of an information management system. 81. The system of claim 80, wherein said information management system comprises a content delivery system. 82. The system of claim 81, wherein said content delivery system comprises an endpoint content delivery system. 83. A method of managing at least one processing object, said method comprising managing said processing object across a distributed interconnect. 84. The method of claim 83, wherein said at least one processing object comprises a first processing object residing on a first processing engine; wherein said first processing engine is coupled to a management entity by said distributed interconnect; and wherein said managing comprises using said management entity to manage said first processing object across said distributed interconnect. 85. The method of claim 83, wherein said distributed interconnect comprises a switch fabric. 86. The method of claim 83, wherein said distributed interconnect comprises a virtual distributed interconnect. 87. The method of claim 85, wherein said management entity comprises at least one of a separate processing engine, a separate system, a manual input, or a combination thereof. 88. The method of method 87, wherein said management entity comprises a separate processing engine. 89. The method of claim 88, wherein said separate processing engine comprises a system management processing engine; wherein said first processing engine comprises a storage processing engine; and wherein said at least one first processing object comprises a buffer cache algorithm, logical volume management algorithm, or a combination thereof. 90. The method of claim 89, wherein a said second processing engine is coupled to said first processing engine by said distributed interconnect; wherein said second processing engine has at least one second processing object residing thereon; wherein said first processing object is specific to said second processing object; and wherein said method further comprises interfacing said first processing object with said second processing object across said distributed interconnect. 91. The method of claim 90, wherein said second processing engine comprises an application processing engine; wherein said second processing object comprises an application object; and wherein said first processing object comprises a buffer/cache object that is specific to said application object. 92. The method of claim 90, wherein said second processing engine comprises an application processing engine; wherein said second processing object comprises a file system object; and wherein said first processing object comprises a logical volume management object that is specific to said file system object. 93. The method of claim 90, wherein said second processing engine comprises an application processing engine; wherein said at least one second processing object comprises an application object and a file system object; and wherein said at least one first processing object comprises a buffer/cache object that is specific to said application object, and a logical volume management object that is specific to said file system object. 94. The method of claim 91, wherein said first processing engine and said second processing engine comprise components of an information management system. 95. The method of claim 94, wherein said information management system comprises a content delivery system. 96. The method of claim 95, wherein said content delivery system comprises an endpoint content delivery system. 97. A method of coordinating a group of multiple processing engines in the performance of an operating task, said method comprising broadcasting a multicast message to said group of multiple processing engines across a distributed interconnect, said multicast facilitating the performance of said operating task. 98. The method of claim 97, wherein said distributed interconnect comprises a switch fabric. 99. The method of claim 97, wherein said distributed interconnect comprises a virtual distributed interconnect. 100. The method of claim 98, wherein said operating task comprises a failover operation, a load-balancing operation, a debugging operation, an operation to monitor a status of one or more information management resources, or a combination thereof. 101. The method of claim 100, wherein said operating task comprises a failover operation; and wherein said method comprises broadcasting said multicast message across said distributed interconnect to keep one or more of said group of processing engines apprised of the status of one or more individual members of said group of processing engines. 102. The method of claim 101, wherein said method comprises using said one or more individual members of said group of multiple processing engines to broadcast periodic multicast communications to other members of said group of multiple processing engines to indicate normal operations; and wherein said method further comprises implementing said failover operation upon absence of said periodic multicast communications from a failed processing engine by using another processing engine to assume the load or tasks of said failed processing engine. 103. The method of claim 101, wherein said method comprises broadcasting a multicast failure alarm from a failed processing engine of said group of multiple processing engines to other members of said group of multiple processing engines; and wherein said method further comprises implementing said failover operation upon broadcast of said multicast failure alarm by using another processing engine to assume the load or tasks of said failed processing engine. 104. The method of claim 101, wherein said method comprises: using one or more designated members of said group of multiple processing engines to monitor and to detect failures of one or more other members of the group; upon detection of a failed processing engine, using said one or more designated members of said group of multiple processing engines to broadcast a multicast failure alarm to other members of said group of multiple processing engines; and wherein said method further comprises implementing said failover operation upon broadcast of said multicast failure alarm by using another processing engine to assume the load or tasks of said failed processing engine. 105. The method of claim 100, wherein said operating task comprises a load balancing operation; and wherein said method comprises broadcasting said multicast message across said distributed interconnect to keep said group of processing engines apprised of the status of one or more individual members of said group of processing engines. 106. The method of claim 105, wherein said method comprises using said one or more individual members of said group of multiple processing engines to broadcast multicast communications to other members of said group of multiple processing engines to indicate a workload level of said one or more individual members of said group of multiple processing engines; and wherein said method further comprises implementing said load balancing operation upon receipt of said multicast communications by transferring workload among two or more members of said group of multiple processing engines to balance workload level among said two or more members of said group of multiple processing engines. 107. The method of claim 100, wherein said multicast message comprises a multicast query from a given member of said group of multiple processing engines, said multicast query requesting information from one or more other members of said group of processing engines; and wherein said method further comprises implementing a failover operation, a load balancing operation, or a combination thereof among two or more members of said group of multiple processing engines upon receipt of said requested information by transferring workload among two or more members of said group of multiple processing engines based at least in part on said requested information. 108. The method of claim 105, wherein said method comprises: using one or more designated members of said group of multiple processing engines to monitor and to detect workload level of one or more other members of the group; upon detection of a workload level imbalance among said one or more other members of the group, using said one or more designated members of said group of multiple processing engines to broadcast a multicast communication to other members of said group of multiple processing engines to indicate a workload level of said one or more individual members of said group of multiple processing engines; and wherein said method further comprises implementing said load balancing operation upon receipt of said multicast communications by transferring workload among two or more members of said group of multiple processing engines to balance workload level among said two or more members of said group of multiple processing engines. 109. The method of claim 100, wherein said method comprises broadcasting said multicast message across said distributed interconnect to keep one or more of said group of processing engines apprised of one or more defined characteristics of one or more other members of said group of processing engines; wherein said defined characteristics comprise at least one of common processing characteristics, related processing characteristics, or a combination thereof. 110. The method of claim 109, wherein said method comprises using a given application running on one of said members of said group of processing engines to broadcast said multicast message; and wherein said multicast message comprises a multicast query for another instance of itself running on one or more other members of said group of processing engines. 111. The method of claim 109, wherein said method comprises using a given application running on one of said members of said group of processing engines to broadcast said multicast message; and wherein said multicast message comprises a multicast query for services or other application on which said given application depends running on one or more other members of said group of processing engines. 112. The method of claim 100, wherein said operating task comprises a debugging operation; wherein said multicast message comprises communications between two or more of said members of said group of multiple processing engines; and wherein said method comprises monitoring said multicast message using a given member of said group of multiple processing engines, and further comprising at least one of viewing, analyzing, or storing said multicast message on said given member of said group of multiple processing engines. 113. The method of claim 112, further comprising making said multicast message accessible on said given member of said group of multiple processing engines for debug analysis by human operator, further external processing and debug analysis, or a combination thereof. 114. The method of claim 112, further comprising performing debug analysis on said multicast message using said given member of said group of multiple processing engines. 115. The method of claim 114, further comprising using said given member of said group of multiple processing engines to identify problems with said software code, to take corrective action to address problems with said software code, to report an external alarm upon identification of problems with said software code, or a combination thereof. 116. The method of claim 114, wherein said two or more processing engines comprise an application processing engine, a storage processing engine, a transport processing engine, or a combination thereof; and wherein said given member of said group of multiple processing engines comprises a system management processing engine. 117. The method of claim 100, wherein said multiple processing engines comprise components of the same information management system, components of multiple information management systems, or a combination thereof. 118. The method of claim 100, wherein said multiple processing engines comprise components of a content delivery system. 119. The method of claim 118, wherein said content delivery system comprises an endpoint content delivery system. 120. A method of analyzing software code running on a first processing engine, said method comprising communicating debug information associated with said code from said first processing engine to a second processing engine across a distributed interconnect. 121. The method of claim 120, wherein said distributed interconnect comprises a switch fabric. 122. The method of claim 120, wherein said distributed interconnect comprises a virtual distributed interconnect. 123. The method of claim 121, further comprising at least one of viewing, analyzing, or storing said debug information on said second processing engine. 124. The method of claim 121, further comprising making said debug information accessible on said second processing engine for analysis by human operator, further external processing and analysis, or a combination thereof. 125. The method of claim 123, further comprising analyzing said debug information using said second processing engine. 126. The method of claim 123, wherein said distributed interconnect comprises a switch fabric; wherein said first processing engine comprises an application processing engine; and wherein said second processing engine comprises a system management processing engine. 127. The method of claim 123, wherein said distributed interconnect comprises a virtual distributed interconnect; wherein said first processing engine comprises an application processing functionality; wherein said second processing engine comprises a host processing functionality; wherein said application processing functionality and said host processing functionality are distributively interconnected across a network by said virtual distributed interconnect. 128. The method of claim 123, wherein said first and second processing engines comprise components of the same information management system, components of different information management systems, or a combination thereof. 129. The method of claim 1232, wherein said first and second processing engines comprise components of a content delivery system. 130. The method of claim 129, wherein said content delivery system comprises an endpoint content delivery system. 131. A method of managing the manipulation of information among a group of multiple processing engines in an information management environment, each of said processing engines being capable of performing one or more information manipulation tasks, said method comprising: receiving first and second requests for information management; selecting a first processing flow path among said group of processing engines in order to perform a first selected combination of information manipulation tasks associated with said first request for information management; and selecting a second processing flow path among said group of processing engines in order to perform a second selected combination of information manipulation tasks associated with said second request for information management; wherein said group of multiple processing engines are coupled together by a distributed interconnect, wherein said first processing flow path is different from said second processing flow path, and wherein said first and second processing flow paths are each selected using said distributed interconnect. 132. The method of claim 131, wherein said distributed interconnect comprises a switch fabric. 133. The method of claim 132, wherein each of said multiple processing engines is assigned separate information manipulation tasks in an asymmetrical multi-processor configuration. 134. The method of claim 133, wherein said distributed interconnect comprises a virtual distributed interconnect. 135. The method of claim 133, wherein said selecting of said first and second processing flow paths is based at least in part on respective first and second parameters associated with each of said first and second requests for information management, based at least in part on respective first and second parameters associated with the respective particular type of information management requested by each of said first and second requests for information management, based at least in part on respective first and second parameters associated with particular user and/or class of users generating each of said first and second requests for information management, based at least in part on respective first and second parameters associated with system workload implicated by each of said first and second requests for information management, or a combination thereof. 136. The method of claim 131, wherein said selecting of said first processing flow path is based at least in part on a respective first parameter associated with said first request for information management; and wherein said selecting of said second processing flow path is based at least in part on a respective second parameter associated with said second request for information management. 137. The method of claim 136, wherein at least one of said first and second parameters comprises a priority-indicative parameter. 138. The method of claim 136, wherein at least one of said first and second parameters comprises a parameter indicative of one or more selectable information manipulation tasks; and wherein a respective first or second processing flow path selected based at least in part on said parameter indicative of one or more selectable information manipulation tasks comprises a processing flow path that includes one or more processing engines capable of performing said one or more selectable information manipulation tasks. 139. The method of claim 138, wherein one or more processing engines of said first processing flow path are capable of performing one or more e of the same core information manipulation tasks as performed by one or more processing engines of said second processing flow path. 140. The method of claim 139, wherein said one or more selectable information manipulation tasks comprise at least one of data encryption, data compression, a security function, transcoding, content filtering, content transformation, filtering based on metadata, metadata transformation, or a combination thereof. 141. The method of claim 131, wherein one or more of said multiple processing engines is capable of recognizing one or more of said respective first and second parameters and is further capable of altering at least a portion of a processing flow path based upon said recognized parameter; and wherein said selecting of at least one of said first or said second processing flow paths comprises using said one or more of said multiple processing engines to recognize one or more of said respective first and second parameters and to alter at least a portion of at least one or said first or said second processing flow paths based at least in part upon said recognized parameter. 142. The method of claim 131, wherein said multiple processing engines comprise components of the same information management system, components of multiple information management systems, or a combination thereof. 143. The method of claim 132, wherein said multiple processing engines comprise components of a content delivery system; and wherein said information management comprises delivery of content. 144. The method of claim 143, wherein said content delivery system comprises an endpoint content delivery system. 145. The method of claim 143, wherein said selecting of said first and second processing flow paths is based at least in part on respective first and second parameters associated with each of said first and second requests for content delivery, on respective first and second parameters associated with the respective particular type of content delivery requested by each of said first and second requests for information management, on respective first and second parameters associated with particular user and/or class of users generating each of said first and second requests for delivery, on respective first and second parameters associated with system workload implicated by each of said first and second requests for content delivery, or a combination thereof. 146. The method of claim 143, wherein said selecting of said first processing flow path is based at least in part on a respective first parameter associated with said first request for information management; and wherein said selecting of said second processing flow path is based at least in part on a respective second parameter associated with said second request for information management. 147. The method of claim 146, wherein at least one of said first and second parameters comprises a priority-indicative parameter. 148. The method of claim 147, wherein at least one of said first and second parameters comprises a parameter indicative of one or more selectable information manipulation tasks; and wherein a respective first or second processing flow path selected based at least in part on said parameter indicative of one or more selectable information manipulation tasks comprises a processing flow path that includes one or more processing engines capable of performing said one or more selectable information manipulation tasks. 149. The method of claim 148, wherein one or more processing engines of said first processing flow path are capable of performing one or more of the same core information manipulation tasks as performed by one or more processing engines of said second processing flow path. 150. The method of claim 149, wherein said same core information manipulation tasks comprise information manipulation tasks performed by at least one of a network application processing engine, a network transport processing engine, a storage management processing engine, a network interface processing engine, or a combination thereof. 151. The method of claim 149, wherein said one or more selectable information manipulation tasks comprise at least one of data encryption, data compression, a security function, transcoding, content filtering, content transformation, filtering based on metadata, metadata transformation, or a combination thereof. 152. The method of claim 145, wherein one or more of said multiple processing engines is capable of recognizing one or more of said respective first and second parameters and is further capable of altering at least a portion of a processing flow path based upon said recognized parameter; and wherein said selecting of at least one of said first or said second processing flow paths comprises using said one or more of said multiple processing engines to recognize one or more of said respective first and second parameters and to alter at least a portion of at least one or said first or said second processing flow paths based at least in part upon said recognized parameter. 153. The method of claim 152, wherein said recognized parameter comprises a substantive characteristic associated with requested content. 154. The method of claim 153, wherein said substantive characteristic of said content comprises at least one of objectionable subject matter contained in said requested content, language of text contained in said requested content, security-sensitive information contained in said requested content, premium subject matter contained in said requested content, or a user-identified type of subject matter contained in said requested content.

2001-11-02

en

2002-08-29

US-202217741455-A

Secondary battery, battery module, and method for producing secondary battery ABSTRACT The secondary battery disclosed herein includes: a battery case; an electrode body accommodated in the battery case; a resin-cured product with which a space between the electrode body and a bottom of the battery case is filled and which is cured; an electrolyte accommodated in the battery case. A thermal conductivity of the resin-cured product is 0.2 W/(m·K) or more. BACKGROUND The present disclosure relates to a secondary battery, a battery module, and a method for producing a secondary battery. Priority is claimed on Japanese Patent Application No. 2021-081646, filed on May 13, 2021, the content of which is incorporated in the present specification as a whole by reference. Japanese Patent Application Laid-open No. 2002-231297 and Japanese Patent Application Laid-open No. 2006-093130 disclose a technique for holding an electrode body in a battery housing. Japanese Patent Application Laid-open No. 2002-231297 discloses an assembled battery in which a plurality of power generation elements are arranged in a horizontal direction and these power generation elements are connected in parallel and accommodated in a battery case. According to Japanese Patent Application Laid-open No. 2002-231297, it is possible to suppress displacement or movement of the power generation elements in the battery case by filling all or a part of gaps between these power generation elements and the battery case with an insulating filler. Japanese Patent Application Laid-open No. 2006-093130 discloses a lithium secondary battery including a heat-resistant member in the lower portion of an electrode assembly or at the bottom inside a can accommodating an electrode assembly. According to Japanese Patent Application Laid-open No. 2006-093130, it is possible to protect the electrode assembly more safely by including the heat-resistant member at the bottom inside the can. SUMMARY Incidentally, it is necessary for secondary batteries to release heat generated from electrode bodies when the secondary batteries are used. In addition, in a battery module in which a plurality of secondary batteries are arranged in one direction, it is preferable that heat generated in one secondary battery be less likely to be transferred to an adjacent secondary battery. The present inventors want to propose a secondary battery having improved heat dissipation performance. A secondary battery disclosed herein includes: a battery case; an electrode body accommodated in the battery case; a resin-cured product with which a space between the electrode body and a bottom of the battery case is filled and which is cured; and an electrolyte accommodated in the battery case. A thermal conductivity of the resin-cured product is 0.2 W/(m·K) or more. Such a secondary battery has improved heat dissipation performance. The electrode body may be a wound electrode body in which a sheet-shaped positive electrode plate and negative electrode plate are stacked with separators therebetween and wound. The wound electrode body may have a pair of curved portions whose outer surfaces are curved surfaces. Of the curved portions, a part of the curved portion facing the bottom of the battery case may be embedded in the resin-cured product. The resin-cured product may be a cured product of a silicone resin. A battery module disclosed herein includes: a plurality of unit batteries arranged in one direction; and a cooling mechanism. The above-described secondary batteries may be used as the plurality of unit batteries. Surfaces of the plurality of unit batteries on the other side of the bottoms of the battery cases may be connected to the cooling mechanism. The cooling mechanism may have a pipe through which a refrigerant passes. A method for producing a secondary battery includes: preparing a battery case; preparing an electrode body; preparing an electrolyte; preparing a liquid or semi-solid resin; introducing the resin into the battery case up to a predetermined height; accommodating the electrode body in the battery case; and injecting the electrolyte into the battery case after the resin is cured. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a perspective view schematically showing a secondary battery 100; FIG. 2 is a cross-sectional view showing cross section II-II of FIG. 1; FIG. 3 is a cross-sectional view showing cross section III-III of FIG. 1; FIG. 4 is a schematic view showing a configuration of a wound electrode body 40; and FIG. 5 is a schematic view showing a battery module 110. DESCRIPTION OF THE EMBODIMENT Hereinafter, an embodiment of a technique disclosed herein will be described with respect to the drawings. The embodiment described herein is as a matter of course not intended to particularly limit the present disclosure. Unless otherwise specified, the present disclosure is not limited to the embodiment described herein. Each drawing is drawn schematically and does not necessarily reflect the real thing. In addition, members and portions having the same action will be appropriately denoted by the same reference numerals, and the description thereof will not be repeated. In addition, the notation such as “A to B” indicating a numerical range means “A or more and B or less” unless otherwise specified. In addition, dimensional relationships (between a length, a width, a thickness, and the like) in the drawings do not reflect actual dimensional relationships. A reference numeral X in each drawing referred to in the present specification indicates a “depth direction” or an “arrangement direction”, a reference numeral Y indicates a “width direction”, and a reference numeral Z indicates a “height direction”. In addition, in the depth direction X and the arrangement direction X, F indicates “front” and Rr indicates “rear”. In the width direction Y, L indicates “left” and R indicates “right”. In the height direction Z, U indicates “up” and D indicates “down”. However, these directions are defined for convenience of explanation and are not intended to limit installation forms during use of the secondary battery disclosed herein. The “secondary battery” in the present specification refers to a general power storage device in which a charge-discharge reaction is caused by a charge carrier moving between a pair of electrodes (a positive electrode and a negative electrode) via an electrolyte. Such a secondary battery includes not only so-called storage batteries such as a lithium ion secondary battery, nickel-hydrogen battery, and a nickel-cadmium battery but also a capacitor such as an electric double-layer capacitor. Secondary Battery 100 Hereinafter, the secondary battery disclosed herein will be described together with a method for producing a lithium ion secondary battery with reference to the appropriate drawings. FIG. 1 is a perspective view schematically showing a secondary battery 100. FIG. 2 is a cross-sectional view showing cross section II-II of FIG. 1. FIG. 3 is a cross-sectional view showing cross section III-III of FIG. 1. FIG. 4 is a schematic view showing a configuration of a wound electrode body 40. As shown in FIGS. 2 and 3, the secondary battery 100 includes a battery case 50, an electrode body 40, a resin-cured product 46, and an electrolyte 48. A method for producing a secondary battery 100 disclosed herein includes the following steps (a) to (g): (a) preparing a battery case 50; (b) preparing an electrode body 40; (c) preparing an electrolyte 48; (d) preparing a liquid or semi-solid resin: (e) introducing the resin into the battery case 50 up to a predetermined depth; (f) accommodating the electrode body 40 in the battery case 50; and (g) injecting the electrolyte 48 into the battery case 50 after the resin is cured. Step (a): Preparing Battery Case 50 In Step (a), the battery case 50 to accommodate the electrode body 40, the resin-cured product 46, and the electrolyte 48 is prepared. As shown in FIG. 1, the battery case 50 has a flat bottomed rectangular parallelepiped (rectangular) outer shape. Conventionally well-known materials can be used in the battery case 50 without particular limitation. For example, the battery case 50 may be made of a metal. Examples of such materials of the battery case 50 include aluminum, aluminum alloy, iron, and iron alloy. An aluminum alloy is preferably used for the battery case 50. The battery case 50 includes an exterior body 52 and a sealing body 54. The exterior body 52 is a flat bottomed rectangular container having an opening 52 h (refer to FIG. 2) on its upper surface. The exterior body 52 includes a substantially rectangular plane-shaped bottom wall 52 a, a pair of long side walls 52 b extending upward in the height direction Z from long sides of the bottom wall 52 a, and a pair of short side walls 52 c extending upward in the height direction Z from short sides of the bottom wall 52 a. On the other hand, the sealing body 54 is a plate-like member which has a substantially rectangular plane shape and closes the opening 52 h of the exterior body 52. An outer peripheral edge portion of the sealing body 54 is joined to (for example, welded to) an outer peripheral edge portion of the opening 52 h of the exterior body 52. Accordingly, the battery case 50 whose inside is airtightly sealed is manufactured. In addition, a liquid injection hole 55 and a gas discharge valve 57 are provided in the sealing body 54. The liquid injection hole 55 is a through-hole which is provided for injecting an electrolyte into the battery case 50 after sealing. The liquid injection hole 55 is sealed by a sealing member 56 after an electrolyte is injected. In addition, the gas discharge valve 57 is a thin-walled part designed to break (open) when a large amount of gas is generated in the battery case 50 to discharge the gas. A positive electrode terminal 60 is attached to one end portion of the sealing body 54 in the width direction Y. A negative electrode terminal 65 is attached to the other end portion of the sealing body 54 in the width direction Y. As shown in FIG. 2, the positive electrode terminal 60 and the negative electrode terminal 65 are inserted into terminal insertion holes 58 and 59 of the sealing body 54 on which gaskets 90 are mounted, and lower end portions 60 c and 65 c extend inside the battery case 50. The positive electrode terminal 60 is connected to a positive electrode external conductive member 62 at the outside of the battery case 50. The negative electrode terminal 65 is connected to a negative electrode external conductive member 67 at the outside of the battery case 50. The external conductive members (the positive electrode external conductive member 62 and the negative electrode external conductive member 67) are plate-shaped members attached to the outer surface of the sealing body 54 via external insulation members 92. The external conductive members 62 and 67 are members connected to other secondary batteries or external devices via external connection members (such as a bus bar). The external conductive members are preferably made of a metal (such as aluminum, aluminum alloy, copper, or copper alloy) having excellent conductivity. The positive electrode terminal 60 and the negative electrode terminal 65 are connected to the electrode body 40 via a positive electrode current collector 70 and a negative electrode current collector 75, respectively. The positive electrode current collector 70 includes a positive electrode first current collector 71 and a positive electrode second current collector 72. The negative electrode current collector 75 includes a negative electrode first current collector 76 and a negative electrode second current collector 77. The first current collectors (the positive electrode first current collector 71 and the negative electrode first current collector 76) are plate-like conductive members extending in the width direction Y. The first current collectors 71 and 76 are attached to the inner surface of the sealing body 54 via internal insulation members 94. The first current collectors 71 and 76 are respectively connected to the lower end portions 60 c and 65 c. The positive electrode second current collector 72 and the negative electrode second current collector 77 are plate-like conductive members extending in the height direction Z. The positive electrode second current collector 72 and the negative electrode second current collector 77 are respectively connected to a positive electrode tab group 42 and a negative electrode tab group 44 of the electrode body 40 which will be described later. A metal (such as aluminum, aluminum alloy, copper, or copper alloy) having excellent conductivity is suitably used for the positive electrode current collector 70 and the negative electrode current collector 75. Each internal insulation member 94 includes: a plate-like base portion 94 a interposed between the first current collectors 71 and 76 and the inner surface of the sealing body 54; and a protruding portion 94 b protruding from the inner surface of the sealing body 54 toward the wound electrode body 40. The protruding portion 94 b regulates movement of the wound electrode body 40 in the height direction Z. Accordingly, the wound electrode body 40 and the sealing body 54 are prevented from coming into direct contact with each other. The above-described gasket 90, external insulation member 92, and internal insulation member 94 are not particularly limited as long as they have predetermined insulation properties. As an example, synthetic resin materials such as polyolefin resins (for example, polypropylene (PP) and polyethylene (PE)), fluorine resins (for example, perfluoroalkoxy alkane (PFA) and polytetrafluoroethylene (PTFE)) can be used. Step (b): Step of Preparing Electrode Body 40 In Step (b), the electrode body 40 accommodated in the battery case 50 is prepared. In this embodiment, the electrode body 40 is the wound electrode body 40 in which a positive electrode plate 10 and a negative electrode plate 20 are stacked with separators 30 therebetween and wound as shown in FIG. 4. The wound electrode body 40 has a flat shape and has a pair of curved portions 40 r having a curved outer surface and a flat portion 40 f having a flat outer surface connecting the pair of curved portions 40 r (refer to FIG. 3). The wound electrode body 40 can be produced, for example, through the following procedure. First, a stacked body obtained by stacking the separator 30, the negative electrode plate 20, the separator 30, and the positive electrode plate 10 in this order is produced. Next, the tubular wound electrode body 40 is produced by winding the produced stacked body. The tubular wound electrode body 40 can be pressed to produce a flat-shaped wound electrode body 40 having the curved portions 40 r and the flat portion 40 f. The wound electrode body 40 is accommodated in the battery case 50 in a state of being covered with an insulating film or the like not shown in the drawing. In this embodiment, the wound electrode body 40 is accommodated in the battery case 50 so that a winding axis WL of the wound electrode body 40 and the width direction Y of the secondary battery 100 substantially coincide with each other (refer to FIG. 2). The positive electrode plate 10 is along strip-like member. The positive electrode plate 10 includes a positive electrode core body 12 which is a strip-like metal foil and a positive electrode active material layer 14 formed on the surface of the positive electrode core body 12. From the viewpoint of battery performance, the positive electrode active material layer 14 is preferably applied to both surfaces of the positive electrode core body 12. In the positive electrode plate 10, positive electrode tabs 12 t protrude outward (left side in FIG. 4) from one end side in the winding axis direction WL (width direction Y). A plurality of the positive electrode tabs 12 t are formed at predetermined intervals in the longitudinal direction of the positive electrode plate 10. The positive electrode tabs 12 t are regions to which the positive electrode active material layer 14 is not applied and in which the positive electrode core body 12 is exposed. The plurality of positive electrode tabs 12 t are stacked at one end portion in the width direction Y to form the positive electrode tab group 42. Conventionally well-known materials that can be used in general secondary batteries (for example, lithium ion secondary batteries) can be used for each member constituting the positive electrode plate 10 without particular limitation. For example, metallic materials having conductivity can be preferably used for the positive electrode core body 12. The positive electrode core body 12 is preferably made of, for example, aluminum or aluminum alloy. The positive electrode active material layer 14 is a layer containing a positive electrode active material. The positive electrode active material is a particulate material that can reversibly store and release charge carriers. From the viewpoint of stably producing a high-performance positive electrode plate 10, lithium transition metal composite oxide is suitable for a positive electrode active material. As lithium transition metal composite oxide, lithium transition metal composite oxide containing at least one of the group consisting of nickel (Ni), cobalt (Co), and manganese (Mn) is suitably used, for example. Specific examples include a lithium-nickel-cobalt-manganese composite oxide (NCM), lithium-nickel composite oxide, lithium-cobalt composite oxide, lithium-manganese composite oxide, lithium-nickel-manganese composite oxide, lithium-nickel-cobalt-aluminum composite oxide (NCA), and lithium-iron-nickel-manganese composite oxide. In addition, the positive electrode active material layer 14 may contain an additive in addition to the positive electrode active material. Examples of additives include a conductive material and a binder. Specific examples of conductive materials include a carbon material such as acetylene black (AB). Specific examples of binders include a resin binder such as polyvinylidene fluoride (PVdF). The negative electrode plate 20 is a long strip-like member. The negative electrode plate 20 includes a negative electrode core body 22 which is a strip-like metal foil and a negative electrode active material layer 24 formed on the surface of the negative electrode core body 22. From the viewpoint of battery performance, the negative electrode active material layer 24 is preferably applied to both surfaces of the negative electrode core body 22. In the negative electrode plate 20, negative electrode tabs 22 t protrude outward (right side in FIG. 4) from one end side in the winding axis direction WL (width direction Y). A plurality of the negative electrode tabs 22 t are formed at predetermined intervals in the longitudinal direction of the negative electrode plate 20. The negative electrode tabs 22 t are regions to which the negative electrode active material layer 24 is not applied and in which the negative electrode core body 22 is exposed. The plurality of negative electrode tabs 22 t are stacked at one end portion in the width direction Y to form the negative electrode tab group 44. Conventionally well-known materials that can be used in general secondary batteries (for example, lithium ion secondary batteries) can be used for each member constituting the negative electrode plate 20 without particular limitation. For example, metallic materials having conductivity can be preferably used for the negative electrode core body 22. The negative electrode core body 22 is preferably made of, for example, copper or copper alloy. The negative electrode active material layer 24 is a layer containing a negative electrode active material. The negative electrode active material is not particularly limited as long as it can reversibly store and release charge carriers in relation to the above-described positive electrode active material, and materials that can be conventionally used in general secondary batteries can be used for the negative electrode active material without particular limitation. Examples of negative electrode active materials include a carbon material and a silicon-based material. As carbon materials, graphite, hard carbon, soft carbon, and amorphous carbon can be used, for example. Examples of silicon-based materials include silicon and silicon oxide. In addition, the negative electrode active material layer 24 may contain an additive in addition to the negative electrode active material. Examples of additives include a binder and a thickener. Specific examples of binders include a binder based on rubber such as styrene butadiene rubber (SBR). In addition, specific examples of thickeners include carboxymethyl cellulose (CMC). The separators 30 are insulation sheets in which a plurality of fine through-holes through which charge carriers pass are formed. By interposing these separators 30 between the positive electrode plate 10 and the negative electrode plate 20, it is possible to prevent contact between the positive electrode plate 10 and the negative electrode plate 20 and to move charge carriers (for example, lithium ions) between the positive electrode plate 10 and the negative electrode plate 20. As the separators 30, those used for conventionally well-known secondary battery separators can be used without particular limitation. For example, porous sheets made of resins including polyolefin resins such as polyethylene (PE) and polypropylene (PP) can be used as the separators 30. The separators 30 may have a heat resistant layer (HRL) containing an inorganic filler on its surface. As inorganic fillers, alumina, boehmite, aluminum hydroxide, and titania can be used, for example. Step (c): Step of Preparing Electrolyte 48 In Step (c), the electrolyte 48 accommodated in the battery case 50 is prepared (refer to FIG. 2). As the electrolyte 48, those used in conventionally well-known secondary batteries can be used without particular limitation. For example, a non-aqueous electrolyte in which supporting salts are dissolved in a non-aqueous solvent can be used as an electrolyte. Examples of such non-aqueous solvents include carbonate solvents such as ethylene carbonate, dimethyl carbonate, and ethyl methyl carbonate. Examples of supporting salts include fluorine-containing lithium salts such as LiPF6. Step (d): Step of Preparing Resin In Step (d), a liquid or semi-solid resin which becomes the resin-cured product 46 after curing is prepared as shown in FIG. 3. Hereinafter, the resin prepared in Step (d) is also appropriately referred to as an “uncured resin” or a “resin” The uncured resin is a resin which is introduced into the battery case 50 in a liquid or semi-solid state to be cured. The uncured resin is a resin which becomes the resin-cured product 46 having properties described below after curing. The viscosity of the uncured resin is, for example, about 200 Pa·s to 320 Pa·s. The type of uncured resin is not particularly limited unless otherwise specified, but a silicone resin, an epoxy resin, or a phenol resin can be used, for example. From the viewpoints of insulation properties and heat resistance, a silicone resin can be suitably used. In addition, a method for curing a resin is not particularly limited. For this reason, a resin such as a two-liquid mixed resin, a thermosetting resin, a normal-temperature curable resin, or a photocurable resin can be used as the uncured resin. In addition, the uncured resin may contain additives such as an inorganic filler, as necessary. As the uncured resin, a plurality of types of resins may be mixed and used. The resin-cured product 46 obtained by curing an uncured resin is placed between the electrode body 40 and a bottom 52 d of the battery case 50. The resin-cured product 46 is an elastic body having insulation properties. The resin-cured product 46 preferably has elasticity comparable to that of rubber (for example, an elastic modulus of about 1 to 20 MPa). In addition, the resin-cured product 46 is accommodated in the battery case 50 together with the electrolyte 48 and therefore preferably has electrolyte resistance. The resin-cured product 46 obtained by curing an uncured resin transfers heat to the battery case 50 when heat is generated in the electrode body 40 due to charging, discharging, and the like of the secondary battery 100. Since the resin-cured product 46 covers the bottom 52 d of the battery case 50, heat is particularly likely to be transferred to the bottom wall 52 a. The resin-cured product 46 may have a required thermal conductivity so as to efficiently transfer heat. The thermal conductivity of the resin-cured product 46 may be 0.2 W/(m·K) or more, preferably 0.5 W/(m·K) or more and more preferably 1 W/(m·K) or more, and may be, for example, 2 W/(m·K) or more. In addition, the thermal conductivity of the resin-cured product 46 may be 20 W/(m·K) or less and may be, for example, 10 W/(m·K). The thermal conductivity of the resin-cured product 46 is obtained through a method according to ASTM D5470. A CGW series manufactured by Sekisui Chemical Co., Ltd. is used as a resin which becomes the resin-cured product 46 having such properties after curing, for example. CGW-2 manufactured by Sekisui Chemical Co., Ltd. is used as an uncured resin, for example. CGW-2 is a resin having a thermal conductivity of 2 W/(m·K) and is a resin which is completely cured by being left at room temperature (about 25° C.) for about 24 hours after mixing. Step (e): Step of Introducing Resin into Battery Case 50 Up to Predetermined Depth In Step (e), the resin prepared in Step (d) is introduced into the battery case 50 up to a predetermined height. A space between the electrode body 40 and the bottom 52 d of the battery case 50 is filled with the resin. The introduction of the resin can be performed through a well-known method and can be performed, for example, using a syringe or the like. In this embodiment, the resin prepared in Step (d) is a two-liquid mixed resin. In Step (e), the resin is mixed and introduced into the battery case 50. When the electrode body 40 is accommodated in the battery case 50, the resin is introduced into the battery case up to a height at which at least a lower end 40 d of the electrode body 40 is embedded in the resin-cured product 46 after curing. That is, the resin is introduced into the battery case 50 so that the height of an upper end 46 u of the resin-cured product 46 is higher than or equal to the height of the lower end 40 d of the accommodated electrode body 40 when the bottom 52 d of the battery case is used as a reference. Accordingly, the electrode body 40 is held inside the battery case 50 by the resin-cured product 46. The height of a resin to be introduced is not particularly limited because it also depends on the viscosity of the resin before curing, the viscosity of the resin after curing, and the like. However, the resin is preferably introduced into the battery case up to the minimum height at which the electrode body 40 is held by the resin-cured product 46. In addition, from the viewpoint of injecting the electrolyte 48 in the subsequent step and impregnating the electrode body 40 with the electrolyte, the electrode body 40 is preferably not embedded too much in the resin. For example, it is preferable that a part of a curved portion 40 r 1 facing the bottom 52 d of the battery case 50 be embedded in the resin-cured product 46. That is, the resin is preferably introduced such that the upper end 46 u of the resin-cured product 46 reaches between the lower end 40 d of the electrode body 40 and a starting portion 40 r 2 of the curved portion 40 r 1. Step (f): Step of Accommodating Electrode Body 40 in Battery Case 50 In Step (f), the electrode body 40 prepared in Step (b) is accommodated in the battery case 50. Step (f) includes curing the resin introduced in Step (e). In Step (f), the electrode body 40 is accommodated in the battery case 50 before the resin introduced in Step (e) is cured. The electrode body 40 is accommodated in the exterior body 52 in a state of being attached to the sealing body 54, for example, as follows. As shown in FIG. 2, the positive electrode tab group 42 and the negative electrode tab group 44 of the electrode body 40 are respectively welded to the positive electrode second current collector 72 of the positive electrode current collector 70 and the negative electrode second current collector 77 of the negative electrode current collector 75. The electrode body 40 attached to the sealing body 54 is accommodated in the exterior body 52 through the opening 52 h. The electrode body 40 is accommodated in the battery case 50 by joining (for example, welding) an outer peripheral edge portion of the sealing body 54 to a peripheral edge portion of the opening 52 h of the exterior body 52. When the electrode body 40 is accommodated in the battery case 50, a part of the electrode body 40 is embedded in an uncured resin in the battery case 50. By curing the uncured resin in this state, a resin-cured product 46 with which the space between the electrode body 40 and the bottom 52 d of the battery case 50 is filled and which is cured is formed. The method for curing an uncured resin is not particularly limited and is appropriately set depending on the type of resin or the like. For example, after the sealing body 54 is welded to the exterior body 52, a resin may be cured by leaving the battery case 50 in which the electrode body 40 is accommodated in a state in which the electrode body is heated to 60° C. for 5 to 10 hours. In a case where a thermosetting resin is used, the battery case 50 may be heated to a temperature at which the material of the electrode body 40 is not damaged to cure the resin. For example, the battery case may be heated at 160° C. or lower, 100° C. or lower, or 80° C. or lower. In this embodiment, after the resin is cured, the resin-cured product 46 covers the entire surface of the bottom 52 d of the battery case 50. A part of the electrode body 40 is embedded in the resin-cured product 46. Of the curved portions 40 r, a part of the curved portion 40 r 1 facing the bottom 52 d of the battery case 50 is embedded in the resin-cured product 46 as shown in FIG. 3. Since the resin is cured after the electrode body 40 is accommodated, the adhesiveness between the electrode body 40 and the resin-cured product 46 is favorable in the region embedded in the resin-cured product 46. Step (g): Injecting Electrolyte 48 into Battery Case 50 after Resin is Cured In Step (g), the electrolyte 48 prepared in Step (c) is injected in the battery case 50 after the resin is cured. The injection of the electrolyte 48 can be performed through a well-known method. For example, the battery case 50 having the electrode body 40 and the resin-cured product 46 inside may be placed in a vacuum chamber, and the inside of the battery case 50 may be depressurized by depressurizing the inside of the vacuum chamber to inject the electrolyte 48. The electrode body 40 is impregnated with the injected electrolyte 48 from gaps of both end portions in the width direction Y toward the center (refer to FIG. 2). As described above, the lower end 40 d of the electrode body 40 is embedded in the resin-cured product 46. That is, it is unnecessary to fill the space between the lower end 40 d of the electrode body 40 and the bottom 52 d of the battery case 50 with the electrolyte 48. For this reason, the amount of the electrolyte 48 with which the electrode body 40 is impregnated can be reduced compared to secondary batteries having a configuration with a space between a lower end of an electrode body and a bottom of a battery case. An injection port of the battery case 50 is sealed when the injection of the electrolyte 48 is completed. After the injection port is sealed, the battery case 50 (electrode assembly) having the electrode body 40, the resin-cured product 46, and the electrolyte 48 inside is subjected to initial charging and aging treatment according to a well-known method to produce the secondary battery 100. The secondary battery 100 includes, as described above, the electrode body 40 accommodated in the battery case 50 and the resin-cured product 46 with which the space between the electrode body 40 and the bottom 52 d of the battery case 50 is filled and which is cured. In addition, the thermal conductivity of the resin-cured product 46 is 0.2 W/(m·K) or more. For this reason, even when, for example, heat is generated in the electrode body 40 through charging and discharging of the secondary battery 100, the generated heat can be efficiently dissipated toward the bottom wall 52 a without being accumulated inside the battery case 50. In addition, the electrode body 40 is held in the battery case 50 by the resin-cured product 46 with which the space between the electrode body 40 and the bottom 52 d of the battery case 50 is filled and which is cured. That is, the durability when an external load such as vibration is applied to the secondary battery 100 is improved without providing a complicated holding structure in the battery case 50. In the above-described embodiment, the electrode body 40 is the wound electrode body 40 in which the sheet-shaped positive electrode plate 10 and negative electrode plate 20 are stacked with the separators 30 therebetween and wound (refer to FIG. 4). In the wound electrode body 40, a part of the curved portion 40 rl facing the bottom 52 d of the battery case 50 is embedded in the resin-cured product 46. With such a configuration, an effect of improving heat dissipation or durability is suitably exhibited while the impregnation rate of the electrolyte 48 is maintained. In addition, in the above-described production method, the electrode body 40 is accommodated in the battery case 50 after an uncured resin is introduced into the battery case 50 up to a predetermined height. For this reason, the adhesiveness between the electrode body 40 and the resin-cured product 46 is favorable in the region embedded in the resin-cured product 46 of the electrode body 40. As a result, heat resistance between the electrode body 40 and the resin-cured product 46 is suppressed to a low level, and a secondary battery 100 with favorable heat dissipation efficiency is produced. The secondary battery 100 disclosed herein is also used as a unit battery of a battery module. FIG. 5 is a schematic view showing a battery module 110. The battery module 110 includes: a plurality of unit batteries arranged in one direction; and a cooling mechanism 80. The above-described secondary batteries 100 (hereinafter, also referred to as “unit batteries 100”) are used as the plurality of unit batteries. Here, a form in which the unit batteries 100 are arranged in a row in the X-direction is exemplified. Surfaces of the unit batteries 100 on the other side of the bottoms 52 d (refer to FIG. 3) covered with the resin-cured product 46, that is, outer surfaces of the bottom walls 52 a are connected to the cooling mechanism 80. The method for connecting the unit batteries 100 to the cooling mechanism 80 is not particularly limited. The unit batteries 100 may be connected to the cooling mechanism 80 using, for example, an adhesive. Alternatively, the unit batteries may be connected to the cooling mechanism 80 by restraining the upper surfaces of the sealing bodies 54 and the bottom surface of the cooling mechanism 80 with restraining members (not shown in the drawing) along the short side walls 52 c (refer to FIG. 1) of the unit batteries 100. As shown in FIG. 5, the plurality of unit batteries 100 are electrically connected to adjacent unit batteries 100 via bus bars 82. In this embodiment, a positive electrode terminal 60 and a negative electrode terminal 65 on adjacent unit batteries 100 are connected to each other via a bus bar 82. Spacers 84 are interposed between the plurality of unit batteries 100. A pair of end plates 86 are arranged at both ends of the battery module 110 in the arrangement direction X. A restraining member 88 is attached to the pair of end plates 86. A required restraining pressure is applied to the unit batteries 100, the spacers 84, and the end plates 86 by the restraining member 88. The cooling mechanism 80 is a mechanism for cooling the plurality of unit batteries 100 connected to each other. The cooling mechanism 80 is not particularly limited as long as it can cool the bottom wall 52 a of the unit batteries 100. A metal plate having a refrigerant pipe through which a refrigerant passes may be used as the cooling mechanism 80, for example. The unit batteries 100 are cooled by supplying the refrigerant to the refrigerant pipe. The cooling mechanism 80 is preferably made of a metal having a high thermal conductivity so that heat generated from the unit batteries 100 can be efficiently cooled. From the viewpoint of weight reduction, aluminum, aluminum alloy, or the like can be preferably used. In the unit batteries 100 used in the battery module 110, heat generated from the electrode bodies 40 is likely to be transferred toward the bottom walls 52 a through the resin-cured products 46 (refer to FIG. 3). The outer surfaces of the bottom walls 52 a are connected to the cooling mechanism 80. As a result, the battery module 110 can efficiently dissipate the heat generated from the electrode bodies 40 to the cooling mechanism 80. For example, even in a case where a defect occurs in one unit battery 100 and heat is generated, the heat is likely to be transferred downward in the height direction Z instead of the arrangement direction X in which the plurality of unit batteries 100 are arranged. As a result, the heat is less likely to propagate to other unit batteries 1X), thereby improving the safety of the battery module 110. In addition, as shown in FIG. 3, the electrode body 40 is held by the resin-cured product 46 from the lower end 40 d side. For example, by arranging the electrode body 40 so as to leave a gap between the electrode body 40 and the long side walls 52 b of the battery case 50, it is possible to make it difficult for heat to be transferred to adjacent unit batteries 100 (refer to FIG. 5) even when the electrode body 40 expands due to charging and discharging. Specific examples of the present disclosure are described in detail in the preceding, but these are nothing more than examples and do not limit the scope of the claims. The disclosure disclosed herein include various modifications and changes of the above-described specific examples. What is claimed is: 1. A secondary battery comprising; a battery case; an electrode body accommodated in the battery case; a resin-cured product with which a space between the electrode body and a bottom of the battery case is filled and which is cured; and an electrolyte accommodated in the battery case, wherein a thermal conductivity of the resin-cured product is 0.2 W/(m·K) or more. 2. The secondary battery according to claim 1, wherein the electrode body is a wound electrode body in which a sheet-shaped positive electrode plate and negative electrode plate are stacked with separators therebetween and wound. 3. The secondary battery according to claim 2, wherein the wound electrode body has a pair of curved portions whose outer surfaces are curved surfaces, and wherein, of the curved portions, a part of the curved portion facing the bottom of the battery case is embedded in the resin-cured product. 4. The secondary battery according to claim 1, wherein the resin-cured product is a cured product of a silicone resin. 5. A battery module comprising: a plurality of unit batteries arranged in one direction; and a cooling mechanism, wherein the secondary batteries according to claim 1 are used as the plurality of unit batteries, and wherein surfaces of the plurality of unit batteries on the other side of the bottoms of the battery cases are connected to the cooling mechanism. 6. The battery module according to claim 5 wherein the cooling mechanism has a pipe through which a refrigerant passes. 7. A method for producing a secondary battery comprising: preparing a battery case; preparing an electrode body; preparing an electrolyte; preparing a liquid or semi-solid resin; introducing the resin into the battery case up to a predetermined height; accommodating the electrode body in the battery case; and injecting the electrolyte into the battery case after the resin is cured.

2022-05-11

en

2022-11-17

US-201816197712-A

Modified rfid tags ABSTRACT An RFID tag having an initial range may be modified to have a reduced or increased range by printing a modification element over the antenna of the RFID tag. The modification element may function as an extension of the antenna or may function to shield the antenna. FIELD This disclosure relates generally to RFID devices, more particularly, to modification of RFID tags. BACKGROUND Radio frequency identification (RFID) is a technology that works on radio frequency signals. An RFID system often comprises three main components: (1) an RFID tag which stores data is usually attached to an article that one desires to identify and/or track; (2) an RFID reader that communicates with the RFID tag using radio frequency signals to obtain data from the RFID tag; and (3) a host data processor that uses the data obtained by the RFID reader from the RFID tag. If the RFID tag is within range of the radio frequency signals (radio waves), a communication link between the two RFID devices is established and the RFID tag replies with data to the RFID reader. Based on this reply, the RFID reader may identify the article. There are various types of RFID tags. Passive RFID tags do not include a power source, such as a battery. Passive RFID tags rely on power derived from radio waves from the RFID reader to transmit a reply to the RFID reader. Active RFID tags include a power source to power its internal circuitry and to enable transmission of a reply to the RFID reader. Semi-passive RFID tags include a power supply to power its internal circuitry but relies on power derived from the radio waves from the RFID reader to transmit a reply to the RFID reader. An important factor is range, which refers to the maximum distance between the RFID reader and RFID tag for a reliable communication link between the two RFID devices. The range is affected by various factors, such as background radio frequency noise, surrounding structures that may affect the radio waves from the RFID reader, antenna configurations of the reader and tag, relative orientation (angle) between the reader and tag, and carrier frequency. RFID systems may operate in different frequency bands. In the low frequency (LF) band, a carrier frequency of 125 kHz or 134 kHz, for example, may provide a range up to 10 cm. In the high frequency (HF) band, a carrier frequency of 13.58 MHz, for example, may provide a range up to 1 meter. In the ultra high frequency (UHF) band, a carrier frequency within 860-960 MHz, for example, may provide a range up to 15 meters. RFID tags are used on a great variety of articles. The articles can be items of clothing for sale in a retail shop, medical devices, and individual components used in a factory, just to name a few. It is often the case that RFID tags manufactured in bulk have the same range. However, articles on which the RFID tags are attached might be stacked within a box, and the box may be surrounded by other boxes when the RFID tags must be read by an RFID reader. To ensure reliable communication, the RFID tags may be over-designed or conservatively designed to work in the most extreme situation that is expected during the useful life of the RFID tags, but such an approach may increase costs significantly. This scenario and others present a need for modified RFID tags tailored for the environment in which they will be used. SUMMARY Briefly and in general terms, the present invention is directed to an RFID tag. In aspects of the invention, an RFID tag comprises a chip, an antenna configured to transmit data from the chip, and a modification element disposed over the antenna. The modification element comprises any of metal or graphite. The features and advantages of the invention will be more readily understood from the following detailed description which should be read in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a plan view showing an example RFID tag before modification. FIG. 2 is a plan view showing an example substrate on which is secured the RFID tag and other RFID tags before modification. FIGS. 3 and 4 are plan views showing example modification elements applied to the RFID tag to increase and decrease range. FIG. 5 is a diagram showing an example system for modifying the RFID tag. FIG. 6 is a diagram showing an example modification assembly of the system. FIG. 7 is a plan view showing images printed on one side of the substrate. FIG. 8 is a plan view showing modification elements printed over the RFID tag on the other side of the substrate. FIG. 9 is a plan view showing a coating and an adhesive applied on the same side of the substrate as the RFID tags, and showing the result after the substrate is folded. FIG. 10 is a side view along the direction of arrows B-B in FIGS. 3 and 9, showing an example modification element that modifies the RFID tag. FIG. 11 is a detail view of area C in FIG. 3, showing an example relationship between the modification element and the antenna of the RFID tag. FIG. 12 is a side view along the direction of arrows D-D in FIG. 4, showing another example modification element that modifies the RFID tag. FIG. 13 is a detail view of area E in FIG. 4, showing an example relationship between the modification element and the antenna of the RFID tag. FIG. 14 is an isometric view showing an RFID read environment for which the RFID tag may be modified according to its expected position in the RFID read environment. FIG. 15 is a flow diagram showing an example process for modifying the RFID tag. DETAILED DESCRIPTION Referring now in more detail to the drawings for purposes of illustrating non-limiting examples, wherein like reference numerals designate corresponding or like elements among the several views, there is shown in FIG. 1 example RFID tag 10 comprising chip 12 and antenna 14 configured transmit data from the chip. Chip 12 is a silicon device (integrated circuit) having pads that are operatively connected to antenna 14, which is a conductive circuit. In the illustrated example, antenna 14 is a dipole (common for UHF) although other antenna designs are possible, such as coiled shapes (common for HF). Circuity provided by chip 12 may include modulators and voltage regulators, as known in the art. Chip 12 may have control logic that includes data encoding and decoding functions, as known in the art. Chip 12 includes memory, which may be an EEPROM for example, for storing information. Such information may be associated with an article on which the RFID tag will be attached at a later time. Chip 12 and antenna 14 are secured to a substrate, which may be made of paper (e.g., cardstock), polymer film, fabric, or other material. RFID tag 10 will be modified to increase or reduce its range by printing a modification element over antenna 14. In FIG. 1, RFID tag 10 is in an unmodified state. That is, RFID tag 10 has not been subjected to modification described below. While in an unmodified state, RFID tag 10 is functional in the sense it is capable of powering circuits of chip 12 in response radio waves from an RFID reader. RFID tag 10 has a range, which is the maximum distance between RFID tag 10 and an RFID reader for a for a reliable communication link between the tag and reader. The term “initial range” refers to the range of RFID tag 10 while in its unmodified state. By definition, an initial range is greater than zero. The term “modified range” refers to the range of RFID tag 10 while in its modified state, which is the state resulting from modification by printing a modification element over antenna 14. The modification element includes metal or graphite, for example. The modification element can have a maximum thickness up to 0.13 mm (about 5 mil) or up to 0.25 mm (about 10 mil), for example. The range of the RFID tag may be affected by variations in background radio frequency noise (electromagnetic interference), surrounding structures, and other conditions. Thus, the initial range may be determined by testing before RFID tag 10 is modified, such as by using a particular sensor using a known frequency and power under known test conditions (e.g., known amount of background RF noise, known orientation (angle) between reader and tag, etc.). For example, the sensor used for this purpose may be an RFID reader or other type of sensor. Various test techniques may be used to determine the initial and modified ranges. In a technique referred to herein as position thresholding, the distance of the sensor from RFID tag 10 is adjusted while the sensor emits radio waves. The distance is adjusted until the radio waves induce RFID tag 10 to send a response to the sensor, or until the sensor detects a backscatter signal from the RFID tag. In a technique referred to herein as signal thresholding, the position of the sensor may be fixed (sensor does not move relative to the RFID tag) while characteristics of the radio waves from the antenna of the sensor are adjusted. The radio wave characteristics are adjusted until the radio waves induce RFID tag 10 to send a response to the sensor, or until the sensor detects a backscatter signal from the RFID tag. The radio wave characteristics that result in the response may be used, in formulas and models known in the art, to calculate a value of the initial range. The initial range is relative to the modified range, which may be determined by testing after RFID tag 10 is modified. Signal thresholding, position thresholding, or other test technique may be used to determine the modified range. For position thresholding, the sensor and test conditions to determine the modified range may be the same as or similar to those used to determine the initial range. As indicated above, the range of RFID tag 10 depends on a variety of factors. Thus, values for the initial and modified ranges may vary depending on the sensor used for testing. For example, when using one type of sensor under certain test conditions, the initial and modified ranges may be 1.2 meters and 2 meters, respectively. When using another type of sensor under different test conditions, the initial and modified ranges may be 1.5 meters and 2.1 meters, respectively. The initial and modified ranges may be based on multiple tests, and the results of the tests may be averaged to determine initial and modified ranges. As shown in FIG. 2, substrate 16 may carry RFID tag 10 and other RFID tags 10′ in unmodified states. Other RFID tags 10′ may be identical to or different from RFID tag 10. In this way, multiple RFID tags may be modified together for efficiency. Modification involves printing modification element 18 over antenna 14, as shown in FIGS. 3 and 4. Modification element 18 is made of an electrically conductive material. The conductive material for modification element 18 may be the same or similar material that was used to form antenna 14. For example, the conductive material may be a conductive ink or a conductive paste containing metal particles and/or graphite particles. In FIG. 3, modification element 18 has been printed over antenna 14 in such a way that modification element 18 makes electrical contact with antenna 14 and increases the range of RFID tag 10. Electrical contact allows modification element 18 to function as an extension of antenna 14. The modified range is greater than the initial range. The modified range may be at least 20% or at least 30% greater than the initial range. In the illustrated example, modification element 18 enlarges antenna 14. Modification element 18 increases the length of antenna 14. Modification element 18 may increase the power gain of antenna 14. The gain is expressed relative to an ideal isotropic antenna or relative to a dipole antenna used as a reference, and may be measured using techniques known in the art. As previously mentioned, the RFID tag may have a coil shaped antenna. If the RFID tag has a coil shaped antenna, modification element 18 may increase or decrease the number of coil loops in the antenna. In FIG. 4, modification element 18 has been printed over antenna 14 in such a way that modification element 18 decreases the range of RFID tag 10. The modified range is less than the initial range. The modified range may be at least 20% or at least 30% less than the initial range. Modification element 18 makes electrical contact with antenna 14 such that the number of bends in the antenna 14 are effectively reduced, or modification element 18 does not make electrical contact with antenna 14 such that a portion of antenna 14 is shielded from radio waves by modification element 18. An insulation layer (e.g., layer 70 of FIG. 12) may exist between modification element 18 and antenna 14 to prevent electrical contact. For example, modification element 18 may decrease the power gain of antenna 14. FIG. 5 shows example system 20 for increasing or reducing the range of RFID tag 10. System 20 includes computer 22, modification assembly 24, and server 26. These elements of system 20 communicate via network 28. For example, network 28 may be local area network, wide area network, and/or the Internet. Computer 22 may be a tablet computer, laptop computer, desktop computer, or workstation computer. Alternatively, computer 22 and/or server 26 may be integrated into and form parts of modification assembly 24. Server 26 may be integrated into and form part of computer 22. In further aspects, system 20 includes RFID tag 10 secured on substrate 16. System 20 may include RFID tag 10 and other RFID tags 10′ secured on substrate 16. As shown in FIG. 6, modification assembly 24 includes media tray 30, image printer 32 (second printer), pre-modification sensor 34, modification printer 36 (first printer), post-modification sensor 38, coating mechanism 40, bonding mechanism 42, folding mechanism 44, cutting mechanism 46, and conveyor assembly 48. Media tray 30 holds substrate 16 before RFID tag 10 is modified. Conveyor assembly 48 (depicted as a dotted line) extends through modification assembly 24 and includes motors, guides, and rollers, as are known in the art. Conveyor assembly 48 takes substrate 16 from media tray 30 and then conveys substrate 16 across or through image printer 32, pre-modification sensor 34, modification printer 36, post-modification sensor 38, coating mechanism 40, bonding mechanism 44, and folding mechanism 44. In alternative aspects, modification assembly 24 includes RFID tag 10 secured on substrate 16. Modification assembly 24 may include RFID tag 10 and other RFID tags 10′ secured on substrate 16. In alternative aspects, any of image printer 32, pre-modification sensor 34, post-modification sensor 38, coating mechanism 40, bonding mechanism 44, folding mechanism 44, and cutting mechanism 46 may be separated from modification assembly 24 while remaining as part(s) of system 20. That is, any of image printer 32, pre-modification sensor 34, modification printer 36, coating mechanism 40, bonding mechanism 44, folding mechanism 44, and cutting mechanism 46 may be present outside of modification assembly 24. In alternative aspects, any of image printer 32, pre-modification sensor 34, post-modification sensor 38, coating mechanism 40, bonding mechanism 44, folding mechanism 44, and cutting mechanism 46 may be eliminated from system 20. Conveyor assembly 48 conveys substrate 16 from media tray 30 to image printer 32 (second printer). Image printer 32 prints an image on the second side of substrate 16. The printed image may be text and/or graphics, such as a machine-readable barcode. Image printer 32 may use electrostatic, ink-jet, stamping, roller, or other technique to print the image. Structures for these techniques are known in the art and need not be described herein. FIG. 7 shows example image 50 printed by image printer 32 on second side 16S of substrate 16. Image 50 corresponds to RFID tag 10, as will become apparent from the folding step described below. When other RFID tags 10′ are on the first side of substrate 16, image printer 32 prints other images 50′ corresponding to other RFID tags 10′. Image 50 and other images 50′ may be identical, or they may be different from each other. The images 50, 50′ are confined to lower half 16L of substrate 16. Referring again to FIG. 6, conveyor assembly 48 conveys substrate 16 from image printer 32 to pre-modification sensor 34. Pre-modification sensor 34 is used to conduct a test to determine the initial range of RFID tag 10 in an unmodified state. Pre-modification sensor 34 emits radio waves W1 toward RFID tag 10 during the test. Position thresholding, signal thresholding, or another test technique may be used to determine the initial range. Pre-modification sensor 34 may be an RFID reader. RFID readers and sensors for this purpose are known in the art need not be described herein. Next, conveyor assembly 48 conveys substrate 16 from pre-modification sensor 34 to modification printer 36 (first printer). Modification printer 36 prints modification element 18 over antenna 14. For example, modification printer 36 may print modification element 18 as described for FIG. 3 or FIG. 4. Modification printer 36 may use electrostatic, ink-jet, stamping, rolling, or other technique. Structures for these techniques are known in the art and need not be described herein. FIG. 8 shows example modification element 18 printed by modification printer 36 (first printer) on first side 16F of substrate 16. Modification printer 36 printed modification element 18 over the antenna of RFID tag 10. Modification printer 36 also printed modification elements 18′ over respective antennas of other RFID tags 10′. Modification element 18 and modification elements 18′ may be identical, or they may be different from each other. Note that the RFID tags are confined to upper half 16U of substrate 16. Referring again to FIG. 6, conveyor assembly 48 conveys substrate 16 from modification printer 36 (first printer) to post-modification sensor 38. Post-modification sensor 38 is used to conduct a test to determine the modified range of RFID tag 10. Post-modification sensor 38 emits radio waves W2 toward RFID tag 10 during the test. Position thresholding, signal thresholding, or another test technique may be used to determine the modified range. Post-modification sensor 38 may be an RFID reader. RFID readers and sensors for this purpose are known in the art need not be described herein. In alternative aspects, post-modification sensor 38 is eliminated, and pre-modification sensor 34 is used to determine the modified range of RFID tag 10. For example, conveyor assembly 48 may return substrate 16 to pre-modification sensor 34, or pre-modification sensor 34 may be configured to move on a track to a position downstream of modification printer 36. Next within FIG. 6, conveyor assembly 48 conveys substrate 16 from post-modification sensor 38 to coating mechanism 40. Coating mechanism 40 applies protective coating 56 (FIG. 9) on first side 16F of substrate 16 such that a bottom surface of coating 56 covers and contacts the chips, antennas, and modification elements of all RFID tags on substrate 16. Coating 56 may be a thin film that protects the underlying electronic components from moisture, salt, chemicals, temperature changes, and other conditions that may damage the components. Coating 56 may be applied as a wet substance that is dried by coating mechanism 40. When dried, coating 56 may function as an electrical insulator and/or a moisture barrier. Coating 56 may be applied as a dry polymer film that functions as an electrical insulator and/or a moisture barrier. Coating mechanism 40 may use spraying, brushing, stamping, dipping, rolling, or other technique to apply coating 56. Structures for these techniques are known in the art and need not be described herein. In FIG. 9, coating 56 is illustrated as having been partially removed so that some of the RFID tags are visible for purposes of discussion herein. It is to be understood that coating 56 covers all the RFID tags. Referring again to FIG. 6, conveyor assembly 48 conveys substrate 16 from coating mechanism 40 to bonding mechanism 42. Bonding mechanism 42 applies adhesive 58 on first side 16F of substrate 16. In FIG. 9, adhesive 58 is confined to lower half 16L of substrate 16. Bonding mechanism 42 may apply adhesive 58 as a wet or tacky substance. Bonding mechanism 42 may use spraying, brushing, stamping, rolling, or other technique to apply adhesive 58. Structures for these techniques are known in the art and need not be described herein. Next, conveyor assembly 48 conveys substrate 16 from bonding mechanism 42 to folding mechanism 44. Folding mechanism 44 folds first side 16F of substrate 16 onto itself as indicated by arrow A. Folding mechanism 44 folds substrate 16 in half. Note that images 50, 50′ (FIG. 0.7) are at lower half 16L of the substrate, and RFID tags 10, 10′ are on upper half 16U of the substrate. Thus, when folding mechanism 44 folds substrate 16, image 50 on second side 16S of the substrate covers area 60 occupied by RFID tag 10 (including chip 12 and antenna 14) and modification element 18 on first side 16F of the substrate, as shown in FIG. 10. That is, RFID tag 10 and its associated image 50 become aligned. Similarly, each of the other RFID tags 10′ and its associated image 50′ become aligned. Next, conveyor assembly 48 conveys substrate 16 from folding mechanism 44 to cutting mechanism 46. Cutting mechanism 46 separates each of RFID tag 10 and other RFID tags 10′ by cutting substrate 16 along dotted lines L1 in FIG. 9. Cutting mechanism 46 include a blade or cutting die for cutting along dotted lines L1. In alternative aspects, conveyor assembly 48 may not extend to cutting mechanism 46. Conveyor assembly 48 may terminate at any one of image printer 32 (second printer), pre-modification sensor 34, modification printer 36 (first printer), post-modification sensor 38, coating mechanism 40, bonding mechanism 44, and folding mechanism 44. After the point of termination, a person may convey substrate 16 to the next part of modification assembly 24. In alternative aspects, pre-modification sensor 34 is not located between image printer 32 and modification printer 36. Instead of the location shown in FIG. 6, pre-modification sensor 34 is located before (upstream of) coating mechanism image printer 32. For example, pre-modification sensor 34 may be located between image printer 32 and media tray 30. In alternative aspects, post-modification sensor 38 is not located between modification printer 36 and coating mechanism 40. Instead of the location shown in FIG. 6, post-modification sensor 38 may be located after (downstream of) coating mechanism 40. For example, post-modification sensor 36 may be located after cutting mechanism 46. FIG. 10 is a partial side view in the direction of arrows B-B in FIGS. 3 and 9. FIG. 10 shows a possible configuration of a modified RFID tag after substrate 16 is folded. Modification element 18, chip 12, and antenna 14 are between two portions 16A, 16B of substrate 16. Bottom surface 56B of coating 56 covers and contacts modification element 18, chip 12, and antenna 14. Adhesive 58 is on top surface 56T of coating 56. Adhesive 58 keeps the modified RFID tag sealed and protected between two portions 16A, 16B of substrate 16. Image 50 on second side 16S of substrate 16 covers area 60 occupied by modification element 18, chip 12, and antenna 14 on first side 16F of substrate 16. Modification element 18 does not cover chip 12. Modification element 18 does not cover antenna 14 entirely. In FIG. 10, modification element 18 and antenna 14 form interface 62 at an area of contact between modification element 18 and antenna 14. Interface 62 provides an electrical conductive path between modification element 18 and antenna 14. Interface 62 is defined by a change in material composition and/or mechanical characteristics. For example, modification element 18 may be made of a composition of copper and a first type of binding agent, and antenna 14 may be made of a composition of copper and a second type of binding agent. Thus, interface 62 is a change in material composition. In a second example, modification element 18 and antenna 14 have similar material compositions; however, an oxidation layer is present on the exposed surface of antenna 14 before modification element 18 is printed. Thus, in the second example, interface 62 is a change in material composition due to the presence of an oxidation layer. In a third example, the modification printing process does not completely fuse the top surface of antenna 14 to modification element 18. This may be evident from a seam or discontinuity where the top surface of antenna 14 meets the bottom surface of modification element 18. Thus, in the third example, interface 62 is a change in mechanical characteristic due to the presence of a seam or discontinuity. A change in mechanical characteristics may also be present in the first and second examples. FIG. 11 is a detail view of area C in FIG. 3, showing an example relationship between modification element 18 and antenna 14 in FIGS. 3 and 10. Modification element 18 overlaps antenna 14 at the area between two dotted lines L2. The area of overlap is illustrated in gray to distinguish from areas that do not overlap which are illustrated in black. The area of overlap is also the area of contact. Interface 62 (FIG. 10) is at the area of contact. Interface 62 is formed by a linear leg of modification element 18 overlapping and contacting a linear leg of antenna 14. Another leg of antenna 14 has central axis 63 and width 64 perpendicular to central axis 63. Central axis 63 extends through the center of the antenna trace. A leg of modification element 18 has central axis 65 and width 66 perpendicular to central axis 65, which extends through the center of the modification element trace. Width 64 and width 66 may be measured along directions parallel to a flat plane formed by substrate 16. Width 66 of modification element 18 is equal to the width 64 of antenna 14. In this context, the term “equal” encompasses slight manufacturing variations, such that width 66 may be up to 10% greater or less than width 64 for the two widths to be considered equal. Depending on the type of antenna and circuitry of the RFID tag, having equal widths may enable modification element 18 to function effectively as an extension of antenna 14 and increase the range of the RFID tag. In the illustrated example, central axes 64 and 66 are straight lines since the conductive traces of the antenna and the modification element are straight. In alternative aspects, the conductive traces of the antenna and the modification may be curved or have a radius, as would be for a coil-shaped antenna. In such cases, the central axes would be curved. In alternative aspects, coating 56 contacts modification element 18 but does not contact chip 12 and antenna 14, as shown in FIG. 12. FIG. 12 is a partial side view in the direction of arrows D-D in FIG. 4. FIG. 12 shows a possible configuration of a modified RFID tag after substrate 16 is folded. FIG. 12 is the same as FIG. 10 except for the presence of insulation layer 70, which covers and contacts chip 12 and antenna 14. Insulation layer 70 may be a thin film that protects the underlying electronic components from moisture, salt, chemicals, temperature changes, and other conditions that may damage the components. Insulation layer 70 may be present when substrate 14 is placed in media tray 30, or a mechanism (similar to coating mechanism 40) may be present between media tray 30 and modification printer 36 for the purpose of applying insulation layer 70. Modification element 18 is printed over antenna 14, though there is no conductive path from modification element 18 to antenna 14 because of insulation layer 70. Absence of a conduct path allows modification element 18 to shield a portion of antenna 14 from radio waves from an RFID reader. Thereafter, coating mechanism 40 applies coating 56 over modification element 18, chip 12, and antenna 14. Bottom surface 56B of coating 56 contacts modification element 18 but does not contact chip 12 and antenna 14 because of insulation layer 70. FIG. 13 is a detail view of area E in FIG. 4, showing an example relationship between modification element 18 and antenna 14 in FIG. 12. Modification element 18 overlaps antenna 14 at the area illustrated in gray; however, modification element 18 does not contact antenna 14 because of insulation layer 70 (FIG. 12). Antenna 14 comprises first linear leg 71, second linear leg 72 connected to and extending from first linear leg 71, and third linear leg 73 connected to and extending from second linear leg 72. First linear leg 71 and second linear leg 72 are oriented to form acute angle 74 in space 75 between the first and second linear legs. Second linear leg 72 and third linear leg 73 are oriented to form acute angle 76 in space 77 between the second and third linear legs. Modification element 18 does not cover first linear leg 71. However, modification element covers second linear leg 72, third linear leg 73, and space 77 between the second and third linear legs. Depending on the type of antenna and circuitry of the RFID tag, covering portions of antenna 14 in this way may enable modification element 18 to shield antenna 14 effectively and decrease the range of the RFID tag. In alternative aspects, modification element 18 of FIG. 13 contacts antenna 14 at the area of overlap. An interface would be present at the area of contact between the modification element and second linear leg 72 and third linear leg 73. Depending on the type of antenna and circuitry of the RFID tag, increasing the effective area of antenna 14 in this manner may allow the RFID tag to operate more efficiently. Referring again to FIG. 5, computer 22 includes processors and memory that allow it to execute computer readable instructions for controlling modification assembly 24 and for performing processes described below. Pre-modification sensor 34 (FIG. 6) is configured to determine the initial range (Ri) of RFID tag 10, as described above. Computer 22 stores a target range (Rt) and is configured to compare the determined initial range to the target range before instructing modification printer 36 (first printer) to print modification element 18. Computer 22 is configured to determine a configuration of modification element 18 according to a result of the comparison. Thereafter, computer 22 controls modification printer 36 to print modification element 18 over antenna 14 of RFID tag 10 according to the determined configuration. TABLE I is an example lookup table that may be stored in computer 22 and which computer 22 uses to determine a configuration of modification element 18. The lookup table shows a relationship between additional range (R) and additional antennal length (L) for a particular type of RFID tag having a particular antenna configuration and chip. In this example, computer 22 calculates the additional range from Equation 1 below. R=Rt−Ri  (Eq. 1) An equation other than Equation 1 may be used to determine R. For example, weighting or correction factors “a” and “b” may be applied according to Equation 2 below. R=(a·Rt)−(b·Ri)  (Eq. 2) The additional range (R) represents a comparison of the initial range (Ri) and target range (Rt). The lookup table may be developed empirically from many tests performed before the RFID tag is modified. Computer 22 may store many tables, each table being for a particular type of RFID tag. Computer 22 may receive information on the type of RFID tag. In response, computer 22 matches the received information to one of the lookup tables, applies the value of R to the lookup table to determine a value for L. In this way, computer 22 determines L, which represents the configuration of modification element 18. In alternative aspects, the lookup table may come from the database of server 26. For example, computer 22 may transmit information on the type of RFID tag to server 26, and server 26 matches the information to one of the lookup tables stored in its database, and then transmits the lookup table or a value for L to computer 22. TABLE I Additional Range, R Additional Antenna Length, L −1 meter −10 mm 1 meter 20 mm 2 meters 30 mm 3 meters 60 mm In alternative aspects, the relationship between R and L for a particular type of RFID tag may be in a theoretical or empirical model (equation), instead of a lookup table. Several models may be stored in the database of server 26. For example, computer 22 may transmit a value for R and information on the type of RFID tag to server 26. In response, server 26 matches the information to one of the models stored in its database, applies the value of R to the model to calculate a value for L, and transmits the value for L to computer 22. In this way, computer 22 determines L, which represents the configuration of modification element 18. For example, if the target range is Rt=7 meters and the initial range is Ri=4 meters, then computer 22 may compute the additional range as R=7−4=3 meters according to Equation 1. Using a lookup table or model, computer 22 determines the configuration of modification element 18 to be L=60 mm. Thereafter, computer 22 instructs modification printer 36 to print modification element 18 as a conductive trace that provides 60 mm additional length to the pre-existing length of antenna 14. In addition to or as an alternative to length, the lookup table (or model) may include other characteristics for the configuration of modification element 18. Other characteristics include without limitation: width for printing the conductive trace, the number of meanders or bends of the conductive trace, the number of loops formed by the conductive trace (potentially for an RFID tag having a pre-existing coil design for inductive coupling), the thickness of the trace, and the area size of a paddle tip at the end of the trace (potentially for an RFID tag having a pre-existing coil design for backscatter coupling). In another example, if the target range is Rt=3 meters and the initial range is Ri=4 meters, then computer 22 may compute the additional range as R=3−4=−1 meter according to Equation 1. Using a lookup table or model, computer 22 determines the configuration of modification element 18 to be L=−10 mm. The negative value means that the effective length of the antenna of the RFID tag should be reduced by 10 mm. Thereafter, computer 22 instructs modification printer 36 to print modification element 18 as a radio wave shield that covers a 10 mm length of antenna 14. In addition to or as an alternative to length, the lookup table (or model) may include other characteristics for the configuration of modification element 18. Other characteristics include without limitation: the number of meanders or bends to be covered by modification element 18, and the number of loops to be covered by modification element 18. Thus, for example, computer 22 may instruct modification printer 36 to print modification element 18 that reduces the number or bends or loops in antenna 14. The target range may be manually entered into or transmitted to computer 22. The target range may be specified by a customer. The target range may be constant (the same) for all RFID tags on substrate 14, in which case the printed configuration of modification element 18 may be identical for all the RFID tags on substrate 14. The target range may vary among the RFID tags on substrate 14, in which case the printed configuration of modification element 18 may vary among the RFID tags on substrate 14. As shown in FIG. 14, it may be possible for RFID tags to be placed in different environments. FIG. 14 shows boxes 78 (articles) on which RFID tags are to be secured. Boxes 78 may be stored on a pallet and transported together from a manufacturing facility to retail facility, for example. To track individual boxes 78 during transportation, the entire group may be passed across an RFID screening station having one or more RFID readers 79. Thus, the target range for a particular RFID tag may be based on the expected environment in which that RFID tag is intended to encounter. RFID tags near the center of the group of boxes may require a greater target range compared to boxes that are closer to the RFID reader. The greater target range may account for the increased distance from the RFID reader and/or interference caused by boxes that surround the RFID tags near the center. Referring again to FIG. 2, computer 22 is configured to associate RFID tag 10 with a position for storing an article on which RFID tag 10 is to be attached. The position of the article is relative to other articles (e.g., boxes 78 that surround the RFID tag) or relative to an RFID reader to be used later on the RFID tag 10 (e.g., RFID reader 79). Computer 22 is configured to determine the target range according to the position associated with the RFID tag. TABLE II is an example lookup table that may be stored in computer 22. Computer 22 uses the lookup table to determine the target range according to the position associated with the RFID tag. The lookup table shows a relationship between the position and the target range (Rt). The lookup table may be developed empirically from many tests performed on identical RFID tags before the present RFID tag is modified. Computer 22 may store many lookup tables, each lookup table being for a particular RFID reading environment. For example, the lookup table of TABLE II may be used for the RFID reading environment of FIG. 14, and another lookup table may be used for a different RFID reading environment. TABLE II Position Target Range, Rt 1. Facing RFID reader 2 meters 2. All other positions 5 meters 3. Center region of group of boxes 6 meters For example, computer 22 may associate RFID tag 10 and all other RFID tags 10′ to Position 3, in which case computer 22 determines that target range Rt should be 6 meters. Thereafter, computer 22 determines the configuration of modification element 18 according to Rt, as previously described. That is, computer 22 computes R using Rt and Ri, and then determines configuration characteristic L (and/or other configuration characteristics) from R. Applying Ri=4 meters to Equation 1 gives R=6−4=2 meters. Applying R=2 meters to the lookup table of TABLE I, computer 22 determines the configuration of modification element 18 to be L=30 mm for all the RFID tags on substrate 14. In another example, computer may associate other RFID tags 10′ to Position 2, in which case computer 22 determines that target range Rt should be 5 meters. Applying Ri=4 meters to Equation 1 gives R=5−4=1 meter. Applying R=1 meter to the lookup table of TABLE I, computer 22 determines the configuration of modification element 18 to be L=20 mm for other RFID tags 10′. FIG. 15 shows an example process for modifying an RFID tag (e.g., RFID tag 10 described above). The process may begin at block 92, where modification element (e.g., modification element 18 described above) is printed over the antenna of an RFID tag. Optionally, the process may begin at block 80 by printing image 50 on the substrate (e.g., substrate 14), and then the process goes to block 92 where the modification element on the other side of the substrate. Optionally, the configuration for the modification element may be determined at block 88, and then the modification element is printed at block 92 according to the determined configuration. Optionally, the configuration may be determined by determining the initial range (Ri) of the RFID tag at block 82, for example by using pre-modification sensor 34. Next, Ri is compared to Rt at block 86, and then the configuration for the modification element is determined at block 88 according to a result of the comparison. The determined configuration may specify whether the modification element should make electrical contact with the antenna of the RFID tag. If there should be electrical contact, the process may proceed to block 92 to print the modification element. If there should be no electrical contact, the process may proceed to block 90 to apply an insulation layer (e.g., layer 70) over the antenna (if an insulation layer is not already present), and then proceed to block 92 to print the modification element. The target range (Rt) may be predetermined. If Rt is not predetermined, Rt may be determined at block 84 according to a position associated with the RFID tag. The position may be for an article (e.g., box 78) on which the RFID tag is to be secured later. The position of the article may be relative to an RFID reader (e.g., RFID reader 79) and/or relative to other articles. Thereafter, the process proceeds to blocks 86, 88, 90, and 92 as previously described. After the modification element is printed, a coating (e.g., coating 56) is applied on the modification element at block 96. The coating may contact the chip and/or antenna of the RFID tag if an insulation layer is not present on the chip and/or antenna. Optionally at block 98, an adhesive (e.g., adhesive 58) is applied on the substrate. Next at block 100, the substrate is folded so that the chip, the antenna, and the modification element are disposed between two portions of the substrate. Thereafter, the substrate may be cut at block 102. If multiple RFID tags are present on the substrate, cutting will separate the RFID tags from each other. Optionally, the modified range of the RFID tag may be determined at block 94 after the modification element is printed. This may be performed for quality control purposes. For example, post-modification sensor 38 may to determine the modified range. In alternative aspects, block 94 may be moved directly after any of blocks 96, 98, 100, and 102. In alternative aspects, the modified range of the RFID tag may be performed while the RFID tag is secured to an article (e.g., box 78), and an RFID reader (e.g., RFID reader 79) may be used to confirm that the modified range of the RFID tag is sufficient. FIGS. 1-4 and 8-13 show a type of passive RFID tag. It is contemplated that other types of passive RFID tags may be modified according to the method and system described herein. It is also contemplated that modification of range by printing a modification element may be formed for semi-passive and active RFID tags. While several particular forms of the invention have been illustrated and described, it will also be apparent that various modifications may be made without departing from the scope of the invention. It is also contemplated that various combinations or subcombinations of the specific features and aspects of the disclosed embodiments may be combined with or substituted for one another in order to form varying modes of the invention. Accordingly, it is not intended that the invention be limited, except as by the appended claims. 1. A radio frequency identification (RFID) tag comprising: a chip; an antenna configured to transmit data from the chip; and a conductive modification element electrically connecting at least one of a plurality of bends and loops of the antenna to reduce a range of the RFID tag. 2. The RFID tag of claim 1, wherein the conductive modification element comprises metal. 3. The RFID tag of claim 1, wherein the conductive modification element comprises graphite. 4. The RFID tag of claim 1, wherein the conductive modification element does not cover the chip. 5. The RFID tag of claim 1, wherein the conductive modification element does not cover the antenna entirely. 6. The RFID tag of claim 1, wherein the conductive modification element contacts the antenna. 7. The RFID tag of claim 6, wherein the conductive modification element and the antenna form an interface at an area of contact between the conductive modification element and the antenna. 8. The RFID tag of claim 6, wherein the RFID tag is configured to respond to an RFID reader emitting radio waves toward the antenna. 9. The RFID tag of claim 6, wherein: the antenna has a central axis and a width perpendicular to the central axis, the conductive modification element has a central axis and a width perpendicular to the central axis, and the width of the conductive modification element is equal to the width of the antenna. 10. The RFID tag of claim 1, wherein the conductive modification element does not contact the antenna. 11. The RFID tag of claim 10, further comprising an insulation layer between the conductive modification element and the antenna, wherein there is no conductive path from the antenna to the conductive modification element. 12. The RFID tag of claim 10, wherein the RFID tag is configured to respond to an RFID reader emitting radio waves toward the antenna. 13. The RFID tag of claim 10, wherein: the antenna comprises a first linear leg, a second linear leg connected to and extending from the first linear leg, and a third linear leg connected to and extending from the second linear leg; the first linear leg and the second linear leg are oriented to form an acute angle in a space between the first and second linear legs; the conductive modification element does not cover the first linear leg; the second linear leg and the third linear leg are oriented to form an acute angle in a space between the second and third linear legs; and the conductive modification element covers the second linear leg, the third linear leg, and the space between the second and third linear legs. 14. The RFID tag of claim 1, further comprising a substrate and a coating, wherein the chip, the antenna, and the conductive modification element are disposed between the substrate and the coating, and wherein the coating contacts the conductive modification element. 15. The RFID tag of claim 14, wherein the coating contacts the chip and the antenna. 16. The RFID tag of claim 14, wherein the coating does not contact the chip and the antenna. 17. The RFID tag of claim 14, further comprising a cover and an adhesive, the adhesive disposed between and contacting the cover and the coating. 18. The RFID tag of 17, further comprising a printed image on the cover. 19. A radio frequency identification (RFID) tag comprising: a chip; an antenna configured to transmit data from the chip; and a conductive modification element electrically connecting at least one of a plurality of bends and loops of the antenna and configured to reduce a range of the antenna. 20. A radio frequency identification (RFID) tag comprising: a chip; an antenna configured to transmit data from the chip; and a conductive modification element electrically connecting at least one of a plurality of bends and loops of the antenna such that a portion of the antenna is shielded from radio waves.

2018-11-21

en

2020-05-21

US-14978602-A

Generation of a common encryption key ABSTRACT A system for generating a common encryption key for secure communication between devices; the system including: a plurality of devices, each associated with at least one unique device identifier; the plurality of devices being arranged in subgroups S i (i= 1 . . . n) of devices, with at least one of the subgroups including a plurality of devices; and a central device including an algorithm generator for generating a key generating algorithm KGA 1 for each of the plurality of devices based on its associated unique device identifier; each of the key generating algorithms KGA i being unique for a respective associated subgroup S i with the key generating algorithms KGA i being the same for each device of the same subgroup S i ; for each subgroup S i the associated key generating algorithm KGA i being operative to generate for devices of each subgroup S j a common subgroup key SGK i,j for use in communication between a device of subgroup S i and a device of subgroup S j ; the common subgroup key SGK i,j being generated in response to receiving any one of the device identifiers associated with devices in the subgroup S j ; each device being associated with a respective storage for storing its associated key generating algorithm and including a processor for executing the associated key generating algorithm. [0001] The invention relates to a system, a central device, an end device and respective methods for generating a common encryption key for secure communication between end devices. [0002] Protection of digital audio and/or video content is becoming increasingly important. This includes contents encryption/decryption and access management functions, such as authentication of devices. These functions increasingly rely on crytographic techniques. Such techniques require a same or complementary cryptographic key in the devices that communicate with each other. Particularly, for content protection it is desired that relatively strong encryption keys are used in all countries. Since some countries have legal restrictions on the size of the key so-called key escrow encryption systems (KES) have been developed that enable authorized authorities to recover strong encryption keys where this is a legal requirement. A key escrow system is an encryption system with a backup decryption capability that allows authorised persons (like government officials) to decrypt ciphertext, like encrypted digital content, with the help of information supplied by trusted parties who hold special data recovery keys. The data recovery keys are normally not the same as those used to encrypt and decrypt the data, but rather provide a means of determining the data encryption/decryption keys. The term key escrow is used to refer to the safeguarding of these data recovery keys. [0003] An escrowed encryption system can be divided logically into three main components: [0004] Key Escrow Component (KEC). This component, which is operated by key escrow agents, manages the storage and release or use of data recovery keys. It may be part of a public-key certificate management system or part of a general key management infrastructure. In the remainder, the KEC will also be referred to as central device. [0005] User Security Component (USC). This is a hardware device or software program that provides data encryption and decryption capabilities as well as support for the key escrow function. In the remainder, the USC will usually be referred to as end device or device. [0006] Data Recovery Component (DRC). This consists of the algorithms, protocols, and equipment needed to obtain the plaintext from the ciphertext plus information in the DRC and provided by the KEC. It is active only as needed to perform a specific authorized data recovery. [0007] U.S. Pat. No. 5,016,276 describes the KPS (Key Pre-distribution System) Key Escrow Encryption System. In a basic form of KPS for a network of n devices, the KPS center (or key management center) generates [0008] secret keys, allocates each secret key to a different pair of devices and securely pre-distributes the secret keys to the devices in the pair. Each device stores n−1different keys. For each device with which it can communicate it uses a different one of those keys. It may, for instance, select that key based on the device ID of the device with which it wants to communicate. In a more complex form, KPS consists of a matrix M and a cryptographic function f. For a network of n devices, the KPS center generates: [0009] [0010] secret keys Kkl, one for each pair of devices k, l. [0011] n unique public keys Kpk and pre-distributes one to each device (those public keys may be, for instance, be used as the addresses of the devices in the network). [0012] a matrix M{Mi,j} of dimensions n×n having the following property: ƒ(Kpi, Mij)=ƒ(Kpj, Mji)=Kij=Kji. Each column of the matrix is associated with a specific one of the devices. The KPS center pre-distributes to device with ID K the associated column k of the matrix. This column constituting the secret information belonging to the device. [0013] During the initialisation of the communication between the two devices with IDs A and B, each entity sends its public key and its column number (column number a for device A, b for device B) to the other entity. Device A calculates ƒ(Kpb, Mba), device B calculates ƒ(KPa, Mab). Both devices obtain the same key Kab=Kba which they can use to communicate securely. As an example, ƒ(K,M) can be an encryption algorithm EK(M). The center generates [0014] keys and allocates one key to each pair of devices. The center generates the matrix M by calculating the matrix elements as Mi,j=EKp i (Ki,j), where [0015] Ki,j is the key allocated to the pair of devices I and J. [0016] Kpi is the public information of the device I. [0017] Mi is the element at the line i, in the column j (column that is sent to device J and that constitutes the secret information of this device). [0018]FIG. 1 illustrates how this algorithm is used during the communication between the devices. Each device sends its public information Kp i (e.g. an address) and its column number i to the other device. Using this information as a key to decrypt the element in its column corresponding to the other device, each device obtains the same secret key that they use to authenticate each other. Any suitable authentication scheme may be used. As an example, in a challenge-response way device I can generate a random number, encrypt it with its key Kji, send the encryption result to J, which decrypts it with its key Kij, and sends the plain form of the random number back. If this matches the original random number, this is an indication that J is authentic. [0019] It will be appreciated that columns and rows can be interchanged without changing the principle. Moreover, instead of associating a device with a column of keys (i.e. mere data used by an algorithm) where each key in turn is associated with a respective one of the devices with which it can communicate, the device can also be thought of as being associated with a set of algorithms, where each of these algorithms is associated with a respective one of the devices with which it can communicate. Those algorithms may be functionally unique, but may also be functionally the same but made to behave distinctly by incorporating a unique key. As such, ‘data’ and ‘algorithm’ can be interchanged as will be appreciated by persons skilled in the art. [0020] A problem with both the basic and complex form of the KPS system is that it is not practical for use in large systems, where the number of devices (expressed by n) is large (e.g ranging from several thousand to even hundreds of millions of devices). The amount of information which needs to be transmitted securely and that each device must store securely is not feasible. This is particularly true for CE devices, like telephones, which must be very low-cost and which are sold in high quantities. [0021] It is an object of the invention to provide a method, system and central for generating a common key that is suited for use in systems with a large number of devices, while and that is cost-effective. It is also an object to provide a method and device for using the common key. [0022] To meet the object of the invention, the system for generating a common encryption key for secure communication between devices includes: [0023] a plurality of devices, each associated with at least one unique device identifier; the plurality of devices being arranged in subgroups Si(i=1 . . . n) of devices, with at least one of the subgroups including a plurality of devices; and [0024] a central device including an algorithm generator for generating a key generating algorithm KGAi for each of the plurality of devices based on its associated unique device identifier; each of the key generating algorithms KGAi being unique for a respective associated subgroup Si with the key generating algorithms KGAi being the same for each device of the same subgroup Si; for each subgroup Si the associated key generating algorithm KGAi being operative to generate for devices of each subgroup Sj a common subgroup key SGKi,j for use in communication between a device of subgroup Si and a device of subgroup Sj; the common subgroup key SGKi,j being generated in response to receiving any one of the device identifiers associated with a device in the subgroup Sj; [0025] each device being associated with a respective storage for storing its associated key generating algorithm and including a processor for executing the associated key generating algorithm. [0026] By grouping devices in subgroups the number of common keys is reduced. The key generating algorithm only needs to be able to generate a unique key for each pair of subgroups instead of for each pair of devices. By still using the device identifiers as input to the algorithms, the publicly exchanged information hides the underlying subgrouping to malicious users. [0027] As described in the dependent claims 2 and 3, preferably the device ID is reduced in number of bits, by hashing the device ID. The reduced number of bits can be seen as a subgroup identifier used for generating the common subgroup key. Hashing algorithms are generally known. Any suitable hashing algorithm may be used. [0028] As described in the dependent claim 4, the subgroups are associated with predetermined functionality. For a simple system used for CE applications, the subdivision in different subgroups may start with a division between control (could be the device with a central role within the domestic piconet), source, rendering, processing, or copying devices. Preferably, more than five subgroups are created. This can, for instance, be achieved by further distinguishing between audio or video devices, giving ten subgroups in this example. A further distinction can be made between the types of audio/video data, like audio in the form of a PCM file or MP3 or ATRAC or AAC . . . , video in the form of a MPEG file or MPEG2. In this way, many subgroups can be created. Each subgroup leads to more different common keys, and as such increases the security of the system at higher cost, for instance caused by an increase in storage requirements. A person skilled in the art will be able to make an optimal choice for a system in question. [0029] As described in the dependent claim 7, the device determines the functionality of a further device from the subgroup identifier of that device and communicates with that device according to that functionality. For instance, a source device may allow certain digital content to be sent to a rendering device but may refuse it being sent to a copying device. As a further example, a source device may allow reproduction by only one rendering device at a time. [0030] As described in the dependent claims 8 and 9, the key generating algorithm KGAi associated with subgroup Si includes a set SGEDRi of representations of common subgroup keys that includes for each subgroup Sj a representation of a respective unique common subgroup key SGKi,j. These representation may simply form a column of keys. The keys may be in plaintext form. This is a storage-effective way of achieving that the key generating algorithm produces a different output for each subgroup Sj by being fed by different keys. [0031] As described in the dependent 10, and 11, security is increased by mixing the device identifier with secret information and using the outcome to encrypt the common subgroup keys. [0032] As described in the dependent claim 12, the subgroups are grouped into groups, allowing the use of a more limited number of unique common keys for pairs of groups instead of unique common keys for each pair of subgroups. The groups are, preferably, also arranged according to functionality. As described in claim 13, the grouping can be advantageously used for broadcasting, allowing a broader range of devices to receive the protected information via the same communication channel. For instance, if a first group of devices is formed by source devices and a second group of devices is formed by rendering devices, a source device may allow all rendering devices to simultaneously receive the same protected content. It may, for instance, do this by fully authenticating each rendering device that wishes to establish a communication session. It may, at its choice, also limit the number of rendering devices by at a certain moment stopping the authentication (e.g. by not providing its device identifier to a second or third rendering device). [0033] These and other aspects of the invention will be apparent from and elucidated with reference to the embodiments shown in the drawings. [0034]FIG. 1 shows a block diagram of the prior art KPS system, FIG. 2 shows a block diagram of a prior art key escrow system, FIG. 3 shows the source code for the prior art TEA block cipher, FIG. 4 shows the prior art Davies-Meyer scheme for using a block cipher as a hash function; [0035]FIG. 5 illustrates the arrangement of devices in groups and subgroups according to the invention; [0036]FIG. 6 shows an embodiment wherein the public Device ID is mixed with secret information; [0037]FIG. 7 shows the overall allocation of key information between the KEC and the devices; [0038]FIG. 8 shows details of generation of the common key in a device; [0039]FIG. 9 shows the prior art link level Bluetooth protocols for authentication and key generation between Bluetooth devices; and [0040]FIG. 10 shows adding application layer security according to the invention to the Bluetooth link layer security. [0041]FIG. 2 shows a block diagram of a prior art key escrow system as also applies to the system according to the invention. Block 200 shows the Key Escrow Component (KEC). For simplicity, it can be regarded that this entity has the responsibility of stocking, releasing and managing the whole key material infrastructure. Block 210 shows the Data Recovery Component (DRC) which performs a specific authorized data recovery. Blocks 220 and 230 show respective User Security Component (USC), also referred to as device (DEV). Only two devices are shown, but it will be appreciated that the system according to the invention is optimal for systems with a possibly very large number of devices. It will be appreciated that with system is meant all components using the same common key scheme. In practice a user may only have a few end devices in a much smaller systems at his home. These devices could in principle also have been working in systems in other homes and as such can be seen as being part of one large system. The USC component is typically embedded in a CE device and executes all the encryption, decryption, and hash operations involved in the content protection system according to the invention. In principle, key escrow systems are known. The system according to the invention can be executed in the existing or future hardware platforms suitable for a key escrow system. In particular, the device may include a conventional processor or specialized cryptographic processor for executing the key generating algorithm according to the invention. The processor is usually operated under control of a suitable program product (firmware) to perform the steps of the algorithm according to the invention. This program is normally loaded from a background storage, such as a harddisk or ROM. The computer program product can be stored in the background storage after having been distributed on a storage medium, like a CD-ROM, a smart-card, or via a network, like the public Internet. Sensitive information, like the key generating algorithm is preferably transferred from the central device 200 to the associated device in a secure way. The figure shows using a secure storage 222 and 232, like a smartcard, card, for transferring the algorithm to the associated device. It is also possible that the central device has transferred relevant data for many algorithms to a manufacturer of the devices, where the manufacturer ensures that each device is provided with the algorithm associated with the device. Many ways of securely passing on such data and algorithms are know. Such mechanisms are not the subject of the invention. [0042] Prior Art Cryptographic Functions [0043] Hash Function [0044] A hash function is a function that maps an input of arbitrary length into a fixed number of output bits. There are two types of hash functions. A MAC (Message Authentication Code) that uses a secret key, and an MDC (Manipulation Detection Code) that works without a key. In the following description the use of MACs is preferred, using sometimes the term hash for MAC. An important property of a MAC is that: “it should be impossible to compute the MAC without knowledge of the secret key”. It has not to be collision resistant (meaning that it is computationally possible to find two arguments hashing to the same result). This also means that it is very difficult if not impossible to compute the argument of the MAC from the MAC itself without the knowledge of the secret key. When placed within a cryptographic architecture, a MAC should be seen as a fence for people that don't have the secret key. [0045] Block Cipher TEA [0046] The Tiny Encryption Algorithm (TEA) is currently one of the fastest and most efficient cryptographic algorithms. Its latest versions are believed to be robust against known cryptanalysis. TEA takes as input a block of 64 bits, uses a key of 128 bits to produce a cipher of 64 bits. The algorithm itself requires a constant of 32 bits, a 32 bits variable to hold the current sum and two 32 bits intermediate variables. The TEA algorithm is described in source code. This code is shown in FIG. 3. It should be noted that the common key generating algorithm according to the invention does not rely on the use of a specific cipher. Any suitable cipher may be used. [0047] Hash Based on a Cipher [0048] A block ciphers, like TEA, can be used for encryption/decryption purposes but also as hash function. Various ways of achieving this are known. FIG. 4 shows the so-called Davies-Mayer scheme. It requires: [0049] a generic n-bit block cipher EK (for instance TEA) parameterized by a symmetric key K; [0050] a fixed initial value IV, suitable for use with E. [0051] The input is a bitstring x, the output an n-bit hash-code of x. The input x is divided into k-bit blocks xi where k is the key size, and padded, if necessary, to complete the last block. Denote the padded message consisting of t k-bit blocks: x1x2 . . . xt. A constant n-bit initial value IV is pre-specified. The output is Ht is defined by: H0=IV; H i =E x(H i−1){circle over (+)}H i−1, 1<i<t. [0052] Content Protection System [0053] According to the invention, the system can incorporate a very large number of devices. As it is not possible to create different secret keys for each possible pair of devices, the devices are arranged in a plurality of disjunct subgroups Si of devices. Preferably, the devices within a same subgroup have the same or similar functionality (e.g. all same phones or all devices capable of rendering MP3 audio). With similar functionality is meant that means that such devices have the same behavior in the system, even if, for security reason, it is not visible from the user point of view. In a further embodiment, the subgroups are again arranged in groups. This higher level grouping is not required but opens further possibilities as will be elaborated below. For the remainder of the description it is assumed that both levels of grouping are used. [0054]FIG. 5 illustrates the arrangement of devices in groups and subgroups according to the invention. Shown are groups 320, 321 and 322 of devices. Each of those groups includes at least one subgroup of devices. A subgroups falls entirely within a group (so a subgroup does not fall into two or more groups). At least one of the groups includes at least two subgroups. Shown are the subgroups 301, 302, 303, 304, and 305. Each subgroup includes at least one device. A device is a member of only one subgroup for one set of functionality. It may be desired that a multi-function device is part of several subgroups. This can simply be achieved by letting the device have multiple device identifiers. In this sense, such a multi-function device is regarded as several devices. [0055] Each device receives a different public key, called a Device ID. This may be the same (but does not need to be the same) as the device uses for identification (e.g. device address) in the communication with another device. As will be described in more detail below, devices with similar functionality (i.e. in the same subgroup) still receive unique Device IDs, however those IDs have been generated/selected such that they result in the same behavior according to the described algorithm. [0056] Instead of having a different secret key for each possible pair of devices, there is a different secret key for each pair of subgroups or groups, including reflections. This secret key is called the Secret Group Key SGKG a ,G b for each respective pair of groups Ga and Gb or Secret SubGroup Key SGKi,j for each respective pair of subgroups Si and Sj. The description will focus on using group keys. [0057] For an advanced embodiment of the system, preferably, the following functions are used: [0058] 3 hash functions HASH1, HASH2, HASH3 using H01, H02, H03 as secret keys. [0059] The operation shown in FIG. 6, called extraction of UDK (Unique Device Key). Starting from HASH1(Device ID), the bits set to 1 in the output of this hash function are used to select elements in a vector (called Key Material Record, see below for the meaning of the name). The selected elements are XORed together indicated by {circle over (+)}. The result is hashed using HASH3. In the following description, this entire function starting with HASH1 to and including HASH3 will be referred to as F1( ). The purpose of F1 is to ensure that public key Device ID is not directly used in the algorithm but is mixed with secret information unique for the device. The HASH3 functions to protect exposing elements of the Key Material Record. HASH1 functions to match the size of the device ID to the number of elements in the Key Material Record. As such any length of Key Material Record can be used. It will be appreciated any suitable mixing algorithm may be used. If no high level of security is required also the Device ID can be directly used. [0060] Construction of the System [0061] Steps of construction: [0062] All devices in the entire system are divided into g different groups Gk, k going from 1 to g (example of groups: recording devices, rendering devices, processing devices, . . . ). [0063] The KEC generates [0064] random Secret Group Keys (SGK). The Secret Group Keys are the keys that will be recovered at the end of the protocol and that will enable the content protected communication between two devices. There is such a SGK for each groups pair including reflections. [0065] The KEC generates and provides to all devices a Key Material Record (KMR) as a list of random numbers. As described earlier, use of the mixing based on the KMR is optional. [0066] For each group Gk, the KEC generates nk sets (also referred to as subgroups) of similar [0067] each set including at least one Device ID, and distributes the respective Device IDs to the associated device belonging to this group. Those Device IDs are random numbers and constitute the only public information. The Device IDs are generated such that: [0068] For Device IDs belonging to different sets of similar Device IDs: [0069] The last m bits of HASH2(Device ID) are different (with 2m>n and 2m−1<n). It will be appreciated that instead of using the last m bits also m other bits can be selected in a predetermined way. Note that randomly generating n numbers with last m bits different requires the generation of [0070] numbers. To give an example, 304 numbers will be required to generate 64 (26) numbers satisfying the condition and 168449 numbers to generate 16382 (214) numbers satisfying the same condition. [0071] * The numbers (called Unique Device Key(UDK) of this Device ID) equal to F1(Device ID) are different. As indicated before, use of F1 is optional. If F1 is not used, UDK equals the Device ID and as such is automatically unique. [0072] For Device IDs belonging to the same set of similar Device IDs, [0073] The last (or any predetermined position of) m bits of HASH2(Device ID) are identical (with 2m>n and 2m−1<n) [0074] The number (called Unique Device Key(UDK) of this Device ID) equal to F1(Device ID) are identical. As described above, the use of F1 is optional. [0075] For each group Gl, the KEC generates and sends to each device belonging to this group a Secret Group ID Record (SGIDRl) in the form of a column of n numbers generated such that: for each set of similar Device IDs and considering only one Device ID in each set, [0076] m being equal to the number formed from the last significant bits in HASH2(Device ID), [0077] Unique Device Keym being equal to F1(Device ID) [0078] Secret Group KeyG l G m being the Secret Group Key used for the communication between devices belonging to the group Gland devices belonging to the group Gm [0079] SGIDRml, the element at row m in the Secret Group ID Record of group Gl is equal to E(Unique Device Keym, Secret Group KeyG l G m ). [0080] As illustrated in FIG. 7, eventually, a device belonging to the group Gk contains: [0081] one of the Device ID of the group Gk, [0082] the Secret Group IDs Record of the group Gk(SGIDRk), and [0083] optionally, the Key Material Record (KMR). [0084] The KEC stocks all the Device IDs, the g Secret Group IDs Records and the Key Material Record. [0085]FIG. 8 shows details of generation of the common key in a device. Each device optionally calculates F1(Device ID) of the other device's Device ID, the result is the Unique Device Key(UDK) of the other device. Each device also hashes (HASH2) the other device's Device ID and uses the m least significant bits of the result as a line number in the Secret Group IDs Record(SGIDR). The HASH2 function operates to reduce the number of bits in the public device ID to only m bits where the system supports up to 2m subgroups. The Secret Group ID Record contains an element for each subgroup. In principle, these elements may be stored in plaintext form. To increase security, it is preferred that these elements are stored in an encrypted form. As shown, in device A the element that corresponds to device B is has been encrypted by the KEC under control of the UDK corresponding to the Device ID of B. Therefore, device A decrypts this element under control of the same UDK. In this way device A retrieves SGKG A G B which is the Secret Group Key that devices of the same group than the device A (group GA) use to communicate with devices of the same group than B (group GB). In the described preferred embodiment, the UDK is the same for devices of the same subgroup. Moreover, the elements in the Secret Group ID Record, although they correspond to respective subgroups, are in fact representative of the group of the subgroup. So, in a system with four groups of each three subgroups, the Secret Group ID Record contains a 12 elements, since there are twelve subgroups. These 12 elements represent in fact only four common group keys (three representations for each group). Each of the three representations for the same group are the result of encrypting the common group key with respective UDKs for the three subgroups within the group, giving three different elements in the Secret Group ID Record. Consequently, the record includes 12 different elements. It will be clear that if a subdivision at group level is not required, then instead of representing the four common group keys in the record, simply twelve common subgroup keys could have been placed in the record. [0086] Note that in the system according to the invention no line number is transmitted unlike the known PKS system. This increases the security, since the position in the record is not known to malicious users. [0087] Bluetooth [0088] Content protection is, for instance, used when data is digitally transferred from a sending device to a receiving device to ensure that only an authorized receiving device is able to process or render the content. The Bluetooth technology provides peer-to-peer communication over a relatively short distance of approximately ten meters. The system provides security measures both at the application layer and at the link layer. The link layer security measures are described in Chapter 14 “Bluetooth Security” of section “Baseband Specification” of the Bluetooth Specification Version 1.0A of Jul. 24, 1999. This chapter describes the way in which authentication takes place between Bluetooth devices and the generation of keys which can be used for encryption/decryption purposes. Four different entities are used for maintaining security at the link layer: a public address which is unique for each user (the 48-bit IEEE Bluetooth device address, BD_ADDR), a private user key for authentication, a private user key for encryption and a random number (RAND) of 128 bits. The encryption key can be used for content protection. The random number is different for each new transaction. The private keys are derived during initialization and are further never disclosed. Normally, the encryption key is derived from the authentication key during the authentication process. For the authentication algorithm, the size of the key used is always 128 bits. For the encryption algorithm, the key size may vary between 1 and 16 octets (8 -128 bits). The size of the encryption key is configurable, among others to meet the many different requirements imposed on cryptographic algorithms in different countries-both with respect to export regulations and authority attitudes towards privacy in general. The encryption key is entirely different from the authentication key (even though the latter is used when creating the former). Each time encryption is activated, a new encryption key shall be generated. Thus, the lifetime of the encryption key does not necessarily correspond to the lifetime of the authentication key. It is anticipated that the authentication key will be more static to its nature than the encryption key—once established the particular application running on the Bluetooth device decides when, or if, to change it. To underline the fundamental importance of the authentication key to a specific Bluetooth link, it will often be referred to as link key. The RAND is a random number which can be derived from a random or pseudo-random process in the Bluetooth unit. This is not a static parameter, it will change frequently. FIG. 9 shows the current Bluetooth protocols for authentication and key generation between Bluetooth devices at the link layer. [0089] The described Bluetooth security mechanism has the following problems: [0090] The PIN number may be chosen by the user. It is in the interest of a user to ensure that no unauthorised person can use his Bluetooth device(s). As such, a user may be expected to use the Bluetooth system as intended for purposes which, for instance, involve privacy. However, if the system is used to exchange digital content for which the user has to pay, the user may be tempted to try and break the security. By changing the PIN number, a malicious user is able to retrieve all the link keys and the encryption key. This means that the user is able to intercept and decrypt encrypted content or authenticate non-compliant devices. [0091] The encryption key is of variable size depending on the country where the device is used. In some countries, this size may be of 8 bits. An exhaustive search of those encryption key will then only require 256 (28) attempts. Allowing such a low level of security to be used could result in digital content being easily obtained in one country and then illegally being distributed to other countries. [0092] It is therefore preferred that at the application layer a Content Protection System is used that provides protection of the content against infringers including a malicious user. [0093]FIG. 10 shows how the application layer security according to the invention can be described as an augmented version of the Bluetooth link layer security. This improves Bluetooth's security so that it can be used for exchange of digital content. The Secret Group Key SGKG A G B is inserted at the very beginning and before encryption. The protocol takes place before devices establish the communication for the very first time. The result, SGKG A G B is mixed with the PIN code (the mixing function may be a simple bitwise XOR operation, however it is preferred to encrypt the PIN code with SGKG A G B ) to provide: [0094] a mechanism robust against malicious user for authentication, in which devices can proof to each other that they are certified as being compliant. [0095] an additional level of robustness (tunable via the choice of the mixing function) to the privacy protection. [0096] If the first goal is not required, then the key should only be used for the second step. After that, the SGKG A G B is mixed with the Encryption Key (the mixing function may be again be a simple bitwise XOR operation, or based on encrypting the code with SGKG A G B ) to afford: [0097] a robust content protection. [0098] a mechanism to allow escrow of private communications in countries where this is a legal requirement. [0099] In the countries where the encryption key is very little, it may be possible for a malicious user to retrieve SGKG A G B , especially if the result of the last XOR is used to encrypt the whole communication. To prevent this, the key from the last XOR (strong encryption key) might be used to establish, exchange and update a new key that will be used for the rest of the communication. [0100] Point-To-Multipoint Communication (Broadcasting or Multicasting) [0101] So far the description has focussed on communication between two devices. An advantage of the proposed system, compared to the complex KPS is that it can make it easier for a master device to communicate with several slave devices. When considering a master device belonging to the group GK (e.g. the group of processing devices like Set Top Boxes) and m slave devices of the same group GL (e.g. the group of rendering devices like headphones), the proposed system facilitates the point-to-multipoint communication between the master and the slave devices. Indeed, as a Secret Group Key is attached to a certain pair of groups, a content protected communication between the master device and the slave devices is possible just by using the same Secret Group Key SGKKL. [0102] In the Bluetooth protocol at the link layer, point-to-multipoint communication is possible thanks to the generation of a master key (see FIG. 9). The master key is generated by the master from two random numbers and a cryptographic function E22. Then, repeating the same exchanges of messages as described in FIG. 9 (see function E22) with each slaves, the master securely communicates the master key to the slaves. In the Bluetooth protocol with content protection at the application layer, because the slave devices belong to the same group, when initiating the communication with the master device, the Secret Group Keys generated during the Content Protection protocol (see FIG. 10) will always be the same. From that point, the master device generates the master key, securely transmit it with the slave devices and the point-to-multipoint communication can take place. [0103] DRC: Key Recovery [0104] In countries where key escrow is a legal requirement, the authorized authorities receive a special device, containing the DRC. In order for the DRC to be able to retrieve the plaintext from the ciphertext, the KEC sends to the DRC the Key Material Record, the Secret Group IDs Records, the constants used in the hash functions and the repartition of the Device IDs between the groups. Then, when a communication occurs, the DRC is able to select the correct key SGKAB from the device IDs and is able, in the countries where this is a legal requirement, to retrieve the strong encryption key using a brute force attack on the weak encryption key. [0105] Flexibility [0106] The presented protocol does not prescribe using specific algorithms for the basic functions, like encryption, decryption, authentication, and hashing. Even the optional function F1 may be replaced by any other one-way function. All lengths in bits of the elements in the UDK, SGIDR, SGK and the length of the output of HASH3 can be tailored to the chosen algorithms. It is also not prescribed how many groups, subgroups or Device Ids there are. Of course, the more subgroups there are, the more secure the protocol will be. Two devices from the same set of similar devices can share the same Device ID. Note that a device can have more than one functionality. In those cases, there is a connection for each application/functionality. [0107] Dimensions of the Records [0108] Concerning the Key Material Record, its size should be at least enough to provide a different Unique Device Key to each Device ID. In theory, if there are n elements in the record, then there must be [0109] different possible outputs of the XOR, but in practice, the size should be as big as possible in order to make it easier to generate Device IDs with different output of F1. Each Secret Group ID Record must contain as many elements as there are sets of similar Device IDs. It is also possible to make bigger records in order to complicate the task of attackers. [0110] Updating [0111] It is preferred to be able to update the secret information contained in a device whenever those secrets are publicly known. The proposed solution relies on shared secrets and is by nature of a limited security. Changing the secrets is a good way to-reinitialize the security of the system. Secrets that could be updateable are: [0112] The constants used for the hash functions. [0113] The Secret Group IDs [0114] The Key Material Records [0115] The Unique Device Key [0116] The Secret Group Keys [0117] Note that modifying those secrets automatically requires changing the Device IDs. [0118] Device Revocation [0119] In addition to the updatability of the secrets, it is preferred to be able to revoke devices. Three kinds of revocations may be distinguished: [0120] Revocation of a group of devices: may be done by e.g. modifying one of the hash's initial constant in all the devices belonging to this group or, by modification of all the devices, by invalidating all the elements in the Secret Group IDs Records containing the Secret Group Key that allow each specific device to communicate with this specific group of devices. [0121] Revocation of a set of similar devices: may be done by e.g. modifying one of the hash's initial constant in all the devices belonging to this set of similar devices or by modification of the element in the Secret Group IDs Records that allow each specific device to communicate to a device of this specific set of similar devices. [0122] Revocation of a specific device: in a system where several devices can share the same Device ID and because of the existence of similar devices having a Device ID with the same behavior in the system, that revocation can only be done by the device itself, by the modification of e.g. the hash's initial constant. [0123] When a device is revoked, the authentication following the additional protocol will fail. 1. A system for generating a common encryption key for secure communication between devices; the system including: a plurality of devices, each associated with at least one unique device identifier; the plurality of devices being arranged in subgroups Si(i=1 . . . n) of devices, with at least one of the subgroups including a plurality of devices; and a central device including an algorithm generator for generating a key generating algorithm KGAi for each of the plurality of devices based on its associated unique device identifier; each of the key generating algorithms KGAi being unique for a respective associated subgroup Si with the key generating algorithms KGAi being the same for each device of the same subgroup Si; for each subgroup Si the associated key generating algorithm KGAi being operative to generate for devices of each subgroup Sj a common subgroup key SGKi,j for use in communication between a device of subgroup Si and a device, of subgroup Sj; the common subgroup key SGKi,j being generated in response to receiving any one of the device identifiers associated with a device in the subgroup Sj; each device being associated with a respective storage for storing its associated key generating algorithm and including a processor for executing the associated key generating algorithm. 2. A system as claimed in claim 1, wherein the algorithm generator is operative to hash a unique device identifier to a subgroup identifier associated with a respective one of the subgroups and generating the key generating algorithm in dependence on the subgroup identifier. 3. A system as claimed in claim 1, wherein the key generating algorithm is operative to hash a unique device identifier to a subgroup identifier associated with a respective one of the subgroups and generating the common key in dependence on the 4. A system as claimed in claim 1, wherein at least one of the subgroups of devices is associated with predetermined functionality. 5. A system as claimed in claim 4, wherein at least devices having a respective recording, rendering or processing functionality are arranged in respective subgroups. 6. A system as claimed in claim 5, wherein a device associated with at least two respective functionalities is associated with at least two respective unique identifiers, each corresponding to a respective subgroup. 7. A system as claimed in claim 4, wherein a device is operative to, in response to receiving a device identifier from a further device in the system, is operative to hash the device identifier to a subgroup identifier associated with a respective one of the subgroups; to determine the functionality of the further device in dependence on the subgroup identifier and to communicate with the further device in dependence on the determined functionality. 8. A system as claimed in claim 1, wherein the algorithm generator is operative to (pseudo-)randomly generate a common subgroup key SGKi,j for each respective pair of subgroups Si and Sj; the key generating algorithm KGAi associated with devices of subgroup Si including a set SGIDRi of representations of common subgroup keys that includes for each subgroup Sj a representation of a respective unique common subgroup key SGKi,j. 9. A system as claimed in claim 8, wherein for each subgroup Si the associated key generating algorithm KGAi is operative to generate the common subgroup key SGKi,j for use in communication to a device in the subgroup Sj by selecting a representation of the common subgroup key SGKi,j from the set SGIDRi of representations of common subgroup keys included in the algorithm. 10. A system as claimed in claim 8, wherein for each i and j the algorithm generator is operative to mix a device identifier of a device associated with the subgroup Sj with secret information associated with the subgroup Si and to use the mixing output as a key for encrypting the common subgroup key SGKi,j and using the encryption outcome as the representation of the common group key SGKi,j. 11. A system as claimed in claim 10, wherein the key generating algorithm KGAi associated with subgroup Si is operative to mix a device identifier of a device associated with subgroup Sj with secret information associated with the subgroup Si and to use the mixing output as a key for decrypting the representation of the common subgroup key SGKi,j. 12. A system as claimed in claim 1, wherein the subgroups of devices are arranged in groups; each group including at least one of the subgroups and at least one group including a plurality of subgroups; each respective pair of groups Ga and Gb being associated with a unique common group key SGKG a ,G b which is identical to the common subgroup key SGKi,j for all subgroups Si of group Ga and all subgroups Sj of group Gb. 13. A system as claimed in claim 12, wherein a device of a subgroup Si of group Ga is operative to use the same common group key SGKG a ,G b for broadcast or multicast communication to a plurality of devices of at least one subgroup Sj of group Gb. 14. A central device for use in a system for generating a key generating algorithm for secure communication between devices, each of a plurality of devices being associated with at least one unique device identifier; the plurality of devices being arranged in subgroups Si(i=1 . . . n) of devices, with at least one of the subgroups including a plurality of devices; the central device including an algorithm generator for generating a key generating algorithm KGAi for each of the plurality of devices based on its associated unique device identifier; each of the key generating algorithms KGAi being unique for a respective associated subgroup Si with the key generating algorithms KGAi being the same for each device of the same subgroup Si; for each subgroup Si the associated key generating algorithm KGAi being operative to generate for devices of each subgroup Sj a common subgroup key SGKi,j for use in communication between a device of subgroup Si and a device of subgroup Sj; the common subgroup key SGKi,j being generated in response to receiving any one of the device identifiers associated with a device in the subgroup Sj. 15. A device for securely communicating to another device using a common encryption key; the device being associated with at least one unique device identifier and being a member of one of a plurality of subgroups Si(i=1 . . . n) of devices, with at least one of the subgroups including a plurality of devices; the device being associated with a respective storage for storing an associated key generating algorithm and including a processor for executing the associated key generating algorithm; the key generating algorithms KGAi being unique for the associated subgroup Si with the key generating algorithms KGAi being the same for each device of the same subgroup Si; the key generating algorithm KGAi being operative to generate for devices of each subgroup Sj a common subgroup key SGi,j for use in communication with a device of subgroup Sj; the common subgroup key SGKi,j being generated in response to receiving any one of the device identifiers associated with a device in the subgroup Sj. 16. A method for generating a key generating algorithm for secure communication between devices in a system, where the system includes a plurality of devices, each associated with at least one unique device identifier; the plurality of devices being arranged in subgroups Si(i=1 . . . n) of devices, with at least one of the subgroups including a plurality of devices; the method including generating a key generating algorithm KGAi for each of the plurality of devices based on its associated unique device identifier; each of the key generating algorithms KGAi being unique for a respective associated subgroup Si with the key generating algorithms KGAi being the same for each device of the same subgroup Si; for each subgroup Si the associated key generating algorithm KGAi,j being operative to generate for devices of each subgroup Sj a common subgroup key SGKi,j for use in communication between a device of subgroup Si and a device of subgroup Sj; the common subgroup key SGKi,j being generated in response to receiving any one of the device identifiers associated with a device in the subgroup Sj. 17. A computer program product, wherein the program product is operative to perform the method of claim 16. 18. A method for generating a common encryption key for secure communication between devices; each of the devices being associated with at least one unique device identifier;- and each of the devices being a member of one of a plurality of subgroups Si(i=1 . . . n) of devices, with at least one of the subgroups including a plurality of devices; the method including using a key generating algorithm KGAi, which is unique for a subgroup Si with the key generating algorithms KGAi being the same for each device of the same subgroup Si, to generate for devices of each subgroup Sj a common subgroup key SGKi,j for use in communication between a device of subgroup Si and a device of subgroup Sj; the common subgroup key SGKi,j being generated in response to receiving any one of the device identifiers associated with a device in the subgroup Si. 19. A computer program product, wherein the program product is operative to perform the method of claim 18.

2001-10-17

en

2003-07-17

US-17675402-A

Secreted and transmembrane polypeptides and nucleic acids encoding the same ABSTRACT The present invention is directed to novel polypeptides and to nucleic acid molecules encoding those polypeptides. Also provided herein are vectors and host cells comprising those nucleic acid sequences, chimeric polypeptide molecules comprising the polypeptides of the present invention fused to heterologous polypeptide sequences, antibodies which bind to the polypeptides of the present invention and to methods for producing the polypeptides of the present invention. FIELD OF THE INVENTION [0001] The present invention relates generally to the identification and isolation of novel DNA and to the recombinant production of novel polypeptides. BACKGROUND OF THE INVENTION [0002] Extracellular proteins play important roles in, among other things, the formation, differentiation and maintenance of multicellular organisms. The fate of many individual cells, e.g., proliferation, migration, differentiation, or interaction with other cells, is typically governed by information received from other cells and/or the immediate environment. This information is often transmitted by secreted polypeptides (for instance, mitogenic factors, survival factors, cytotoxic factors, differentiation factors, neuropeptides, and hormones) which are, in turn, received and interpreted by diverse cell receptors or membrane-bound proteins. These secreted polypeptides or signaling molecules normally pass through the cellular secretory pathway to reach their site of action in the extracellular environment. [0003] Secreted proteins have various industrial applications, including as pharmaceuticals, diagnostics, biosensors and bioreactors. Most protein drugs available at present, such as thrombolytic agents, interferons, interleukins, erythropoietins, colony stimulating factors, and various other cytokines, are secretory proteins. Their receptors, which are membrane proteins, also have potential as therapeutic or diagnostic agents. Efforts are being undertaken by both industry and academia to identify new, native secreted proteins. Many efforts are focused on the screening of mammalian recombinant DNA libraries to identify the coding sequences for novel secreted proteins. Examples of screening methods and techniques are described in the literature [see, for example, Klein et al., Proc. Natl. Acad. Sci. 93:7108-7113 (1996); U.S. Pat. No. 5,536,637)]. [0004] Membrane-bound proteins and receptors can play important roles in, among other things, the formation, differentiation and maintenance of multicellular organisms. The fate of many individual cells, e.g., proliferation, migration, differentiation, or interaction with other cells, is typically governed by information received from other cells and/or the immediate environment. This information is often transmitted by secreted polypeptides (for instance, mitogenic factors, survival factors, cytotoxic factors, differentiation factors, neuropeptides, and hormones) which are, in turn, received and interpreted by diverse cell receptors or membrane-bound proteins. Such membrane-bound proteins and cell receptors include, but are not limited to, cytokine receptors, receptor kinases, receptor phosphatases, receptors involved in cell-cell interactions, and cellular adhesin molecules like selectins and integrins. For instance, transduction of signals that regulate cell growth and differentiation is regulated in part by phosphorylation of various cellular proteins. Protein tyrosine kinases, enzymes that catalyze that process, can also act as growth factor receptors. Examples include fibroblast growth factor receptor and nerve growth factor receptor. [0005] Membrane-bound proteins and receptor molecules have various industrial applications, including as pharmaceutical and diagnostic agents. Receptor immunoadhesins, for instance, can be employed as therapeutic agents to block receptor-ligand interactions. The membrane-bound proteins can also be employed for screening of potential peptide or small molecule inhibitors of the relevant receptor/ligand interaction. [0006] Efforts are being undertaken by both industry and academia to identify new, native receptor or membrane-bound proteins. Many efforts are focused on the screening of mammalian recombinant DNA libraries to identify the coding sequences for novel receptor or membrane-bound proteins. SUMMARY OF THE INVENTION [0007] In one embodiment, the invention provides an isolated nucleic acid molecule comprising a nucleotide sequence that encodes a PRO polypeptide. [0008] In one aspect, the isolated nucleic acid molecule comprises a nucleotide sequence having at least about 80% nucleic acid sequence identity, alternatively at least about 81 % nucleic acid sequence identity, alternatively at least about 82% nucleic acid sequence identity, alternatively at least about 83% nucleic acid sequence identity, alternatively at least about 84% nucleic acid sequence identity, alternatively at least about 85% nucleic acid sequence identity, alternatively at least about 86% nucleic acid sequence identity, alternatively at least about 87% nucleic acid sequence identity, alternatively at least about 88% nucleic acid sequence identity, alternatively at least about 89% nucleic acid sequence identity, alternatively at least about 90% nucleic acid sequence identity, alternatively at least about 91% nucleic acid sequence identity, alternatively at least about 92% nucleic acid sequence identity, alternatively at least about 93% nucleic acid sequence identity, alternatively at least about 94% nucleic acid sequence identity, alternatively at least about95% nucleic acid sequence identity, alternatively at least about 96% nucleic acid sequence identity, alternatively at least about 97% nucleic acid sequence identity, alternatively at least about 98% nucleic acid sequence identity and alternatively at least about 99% nucleic acid sequence identity to (a) a DNA molecule encoding a PRO polypeptide having a full-length amino acid sequence as disclosed herein, an amino acid sequence lacking the signal peptide as disclosed herein, an extracellular domain of a transmembrane protein, with or without the signal peptide, as disclosed herein or any other specifically defined fragment of the full-length amino acid sequence as disclosed herein, or (b) the complement of the DNA molecule of (a). [0009] In other aspects, the isolated nucleic acid molecule comprises a nucleotide sequence having at least about 80% nucleic acid sequence identity, alternatively at least about 81% nucleic acid sequence identity, alternatively at least about 82% nucleic acid sequence identity, alternatively at least about 83% nucleic acid sequence identity, alternatively at least about 84% nucleic acid sequence identity, alternatively at least about 85% nucleic acid sequence identity, alternatively at least about 86% nucleic acid sequence identity, alternatively at least about 87% nucleic acid sequence identity, alternatively at least about 88% nucleic acid sequence identity, alternatively at least about 89% nucleic acid sequence identity, alternatively at least about 90% nucleic acid sequence identity, alternatively at least about 91% nucleic acid sequence identity, alternatively at least about 92% nucleic acid sequence identity, alternatively at least about 93% nucleic acid sequence identity, alternatively at least about 94% nucleic acid sequence identity, alternatively at least about 95% nucleic acid sequence identity, alternatively at least about 96% nucleic acid sequence identity, alternatively at least about 97% nucleic acid sequence identity, alternatively at least about 98% nucleic acid sequence identity and alternatively at least about 99% nucleic acid sequence identity to (a) a DNA molecule comprising the coding sequence of a full-length PRO polypeptide cDNA as disclosed herein, the coding sequence of a PRO polypeptide lacking the signal peptide as disclosed herein, the coding sequence of an extracellular domain of a transmembrane PRO polypeptide, with or without the signal peptide, as disclosed herein or the coding sequence of any other specifically defined fragment of the full-length amino acid sequence as disclosed herein, or (b) the complement of the DNA molecule of (a). [0010] In a further aspect, the invention concerns an isolated nucleic acid molecule comprising a nucleotide sequence having at least about 80% nucleic acid sequence identity, alternatively at least about 81% nucleic acid sequence identity, alternatively at least about 82% nucleic acid sequence identity, alternatively at least about 83% nucleic acid sequence identity, alternatively at least about 84% nucleic acid sequence identity, alternatively at least about 85% nucleic acid sequence identity, alternatively at least about 86% nucleic acid sequence identity, alternatively at least about 87% nucleic acid sequence identity, alternatively at least about 88% nucleic acid sequence identity, alternatively at least about 89% nucleic acid sequence identity, alternatively at least about 90% nucleic acid sequence identity, alternatively at least about 91 % nucleic acid sequence identity, alternatively at least about 92% nucleic acid sequence identity, alternatively at least about 93% nucleic acid sequence identity, alternatively at least about 94% nucleic acid sequence identity, alternatively at least about 95% nucleic acid sequence identity, alternatively at least about 96% nucleic acid sequence identity, alternatively at least about 97% nucleic acid sequence identity, alternatively at least about 98% nucleic acid sequence identity and alternatively at least about 99% nucleic acid sequence identity to (a) a DNA molecule that encodes the same mature polypeptide encoded by any of the human protein cDNAs deposited with the ATCC as disclosed herein, or (b) the complement of the DNA molecule of (a). [0011] Another aspect the invention provides an isolated nucleic acid molecule comprising a nucleotide sequence encoding a PRO polypeptide which is either transmembrane domain-deleted or transmembrane domain-inactivated, or is complementary to such encoding nucleotide sequence, wherein the transmembrane domain(s) of such polypeptide are disclosed herein. Therefore, soluble extracellular domains of the herein described PRO polypeptides are contemplated. [0012] Another embodiment is directed to fragments of a PRO polypeptide coding sequence, or the complement thereof, that may find use as, for example, hybridization probes, for encoding fragments of a PRO polypeptide that may optionally encode a polypeptide comprising a binding site for an anti-PRO antibody or as antisense oligonucleotide probes. Such nucleic acid fragments are usually at least about 10 nucleotides in length, alternatively at least about 15 nucleotides in length, alternatively at least about 20 nucleotides in length, alternatively at least about 30 nucleotides in length, alternatively at least about 40 nucleotides in length, alternatively at least about 50 nucleotides in length, alternatively at least about 60 nucleotides in length, alternatively at least about 70 nucleotides in length, alternatively at least about 80 nucleotides in length, alternatively at least about 90 nucleotides in length, alternatively at least about 100 nucleotides in length, alternatively at least about 110 nucleotides in length, alternatively at least about 120 nucleotides in length, alternatively at least about 130 nucleotides in length, alternatively at least about 140 nucleotides in length, alternatively at least about 150 nucleotides in length, alternatively at least about 160 nucleotides in length, alternatively at least about 170 nucleotides in length, alternatively at least about 180 nucleotides in length, alternatively at least about 190 nucleotides in length, alternatively at least about 200 nucleotides in length, alternatively at least about 250 nucleotides in length, alternatively at least about 300 nucleotides in length, alternatively at least about 350 nucleotides in length, alternatively at least about 400 nucleotides in length, alternatively at least about 450 nucleotides in length, alternatively at least about 500 nucleotides in length, alternatively at least about 600 nucleotides in length, alternatively at least about 700 nucleotides in length, alternatively at least about 800 nucleotides in length, alternatively at least about 900 nucleotides in length and alternatively at least about 1000 nucleotides in length, wherein in this context the term “about” means the referenced nucleotide sequence length plus or minus 10% of that referenced length. It is noted that novel fragments of a PRO polypeptide-encoding nucleotide sequence may be determined in a routine manner by aligning the PRO polypeptide-encoding nucleotide sequence with other known nucleotide sequences using any of a number of well known sequence alignment programs and determining which PRO polypeptide-encoding nucleotide sequence fragment(s) are novel. All of such PRO polypeptide-encoding nucleotide sequences are contemplated herein. Also contemplated are the PRO polypeptide fragments encoded by these nucleotide molecule fragments, preferably those PRO polypeptide fragments that comprise a binding site for an anti-PRO antibody. [0013] In another embodiment, the invention provides isolated PRO polypeptide encoded by any of the isolated nucleic acid sequences hereinabove identified. [0014] In a certain aspect, the invention concerns an isolated PRO polypeptide, comprising an amino acid sequence having at least about 80% amino acid sequence identity, alternatively at least about 81% amino acid sequence identity, alternatively at least about 82% amino acid sequence identity, alternatively at least about 83% amino acid sequence identity, alternatively at least about 84% amino acid sequence identity, alternatively at least about 85% amino acid sequence identity, alternatively at least about 86% amino acid sequence identity, alternatively at least about 87% amino acid sequence identity, alternatively at least about 88% amino acid sequence identity, alternatively at least about 89% amino acid sequence identity, alternatively at least about 90% amino acid sequence identity, alternatively at least about 91% amino acid sequence identity, alternatively at least about 92% amino acid sequence identity, alternatively at least about 93% amino acid sequence identity, alternatively at least about 94% amino acid sequence identity, alternatively at least about 95% amino acid sequence identity, alternatively at least about 96% amino acid sequence identity, alternatively at least about 97% amino acid sequence identity, alternatively at least about 98% amino acid sequence identity and alternatively at least about 99% amino acid sequence identity to a PRO polypeptide having a full-length amino acid sequence as disclosed herein, an amino acid sequence lacking the signal peptide as disclosed herein, an extracellular domain of a transmembrane protein, with or without the signal peptide, as disclosed herein or any other specifically defined fragment of the full-length amino acid sequence as disclosed herein. [0015] In a further aspect, the invention concerns an isolated PRO polypeptide comprising an amino acid sequence having at least about 80% amino acid sequence identity, alternatively at least about 81% amino acid sequence identity, alternatively at least about 82% amino acid sequence identity, alternatively at least about 83% amino acid sequence identity, alternatively at least about 84% amino acid sequence identity, alternatively at least about 85% amino acid sequence identity, alternatively at least about 86% amino acid sequence identity, alternatively at least about 87% amino acid sequence identity, alternatively at least about 88% amino acid sequence identity, alternatively at least about 89% amino acid sequence identity, alternatively at least about 90% amino acid sequence identity, alternatively at least about 91% amino acid sequence identity, alternatively at least about 92% amino acid sequence identity, alternatively at least about 93% amino acid sequence identity, alternatively at least about 94% amino acid sequence identity, alternatively at least about 95% amino acid sequence identity, alternatively at least about 96% amino acid sequence identity, alternatively at least about 97% amino acid sequence identity, alternatively at least about 98% amino acid sequence identity and alternatively at least about 99% amino acid sequence identity to an amino acid sequence encoded by any of the human protein cDNAs deposited with the ATCC as disclosed herein. [0016] In a specific aspect, the invention provides an isolated PRO polypeptide without the N-terminal signal sequence and/or the initiating methionine and is encoded by a nucleotide sequence that encodes such an amino acid sequence as hereinbefore described. Processes for producing the same are also herein described, wherein those processes comprise culturing a host cell comprising a vector which comprises the appropriate encoding nucleic acid molecule under conditions suitable for expression of the PRO polypeptide and recovering the PRO polypeptide from the cell culture. [0017] Another aspect the invention provides an isolated PRO polypeptide which is either transmembrane domain-deleted or transmembrane domain-inactivated. Processes for producing the same are also herein described, wherein those processes comprise culturing a host cell comprising a vector which comprises the appropriate encoding nucleic acid molecule under conditions suitable for expression of the PRO polypeptide and recovering the PRO polypeptide from the cell culture. [0018] In yet another embodiment, the invention concerns agonists and antagonists of a native PRO polypeptide as defined herein. In a particular embodiment, the agonist or antagonist is an anti-PRO antibody or a small molecule. [0019] In a further embodiment, the invention concerns a method of identifying agonists or antagonists to a PRO polypeptide which comprise contacting the PRO polypeptide with a candidate molecule and monitoring a biological activity mediated by said PRO polypeptide. Preferably, the PRO polypeptide is a native PRO polypeptide. [0020] In a still further embodiment, the invention concerns a composition of matter comprising a PRO polypeptide, or an agonist or antagonist of a PRO polypeptide as herein described, or an anti-PRO antibody, in combination with a carrier. Optionally, the carrier is a pharmaceutically acceptable carrier. [0021] Another embodiment of the present invention is directed to the use of a PRO polypeptide, or an agonist or antagonist thereof as hereinbefore described, or an anti-PRO antibody, for the preparation of a medicament useful in the treatment of a condition which is responsive to the PRO polypeptide, an agonist or antagonist thereof or an anti-PRO antibody. [0022] In other embodiments of the present invention, the invention provides vectors comprising DNA encoding any of the herein described polypeptides. Host cell comprising any such vector are also provided. By way of example, the host cells may be CHO cells, E. coli, or yeast. A process for producing any of the herein described polypeptides is further provided and comprises culturing host cells under conditions suitable for expression of the desired polypeptide and recovering the desired polypeptide from the cell culture. [0023] In other embodiments, the invention provides chimeric molecules comprising any of the herein described polypeptides fused to a heterologous polypeptide or amino acid sequence. Example of such chimeric molecules comprise any of the herein described polypeptides fused to an epitope tag sequence or a Fc region of an immunoglobulin. [0024] In another embodiment, the invention provides an antibody which binds, preferably specifically, to any of the above or below described polypeptides. Optionally, the antibody is a monoclonal antibody, humanized antibody, antibody fragment or single-chain antibody. [0025] In yet other embodiments, the invention provides oligonucleotide probes which may be useful for isolating genomic and cDNA nucleotide sequences, measuring or detecting expression of an associated gene or as antisense probes, wherein those probes may be derived from any of the above or below described nucleotide sequences. Preferred probe lengths are described above. [0026] In yet other embodiments, the present invention is directed to methods of using the PRO polypeptides of the present invention for a variety of uses based upon the functional biological assay data presented in the Examples below. BRIEF DESCRIPTION OF THE DRAWINGS [0027]FIG. 1 shows a nucleotide sequence (SEQ ID NO: 1) of a native sequence PRO276 cDNA, wherein SEQ ID NO: 1 is a clone designated herein as “DNA16435-1208”. [0028]FIG. 2 shows the amino acid sequence (SEQ ID NO: 2) derived from the coding sequence of SEQ ID NO: 1 shown in FIG. 1. [0029]FIG. 3 shows a nucleotide sequence (SEQ ID NO: 3) of a native sequence PRO284 cDNA, wherein SEQ ID NO: 3 is a clone designated herein as “DNA23318-1211”. [0030]FIG. 4 shows the amino acid sequence (SEQ ID NO: 4) derived from the coding sequence of SEQ ID NO: 3 shown in FIG. 3. [0031]FIG. 5 shows a nucleotide sequence (SEQ ID NO: 5) of a native sequence PRO193 cDNA, wherein SEQ ID NO: 5 is a clone designated herein as “DNA23322-1393”. [0032]FIG. 6 shows the amino acid sequence (SEQ ID NO: 6) derived from the coding sequence of SEQ ID NO: 5 shown in FIG. 5. [0033]FIG. 7 shows a nucleotide sequence (SEQ ID NO: 7) of a native sequence PRO190 cDNA, wherein SEQ ID NO: 7 is a clone designated herein as “DNA23334-1392”. [0034]FIG. 8 shows the amino acid sequence (SEQ ID NO: 8) derived from the coding sequence of SEQ ID NO: 7 shown in FIG. 7. [0035]FIG. 9 shows a nucleotide sequence (SEQ ID NO: 9) of a native sequence PRO180 cDNA, wherein SEQ ID NO: 9 is a clone designated herein as “DNA26843-1389”. [0036]FIG. 10 shows the amino acid sequence (SEQ ID NO: 10) derived from the coding sequence of SEQ ID NO: 9 shown in FIG. 9. [0037]FIG. 11 shows a nucleotide sequence (SEQ ID NO: 11) of a native sequence PRO194 cDNA, wherein SEQ ID NO: 11 is a clone designated herein as “DNA26844-1394”. [0038]FIG. 12 shows the amino acid sequence (SEQ ID NO: 12) derived from the coding sequence of SEQ ID NO: 11 shown in FIG. 11. [0039]FIG. 13 shows a nucleotide sequence (SEQ ID NO: 13) of a native sequence PRO218 cDNA, wherein SEQ ID NO: 13 is a clone designated herein as “DNA30867-1335”. [0040]FIG. 14 shows the amino acid sequence (SEQ ID NO: 14) derived from the coding sequence of SEQ ID NO: 13 shown in FIG. 13. [0041]FIG. 15 shows a nucleotide sequence (SEQ ID NO: 15) of a native sequence PRO260 cDNA, wherein SEQ ID NO: 15 is a clone designated herein as “DNA33470-1175”. [0042]FIG. 16 shows the amino acid sequence (SEQ ID NO: 16) derived from the coding sequence of SEQ ID NO: 15 shown in FIG. 15. [0043]FIG. 17 shows a nucleotide sequence (SEQ ID NO: 17) of a native sequence PRO233 cDNA, wherein SEQ ID NO: 17 is a clone designated herein as “DNA34436-1238”. [0044]FIG. 18 shows the amino acid sequence (SEQ ID NO: 18) derived from the coding sequence of SEQ ID NO: 17 shown in FIG. 17. [0045]FIG. 19 shows a nucleotide sequence (SEQ ID NO: 19) of a native sequence PRO234 cDNA, wherein SEQ ID NO: 19 is a clone designated herein as “DNA35557-1137”. [0046]FIG. 20 shows the amino acid sequence (SEQ ID NO: 20) derived from the coding sequence of SEQ ID NO: 19 shown in FIG. 19. [0047]FIG. 21 shows a nucleotide sequence (SEQ ID NO: 21) of a native sequence PRO236 cDNA, wherein SEQ ID NO: 21 is a clone designated herein as “DNA35599-1168”. [0048]FIG. 22 shows the amino acid sequence (SEQ ID NO: 22) derived from the coding sequence of SEQ ID NO: 21 shown in FIG. 21. [0049]FIG. 23 shows a nucleotide sequence (SEQ ID NO: 23) of a native sequence PRO244 cDNA, wherein SEQ ID NO: 23 is a clone designated herein as “DNA35668-1171”. [0050]FIG. 24 shows the amino acid sequence (SEQ ID NO: 24) derived from the coding sequence of SEQ ID NO: 23 shown in FIG. 23. [0051]FIG. 25 shows a nucleotide sequence (SEQ ID NO: 25) of a native sequence PRO262 cDNA, wherein SEQ ID NO: 25 is a clone designated herein as “DNA36992-1168”. [0052]FIG. 26 shows the amino acid sequence (SEQ ID NO: 26) derived from the coding sequence of SEQ ID NO: 25 shown in FIG. 25. [0053]FIG. 27 shows a nucleotide sequence (SEQ ID NO: 27) of a native sequence PRO271 cDNA, wherein SEQ ID NO: 27 is a clone designated herein as “DNA39423-1182”. [0054]FIG. 28 shows the amino acid sequence (SEQ ID NO: 28) derived from the coding sequence of SEQ ID NO: 27 shown in FIG. 27. [0055]FIG. 29 shows a nucleotide sequence (SEQ ID NO: 29) of a native sequence PRO268 cDNA, wherein SEQ ID NO: 29 is a clone designated herein as “DNA39427-1179”. [0056]FIG. 30 shows the amino acid sequence (SEQ ID NO: 30) derived from the coding sequence of SEQ ID NO: 29 shown in FIG. 29. [0057]FIG. 31 shows a nucleotide sequence (SEQ ID NO: 31) of a native sequence PRO270 cDNA, wherein SEQ ID NO: 31 is a clone designated herein as “DNA39510-1181”. [0058]FIG. 32 shows the amino acid sequence (SEQ ID NO: 32) derived from the coding sequence of SEQ ID NO: 31 shown in FIG. 31. [0059]FIG. 33 shows a nucleotide sequence (SEQ ID NO: 33) of a native sequence PRO355 cDNA, wherein SEQ ID NO: 33 is a clone designated herein as “DNA39518-1247”. [0060]FIG. 34 shows the amino acid sequence (SEQ ID NO: 34) derived from the coding sequence of SEQ ID NO: 33 shown in FIG. 33. [0061]FIG. 35 shows a nucleotide sequence (SEQ ID NO: 35) of a native sequence PRO298 cDNA, wherein SEQ ID NO: 35 is a clone designated herein as “DNA39975-1210”. [0062]FIG. 36 shows the amino acid sequence (SEQ ID NO: 36) derived from the coding sequence of SEQ ID NO: 35 shown in FIG. 35. [0063]FIG. 37 shows a nucleotide sequence (SEQ ID NO: 37) of a native sequence PRO299 cDNA, wherein SEQ ID NO: 37 is a clone designated herein as “DNA39976-1215”. [0064]FIG. 38 shows the amino acid sequence (SEQ ID NO: 38) derived from the coding sequence of SEQ ID NO: 37 shown in FIG. 37. [0065]FIG. 39 shows a nucleotide sequence (SEQ ID NO: 39) of a native sequence PRO296 cDNA, wherein SEQ ID NO: 39 is a clone designated herein as “DNA39979-1213”. [0066]FIG. 40 shows the amino acid sequence (SEQ ID NO: 40) derived from the coding sequence of SEQ ID NO: 39 shown in FIG. 39. [0067]FIG. 41 shows a nucleotide sequence (SEQ ID NO: 41) of a native sequence PRO329 cDNA, wherein SEQ ID NO: 41 is a clone designated herein as “DNA40594-1233”. [0068]FIG. 42 shows the amino acid sequence (SEQ ID NO: 42) derived from the coding sequence of SEQ ID NO: 41 shown in FIG. 41. [0069]FIG. 43 shows a nucleotide sequence (SEQ ID NO: 43) of a native sequence PRO330 cDNA, wherein SEQ ID NO: 43 is a clone designated herein as “DNA40603-1232”. [0070]FIG. 44 shows the amino acid sequence (SEQ ID NO: 44) derived from the coding sequence of SEQ ID NO: 43 shown in FIG. 43. [0071]FIG. 45 shows a nucleotide sequence (SEQ ID NO: 45) of a native sequence PRO294 cDNA, wherein SEQ ID NO: 45 is a clone designated herein as “DNA40604-1187”. [0072]FIG. 46 shows the amino acid sequence (SEQ ID NO: 46) derived from the coding sequence of SEQ ID NO: 45 shown in FIG. 45. [0073]FIG. 47 shows a nucleotide sequence (SEQ ID NO: 47) of a native sequence PRO300 cDNA, wherein SEQ ID NO: 47 is a clone designated herein as “DNA40625-1189”. [0074]FIG. 48 shows the amino acid sequence (SEQ ID NO: 48) derived from the coding sequence of SEQ ID NO: 47 shown in FIG. 47. [0075]FIG. 49 shows a nucleotide sequence (SEQ ID NO: 49) of a native sequence PRO307 cDNA, wherein SEQ ID NO: 49 is a clone designated herein as “DNA41225-1217”. [0076]FIG. 50 shows the amino acid sequence (SEQ ID NO: 50) derived from the coding sequence of SEQ ID NO: 49 shown in FIG. 49. [0077]FIG. 51 shows a nucleotide sequence (SEQ ID NO: 51) of a native sequence PRO334 cDNA, wherein SEQ ID NO: 51 is a clone designated herein as “DNA41379-1236”. [0078]FIG. 52 shows the amino acid sequence (SEQ ID NO: 52) derived from the coding sequence of SEQ ID NO: 51 shown in FIG. 51. [0079]FIG. 53 shows a nucleotide sequence (SEQ ID NO: 53) of a native sequence PRO352 cDNA, wherein SEQ ID NO: 53 is a clone designated herein as “DNA41386-1316”. [0080]FIG. 54 shows the amino acid sequence (SEQ ID NO: 54) derived from the coding sequence of SEQ ID NO: 53 shown in FIG. 53. [0081]FIG. 55 shows a nucleotide sequence (SEQ ID NO: 55) of a native sequence PRO710 cDNA, wherein SEQ ID NO: 55 is a clone designated herein as “DNA44161-1434”. [0082]FIG. 56 shows the amino acid sequence (SEQ ID NO: 56) derived from the coding sequence of SEQ ID NO: 55 shown in FIG. 55. [0083]FIG. 57 shows a nucleotide sequence (SEQ ID NO: 57) of a native sequence PRO873 cDNA, wherein SEQ ID NO: 57 is a clone designated herein as “DNA44179-1362”. [0084]FIG. 58 shows the amino acid sequence (SEQ ID NO: 58) derived from the coding sequence of SEQ ID NO: 57 shown in FIG. 57. [0085]FIG. 59 shows a nucleotide sequence (SEQ ID NO: 59) of a native sequence PRO354 cDNA, wherein SEQ ID NO: 59 is a clone designated herein as “DNA44192-1246”. [0086]FIG. 60 shows the amino acid sequence (SEQ ID NO: 60) derived from the coding sequence of SEQ ID NO: 59 shown in FIG. 59. [0087]FIG. 61 shows a nucleotide sequence (SEQ ID NO: 61) of a native sequence PRO1151 cDNA, wherein SEQ ID NO: 61 is a clone designated herein as “DNA44694-1500”. [0088]FIG. 62 shows the amino acid sequence (SEQ ID NO: 62) derived from the coding sequence of SEQ ID NO: 61 shown in FIG. 61. [0089]FIG. 63 shows a nucleotide sequence (SEQ ID NO: 63) of a native sequence PRO382 cDNA, wherein SEQ ID NO: 63 is a clone designated herein as “DNA45234-1277”. [0090]FIG. 64 shows the amino acid sequence (SEQ ID NO: 64) derived from the coding sequence of SEQ ID NO: 63 shown in FIG. 63. [0091]FIG. 65 shows a nucleotide sequence (SEQ ID NO: 65) of a native sequence PRO1864 cDNA, wherein SEQ ID NO: 65 is a clone designated herein as “DNA45409-2511”. [0092]FIG. 66 shows the amino acid sequence (SEQ ID NO: 66) derived from the coding sequence of SEQ ID NO: 65 shown in FIG. 65. [0093]FIG. 67 shows a nucleotide sequence (SEQ ID NO: 67) of a native sequence PRO386 cDNA, wherein SEQ ID NO: 67 is a clone designated herein as “DNA45415-1318”. [0094]FIG. 68 shows the amino acid sequence (SEQ ID NO: 68) derived from the coding sequence of SEQ ID NO: 67 shown in FIG. 67. [0095]FIG. 69 shows a nucleotide sequence (SEQ ID NO: 69) of a native sequence PRO541 cDNA, wherein SEQ ID NO: 69 is a clone designated herein as “DNA45417-1432”. [0096]FIG. 70 shows the amino acid sequence (SEQ ID NO: 70) derived from the coding sequence of SEQ ID NO: 69 shown in FIG. 69. [0097]FIG. 71 shows a nucleotide sequence (SEQ ID NO: 71) of a native sequence PRO852 cDNA, wherein SEQ ID NO: 71 is a clone designated herein as “DNA45493-1349”. [0098]FIG. 72 shows the amino acid sequence (SEQ ID NO: 72) derived from the coding sequence of SEQ ID NO: 71 shown in FIG. 71. [0099]FIG. 73 shows a nucleotide sequence (SEQ ID NO: 73) of a native sequence PRO700 cDNA, wherein SEQ ID NO: 73 is a clone designated herein as “DNA46776-1284”. [0100]FIG. 74 shows the amino acid sequence (SEQ ID NO: 74) derived from the coding sequence of SEQ ID NO: 73 shown in FIG. 73. [0101] FIGS. 75A-75B show a nucleotide sequence (SEQ ID NO: 75) of a native sequence PRO708 cDNA, wherein SEQ ID NO: 75 is a clone designated herein as “DNA48296-1292”. [0102]FIG. 76 shows the amino acid sequence (SEQ ID NO: 76) derived from the coding sequence of SEQ ID NO: 75 shown in FIGS. 75A-75B. [0103]FIG. 77 shows a nucleotide sequence (SEQ ID NO: 77) of a native sequence PRO707 cDNA, wherein SEQ ID NO: 77 is a clone designated herein as “DNA48306-1291”. [0104]FIG. 78 shows the amino acid sequence (SEQ ID NO: 78) derived from the coding sequence of SEQ ID NO: 77 shown in FIG. 77. [0105]FIG. 79 shows a nucleotide sequence (SEQ ID NO: 79) of a native sequence PRO864 cDNA, wherein SEQ ID NO: 79 is a clone designated herein as “DNA48328-1355”. [0106]FIG. 80 shows the amino acid sequence (SEQ ID NO: 80) derived from the coding sequence of SEQ ID NO: 79 shown in FIG. 79. [0107]FIG. 81 shows a nucleotide sequence (SEQ ID NO: 81) of a native sequence PRO706 cDNA, wherein SEQ ID NO: 81 is a clone designated herein as “DNA48329-1290”. [0108]FIG. 82 shows the amino acid sequence (SEQ ID NO: 82) derived from the coding sequence of SEQ ID NO: 81 shown in FIG. 81. [0109]FIG. 83 shows a nucleotide sequence (SEQ ID NO: 83) of a native sequence PRO732 cDNA, wherein SEQ ID NO: 83 is a clone designated herein as “DNA48334-1435”. [0110]FIG. 84 shows the amino acid sequence (SEQ ID NO: 84) derived from the coding sequence of SEQ ID NO: 83 shown in FIG. 83. [0111]FIG. 85 shows a nucleotide sequence (SEQ ID NO: 85) of a native sequence PRO537 cDNA, wherein SEQ ID NO: 85 is a clone designated herein as “DNA49141-1431”. [0112]FIG. 86 shows the amino acid sequence (SEQ ID NO: 86) derived from the coding sequence of SEQ ID NO: 85 shown in FIG. 85. [0113]FIG. 87 shows a nucleotide sequence (SEQ ID NO: 87) of a native sequence PRO545 cDNA, wherein SEQ ID NO: 87 is a clone designated herein as “DNA49624-1279”. [0114]FIG. 88 shows the amino acid sequence (SEQ ID NO: 88) derived from the coding sequence of SEQ ID NO: 87 shown in FIG. 87. [0115]FIG. 89 shows a nucleotide sequence (SEQ ID NO: 89) of a native sequence PRO718 cDNA, wherein SEQ ID NO: 89 is a clone designated herein as “DNA49647-1398”. [0116]FIG. 90 shows the amino acid sequence (SEQ ID NO: 90) derived from the coding sequence of SEQ ID NO: 89 shown in FIG. 89. [0117]FIG. 91 shows a nucleotide sequence (SEQ ID NO: 91) of a native sequence PRO872 cDNA, wherein SEQ ID NO: 91 is a clone designated herein as “DNA49819-1439”. [0118]FIG. 92 shows the amino acid sequence (SEQ ID NO: 92) derived from the coding sequence of SEQ ID NO: 91 shown in FIG. 91. [0119]FIG. 93 shows a nucleotide sequence (SEQ ID NO: 93) of a native sequence PRO704 cDNA, wherein SEQ ID NO: 93 is a clone designated herein as “DNA50911-1288”. [0120]FIG. 94 shows the amino acid sequence (SEQ ID NO: 94) derived from the coding sequence of SEQ ID NO: 93 shown in FIG. 93. [0121]FIG. 95 shows a nucleotide sequence (SEQ ID NO: 95) of a native sequence PRO705 cDNA, wherein SEQ ID NO: 95 is a clone designated herein as “DNA50914-1289”. [0122]FIG. 96 shows the amino acid sequence (SEQ ID NO: 96) derived from the coding sequence of SEQ ID NO: 95 shown in FIG. 95. [0123]FIG. 97 shows a nucleotide sequence (SEQ ID NO: 97) of a native sequence PRO871 cDNA, wherein SEQ ID NO: 97 is a clone designated herein as “DNA50919-1361”. [0124]FIG. 98 shows the amino acid sequence (SEQ ID NO: 98) derived from the coding sequence of SEQ ID NO: 97 shown in FIG. 97. [0125]FIG. 99 shows a nucleotide sequence (SEQ ID NO: 99) of a native sequence PRO702 cDNA, wherein SEQ ID NO: 99 is a clone designated herein as “DNA50980-1286”. [0126]FIG. 100 shows the amino acid sequence (SEQ ID NO: 100) derived from the coding sequence of SEQ ID NO: 99 shown in FIG. 99. [0127]FIG. 101 shows a nucleotide sequence (SEQ ID NO: 101) of a native sequence PRO944 cDNA, wherein SEQ ID NO: 101 is a clone designated herein as “DNA52185-1370”. [0128]FIG. 102 shows the amino acid sequence (SEQ ID NO: 102) derived from the coding sequence of SEQ ID NO: 101 shown in FIG. 101. [0129]FIG. 103 shows a nucleotide sequence (SEQ ID NO: 103) of a native sequence PRO739 cDNA, wherein SEQ ID NO: 103 is a clone designated herein as “DNA52756”. [0130]FIG. 104 shows the amino acid sequence (SEQ ID NO: 104) derived from the coding sequence of SEQ ID NO: 103 shown in FIG. 103. [0131]FIG. 105 shows a nucleotide sequence (SEQ ID NO: 105) of a native sequence PRO941 cDNA, wherein SEQ ID NO: 105 is a clone designated herein as “DNA53906-1368”. [0132]FIG. 106 shows the amino acid sequence (SEQ ID NO: 106) derived from the coding sequence of SEQ ID NO: 105 shown in FIG. 105. [0133]FIG. 107 shows a nucleotide sequence (SEQ ID NO: 107) of a native sequence PRO1082 cDNA, wherein SEQ ID NO: 107 is a clone designated herein as “DNA53912-1457”. [0134]FIG. 108 shows the amino acid sequence (SEQ ID NO: 108) derived from the coding sequence of SEQ ID NO: 107 shown in FIG. 107. [0135]FIG. 109 shows a nucleotide sequence (SEQ ID NO: 109) of a native sequence PRO1133 cDNA, wherein SEQ ID NO: 109 is a clone designated herein as “DNA53913-1490”. [0136]FIG. 110 shows the amino acid sequence (SEQ ID NO: 110) derived from the coding sequence of SEQ ID NO: 109 shown in FIG. 109. [0137]FIG. 111 shows a nucleotide sequence (SEQ ID NO: 111) of a native sequence PRO983 cDNA, wherein SEQ ID NO: 111 is a clone designated herein as “DNA53977-1371”. [0138]FIG. 112 shows the amino acid sequence (SEQ ID NO: 112) derived from the coding sequence of SEQ ID NO: 111 shown in FIG. 111. [0139]FIG. 113 shows a nucleotide sequence (SEQ ID NO: 113) of a native sequence PRO784 cDNA, wherein SEQ ID NO: 113 is a clone designated herein as “DNA53978-1443”. [0140]FIG. 114 shows the amino acid sequence (SEQ ID NO: 114) derived from the coding sequence of SEQ ID NO: 113 shown in FIG. 113. [0141]FIG. 115 shows a nucleotide sequence (SEQ ID NO: 115) of a native sequence PRO783 cDNA, wherein SEQ ID NO: 115 is a clone designated herein as “DNA53996-1442”. [0142]FIG. 116 shows the amino acid sequence (SEQ ID NO: 116) derived from the coding sequence of SEQ ID NO: 115 shown in FIG. 115. [0143]FIG. 117 shows a nucleotide sequence (SEQ ID NO: 117) of a native sequence PRO940 cDNA, wherein SEQ ID NO: 117 is a clone designated herein as “DNA54002-1367”. [0144]FIG. 118 shows the amino acid sequence (SEQ ID NO: 118) derived from the coding sequence of SEQ ID NO: 117 shown in FIG. 117. [0145]FIG. 119 shows a nucleotide sequence (SEQ ID NO: 119) of a native sequence PRO768 cDNA, wherein SEQ ID NO: 119 is a clone designated herein as “DNA55737-1345”. [0146]FIG. 120 shows the amino acid sequence (SEQ ID NO: 120) derived from the coding sequence of SEQ ID NO: 119 shown in FIG. 119. [0147]FIG. 121 shows a nucleotide sequence (SEQ ID NO: 121) of a native sequence PRO1079 cDNA, wherein SEQ ID NO: 121 is a clone designated herein as “DNA56050-1455”. [0148]FIG. 122 shows the amino acid sequence (SEQ ID NO: 122) derived from the coding sequence of SEQ ID NO: 121 shown in FIG. 121. [0149]FIG. 123 shows a nucleotide sequence (SEQ ID NO: 123) of a native sequence PRO1078 cDNA, wherein SEQ ID NO: 123 is a clone designated herein as “DNA56052-1454”. [0150]FIG. 124 shows the amino acid sequence (SEQ ID NO: 124) derived from the coding sequence of SEQ ID NO: 123 shown in FIG. 123. [0151]FIG. 125 shows a nucleotide sequence (SEQ ID NO: 125) of a native sequence PRO1018 cDNA, wherein SEQ ID NO: 125 is a clone designated herein as “DNA56107-1415”. [0152]FIG. 126 shows the amino acid sequence (SEQ ID NO: 126) derived from the coding sequence of SEQ ID NO: 125 shown in FIG. 125. [0153]FIG. 127 shows a nucleotide sequence (SEQ ID NO: 127) of a native sequence PRO793 cDNA, wherein SEQ ID NO: 127 is a clone designated herein as “DNA56110-1437”. [0154]FIG. 128 shows the amino acid sequence (SEQ ID NO: 128) derived from the coding sequence of SEQ ID NO: 127 shown in FIG. 127. [0155]FIG. 129 shows a nucleotide sequence (SEQ ID NO: 129) of a native sequence PRO1773 cDNA, wherein SEQ ID NO: 129 is a clone designated herein as “DNA56406-1704”. [0156]FIG. 130 shows the amino acid sequence (SEQ ID NO: 130) derived from the coding sequence of SEQ ID NO: 129 shown in FIG. 129. [0157]FIG. 131 shows a nucleotide sequence (SEQ ID NO: 131) of a native sequence PRO1014 cDNA, wherein SEQ ID NO: 131 is a clone designated herein as “DNA56409-1377”. [0158]FIG. 132 shows the amino acid sequence (SEQ ID NO: 132) derived from the coding sequence of SEQ ID NO: 131 shown in FIG. 131. [0159]FIG. 133 shows a nucleotide sequence (SEQ ID NO: 133) of a native sequence PRO1013 cDNA, wherein SEQ ID NO: 133 is a clone designated herein as “DNA56410-1414”. [0160]FIG. 134 shows the amino acid sequence (SEQ ID NO: 134) derived from the coding sequence of SEQ ID NO: 133 shown in FIG. 133. [0161]FIG. 135 shows a nucleotide sequence (SEQ ID NO: 135) of a native sequence PRO937 cDNA, wherein SEQ ID NO: 135 is a clone designated herein as “DNA56436-1448”. [0162]FIG. 136 shows the amino acid sequence (SEQ ID NO: 136) derived from the coding sequence of SEQ ID NO: 135 shown in FIG. 135. [0163]FIG. 137 shows a nucleotide sequence (SEQ ID NO: 137) of a native sequence PRO1477 cDNA, wherein SEQ ID NO: 137 is a clone designated herein as “DNA56529-1647”. [0164]FIG. 138 shows the amino acid sequence (SEQ ID NO: 138) derived from the coding sequence of SEQ ID NO: 137 shown in FIG. 137. [0165]FIG. 139 shows a nucleotide sequence (SEQ ID NO: 139) of a native sequence PRO842 cDNA, wherein SEQ ID NO: 139 is a clone designated herein as “DNA56855-1447”. [0166]FIG. 140 shows the amino acid sequence (SEQ ID NO: 140) derived from the coding sequence of SEQ ID NO: 139 shown in FIG. 139. [0167]FIG. 141 shows a nucleotide sequence (SEQ ID NO: 141) of a native sequence PRO839 cDNA, wherein SEQ ID NO: 141 is a clone designated herein as “DNA56859-1445”. [0168]FIG. 142 shows the amino acid sequence (SEQ ID NO: 142) derived from the coding sequence of SEQ ID NO: 141 shown in FIG. 141. [0169]FIG. 143 shows a nucleotide sequence (SEQ ID NO: 143) of a native sequence PRO1180 cDNA, wherein SEQ ID NO: 143 is a clone designated herein as “DNA56860-1510”. [0170]FIG. 144 shows the amino acid sequence (SEQ ID NO: 144) derived from the coding sequence of SEQ ID NO: 143 shown in FIG. 143. [0171]FIG. 145 shows a nucleotide sequence (SEQ ID NO: 145) of a native sequence PRO1134 cDNA, wherein SEQ ID NO: 145 is a clone designated herein as “DNA56865-1491”. [0172]FIG. 146 shows the amino acid sequence (SEQ ID NO: 146) derived from the coding sequence of SEQ ID NO: 145 shown in FIG. 145. [0173]FIG. 147 shows a nucleotide sequence (SEQ ID NO: 147) of a native sequence PRO1115 cDNA, wherein SEQ ID NO: 147 is a clone designated herein as “DNA56868-1478”. [0174]FIG. 148 shows the amino acid sequence (SEQ ID NO: 148) derived from the coding sequence of SEQ ID NO: 147 shown in FIG. 147. [0175]FIG. 149 shows a nucleotide sequence (SEQ ID NO: 149) of a native sequence PRO1277 cDNA, wherein SEQ ID NO: 149 is a clone designated herein as “DNA56869-1545”. [0176]FIG. 150 shows the amino acid sequence (SEQ ID NO: 150) derived from the coding sequence of SEQ ID NO: 149 shown in FIG. 149. [0177]FIG. 151 shows a nucleotide sequence (SEQ ID NO: 151) of a native sequence PRO1135 cDNA, wherein SEQ ID NO: 151 is a clone designated herein as “DNA56870-1492”. [0178]FIG. 152 shows the amino acid sequence (SEQ ID NO: 152) derived from the coding sequence of SEQ ID NO: 151 shown in FIG. 151. [0179]FIG. 153 shows a nucleotide sequence (SEQ ID NO: 153) of a native sequence PRO827 cDNA, wherein SEQ ID NO: 153 is a clone designated herein as “DNA57039-1402”. [0180]FIG. 154 shows the amino acid sequence (SEQ ID NO: 154) derived from the coding sequence of SEQ ID NO: 153 shown in FIG. 153. [0181]FIG. 155 shows a nucleotide sequence (SEQ ID NO: 155) of a native sequence PRO1057 cDNA, wherein SEQ ID NO: 155 is a clone designated herein as “DNA57253-1382”. [0182]FIG. 156 shows the amino acid sequence (SEQ ID NO: 156) derived from the coding sequence of SEQ ID NO: 155 shown in FIG. 155. [0183]FIG. 157 shows a nucleotide sequence (SEQ ID NO: 157) of a native sequence PRO1113 cDNA, wherein SEQ ID NO: 157 is a clone designated herein as “DNA57254-1477”. [0184]FIG. 158 shows the amino acid sequence (SEQ ID NO: 158) derived from the coding sequence of SEQ ID NO: 157 shown in FIG. 157. [0185]FIG. 159 shows a nucleotide sequence (SEQ ID NO: 159) of a native sequence PRO1006 cDNA, wherein SEQ ID NO: 159 is a clone designated herein as “DNA57699-1412”. [0186]FIG. 160 shows the amino acid sequence (SEQ ID NO: 160) derived from the coding sequence of SEQ ID NO: 159 shown in FIG. 159. [0187]FIG. 161 shows a nucleotide sequence (SEQ ID NO: 161) of a native sequence PRO1074 cDNA, wherein SEQ ID NO: 161 is a clone designated herein as “DNA57704-1452”. [0188]FIG. 162 shows the amino acid sequence (SEQ ID NO: 162) derived from the coding sequence of SEQ ID NO: 161 shown in FIG. 161. [0189]FIG. 163 shows a nucleotide sequence (SEQ ID NO: 163) of a native sequence PRO1073 cDNA, wherein SEQ ID NO: 163 is a clone designated herein as “DNA57710-1451”. [0190]FIG. 164 shows the amino acid sequence (SEQ ID NO: 164) derived from the coding sequence of SEQ ID NO: 163 shown in FIG. 163. [0191]FIG. 165 shows a nucleotide sequence (SEQ ID NO: 165) of a native sequence PRO1136 cDNA, wherein SEQ ID NO: 165 is a clone designated herein as “DNA57827-1493”. [0192]FIG. 166 shows the amino acid sequence (SEQ ID NO: 166) derived from the coding sequence of SEQ ID NO: 165 shown in FIG. 165. [0193]FIG. 167 shows a nucleotide sequence (SEQ ID NO: 167) of a native sequence PRO1004 cDNA, wherein SEQ ID NO: 167 is a clone designated herein as “DNA57844-1410”. [0194]FIG. 168 shows the amino acid sequence (SEQ ID NO: 168) derived from the coding sequence of SEQ ID NO: 167 shown in FIG. 167. [0195]FIG. 169 shows a nucleotide sequence (SEQ ID NO: 169) of a native sequence PRO1344 cDNA, wherein SEQ ID NO: 169 is a clone designated herein as “DNA58723-1588”. [0196]FIG. 170 shows the amino acid sequence (SEQ ID NO: 170) derived from the coding sequence of SEQ ID NO: 169 shown in FIG. 169. [0197]FIG. 171 shows a nucleotide sequence (SEQ ID NO: 171) of a native sequence PRO1110 cDNA, wherein SEQ ID NO: 171 is a clone designated herein as “DNA58727-1474”. [0198]FIG. 172 shows the amino acid sequence (SEQ ID NO: 172) derived from the coding sequence of SEQ ID NO: 171 shown in FIG. 171. [0199]FIG. 173 shows a nucleotide sequence (SEQ ID NO: 173) of a native sequence PRO1378 cDNA, wherein SEQ ID NO: 173 is a clone designated herein as “DNA58730-1607”. [0200]FIG. 174 shows the amino acid sequence (SEQ ID NO: 174) derived from the coding sequence of SEQ ID NO: 173 shown in FIG. 173. [0201]FIG. 175 shows a nucleotide sequence (SEQ ID NO: 175) of a native sequence PRO1481 cDNA, wherein SEQ ID NO: 175 is a clone designated herein as “DNA58732-1650”. [0202]FIG. 176 shows the amino acid sequence (SEQ ID NO: 176) derived from the coding sequence of SEQ ID NO: 175 shown in FIG. 175. [0203]FIG. 177 shows a nucleotide sequence (SEQ ID NO: 177) of a native sequence PRO1109 cDNA, wherein SEQ ID NO: 177 is a clone designated herein as “DNA58737-1473”. [0204]FIG. 178 shows the amino acid sequence (SEQ ID NO: 178) derived from the coding sequence of SEQ ID NO: 177 shown in FIG. 177. [0205]FIG. 179 shows a nucleotide sequence (SEQ ID NO: 179) of a native sequence PRO1383 cDNA, wherein SEQ ID NO: 179 is a clone designated herein as “DNA58743-1609”. [0206]FIG. 180 shows the amino acid sequence (SEQ ID NO: 180) derived from the coding sequence of SEQ ID NO: 179 shown in FIG. 179. [0207]FIG. 181 shows a nucleotide sequence (SEQ ID NO: 181) of a native sequence PRO1072 cDNA, wherein SEQ ID NO: 181 is a clone designated herein as “DNA58747-1384”. [0208]FIG. 182 shows the amino acid sequence (SEQ ID NO: 182) derived from the coding sequence of SEQ ID NO: 181 shown in FIG. 181. [0209]FIG. 183 shows a nucleotide sequence (SEQ ID NO: 183) of a native sequence PRO1189 cDNA, wherein SEQ ID NO: 183 is a clone designated herein as “DNA58828-1519”. [0210]FIG. 184 shows the amino acid sequence (SEQ ID NO: 184) derived from the coding sequence of SEQ ID NO: 183 shown in FIG. 183. [0211]FIG. 185 shows a nucleotide sequence (SEQ ID NO: 185) of a native sequence PRO1003 cDNA, wherein SEQ ID NO: 185 is a clone designated herein as “DNA58846-1409”. [0212]FIG. 186 shows the amino acid sequence (SEQ ID NO: 186) derived from the coding sequence of SEQ ID NO: 185 shown in FIG. 185. [0213]FIG. 187 shows a nucleotide sequence (SEQ ID NO: 187) of a native sequence PRO1108 cDNA, wherein SEQ ID NO: 187 is a clone designated herein as “DNA58848-1472”. [0214]FIG. 188 shows the amino acid sequence (SEQ ID NO: 188) derived from the coding sequence of SEQ ID NO: 187 shown in FIG. 187. [0215]FIG. 189 shows a nucleotide sequence (SEQ ID NO: 189) of a native sequence PRO1137 cDNA, wherein SEQ ID NO: 189 is a clone designated herein as “DNA58849-1494”. [0216]FIG. 190 shows the amino acid sequence (SEQ ID NO: 190) derived from the coding sequence of SEQ ID NO: 189 shown in FIG. 189. [0217]FIG. 191 shows a nucleotide sequence (SEQ ID NO: 191) of a native sequence PRO1138 cDNA, wherein SEQ ID NO: 191 is a clone designated herein as “DNA58850-1495”. [0218]FIG. 192 shows the amino acid sequence (SEQ ID NO: 192) derived from the coding sequence of SEQ ID NO: 191 shown in FIG. 191. [0219]FIG. 193 shows a nucleotide sequence (SEQ ID NO: 193) of a native sequence PRO1415 cDNA, wherein SEQ ID NO: 193 is a clone designated herein as “DNA58852-1637”. [0220]FIG. 194 shows the amino acid sequence (SEQ ID NO: 194) derived from the coding sequence of SEQ ID NO: 193 shown in FIG. 193. [0221]FIG. 195 shows a nucleotide sequence (SEQ ID NO: 195) of a native sequence PRO1054 cDNA, wherein SEQ ID NO: 195 is a clone designated herein as “DNA58853-1423”. [0222]FIG. 196 shows the amino acid sequence (SEQ ID NO: 196) derived from the coding sequence of SEQ ID NO: 195 shown in FIG. 195. [0223]FIG. 197 shows a nucleotide sequence (SEQ ID NO: 197) of a native sequence PRO994 cDNA, wherein SEQ ID NO: 197 is a clone designated herein as “DNA58855-1422”. [0224]FIG. 198 shows the amino acid sequence (SEQ ID NO: 198) derived from the coding sequence of SEQ ID NO: 197 shown in FIG. 197. [0225]FIG. 199 shows a nucleotide sequence (SEQ ID NO: 199) of a native sequence PRO1069 cDNA, wherein SEQ ID NO: 199 is a clone designated herein as “DNA59211-1450”. [0226]FIG. 200 shows the amino acid sequence (SEQ ID NO: 200) derived from the coding sequence of SEQ ID NO: 199 shown in FIG. 199. [0227]FIG. 201 shows a nucleotide sequence (SEQ ID NO: 201) of a native sequence PRO1411 cDNA, wherein SEQ ID NO: 201 is a clone designated herein as “DNA59212-1627”. [0228]FIG. 202 shows the amino acid sequence (SEQ ID NO: 202) derived from the coding sequence of SEQ ID NO: 201 shown in FIG. 201. [0229]FIG. 203 shows a nucleotide sequence (SEQ ID NO: 203) of a native sequence PRO1129 cDNA, wherein SEQ ID NO: 203 is a clone designated herein as “DNA59213-1487”. [0230]FIG. 204 shows the amino acid sequence (SEQ ID NO: 204) derived from the coding sequence of SEQ ID NO: 203 shown in FIG. 203. [0231]FIG. 205 shows a nucleotide sequence (SEQ ID NO: 205) of a native sequence PRO1359 cDNA, wherein SEQ ID NO: 205 is a clone designated herein as “DNA59219-1613”. [0232]FIG. 206 shows the amino acid sequence (SEQ ID NO: 206) derived from the coding sequence of SEQ ID NO: 205 shown in FIG. 205. [0233]FIG. 207 shows a nucleotide sequence (SEQ ID NO: 207) of a native sequence PRO1139 cDNA, wherein SEQ ID NO: 207 is a clone designated herein as “DNA59497-1496”. [0234]FIG. 208 shows the amino acid sequence (SEQ ID NO: 208) derived from the coding sequence of SEQ ID NO: 207 shown in FIG. 207. [0235]FIG. 209 shows a nucleotide sequence (SEQ ID NO: 209) of a native sequence PRO1065 cDNA, wherein SEQ ID NO: 209 is a clone designated herein as “DNA59602-1436”. [0236]FIG. 210 shows the amino acid sequence (SEQ ID NO: 210) derived from the coding sequence of SEQ ID NO: 209 shown in FIG. 209. [0237]FIG. 211 shows a nucleotide sequence (SEQ ID NO: 211) of a native sequence PRO1028 cDNA, wherein SEQ ID NO: 211 is a clone designated herein as “DNA59603-1419”. [0238]FIG. 212 shows the amino acid sequence (SEQ ID NO: 212) derived from the coding sequence of SEQ ID NO: 211 shown in FIG. 211. [0239]FIG. 213 shows a nucleotide sequence (SEQ ID NO: 213) of a native sequence PRO1027 cDNA, wherein SEQ ID NO: 213 is a clone designated herein as “DNA59605-1418”. [0240]FIG. 214 shows the amino acid sequence (SEQ ID NO: 214) derived from the coding sequence of SEQ ID NO: 213 shown in FIG. 213. [0241]FIG. 215 shows a nucleotide sequence (SEQ ID NO: 215) of a native sequence PRO1140 cDNA, wherein SEQ ID NO: 215 is a clone designated herein as “DNA59607-1497”. [0242]FIG. 216 shows the amino acid sequence (SEQ ID NO: 216) derived from the coding sequence of SEQ ID NO: 215 shown in FIG. 215. [0243]FIG. 217 shows a nucleotide sequence (SEQ ID NO: 217) of a native sequence PRO1291 cDNA, wherein SEQ ID NO: 217 is a clone designated herein as “DNA59610-1556”. [0244]FIG. 218 shows the amino acid sequence (SEQ ID NO: 218) derived from the coding sequence of SEQ ID NO: 217 shown in FIG. 217. [0245]FIG. 219 shows a nucleotide sequence (SEQ ID NO: 219) of a native sequence PRO1105 cDNA, wherein SEQ ID NO: 219 is a clone designated herein as “DNA59612-1466”. [0246]FIG. 220 shows the amino acid sequence (SEQ ID NO: 220) derived from the coding sequence of SEQ ID NO: 219 shown in FIG. 219. [0247]FIG. 221 shows a nucleotide sequence (SEQ ID NO: 221) of a native sequence PRO1026 cDNA, wherein SEQ ID NO: 221 is a clone designated herein as “DNA59613-1417”. [0248]FIG. 222 shows the amino acid sequence (SEQ ID NO: 222) derived from the coding sequence of SEQ ID NO: 221 shown in FIG. 221. [0249]FIG. 223 shows a nucleotide sequence (SEQ ID NO: 223) of a native sequence PRO1104 cDNA, wherein SEQ ID NO: 223 is a clone designated herein as “DNA59616-1465”. [0250]FIG. 224 shows the amino acid sequence (SEQ ID NO: 224) derived from the coding sequence of SEQ ID NO: 223 shown in FIG. 223. [0251]FIG. 225 shows a nucleotide sequence (SEQ ID NO: 225) of a native sequence PRO1100 cDNA, wherein SEQ ID NO: 225 is a clone designated herein as “DNA59619-1464”. [0252]FIG. 226 shows the amino acid sequence (SEQ ID NO: 226) derived from the coding sequence of SEQ ID NO: 225 shown in FIG. 225. [0253]FIG. 227 shows a nucleotide sequence (SEQ ID NO: 227) of a native sequence PRO1141 cDNA, wherein SEQ ID NO: 227 is a clone designated herein as “DNA59625-1498”. [0254]FIG. 228 shows the amino acid sequence (SEQ ID NO: 228) derived from the coding sequence of SEQ ID NO: 227 shown in FIG. 227. [0255]FIG. 229 shows a nucleotide sequence (SEQ ID NO: 229) of a native sequence PRO1772 cDNA, wherein SEQ ID NO: 229 is a clone designated herein as “DNA59817-1703”. [0256]FIG. 230 shows the amino acid sequence (SEQ ID NO: 230) derived from the coding sequence of SEQ ID NO: 229 shown in FIG. 229. [0257]FIG. 231 shows a nucleotide sequence (SEQ ID NO: 231) of a native sequence PRO1064 cDNA, wherein SEQ ID NO: 231 is a clone designated herein as “DNA59827-1426”. [0258]FIG. 232 shows the amino acid sequence (SEQ ID NO: 232) derived from the coding sequence of SEQ ID NO: 231 shown in FIG. 231. [0259]FIG. 233 shows a nucleotide sequence (SEQ ID NO: 233) of a native sequence PRO1379 cDNA, wherein SEQ ID NO: 233 is a clone designated herein as “DNA59828-1608”. [0260]FIG. 234 shows the amino acid sequence (SEQ ID NO: 234) derived from the coding sequence of SEQ ID NO: 233 shown in FIG. 233. [0261]FIG. 235 shows a nucleotide sequence (SEQ ID NO: 235) of a native sequence PRO3573 cDNA, wherein SEQ ID NO: 235 is a clone designated herein as “DNA59837-2545”. [0262]FIG. 236 shows the amino acid sequence (SEQ ID NO: 236) derived from the coding sequence of SEQ ID NO: 235 shown in FIG. 235. [0263]FIG. 237 shows a nucleotide sequence (SEQ ID NO: 237) of a native sequence PRO3566 cDNA, wherein SEQ ID NO: 237 is a clone designated herein as “DNA59844-2542”. [0264]FIG. 238 shows the amino acid sequence (SEQ ID NO: 238) derived from the coding sequence of SEQ ID NO: 237 shown in FIG. 237. [0265]FIG. 239 shows a nucleotide sequence (SEQ ID NO: 239) of a native sequence PRO1156 cDNA, wherein SEQ ID NO: 239 is a clone designated herein as “DNA59853-1505”. [0266]FIG. 240 shows the amino acid sequence (SEQ ID NO: 240) derived from the coding sequence of SEQ ID NO: 239 shown in FIG. 239. [0267]FIG. 241 shows a nucleotide sequence (SEQ ID NO: 241) of a native sequence PRO1098 cDNA, wherein SEQ ID NO: 241 is a clone designated herein as “DNA59854-1459”. [0268]FIG. 242 shows the amino acid sequence (SEQ ID NO: 242) derived from the coding sequence of SEQ ID NO: 241 shown in FIG. 241. [0269]FIG. 243 shows a nucleotide sequence (SEQ ID NO: 243) of a native sequence PRO1128 cDNA, wherein SEQ ID NO: 243 is a clone designated herein as “DNA59855-1485”. [0270]FIG. 244 shows the amino acid sequence (SEQ ID NO: 244) derived from the coding sequence of SEQ ID NO: 243 shown in FIG. 243. [0271]FIG. 245 shows a nucleotide sequence (SEQ ID NO: 245) of a native sequence PRO1248 cDNA, wherein SEQ ID NO: 245 is a clone designated herein as “DNA60278-1530”. [0272]FIG. 246 shows the amino acid sequence (SEQ ID NO: 246) derived from the coding sequence of SEQ ID NO: 245 shown in FIG. 245. [0273]FIG. 247 shows a nucleotide sequence (SEQ ID NO: 247) of a native sequence PRO1127 cDNA, wherein SEQ ID NO: 247 is a clone designated herein as “DNA60283-1484”. [0274]FIG. 248 shows the amino acid sequence (SEQ ID NO: 248) derived from the coding sequence of SEQ ID NO: 247 shown in FIG. 247. [0275]FIG. 249 shows a nucleotide sequence (SEQ ID NO: 249) of a native sequence PRO1316 cDNA, wherein SEQ ID NO: 249 is a clone designated herein as “DNA60608-1577”. [0276]FIG. 250 shows the amino acid sequence (SEQ ID NO: 250) derived from the coding sequence of SEQ ID NO: 249 shown in FIG. 249. [0277]FIG. 251 shows a nucleotide sequence (SEQ ID NO: 251) of a native sequence PRO1197 cDNA, wherein SEQ ID NO: 251 is a clone designated herein as “DNA60611-1524”. [0278]FIG. 252 shows the amino acid sequence (SEQ ID NO: 252) derived from the coding sequence of SEQ ID NO: 251 shown in FIG. 251. [0279]FIG. 253 shows a nucleotide sequence (SEQ ID NO: 253) of a native sequence PRO1125 cDNA, wherein SEQ ID NO: 253 is a clone designated herein as “DNA60619-1482”. [0280]FIG. 254 shows the amino acid sequence (SEQ ID NO: 254) derived from the coding sequence of SEQ ID NO: 253 shown in FIG. 253. [0281]FIG. 255 shows a nucleotide sequence (SEQ ID NO: 255) of a native sequence PRO1158 cDNA, wherein SEQ ID NO: 255 is a clone designated herein as “DNA60625-1507”. [0282]FIG. 256 shows the amino acid sequence (SEQ ID NO: 256) derived from the coding sequence of SEQ ID NO: 255 shown in FIG. 255. [0283]FIG. 257 shows a nucleotide sequence (SEQ ID NO: 257) of a native sequence PRO1124 cDNA, wherein SEQ ID NO: 257 is a clone designated herein as “DNA60629-1481”. [0284]FIG. 258 shows the amino acid sequence (SEQ ID NO: 258) derived from the coding sequence of SEQ ID NO: 257 shown in FIG. 257. [0285]FIG. 259 shows a nucleotide sequence (SEQ ID NO: 259) of a native sequence PRO1380 cDNA, wherein SEQ ID NO: 259 is a clone designated herein as “DNA60740-1615”. [0286]FIG. 260 shows the amino acid sequence (SEQ ID NO: 260) derived from the coding sequence of SEQ ID NO: 259 shown in FIG. 259. [0287]FIG. 261 shows a nucleotide sequence (SEQ ID NO: 261) of a native sequence PRO1377 cDNA, wherein SEQ ID NO: 261 is a clone designated herein as “DNA61608-1606”. [0288]FIG. 262 shows the amino acid sequence (SEQ ID NO: 262) derived from the coding sequence of SEQ ID NO: 261 shown in FIG. 261. [0289]FIG. 263 shows a nucleotide sequence (SEQ ID NO: 263) of a native sequence PRO1287 cDNA, wherein SEQ ID NO: 263 is a clone designated herein as “DNA61755-1554”. [0290]FIG. 264 shows the amino acid sequence (SEQ ID NO: 264) derived from the coding sequence of SEQ ID NO: 263 shown in FIG. 263. [0291]FIG. 265 shows a nucleotide sequence (SEQ ID NO: 265) of a native sequence PRO1249 cDNA, wherein SEQ ID NO: 265 is a clone designated herein as “DNA62809-1531”. [0292]FIG. 266 shows the amino acid sequence (SEQ ID NO: 266) derived from the coding sequence of SEQ ID NO: 265 shown in FIG. 265. [0293]FIG. 267 shows a nucleotide sequence (SEQ ID NO: 267) of a native sequence PRO1335 cDNA, wherein SEQ ID NO: 267 is a clone designated herein as “DNA62812-1594”. [0294]FIG. 268 shows the amino acid sequence (SEQ ID NO: 268) derived from the coding sequence of SEQ ID NO: 267 shown in FIG. 267. [0295]FIG. 269 shows a nucleotide sequence (SEQ ID NO: 269) of a native sequence PRO3572 cDNA, wherein SEQ ID NO: 269 is a clone designated herein as “DNA62813-2544”. [0296]FIG. 270 shows the amino acid sequence (SEQ ID NO: 270) derived from the coding sequence of SEQ ID NO: 269 shown in FIG. 269. [0297]FIG. 271 shows a nucleotide sequence (SEQ ID NO: 271) of a native sequence PRO1599 cDNA, wherein SEQ ID NO: 271 is a clone designated herein as “DNA62845-1684”. [0298]FIG. 272 shows the amino acid sequence (SEQ ID NO: 272) derived from the coding sequence of SEQ ID NO: 271 shown in FIG. 271. [0299]FIG. 273 shows a nucleotide sequence (SEQ ID NO: 273) of a native sequence PRO1374 cDNA, wherein SEQ ID NO: 273 is a clone designated herein as “DNA64849-1604”. [0300]FIG. 274 shows the amino acid sequence (SEQ ID NO: 274) derived from the coding sequence of SEQ ID NO: 273 shown in FIG. 273. [0301]FIG. 275 shows a nucleotide sequence (SEQ ID NO: 275) of a native sequence PRO1345 cDNA, wherein SEQ ID NO: 275 is a clone designated herein as “DNA64852-1589”. [0302]FIG. 276 shows the amino acid sequence (SEQ ID NO: 276) derived from the coding sequence of SEQ ID NO: 275 shown in FIG. 275. [0303]FIG. 277 shows a nucleotide sequence (SEQ ID NO: 277) of a native sequence PRO1311 cDNA, wherein SEQ ID NO: 277 is a clone designated herein as “DNA64863-1573”. [0304]FIG. 278 shows the amino acid sequence (SEQ ID NO: 278) derived from the coding sequence of SEQ ID NO: 277 shown in FIG. 277. [0305]FIG. 279 shows a nucleotide sequence (SEQ ID NO: 279) of a native sequence PRO1357 cDNA, wherein SEQ ID NO: 279 is a clone designated herein as “DNA64881-1602”. [0306]FIG. 280 shows the amino acid sequence (SEQ ID NO: 280) derived from the coding sequence of SEQ ID NO: 279 shown in FIG. 279. [0307]FIG. 281 shows a nucleotide sequence (SEQ ID NO: 281) of a native sequence PRO1557 cDNA, wherein SEQ ID NO: 281 is a clone designated herein as “DNA64902-1667”. [0308]FIG. 282 shows the amino acid sequence (SEQ ID NO: 282) derived from the coding sequence of SEQ ID NO: 281 shown in FIG. 281. [0309]FIG. 283 shows a nucleotide sequence (SEQ ID NO: 283) of a native sequence PRO1305 cDNA, wherein SEQ ID NO: 283 is a clone designated herein as “DNA64952-1568”. [0310]FIG. 284 shows the amino acid sequence (SEQ ID NO: 284) derived from the coding sequence of SEQ ID NO: 283 shown in FIG. 283. [0311]FIG. 285 shows a nucleotide sequence (SEQ ID NO: 285) of a native sequence PRO1302 cDNA, wherein SEQ ID NO: 285 is a clone designated herein as “DNA65403-1565”. [0312]FIG. 286 shows the amino acid sequence (SEQ ID NO: 286) derived from the coding sequence of SEQ ID NO: 285 shown in FIG. 285. [0313]FIG. 287 shows a nucleotide sequence (SEQ ID NO: 287) of a native sequence PRO1266 cDNA, wherein SEQ ID NO: 287 is a clone designated herein as “DNA65413-1534”. [0314]FIG. 288 shows the amino acid sequence (SEQ ID NO: 288) derived from the coding sequence of SEQ ID NO: 287 shown in FIG. 287. [0315] FIGS. 289A-289B show a nucleotide sequence (SEQ ID NO: 289) of a native sequence PRO1336 cDNA, wherein SEQ ID NO: 289 is a clone designated herein as “DNA65423-1595”. [0316]FIG. 290 shows the amino acid sequence (SEQ ID NO: 290) derived from the coding sequence of SEQ ID NO: 289 shown in FIGS. 289A-289B. [0317]FIG. 291 shows a nucleotide sequence (SEQ ID NO: 291) of a native sequence PRO1278 cDNA, wherein SEQ ID NO: 291 is a clone designated herein as “DNA66304-1546”. [0318]FIG. 292 shows the amino acid sequence (SEQ ID NO: 292) derived from the coding sequence of SEQ ID NO: 291 shown in FIG. 291. [0319]FIG. 293 shows a nucleotide sequence (SEQ ID NO: 293) of a native sequence PRO1270 cDNA, wherein SEQ ID NO: 293 is a clone designated herein as “DNA66308-1537”. [0320]FIG. 294 shows the amino acid sequence (SEQ ID NO: 294) derived from the coding sequence of SEQ ID NO: 293 shown in FIG. 293. [0321]FIG. 295 shows a nucleotide sequence (SEQ ID NO: 295) of a native sequence PRO1298 cDNA, wherein SEQ ID NO: 295 is a clone designated herein as “DNA66511-1563”. [0322]FIG. 296 shows the amino acid sequence (SEQ ID NO: 296) derived from the coding sequence of SEQ ID NO: 295 shown in FIG. 295. [0323]FIG. 297 shows a nucleotide sequence (SEQ ID NO: 297) of a native sequence PRO1301 cDNA, wherein SEQ ID NO: 297 is a clone designated herein as “DNA66512-1564”. [0324]FIG. 298 shows the amino acid sequence (SEQ ID NO: 298) derived from the coding sequence of SEQ ID NO: 297 shown in FIG. 297. [0325]FIG. 299 shows a nucleotide sequence (SEQ ID NO: 299) of a native sequence PRO1268 cDNA, wherein SEQ ID NO: 299 is a clone designated herein as “DNA66519-1535”. [0326]FIG. 300 shows the amino acid sequence (SEQ ID NO: 300) derived from the coding sequence of SEQ ID NO: 299 shown in FIG. 299. [0327]FIG. 301 shows a nucleotide sequence (SEQ ID NO: 301) of a native sequence PRO1327 cDNA, wherein SEQ ID NO: 301 is a clone designated herein as “DNA66521-1583”. [0328]FIG. 302 shows the amino acid sequence (SEQ ID NO: 302) derived from the coding sequence of SEQ ID NO: 301 shown in FIG. 301. [0329]FIG. 303 shows a nucleotide sequence (SEQ ID NO: 303) of a native sequence PRO1328 cDNA, wherein SEQ ID NO: 303 is a clone designated herein as “DNA66658-1584”. [0330]FIG. 304 shows the amino acid sequence (SEQ ID NO: 304) derived from the coding sequence of SEQ ID NO: 303 shown in FIG. 303. [0331]FIG. 305 shows a nucleotide sequence (SEQ ID NO: 305) of a native sequence PRO1329 cDNA, wherein SEQ ID NO: 305 is a clone designated herein as “DNA66660-1585”. [0332]FIG. 306 shows the amino acid sequence (SEQ ID NO: 306) derived from the coding sequence of SEQ ID NO: 305 shown in FIG. 305. [0333]FIG. 307 shows a nucleotide sequence (SEQ ID NO: 307) of a native sequence PRO1339 cDNA, wherein SEQ ID NO: 307 is a clone designated herein as “DNA66669-1597”. [0334]FIG. 308 shows the amino acid sequence (SEQ ID NO: 308) derived from the coding sequence of SEQ ID NO: 307 shown in FIG. 307. [0335]FIG. 309 shows a nucleotide sequence (SEQ ID NO: 309) of a native sequence PRO1342 cDNA, wherein SEQ ID NO: 309 is a clone designated herein as “DNA66674-1599”. [0336]FIG. 310 shows the amino acid sequence (SEQ ID NO: 310) derived from the coding sequence of SEQ ID NO: 309 shown in FIG. 309. [0337] FIGS. 311A-311B show a nucleotide sequence (SEQ ID NO: 311) of a native sequence PRO1487 cDNA, wherein SEQ ID NO: 311 is a clone designated herein as “DNA68836-1656”. [0338]FIG. 312 shows the amino acid sequence (SEQ ID NO: 312) derived from the coding sequence of SEQ ID NO: 311 shown in FIGS. 311A-311B. [0339]FIG. 313 shows a nucleotide sequence (SEQ ID NO: 313) of a native sequence PRO3579 cDNA, wherein SEQ ID NO: 313 is a clone designated herein as “DNA68862-2546”. [0340]FIG. 314 shows the amino acid sequence (SEQ ID NO: 314) derived from the coding sequence of SEQ ID NO: 313 shown in FIG. 313. [0341]FIG. 315 shows a nucleotide sequence (SEQ ID NO: 315) of a native sequence PRO1472 cDNA, wherein SEQ ID NO: 315 is a clone designated herein as “DNA68866-1644”. [0342]FIG. 316 shows the amino acid sequence (SEQ ID NO: 316) derived from the coding sequence of SEQ ID NO: 315 shown in FIG. 315. [0343]FIG. 317 shows a nucleotide sequence (SEQ ID NO: 317) of a native sequence PRO1385 cDNA, wherein SEQ ID NO: 317 is a clone designated herein as “DNA68869-1610”. [0344]FIG. 318 shows the amino acid sequence (SEQ ID NO: 318) derived from the coding sequence of SEQ ID NO: 317 shown in FIG. 317. [0345]FIG. 319 shows a nucleotide sequence (SEQ ID NO: 319) of a native sequence PRO1461 cDNA, wherein SEQ ID NO: 319 is a clone designated herein as “DNA68871-1638”. [0346]FIG. 320 shows the amino acid sequence (SEQ ID NO: 320) derived from the coding sequence of SEQ ID NO: 319 shown in FIG. 319. [0347]FIG. 321 shows a nucleotide sequence (SEQ ID NO: 321) of a native sequence PRO1429 cDNA, wherein SEQ ID NO: 321 is a clone designated herein as “DNA68879-1631”. [0348]FIG. 322 shows the amino acid sequence (SEQ ID NO: 322) derived from the coding sequence of SEQ ID NO: 321 shown in FIG. 321. [0349]FIG. 323 shows a nucleotide sequence (SEQ ID NO: 323) of a native sequence PRO1568 cDNA, wherein SEQ ID NO: 323 is a clone designated herein as “DNA68880-1676”. [0350]FIG. 324 shows the amino acid sequence (SEQ ID NO: 324) derived from the coding sequence of SEQ ID NO: 323 shown in FIG. 323. [0351]FIG. 325 shows a nucleotide sequence (SEQ ID NO: 325) of a native sequence PRO1569 cDNA, wherein SEQ ID NO: 325 is a clone designated herein as “DNA68882-1677”. [0352]FIG. 326 shows the amino acid sequence (SEQ ID NO: 326) derived from the coding sequence of SEQ ID NO: 325 shown in FIG. 325. [0353]FIG. 327 shows a nucleotide sequence (SEQ ID NO: 327) of a native sequence PRO1753 cDNA, wherein SEQ ID NO: 327 is a clone designated herein as “DNA68883-1691”. [0354]FIG. 328 shows the amino acid sequence (SEQ ID NO: 328) derived from the coding sequence of SEQ ID NO: 327 shown in FIG. 327. [0355]FIG. 329 shows a nucleotide sequence (SEQ ID NO: 329) of a native sequence PRO1570 cDNA, wherein SEQ ID NO: 329 is a clone designated herein as “DNA68885-1678”. [0356]FIG. 330 shows the amino acid sequence (SEQ ID NO: 330) derived from the coding sequence of SEQ ID NO: 329 shown in FIG. 329. [0357]FIG. 331 shows a nucleotide sequence (SEQ ID NO: 331) of a native sequence PRO1559 cDNA, wherein SEQ ID NO: 331 is a clone designated herein as “DNA68886”. [0358]FIG. 332 shows the amino acid sequence (SEQ ID NO: 332) derived from the coding sequence of SEQ ID NO: 331 shown in FIG. 331. [0359]FIG. 333 shows a nucleotide sequence (SEQ ID NO: 333) of a native sequence PRO1486 cDNA, wherein SEQ ID NO: 333 is a clone designated herein as “DNA71180-1655”. [0360]FIG. 334 shows the amino acid sequence (SEQ ID NO: 334) derived from the coding sequence of SEQ ID NO: 333 shown in FIG. 333. [0361]FIG. 335 shows a nucleotide sequence (SEQ ID NO: 335) of a native sequence PRO1433 cDNA, wherein SEQ ID NO: 335 is a clone designated herein as “DNA71184-1634”. [0362]FIG. 336 shows the amino acid sequence (SEQ ID NO: 336) derived from the coding sequence of SEQ ID NO: 335 shown in FIG. 335. [0363]FIG. 337 shows a nucleotide sequence (SEQ ID NO: 337) of a native sequence PRO1490 cDNA, wherein SEQ ID NO: 337 is a clone designated herein as “DNA71213-1659”. [0364]FIG. 338 shows the amino acid sequence (SEQ ID NO: 338) derived from the coding sequence of SEQ ID NO: 337 shown in FIG. 337. [0365]FIG. 339 shows a nucleotide sequence (SEQ ID NO: 339) of a native sequence PRO1482 cDNA, wherein SEQ ID NO: 339 is a clone designated herein as “DNA71234-1651”. [0366]FIG. 340 shows the amino acid sequence (SEQ ID NO: 340) derived from the coding sequence of SEQ ID NO: 339 shown in FIG. 339. [0367]FIG. 341 shows a nucleotide sequence (SEQ ID NO: 341) of a native sequence PRO1409 cDNA, wherein SEQ ID NO: 341 is a clone designated herein as “DNA71269-1621”. [0368]FIG. 342 shows the amino acid sequence (SEQ ID NO: 342) derived from the coding sequence of SEQ ID NO: 341 shown in FIG. 341. [0369]FIG. 343 shows a nucleotide sequence (SEQ ID NO: 343) of a native sequence PRO1446 cDNA, wherein SEQ ID NO: 343 is a clone designated herein as “DNA71277-1636”. [0370]FIG. 344 shows the amino acid sequence (SEQ ID NO: 344) derived from the coding sequence of SEQ ID NO: 343 shown in FIG. 343. [0371]FIG. 345 shows a nucleotide sequence (SEQ ID NO: 345) of a native sequence PRO1604 cDNA, wherein SEQ ID NO: 345 is a clone designated herein as “DNA71286-1687”. [0372]FIG. 346 shows the amino acid sequence (SEQ ID NO: 346) derived from the coding sequence of SEQ ID NO: 345 shown in FIG. 345. [0373]FIG. 347 shows a nucleotide sequence (SEQ ID NO: 347) of a native sequence PRO1491 cDNA, wherein SEQ ID NO: 347 is a clone designated herein as “DNA71883-1660”. [0374]FIG. 348 shows the amino acid sequence (SEQ ID NO: 348) derived from the coding sequence of SEQ ID NO: 347 shown in FIG. 347. [0375]FIG. 349 shows a nucleotide sequence (SEQ ID NO: 349) of a native sequence PRO1431 cDNA, wherein SEQ ID NO: 349 is a clone designated herein as “DNA73401-1633”. [0376]FIG. 350 shows the amino acid sequence (SEQ ID NO: 350) derived from the coding sequence of SEQ ID NO: 349 shown in FIG. 349. [0377] FIGS. 351A-351B show a nucleotide sequence (SEQ ID NO: 351) of a native sequence PRO1563 cDNA, wherein SEQ ID NO: 351 is a clone designated herein as “DNA73492-1671”. [0378]FIG. 352 shows the amino acid sequence (SEQ ID NO: 352) derived from the coding sequence of SEQ ID NO: 351 shown in FIGS. 351A-351B. [0379]FIG. 353 shows a nucleotide sequence (SEQ ID NO: 353) of a native sequence PRO1571 cDNA, wherein SEQ ID NO: 353 is a clone designated herein as “DNA73730-1679”. [0380]FIG. 354 shows the amino acid sequence (SEQ ID NO: 354) derived from the coding sequence of SEQ ID NO: 353 shown in FIG. 353. [0381]FIG. 355 shows a nucleotide sequence (SEQ ID NO: 355) of a native sequence PRO1572 cDNA, wherein SEQ ID NO: 355 is a clone designated herein as “DNA73734-1680”. [0382]FIG. 356 shows the amino acid sequence (SEQ ID NO: 356) derived from the coding sequence of SEQ ID NO: 355 shown in FIG. 355. [0383]FIG. 357 shows a nucleotide sequence (SEQ ID NO: 357) of a native sequence PRO1573 cDNA, wherein SEQ ID NO: 357 is a clone designated herein as “DNA73735-1681”. [0384]FIG. 358 shows the amino acid sequence (SEQ ID NO: 358) derived from the coding sequence of SEQ ID NO: 357 shown in FIG. 357. [0385]FIG. 359 shows a nucleotide sequence (SEQ ID NO: 359) of a native sequence PRO1508 cDNA, wherein SEQ ID NO: 359 is a clone designated herein as “DNA73742-1662”. [0386]FIG. 360 shows the amino acid sequence (SEQ ID NO: 360) derived from the coding sequence of SEQ ID NO: 359 shown in FIG. 359. [0387]FIG. 361 shows a nucleotide sequence (SEQ ID NO: 361) of a native sequence PRO1485 cDNA, wherein SEQ ID NO: 361 is a clone designated herein as “DNA73746-1654”. [0388]FIG. 362 shows the amino acid sequence (SEQ ID NO: 362) derived from the coding sequence of SEQ ID NO: 361 shown in FIG. 361. [0389]FIG. 363 shows a nucleotide sequence (SEQ ID NO: 363) of a native sequence PRO1564 cDNA, wherein SEQ ID NO: 363 is a clone designated herein as “DNA73760-1672”. [0390]FIG. 364 shows the amino acid sequence (SEQ ID NO: 364) derived from the coding sequence of SEQ ID NO: 363 shown in FIG. 363. [0391]FIG. 365 shows a nucleotide sequence (SEQ ID NO: 365) of a native sequence PRO1550 cDNA, wherein SEQ ID NO: 365 is a clone designated herein as “DNA76393-1664”. [0392]FIG. 366 shows the amino acid sequence (SEQ ID NO: 366) derived from the coding sequence of SEQ ID NO: 365 shown in FIG. 365. [0393]FIG. 367 shows a nucleotide sequence (SEQ ID NO: 367) of a native sequence PRO1757 cDNA, wherein SEQ ID NO: 367 is a clone designated herein as “DNA76398-1699”. [0394]FIG. 368 shows the amino acid sequence (SEQ ID NO: 368) derived from the coding sequence of SEQ ID NO: 367 shown in FIG. 367. [0395]FIG. 369 shows a nucleotide sequence (SEQ ID NO: 369) of a native sequence PRO1758 cDNA, wherein SEQ ID NO: 369 is a clone designated herein as “DNA76399-1700”. [0396]FIG. 370 shows the amino acid sequence (SEQ ID NO: 370) derived from the coding sequence of SEQ ID NO: 369 shown in FIG. 369. [0397]FIG. 371 shows a nucleotide sequence (SEQ ID NO: 371) of a native sequence PRO1781 cDNA, wherein SEQ ID NO: 371 is a clone designated herein as “DNA76522-2500”. [0398]FIG. 372 shows the amino acid sequence (SEQ ID NO: 372) derived from the coding sequence of SEQ ID NO: 371 shown in FIG. 371. [0399]FIG. 373 shows a nucleotide sequence (SEQ ID NO: 373) of a native sequence PRO1606 cDNA, wherein SEQ ID NO: 373 is a clone designated herein as “DNA76533-1689”. [0400]FIG. 374 shows the amino acid sequence (SEQ ID NO: 374) derived from the coding sequence of SEQ ID NO: 373 shown in FIG. 373. [0401]FIG. 375 shows a nucleotide sequence (SEQ ID NO: 375) of a native sequence PRO1784 cDNA, wherein SEQ ID NO: 375 is a clone designated herein as “DNA77303-2502”. [0402]FIG. 376 shows the amino acid sequence (SEQ ID NO: 376) derived from the coding sequence of SEQ ID NO: 375 shown in FIG. 375. [0403]FIG. 377 shows a nucleotide sequence (SEQ ID NO: 377) of a native sequence PRO1774 cDNA, wherein SEQ ID NO: 377 is a clone designated herein as “DNA77626-1705”. [0404]FIG. 378 shows the amino acid sequence (SEQ ID NO: 378) derived from the coding sequence of SEQ ID NO: 377 shown in FIG. 377. [0405]FIG. 379 shows a nucleotide sequence (SEQ ID NO: 379) of a native sequence PRO1605 cDNA, wherein SEQ ID NO: 379 is a clone designated herein as “DNA77648-1688”. [0406]FIG. 380 shows the amino acid sequence (SEQ ID NO: 380) derived from the coding sequence of SEQ ID NO: 379 shown in FIG. 379. [0407]FIG. 381 shows a nucleotide sequence (SEQ ID NO: 381) of a native sequence PRO1928 cDNA, wherein SEQ ID NO: 381 is a clone designated herein as “DNA81754-2532”. [0408]FIG. 382 shows the amino acid sequence (SEQ ID NO: 382) derived from the coding sequence of SEQ ID NO: 381 shown in FIG. 381. [0409]FIG. 383 shows a nucleotide sequence (SEQ ID NO: 383) of a native sequence PRO1865 cDNA, wherein SEQ ID NO: 383 is a clone designated herein as “DNA81757-2512”. [0410]FIG. 384 shows the amino acid sequence (SEQ ID NO: 384) derived from the coding sequence of SEQ ID NO: 383 shown in FIG. 383. [0411]FIG. 385 shows a nucleotide sequence (SEQ ID NO: 385) of a native sequence PRO1925 cDNA, wherein SEQ ID NO: 385 is a clone designated herein as “DNA82302-2529”. [0412]FIG. 386 shows the amino acid sequence (SEQ ID NO: 386) derived from the coding sequence of SEQ ID NO: 385 shown in FIG. 385. [0413]FIG. 387 shows a nucleotide sequence (SEQ ID NO: 387) of a native sequence PRO1926 cDNA, wherein SEQ ID NO: 387 is a clone designated herein as “DNA82340-2530”. [0414]FIG. 388 shows the amino acid sequence (SEQ ID NO: 388) derived from the coding sequence of SEQ ID NO: 387 shown in FIG. 387. [0415]FIG. 389 shows a nucleotide sequence (SEQ ID NO: 389) of a native sequence PRO2630 cDNA, wherein SEQ ID NO: 389 is a clone designated herein as “DNA83551”. [0416]FIG. 390 shows the amino acid sequence (SEQ ID NO: 390) derived from the coding sequence of SEQ ID NO: 389 shown in FIG. 389. [0417]FIG. 391 shows a nucleotide sequence (SEQ ID NO: 391) of a native sequence PRO3443 cDNA, wherein SEQ ID NO: 391 is a clone designated herein as “DNA87991-2540”. [0418]FIG. 392 shows the amino acid sequence (SEQ ID NO: 392) derived from the coding sequence of SEQ ID NO: 391 shown in FIG. 391. [0419]FIG. 393 shows a nucleotide sequence (SEQ ID NO: 393) of a native sequence PRO3301 cDNA, wherein SEQ ID NO: 393 is a clone designated herein as “DNA88002”. [0420]FIG. 394 shows the amino acid sequence (SEQ ID NO: 394) derived from the coding sequence of SEQ ID NO: 393 shown in FIG. 393. [0421]FIG. 395 shows a nucleotide sequence (SEQ ID NO: 395) of a native sequence PRO3442 cDNA, wherein SEQ ID NO: 395 is a clone designated herein as “DNA92238-2539”. [0422]FIG. 396 shows the amino acid sequence (SEQ ID NO: 396) derived from the coding sequence of SEQ ID NO: 395 shown in FIG. 395. [0423]FIG. 397 shows a nucleotide sequence (SEQ ID NO: 397) of a native sequence PRO4978 cDNA, wherein SEQ ID NO: 397 is a clone designated herein as “DNA95930”. [0424]FIG. 398 shows the amino acid sequence (SEQ ID NO: 398) derived from the coding sequence of SEQ ID NO: 397 shown in FIG. 397. [0425]FIG. 399 shows a nucleotide sequence (SEQ ID NO: 399) of a native sequence PRO5801 cDNA, wherein SEQ ID NO: 399 is a clone designated herein as “DNA115291-2681”. [0426]FIG. 400 shows the amino acid sequence (SEQ ID NO: 400) derived from the coding sequence of SEQ ID NO: 399 shown in FIG. 399. [0427]FIG. 401 shows a nucleotide sequence (SEQ ID NO: 401) of a native sequence PRO19630 cDNA, wherein SEQ ID NO: 401 is a clone designated herein as “DNA23336-2861”. [0428]FIG. 402 shows the amino acid sequence (SEQ ID NO: 402) derived from the coding sequence of SEQ ID NO: 401 shown in FIG. 401. [0429]FIG. 403 shows a nucleotide sequence (SEQ ID NO: 403) of a native sequence PRO203 cDNA, wherein SEQ ID NO: 403 is a clone designated herein as “DNA30862-1396”. [0430]FIG. 404 shows the amino acid sequence (SEQ ID NO: 404) derived from the coding sequence of SEQ ID NO: 403 shown in FIG. 403. [0431]FIG. 405 shows a nucleotide sequence (SEQ ID NO: 405) of a native sequence PRO204 cDNA, wherein SEQ ID NO: 405 is a clone designated herein as “DNA30871-1157”. [0432]FIG. 406 shows the amino acid sequence (SEQ ID NO: 406) derived from the coding sequence of SEQ ID NO: 405 shown in FIG. 405. [0433]FIG. 407 shows a nucleotide sequence (SEQ ID NO: 407) of a native sequence PRO210 cDNA, wherein SEQ ID NO: 407 is a clone designated herein as “DNA32279-1131”. [0434]FIG. 408 shows the amino acid sequence (SEQ ID NO: 408) derived from the coding sequence of SEQ ID NO: 407 shown in FIG. 407. [0435]FIG. 409 shows a nucleotide sequence (SEQ ID NO: 409) of a native sequence PRO223 cDNA, wherein SEQ ID NO: 409 is a clone designated herein as “DNA33206-1165”. [0436]FIG. 410 shows the amino acid sequence (SEQ ID NO: 410) derived from the coding sequence of SEQ ID NO: 409 shown in FIG. 409. [0437]FIG. 411 shows a nucleotide sequence (SEQ ID NO: 411) of a native sequence PRO247 cDNA, wherein SEQ ID NO: 411 is a clone designated herein as “DNA35673-1201”. [0438]FIG. 412 shows the amino acid sequence (SEQ ID NO: 412) derived from the coding sequence of SEQ ID NO: 411 shown in FIG. 411. [0439]FIG. 413 shows a nucleotide sequence (SEQ ID NO: 413) of a native sequence PRO358 cDNA, wherein SEQ ID NO: 413 is a clone designated herein as “DNA47361-1154-2”. [0440]FIG. 414 shows the amino acid sequence (SEQ ID NO: 414) derived from the coding sequence of SEQ ID NO: 413 shown in FIG. 413. [0441]FIG. 415 shows a nucleotide sequence (SEQ ID NO: 415) of a native sequence PRO724 cDNA, wherein SEQ ID NO: 415 is a clone designated herein as “DNA49631-1328”. [0442]FIG. 416 shows the amino acid sequence (SEQ ID NO: 416) derived from the coding sequence of SEQ ID NO: 415 shown in FIG. 415. [0443]FIG. 417 shows a nucleotide sequence (SEQ ID NO: 417) of a native sequence PRO868 cDNA, wherein SEQ ID NO: 417 is a clone designated herein as “DNA52594-1270”. [0444]FIG. 418 shows the amino acid sequence (SEQ ID NO: 418) derived from the coding sequence of SEQ ID NO: 417 shown in FIG. 417. [0445]FIG. 419 shows a nucleotide sequence (SEQ ID NO: 419) of a native sequence PRO740 cDNA, wherein SEQ ID NO: 419 is a clone designated herein as “DNA55800-1263”. [0446]FIG. 420 shows the amino acid sequence (SEQ ID NO: 420) derived from the coding sequence of SEQ ID NO: 419 shown in FIG. 419. [0447]FIG. 421 shows a nucleotide sequence (SEQ ID NO: 421) of a native sequence PRO1478 cDNA, wherein SEQ ID NO: 421 is a clone designated herein as “DNA56531-1648”. [0448]FIG. 422 shows the amino acid sequence (SEQ ID NO: 422) derived from the coding sequence of SEQ ID NO: 421 shown in FIG. 421. [0449]FIG. 423 shows a nucleotide sequence (SEQ ID NO: 423) of a native sequence PRO162 cDNA, wherein SEQ ID NO: 423 is a clone designated herein as “DNA56965-1356”. [0450]FIG. 424 shows the amino acid sequence (SEQ ID NO: 424) derived from the coding sequence of SEQ ID NO: 423 shown in FIG. 423. [0451]FIG. 425 shows a nucleotide sequence (SEQ ID NO: 425) of a native sequence PRO828 cDNA, wherein SEQ ID NO: 425 is a clone designated herein as “DNA57037-1444”. [0452]FIG. 426 shows the amino acid sequence (SEQ ID NO: 426) derived from the coding sequence of SEQ ID NO: 425 shown in FIG. 425. [0453]FIG. 427 shows a nucleotide sequence (SEQ ID NO: 427) of a native sequence PRO819 cDNA, wherein SEQ ID NO: 427 is a clone designated herein as “DNA57695-1340”. [0454]FIG. 428 shows the amino acid sequence (SEQ ID NO: 428) derived from the coding sequence of SEQ ID NO: 427 shown in FIG. 427. [0455]FIG. 429 shows a nucleotide sequence (SEQ ID NO: 429) of a native sequence PRO813 cDNA, wherein SEQ ID NO: 429 is a clone designated herein as “DNA57834-1339”. [0456]FIG. 430 shows the amino acid sequence (SEQ ID NO: 430) derived from the coding sequence of SEQ ID NO: 429 shown in FIG. 429. [0457]FIG. 431 shows a nucleotide sequence (SEQ ID NO: 431) of a native sequence PRO1194 cDNA, wherein SEQ ID NO: 431 is a clone designated herein as “DNA57841-1522”. [0458]FIG. 432 shows the amino acid sequence (SEQ ID NO: 432) derived from the coding sequence of SEQ ID NO: 431 shown in FIG. 431. [0459]FIG. 433 shows a nucleotide sequence (SEQ ID NO: 433) of a native sequence PRO887 cDNA, wherein SEQ ID NO: 433 is a clone designated herein as “DNA58130”. [0460]FIG. 434 shows the amino acid sequence (SEQ ID NO: 434) derived from the coding sequence of SEQ ID NO: 433 shown in FIG. 433. [0461]FIG. 435 shows a nucleotide sequence (SEQ ID NO: 435) of a native sequence PRO1071 cDNA, wherein SEQ ID NO: 435 is a clone designated herein as “DNA58847-1383”. [0462]FIG. 436 shows the amino acid sequence (SEQ ID NO: 436) derived from the coding sequence of SEQ ID NO: 435 shown in FIG. 435. [0463]FIG. 437 shows a nucleotide sequence (SEQ ID NO: 437) of a native sequence PRO1029 cDNA, wherein SEQ ID NO: 437 is a clone designated herein as “DNA59493-1420”. [0464]FIG. 438 shows the amino acid sequence (SEQ ID NO: 438) derived from the coding sequence of SEQ ID NO: 437 shown in FIG. 437. [0465]FIG. 439 shows a nucleotide sequence (SEQ ID NO: 439) of a native sequence PRO1190 cDNA, wherein SEQ ID NO: 439 is a clone designated herein as “DNA59586-1520”. [0466]FIG. 440 shows the amino acid sequence (SEQ ID NO: 440) derived from the coding sequence of SEQ ID NO: 439 shown in FIG. 439. [0467]FIG. 441 shows a nucleotide sequence (SEQ ID NO: 441) of a native sequence PRO4334 cDNA, wherein SEQ ID NO: 441 is a clone designated herein as “DNA59608-2577”. [0468]FIG. 442 shows the amino acid sequence (SEQ ID NO: 442) derived from the coding sequence of SEQ ID NO: 441 shown in FIG. 441. [0469]FIG. 443 shows a nucleotide sequence (SEQ ID NO: 443) of a native sequence PRO1155 cDNA, wherein SEQ ID NO: 443 is a clone designated herein as “DNA59849-1504”. [0470]FIG. 444 shows the amino acid sequence (SEQ ID NO: 444) derived from the coding sequence of SEQ ID NO: 443 shown in FIG. 443. [0471]FIG. 445 shows a nucleotide sequence (SEQ ID NO: 445) of a native sequence PRO1157 cDNA, wherein SEQ ID NO: 445 is a clone designated herein as “DNA60292-1506”. [0472]FIG. 446 shows the amino acid sequence (SEQ ID NO: 446) derived from the coding sequence of SEQ ID NO: 445 shown in FIG. 445. [0473]FIG. 447 shows a nucleotide sequence (SEQ ID NO: 447) of a native sequence PRO1122 cDNA, wherein SEQ ID NO: 447 is a clone designated herein as “DNA62377-1381-1”. [0474]FIG. 448 shows the amino acid sequence (SEQ ID NO: 448) derived from the coding sequence of SEQ ID NO: 447 shown in FIG. 447. [0475]FIG. 449 shows a nucleotide sequence (SEQ ID NO: 449) of a native sequence PRO1183 cDNA, wherein SEQ ID NO: 449 is a clone designated herein as “DNA62880-1513”. [0476]FIG. 450 shows the amino acid sequence (SEQ ID NO: 450) derived from the coding sequence of SEQ ID NO: 449 shown in FIG. 449. [0477]FIG. 451 shows a nucleotide sequence (SEQ ID NO: 451) of a native sequence PRO1337 cDNA, wherein SEQ ID NO: 451 is a clone designated herein as “DNA66672-1586”. [0478]FIG. 452 shows the amino acid sequence (SEQ ID NO: 452) derived from the coding sequence of SEQ ID NO: 451 shown in FIG. 451. [0479]FIG. 453 shows a nucleotide sequence (SEQ ID NO: 453) of a native sequence PRO1480 cDNA, wherein SEQ ID NO: 453 is a clone designated herein as “DNA67962-1649”. [0480]FIG. 454 shows the amino acid sequence (SEQ ID NO: 454) derived from the coding sequence of SEQ ID NO: 453 shown in FIG. 453. [0481]FIG. 455 shows a nucleotide sequence (SEQ ID NO: 455) of a native sequence PRO19645 cDNA, wherein SEQ ID NO: 455 is a clone designated herein as “DNA69555-2867”. [0482]FIG. 456 shows the amino acid sequence (SEQ ID NO: 456) derived from the coding sequence of SEQ ID NO: 455 shown in FIG. 455. [0483]FIG. 457 shows a nucleotide sequence (SEQ ID NO: 457) of a native sequence PRO9782 cDNA, wherein SEQ ID NO: 457 is a clone designated herein as “DNA71162-2764”. [0484]FIG. 458 shows the amino acid sequence (SEQ ID NO: 458) derived from the coding sequence of SEQ ID NO: 457 shown in FIG. 457. [0485]FIG. 459 shows a nucleotide sequence (SEQ ID NO: 459) of a native sequence PRO1419 cDNA, wherein SEQ ID NO: 459 is a clone designated herein as “DNA71290-1630”. [0486]FIG. 460 shows the amino acid sequence (SEQ ID NO: 460) derived from the coding sequence of SEQ ID NO: 459 shown in FIG. 459. [0487]FIG. 461 shows a nucleotide sequence (SEQ ID NO: 461) of a native sequence PRO1575 cDNA, wherein SEQ ID NO: 461 is a clone designated herein as “DNA76401-1683”. [0488]FIG. 462 shows the amino acid sequence (SEQ ID NO: 462) derived from the coding sequence of SEQ ID NO: 461 shown in FIG. 461. [0489]FIG. 463 shows a nucleotide sequence (SEQ ID NO: 463) of a native sequence PRO1567 cDNA, wherein SEQ ID NO: 463 is a clone designated herein as “DNA76541-1675”. [0490]FIG. 464 shows the amino acid sequence (SEQ ID NO: 464) derived from the coding sequence of SEQ ID NO: 463 shown in FIG. 463. [0491]FIG. 465 shows a nucleotide sequence (SEQ ID NO: 465) of a native sequence PRO1891 cDNA, wherein SEQ ID NO: 465 is a clone designated herein as “DNA76788-2526”. [0492]FIG. 466 shows the amino acid sequence (SEQ ID NO: 466) derived from the coding sequence of SEQ ID NO: 465 shown in FIG. 465. [0493]FIG. 467 shows a nucleotide sequence (SEQ ID NO: 467) of a native sequence PRO1889 cDNA, wherein SEQ ID NO: 467 is a clone designated herein as “DNA77623-2524”. [0494]FIG. 468 shows the amino acid sequence (SEQ ID NO: 468) derived from the coding sequence of SEQ ID NO: 467 shown in FIG. 467. [0495]FIG. 469 shows a nucleotide sequence (SEQ ID NO: 469) of a native sequence PRO1785 cDNA, wherein SEQ ID NO: 469 is a clone designated herein as “DNA80136-2503”. [0496]FIG. 470 shows the amino acid sequence (SEQ ID NO: 470) derived from the coding sequence of SEQ ID NO: 469 shown in FIG. 469. [0497]FIG. 471 shows a nucleotide sequence (SEQ ID NO: 471) of a native sequence PRO6003 cDNA, wherein SEQ ID NO: 471 is a clone designated herein as “DNA83568-2692”. [0498]FIG. 472 shows the amino acid sequence (SEQ ID NO: 472) derived from the coding sequence of SEQ ID NO: 471 shown in FIG. 471. [0499]FIG. 473 shows a nucleotide sequence (SEQ ID NO: 473) of a native sequence PRO4333 cDNA, wherein SEQ ID NO: 473 is a clone designated herein as “DNA84210-2576”. [0500]FIG. 474 shows the amino acid sequence (SEQ ID NO: 474) derived from the coding sequence of SEQ ID NO: 473 shown in FIG. 473. [0501]FIG. 475 shows a nucleotide sequence (SEQ ID NO: 475) of a native sequence PRO4356 cDNA, wherein SEQ ID NO: 475 is a clone designated herein as “DNA86576-2595”. [0502]FIG. 476 shows the amino acid sequence (SEQ ID NO: 476) derived from the coding sequence of SEQ ID NO: 475 shown in FIG. 475. [0503]FIG. 477 shows a nucleotide sequence (SEQ ID NO: 477) of a native sequence PRO4352 cDNA, wherein SEQ ID NO: 477 is a clone designated herein as “DNA87976-2593”. [0504]FIG. 478 shows the amino acid sequence (SEQ ID NO: 478) derived from the coding sequence of SEQ ID NO: 477 shown in FIG. 477. [0505]FIG. 479 shows a nucleotide sequence (SEQ ID NO: 479) of a native sequence PRO4354 cDNA, wherein SEQ ID NO: 479 is a clone designated herein as “DNA92256-2596”. [0506]FIG. 480 shows the amino acid sequence (SEQ ID NO: 480) derived from the coding sequence of SEQ ID NO: 479 shown in FIG. 479. [0507]FIG. 481 shows a nucleotide sequence (SEQ ID NO: 481) of a native sequence PRO4369 cDNA, wherein SEQ ID NO: 481 is a clone designated herein as “DNA92289-2598”. [0508]FIG. 482 shows the amino acid sequence (SEQ ID NO: 482) derived from the coding sequence of SEQ ID NO: 481 shown in FIG. 481. [0509]FIG. 483 shows a nucleotide sequence (SEQ ID NO: 483) of a native sequence PRO6030 cDNA, wherein SEQ ID NO: 483 is a clone designated herein as “DNA96850-2705”. [0510]FIG. 484 shows the amino acid sequence (SEQ ID NO: 484) derived from the coding sequence of SEQ ID NO: 483 shown in FIG. 483. [0511]FIG. 485 shows a nucleotide sequence (SEQ ID NO: 485) of a native sequence PRO4433 cDNA, wherein SEQ ID NO: 485 is a clone designated herein as “DNA96855-2629”. [0512]FIG. 486 shows the amino acid sequence (SEQ ID NO: 486) derived from the coding sequence of SEQ ID NO: 485 shown in FIG. 485. [0513]FIG. 487 shows a nucleotide sequence (SEQ ID NO: 487) of a native sequence PRO4424 cDNA, wherein SEQ ID NO: 487 is a clone designated herein as “DNA96857-2636”. [0514]FIG. 488 shows the amino acid sequence (SEQ ID NO: 488) derived from the coding sequence of SEQ ID NO: 487 shown in FIG. 487. [0515]FIG. 489 shows a nucleotide sequence (SEQ ID NO: 489) of a native sequence PRO6017 cDNA, wherein SEQ ID NO: 489 is a clone designated herein as “DNA96860-2700”. [0516]FIG. 490 shows the amino acid sequence (SEQ ID NO: 490) derived from the coding sequence of SEQ ID NO: 489 shown in FIG. 489. [0517]FIG. 491 shows a nucleotide sequence (SEQ ID NO: 491) of a native sequence PRO19563 cDNA, wherein SEQ ID NO: 491 is a clone designated herein as “DNA96861-2844”. [0518]FIG. 492 shows the amino acid sequence (SEQ ID NO: 492) derived from the coding sequence of SEQ ID NO: 491 shown in FIG. 491. [0519]FIG. 493 shows a nucleotide sequence (SEQ ID NO: 493) of a native sequence PRO6015 cDNA, wherein SEQ ID NO: 493 is a clone designated herein as “DNA96866-2698”. [0520]FIG. 494 shows the amino acid sequence (SEQ ID NO: 494) derived from the coding sequence of SEQ ID NO: 493 shown in FIG. 493. [0521]FIG. 495 shows a nucleotide sequence (SEQ ID NO: 495) of a native sequence PRO5779 cDNA, wherein SEQ ID NO: 495 is a clone designated herein as “DNA96870-2676”. [0522]FIG. 496 shows the amino acid sequence (SEQ ID NO: 496) derived from the coding sequence of SEQ ID NO: 495 shown in FIG. 495. [0523]FIG. 497 shows a nucleotide sequence (SEQ ID NO: 497) of a native sequence PRO5776 cDNA, wherein SEQ ID NO: 497 is a clone designated herein as “DNA96872-2674”. [0524]FIG. 498 shows the amino acid sequence (SEQ ID NO: 498) derived from the coding sequence of SEQ ID NO: 497 shown in FIG. 497. [0525]FIG. 499 shows a nucleotide sequence (SEQ ID NO: 499) of a native sequence PRO4430 cDNA, wherein SEQ ID NO: 499 is a clone designated herein as “DNA96878-2626”. [0526]FIG. 500 shows the amino acid sequence (SEQ ID NO: 500) derived from the coding sequence of SEQ ID NO: 499 shown in FIG. 499. [0527]FIG. 501 shows a nucleotide sequence (SEQ ID NO: 501) of a native sequence PRO4421 cDNA, wherein SEQ ID NO: 501 is a clone designated herein as “DNA96879-2619”. [0528]FIG. 502 shows the amino acid sequence (SEQ ID NO: 502) derived from the coding sequence of SEQ ID NO: 501 shown in FIG. 501. [0529]FIG. 503 shows a nucleotide sequence (SEQ ID NO: 503) of a native sequence PRO4499 cDNA, wherein SEQ ID NO: 503 is a clone designated herein as “DNA96889-2641”. [0530]FIG. 504 shows the amino acid sequence (SEQ ID NO: 504) derived from the coding sequence of SEQ ID NO: 503 shown in FIG. 503. [0531]FIG. 505 shows a nucleotide sequence (SEQ ID NO: 505) of a native sequence PRO4423 cDNA, wherein SEQ ID NO: 505 is a clone designated herein as “DNA96893-2621”. [0532]FIG. 506 shows the amino acid sequence (SEQ ID NO: 506) derived from the coding sequence of SEQ ID NO: 505 shown in FIG. 505. [0533]FIG. 507 shows a nucleotide sequence (SEQ ID NO: 507) of a native sequence PRO5998 cDNA, wherein SEQ ID NO: 507 is a clone designated herein as “DNA96897-2688”. [0534]FIG. 508 shows the amino acid sequence (SEQ ID NO: 508) derived from the coding sequence of SEQ ID NO: 507 shown in FIG. 507. [0535]FIG. 509 shows a nucleotide sequence (SEQ ID NO: 509) of a native sequence PRO4501 cDNA, wherein SEQ ID NO: 509 is a clone designated herein as “DNA98564-2643”. [0536]FIG. 510 shows the amino acid sequence (SEQ ID NO: 510) derived from the coding sequence of SEQ ID NO: 509 shown in FIG. 509. [0537]FIG. 511 shows a nucleotide sequence (SEQ ID NO: 511) of a native sequence PRO6240 cDNA, wherein SEQ ID NO: 511 is a clone designated herein as “DNA107443-2718”. [0538]FIG. 512 shows the amino acid sequence (SEQ ID NO: 512) derived from the coding sequence of SEQ ID NO: 511 shown in FIG. 511. [0539]FIG. 513 shows a nucleotide sequence (SEQ ID NO: 513) of a native sequence PRO6245 cDNA, wherein SEQ ID NO: 513 is a clone designated herein as “DNA107786-2723”. [0540]FIG. 514 shows the amino acid sequence (SEQ ID NO: 514) derived from the coding sequence of SEQ ID NO: 513 shown in FIG. 513. [0541]FIG. 515 shows a nucleotide sequence (SEQ ID NO: 515) of a native sequence PRO6175 cDNA, wherein SEQ ID NO: 515 is a clone designated herein as “DNA108682-2712”. [0542]FIG. 516 shows the amino acid sequence (SEQ ID NO: 516) derived from the coding sequence of SEQ ID NO: 515 shown in FIG. 515. [0543]FIG. 517 shows a nucleotide sequence (SEQ ID NO: 517) of a native sequence PRO9742 cDNA, wherein SEQ ID NO: 517 is a clone designated herein as “DNA108684-2761”. [0544]FIG. 518 shows the amino acid sequence (SEQ ID NO: 518) derived from the coding sequence of SEQ ID NO: 517 shown in FIG. 517. [0545]FIG. 519 shows a nucleotide sequence (SEQ ID NO: 519) of a native sequence PRO7179 cDNA, wherein SEQ ID NO: 519 is a clone designated herein as “DNA108701-2749”. [0546]FIG. 520 shows the amino acid sequence (SEQ ID NO: 520) derived from the coding sequence of SEQ ID NO: 519 shown in FIG. 519. [0547]FIG. 521 shows a nucleotide sequence (SEQ ID NO: 521) of a native sequence PRO6239 cDNA, wherein SEQ ID NO: 521 is a clone designated herein as “DNA108720-2717”. [0548]FIG. 522 shows the amino acid sequence (SEQ ID NO: 522) derived from the coding sequence of SEQ ID NO: 521 shown in FIG. 521. [0549]FIG. 523 shows a nucleotide sequence (SEQ ID NO: 523) of a native sequence PRO6493 cDNA, wherein SEQ ID NO: 523 is a clone designated herein as “DNA108726-2729”. [0550]FIG. 524 shows the amino acid sequence (SEQ ID NO: 524) derived from the coding sequence of SEQ ID NO: 523 shown in FIG. 523. [0551] FIGS. 525A-525B show a nucleotide sequence (SEQ ID NO: 525) of a native sequence PRO9741 cDNA, wherein SEQ ID NO: 525 is a clone designated herein as “DNA108728-2760”. [0552]FIG. 526 shows the amino acid sequence (SEQ ID NO: 526) derived from the coding sequence of SEQ ID NO: 525 shown in FIGS. 525A-525B. [0553]FIG. 527 shows a nucleotide sequence (SEQ ID NO: 527) of a native sequence PRO9822 cDNA, wherein SEQ ID NO: 527 is a clone designated herein as “DNA108738-2767”. [0554]FIG. 528 shows the amino acid sequence (SEQ ID NO: 528) derived from the coding sequence of SEQ ID NO: 527 shown in FIG. 527. [0555]FIG. 529 shows a nucleotide sequence (SEQ ID NO: 529) of a native sequence PRO6244 cDNA, wherein SEQ ID NO: 529 is a clone designated herein as “DNA108743-2722”. [0556]FIG. 530 shows the amino acid sequence (SEQ ID NO: 530) derived from the coding sequence of SEQ ID NO: 529 shown in FIG. 529. [0557]FIG. 531 shows a nucleotide sequence (SEQ ID NO: 531) of a native sequence PRO9740 cDNA, wherein SEQ ID NO: 531 is a clone designated herein as “DNA108758-2759”. [0558]FIG. 532 shows the amino acid sequence (SEQ ID NO: 532) derived from the coding sequence of SEQ ID NO: 531 shown in FIG. 531. [0559]FIG. 533 shows a nucleotide sequence (SEQ ID NO: 533) of a native sequence PRO9739 cDNA, wherein SEQ ID NO: 533 is a clone designated herein as “DNA108765-2758”. [0560]FIG. 534 shows the amino acid sequence (SEQ ID NO: 534) derived from the coding sequence of SEQ ID NO: 533 shown in FIG. 533. [0561]FIG. 535 shows a nucleotide sequence (SEQ ID NO: 535) of a native sequence PRO7177 cDNA, wherein SEQ ID NO: 535 is a clone designated herein as “DNA108783-2747”. [0562]FIG. 536 shows the amino acid sequence (SEQ ID NO: 536) derived from the coding sequence of SEQ ID NO:535 shown in FIG. 535. [0563]FIG. 537 shows a nucleotide sequence (SEQ ID NO: 537) of a native sequence PRO7178 cDNA, wherein SEQ ID NO: 537 is a clone designated herein as “DNA108789-2748”. [0564]FIG. 538 shows the amino acid sequence (SEQ ID NO: 538) derived from the coding sequence of SEQ ID NO: 537 shown in FIG. 537. [0565]FIG. 539 shows a nucleotide sequence (SEQ ID NO: 539) of a native sequence PRO6246 cDNA, wherein SEQ ID NO: 539 is a clone designated herein as “DNA108806-2724”. [0566]FIG. 540 shows the amino acid sequence (SEQ ID NO: 540) derived from the coding sequence of SEQ ID NO: 539 shown in FIG. 539. [0567]FIG. 541 shows a nucleotide sequence (SEQ ID NO: 541) of a native sequence PRO6241 cDNA, wherein SEQ ID NO: 541 is a clone designated herein as “DNA108936-2719”. [0568]FIG. 542 shows the amino acid sequence (SEQ ID NO: 542) derived from the coding sequence of SEQ ID NO: 541 shown in FIG. 541. [0569]FIG. 543 shows a nucleotide sequence (SEQ ID NO: 543) of a native sequence PRO9835 cDNA, wherein SEQ ID NO: 543 is a clone designated herein as “DNA119510-2771”. [0570]FIG. 544 shows the amino acid sequence (SEQ ID NO: 544) derived from the coding sequence of SEQ ID NO: 543 shown in FIG. 543. [0571]FIG. 545 shows a nucleotide sequence (SEQ ID NO: 545) of a native sequence PRO9857 cDNA, wherein SEQ ID NO: 545 is a clone designated herein as “DNA119517-2778”. [0572]FIG. 546 shows the amino acid sequence (SEQ ID NO: 546) derived from the coding sequence of SEQ ID NO: 545 shown in FIG. 545. [0573]FIG. 547 shows a nucleotide sequence (SEQ ID NO: 547) of a native sequence PRO7436 cDNA, wherein SEQ ID NO: 547 is a clone designated herein as “DNA119535-2756”. [0574]FIG. 548 shows the amino acid sequence (SEQ ID NO: 548) derived from the coding sequence of SEQ ID NO: 547 shown in FIG. 547. [0575]FIG. 549 shows a nucleotide sequence (SEQ ID NO: 549) of a native sequence PRO9856 cDNA, wherein SEQ ID NO: 549 is a clone designated herein as “DNA119537-2777”. [0576]FIG. 550 shows the amino acid sequence (SEQ ID NO: 550) derived from the coding sequence of SEQ ID NO: 549 shown in FIG. 549. [0577]FIG. 551 shows a nucleotide sequence (SEQ ID NO: 551) of a native sequence PRO19605 cDNA, wherein SEQ ID NO: 551 is a clone designated herein as “DNA119714-2851”. [0578]FIG. 552 shows the amino acid sequence (SEQ ID NO: 552) derived from the coding sequence of SEQ ID NO: 551 shown in FIG. 551. [0579]FIG. 553 shows a nucleotide sequence (SEQ ID NO: 553) of a native sequence PRO9859 cDNA, wherein SEQ ID NO: 553 is a clone designated herein as “DNA125170-2780”. [0580]FIG. 554 shows the amino acid sequence (SEQ ID NO: 554) derived from the coding sequence of SEQ ID NO: 553 shown in FIG. 553. [0581]FIG. 555 shows a nucleotide sequence (SEQ ID NO: 555) of a native sequence PRO12970 cDNA, wherein SEQ ID NO: 555 is a clone designated herein as “DNA129594-2841”. [0582]FIG. 556 shows the amino acid sequence (SEQ ID NO: 556) derived from the coding sequence of SEQ ID NO: 555 shown in FIG. 555. [0583]FIG. 557 shows a nucleotide sequence (SEQ ID NO: 557) of a native sequence PRO19626 cDNA, wherein SEQ ID NO: 557 is a clone designated herein as “DNA129793-2857”. [0584]FIG. 558 shows the amino acid sequence (SEQ ID NO: 558) derived from the coding sequence of SEQ ID NO: 557 shown in FIG. 557. [0585]FIG. 559 shows a nucleotide sequence (SEQ ID NO: 559) of a native sequence PRO9833 cDNA, wherein SEQ ID NO: 559 is a clone designated herein as “DNA130809-2769”. [0586]FIG. 560 shows the amino acid sequence (SEQ ID NO: 560) derived from the coding sequence of SEQ ID NO: 559 shown in FIG. 559. [0587]FIG. 561 shows a nucleotide sequence (SEQ ID NO: 561) of a native sequence PRO19670 cDNA, wherein SEQ ID NO: 561 is a clone designated herein as “DNA131639-2874”. [0588]FIG. 562 shows the amino acid sequence (SEQ ID NO: 562) derived from the coding sequence of SEQ ID NO: 561 shown in FIG. 561. [0589]FIG. 563 shows a nucleotide sequence (SEQ ID NO: 563) of a native sequence PRO19624 cDNA, wherein SEQ ID NO: 563 is a clone designated herein as “DNA131649-2855”. [0590]FIG. 564 shows the amino acid sequence (SEQ ID NO: 564) derived from the coding sequence of SEQ ID NO: 563 shown in FIG. 563. [0591]FIG. 565 shows a nucleotide sequence (SEQ ID NO: 565) of a native sequence PRO19680 cDNA, wherein SEQ ID NO: 565 is a clone designated herein as “DNA131652-2876”. [0592]FIG. 566 shows the amino acid sequence (SEQ ID NO: 566) derived from the coding sequence of SEQ ID NO: 565 shown in FIG. 565. [0593]FIG. 567 shows a nucleotide sequence (SEQ ID NO: 567) of a native sequence PRO19675 cDNA, wherein SEQ ID NO: 567 is a clone designated herein as “DNA131658-2875”. [0594]FIG. 568 shows the amino acid sequence (SEQ ID NO: 568) derived from the coding sequence of SEQ ID NO: 567 shown in FIG. 567. [0595]FIG. 569 shows a nucleotide sequence (SEQ ID NO: 569) of a native sequence PRO9834 cDNA, wherein SEQ ID NO: 569 is a clone designated herein as “DNA132162-2770”. [0596]FIG. 570 shows the amino acid sequence (SEQ ID NO: 570) derived from the coding sequence of SEQ ID NO: 569 shown in FIG. 569. [0597]FIG. 571 shows a nucleotide sequence (SEQ ID NO: 571) of a native sequence PRO9744 cDNA, wherein SEQ ID NO: 571 is a clone designated herein as “DNA136110-2763”. [0598]FIG. 572 shows the amino acid sequence (SEQ ID NO: 572) derived from the coding sequence of SEQ ID NO: 571 shown in FIG. 571. [0599]FIG. 573 shows a nucleotide sequence (SEQ ID NO: 573) of a native sequence PRO19644 cDNA, wherein SEQ ID NO: 573 is a clone designated herein as “DNA139592-2866”. [0600]FIG. 574 shows the amino acid sequence (SEQ ID NO: 574) derived from the coding sequence of SEQ ID NO: 573 shown in FIG. 573. [0601]FIG. 575 shows a nucleotide sequence (SEQ ID NO: 575) of a native sequence PRO19625 cDNA, wherein SEQ ID NO: 575 is a clone designated herein as “DNA139608-2856”. [0602]FIG. 576 shows the amino acid sequence (SEQ ID NO: 576) derived from the coding sequence of SEQ ID NO: 575 shown in FIG. 575. [0603]FIG. 577 shows a nucleotide sequence (SEQ ID NO: 577) of a native sequence PRO19597 cDNA, wherein SEQ ID NO: 577 is a clone designated herein as “DNA143292-2848”. [0604]FIG. 578 shows the amino acid sequence (SEQ ID NO: 578) derived from the coding sequence of SEQ ID NO: 577 shown in FIG. 577. [0605]FIG. 579 shows a nucleotide sequence (SEQ ID NO: 579) of a native sequence PRO16090 cDNA, wherein SEQ ID NO: 579 is a clone designated herein as “DNA144844-2843”. [0606]FIG. 580 shows the amino acid sequence (SEQ ID NO: 580) derived from the coding sequence of SEQ ID NO: 579 shown in FIG. 579. [0607]FIG. 581 shows a nucleotide sequence (SEQ ID NO: 581) of a native sequence PRO19576 cDNA, wherein SEQ ID NO: 581 is a clone designated herein as “DNA144857-2845”. [0608]FIG. 582 shows the amino acid sequence (SEQ ID NO: 582) derived from the coding sequence of SEQ ID NO: 581 shown in FIG. 581. [0609]FIG. 583 shows a nucleotide sequence (SEQ ID NO: 583) of a native sequence PRO19646 cDNA, wherein SEQ ID NO: 583 is a clone designated herein as “DNA145841-2868”. [0610]FIG. 584 shows the amino acid sequence (SEQ ID NO: 584) derived from the coding sequence of SEQ ID NO: 583 shown in FIG. 583. [0611]FIG. 585 shows a nucleotide sequence (SEQ ID NO: 585) of a native sequence PRO19814 cDNA, wherein SEQ ID NO: 585 is a clone designated herein as “DNA148004-2882”. [0612]FIG. 586 shows the amino acid sequence (SEQ ID NO: 586) derived from the coding sequence of SEQ ID NO: 585 shown in FIG. 585. [0613]FIG. 587 shows a nucleotide sequence (SEQ ID NO: 587) of a native sequence PRO19669 cDNA, wherein SEQ ID NO: 587 is a clone designated herein as “DNA149893-2873”. [0614]FIG. 588 shows the amino acid sequence (SEQ ID NO: 588) derived from the coding sequence of SEQ ID NO: 587 shown in FIG. 587. [0615]FIG. 589 shows a nucleotide sequence (SEQ ID NO: 589) of a native sequence PRO19818 cDNA, wherein SEQ ID NO: 589 is a clone designated herein as “DNA149930-2884”. [0616]FIG. 590 shows the amino acid sequence (SEQ ID NO: 590) derived from the coding sequence of SEQ ID NO: 589 shown in FIG. 589. [0617]FIG. 591 shows a nucleotide sequence (SEQ ID NO: 591) of a native sequence PRO20088 cDNA, wherein SEQ ID NO: 591 is a clone designated herein as “DNA150157-2898”. [0618]FIG. 592 shows the amino acid sequence (SEQ ID NO: 592) derived from the coding sequence of SEQ ID NO: 591 shown in FIG. 591. [0619]FIG. 593 shows a nucleotide sequence (SEQ ID NO: 593) of a native sequence PRO16089 cDNA, wherein SEQ ID NO: 593 is a clone designated herein as “DNA150163-2842”. [0620]FIG. 594 shows the amino acid sequence (SEQ ID NO: 594) derived from the coding sequence of SEQ ID NO: 593 shown in FIG. 593. [0621]FIG. 595 shows a nucleotide sequence (SEQ ID NO: 595) of a native sequence PRO20025 cDNA, wherein SEQ ID NO: 595 is a clone designated herein as “DNA153579-2894”. [0622]FIG. 596 shows the amino acid sequence (SEQ ID NO: 596) derived from the coding sequence of SEQ ID NO: 595 shown in FIG. 595. [0623]FIG. 597 shows a nucleotide sequence (SEQ ID NO: 597) of a native sequence PRO20040 cDNA, wherein SEQ ID NO: 597 is a clone designated herein as “DNA164625-2890”. [0624]FIG. 598 shows the amino acid sequence (SEQ ID NO: 598) derived from the coding sequence of SEQ ID NO: 597 shown in FIG. 597. [0625]FIG. 599 shows a nucleotide sequence (SEQ ID NO: 599) of a native sequence PRO791 cDNA, wherein SEQ ID NO: 599 is a clone designated herein as “DNA57838-1337”. [0626]FIG. 600 shows the amino acid sequence (SEQ ID NO: 600) derived from the coding sequence of SEQ ID NO: 599 shown in FIG. 599. [0627]FIG. 601 shows a nucleotide sequence (SEQ ID NO: 601) of a native sequence PRO1131 cDNA, wherein SEQ ID NO: 601 is a clone designated herein as “DNA59777-1480”. [0628]FIG. 602 shows the amino acid sequence (SEQ ID NO: 602) derived from the coding sequence of SEQ ID NO: 601 shown in FIG. 601. [0629]FIG. 603 shows a nucleotide sequence (SEQ ID NO: 603) of a native sequence PRO1343 cDNA, wherein SEQ ID NO: 603 is a clone designated herein as “DNA66675-1587”. [0630]FIG. 604 shows the amino acid sequence (SEQ ID NO: 604) derived from the coding sequence of SEQ ID NO: 603 shown in FIG. 603. [0631]FIG. 605 shows a nucleotide sequence (SEQ ID NO: 605) of a native sequence PRO1760 cDNA, wherein SEQ ID NO: 605 is a clone designated herein as “DNA76532-1702”. [0632]FIG. 606 shows the amino acid sequence (SEQ ID NO: 606) derived from the coding sequence of SEQ ID NO: 605 shown in FIG. 605. [0633]FIG. 607 shows a nucleotide sequence (SEQ ID NO: 607) of a native sequence PRO6029 cDNA, wherein SEQ ID NO: 607 is a clone designated herein as “DNA105849-2704”. [0634]FIG. 608 shows the amino acid sequence (SEQ ID NO: 608) derived from the coding sequence of SEQ ID NO: 607 shown in FIG. 607. [0635]FIG. 609 shows a nucleotide sequence (SEQ ID NO: 609) of a native sequence PRO1801 cDNA, wherein SEQ ID NO: 609 is a clone designated herein as “DNA83500-2506”. [0636]FIG. 610 shows the amino acid sequence (SEQ ID NO: 610) derived from the coding sequence of SEQ ID NO: 609 shown in FIG. 609. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0637] I. Definitions [0638] The terms “PRO polypeptide” and “PRO” as used herein and when immediately followed by a numerical designation refer to various polypeptides, wherein the complete designation (i.e., PRO/number) refers to specific polypeptide sequences as described herein. The terms “PRO/number polypeptide” and “PRO/number” wherein the term “number” is provided as an actual numerical designation as used herein encompass native sequence polypeptides and polypeptide variants (which are further defined herein). The PRO polypeptides described herein may be isolated from a variety of sources, such as from human tissue types or from another source, or prepared by recombinant or synthetic methods. The term “PRO polypeptide” refers to each individual PRO/number polypeptide disclosed herein. All disclosures in this specification which refer to the “PRO polypeptide” refer to each of the polypeptides individually as well as jointly. For example, descriptions of the preparation of, purification of, derivation of, formation of antibodies to or against, administration of, compositions containing, treatment of a disease with, etc., pertain to each polypeptide of the invention individually. The term “PRO polypeptide” also includes variants of the PRO/number polypeptides disclosed herein. [0639] A “native sequence PRO polypeptide” comprises a polypeptide having the same amino acid sequence as the corresponding PRO polypeptide derived from nature. Such native sequence PRO polypeptides can be isolated from nature or can be produced by recombinant or synthetic means. The term “native sequence PRO polypeptide” specifically encompasses naturally-occurring truncated or secreted forms of the specific PRO polypeptide (e.g., an extracellular domain sequence), naturally-occurring variant forms (e.g., alternatively spliced forms) and naturally-occurring allelic variants of the polypeptide. In various embodiments of the invention, the native sequence PRO polypeptides disclosed herein are mature or full-length native sequence polypeptides comprising the full-length amino acids sequences shown in the accompanying figures. Start and stop codons are shown in bold font and underlined in the figures. However, while the PRO polypeptide disclosed in the accompanying figures are shown to begin with methionine residues designated herein as amino acid position 1 in the figures, it is conceivable and possible that other methionine residues located either upstream or downstream from the amino acid position 1 in the figures may be employed as the starting amino acid residue for the PRO polypeptides. [0640] The PRO polypeptide “extracellular domain” or “ECD” refers to a form of the PRO polypeptide which is essentially free of the transmembrane and cytoplasmic domains. Ordinarily, a PRO polypeptide ECD will have less than 1% of such transmembrane and/or cytoplasmic domains and preferably, will have less than 0.5% of such domains. It will be understood that any transmembrane domains identified for the PRO polypeptides of the present invention are identified pursuant to criteria routinely employed in the art for identifying that type of hydrophobic domain. The exact boundaries of a transmembrane domain may vary but most likely by no more than about 5 amino acids at either end of the domain as initially identified herein. Optionally, therefore, an extracellular domain of a PRO polypeptide may contain from about 5 or fewer amino acids on either side of the transmembrane domain/extracellular domain boundary as identified in the Examples or specification and such polypeptides, with or without the associated signal peptide, and nucleic acid encoding them, are comtemplated by the present invention. [0641] The approximate location of the “signal peptides” of the various PRO polypeptides disclosed herein are shown in the present specification and/or the accompanying figures. It is noted, however, that the C-terminal boundary of a signal peptide may vary, but most likely by no more than about 5 amino acids on either side of the signal peptide C-terminal boundary as initially identified herein, wherein the C-terminal boundary of the signal peptide may be identified pursuant to criteria routinely employed in the art for identifying that type of amino acid sequence element (e.g., Nielsen et al., Prot. Eng. 10:1-6 (1997) and von Heinje et al., Nucl. Acids. Res. 14:4683-4690 (1986)). Moreover, it is also recognized that, in some cases, cleavage of a signal sequence from a secreted polypeptide is not entirely uniform, resulting in more than one secreted species. These mature polypeptides, where the signal peptide is cleaved within no more than about 5 amino acids on either side of the C-terminal boundary of the signal peptide as identified herein, and the polynucleotides encoding them, are contemplated by the present invention. [0642] “PRO polypeptide variant” means an active PRO polypeptide as defined above or below having at least about 80% amino acid sequence identity with a full-length native sequence PRO polypeptide sequence as disclosed herein, a PRO polypeptide sequence lacking the signal peptide as disclosed herein, an extracellular domain of a PRO polypeptide, with or without the signal peptide, as disclosed herein or any other fragment of a full-length PRO polypeptide sequence as disclosed herein. Such PRO polypeptide variants include, for instance, PRO polypeptides wherein one or more amino acid residues are added, or deleted, at the N- or C-terminus of the full-length native amino acid sequence. Ordinarily, a PRO polypeptide variant will have at least about 80% amino acid sequence identity, alternatively at least about 81% amino acid sequence identity, alternatively at least about 82% amino acid sequence identity, alternatively at least about 83% amino acid sequence identity, alternatively at least about 84% amino acid sequence identity, alternatively at least about 85% amino acid sequence identity, alternatively at least about 86% amino acid sequence identity, alternatively at least about 87% amino acid sequence identity, alternatively at least about 88% amino acid sequence identity, alternatively at least about 89% amino acid sequence identity, alternatively at least about 90% amino acid sequence identity, alternatively at least about 91% amino acid sequence identity, alternatively at least about 92% amino acid sequence identity, alternatively at least about 93% amino acid sequence identity, alternatively at least about 94% amino acid sequence identity, alternatively at least about 95% amino acid sequence identity, alternatively at least about 96% amino acid sequence identity, alternatively at least about 97% amino acid sequence identity, alternatively at least about 98% amino acid sequence identity and alternatively at least about 99% amino acid sequence identity to a full-length native sequence PRO polypeptide sequence as disclosed herein, a PRO polypeptide sequence lacking the signal peptide as disclosed herein, an extracellular domain of a PRO polypeptide, with or without the signal peptide, as disclosed herein or any other specifically defined fragment of a full-length PRO polypeptide sequence as disclosed herein. Ordinarily, PRO variant polypeptides are at least about 10 amino acids in length, alternatively at least about 20 amino acids in length, alternatively at least about 30 amino acids in length, alternatively at least about 40 amino acids in length, alternatively at least about 50 amino acids in length, alternatively at least about 60 amino acids in length, alternatively at least about 70 amino acids in length, alternatively at least about 80 amino acids in length, alternatively at least about 90 amino acids in length, alternatively at least about 100 amino acids in length, alternatively at least about 150 amino acids in length, alternatively at least about 200 amino acids in length, alternatively at least about 300 amino acids in length, or more. [0643] “Percent (%) amino acid sequence identity” with respect to the PRO polypeptide sequences identified herein is defined as the percentage of amino acid residues in a candidate sequence that are identical with the amino acid residues in the specific PRO polypeptide sequence, after aligning the sequences and introducing gaps, if necessary, to achieve the maximum percent sequence identity, and not considering any conservative substitutions as part of the sequence identity. Alignment for purposes of determining percent amino acid sequence identity can be achieved in various ways that are within the skill in the art, for instance, using publicly available computer software such as BLAST, BLAST-2, ALIGN or Megalign (DNASTAR) software. Those skilled in the art can determine appropriate parameters for measuring alignment, including any algorithms needed to achieve maximal alignment over the full length of the sequences being compared. For purposes herein, however, % amino acid sequence identity values are generated using the sequence comparison computer program ALIGN-2, wherein the complete source code for the ALIGN-2 program is provided in Table 1 below. The ALIGN-2 sequence comparison computer program was authored by Genentech, Inc. and the source code shown in Table 1 below has been filed with user documentation in the U.S. Copyright Office, Washington D.C., 20559, where it is registered under U.S. Copyright Registration No. TXU510087. The ALIGN-2 program is publicly available through Genentech, Inc., South San Francisco, Calif. or may be compiled from the source code provided in Table 1 below. The ALIGN-2 program should be compiled for use on a UNIX operating system, preferably digital UNIX V4.0D. All sequence comparison parameters are set by the ALIGN-2 program and do not vary. [0644] In situations where ALIGN-2 is employed for amino acid sequence comparisons, the % amino acid sequence identity of a given amino acid sequence A to, with, or against a given amino acid sequence B (which can alternatively be phrased as a given amino acid sequence A that has or comprises a certain % amino acid sequence identity to, with, or against a given amino acid sequence B) is calculated as follows: [0645] 100 times the fraction X/Y [0646] where X is the number of amino acid residues scored as identical matches by the sequence alignment program ALIGN-2 in that program's alignment of A and B, and where Y is the total number of amino acid residues in B. It will be appreciated that where the length of amino acid sequence A is not equal to the length of amino acid sequence B, the % amino acid sequence identity of A to B will not equal the % amino acid sequence identity of B to A. As examples of % amino acid sequence identity calculations using this method, Tables 2 and 3 demonstrate how to calculate the % amino acid sequence identity of the amino acid sequence designated “Comparison Protein” to the amino acid sequence designated “PRO”, wherein “PRO” represents the amino acid sequence of a hypothetical PRO polypeptide of interest, “Comparison Protein” represents the amino acid sequence of a polypeptide against which the “PRO” polypeptide of interest is being compared, and “X, “Y” and “Z” each represent different hypothetical amino acid residues. [0647] Unless specifically stated otherwise, all % amino acid sequence identity values used herein are obtained as described in the immediately preceding paragraph using the ALIGN-2 computer program. However, % amino acid sequence identity values may also be obtained as described below by using the WU-BLAST-2 computer program (Altschul et al., Methods in Enzymology 266:460-480 (1996)). Most of the WU-BLAST-2 search parameters are set to the default values. Those not set to default values, i.e., the adjustable parameters, are set with the following values: overlap span=1, overlap fraction=0.125, word threshold (T)=11, and scoring matrix=BLOSUM62. When WU-BLAST-2 is employed, a % amino acid sequence identity value is determined by dividing (a) the number of matching identical amino acid residues between the amino acid sequence of the PRO polypeptide of interest having a sequence derived from the native PRO polypeptide and the comparison amino acid sequence of interest (i.e., the sequence against which the PRO polypeptide of interest is being compared which may be a PRO variant polypeptide) as determined by WU-BLAST-2 by (b) the total number of amino acid residues of the PRO polypeptide of interest. For example, in the statement “a polypeptide comprising an the amino acid sequence A which has or having at least 80% amino acid sequence identity to the amino acid sequence B”, the amino acid sequence A is the comparison amino acid sequence of interest and the amino acid sequence B is the amino acid sequence of the PRO polypeptide of interest. [0648] Percent amino acid sequence identity may also be determined using the sequence comparison program NCBI-BLAST2 (Altschul et al., Nucleic Acids Res. 25:3389-3402 (1997)). The NCBI-BLAST2 sequence comparison program may be downloaded from http://www.ncbi.nlm.nih.gov or otherwise obtained from the National Institute of Health, Bethesda, Md. NCBI-BLAST2 uses several search parameters, wherein all of those search parameters are set to default values including, for example, unmask=yes, strand=all, expected occurrences=10, minimum low complexity length=15/5, multi-pass e-value=0.01, constant for multi-pass=25, dropoff for final gapped alignment=25 and scoring matrix=BLOSUM62. [0649] In situations where NCBI-BLAST2 is employed for amino acid sequence comparisons, the % amino acid sequence identity of a given amino acid sequence A to, with, or against a given amino acid sequence B (which can alternatively be phrased as a given amino acid sequence A that has or comprises a certain % amino acid sequence identity to, with, or against a given amino acid sequence B) is calculated as follows: [0650] 100 times the fraction X/Y [0651] where X is the number of amino acid residues scored as identical matches by the sequence alignment program NCBI-BLAST2 in that program's alignment of A and B, and where Y is the total number of amino acid residues in B. It will be appreciated that where the length of amino acid sequence A is not equal to the length of amino acid sequence B, the % amino acid sequence identity of A to B will not equal the % amino acid sequence identity of B to A. [0652] “PRO variant polynucleotide” or “PRO variant nucleic acid sequence” means a nucleic acid molecule which encodes an active PRO polypeptide as defined below and which has at least about 80% nucleic acid sequence identity with a nucleotide acid sequence encoding a full-length native sequence PRO polypeptide sequence as disclosed herein, a full-length native sequence PRO polypeptide sequence lacking the signal peptide as disclosed herein, an extracellular domain of a PRO polypeptide, with or without the signal peptide, as disclosed herein or any other fragment of a full-length PRO polypeptide sequence as disclosed herein. Ordinarily, a PRO variant polynucleotide will have at least about 80% nucleic acid sequence identity, alternatively at least about 81% nucleic acid sequence identity, alternatively at least about 82% nucleic acid sequence identity, alternatively at least about 83% nucleic acid sequence identity, alternatively at least about 84% nucleic acid sequence identity, alternatively at least about 85% nucleic acid sequence identity, alternatively at least about 86% nucleic acid sequence identity, alternatively at least about 87% nucleic acid sequence identity, alternatively at least about 88% nucleic acid sequence identity, alternatively at least about 89% nucleic acid sequence identity, alternatively at least about 90% nucleic acid sequence identity, alternatively at least about 91% nucleic acid sequence identity, alternatively at least about 92% nucleic acid sequence identity, alternatively at least about 93% nucleic acid sequence identity, alternatively at least about 94% nucleic acid sequence identity, alternatively at least about 95% nucleic acid sequence identity, alternatively at least about 96% nucleic acid sequence identity, alternatively at least about 97% nucleic acid sequence identity, alternatively at least about 98% nucleic acid sequence identity and alternatively at least about 99% nucleic acid sequence identity with a nucleic acid sequence encoding a full-length native sequence PRO polypeptide sequence as disclosed herein, a full-length native sequence PRO polypeptide sequence lacking the signal peptide as disclosed herein, an extracellular domain of a PRO polypeptide, with or without the signal sequence, as disclosed herein or any other fragment of a full-length PRO polypeptide sequence as disclosed herein. Variants do not encompass the native nucleotide sequence. [0653] Ordinarily, PRO variant polynucleotides are at least about 30 nucleotides in length, alternatively at least about 60 nucleotides in length, alternatively at least about 90 nucleotides in length, alternatively at least about 120 nucleotides in length, alternatively at least about 150 nucleotides in length, alternatively at least about 180 nucleotides in length, alternatively at least about 210 nucleotides in length, alternatively at least about 240 nucleotides in length, alternatively at least about 270 nucleotides in length, alternatively at least about 300 nucleotides in length, alternatively at least about 450 nucleotides in length, alternatively at least about 600 nucleotides in length, alternatively at least about 900 nucleotides in length, or more. [0654] “Percent (%) nucleic acid sequence identity” with respect to PRO-encoding nucleic acid sequences identified herein is defined as the percentage of nucleotides in a candidate sequence that are identical with the nucleotides in the PRO nucleic acid sequence of interest, after aligning the sequences and introducing gaps, if necessary, to achieve the maximum percent sequence identity. Alignment for purposes of determining percent nucleic acid sequence identity can be achieved in various ways that are within the skill in the art, for instance, using publicly available computer software such as BLAST, BLAST-2, ALIGN or Megalign (DNASTAR) software. For purposes herein, however, % nucleic acid sequence identity values are generated using the sequence comparison computer program ALIGN-2, wherein the complete source code for the ALIGN-2 program is provided in Table 1 below. The ALIGN-2 sequence comparison computer program was authored by Genentech, Inc. and the source code shown in Table 1 below has been filed with user documentation in the U.S. Copyright Office, Washington D.C., 20559, where it is registered under U.S. Copyright Registration No. TXU510087. The ALIGN-2 program is publicly available through Genentech, Inc., South San Francisco, Calif. or may be compiled from the source code provided in Table 1 below. The ALIGN-2 program should be compiled for use on a UNIX operating system, preferably digital UNIX V4.0D. All sequence comparison parameters are set by the ALIGN-2 program and do not vary. [0655] In situations where ALIGN-2 is employed for nucleic acid sequence comparisons, the % nucleic acid sequence identity of a given nucleic acid sequence C to, with, or against a given nucleic acid sequence D (which can alternatively be phrased as a given nucleic acid sequence C that has or comprises a certain % nucleic acid sequence identity to, with, or against a given nucleic acid sequence D) is calculated as follows: [0656] 100 times the fraction W/Z [0657] where W is the number of nucleotides scored as identical matches by the sequence alignment program ALIGN-2 in that program's alignment of C and D, and where Z is the total number of nucleotides in D. It will be appreciated that where the length of nucleic acid sequence C is not equal to the length of nucleic acid sequence D, the % nucleic acid sequence identity of C to D will not equal the % nucleic acid sequence identity of D to C. As examples of % nucleic acid sequence identity calculations, Tables 4 and 5, demonstrate how to calculate the % nucleic acid sequence identity of the nucleic acid sequence designated “Comparison DNA” to the nucleic acid sequence designated “PRO-DNA”, wherein “PRO-DNA” represents a hypothetical PRO-encoding nucleic acid sequence of interest, “Comparison DNA” represents the nucleotide sequence of a nucleic acid molecule against which the “PRO-DNA” nucleic acid molecule of interest is being compared, and “N”, “L” and “V” each represent different hypothetical nucleotides. [0658] Unless specifically stated otherwise, all % nucleic acid sequence identity values used herein are obtained as described in the immediately preceding paragraph using the ALIGN-2 computer program. However, % nucleic acid sequence identity values may also be obtained as described below by using the WU-BLAST-2 computer program (Altschul et al., Methods in Enzymology 266:460-480 (1996)). Most of the WU-BLAST-2 search parameters are set to the default values. Those not set to default values, i.e., the adjustable parameters, are set with the following values: overlap span=1, overlap fraction=0.125, word threshold (T)=11, and scoring matrix=BLOSUM62. When WU-BLAST-2 is employed, a % nucleic acid sequence identity value is determined by dividing (a) the number of matching identical nucleotides between the nucleic acid sequence of the PRO polypeptide-encoding nucleic acid molecule of interest having a sequence derived from the native sequence PRO polypeptide-encoding nucleic acid and the comparison nucleic acid molecule of interest (i.e., the sequence against which the PRO polypeptide-encoding nucleic acid molecule of interest is being compared which may be a variant PRO polynucleotide) as determined by WU-BLAST-2 by (b) the total number of nucleotides of the PRO polypeptide-encoding nucleic acid molecule of interest. For example, in the statement “an isolated nucleic acid molecule comprising a nucleic acid sequence A which has or having at least 80% nucleic acid sequence identity to the nucleic acid sequence B”, the nucleic acid sequence A is the comparison nucleic acid molecule of interest and the nucleic acid sequence B is the nucleic acid sequence of the PRO polypeptide-encoding nucleic acid molecule of interest. [0659] Percent nucleic acid sequence identity may also be determined using the sequence comparison program NCBI-BLAST2 (Altschul et al., Nucleic Acids Res. 25:3389-3402 (1997)). The NCBI-BLAST2 sequence comparison program may be downloaded from http://www.ncbi.nlm.nih.gov or otherwise obtained from the National Institute of Health, Bethesda, Md. NCBI-BLAST2 uses several search parameters, wherein all of those search parameters are set to default values including, for example, unmask=yes, strand=all, expected occurrences=10, minimum low complexity length=15/5, multi-pass e-value=0.01, constant for multi-pass=25, dropoff for final gapped alignment=25 and scoring matrix=BLOSUM62. [0660] In situations where NCBI-BLAST2 is employed for sequence comparisons, the % nucleic acid sequence identity of a given nucleic acid sequence C to, with, or against a given nucleic acid sequence D (which can alternatively be phrased as a given nucleic acid sequence C that has or comprises a certain % nucleic acid sequence identity to; with, or against a given nucleic acid sequence D) is calculated as follows: [0661] 100 times the fraction W/Z [0662] where W is the number of nucleotides scored as identical matches by the sequence alignment program NCBI-BLAST2 in that program's alignment of C and D, and where Z is the total number of nucleotides in D. It will be appreciated that where the length of nucleic acid sequence C is not equal to the length of nucleic acid sequence D, the % nucleic acid sequence identity of C to D will not equal the % nucleic acid sequence identity of D to C. [0663] In other embodiments, PRO variant polynucleotides are nucleic acid molecules that encode an active PRO polypeptide and which are capable of hybridizing, preferably under stringent hybridization and wash conditions, to nucleotide sequences encoding a full-length PRO polypeptide as disclosed herein. PRO variant polypeptides may be those that are encoded by a PRO variant polynucleotide. [0664] “Isolated,” when used to describe the various polypeptides disclosed herein, means polypeptide that has been identified and separated and/or recovered from a component of its natural environment. Contaminant components of its natural environment are materials that would typically interfere with diagnostic or therapeutic uses for the polypeptide, and may include enzymes, hormones, and other proteinaceous or non-proteinaceous solutes. In preferred embodiments, the polypeptide will be purified (1) to a degree sufficient to obtain at least 15 residues of N-terminal or internal amino acid sequence by use of a spinning cup sequenator, or (2) to homogeneity by SDS-PAGE under non-reducing or reducing conditions using Coomassie blue or, preferably, silver stain. Isolated polypeptide includes polypeptide in situ within recombinant cells, since at least one component of the PRO polypeptide natural environment will not be present. Ordinarily, however, isolated polypeptide will be prepared by at least one purification step. [0665] An “isolated” PRO polypeptide-encoding nucleic acid or other polypeptide-encoding nucleic acid is a nucleic acid molecule that is identified and separated from at least one contaminant nucleic acid molecule with which it is ordinarily associated in the natural source of the polypeptide-encoding nucleic acid. An isolated polypeptide-encoding nucleic acid molecule is other than in the form or setting in which it is found in nature. Isolated polypeptide-encoding nucleic acid molecules therefore are distinguished from the specific polypeptide-encoding nucleic acid molecule as it exists in natural cells. However, an isolated polypeptide-encoding nucleic acid molecule includes polypeptide-encoding nucleic acid molecules contained in cells that ordinarily express the polypeptide where, for example, the nucleic acid molecule is in a chromosomal location different from that of natural cells. [0666] The term “control sequences” refers to DNA sequences necessary for the expression of an operably linked coding sequence in a particular host organism. The control sequences that are suitable for prokaryotes, for example, include a promoter, optionally an operator sequence, and a ribosome binding site. Eukaryotic cells are known to utilize promoters, polyadenylation signals, and enhancers. [0667] Nucleic acid is “operably linked” when it is placed into a functional relationship with another nucleic acid sequence. For example, DNA for a presequence or secretory leader is operably linked to DNA for a polypeptide if it is expressed as a preprotein that participates in the secretion of the polypeptide; a promoter or enhancer is operably linked to a coding sequence if it affects the transcription of the sequence; or a ribosome binding site is operably linked to a coding sequence if it is positioned so as to facilitate translation. Generally, “operably linked” means that the DNA sequences being linked are contiguous, and, in the case of a secretory leader, contiguous and in reading phase. However, enhancers do not have to be contiguous. Linking is accomplished by ligation at convenient restriction sites. If such sites do not exist, the synthetic oligonucleotide adaptors or linkers are used in accordance with conventional practice. [0668] The term “antibody” is used in the broadest sense and specifically covers, for example, single anti-PRO monoclonal antibodies (including agonist, antagonist, and neutralizing antibodies), anti-PRO antibody compositions with polyepitopic specificity, single chain anti-PRO antibodies, and fragments of anti-PRO antibodies (see below). The term “monoclonal antibody” as used herein refers to an antibody obtained from a population of substantially homogeneous antibodies, i.e., the individual antibodies comprising the population are identical except for possible naturally-occurring mutations that may be present in minor amounts. [0669] “Stringency” of hybridization reactions is readily determinable by one of ordinary skill in the art, and generally is an empirical calculation dependent upon probe length, washing temperature, and salt concentration. In general, longer probes require higher temperatures for proper annealing, while shorter probes need lower temperatures. Hybridization generally depends on the ability of denatured DNA to reanneal when complementary strands are present in an environment below their melting temperature. The higher the degree of desired homology between the probe and hybridizable sequence, the higher the relative temperature which can be used. As a result, it follows that higher relative temperatures would tend to make the reaction conditions more stringent, while lower temperatures less so. For additional details and explanation of stringency of hybridization reactions, see Ausubel et al., Current Protocols in Molecular Biology, Wiley Interscience Publishers, (1995). [0670] “Stringent conditions” or “high stringency conditions”, as defined herein, may be identified by those that: (1) employ low ionic strength and high temperature for washing, for example 0.015 M sodium chloride/0.0015 M sodium citrate/0.1% sodium dodecyl sulfate at 50° C.; (2) employ during hybridization a denaturing agent, such as formamide, for example, 50% (v/v) formamide with 0.1% bovine serum albumin/0.1% Ficoll/0.1% polyvinylpyrrolidone/50 mM sodium phosphate buffer at pH 6.5 with 750 mM sodium chloride, 75 mM sodium citrate at 42° C.; or (3) employ 50% formamide, 5×SSC (0.75 M NaCl, 0.075 M sodium citrate), 50 mM sodium phosphate (pH 6.8), 0.1% sodium pyrophosphate, 5×Denhardt's solution, sonicated salmon sperm DNA (50 μg/ml), 0.1% SDS, and 10% dextran sulfate at 42° C., with washes at 42° C. in 0.2×SSC (sodium chloride/sodium citrate) and 50% formamide at 55° C., followed by a high-stringency wash consisting of 0.1×SSC containing EDTA at 55° C. [0671] “Moderately stringent conditions” may be identified as described by Sambrook et al., Molecular Cloning: A Laboratory Manual, New York: Cold Spring Harbor Press, 1989, and include the use of washing solution and hybridization conditions (e.g., temperature, ionic strength and % SDS) less stringent that those described above. An example of moderately stringent conditions is overnight incubation at 37° C. in a solution comprising: 20% formamide, 5×SSC (150 mM NaCl, 15 mM trisodium citrate), 50 mM sodium phosphate (pH 7.6), 5× Denhardt's solution, 10% dextran sulfate, and 20 mg/ml denatured sheared salmon sperm DNA, followed by washing the filters in 1×SSC at about 37-50° C. The skilled artisan will recognize how to adjust the temperature, ionic strength, etc. as necessary to accommodate factors such as probe length and the like. [0672] The term “epitope tagged” when used herein refers to a chimeric polypeptide comprising a PRO polypeptide fused to a “tag polypeptide”. The tag polypeptide has enough residues to provide an epitope against which an antibody can be made, yet is short enough such that it does not interfere with activity of the polypeptide to which it is fused. The tag polypeptide preferably also is fairly unique so that the antibody does not substantially cross-react with other epitopes. Suitable tag polypeptides generally have at least six amino acid residues and usually between about 8 and 50 amino acid residues (preferably, between about 10 and 20 amino acid residues). [0673] As used herein, the term “immunoadhesin” designates antibody-like molecules which combine the binding specificity of a heterologous protein (an “adhesin”) with the effector functions of immunoglobulin constant domains. Structurally, the immunoadhesins comprise a fusion of an amino acid sequence with the desired binding specificity which is other than the antigen recognition and binding site of an antibody (i.e., is “heterologous”), and an immunoglobulin constant domain sequence. The adhesin part of an immunoadhesin molecule typically is a contiguous amino acid sequence comprising at least the binding site of a receptor or a ligand. The immunoglobulin constant domain sequence in the immunoadhesin may be obtained from any immunoglobulin, such as IgG-1, IgG-2, IgG-3, or IgG-4 subtypes, IgA (including IgA-1 and IgA-2), IgE, IgD or IgM. [0674] “Active” or “activity” for the purposes herein refers to form(s) of a PRO polypeptide which retain a biological and/or an immunological activity of native or naturally-occurring PRO, wherein “biological” activity refers to a biological function (either inhibitory or stimulatory) caused by a native or naturally-occurring PRO other than the ability to induce the production of an antibody against an antigenic epitope possessed by a native or naturally-occurring PRO and an “immunological” activity refers to the ability to induce the production of an antibody against an antigenic epitope possessed by a native or naturally-occurring PRO. [0675] The term “antagonist” is used in the broadest sense, and includes any molecule that partially or fully blocks, inhibits, or neutralizes a biological activity of a native PRO polypeptide disclosed herein. In a similar manner, the term “agonist” is used in the broadest sense and includes any molecule that mimics a biological activity of a native PRO polypeptide disclosed herein. Suitable agonist or antagonist molecules specifically include agonist or antagonist antibodies or antibody fragments, fragments or amino acid sequence variants of native PRO polypeptides, peptides, antisense oligonucleotides, small organic molecules, etc. Methods for identifying agonists or antagonists of a PRO polypeptide may comprise contacting a PRO polypeptide with a candidate agonist or antagonist molecule and measuring a detectable change in one or more biological activities normally associated with the PRO polypeptide. [0676] “Treatment” refers to both therapeutic treatment and prophylactic or preventative measures, wherein the object is to prevent or slow down (lessen) the targeted pathologic condition or disorder. Those in need of treatment include those already with the disorder as well as those prone to have the disorder or those in whom the disorder is to be prevented. [0677] “Chronic” administration refers to administration of the agent(s) in a continuous mode as opposed to an acute mode, so as to maintain the initial therapeutic effect (activity) for an extended period of time. “Intermittent” administration is treatment that is not consecutively done without interruption, but rather is cyclic in nature. [0678] “Mammal” for purposes of treatment refers to any animal classified as a mammal, including humans, domestic and farm animals, and zoo, sports, or pet animals, such as dogs, cats, cattle, horses, sheep, pigs, goats, rabbits, etc. Preferably, the mammal is human. [0679] Administration “in combination with” one or more further therapeutic agents includes simultaneous (concurrent) and consecutive administration in any order. [0680] “Carriers” as used herein include pharmaceutically acceptable carriers, excipients, or stabilizers which are nontoxic to the cell or mammal being exposed thereto at the dosages and concentrations employed. Often the physiologically acceptable carrier is an aqueous pH buffered solution. Examples of physiologically acceptable carriers include buffers such as phosphate, citrate, and other organic acids; antioxidants including ascorbic acid; low molecular weight (less than about 10 residues) polypeptide; proteins, such as serum albumin, gelatin, or immunoglobulins; hydrophilic polymers such as polyvinylpyrrolidone; amino acids such as glycine, glutamine, asparagine, arginine or lysine; monosaccharides, disaccharides, and other carbohydrates including glucose, mannose, or dextrins; chelating agents such as EDTA; sugar alcohols such as mannitol or sorbitol; salt-forming counterions such as sodium; and/or nonionic surfactants such as TWEEN™, polyethylene glycol (PEG), and PLURONICS™. [0681] “Antibody fragments” comprise a portion of an intact antibody, preferably the antigen binding or variable region of the intact antibody. Examples of antibody fragments include Fab, Fab′, F(ab′)2, and Fv fragments; diabodies; linear antibodies (Zapata et al., Protein Eng. 8(10): 1057-1062 [1995]); single-chain antibody molecules; and multispecific antibodies formed from antibody fragments. [0682] Papain digestion of antibodies produces two identical antigen-binding fragments, called “Fab” fragments, each with a single antigen-binding site, and a residual “Fc” fragment, a designation reflecting the ability to crystallize readily. Pepsin treatment yields an F(ab′)2 fragment that has two antigen-combining sites and is still capable of cross-linking antigen. [0683] “Fv” is the minimum antibody fragment which contains a complete antigen-recognition and -binding site. This region consists of a dimer of one heavy- and one light-chain variable domain in tight, non-covalent association. It is in this configuration that the three CDRs of each variable domain interact to define an antigen-binding site on the surface of the VH-VL dimer. Collectively, the six CDRs confer antigen-binding specificity to the antibody. However, even a single variable domain (or half of an Fv comprising only three CDRs specific for an antigen) has the ability to recognize and bind antigen, although at a lower affinity than the entire binding site. [0684] The Fab fragment also contains the constant domain of the light chain and the first constant domain (CH1) of the heavy chain. Fab fragments differ from Fab′ fragments by the addition of a few residues at the carboxy terminus of the heavy chain CH1 domain including one or more cysteines from the antibody hinge region. Fab′-SH is the designation herein for Fab′ in which the cysteine residue(s) of the constant domains bear a free thiol group. F(ab′)2 antibody fragments originally were produced as pairs of Fab′ fragments which have hinge cysteines between them. Other chemical couplings of antibody fragments are also known. [0685] The “light chains” of antibodies (immunoglobulins) from any vertebrate species can be assigned to one of two clearly distinct types, called kappa and lambda, based on the amino acid sequences of their constant domains. [0686] Depending on the amino acid sequence of the constant domain of their heavy chains, immunoglobulins can be assigned to different classes. There are five major classes of immunoglobulins: IgA, IgD, IgE, IgG, and IgM, and several of these may be further divided into subclasses (isotypes), e.g., IgG1, IgG2, IgG3, IgG4, IgA, and IgA2. [0687] “Single-chain Fv” or “sFv” antibody fragments comprise the VH and VL domains of antibody, wherein these domains are present in a single polypeptide chain. Preferably, the Fv polypeptide further comprises a polypeptide linker between the VH and VL domains which enables the sFv to form the desired structure for antigen binding. For a review of sFv, see Pluckthun in The Pharmacology of Monoclonal Antibodies, vol. 113, Rosenburg and Moore eds., Springer-Verlag, New York, pp. 269-315 (1994). [0688] The term “diabodies” refers to small antibody fragments with two antigen-binding sites, which fragments comprise a heavy-chain variable domain (VH) connected to a light-chain variable domain (VL) in the same polypeptide chain (VH-VL). By using a linker that is too short to allow pairing between the two domains on the same chain, the domains are forced to pair with the complementary domains of another chain and create two antigen-binding sites. Diabodies are described more fully in, for example, EP 404,097; WO 93/11161; and Hollinger et al., Proc. Natl. Acad. Sci. USA, 90:6444-6448 (1993). [0689] An “isolated” antibody is one which has been identified and separated and/or recovered from a component of its natural environment. Contaminant components of its natural environment are materials which would interfere with diagnostic or therapeutic uses for the antibody, and may include enzymes, hormones, and other proteinaceous or nonproteinaceous solutes. In preferred embodiments, the antibody will be purified (1) to greater than 95% by weight of antibody as determined by the Lowry method, and most preferably more than 99% by weight, (2) to a degree sufficient to obtain at least 15 residues of N-terminal or internal amino acid sequence by use of a spinning cup sequenator, or (3) to homogeneity by SDS-PAGE under reducing or nonreducing conditions using Coomassie blue or, preferably, silver stain. Isolated antibody includes the antibody in situ within recombinant cells since at least one component of the antibody's natural environment will not be present. Ordinarily, however, isolated antibody will be prepared by at least one purification step. [0690] An antibody that “specifically binds to” or is “specific for” a particular polypeptide or an epitope on a particular polypeptide is one that binds to that particular polypeptide or epitope on a particular polypeptide without substantially binding to any other polypeptide or polypeptide epitope. [0691] The word “label” when used herein refers to a detectable compound or composition which is conjugated directly or indirectly to the antibody so as to generate a “labeled” antibody. The label may be detectable by itself (e.g. radioisotope labels or fluorescent labels) or, in the case of an enzymatic label, may catalyze chemical alteration of a substrate compound or composition which is detectable. [0692] By “solid phase” is meant a non-aqueous matrix to which the antibody of the present invention can adhere. Examples of solid phases encompassed herein include those formed partially or entirely of glass (e.g., controlled pore glass), polysaccharides (e.g., agarose), polyacrylamides, polystyrene, polyvinyl alcohol and silicones. In certain embodiments, depending on the context, the solid phase can comprise the well of an assay plate; in others it is a purification column (e.g., an affinity chromatography column). This term also includes a discontinuous solid phase of discrete particles, such as those described in U.S. Pat. No. 4,275,149. [0693] A “liposome” is a small vesicle composed of various types of lipids, phospholipids and/or surfactant which is useful for delivery of a drug (such as a PRO polypeptide or antibody thereto) to a mammal. The components of the liposome are commonly arranged in a bilayer formation, similar to the lipid arrangement of biological membranes. [0694] A “small molecule” is defined herein to have a molecular weight below about 500 Daltons. [0695] An “effective amount” of a polypeptide disclosed herein or an agonist or antagonist thereof is an amount sufficient to carry out a specifically stated purpose. An “effective amount” may be determined empirically and in a routine manner, in relation to the stated purpose. TABLE 1 /*  *  * C—C increased from 12 to 15  * Z is average of EQ  * B is average of ND  * match with stop is _M; stop—stop = 0; J (joker) match = 0  */ #define _M −8 /* value of a match with a stop */ int _day[26][26] = { /*  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z */ /* A */ {2, 0, −2, 0, 0, −4, 1, −1, −1, 0, −1, −2, −1, 0, _M, 1, 0, −2, 1, 1, 0, 0, −6, 0, −3, 0}, /* B */ {0, 3, −4, 3, 2, −5, 0, 1, −2, 0, 0, −3, −2, 2, _M, −1, 1, 0, 0, 0, 0, −2, −5, 0, −3, 1}, /* C */ {−2, −4, 15, −5, −5, −4, −3, −3, −2, 0, −5, −6, −5, −4, _M, −3, −5, −4, 0, −2, 0, −2, −8, 0, 0, −5}, /* D */ {0, 3, −5, 4, 3, −6, 1, 1, −2, 0, 0, −4, −3, 2, _M, −1, 2, −1, 0, 0, 0, −2, −7, 0, −4, 2}, /* E */ {0, 2, −5, 3, 4, −5, 0, 1, −2, 0, 0, −3, −2, 1, _M, −1, 2, −1, 0, 0, 0, −2, −7, 0, −4, 3}, /* F */ {−4, −5, −4, −6, −5, 9, −5, −2, 1, 0, −5, 2, 0, −4, _M, −5, −5, −4, −3, −3, 0, −1, 0, 0, 7, −5}, /* G */ {1, 0, −3, 1, 0, −5, 5, −2, −3, 0, −2, −4, −3, 0, _M, −1, −1, −3, 1, 0, 0, −1, −7, 0, −5, 0}, /* H */ {−1, 1, −3, 1, 1, −2, −2, 6, −2, 0, 0, −2, −2, 2, _M, 0, 3, 2, −1, −1, 0, −2, −3, 0, 0, 2}, /* I */ {−1, −2, −2, −2, −2, 1, −3, −2, 5, 0, −2, 2, 2, −2, _M, −2, −2, −2, −1, 0, 0, 4, −5, 0, −1, −2}, /* J */ {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, _M, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, /* K */ {−1, 0, −5, 0, 0, −5, −2, 0, −2, 0, 5, −3, 0, 1, _M, −1, 1, 3, 0, 0, 0, −2, −3, 0, −4, 0}, /* L */ {−2, −3, −6, −4, −3, 2, −4, −2, 2, 0, −3, 6, 4, −3, _M, −3, −2, −3, −3 , −1, 0, 2, −2, 0, −1, −2} /* M */ {−1, −2, −5, −3, −2, 0, −3, −2, 2, 0, 0, 4, 6, −2, _M, −2, −1, 0, −2, −1, 0, 2, −4, 0, −2, −1}, /* N */ {0, 2, −4, 2, 1, −4, 0, 2, −2, 0, 1, −3, −2, 2, _M, −1, 1, 0, 1, 0, 0, −2, −4, 0, −2, 1}, /* O */ {_M,_M,_M,_M,_M,_M,_M,_M,_M,_M,_M,_M,_M,_M, 0,_M,_M,_M,_M,_M,_M,_M,_M,_M,_M,_M,}, /* P */ {1, −1, −3, −1, −1, −5, −1, 0, −2, 0, −1, −3, −2, −1,_M, 6, 0, 0, 1, 0, 0, −1, −6, 0, −5, 0}, /* Q */ {0, 1, −5, 2, 2, −5, −1, 3, −2, 0, 1, −2, −1, 1, _M, 0, 4, 1, −1, −1, 0, −2, −5, 0, −4, 3}, /* R */ {−2, 0, −4, −1, −1, −4, −3, 2, −2, 0, 3, −3, 0, 0, _M, 0, 1, 6, 0, −1, 0, −2, 2, 0, −4, 0}, /* S */ {1, 0, 0, 0, 0, −3, 1, −1, −1, 0, 0, −3, −2, 1, _M, 1, −1, 0, 2, 1, 0, −1, −2, 0, −3, 0}, /* T */ {1, 0, −2, 0, 0, −3, 0, −1, 0, 0, 0, −1, −1, 0, _M, 0, −1, −1, 1, 3, 0, 0, −5, 0, −3, 0}, /* U */ {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,_M, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, /* V */ {0, −2, −2, −2, −2, −1, −1, −2, 4, 0, −2, 2, 2, −2,_M, −1, −2, −2, −1, 0, 0, 4, −6, 0, −2, −2}, /* W */ {−6, −5, −8, −7, −7, 0, −7, −3, −5, 0, −3, −2, −4, −4,_M, −6, −5, 2, −2, −5, 0, −6, 17, 0, 0, −6}, /* X */ {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, _M, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, /* Y */ {−3, −3, 0, −4, −4, 7, −5, 0, −1, 0, −4, −1, −2, −2, _M, −5, −4, −4, −3, −3, 0, −2, 0, 0, 10, −4}, /* Z */ {0, 1, −5, 2, 3, −5, 0, 2, −2, 0, 0, −2, −1, 1,_M, 0, 3, 0, 0, 0, 0, −2, −6, 0, −4, 4}, }; /*  */ #include <stdio.h> #include <ctype.h> #define MAXJMP  16 /* max jumps in a diag */ #define MAXGAP  24 /* don't continue to penalize gaps larger than this */ #define JMPS 1024 /* max jmps in an path */ #define MX   4 /* save if there's at least MX-1 bases since last jmp */ #define DMAT   3 /* value of matching bases */ #define DMIS   0 /* penalty for mismatched bases */ #define DINS0   8 /* penalty for a gap */ #define DINS1   1 /* penalty per base */ #define PINS0   8 /* penalty for a gap */ #define PINS1   4 /* penalty per residue */ struct jmp { short n[MAXJMP]; /* size of jmp (neg for dely) */ unsigned short x[MAXJMP]; /* base no. of jmp in seq x */ /* limits seq to 2{circumflex over ( )}16 −1 */ }; struct diag { int score; /* score at last jmp */ long offset; /* offset of prev block */ short ijmp; /* current jmp index */ struct jmp jp; /* list of jmps */ }; struct path { int spc; /* number of leading spaces */ short n[JMPS]; /* size of jmp (gap) */ int x[JMPS]; /* loc of jmp (last elem before gap) */ }; char *ofile; /* output file name */ char *namex[2]; /* seq names: getseqs() */ char *prog; /* prog name for err msgs */ char *seqx[2]; /* seqs: getseqs() */ int dmax; /* best diag: nw() */ int dmax0; /* final diag */ int dna; /* set if dna: main() */ int endgaps; /* set if penalizing end gaps */ int gapx, gapy; /* total gaps in seqs */ int len0, len1; /* seq lens */ int ngapx, ngapy; /* total size of gaps */ int smax; /* max score: nw() */ int *xbm; /* bitmap for matching */ long offset; /* current offset in jmp file */ struct diag *dx; /* holds diagonals */ struct path pp[2]; /* holds path for seqs */ char *calloc(), *malloc(), *index(), *strcpy(); char *getseq(), *g_calloc(); /* Needleman-Wunsch alignment program  *  * usage: progs file1 file2  *  where file1 and file2 are two dna or two protein sequences.  *  The sequences can be in upper- or lower-case an may contain ambiguity  *  Any lines beginning with ‘;’, ‘>’ or ‘<’ are ignored  *  Max file length is 65535 (limited by unsigned short x in the jmp struct)  *  A sequence with ⅓ or more of its elements ACGTU is assumed to be DNA  *  Output is in the file “align.out”  *  * The program may create a tmp file in /tmp to hold info about traceback.  * Original version developed under BSD 4.3 on a vax 8650  */ #include “nw.h” #include “day.h” static _dbval[26] = { 1,14,2,13,0,0,4,11,0,0,12,0,3,15,0,0,0,5,6,8,8,7,9,0,10,0 }; static _pbval[26] = { 1, 2|(1<<(‘D’-‘A’))|(1<<(‘N’-‘A’)), 4, 8, 16, 32, 64, 128, 256, 0×FFFFFFF, 1<<10, 1<<11, 1<<12, 1<<13, 1<<14, 1<<15, 1<<16, 1< <17, 1<<18, 1<<19, 1<<20, 1<<21, 1<<22, 1<<23, 1<<24, 1<<25|(1<<(‘E’-‘A’))|(1<<(‘Q’-‘A’)) }; main(ac, av) main int ac; char *av[]; { prog = av[0]; if(ac != 3) { fprintf(stderr, “usage: %s file1 file2\n”, prog); fprintf(stderr, “where file1 and file2 are two dna or two protein sequences.\n”); fprintf(stderr, “The sequences can be in upper- or lower-case\n”); fprintf(stderr, “Any lines beginning with ‘;’ or ‘<’ are ignored\n”); fprintf(stderr, “Output is in the file \“align.out\”\n”); exit(1); } namex[0] = av[1]; namex[1] = av[2]; seqx[0] = getseq(namex[0], &len0); seqx[1] = getseq(namex[1], &len1); xbm = (dna)? _dbval : _pbval; endgaps = 0; /* 1 to penalize endgaps */ ofile = “align.out”; /* output file */ nw(); /* fill in the matrix, get the possible jmps */ readjmps(); /* get the actual jmps */ print(); /* print stats, alignment */ cleanup(0); /* unlink any tmp files */ } /* do the alignment, return best score: main()  * dna: values in Fitch and Smith, PNAS, 80, 1382-1386, 1983  * pro: PAM 250 values  * When scores are equal, we prefer mismatches to any gap, prefer  * a new gap to extending an ongoing gap, and prefer a gap in seqx  * to a gap in seq y.  */ nw() nw { char *px, *py; /* seqs and ptrs */ int *ndely, *dely; /* keep track of dely */ int ndelx, delx; /* keep track of delx */ int *tmp; /* for swapping row0, row1 */ int mis; /* score for each type */ int ins0, ins1; /* insertion penalties */ register id; /* diagonal index */ register ij; /* jmp index */ register *col0, *col1; /* score for curr, last row */ register xx, yy; /* index into seqs */ dx = (struct diag *)g_calloc(“to get diags”, len0+len1+1, sizeof(struct diag)); ndely = (int *)g_calloc(“to get ndely”, len1+1, sizeof(int)); dely = (int *)g_calloc(“to get dely”, len1+1, sizeof(int)); col0 = (int *)g_calloc(“to get col0”, len1+1, sizeof(int)); col1 = (int *)g_calloc(“to get col1”, len1+1, sizeof(int)); ins0 = (dna)? DINS0 : PINS0; ins1 = (dna)? DINS1 : PlNS1; smax = −10000; if (endgaps) { for (col0[0] = dely[0] = −ins0, yy = 1; yy <= len1; yy++) { col0[yy] = dely[yy] = col0[yy−1] − ins1; ndely[yy] = yy; } col0[0] = 0; /* Waterman Bull Math Biol 84 */ } else for (yy = 1; yy <= len1; yy++) dely[yy] = −ins0; /* fill in match matrix  */ for (px = seqx[0], xx = 1; xx <= len0; px++, xx++) { /* initialize first entry in col  */ if (endgaps) { if (xx == 1) col1[0] = delx = −(ins0+ins1); else col1[0] = delx = col0[0]−ins1; ndelx = xx; } else { col1[0] = 0; delx = −ins0; ndelx = 0; } ...nw for (py = seqx[1], yy = 1; yy <= len1; py++, yy++) { mis = col0[yy−1]; if (dna) mis += (xbm[*px−‘A’]&xbm[*py−‘A’])? DMAT : DMIS; else mis += _day[*px−‘A’][*py−‘A’]; /* update penalty for del in x seq;  * favor new del over ongong del  * ignore MAXGAP if weighting endgaps  */ if (endgaps || ndely[yy] < MAXGAP) { if (col0[yy] − ins0 >= dely[yy]) { dely[yy] = col0[yy] − (ins0+ins1); ndely[yy] = 1; } else { dely[yy] −= ins1; ndely[yy]++; } } else { if (col0[yy] − (ins0+ins1) >= dely[yy]) { dely[yy] = col0[yy] − (ins0+ins1); ndely[yy] = 1; } else ndely[yy]++; } /* update penalty for del in y seq;  * favor new del over ongong del  */ if (endgaps || ndelx < MAXGAP) { if(col1[yy−1] − ins0 >= delx) { delx = col1[yy−1] − (ins0+ins1); ndelx = 1; } else { delx −= ins1; ndelx++; } } else { if (col1[yy−1] − (ins0+ins1) >= delx) { delx = col1[yy−1] − (ins0+ins1); ndelx = 1; } else ndelx++; } /* pick the maximum score; we're favoring  * mis over any del and delx over dely  */ ...nw id = xx − yy + len1 − 1; if (mis >= delx && mis >= dely[yy]) col1[yy] = mis; else if (delx >= dely[yy]) { col1[yy] = delx; ij = dx[id].ijmp; if (dx[id].jp.n[0] && (!dna || (ndelx >= MAXJMP && xx > dx[id].jp.x[ij]+MX) || mis > dx[id].score+DINS0)) { dx[id].ijmp++; if (++ij >= MAXJMP) { writejmps(id); ij = dx[id].ijmp = 0; dx[id].offset = offset; offset += sizeof(struct jmp) + sizeof(offset); } } dx[id].jp.n[ij] = ndelx; dx[id].jp.x[ij] = xx; dx[id].score = delx; } else { col1[yy] = dely[yy]; ij = dx[id].ijmp; if (dx[id].jp.n[0] && (!dna || (ndely[yy] >= MAXJMP && xx > dx[id].jp.x[ij]+MX) || mis > dx[id].score+DINS0)) { dx[id].ijmp++; if (++ij >= MAXJMP) { writejmps(id); ij = dx[id].ijmp = 0; dx[id].offset = offset; offset += sizeof(struct jmp) + sizeof(offset); } } dx[id].jp.n[ij] =− ndely[yy]; dx[id].jp.x[ij] = xx; dx[id].score = dely[yy]; } if (xx == len0 && yy < len1) { /* last col  */ if (endgaps) col1[yy] −= ins0+ins1*(len1−yy); if(col1[yy] > smax) { smax = col1[yy]; dmax = id; } } } if (endgaps && xx < len0) col1[yy−1] −= ins0+ins1*(len0−xx); if (col1[yy−1] > smax) { smax = col1[yy−1]; dmax = id; } tmp = col0; col0 = col1; col1 = tmp; } (void) free((char *)ndely); (void) free((char *)dely); (void) free((char *)col0); (void) free((char *)col1); } /*  *  * print() -- only routine visible outside this module  *  * static:  * getmat() -- trace back best path, count matches: print()  * pr_align() -- print alignment of described in array p[]: print()  * dumpblock() -- dump a block of lines with numbers, stars: pr_align()  * nums() -- put out a number line: dumpblock()  * putline() -- put out a line (name, [num], seq, [num]): dumpblock()  * stars() - -put a line of stars: dumpblock()  * stripname() -- strip any path and prefix from a seqname  */ #include “nw.h” #define SPC  3 #define P_LINE 256 /* maximum output line */ #define P_SPC  3 /* space between name or num and seq */ extern _day[26][26]; int olen; /* set output line length */ FILE *fx; /* output file */ print() print { int lx, ly, firstgap, lastgap;  /* overlap */ if ((fx = fopen(ofile, “w”)) == 0) { fprintf(stderr, “%s: can't write %s\n”, prog, ofile); cleanup(1); } fprintf(fx, “<first sequence: %s (length = %d)\n”, namex[0], len0); fprintf(fx, “<second sequence: %s (length = %d)\n”, namex[1], len1); olen = 60; lx = len0; ly = len1; firstgap = lastgap = 0; if (dmax < len1 − 1) { /* leading gap in x */ pp[0].spc = firstgap = len1 − dmax − 1; ly −= pp[0].spc; } else if (dmax > len1 − 1) { /* leading gap in y */ pp[1].spc = firstgap = dmax − (len1 − 1); lx −= pp[1].spc; } if (dmax0 < len0 − 1) { /* trailing gap in x */ lastgap = len0 − dmax0 −1; lx −= lastgap; } else if (dmax0 > len0 − 1) { /* trailing gap in y */ lastgap = dmax0 − (len0 − 1); ly −= lastgap; } getmat(lx, ly, firstgap, lastgap); pr_align(); } /*  * trace back the best path, count matches  */ static getmat(lx, ly, firstgap, lastgap) getmat int lx, ly; /* “core” (minus endgaps) */ int firstgap, lastgap; /* leading trailing overlap */ { int nm, i0, i1, siz0, siz1; char outx[32]; double pct; register n0, n1; register char *p0, *p1; /* get total matches, score  */ i0 = i1 = siz0 = siz1 = 0; p0 = seqx[0] + pp[1].spc; p1 = seqx[1] + pp[0].spc; n0 = pp[1].spc + 1; n1 = pp[0].spc + 1; nm = 0; while ( *p0 && *p1 ) { if (siz0) { p1++; n1++; siz0−−; } else if (siz1) { p0++; n0++; siz1−−; } else { if (xbm[*p0−‘A’]&xbm[*p1−‘A’]) nm++; if (n0++ == pp[0].x[i0]) siz0 = pp[0].n[i0++]; if (nl++ == pp[1].x[i1]) siz1 = pp[1].n[il++]; p0++; p1++; } } /* pct homology:  * if penalizing endgaps, base is the shorter seq  * else, knock off overhangs and take shorter core  */ if (endgaps) lx = (len0 < len1)? len0 : len1; else lx = (lx < ly)? lx : ly; pct = 100.*(double)nm/(double)lx; fprintf(fx, “\n”); fprintf(fx, “<%d match%s in an overlap of %d: %.2f percent similarity\n”, nm, (nm == 1)? “” : “es”, lx, pct); fprintf(fx, “<gaps in first sequence: %d”, gapx); ...getmat if (gapx) { (void) sprintf(outx, “(%d %s%s)”, ngapx, (dna)? “base”: “residue”, (ngapx == 1)? “”:“s”); fprintf(fx, “%s”, outx); fprintf(fx, “, gaps in second sequence: %d”, gapy); if (gapy) { (void) sprintf(outx, “(%d %s%s)”, ngapy, (dna)? “base”:“residue”, (ngapy == 1)? “”:“s”); fprintf(fx, “%s”, outx); } if (dna) fprintf(fx, “\n<score: %d (match = %d, mismatch = %d, gap penalty = %d + %d per base)\n”, smax, DMAT, DMIS, DINS0, DINS1); else fprintf(fx, “\n<score: %d (Dayhoff PAM 250 matrix, gap penalty = %d + %d per residue)\n”, smax, PINS0, PINS1); if (endgaps) fprintf(fx, “<endgaps penalized. left endgap: %d %s%s, right endgap: %d %s%s\n”, firstgap, (dna)? “base” : “residue”, (firstgap == 1)? “” : “s”, lastgap, (dna)? “base” : “residue”, (lastgap == 1)? “” : “s”); else fprintf(fx, “<endgaps not penalized\n”); } static nm; /* matches in core -- for checking */ static lmax; /* lengths of stripped file names */ static ij[2]; /* jmp index for a path */ static nc[2]; /* number at start of current line */ static ni[2]; /* current elem number -- for gapping */ static siz[2]; static char *ps[2]; /* ptr to current element */ static char *po[2]; /* ptr to next output char slot */ static char out[2][P_LINE]; /* output line */ static char star[P_LINE]; /* set by stars() */ /*  * print alignment of described in struct path pp[]  */ static pr_align() pr_align { int nn; /* char count */ int more; register i; for (i = 0, lmax = 0; i < 2;i++) { nn = stripname(namex[i]); if (nn > lmax) lmax = nn; nc[i] = 1; ni[i] = 1; siz[i] = ij[i] = 0; ps[i] = seqx[i]; po[i] = out[i]; } for (nn = nm = 0, more = 1; more;) { ...pr_align for (i = more = 0; i < 2; i++) { /*  * do we have more of this sequence?  */ if (!*ps[i]) continue; more++; if (pp[i].spc) { /* leading space */ *po[i]++ = ‘ ’; pp[i].spc−−; } else if (siz[i]) { /* in a gap */ *po[i]++ = ‘−’; siz[i]−−; } else { /* we're putting a seq element */ *po[i] = *ps[i]; if (islower(*ps[i]))    *ps[i] = toupper(*ps[i]); po[i]++; ps[i]++; /*  * are we at next gap for this seq?  */ if (ni[i] == pp[i].x[ij[i]]) { /*  * we need to merge all gaps  * at this location  */ siz[i] == pp[i].n[ij[i]++]; while (ni[i] == pp[i].x[ij[i]]) siz[i] += pp[i].n[ij[i]++]; } ni[i]++; } } if (++nn == olen || !more && nn) { dumpblock(); for (i = 0; i < 2; i++) po[i] = out[i]; nn = 0; } } } /*  * dump a block of lines, including numbers, stars: pr_align()  */ static dumpblock() dumpblock { register i; for(i = 0; i < 2; i++) *po[i]−− = ‘\0’; ...dumpblock (void) putc(‘\n’, fx); for (i = 0; i < 2; i++) { if (*out[i] && (*out[i] != ‘ ’ || *(po[i]) != ‘ ’)) { if (i == 0) nums(i); if (i == 0 && *out[1]) stars(); putline(i); if (i == 0 && *out[1]) fprintf(fx, star); if (i == 1) nums(i); } } } /* * put out a number line: dumpblock()  */ static nums(ix) nums int  ix; /* index in out[] holding seq line */ { char nline[P_LINE]; register i, j; register char *pn, *px, *py; for(pn = nline, i = 0; i < lmax+P_SPC; i++, pn++) *pn = ‘ ’; for (i = nc[ix], py = out[ix]; *py; py++, pn++) { if (*py == ‘ ’ || *py == ‘−’) *pn = ‘ ’; else { if (i%10 == 0 || (i == 1 && nc[ix] != 1)) { j = (i < 0)? −i : i; for (px = pn; j; j/= 10, px−−) *px = j%10 + ‘0’; if (i < 0) *px = ‘−’; } else *pn = ‘ ’; i++; } } *pn = ‘\0’; nc[ix] = i; for (pn = nline; *pn; pn++) (void) putc(*pn, fx); (void) putc(‘\n’, fx); } /*  * put out a line (name, [num], seq. [num]): dumpblock()  */ static putline(ix) putline int   ix; { ...putline int i; register char *px; for (px = namex[ix], i = 0; *px && *px != ‘:’; px++, i++) (void) putc(*px, fx); for (;i < lmax+P_SPC; i++) (void) putc(‘ ’, fx); /* these count from 1:  * ni[] is current element (from 1)  * nc[] is number at start of current line  */ for (px = out[ix]; *px; px++) (void) putc(*px&0x7F, fx); (void) putc(‘\n’, fx); } /*  * put a line of stars (seqs always in out[0], out[1]): dumpblock()  */ static stars() stars { int i; register char *p0, *p1, cx, *px; if (!*out[0] || (*out[0] == ‘ ’ && *(p0[0]) == ‘ ’) || !*out[1] || (*out[1] == ‘ ’ && *(po[1]) == ‘ ’)) return; px = star; for (i = lmax+P_SPC; i; i−−) *px++ = ‘ ’; for (p0 = out[0], p1 = out[1]; *p0 && *p1; p0++, p1++) { if (isalpha(*p0) && isalpha(*p1)) { if (xbm[*p0−‘A’]&xbm[*p1−‘A’]) { cx = ‘*’; nm++; } else if (!dna && _day[*p0− ‘A’][*p1−‘A’] > 0) cx = ‘.’; else cx = ‘ ’; } else cx = ‘ ’; *px++ = cx; } *px++ = ‘\n’; *px = ‘\0’; } /*  * strip path or prefix from pn, return len: pr_align()  */ static stripname(pn) stripname char *pn; /* file name (may be path) */ { register char *px, *py; py = 0; for (px = pn; *px; px++) if (*px == ‘/’) py = px + 1; if (py) (void) strcpy(pn, py); return(strlen(pn)); } /*  * cleanup() -- cleanup any tmp file  * getseq() -- read in seq, set dna, len, maxlen  * g_calloc() -- calloc() with error checkin  * readjmps() -- get the good jmps, from tmp file if necessary  * writejmps() -- write a filled array of jmps to a tmp file: nw()  */ #include “nw.h” #include <sys/file.h> char *jname = “/tmp/homgXXXXXX”; /* tmp file for jmps */ FILE *fj; int cleanup(); /* cleanup tmp file */ long lseek(); /*  * remove any tmp file if we blow  */ cleanup(i) cleanup int i; { if (fj) (void) unlink(jname); exit(i); } /*  * read, return ptr to seq, set dna, len, maxlen  * skip lines starting with ‘;’, ‘<’, or ‘>’  * seq in upper or lower case  */ char * getseq(file, len) getseq char *file; /* file name */ int *len; /* seq len */ { char line[1024], *pseq; register char *px, *py; int natgc, tlen; FILE *fp; if ((fp = fopen(file, “r”)) == 0) { fprintf(stderr, “%s: can't read %s\n”, prog, file); exit(1); } tlen = natgc = 0; while (fgets(line, 1024, fp)) { if (*line == ‘;’ || *line == ‘<’ || *line == ‘>’) continue; for (px = line; *px != ‘\n’; px++) if (isupper(*px) || islower(*px)) tlen++; } if ((pseq = malloc((unsigned)(tlen+6))) == 0) { fprintf(stderr, “%s: malloc() failed to get %d bytes for %s\n”, prog, tlen+6, file); exit(1); } pseq[0] = pseq[1] = pseq[2] = pseq[3] = ‘\0’; ...getseq py = pseq + 4; *len = tlen; rewind(fp); while (fgets(line, 1024, fp)) { if (*line == ‘;’ || *line == ‘<’ || *line == ‘>’) continue; for (px = line; *px != ‘\n’; px++) { if (isupper(*px)) *py++ = *px; else if (islower(*px)) *py++ = toupper(*px); if (index(“ATGCU”, *(py−1))) natgc++; } } *py++ = ‘\0’; *py = ‘\0’; (void) fclose(fp); dna = natgc > (tlen/3); return(pseq+4); } char * g_calloc(msg, nx, sz) g_calloc char *msg; /* program, calling routine */ int nx, sz; /* number and size of elements */ { char *px, *calloc(); if ((px = calloc((unsigned)nx, (unsigned)sz)) == 0) { if (*msg) { fprintf(stderr, “%s: g_calloc() failed %s (n= %d, sz= %d)\n”, prog, msg, nx, sz); exit(1); } } return(px); } /*  * get final jmps from dx[] or tmp file, set pp[], reset dmax: main()  */ readjmps() readjmps { int fd = −1; int siz, i0, i1; register i, j, xx; if (fj) { (void) fclose(fj); if ((fd = open(jname, O_RDONLY, 0)) < 0) { fprintf(stderr, “%s: can't open() %s\n”, prog, jname); cleanup(1); } } for (i = i0 = i1 = 0, dmax0 = dmax, xx = len0; ;i++) { while (1) { for (j = dx[dmax].ijmp; j >= 0 && dx[dmax].jp.x[j] >= xx; j−−) ; ...readjmps if (j < 0 && dx[dmax].offset && fj) { (void) lseek(fd, dx[dmax].offset, 0); (void) read(fd, (char *)&dx[dmax].jp, sizeof(struct jmp)); (void) read(fd, (char *)&dx[dmax].offset, sizeof(dx[dmax].offset)); dx[dmax].ijmp = MAXJMP−1; } else break; } if (i >= JMPS) { fprintf(stderr, “%s: too many gaps in alignment\n”, prog); cleanup(1); } if (j >= 0) { siz = dx[dmax].jp.n[j]; xx = dx[dmax].jp.x[j]; dmax += siz; if (siz < 0) { /* gap in second seq */ pp[1].n[il] = −siz; xx += siz; /* id = xx − yy + len1 − 1  */ pp[1].x[il] = xx − dmax + len1 − 1; gapy++; ngapy −= siz; /* ignore MAXGAP when doing endgaps */ siz = (−siz < MAXGAP || endgaps)? −siz : MAXGAP; il++; } else if (siz > 0) { /* gap in first seq */ pp[0] .n[i0] = siz; pp[0] .x[i0] = xx; gapx++; ngapx += siz; /* ignore MAXGAP when doing endgaps */ siz = (siz < MAXGAP || endgaps)? siz : MAXGAP; i0++; } } else break; } /* reverse the order of jmps  */ for (j = 0, i0−−; j < i0; j++, i0−−) { i = pp[0].n[j]; pp[0].n[j] = pp[0].n[i0]; pp[0].n[i0] = i; i = pp[0].x[j]; pp[0].x[j] = pp[0].x[i0]; pp[0].x[i0] = i; } for (j = 0, i1−−; j < i1; j++, i1−−) { i = pp[1].n[j]; pp[1].n[j] = pp[1].n[i1]; pp[1].n[i1] = i; i = pp[1].x[j]; pp[1].x[j] = pp[1].x[i1]; pp[1].x[i1] = i; } if (fd >= 0) (void) close(fd); if (fj) { (void) unlink(jname); fj = 0; offset = 0; } } /*  * write a filled jmp struct offset of the prev one (if any): nw()  */ writejmps(ix) writejmps int ix; { char *mktemp(); if (!fj) { if (mktemp(jname) < 0) { fprintf(stderr, “%s: can't mktemp() %s\n”, prog, jname); cleanup(1); } if ((fj = fopen(jname, “w”)) == 0) { fprintf(stderr, “%s: can't write %s\n”, prog, jname); exit(1); } } (void) fwrite((char *)&dx[ix].jp, sizeof(struct jmp), 1, fj); (void) fwrite((char *)&dx[ix].offset, sizeof(dx[ix].offset), 1, fj); } [0696] TABLE 2 PRO XXXXXXXXXXXXXXX (Length = 15 amino acids) Comparison XXXXXYYYYYYY (Length = 12 amino acids) Protein [0697] TABLE 3 PRO XXXXXXXXXX (Length = 10 amino acids) Comparison XXXXXYYYYYYZZYZ (Length = 15 amino acids) Protein [0698] TABLE 4 PRO-DNA NNNNNNNNNNNNNN (Length = 14 nucleotides) Comparison NNNNNNLLLLLLLLLL (Length = 16 nucleotides) DNA [0699] TABLE 5 PRO-DNA NNNNNNNNNNNN (Length = 12 nucleotides) Comparison NNNNLLLVV (Length = 9 nucleotides) DNA [0700] II. Compositions and Methods of the Invention [0701] A. Full-Length PRO Polypeptides [0702] The present invention provides newly identified and isolated nucleotide sequences encoding polypeptides referred to in the present application as PRO polypeptides. In particular, cDNAs encoding various PRO polypeptides have been identified and isolated, as disclosed in further detail in the Examples below. It is noted that proteins produced in separate expression rounds may be given different PRO numbers but the UNQ number is unique for any given DNA and the encoded protein, and will not be changed. However, for sake of simplicity, in the present specification the protein encoded by the full length native nucleic acid molecules disclosed herein as well as all further native homologues and variants included in the foregoing definition of PRO, will be referred to as “PRO/number”, regardless of their origin or mode of preparation. [0703] As disclosed in the Examples below, various cDNA clones have been deposited with the ATCC. The actual nucleotide sequences of those clones can readily be determined by the skilled artisan by sequencing of the deposited clone using routine methods in the art. The predicted amino acid sequence can be determined from the nucleotide sequence using routine skill. For the PRO polypeptides and encoding nucleic acids described herein, Applicants have identified what is believed to be the reading frame best identifiable with the sequence information available at the time. [0704] B. PRO Polypeptide Variants [0705] In addition to the full-length native sequence PRO polypeptides described herein, it is contemplated that PRO variants can be prepared. PRO variants can be prepared by introducing appropriate nucleotide changes into the PRO DNA, and/or by synthesis of the desired PRO polypeptide. Those skilled in the art will appreciate that amino acid changes may alter post-translational processes of the PRO, such as changing the number or position of glycosylation sites or altering the membrane anchoring characteristics. [0706] Variations in the native full-length sequence PRO or in various domains of the PRO described herein, can be made, for example, using any of the techniques and guidelines for conservative and non-conservative mutations set forth, for instance, in U.S. Pat. No. 5,364,934. Variations may be a substitution, deletion or insertion of one or more codons encoding the PRO that results in a change in the amino acid sequence of the PRO as compared with the native sequence PRO. Optionally the variation is by substitution of at least one amino acid with any other amino acid in one or more of the domains of the PRO. Guidance in determining which amino acid residue may be inserted, substituted or deleted without adversely affecting the desired activity may be found by comparing the sequence of the PRO with that of homologous known protein molecules and minimizing the number of amino acid sequence changes made in regions of high homology. Amino acid substitutions can be the result of replacing one amino acid with another amino acid having similar structural and/or chemical properties, such as the replacement of a leucine with a serine, i.e., conservative amino acid replacements. Insertions or deletions may optionally be in the range of about 1 to 5 amino acids. The variation allowed may be determined by systematically making insertions, deletions or substitutions of amino acids in the sequence and testing the resulting variants for activity exhibited by the full-length or mature native sequence. [0707] PRO polypeptide fragments are provided herein. Such fragments may be truncated at the N-terminus or C-terminus, or may lack internal residues, for example, when compared with a full length native protein. Certain fragments lack amino acid residues that are not essential for a desired biological activity of the PRO polypeptide. [0708] PRO fragments may be prepared by any of a number of conventional techniques. Desired peptide fragments may be chemically synthesized. An alternative approach involves generating PRO fragments by enzymatic digestion, e.g., by treating the protein with an enzyme known to cleave proteins at sites defined by particular amino acid residues, or by digesting the DNA with suitable restriction enzymes and isolating the desired fragment. Yet another suitable technique involves isolating and amplifying a DNA fragment encoding a desired polypeptide fragment, by polymerase chain reaction (PCR). Oligonucleotides that define the desired termini of the DNA fragment are employed at the 5′ and 3′ primers in the PCR. Preferably, PRO polypeptide fragments share at least one biological and/or immunological activity with the native PRO polypeptide disclosed herein. [0709] In particular embodiments, conservative substitutions of interest are shown in Table 6 under the heading of preferred substitutions. If such substitutions result in a change in biological activity, then more substantial changes, denominated exemplary substitutions in Table 6, or as further described below in reference to amino acid classes, are introduced and the products screened. TABLE 6 Original Exemplary Preferred Residue Substitutions Substitutions Ala (A) val; leu; ile val Arg (R) lys; gln; asn lys Asn (N) gln; his; lys; arg gln Asp (D) glu glu Cys (C) ser ser Gln (Q) asn asn Glu (E) asp asp Gly (G) pro; ala ala His (H) asn; gln; lys; arg arg Ile (I) leu; val; met; ala; phe; leu norleucine Leu (L) norleucine; ile; val; ile met; ala; phe Lys (K) arg; gln; asn arg Met (M) leu; phe; ile leu Phe (F) leu; val; ile; ala; tyr leu Pro (P) ala ala Ser (S) thr thr Thr (T) ser ser Trp (W) tyr; phe tyr Tyr (Y) trp; phe; thr; ser phe Val (V) ile; leu; met; phe; leu ala; norleucine [0710] Substantial modifications in function or immunological identity of the PRO polypeptide are accomplished by selecting substitutions that differ significantly in their effect on maintaining (a) the structure of the polypeptide backbone in the area of the substitution, for example, as a sheet or helical conformation, (b) the charge or hydrophobicity of the molecule at the target site, or (c) the bulk of the side chain. Naturally occurring residues are divided into groups based on common side-chain properties: [0711] (1) hydrophobic: norleucine, met, ala, val, leu, ile; [0712] (2) neutral hydrophilic: cys, ser, thr; [0713] (3) acidic: asp, glu; [0714] (4) basic: asn, gln, his, lys, arg; [0715] (5) residues that influence chain orientation: gly, pro; and [0716] (6) aromatic: trp, tyr, phe. [0717] Non-conservative substitutions will entail exchanging a member of one of these classes for another class. Such substituted residues also may be introduced into the conservative substitution sites or, more preferably, into the remaining (non-conserved) sites. [0718] The variations can be made using methods known in the art such as oligonucleotide-mediated (site-directed) mutagenesis, alanine scanning, and PCR mutagenesis. Site-directed mutagenesis [Carter et al., Nucl. Acids Res., 13:4331 (1986); Zoller et al., Nucl. Acids Res., 10:6487 (1987)], cassette mutagenesis [Wells et al., Gene, 34:315 (1985)], restriction selection mutagenesis [Wells et al., Philos. Trans. R. Soc. London SerA, 317:415 (1986)] or other known techniques can be performed on the cloned DNA to produce the PRO variant DNA. [0719] Scanning amino acid analysis can also be employed to identify one or more amino acids along a contiguous sequence. Among the preferred scanning amino acids are relatively small, neutral amino acids. Such amino acids include alanine, glycine, serine, and cysteine. Alanine is typically a preferred scanning amino acid among this group because it eliminates the side-chain beyond the beta-carbon and is less likely to alter the main-chain conformation of the variant [Cunningham and Wells, Science, 244:1081-1085 (1989)]. Alanine is also typically preferred because it is the most common amino acid. Further, it is frequently found in both buried and exposed positions [Creighton, The Proteins, (W. H. Freeman & Co., N.Y.); Chothia, J. Mol. Biol., 150:1 (1976)]. If alanine substitution does not yield adequate amounts of variant, an isoteric amino acid can be used. [0720] C. Modifications of PRO [0721] Covalent modifications of PRO are included within the scope of this invention. One type of covalent modification includes reacting targeted amino acid residues of a PRO polypeptide with an organic derivatizing agent that is capable of reacting with selected side chains or the N- or C-terminal residues of the PRO. Derivatization with bifunctional agents is useful, for instance, for crosslinking PRO to a water-insoluble support matrix or surface for use in the method for purifying anti-PRO antibodies, and vice-versa. Commonly used crosslinking agents include, e.g., 1,1-bis(diazoacetyl)-2-phenylethane, glutaraldehyde, N-hydroxysuccinimide esters, for example, esters with 4-azidosalicylic acid, homobifunctional imidoesters, including disuccinimidyl esters such as 3,3′-dithiobis(succinimidylpropionate), bifunctional maleimides such as bis-N-maleimido-1,8-octane and agents such as methyl-3-[(p-azidophenyl)dithio]propioimidate. [0722] Other modifications include deamidation of glutaminyl and asparaginyl residues to the corresponding glutamyl and aspartyl residues, respectively, hydroxylation of proline and lysine, phosphorylation of hydroxyl groups of seryl or threonyl residues, methylation of the α-amino groups of lysine, arginine, and histidine side chains [T. E. Creighton, Proteins: Structure and Molecular Properties, W. H. Freeman & Co., San Francisco, pp. 79-86 (1983)], acetylation of the N-terminal amine, and amidation of any C-terminal carboxyl group. [0723] Another type of covalent modification of the PRO polypeptide included within the scope of this invention comprises altering the native glycosylation pattern of the polypeptide. “Altering the native glycosylation pattern” is intended for purposes herein to mean deleting one or more carbohydrate moieties found in native sequence PRO (either by removing the underlying glycosylation site or by deleting the glycosylation by chemical and/or enzymatic means), and/or adding one or more glycosylation sites that are not present in the native sequence PRO. In addition, the phrase includes qualitative changes in the glycosylation of the native proteins, involving a change in the nature and proportions of the various carbohydrate moieties present. [0724] Addition of glycosylation sites to the PRO polypeptide may be accomplished by altering the amino acid sequence. The alteration may be made, for example, by the addition of, or substitution by, one or more serine or threonine residues to the native sequence PRO (for O-linked glycosylation sites). The PRO amino acid sequence may optionally be altered through changes at the DNA level, particularly by mutating the DNA encoding the PRO polypeptide at preselected bases such that codons are generated that will translate into the desired amino acids. [0725] Another means of increasing the number of carbohydrate moieties on the PRO polypeptide is by chemical or enzymatic coupling of glycosides to the polypeptide. Such methods are described in the art, e.g., in WO 87/05330 published Sep. 11, 1987, and in Aplin and Wriston, CRC Crit. Rev. Biochem., pp. 259-306 (1981). [0726] Removal of carbohydrate moieties present on the PRO polypeptide may be accomplished chemically or enzymatically or by mutational substitution of codons encoding for amino acid residues that serve as targets for glycosylation. Chemical deglycosylation techniques are known in the art and described, for instance, by Hakimuddin, et al., Arch. Biochem. Biophys., 259:52 (1987) and by Edge et al., Anal. Biochem., 118:131 (1981). Enzymatic cleavage of carbohydrate moieties on polypeptides can be achieved by the use of a variety of endo- and exo-glycosidases as described by Thotakura et al., Meth. Enzymol., 138:350 (1987). [0727] Another type of covalent modification of PRO comprises linking the PRO polypeptide to one of a variety of nonproteinaceous polymers, e.g., polyethylene glycol (PEG), polypropylene glycol, or polyoxyalkylenes, in the manner set forth in U.S. Pat. Nos. 4,640,835; 4,496,689; 4,301,144; 4,670,417; 4,791,192 or 4,179,337. [0728] The PRO of the present invention may also be modified in a way to form a chimeric molecule comprising PRO fused to another, heterologous polypeptide or amino acid sequence. [0729] In one embodiment, such a chimeric molecule comprises a fusion of the PRO with a tag polypeptide which provides an epitope to which an anti-tag antibody can selectively bind. The epitope tag is generally placed at the amino- or carboxyl-terminus of the PRO. The presence of such epitope-tagged forms of the PRO can be detected using an antibody against the tag polypeptide. Also, provision of the epitope tag enables the PRO to be readily purified by affinity purification using an anti-tag antibody or another type of affinity matrix that binds to the epitope tag. Various tag polypeptides and their respective antibodies are well known in the art. Examples include poly-histidine (poly-his) or poly-histidine-glycine (poly-his-gly) tags; the flu HA tag polypeptide and its antibody 12CA5 [Field et al., Mol. Cell. Biol., 8:2159-2165 (1988)]; the c-myc tag and the 8F9, 3C7, 6E10, G4, B7 and 9E10 antibodies thereto [Evan et al., Molecular and Cellular Biology 5:3610-3616 (1985)]; and the Herpes Simplex virus glycoprotein D (gD) tag and its antibody [Paborsky et al., Protein Engineering, 3(6):547-553 (1990)]. Other tag polypeptides include the Flag-peptide [Hopp et al., BioTechnology, 6:1204-1210 (1988)]; the KT3 epitope peptide [Martin et al., Science, 255:192-194 (1992)]; an α-tubulin epitope peptide [Skinner et al., J. Biol. Chem., 266:15163-15166 (1991)]; and the T7 gene 10 protein peptide tag [Lutz-Freyermuth et al., Proc. Natl. Acad. Sci. USA, 87:6393-6397 (1990)]. [0730] In an alternative embodiment, the chimeric molecule may comprise a fusion of the PRO with an immunoglobulin or a particular region of an immunoglobulin. For a bivalent form of the chimeric molecule (also referred to as an “immunoadhesin”), such a fusion could be to the Fc region of an IgG molecule. The Ig fusions preferably include the substitution of a soluble (transmembrane domain deleted or inactivated) form of a PRO polypeptide in place of at least one variable region within an Ig molecule. In a particularly preferred embodiment, the immunoglobulin fusion includes the hinge, CH2 and CH3, or the hinge, CH1, CH2 and CH3 regions of an IgG1 molecule. For the production of immunoglobulin fusions see also U.S. Pat. No. 5,428,130 issued Jun. 27, 1995. [0731] D. Preparation of PRO [0732] The description below relates primarily to production of PRO by culturing cells transformed or transfected with a vector containing PRO nucleic acid. It is, of course, contemplated that alternative methods, which are well known in the art, may be employed to prepare PRO. For instance, the PRO sequence, or portions thereof, may be produced by direct peptide synthesis using solid-phase techniques [see, e.g., Stewart et al., Solid-Phase Peptide Synthesis, W. H. Freeman Co., San Francisco, Calif. (1969); Merrifield, J. Am. Chem. Soc., 85:2149-2154 (1963)]. In vitro protein synthesis may be performed using manual techniques or by automation. Automated synthesis may be accomplished, for instance, using an Applied Biosystems Peptide Synthesizer (Foster City, Calif.) using manufacturer's instructions. Various portions of the PRO may be chemically synthesized separately and combined using chemical or enzymatic methods to produce the full-length PRO. [0733] 1. Isolation of DNA Encoding PRO [0734] DNA encoding PRO may be obtained from a cDNA library prepared from tissue believed to possess the PRO mRNA and to express it at a detectable level. Accordingly, human PRO DNA can be conveniently obtained from a cDNA library prepared from human tissue, such as described in the Examples. The PRO-encoding gene may also be obtained from a genomic library or by known synthetic procedures (e.g., automated nucleic acid synthesis). [0735] Libraries can be screened with probes (such as antibodies to the PRO or oligonucleotides of at least about 20-80 bases) designed to identify the gene of interest or the protein encoded by it. Screening the cDNA or genomic library with the selected probe may be conducted using standard procedures, such as described in Sambrook et al., Molecular Cloning: A Laboratory Manual (New York: Cold Spring Harbor Laboratory Press, 1989). An alternative means to isolate the gene encoding PRO is to use PCR methodology [Sambrook et al., supra; Dieffenbach et al., PCR Primer: A Laboratory Manual (Cold Spring Harbor Laboratory Press, 1995)]. [0736] The Examples below describe techniques for screening a cDNA library. The oligonucleotide sequences selected as probes should be of sufficient length and sufficiently unambiguous that false positives are minimized. The oligonucleotide is preferably labeled such that it can be detected upon hybridization to DNA in the library being screened. Methods of labeling are well known in the art, and include the use of radiolabels like 32P-labeled ATP, biotinylation or enzyme labeling. Hybridization conditions, including moderate stringency and high stringency, are provided in Sambrook et al., supra. [0737] Sequences identified in such library screening methods can be compared and aligned to other known sequences deposited and available in public databases such as GenBank or other private sequence databases. Sequence identity (at either the amino acid or nucleotide level) within defined regions of the molecule or across the full-length sequence can be determined using methods known in the art and as described herein. [0738] Nucleic acid having protein coding sequence may be obtained by screening selected cDNA or genomic libraries using the deduced amino acid sequence disclosed herein for the first time, and, if necessary, using conventional primer extension procedures as described in Sambrook et al., supra, to detect precursors and processing intermediates of mRNA that may not have been reverse-transcribed into cDNA. [0739] 2. Selection and Transformation of Host Cells [0740] Host cells are transfected or transformed with expression or cloning vectors described herein for PRO production and cultured in conventional nutrient media modified as appropriate for inducing promoters, selecting transformants, or amplifying the genes encoding the desired sequences. The culture conditions, such as media, temperature, pH and the like, can be selected by the skilled artisan without undue experimentation. In general, principles, protocols, and practical techniques for maximizing the productivity of cell cultures can be found in Mammalian Cell Biotechnology: a Practical Approach, M. Butler, ed. (IRL Press, 1991) and Sambrook et al., supra. [0741] Methods of eukaryotic cell transfection and prokaryotic cell transformation are known to the ordinarily skilled artisan, for example, CaCl2, CaPO4, liposome-mediated and electroporation. Depending on the host cell used, transformation is performed using standard techniques appropriate to such cells. The calcium treatment employing calcium chloride, as described in Sambrook et al., supra, or electroporation is generally used for prokaryotes. Infection with Agrobacterium tumefaciens is used for transformation of certain plant cells, as described by Shaw et al., Gene, 23:315 (1983) and WO 89/05859 published Jun. 29, 1989. For mammalian cells without such cell walls, the calcium phosphate precipitation method of Graham and van der Eb, Virology, 52:456-457 (1978) can be employed. General aspects of mammalian cell host system transfections have been described in U.S. Pat. No. 4,399,216. Transformations into yeast are typically carried out according to the method of Van Solingen et al., J. Bact., 130:946 (1977) and Hsiao et al., Proc. Natl. Acad. Sci. (USA), 76:3829 (1979). However, other methods for introducing DNA into cells, such as by nuclear microinjection, electroporation, bacterial protoplast fusion with intact cells, or polycations, e.g., polybrene, polyornithine, may also be used. For various techniques for transforming mammalian cells, see Keown et al., Methods in Enzymology, 185:527-537 (1990) and Mansour et al., Nature, 336:348-352 (1988). [0742] Suitable host cells for cloning or expressing the DNA in the vectors herein include prokaryote, yeast, or higher eukaryote cells. Suitable prokaryotes include but are not limited to eubacteria, such as Gram-negative or Gram-positive organisms, for example, Enterobacteriaceae such as E. coli. Various E. coli strains are publicly available, such as E. coli K12 strain MM294 (ATCC 31,446); E. coli X1776 (ATCC 31,537); E. coli strain W3110 (ATCC 27,325) and K5 772 (ATCC 53,635). Other suitable prokaryotic host cells include Enterobacteriaceae such as Escherichia, e.g., E. coli, Enterobacter, Erwinia, Klebsiella, Proteus, Salmonella, e.g., Salmonella typhimurium, Serratia, e.g., Serratia marcescans, and Shigella, as well as Bacilli such as B. subtilis and B. licheniformis (e.g., B. licheniformis 41P disclosed in DD 266,710 published Apr. 12, 1989), Pseudomonas such as P. aeruginosa, and Streptomyces. These examples are illustrative rather than limiting. Strain W3110 is one particularly preferred host or parent host because it is a common host strain for recombinant DNA product fermentations. Preferably, the host cell secretes minimal amounts of proteolytic enzymes. For example, strain W3110 may be modified to effect a genetic mutation in the genes encoding proteins endogenous to the host, with examples of such hosts including E. coli W3110 strain 1A2, which has the complete genotype tonA; E. coli W3110 strain 9E4, which has the complete genotype tonA ptr3; E. coli W3110strain 27C7 (ATCC 55,244), which has the complete genotype tonA ptr3phoA E15 (argF-lac)169degP ompT kanr ; E. coli W3110 strain 37D6, which has the complete genotype tonA ptr3 phoA E15 (argF-lac)169 degP ompT rbs7 ilvG kanr ; E. coli W3110 strain 40B4, which is strain 37D6 with a non-kanamycin resistant degP deletion mutation; and an E. coli strain having mutant periplasmic protease disclosed in U.S. Pat. No. 4,946,783 issued Aug. 7, 1990. Alternatively, in vitro methods of cloning, e.g., PCR or other nucleic acid polymerase reactions, are suitable. [0743] In addition to prokaryotes, eukaryotic microbes such as filamentous fungi or yeast are suitable cloning or expression hosts for PRO-encoding vectors. Saccharomyces cerevisiae is a commonly used lower eukaryotic host microorganism. Others include Schizosaccharomyces pombe (Beach and Nurse, Nature, 290:140 [1981]; EP 139,383 published May 2, 1985); Kluyveromyces hosts (U.S. Pat. No. 4,943,529; Fleer et al., Bio/Technology, 9:968-975(1991)) such as, e.g., K. lactis (MW98-8C, CBS683, CBS4574; Louvencourt et al., J. Bacteriol., 154(2):737-742 [1983]), K. fragilis (ATCC 12,424), K. bulgaricus (ATCC 16,045), K. wickeramii (ATCC 24,178), K. waltii (ATCC 56,500), K. drosophilarum (ATCC 36,906; Van den Berg et al., Bio/Technology, 8:135 (1990)), K. thermotolerans, and K. marxianus; yarrowia (EP 402,226); Pichia pastoris (EP 183,070; Sreekrishna et al., J. Basic Microbiol., 28:265-278 [1988]); Candida; Trichoderma reesia (EP 244,234); Neurospora crassa (Case et al., Proc. Natl. Acad. Sci. USA, 76:5259-5263 [1979]); Schwanniomyces such as Schwanniomyces occidentalis (EP 394,538 published Oct. 31, 1990); and filamentous fungi such as, e.g., Neurospora, Penicillium, Tolypocladium (WO 91/00357 published Jan. 10, 1991), and Aspergillus hosts such as A. nidulans (Ballance et al., Biochem. Biophys. Res. Commun., 112:284-289 [1983]; Tilburn et al., Gene, 26:205-221 [1983]; Yelton et al., Proc. Natl. Acad. Sci. USA, 81:1470-1474 [1984]) and A. niger (Kelly and Hynes, EMBO J., 4:475-479 [1985]). Methylotropic yeasts are suitable herein and include, but are not limited to, yeast capable of growth on methanol selected from the genera consisting of Hansenula, Candida, Kloeckera, Pichia, Saccharomyces, Torulopsis, and Rhodotorula. A list of specific species that are exemplary of this class of yeasts may be found in C. Anthony, The Biochemistry of Methylotrophs, 269 (1982). [0744] Suitable host cells for the expression of glycosylated PRO are derived from multicellular organisms. Examples of invertebrate cells include insect cells such as Drosophila S2 and Spodoptera Sf9, as well as plant cells. Examples of useful mammalian host cell lines include Chinese hamster ovary (CHO) and COS cells. More specific examples include monkey kidney CV1 line transformed by SV40 (COS-7, ATCC CRL 1651); human embryonic kidney line (293 or 293 cells subcloned for growth in suspension culture, Graham et al., J. Gen Virol., 36:59 (1977)); Chinese hamster ovary cells/-DHFR (CHO, Urlaub and Chasin, Proc. Natl. Acad. Sci. USA, 77:4216 (1980)); mouse sertoli cells (TM4, Mather, Biol. Reprod., 23:243-251 (1980)); human lung cells (W138, ATCC CCL 75); human liver cells (Hep G2, HB 8065); and mouse mammary tumor (MMT 060562, ATCC CCL51). The selection of the appropriate host cell is deemed to be within the skill in the art. [0745] 3. Selection and Use of a Replicable Vector [0746] The nucleic acid (e.g., cDNA or genomic DNA) encoding PRO may be inserted into a replicable vector for cloning (amplification of the DNA) or for expression. Various vectors are publicly available. The vector may, for example, be in the form of a plasmid, cosmid, viral particle, or phage. The appropriate nucleic acid sequence may be inserted into the vector by a variety of procedures. In general, DNA is inserted into an appropriate restriction endonuclease site(s) using techniques known in the art. Vector components generally include, but are not limited to, one or more of a signal sequence, an origin of replication, one or more marker genes, an enhancer element, a promoter, and a transcription termination sequence. Construction of suitable vectors containing one or more of these components employs standard ligation techniques which are known to the skilled artisan. [0747] The PRO may be produced recombinantly not only directly, but also as a fusion polypeptide with a heterologous polypeptide, which may be a signal sequence or other polypeptide having a specific cleavage site at the N-terminus of the mature protein or polypeptide. In general, the signal sequence may be a component of the vector, or it may be a part of the PRO-encoding DNA that is inserted into the vector. The signal sequence may be a prokaryotic signal sequence selected, for example, from the group of the alkaline phosphatase, penicillinase, lpp, or heat-stable enterotoxin II leaders. For yeast secretion the signal sequence may be, e.g., the yeast invertase leader, alpha factor leader (including Saccharomyces and Kluyveromyces α-factor leaders, the latter described in U.S. Pat. No. 5,010,182), or acid phosphatase leader, the C. albicans glucoamylase leader (EP 362,179 published Apr. 4, 1990), or the signal described in WO 90/13646 published Nov. 15, 1990. In mammalian cell expression, mammalian signal sequences may be used to direct secretion of the protein, such as signal sequences from secreted polypeptides of the same or related species, as well as viral secretory leaders. [0748] Both expression and cloning vectors contain a nucleic acid sequence that enables the vector to replicate in one or more selected host cells. Such sequences are well known for a variety of bacteria, yeast, and viruses. The origin of replication from the plasmid pBR322 is suitable for most Gram-negative bacteria, the 2μ plasmid origin is suitable for yeast, and various viral origins (SV40, polyoma, adenovirus, VSV or BPV) are useful for cloning vectors in mammalian cells. [0749] Expression and cloning vectors will typically contain a selection gene, also termed a selectable marker. Typical selection genes encode proteins that (a) confer resistance to antibiotics or other toxins, e.g., ampicillin, neomycin, methotrexate, or tetracycline, (b) complement auxotrophic deficiencies, or (c) supply critical nutrients not available from complex media, e.g., the gene encoding D-alanine racemase for Bacilli. [0750] An example of suitable selectable markers for mammalian cells are those that enable the identification of cells competent to take up the PRO-encoding nucleic acid, such as DHFR or thymidine kinase. An appropriate host cell when wild-type DHFR is employed is the CHO cell line deficient in DHFR activity, prepared and propagated as described by Urlaub et al., Proc. Natl. Acad. Sci. USA, 77:4216 (1980). A suitable selection gene for use in yeast is the trp1 gene present in the yeast plasmid YRp7 [Stinchcomb et al., Nature, 282:39 (1979); Kingsman et al., Gene, 7:141 (1979); Tschemper et al., Gene, 10:157 (1980)]. The trp1 gene provides a selection marker for a mutant strain of yeast lacking the ability to grow in tryptophan, for example, ATCC No. 44076 or PEP4-1 [Jones, Genetics, 85:12 (1977)]. [0751] Expression and cloning vectors usually contain a promoter operably linked to the PRO-encoding nucleic acid sequence to direct mRNA synthesis. Promoters recognized by a variety of potential host cells are well known. Promoters suitable for use with prokaryotic hosts include the β-lactamase and lactose promoter systems [Chang et al., Nature, 275:615 (1978); Goeddel et al., Nature, 281:544 (1979)], alkaline phosphatase, a tryptophan (trp) promoter system [Goeddel, Nucleic Acids Res., 8:4057 (1980); EP 36,776], and hybrid promoters such as the tac promoter [deBoer et al., Proc. Natl. Acad. Sci. USA, 80:21-25 (1983)]. Promoters for use in bacterial systems also will contain a Shine-Dalgarno (S.D.) sequence operably linked to the DNA encoding PRO. [0752] Examples of suitable promoting sequences for use with yeast hosts include the promoters for 3-phosphoglycerate kinase [Hitzeman et al., J. Biol. Chem., 255:2073 (1980)] or other glycolytic enzymes [Hess et al., J. Adv. Enzyme Reg., 7:149 (1968); Holland, Biochemistry, 17:4900 (1978)], such as enolase, glyceraldehyde-3-phosphate dehydrogenase, hexokinase, pyruvate decarboxylase, phosphofructokinase, glucose-6-phosphate isomerase, 3-phosphoglycerate mutase, pyruvate kinase, triosephosphate isomerase, phosphoglucose isomerase, and glucokinase. [0753] Other yeast promoters, which are inducible promoters having the additional advantage of transcription controlled by growth conditions, are the promoter regions for alcohol dehydrogenase 2, isocytochrome C, acid phosphatase, degradative enzymes associated with nitrogen metabolism, metallothionein, glyceraldehyde-3-phosphate dehydrogenase, and enzymes responsible for maltose and galactose utilization. Suitable vectors and promoters for use in yeast expression are further described in EP 73,657. [0754] PRO transcription from vectors in mammalian host cells is controlled, for example, by promoters obtained from the genomes of viruses such as polyoma virus, fowlpox virus (UK 2,211,504 published Jul. 5, 1989), adenovirus (such as Adenovirus 2), bovine papilloma virus, avian sarcoma virus, cytomegalovirus, a retrovirus, hepatitis-B virus and Simian Virus 40 (SV40), from heterologous mammalian promoters, e.g., the actin promoter or an immunoglobulin promoter, and from heat-shock promoters, provided such promoters are compatible with the host cell systems. [0755] Transcription of a DNA encoding the PRO by higher eukaryotes may be increased by inserting an enhancer sequence into the vector. Enhancers are cis-acting elements of DNA, usually about from 10 to 300 bp, that act on a promoter to increase its transcription. Many enhancer sequences are now known from mammalian genes (globin, elastase, albumin, α-fetoprotein, and insulin). Typically, however, one will use an enhancer from a eukaryotic cell virus. Examples include the SV40 enhancer on the late side of the replication origin (bp 100-270), the cytomegalovirus early promoter enhancer, the polyoma enhancer on the late side of the replication origin, and adenovirus enhancers. The enhancer may be spliced into the vector at a position 5′ or 3′ to the PRO coding sequence, but is preferably located at a site 5′ from the promoter. [0756] Expression vectors used in eukaryotic host cells (yeast, fungi, insect, plant, animal, human, or nucleated cells from other multicellular organisms) will also contain sequences necessary for the termination of transcription and for stabilizing the mRNA. Such sequences are commonly available from the 5′ and, occasionally 3′, untranslated regions of eukaryotic or viral DNAs or cDNAs. These regions contain nucleotide segments transcribed as polyadenylated fragments in the untranslated portion of the mRNA encoding PRO. [0757] Still other methods, vectors, and host cells suitable for adaptation to the synthesis of PRO in recombinant vertebrate cell culture are described in Gething et al., Nature, 293:620-625 (1981); Mantei et al., Nature, 281:40-46 (1979); EP 117,060; and EP 117,058. [0758] 4. Detecting Gene Amplification/Expression [0759] Gene amplification and/or expression may be measured in a sample directly, for example, by conventional Southern blotting, Northern blotting to quantitate the transcription of mRNA [Thomas, Proc. Natl. Acad. Sci. USA, 77:5201-5205 (1980)], dot blotting (DNA analysis), or in situ hybridization, using an appropriately labeled probe, based on the sequences provided herein. Alternatively, antibodies may be employed that can recognize specific duplexes, including DNA duplexes, RNA duplexes, and DNA-RNA hybrid duplexes or DNA-protein duplexes. The antibodies in turn may be labeled and the assay may be carried out where the duplex is bound to a surface, so that upon the formation of duplex on the surface, the presence of antibody bound to the duplex can be detected. [0760] Gene expression, alternatively, may be measured by immunological methods, such as immunohistochemical staining of cells or tissue sections and assay of cell culture or body fluids, to quantitate directly the expression of gene product. Antibodies useful for immunohistochemical staining and/or assay of sample fluids may be either monoclonal or polyclonal, and may be prepared in any mammal. Conveniently, the antibodies may be prepared against a native sequence PRO polypeptide or against a synthetic peptide based on the DNA sequences provided herein or against exogenous sequence fused to PRO DNA and encoding a specific antibody epitope. [0761] 5. Purification of Polypeptide [0762] Forms of PRO may be recovered from culture medium or from host cell lysates. If membrane-bound, it can be released from the membrane using a suitable detergent solution (e.g. Triton-X 100) or by enzymatic cleavage. Cells employed in expression of PRO can be disrupted by various physical or chemical means, such as freeze-thaw cycling, sonication, mechanical disruption, or cell lysing agents. [0763] It may be desired to purify PRO from recombinant cell proteins or polypeptides. The following procedures are exemplary of suitable purification procedures: by fractionation on an ion-exchange column; ethanol precipitation; reverse phase HPLC; chromatography on silica or on a cation-exchange resin such as DEAE; chromatofocusing; SDS-PAGE; ammonium sulfate precipitation; gel filtration using, for example, Sephadex G-75; protein A Sepharose columns to remove contaminants such as IgG; and metal chelating columns to bind epitope-tagged forms of the PRO. Various methods of protein purification may be employed and such methods are known in the art and described for example in Deutscher, Methods in Enzymology, 182 (1990); Scopes, Protein Purification: Principles and Practice, Springer-Verlag, New York (1982). The purification step(s) selected will depend, for example, on the nature of the production process used and the particular PRO produced. [0764] E. Uses for PRO [0765] Nucleotide sequences (or their complement) encoding PRO have various applications in the art of molecular biology, including uses as hybridization probes, in chromosome and gene mapping and in the generation of anti-sense RNA and DNA. PRO nucleic acid will also be useful for the preparation of PRO polypeptides by the recombinant techniques described herein. [0766] The full-length native sequence PRO gene, or portions thereof, may be used as hybridization probes for a cDNA library to isolate the full-length PRO cDNA or to isolate still other cDNAs (for instance, those encoding naturally-occurring variants of PRO or PRO from other species) which have a desired sequence identity to the native PRO sequence disclosed herein. Optionally, the length of the probes will be about 20 to about 50 bases. The hybridization probes may be derived from at least partially novel regions of the full length native nucleotide sequence wherein those regions may be determined without undue experimentation or from genomic sequences including promoters, enhancer elements and introns of native sequence PRO. By way of example, a screening method will comprise isolating the coding region of the PRO gene using the known DNA sequence to synthesize a selected probe of about 40 bases. Hybridization probes may be labeled by a variety of labels, including radionucleotides such as 32P or 35S, or enzymatic labels such as alkaline phosphatase coupled to the probe via avidin/biotin coupling systems. Labeled probes having a sequence complementary to that of the PRO gene of the present invention can be used to screen libraries of human cDNA, genomic DNA or mRNA to determine which members of such libraries the probe hybridizes to. Hybridization techniques are described in further detail in the Examples below. [0767] Any EST sequences disclosed in the present application may similarly be employed as probes, using the methods disclosed herein. [0768] Other useful fragments of the PRO nucleic acids include antisense or sense oligonucleotides comprising a singe-stranded nucleic acid sequence (either RNA or DNA) capable of binding to target PRO mRNA (sense) or PRO DNA (antisense) sequences. Antisense or sense oligonucleotides, according to the present invention, comprise a fragment of the coding region of PRO DNA. Such a fragment generally comprises at least about 14 nucleotides, preferably from about 14 to 30 nucleotides. The ability to derive an antisense or a sense oligonucleotide, based upon a cDNA sequence encoding a given protein is described in, for example, Stein and Cohen (Cancer Res. 48:2659, 1988) and van der Krol et al. (BioTechniques 6:958, 1988). [0769] Binding of antisense or sense oligonucleotides to target nucleic acid sequences results in the formation of duplexes that block transcription or translation of the target sequence by one of several means, including enhanced degradation of the duplexes, premature termination of transcription or translation, or by other means. The antisense oligonucleotides thus may be used to block expression of PRO proteins. Antisense or sense oligonucleotides further comprise oligonucleotides having modified sugar-phosphodiester backbones (or other sugar linkages, such as those described in WO 91/06629) and wherein such sugar linkages are resistant to endogenous nucleases. Such oligonucleotides with resistant sugar linkages are stable in vivo (i.e., capable of resisting enzymatic degradation) but retain sequence specificity to be able to bind to target nucleotide sequences. [0770] Other examples of sense or antisense oligonucleotides include those oligonucleotides which are covalently linked to organic moieties, such as those described in WO 90/10048, and other moieties that increases affinity of the oligonucleotide for a target nucleic acid sequence, such as poly-(L-lysine). Further still, intercalating agents, such as ellipticine, and alkylating agents or metal complexes may be attached to sense or antisense oligonucleotides to modify binding specificities of the antisense or sense oligonucleotide for the target nucleotide sequence. [0771] Antisense or sense oligonucleotides may be introduced into a cell containing the target nucleic acid sequence by any gene transfer method, including, for example, CaPO4-mediated DNA transfection, electroporation, or by using gene transfer vectors such as Epstein-Barr virus. In a preferred procedure, an antisense or sense oligonucleotide is inserted into a suitable retroviral vector. A cell containing the target nucleic acid sequence is contacted with the recombinant retroviral vector, either in vivo or ex vivo. Suitable retroviral vectors include, but are not limited to, those derived from the murine retrovirus M-MuLV, N2 (a retrovirus derived from M-MuLV), or the double copy vectors designated DCT5A, DCT5B and DCT5C (see WO 90/13641). [0772] Sense or antisense oligonucleotides also may be introduced into a cell containing the target nucleotide sequence by formation of a conjugate with a ligand binding molecule, as described in WO 91/04753. Suitable ligand binding molecules include, but are not limited to, cell surface receptors, growth factors, other cytokines, or other ligands that bind to cell surface receptors. Preferably, conjugation of the ligand binding molecule does not substantially interfere with the ability of the ligand binding molecule to bind to its corresponding molecule or receptor, or block entry of the sense or antisense oligonucleotide or its conjugated version into the cell. [0773] Alternatively, a sense or an antisense oligonucleotide may be introduced into a cell containing the target nucleic acid sequence by formation of an oligonucleotide-lipid complex, as described in WO 90/10448. The sense or antisense oligonucleotide-lipid complex is preferably dissociated within the cell by an endogenous lipase. [0774] Antisense or sense RNA or DNA molecules are generally at least about 5 bases in length, about 10 bases in length, about 15 bases in length, about 20 bases in length, about 25 bases in length, about 30 bases in length, about 35 bases in length, about 40 bases in length, about 45 bases in length, about 50 bases in length, about 55 bases in length, about 60 bases in length, about 65 bases in length, about 70 bases in length, about 75 bases in length, about 80 bases in length, about 85 bases in length, about 90 bases in length, about 95 bases in length, about 100 bases in length, or more. [0775] The probes may also be employed in PCR techniques to generate a pool of sequences for identification of closely related PRO coding sequences. [0776] Nucleotide sequences encoding a PRO can also be used to construct hybridization probes for mapping the gene which encodes that PRO and for the genetic analysis of individuals with genetic disorders. The nucleotide sequences provided herein may be mapped to a chromosome and specific regions of a chromosome using known techniques, such as in situ hybridization, linkage analysis against known chromosomal markers, and hybridization screening with libraries. [0777] When the coding sequences for PRO encode a protein which binds to another protein (example, where the PRO is a receptor), the PRO can be used in assays to identify the other proteins or molecules involved in the binding interaction. By such methods, inhibitors of the receptor/ligand binding interaction can be identified. Proteins involved in such binding interactions can also be used to screen for peptide or small molecule inhibitors or agonists of the binding interaction. Also, the receptor PRO can be used to isolate correlative ligand(s). Screening assays can be designed to find lead compounds that mimic the biological activity of a native PRO or a receptor for PRO. Such screening assays will include assays amenable to high-throughput screening of chemical libraries, making them particularly suitable for identifying small molecule drug candidates. Small molecules contemplated include synthetic organic or inorganic compounds. The assays can be performed in a variety of formats, including protein-protein binding assays, biochemical screening assays, immunoassays and cell based assays, which are well characterized in the art. [0778] Nucleic acids which encode PRO or its modified forms can also be used to generate either transgenic animals or “knock out” animals which, in turn, are useful in the development and screening of therapeutically useful reagents. A transgenic animal (e.g., a mouse or rat) is an animal having cells that contain a transgene, which transgene was introduced into the animal or an ancestor of the animal at a prenatal, e.g., an embryonic stage. A transgene is a DNA which is integrated into the genome of a cell from which a transgenic animal develops. In one embodiment, cDNA encoding PRO can be used to clone genomic DNA encoding PRO in accordance with established techniques and the genomic sequences used to generate transgenic animals that contain cells which express DNA encoding PRO. Methods for generating transgenic animals, particularly animals such as mice or rats, have become conventional in the art and are described, for example, in U.S. Pat. Nos. 4,736,866 and 4,870,009. Typically, particular cells would be targeted for PRO transgene incorporation with tissue-specific enhancers. Transgenic animals that include a copy of a transgene encoding PRO introduced into the germ line of the animal at an embryonic stage can be used to examine the effect of increased expression of DNA encoding PRO. Such animals can be used as tester animals for reagents thought to confer protection from, for example, pathological conditions associated with its overexpression. In accordance with this facet of the invention, an animal is treated with the reagent and a reduced incidence of the pathological condition, compared to untreated animals bearing the transgene, would indicate a potential therapeutic intervention for the pathological condition. [0779] Alternatively, non-human homologues of PRO can be used to construct a PRO “knock out” animal which has a defective or altered gene encoding PRO as a result of homologous recombination between the endogenous gene encoding PRO and altered genomic DNA encoding PRO introduced into an embryonic stem cell of the animal. For example, cDNA encoding PRO can be used to clone genomic DNA encoding PRO in accordance with established techniques. A portion of the genomic DNA encoding PRO can be deleted or replaced with another gene, such as a gene encoding a selectable marker which can be used to monitor integration. Typically, several kilobases of unaltered flanking DNA (both at the 5′ and 3′ ends) are included in the vector [see e.g., Thomas and Capecchi, Cell, 51:503 (1987) for a description of homologous recombination vectors]. The vector is introduced into an embryonic stem cell line (e.g., by electroporation) and cells in which the introduced DNA has homologously recombined with the endogenous DNA are selected [see e.g., Li et al., Cell, 69:915 (1992)]. The selected cells are then injected into a blastocyst of an animal (e.g., a mouse or rat) to form aggregation chimeras [see e.g., Bradley, in Teratocarcinomas and Embryonic Stem Cells: A Practical Approach, E. J. Robertson, ed. (IRL, Oxford, 1987), pp. 113-152]. A chimeric embryo can then be implanted into a suitable pseudopregnant female foster animal and the embryo brought to term to create a “knock out” animal. Progeny harboring the homologously recombined DNA in their germ cells can be identified by standard techniques and used to breed animals in which all cells of the animal contain the homologously recombined DNA. Knockout animals can be characterized for instance, for their ability to defend against certain pathological conditions and for their development of pathological conditions due to absence of the PRO polypeptide. [0780] Nucleic acid encoding the PRO polypeptides may also be used in gene therapy. In gene therapy applications, genes are introduced into cells in order to achieve in vivo synthesis of a therapeutically effective genetic product, for example for replacement of a defective gene. “Gene therapy” includes both conventional gene therapy where a lasting effect is achieved by a single treatment, and the administration of gene therapeutic agents, which involves the one time or repeated administration of a therapeutically effective DNA or mRNA. Antisense RNAs and DNAs can be used as therapeutic agents for blocking the expression of certain genes in vivo. It has already been shown that short antisense oligonucleotides can be imported into cells where they act as inhibitors, despite their low intracellular concentrations caused by their restricted uptake by the cell membrane. (Zamecnik et al., Proc. Natl. Acad. Sci. USA 83:4143-4146 [1986]). The oligonucleotides can be modified to enhance their uptake, e.g. by substituting their negatively charged phosphodiester groups by uncharged groups. [0781] There are a variety of techniques available for introducing nucleic acids into viable cells. The techniques vary depending upon whether the nucleic acid is transferred into cultured cells in vitro, or in vivo in the cells of the intended host. Techniques suitable for the transfer of nucleic acid into mammalian cells in vitro include the use of liposomes, electroporation, microinjection, cell fusion, DEAE-dextran, the calcium phosphate precipitation method, etc. The currently preferred in vivo gene transfer techniques include transfection with viral (typically retroviral) vectors and viral coat protein-liposome mediated transfection (Dzau et al., Trends in Biotechnology 11, 205-210 [1993]). In some situations it is desirable to provide the nucleic acid source with an agent that targets the target cells, such as an antibody specific for a cell surface membrane protein or the target cell, a ligand for a receptor on the target cell, etc. Where liposomes are employed, proteins which bind to a cell surface membrane protein associated with endocytosis may be used for targeting and/or to facilitate uptake, e.g. capsid proteins or fragments thereof tropic for a particular cell type, antibodies for proteins which undergo internalization in cycling, proteins that target intracellular localization and enhance intracellular half-life. The technique of receptor-mediated endocytosis is described, for example, by Wu et al., J. Biol. Chem. 262, 4429-4432 (1987); and Wagner et al., Proc. Natl. Acad. Sci. USA 87, 3410-3414 (1990). For review of gene marking and gene therapy protocols see Anderson et al., Science 256, 808-813 (1992). [0782] The PRO polypeptides described herein may also be employed as molecular weight markers for protein electrophoresis purposes and the isolated nucleic acid sequences may be used for recombinantly expressing those markers. [0783] The nucleic acid molecules encoding the PRO polypeptides or fragments thereof described herein are useful for chromosome identification. In this regard, there exists an ongoing need to identify new chromosome markers, since relatively few chromosome marking reagents, based upon actual sequence data are presently available. Each PRO nucleic acid molecule of the present invention can be used as a chromosome marker. [0784] The PRO polypeptides and nucleic acid molecules of the present invention may also be used diagnostically for tissue typing, wherein the PRO polypeptides of the present invention may be differentially expressed in one tissue as compared to another, preferably in a diseased tissue as compared to a normal tissue of the same tissue type. PRO nucleic acid molecules will find use for generating probes for PCR, Northern analysis, Southern analysis and Western analysis. [0785] The PRO polypeptides described herein may also be employed as therapeutic agents. The PRO polypeptides of the present invention can be formulated according to known methods to prepare pharmaceutically useful compositions, whereby the PRO product hereof is combined in admixture with a pharmaceutically acceptable carrier vehicle. Therapeutic formulations are prepared for storage by mixing the active ingredient having the desired degree of purity with optional physiologically acceptable carriers, excipients or stabilizers (Remington's Pharmaceutical Sciences 16th edition, Osol, A. Ed. (1980)), in the form of lyophilized formulations or aqueous solutions. Acceptable carriers, excipients or stabilizers are nontoxic to recipients at the dosages and concentrations employed, and include buffers such as phosphate, citrate and other organic acids; antioxidants including ascorbic acid; low molecular weight (less than about 10 residues) polypeptides; proteins, such as serum albumin, gelatin or immunoglobulins; hydrophilic polymers such as polyvinylpyrrolidone, amino acids such as glycine, glutamine, asparagine, arginine or lysine; monosaccharides, disaccharides and other carbohydrates including glucose, mannose, or dextrins; chelating agents such as EDTA; sugar alcohols such as mannitol or sorbitol; salt-forming counterions such as sodium; and/or nonionic surfactants such as TWEEN™, PLURONICS™ or PEG. [0786] The formulations to be used for in vivo administration must be sterile. This is readily accomplished by filtration through sterile filtration membranes, prior to or following lyophilization and reconstitution. [0787] Therapeutic compositions herein generally are placed into a container having a sterile access port, for example, an intravenous solution bag or vial having a stopper pierceable by a hypodermic injection needle. [0788] The route of administration is in accord with known methods, e.g. injection or infusion by intravenous, intraperitoneal, intracerebral, intramuscular, intraocular, intraarterial or intralesional routes, topical administration, or by sustained release systems. [0789] Dosages and desired drug concentrations of pharmaceutical compositions of the present invention may vary depending on the particular use envisioned. The determination of the appropriate dosage or route of administration is well within the skill of an ordinary physician. Animal experiments provide reliable guidance for the determination of effective doses for human therapy. Interspecies scaling of effective doses can be performed following the principles laid down by Mordenti, J. and Chappell, W. “The use of interspecies scaling in toxicokinetics” In Toxicokinetics and New Drug Development, Yacobi et al., Eds., Pergamon Press, New York 1989, pp. 42-96. [0790] When in vivo administration of a PRO polypeptide or agonist or antagonist thereof is employed, normal dosage amounts may vary from about 10 ng/kg to up to 100 mg/kg of mammal body weight or more per day, preferably about 1 μg/kg/day to 10 mg/kg/day, depending upon the route of administration. Guidance as to particular dosages and methods of delivery is provided in the literature; see, for example, U.S. Pat. Nos. 4,657,760; 5,206,344; or 5,225,212. It is anticipated that different formulations will be effective for different treatment compounds and different disorders, that administration targeting one organ or tissue, for example, may necessitate delivery in a manner different from that to another organ or tissue. [0791] Where sustained-release administration of a PRO polypeptide is desired in a formulation with release characteristics suitable for the treatment of any disease or disorder requiring administration of the PRO polypeptide, microencapsulation of the PRO polypeptide is contemplated. Microencapsulation of recombinant proteins for sustained release has been successfully performed with human growth hormone (rhGH), interferon-(rhIFN-), interleukin-2, and MN rgp120. Johnson et al., Nat. Med., 2:795-799 (1996); Yasuda, Biomed. Ther., 27:1221-1223 (1993); Hora et al., Bio/Technology, 8:755-758 (1990); Cleland, “Design and Production of Single Immunization Vaccines Using Polylactide Polyglycolide Microsphere Systems,” in Vaccine Design: The Subunit and Adjuvant Approach, Powell and Newman, eds, (Plenum Press: New York, 1995), pp.439-462; WO 97/03692, WO 96/40072, WO 96/07399; and U.S. Pat. No. 5,654,010. [0792] The sustained-release formulations of these proteins were developed using poly-lactic-coglycolic acid (PLGA) polymer due to its biocompatibility and wide range of biodegradable properties. The degradation products of PLGA, lactic and glycolic acids, can be cleared quickly within the human body. Moreover, the degradability of this polymer can be adjusted from months to years depending on its molecular weight and composition. Lewis, “Controlled release of bioactive agents from lactide/glycolide polymer,” in: M. Chasin and R. Langer (Eds.), Biodegradable Polymers as Drug Delivery Systems (Marcel Dekker: New York, 1990), pp. 1-41. [0793] This invention encompasses methods of screening compounds to identify those that mimic the PRO polypeptide (agonists) or prevent the effect of the PRO polypeptide (antagonists). Screening assays for antagonist drug candidates are designed to identify compounds that bind or complex with the PRO polypeptides encoded by the genes identified herein, or otherwise interfere with the interaction of the encoded polypeptides with other cellular proteins. Such screening assays will include assays amenable to high-throughput screening of chemical libraries, making them particularly suitable for identifying small molecule drug candidates. [0794] The assays can be performed in a variety of formats, including protein-protein binding assays, biochemical screening assays, immunoassays, and cell-based assays, which are well characterized in the art. [0795] All assays for antagonists are common in that they call for contacting the drug candidate with a PRO polypeptide encoded by a nucleic acid identified herein under conditions and for a time sufficient to allow these two components to interact. [0796] In binding assays, the interaction is binding and the complex formed can be isolated or detected in the reaction mixture. In a particular embodiment, the PRO polypeptide encoded by the gene identified herein or the drug candidate is immobilized on a solid phase, e.g., on a microtiter plate, by covalent or non-covalent attachments. Non-covalent attachment generally is accomplished by coating the solid surface with a solution of the PRO polypeptide and drying. Alternatively, an immobilized antibody, e.g., a monoclonal antibody, specific for the PRO polypeptide to be immobilized can be used to anchor it to a solid surface. The assay is performed by adding the non-immobilized component, which may be labeled by a detectable label, to the immobilized component, e.g., the coated surface containing the anchored component. When the reaction is complete, the non-reacted components are removed, e.g., by washing, and complexes anchored on the solid surface are detected. When the originally non-immobilized component carries a detectable label, the detection of label immobilized on the surface indicates that complexing occurred. Where the originally non-immobilized component does not carry a label, complexing can be detected, for example, by using a labeled antibody specifically binding the immobilized complex. [0797] If the candidate compound interacts with but does not bind to a particular PRO polypeptide encoded by a gene identified herein, its interaction with that polypeptide can be assayed by methods well known for detecting protein-protein interactions. Such assays include traditional approaches, such as, e.g., cross-linking, co-immunoprecipitation, and co-purification through gradients or chromatographic columns. In addition, protein-protein interactions can be monitored by using a yeast-based genetic system described by Fields and co-workers (Fields and Song, Nature (London), 340:245-246 (1989); Chien et al., Proc. Natl. Acad. Sci. USA, 88:9578-9582 (1991)) as disclosed by Chevray and Nathans, Proc. Natl. Acad. Sci. USA, 89:5789-5793 (1991). Many transcriptional activators, such as yeast GAL4, consist of two physically discrete modular domains, one acting as the DNA-binding domain, the other one functioning as the transcription-activation domain. The yeast expression system described in the foregoing publications (generally referred to as the “two-hybrid system”) takes advantage of this property, and employs two hybrid proteins, one in which the target protein is fused to the DNA-binding domain of GAL4, and another, in which candidate activating proteins are fused to the activation domain. The expression of a GAL1-lacZ reporter gene under control of a GAL4-activated promoter depends on reconstitution of GAL4 activity via protein-protein interaction. Colonies containing interacting polypeptides are detected with a chromogenic substrate for β-galactosidase. A complete kit (MATCHMAKER™) for identifying protein-protein interactions between two specific proteins using the two-hybrid technique is commercially available from Clontech. This system can also be extended to map protein domains involved in specific protein interactions as well as to pinpoint amino acid residues that are crucial for these interactions. [0798] Compounds that interfere with the interaction of a gene encoding a PRO polypeptide identified herein and other intra- or extracellular components can be tested as follows: usually a reaction mixture is prepared containing the product of the gene and the intra- or extracellular component under conditions and for a time allowing for the interaction and binding of the two products. To test the ability of a candidate compound to inhibit binding, the reaction is run in the absence and in the presence of the test compound. In addition, a placebo may be added to a third reaction mixture, to serve as positive control. The binding (complex formation) between the test compound and the intra- or extracellular component present in the mixture is monitored as described hereinabove. The formation of a complex in the control reaction(s) but not in the reaction mixture containing the test compound indicates that the test compound interferes with the interaction of the test compound and its reaction partner. [0799] To assay for antagonists, the PRO polypeptide may be added to a cell along with the compound to be screened for a particular activity and the ability of the compound to inhibit the activity of interest in the presence of the PRO polypeptide indicates that the compound is an antagonist to the PRO polypeptide. Alternatively, antagonists may be detected by combining the PRO polypeptide and a potential antagonist with membrane-bound PRO polypeptide receptors or recombinant receptors under appropriate conditions for a competitive inhibition assay. The PRO polypeptide can be labeled, such as by radioactivity, such that the number of PRO polypeptide molecules bound to the receptor can be used to determine the effectiveness of the potential antagonist. The gene encoding the receptor can be identified by numerous methods known to those of skill in the art, for example, ligand panning and FACS sorting. Coligan et al., Current Protocols in Immun., 1(2): Chapter 5 (1991). Preferably, expression cloning is employed wherein polyadenylated RNA is prepared from a cell responsive to the PRO polypeptide and a cDNA library created from this RNA is divided into pools and used to transfect COS cells or other cells that are not responsive to the PRO polypeptide. Transfected cells that are grown on glass slides are exposed to labeled PRO polypeptide. The PRO polypeptide can be labeled by a variety of means including iodination or inclusion of a recognition site for a site-specific protein kinase. Following fixation and incubation, the slides are subjected to autoradiographic analysis. Positive pools are identified and sub-pools are prepared and re-transfected using an interactive sub-pooling and re-screening process, eventually yielding a single clone that encodes the putative receptor. [0800] As an alternative approach for receptor identification, labeled PRO polypeptide can be photoaffinity-linked with cell membrane or extract preparations that express the receptor molecule. Cross-linked material is resolved by PAGE and exposed to X-ray film. The labeled complex containing the receptor can be excised, resolved into peptide fragments, and subjected to protein micro-sequencing. The amino acid sequence obtained from micro-sequencing would be used to design a set of degenerate oligonucleotide probes to screen a cDNA library to identify the gene encoding the putative receptor. [0801] In another assay for antagonists, mammalian cells or a membrane preparation expressing the receptor would be incubated with labeled PRO polypeptide in the presence of the candidate compound. The ability of the compound to enhance or block this interaction could then be measured. [0802] More specific examples of potential antagonists include an oligonucleotide that binds to the fusions of immunoglobulin with PRO polypeptide, and, in particular, antibodies including, without limitation, poly- and monoclonal antibodies and antibody fragments, single-chain antibodies, anti-idiotypic antibodies, and chimeric or humanized versions of such antibodies or fragments, as well as human antibodies and antibody fragments. Alternatively, a potential antagonist may be a closely related protein, for example, a mutated form of the PRO polypeptide that recognizes the receptor but imparts no effect, thereby competitively inhibiting the action of the PRO polypeptide. [0803] Another potential PRO polypeptide antagonist is an antisense RNA or DNA construct prepared using antisense technology, where, e.g., an antisense RNA or DNA molecule acts to block directly the translation of mRNA by hybridizing to targeted mRNA and preventing protein translation. Antisense technology can be used to control gene expression through triple-helix formation or antisense DNA or RNA, both of which methods are based on binding of a polynucleotide to DNA or RNA. For example, the 5′ coding portion of the polynucleotide sequence, which encodes the mature PRO polypeptides herein, is used to design an antisense RNA oligonucleotide of from about 10 to 40 base pairs in length. A DNA oligonucleotide is designed to be complementary to a region of the gene involved in transcription (triple helix—see Lee et al., Nucl. Acids Res., 6:3073 (1979); Cooney et al., Science, 241:456 (1988); Dervan et al., Science, 251:1360 (1991)), thereby preventing transcription and the production of the PRO polypeptide. The antisense RNA oligonucleotide hybridizes to the mRNA in vivo and blocks translation of the mRNA molecule into the PRO polypeptide (antisense—Okano, Neurochem., 56:560 (1991), Oligodeoxynucleotides as Antisense Inhibitors of Gene Expression (CRC Press: Boca Raton, Fla., 1988). The oligonucleotides described above can also be delivered to cells such that the antisense RNA or DNA may be expressed in vivo to inhibit production of the PRO polypeptide. When antisense DNA is used, oligodeoxyribonucleotides derived from the translation-initiation site, e.g., between about −10 and +10 positions of the target gene nucleotide sequence, are preferred. [0804] Potential antagonists include small molecules that bind to the active site, the receptor binding site, or growth factor or other relevant binding site of the PRO polypeptide, thereby blocking the normal biological activity of the PRO polypeptide. Examples of small molecules include, but are not limited to, small peptides or peptide-like molecules, preferably soluble peptides, and synthetic non-peptidyl organic or inorganic compounds. [0805] Ribozymes are enzymatic RNA molecules capable of catalyzing the specific cleavage of RNA. Ribozymes act by sequence-specific hybridization to the complementary target RNA, followed by endonucleolytic cleavage. Specific ribozyme cleavage sites within a potential RNA target can be identified by known techniques. For further details see, e.g., Rossi, Current Biology, 4:469-471 (1994), and PCT publication No. WO 97/33551 (published Sep. 18, 1997). [0806] Nucleic acid molecules in triple-helix formation used to inhibit transcription should be single-stranded and composed of deoxynucleotides. The base composition of these oligonucleotides is designed such that it promotes triple-helix formation via Hoogsteen base-pairing rules, which generally require sizeable stretches of purines or pyrimidines on one strand of a duplex. For further details see, e.g., PCT publication No. WO 97/33551, supra. [0807] These small molecules can be identified by any one or more of the screening assays discussed hereinabove and/or by any other screening techniques well known for those skilled in the art. [0808] Diagnostic and therapeutic uses of the herein disclosed molecules may also be based upon the positive functional assay hits disclosed and described below. [0809] F. Anti-PRO Antibodies [0810] The present invention further provides anti-PRO antibodies. Exemplary antibodies include polyclonal, monoclonal, humanized, bispecific, and heteroconjugate antibodies. [0811] 1. Polyclonal Antibodies [0812] The anti-PRO antibodies may comprise polyclonal antibodies. Methods of preparing polyclonal antibodies are known to the skilled artisan. Polyclonal antibodies can be raised in a mammal, for example, by one or more injections of an immunizing agent and, if desired, an adjuvant. Typically, the immunizing agent and/or adjuvant will be injected in the mammal by multiple subcutaneous or intraperitoneal injections. The immunizing agent may include the PRO polypeptide or a fusion protein thereof. It may be useful to conjugate the immunizing agent to a protein known to be immunogenic in the mammal being immunized. Examples of such immunogenic proteins include but are not limited to keyhole limpet hemocyanin, serum albumin, bovine thyroglobulin, and soybean trypsin inhibitor. Examples of adjuvants which may be employed include Freund's complete adjuvant and MPL-TDM adjuvant (monophosphoryl Lipid A, synthetic trehalose dicorynomycolate). The immunization protocol may be selected by one skilled in the art without undue experimentation. [0813] 2. Monoclonal Antibodies [0814] The anti-PRO antibodies may, alternatively, be monoclonal antibodies. Monoclonal antibodies may be prepared using hybridoma methods, such as those described by Kohler and Milstein, Nature, 256:495 (1975). In a hybridoma method, a mouse, hamster, or other appropriate host animal, is typically immunized with an immunizing agent to elicit lymphocytes that produce or are capable of producing antibodies that will specifically bind to the immunizing agent. Alternatively, the lymphocytes may be immunized in vitro. [0815] The immunizing agent will typically include the PRO polypeptide or a fusion protein thereof. Generally, either peripheral blood lymphocytes (“PBLs”) are used if cells of human origin are desired, or spleen cells or lymph node cells are used if non-human mammalian sources are desired. The lymphocytes are then fused with an immortalized cell line using a suitable fusing agent, such as polyethylene glycol, to form a hybridoma cell [Goding, Monoclonal Antibodies: Principles and Practice, Academic Press, (1986) pp.59-103]. Immortalized cell lines are usually transformed mammalian cells, particularly myeloma cells of rodent, bovine and human origin. Usually, rat or mouse myeloma cell lines are employed. The hybridoma cells may be cultured in a suitable culture medium that preferably contains one or more substances that inhibit the growth or survival of the unfused, immortalized cells. For example, if the parental cells lack the enzyme hypoxanthine guanine phosphoribosyl transferase (HGPRT or HPRT), the culture medium for the hybridomas typically will include hypoxanthine, aminopterin, and thymidine (“HAT medium”), which substances prevent the growth of HGPRT-deficient cells. [0816] Preferred immortalized cell lines are those that fuse efficiently, support stable high level expression of antibody by the selected antibody-producing cells, and are sensitive to a medium such as HAT medium. More preferred immortalized cell lines are murine myeloma lines, which can be obtained, for instance, from the Salk Institute Cell Distribution Center, San Diego, Calif. and the American Type Culture Collection, Manassas, Va. Human myeloma and mouse-human heteromyeloma cell lines also have been described for the production of human monoclonal antibodies [Kozbor, J. Immunol. 133:3001 (1984); Brodeur et al., Monoclonal Antibody Production Techniques and Applications, Marcel Dekker, Inc., New York, (1987) pp. 51-63]. [0817] The culture medium in which the hybridoma cells are cultured can then be assayed for the presence of monoclonal antibodies directed against PRO. Preferably, the binding specificity of monoclonal antibodies produced by the hybridoma cells is determined by immunoprecipitation or by an in vitro binding assay, such as radioimmunoassay (RIA) or enzyme-linked immunoabsorbent assay (ELISA). Such techniques and assays are known in the art. The binding affinity of the monoclonal antibody can, for example, be determined by the Scatchard analysis of Munson and Pollard, Anal. Biochem., 107:220 (1980). [0818] After the desired hybridoma cells are identified, the clones may be subcloned by limiting dilution procedures and grown by standard methods [Goding, supra]. Suitable culture media for this purpose include, for example, Dulbecco's Modified Eagle's Medium and RPMI-1640 medium. Alternatively, the hybridoma cells may be grown in vivo as ascites in a mammal. [0819] The monoclonal antibodies secreted by the subclones may be isolated or purified from the culture medium or ascites fluid by conventional immunoglobulin purification procedures such as, for example, protein A-Sepharose, hydroxylapatite chromatography, gel electrophoresis, dialysis, or affinity chromatography. [0820] The monoclonal antibodies may also be made by recombinant DNA methods, such as those described in U.S. Pat. No. 4,816,567. DNA encoding the monoclonal antibodies of the invention can be readily isolated and sequenced using conventional procedures (e.g., by using oligonucleotide probes that are capable of binding specifically to genes encoding the heavy and light chains of murine antibodies). The hybridoma cells of the invention serve as a preferred source of such DNA. Once isolated, the DNA may be placed into expression vectors, which are then transfected into host cells such as simian COS cells, Chinese hamster ovary (CHO) cells, or myeloma cells that do not otherwise produce immunoglobulin protein, to obtain the synthesis of monoclonal antibodies in the recombinant host cells. The DNA also may be modified, for example, by substituting the coding sequence for human heavy and light chain constant domains in place of the homologous murine sequences [U.S. Pat. No. 4,816,567; Morrison et al., supra] or by covalently joining to the immunoglobulin coding sequence all or part of the coding sequence for a non-immunoglobulin polypeptide. Such a non-immunoglobulin polypeptide can be substituted for the constant domains of an antibody of the invention, or can be substituted for the variable domains of one antigen-combining site of an antibody of the invention to create a chimeric bivalent antibody. [0821] The antibodies may be monovalent antibodies. Methods for preparing monovalent antibodies are well known in the art. For example, one method involves recombinant expression of immunoglobulin light chain and modified heavy chain. The heavy chain is truncated generally at any point in the Fc region so as to prevent heavy chain crosslinking. Alternatively, the relevant cysteine residues are substituted with another amino acid residue or are deleted so as to prevent crosslinking. [0822] In vitro methods are also suitable for preparing monovalent antibodies. Digestion of antibodies to produce fragments thereof, particularly, Fab fragments, can be accomplished using routine techniques known in the art. [0823] 3. Human and Humanized Antibodies [0824] The anti-PRO antibodies of the invention may further comprise humanized antibodies or human antibodies. Humanized forms of non-human (e.g., murine) antibodies are chimeric immunoglobulins, immunoglobulin chains or fragments thereof (such as Fv, Fab, Fab′, F(ab′)2 or other antigen-binding subsequences of antibodies) which contain minimal sequence derived from non-human immunoglobulin. Humanized antibodies include human immunoglobulins (recipient antibody) in which residues from a complementary determining region (CDR) of the recipient are replaced by residues from a CDR of a non-human species (donor antibody) such as mouse, rat or rabbit having the desired specificity, affinity and capacity. In some instances, Fv framework residues of the human immunoglobulin are replaced by corresponding non-human residues. Humanized antibodies may also comprise residues which are found neither in the recipient antibody nor in the imported CDR or framework sequences. In general, the humanized antibody will comprise substantially all of at least one, and typically two, variable domains, in which all or substantially all of the CDR regions correspond to those of a non-human immunoglobulin and all or substantially all of the FR regions are those of a human immunoglobulin consensus sequence. The humanized antibody optimally also will comprise at least a portion of an immunoglobulin constant region (Fc), typically that of a human immunoglobulin [Jones et al., Nature, 321:522-525 (1986); Riechmann et al., Nature 332:323-329 (1988); and Presta, Curr. Op. Struct. Biol 2:593-596 (1992)]. [0825] Methods for humanizing non-human antibodies are well known in the art. Generally, a humanized antibody has one or more amino acid residues introduced into it from a source which is non-human. These non-human amino acid residues are often referred to as “import” residues, which are typically taken from an “import” variable domain. Humanization can be essentially performed following the method of Winter and co-workers [Jones et al., Nature, 321:522-525 (1986); Riechmann et al., Nature 332:323-327 (1988); Verhoeyen et al., Science, 239:1534-1536 (1988)], by substituting rodent CDRs or CDR sequences for the corresponding sequences of a human antibody. Accordingly, such “humanized” antibodies are chimeric antibodies (U.S. Pat. No. 4,816,567), wherein substantially less than an intact human variable domain has been substituted by the corresponding sequence from a non-human species. In practice, humanized antibodies are typically human antibodies in which some CDR residues and possibly some FR residues are substituted by residues from analogous sites in rodent antibodies. [0826] Human antibodies can also be produced using various techniques known in the art, including phage display libraries [Hoogenboom and Winter, J. Mol. Biol. 227:381 (1991); Marks et al., J. Mol. Biol., 222:581 (1991)]. The techniques of Cole et al. and Boerner et al. are also available for the preparation of human monoclonal antibodies (Cole et al., Monoclonal Antibodies and Cancer Therapy, Alan R. Liss, p.77 (1985) and Boerner et al., J. Immunol., 147(1):86-95 (1991)]. Similarly, human antibodies can be made by introducing of human immunoglobulin loci into transgenic animals, e.g., mice in which the endogenous immunoglobulin genes have been partially or completely inactivated. Upon challenge, human antibody production is observed, which closely resembles that seen in humans in all respects, including gene rearrangement, assembly, and antibody repertoire. This approach is described, for example, in U.S. Pat. Nos. 5,545,807; 5,545,806; 5,569,825; 5,625,126; 5,633,425; 5,661,016, and in the following scientific publications: Marks et al., Bio/Technology 10, 779-783 (1992); Lonberg et al, Nature 368 856-859 (1994); Morrison, Nature 368, 812-13 (1994); Fishwild et al., Nature Biotechnology 14, 845-51 (1996); Neuberger, Nature Biotechnology 14, 826 (1996); Lonberg and Huszar, Intern. Rev. Immunol. 13 65-93 (1995). [0827] The antibodies may also be affinity matured using known selection and/or mutagenesis methods as described above. Preferred affinity matured antibodies have an affinity which is five times, more preferably 10 times, even more preferably 20 or 30 times greater than the starting antibody (generally murine, humanized or human) from which the matured antibody is prepared. [0828] 4. Bispecific Antibodies [0829] Bispecific antibodies are monoclonal, preferably human or humanized, antibodies that have binding specificities for at least two different antigens. In the present case, one of the binding specificities is for the PRO, the other one is for any other antigen, and preferably for a cell-surface protein or receptor or receptor subunit. [0830] Methods for making bispecific antibodies are known in the art. Traditionally, the recombinant production of bispecific antibodies is based on the co-expression of two immunoglobulin heavy-chain/light-chain pairs, where the two heavy chains have different specificities [Milstein and Cuello, Nature, 305:537-539 (1983)]. Because of the random assortment of immunoglobulin heavy and light chains, these hybridomas (quadromas) produce a potential mixture of ten different antibody molecules, of which only one has the correct bispecific structure. The purification of the correct molecule is usually accomplished by affinity chromatography steps. Similar procedures are disclosed in WO 93/08829, published May 13, 1993, and in Traunecker et al., EMBO J., 10:3655-3659 (1991). [0831] Antibody variable domains with the desired binding specificities (antibody-antigen combining sites) can be fused to immunoglobulin constant domain sequences. The fusion preferably is with an immunoglobulin heavy-chain constant domain, comprising at least part of the hinge, CH2, and CH3 regions. It is preferred to have the first heavy-chain constant region (CH1) containing the site necessary for light-chain binding present in at least one of the fusions. DNAs encoding the immunoglobulin heavy-chain fusions and, if desired, the immunoglobulin light chain, are inserted into separate expression vectors, and are co-transfected into a suitable host organism. For further details of generating bispecific antibodies see, for example, Suresh et al., Methods in Enzymology, 121:210 (1986). [0832] According to another approach described in WO 96/27011, the interface between a pair of antibody molecules can be engineered to maximize the percentage of heterodimers which are recovered from recombinant cell culture. The preferred interface comprises at least a part of the CH3 region of an antibody constant domain. In this method, one or more small amino acid side chains from the interface of the first antibody molecule are replaced with larger side chains (e.g. tyrosine or tryptophan). Compensatory “cavities” of identical or similar size to the large side chain(s) are created on the interface of the second antibody molecule by replacing large amino acid side chains with smaller ones (e.g. alanine or threonine). This provides a mechanism for increasing the yield of the heterodimer over other unwanted end-products such as homodimers. [0833] Bispecific antibodies can be prepared as full length antibodies or antibody fragments (e.g. F(ab′)2 bispecific antibodies). Techniques for generating bispecific antibodies from antibody fragments have been described in the literature. For example, bispecific antibodies can be prepared can be prepared using chemical linkage. Brennan et al., Science 229:81 (1985) describe a procedure wherein intact antibodies are proteolytically cleaved to generate F(ab′)2 fragments. These fragments are reduced in the presence of the dithiol complexing agent sodium arsenite to stabilize vicinal dithiols and prevent intermolecular disulfide formation. The Fab′ fragments generated are then converted to thionitrobenzoate (TNB) derivatives. One of the Fab′-TNB derivatives is then reconverted to the Fab′-thiol by reduction with mercaptoethylamine and is mixed with an equimolar amount of the other Fab′-TNB derivative to form the bispecific antibody. The bispecific antibodies produced can be used as agents for the selective immobilization of enzymes. [0834] Fab′ fragments may be directly recovered from E. coli and chemically coupled to form bispecific antibodies. Shalaby et al., J. Exp. Med. 175:217-225 (1992) describe the production of a fully humanized bispecific antibody F(ab′)2 molecule. Each Fab′ fragment was separately secreted from E. coli and subjected to directed chemical coupling in vitro to form the bispecific antibody. The bispecific antibody thus formed was able to bind to cells overexpressing the ErbB2 receptor and normal human T cells, as well as trigger the lytic activity of human cytotoxic lymphocytes against human breast tumor targets. [0835] Various technique for making and isolating bispecific antibody fragments directly from recombinant cell culture have also been described. For example, bispecific antibodies have been produced using leucine zippers. Kostelny et al., J. Immunol. 148(5):1547-1553 (1992). The leucine zipper peptides from the Fos and Jun proteins were linked to the Fab′ portions of two different antibodies by gene fusion. The antibody homodimers were reduced at the hinge region to form monomers and then re-oxidized to form the antibody heterodimers. This method can also be utilized for the production of antibody homodimers. The “diabody” technology described by Hollinger et al., Proc. Natl. Acad. Sci. USA 90:6444-6448 (1993) has provided an alternative mechanism for making bispecific antibody fragments. The fragments comprise a heavy-chain variable domain (VH) connected to a light-chain variable domain (VL) by a linker which is too short to allow pairing between the two domains on the same chain. Accordingly, the VH and VL domains of one fragment are forced to pair with the complementary VL and VH domains of another fragment, thereby forming two antigen-binding sites. Another strategy for making bispecific antibody fragments by the use of single-chain Fv (sFv) dimers has also been reported. See, Gruber et al., J. Immunol. 152:5368 (1994). Antibodies with more than two valencies are contemplated. For example, trispecific antibodies can be prepared. Tutt et al., J. Immunol. 147:60 (1991). [0836] Exemplary bispecific antibodies may bind to two different epitopes on a given PRO polypeptide herein. Alternatively, an anti-PRO polypeptide arm may be combined with an arm which binds to a triggering molecule on a leukocyte such as a T-cell receptor molecule (e.g. CD2, CD3, CD28, or B7), or Fc receptors for IgG (FcγR), such as FcγRI (CD64), FcγRII (CD32) and FcγRIII (CD16) so as to focus cellular defense mechanisms to the cell expressing the particular PRO polypeptide. Bispecific antibodies may also be used to localize cytotoxic agents to cells which express a particular PRO polypeptide. These antibodies possess a PRO-binding arm and an arm which binds a cytotoxic agent or a radionuclide chelator, such as EOTUBE, DPTA, DOTA, or TETA. Another bispecific antibody of interest binds the PRO polypeptide and further binds tissue factor (TF). [0837] 5. Heteroconjugate Antibodies [0838] Heteroconjugate antibodies are also within the scope of the present invention. Heteroconjugate antibodies are composed of two covalently joined antibodies. Such antibodies have, for example, been proposed to target immune system cells to unwanted cells [U.S. Pat. No.4,676,980], and for treatment of HIV infection [WO 91/00360; WO 92/200373; EP 03089]. It is contemplated that the antibodies may be prepared in vitro using known methods in synthetic protein chemistry, including those involving crosslinking agents. For example, immunotoxins may be constructed using a disulfide exchange reaction or by forming a thioether bond. Examples of suitable reagents for this purpose include iminothiolate and methyl-4-mercaptobutyrimidate and those disclosed, for example, in U.S. Pat. No. 4,676,980. [0839] 6. Effector Function Engineering [0840] It may be desirable to modify the antibody of the invention with respect to effector function, so as to enhance, e.g., the effectiveness of the antibody in treating cancer. For example, cysteine residue(s) may be introduced into the Fc region, thereby allowing interchain disulfide bond formation in this region. The homodimeric antibody thus generated may have improved internalization capability and/or increased complement-mediated cell killing and antibody-dependent cellular cytotoxicity (ADCC). See Caron et al, J. Exp Med., 176:1191-1195 (1992) and Shopes, J. Immunol., 148:2918-2922 (1992). Homodimeric antibodies with enhanced anti-tumor activity may also be prepared using heterobifunctional cross-linkers as described in Wolff et al. Cancer Research, 53:2560-2565 (1993). Alternatively, an antibody can be engineered that has dual Fc regions and may thereby have enhanced complement lysis and ADCC capabilities. See Stevenson et al., Anti-Cancer Drug Design. 3:219-230 (1989). [0841] 7. Immunoconjugates [0842] The invention also pertains to immunoconjugates comprising an antibody conjugated to a cytotoxic agent such as a chemotherapeutic agent, toxin (e.g., an enzymatically active toxin of bacterial, fungal, plant, or animal origin, or fragments thereof), or a radioactive isotope (i.e., a radioconjugate). [0843] Chemotherapeutic agents useful in the generation of such immunoconjugates have been described above. Enzymatically active toxins and fragments thereof that can be used include diphtheria A chain, nonbinding active fragments of diphtheria toxin, exotoxin A chain (from Pseudomonas aeruginosa), ricin A chain, abrin A chain, modeccin A chain, alpha-sarcin, Aleurites fordii proteins, dianthin proteins, Phytolaca americana proteins (PAPI, PAPII, and PAP-S), momordica charantia inhibitor, curcin, crotin, sapaonaria officinalis inhibitor, gelonin, mitogellin, restrictocin, phenomycin, enomycin, and the tricothecenes. A variety of radionuclides are available for the production of radioconjugated antibodies. Examples include 212Bi, 131I, 131In, 90Y and 186Re. Conjugates of the antibody and cytotoxic agent are made using a variety of bifunctional protein-coupling agents such as N-succinimidyl-3-(2-pyridyldithiol) propionate (SPDP), iminothiolane (IT), bifunctional derivatives of imidoesters (such as dimethyl adipimidate HCL), active esters (such as disuccinimidyl suberate), aldehydes (such as glutareldehyde), bis-azido compounds (such as bis (p-azidobenzoyl) hexanediamine), bis-diazoniumderivatives (such as bis-(p-diazoniumbenzoyl)-ethylenediamine), diisocyanates (such as tolyene 2,6-diisocyanate), and bis-active fluorine compounds (such as 1,5-difluoro-2,4-dinitrobenzene). For example, a ricin immunotoxin can be prepared as described in Vitetta et al., Science 238: 1098 (1987). Carbon-14-labeled 1-isothiocyanatobenzyl-3-methyldiethylene triaminepentaacetic acid (MX-DTPA) is an exemplary chelating agent for conjugation of radionucleotide to the antibody. See WO94/11026. [0844] In another embodiment, the antibody may be conjugated to a “receptor” (such streptavidin) for utilization in tumor pretargeting wherein the antibody-receptor conjugate is administered to the patient, followed by removal of unbound conjugate from the circulation using a clearing agent and then administration of a “ligand” (e.g., avidin) that is conjugated to a cytotoxic agent (e.g., a radionucleotide). [0845] 8. Immunoliposomes [0846] The antibodies disclosed herein may also be formulated as immunoliposomes. Liposomes containing the antibody are prepared by methods known in the art, such as described in Epstein et al., Proc. Natl. Acad. Sci. USA, 82:3688 (1985); Hwang et al., Proc. Natl. Acad. Sci. USA, 77:4030 (1980); and U.S. Pat. Nos. 4,485,045 and 4,544,545. Liposomes with enhanced circulation time are disclosed in U.S. Pat. No. 5,013,556. [0847] Particularly useful liposomes can be generated by the reverse-phase evaporation method with a lipid composition comprising phosphatidylcholine, cholesterol, and PEG-derivatized phosphatidylethanolamine (PEG-PE). Liposomes are extruded through filters of defined pore size to yield liposomes with the desired diameter. Fab′ fragments of the antibody of the present invention can be conjugated to the liposomes as described in Martin et al., J. Biol. Chem., 257:286-288 (1982) via a disulfide-interchange reaction. A chemotherapeutic agent (such as Doxorubicin) is optionally contained within the liposome. See Gabizon et al., J. National Cancer Inst., 81(19):1484 (1989). [0848] 9. Pharmaceutical Compositions of Antibodies [0849] Antibodies specifically binding a PRO polypeptide identified herein, as well as other molecules identified by the screening assays disclosed hereinbefore, can be administered for the treatment of various disorders in the form of pharmaceutical compositions. [0850] If the PRO polypeptide is intracellular and whole antibodies are used as inhibitors, internalizing antibodies are preferred. However, lipofections or liposomes can also be used to deliver the antibody, or an antibody fragment, into cells. Where antibody fragments are used, the smallest inhibitory fragment that specifically binds to the binding domain of the target protein is preferred. For example, based upon the variable-region sequences of an antibody, peptide molecules can be designed that retain the ability to bind the target protein sequence. Such peptides can be synthesized chemically and/or produced by recombinant DNA technology. See, e.g., Marasco et al., Proc. Natl. Acad. Sci. USA, 90:7889-7893 (1993). The formulation herein may also contain more than one active compound as necessary for the particular indication being treated, preferably those with complementary activities that do not adversely affect each other. Alternatively, or in addition, the composition may comprise an agent that enhances its function, such as, for example, a cytotoxic agent, cytokine, chemotherapeutic agent, or growth-inhibitory agent. Such molecules are suitably present in combination in amounts that are effective for the purpose intended. [0851] The active ingredients may also be entrapped in microcapsules prepared, for example, by coacervation techniques or by interfacial polymerization, for example, hydroxymethylcellulose or gelatin-microcapsules and poly-(methylmethacylate) microcapsules, respectively, in colloidal drug delivery systems (for example, liposomes, albumin microspheres, microemulsions, nano-particles, and nanocapsules) or in macroemulsions. Such techniques are disclosed in Remington's Pharmaceutical Sciences, supra. [0852] The formulations to be used for in vivo administration must be sterile. This is readily accomplished by filtration through sterile filtration membranes. [0853] Sustained-release preparations may be prepared. Suitable examples of sustained-release preparations include semipermeable matrices of solid hydrophobic polymers containing the antibody, which matrices are in the form of shaped articles, e.g., films, or microcapsules. Examples of sustained-release matrices include polyesters, hydrogels (for example, poly(2-hydroxyethyl-methacrylate), or poly(vinylalcohol)), polylactides (U.S. Pat. No. 3,773,919), copolymers of L-glutamic acid and γ ethyl-L-glutamate, non-degradable ethylene-vinyl acetate, degradable lactic acid-glycolic acid copolymers such as the LUPRON DEPOT™ (injectable microspheres composed of lactic acid-glycolic acid copolymer and leuprolide acetate), and poly-D-(−)-3-hydroxybutyric acid. While polymers such as ethylene-vinyl acetate and lactic acid-glycolic acid enable release of molecules for over 100 days, certain hydrogels release proteins for shorter time periods. When encapsulated antibodies remain in the body for a long time, they may denature or aggregate as a result of exposure to moisture at 37° C., resulting in a loss of biological activity and possible changes in immunogenicity. Rational strategies can be devised for stabilization depending on the mechanism involved. For example, if the aggregation mechanism is discovered to be intermolecular S—S bond formation through thio-disulfide interchange, stabilization may be achieved by modifying sulfhydryl residues, lyophilizing from acidic solutions, controlling moisture content, using appropriate additives, and developing specific polymer matrix compositions. [0854] G. Uses for Anti-PRO Antibodies [0855] The anti-PRO antibodies of the invention have various utilities. For example, anti-PRO antibodies may be used in diagnostic assays for PRO, e.g., detecting its expression (and in some cases, differential expression) in specific cells, tissues, or serum. Various diagnostic assay techniques known in the art may be used, such as competitive binding assays, direct or indirect sandwich assays and immunoprecipitation assays conducted in either heterogeneous or homogeneous phases [Zola, Monoclonal Antibodies: A Manual of Techniques, CRC Press, Inc. (1987) pp.147-158]. The antibodies used in the diagnostic assays can be labeled with a detectable moiety. The detectable moiety should be capable of producing, either directly or indirectly, a detectable signal. For example, the detectable moiety may be a radioisotope, such as 3H, 14C, 32P, 35S, or 125I, a fluorescent or chemiluminescent compound, such as fluorescein isothiocyanate, rhodamine, or luciferin, or an enzyme, such as alkaline phosphatase, beta-galactosidase or horseradish peroxidase. Any method known in the art for conjugating the antibody to the detectable moiety may be employed, including those methods described by Hunter et al., Nature 144:945 (1962); David et al., Biochemistry, 13:1014 (1974); Pain et al., J. Immunol. Meth., 40:219 (1981); and Nygren, J. Histochem. and Cytochem., 30:407 (1982). [0856] Anti-PRO antibodies also are useful for the affinity purification of PRO from recombinant cell culture or natural sources. In this process, the antibodies against PRO are immobilized on a suitable support, such a Sephadex resin or filter paper, using methods well known in the art. The immobilized antibody then is contacted with a sample containing the PRO to be purified, and thereafter the support is washed with a suitable solvent that will remove substantially all the material in the sample except the PRO, which is bound to the immobilized antibody. Finally, the support is washed with another suitable solvent that will release the PRO from the antibody. [0857] The following examples are offered for illustrative purposes only, and are not intended to limit the scope of the present invention in any way. [0858] All patent and literature references cited in the present specification are hereby incorporated by reference in their entirety. EXAMPLES [0859] Commercially available reagents referred to in the examples were used according to manufacturer's instructions unless otherwise indicated. The source of those cells identified in the following examples, and throughout the specification, by ATCC accession numbers is the American Type Culture Collection, Manassas, Va. Example 1 [0860] Extracellular Domain Homology Screening to Identify Novel Polypeptides and cDNA Encoding Therefor [0861] The extracellular domain (ECD) sequences (including the secretion signal sequence, if any) from about 950 known secreted proteins from the Swiss-Prot public database were used to search EST databases. The EST databases included public databases (e.g., Dayhoff, GenBank), and proprietary databases (e.g. LIFESEQ™, Incyte Pharmaceuticals, Palo Alto, Calif.). The search was performed using the computer program BLAST or BLAST-2 (Altschul et al., Methods in Enzymology, 266:460-480 (1996)) as a comparison of the ECD protein sequences to a 6 frame translation of the EST sequences. Those comparisons with a BLAST score of 70 (or in some cases 90) or greater that did not encode known proteins were clustered and assembled into consensus DNA sequences with the program “phrap” (Phil Green, University of Washington, Seattle, Wash.). [0862] Using this extracellular domain homology screen, consensus DNA sequences were assembled relative to the other identified EST sequences using phrap. In addition, the consensus DNA sequences obtained were often (but not always) extended using repeated cycles of BLAST or BLAST-2 and phrap to extend the consensus sequence as far as possible using the sources of EST sequences discussed above. [0863] Based upon the consensus sequences obtained as described above, oligonucleotides were then synthesized and used to identify by PCR a cDNA library that contained the sequence of interest and for use as probes to isolate a clone of the full-length coding sequence for a PRO polypeptide. Forward and reverse PCR primers generally range from 20 to 30 nucleotides and are often designed to give a PCR product of about 100-1000 bp in length. The probe sequences are typically 40-55 bp in length. In some cases, additional oligonucleotides are synthesized when the consensus sequence is greater than about 1-1.5 kbp. In order to screen several libraries for a full-length clone, DNA from the libraries was screened by PCR amplification, as per Ausubel et al., Current Protocols in Molecular Biology, with the PCR primer pair. A positive library was then used to isolate clones encoding the gene of interest using the probe oligonucleotide and one of the primer pairs. [0864] The cDNA libraries used to isolate the cDNA clones were constructed by standard methods using commercially available reagents such as those from Invitrogen, San Diego, Calif. The cDNA was primed with oligo dT containing a NotI site, linked with blunt to SalI hemikinased adaptors, cleaved with NotI, sized appropriately by gel electrophoresis, and cloned in a defined orientation into a suitable cloning vector (such as pRKB or PRKD; pRK5B is a precursor of pRK5D that does not contain the SfiI site; see, Holmes et al., Science, 253:1278-1280 (1991)) in the unique XhoI and NotI sites. Example 2 [0865] Isolation of cDNA Clones by Amylase Screening [0866] 1. Preparation of Oligo dT Primed cDNA Library [0867] mRNA was isolated from a human tissue of interest using reagents and protocols from Invitrogen, San Diego, Calif. (Fast Track 2). This RNA was used to generate an oligo dT primed cDNA library in the vector pRK5D using reagents and protocols from Life Technologies, Gaithersburg, Md. (Super Script Plasmid System). In this procedure, the double stranded cDNA was sized to greater than 1000 bp and the SalI/NotI linkered cDNA was cloned into XhoI/NotI cleaved vector. pRK5D is a cloning vector that has an sp6 transcription initiation site followed by an SfiI restriction enzyme site preceding the XhoI/NotI cDNA cloning sites. [0868] 2. Preparation of Random Primed cDNA Library [0869] A secondary cDNA library was generated in order to preferentially represent the 5′ ends of the primary cDNA clones. Sp6 RNA was generated from the primary library (described above), and this RNA was used to generate a random primed cDNA library in the vector pSST-AMY.0 using reagents and protocols from Life Technologies (Super Script Plasmid System, referenced above). In this procedure the double stranded cDNA was sized to 500-1000 bp, linkered with blunt to NotI adaptors, cleaved with SfiI, and cloned into SfiI/NotI cleaved vector. pSST-AMY.0 is a cloning vector that has a yeast alcohol dehydrogenase promoter preceding the cDNA cloning sites and the mouse amylase sequence (the mature sequence without the secretion signal) followed by the yeast alcohol dehydrogenase terminator, after the cloning sites. Thus, cDNAs cloned into this vector that are fused in frame with amylase sequence will lead to the secretion of amylase from appropriately transfected yeast colonies. [0870] 3. Transformation and Detection [0871] DNA from the library described in paragraph 2 above was chilled on ice to which was added electrocompetent DH10B bacteria (Life Technologies, 20 ml). The bacteria and vector mixture was then electroporated as recommended by the manufacturer. Subsequently, SOC media (Life Technologies,1 ml) was added and the mixture was incubated at 37° C. for 30 minutes. The transformants were then plated onto 20 standard 150 mm LB plates containing ampicillin and incubated for 16 hours (37° C.). Positive colonies were scraped off the plates and the DNA was isolated from the bacterial pellet using standard protocols, e.g. CsCl-gradient. The purified DNA was then carried on to the yeast protocols below. [0872] The yeast methods were divided into three categories: (1) Transformation of yeast with the plasmid/cDNA combined vector; (2) Detection and isolation of yeast clones secreting amylase; and (3) PCR amplification of the insert directly from the yeast colony and purification of the DNA for sequencing and further analysis. [0873] The yeast strain used was HD56-5A (ATCC-90785). This strain has the following genotype: MAT alpha, ura3-52, leu2-3, leu2-112, his3-11, his3-15, MAL+, SUC+, GAL+. Preferably, yeast mutants can be employed that have deficient post-translational pathways. Such mutants may have translocation deficient alleles in sec71, sec72, sec62, with truncated sec71 being most preferred. Alternatively, antagonists (including antisense nucleotides and/or ligands) which interfere with the normal operation of these genes, other proteins implicated in this post translation pathway (e.g., SEC61p, SEC72p, SEC62p, SEC63p, TDJ1p or SSA1p-4p) or the complex formation of these proteins may also be preferably employed in combination with the amylase-expressing yeast. [0874] Transformation was performed based on the protocol outlined by Gietz et al., Nucl. Acid. Res., 20:1425 (1992). Transformed cells were then inoculated from agar into YEPD complex media broth (100 ml) and grown overnight at 30° C. The YEPD broth was prepared as described in Kaiser et al., Methods in Yeast Genetics, Cold Spring Harbor Press, Cold Spring Harbor, N.Y., p. 207 (1994). The overnight culture was then diluted to about 2×106 cells/ml (approx. OD600=0.1) into fresh YEPD broth (500 ml) and regrown to 1×107 cells/ml (approx. OD600=0.4-0.5). [0875] The cells were then harvested and prepared for transformation by transfer into GS3 rotor bottles in a Sorval GS3 rotor at 5,000 rpm for 5 minutes, the supernatant discarded, and then resuspended into sterile water, and centrifuged again in 50 ml falcon tubes at 3,500 rpm in a Beckman GS-6KR centrifuge. The supernatant was discarded and the cells were subsequently washed with LiAc/TE (10 ml, 10 mM Tris-HCl, 1 mM EDTA pH 7.5, 100 mM Li2OOCCH3), and resuspended into LiAc/TE (2.5 ml). [0876] Transformation took place by mixing the prepared cells (100 μl) with freshly denatured single stranded salmon testes DNA (Lofstrand Labs, Gaithersburg, Md.) and transforming DNA (1 μg, vol. <10 μl) in microfuge tubes. The mixture was mixed briefly by vortexing, then 40% PEG/TE (600 μl, 40% polyethylene glycol-4000, 10 mM Tris-HCl, 1 mM EDTA, 100 mM Li2OOCCH3, pH 7.5) was added. This mixture was gently mixed and incubated at 30° C. while agitating for 30 minutes. The cells were then heat shocked at 42° C. for 15 minutes, and the reaction vessel centrifuged in a microfuge at 12,000 rpm for 5-10 seconds, decanted and resuspended into TE (500 μl, 10 mM Tris-HCl, 1 mM EDTA pH 7.5) followed by recentrifugation. The cells were then diluted into TE (1 ml) and aliquots (200 μl) were spread onto the selective media previously prepared in 150 mm growth plates (VWR). [0877] Alternatively, instead of multiple small reactions, the transformation was performed using a single, large scale reaction, wherein reagent amounts were scaled up accordingly. [0878] The selective media used was a synthetic complete dextrose agar lacking uracil (SCD-Ura) prepared as described in Kaiser et al., Methods in Yeast Genetics, Cold Spring Harbor Press, Cold Spring Harbor, N.Y., p. 208-210 (1994). Transformants were grown at 30° C. for 2-3 days. [0879] The detection of colonies secreting amylase was performed by including red starch in the selective growth media. Starch was coupled to the red dye (Reactive Red-120, Sigma) as per the procedure described by Biely et al., Anal. Biochem., 172:176-179 (1988). The coupled starch was incorporated into the SCD-Ura agar plates at a final concentration of 0.15% (w/v), and was buffered with potassium phosphate to a pH of 7.0 (50-100 mM final concentration). [0880] The positive colonies were picked and streaked across fresh selective media (onto 150 mm plates) in order to obtain well isolated and identifiable single colonies. Well isolated single colonies positive for amylase secretion were detected by direct incorporation of red starch into buffered SCD-Ura agar. Positive colonies were determined by their ability to break down starch resulting in a clear halo around the positive colony visualized directly. [0881] 4. Isolation of DNA by PCR Amplification [0882] When a positive colony was isolated, a portion of it was picked by a toothpick and diluted into sterile water (30 μl) in a 96 well plate. At this time, the positive colonies were either frozen and stored for subsequent analysis or immediately amplified. An aliquot of cells (5 μl) was used as a template for the PCR reaction in a 25 μl volume containing: 0.5 μl Klentaq (Clontech, Palo Alto, Calif.); 4.0 μl 10 mM dNTP's (Perkin Elmer-Cetus); 2.5 μl Kentaq buffer (Clontech); 0.25 μl forward oligo 1; 0.25 μl reverse oligo 2; 12.5 μl distilled water. The sequence of the forward oligonucleotide 1 was: [0883] 5′-TGTAAAACGACGGCCAGTTAAATAGACCTGCAATTATTAATCT-3′ (SEQ ID NO: 611) [0884] The sequence of reverse oligonucleotide 2 was: [0885] 5′-CAGGAAACAGCTATGACCACCTGCACACCTGCAAATCCATT-3′ (SEQ ID NO: 612) [0886] PCR was then performed as follows: a. Denature 92° C.,  5 minutes b.  3 cycles of: Denature 92° C., 30 seconds Anneal 59° C., 30 seconds Extend 72° C., 60 seconds c.  3 cycles of: Denature 92° C., 30 seconds Anneal 57° C., 30 seconds Extend 72° C., 60 seconds d. 25 cycles of: Denature 92° C., 30 seconds Anneal 55° C., 30 seconds Extend 72° C., 60 seconds e. Hold  4° C. [0887] The underlined regions of the oligonucleotides annealed to the ADH promoter region and the amylase region, respectively, and amplified a 307 bp region from vector pSST-AMY.0 when no insert was present. Typically, the first 18 nucleotides of the 5′ end of these oligonucleotides contained annealing sites for the sequencing primers. Thus, the total product of the PCR reaction from an empty vector was 343 bp. However, signal sequence-fused cDNA resulted in considerably longer nucleotide sequences. [0888] Following the PCR, an aliquot of the reaction (5 μl) was examined by agarose gel electrophoresis in a 1% agarose gel using a Tris-Borate-EDTA (TBE) buffering system as described by Sambrook et al., supra. Clones resulting in a single strong PCR product larger than 400 bp were further analyzed by DNA sequencing after purification with a 96 Qiaquick PCR clean-up column (Qiagen Inc., Chatsworth, Calif.). Example 3 [0889] Isolation of cDNA Clones Using Signal Algorithm Analysis [0890] Various polypeptide-encoding nucleic acid sequences were identified by applying a proprietary signal sequence finding algorithm developed by Genentech, Inc. (South San Francisco, Calif.) upon ESTs as well as clustered and assembled EST fragments from public (e.g., GenBank) and/or private (LIFESEQ®, Incyte Pharmaceuticals, Inc., Palo Alto, Calif.) databases. The signal sequence algorithm computes a secretion signal score based on the character of the DNA nucleotides surrounding the first and optionally the second methionine codon(s) (ATG) at the 5′-end of the sequence or sequence fragment under consideration. The nucleotides following the first ATG must code for at least 35 unambiguous amino acids without any stop codons. If the first ATG has the required amino acids, the second is not examined. If neither meets the requirement, the candidate sequence is not scored. In order to determine whether the EST sequence contains an authentic signal sequence, the DNA and corresponding amino acid sequences surrounding the ATG codon are scored using a set of seven sensors (evaluation parameters) known to be associated with secretion signals. Use of this algorithm resulted in the identification of numerous polypeptide-encoding nucleic acid sequences. Example 4 [0891] Isolation of cDNA Clones Encoding Human PRO Polypeptides [0892] Using the techniques described in Examples 1 to 3 above, numerous full-length cDNA clones were identified as encoding PRO polypeptides as disclosed herein. These cDNAs were then deposited under the terms of the Budapest Treaty with the American Type Culture Collection, 10801 University Blvd., Manassas, Va. 20110-2209, USA (ATCC) as shown in Table 7 below. TABLE 7 Material ATCC Dep. No. Deposit Date DNA16435-1208 209930 Jun. 2, 1998 DNA23318-1211 209787 Apr. 21, 1998 DNA23322-1393 203400 Oct. 27, 1998 DNA23334-1392 209918 Jun. 2, 1998 DNA26843-1389 203099 Aug. 4, 1998 DNA26844-1394 209926 Jun. 2, 1998 DNA30867-1335 209807 Apr. 28, 1998 DNA33470-1175 209398 Oct. 17, 1997 DNA34436-1238 209523 Dec. 10, 1997 DNA35557-1137 209255 Sep. 16, 1997 DNA35599-1168 209373 Oct. 16, 1997 DNA35668-1171 209371 Oct. 16, 1997 DNA36992-1168 209382 Oct. 16, 1997 DNA39423-1182 209387 Oct. 17, 1997 DNA39427-1179 209395 Oct. 17, 1997 DNA39510-1181 209392 Oct. 17, 1997 DNA39518-1247 209529 Dec. 10, 1997 DNA39975-1210 209783 Apr. 21, 1998 DNA39976-1215 209524 Dec. 10, 1997 DNA39979-1213 209789 Apr. 21, 1998 DNA40594-1233 209617 Feb. 5, 1998 DNA40603-1232 209486 Nov. 21, 1997 DNA40604-1187 209394 Oct. 17, 1997 DNA40625-1189 209788 Apr. 21, 1998 DNA41225-1217 209491 Nov. 21, 1997 DNA41379-1236 209488 Nov. 21, 1997 DNA41386-1316 209703 Mar. 26, 1998 DNA44161-1434 209907 May 27, 1998 DNA44179-1362 209851 May 6, 1998 DNA44192-1246 209531 Dec. 10, 1997 DNA44694-1500 203114 Aug. 11, 1998 DNA45234-1277 209654 Mar. 5, 1998 DNA45409-2511 203579 Jan. 12, 1999 DNA45415-1318 209810 Apr. 28, 1998 DNA45417-1432 209910 May 27, 1998 DNA45493-1349 209805 Apr. 28, 1998 DNA46776-1284 209721 Mar. 31, 1998 DNA48296-1292 209668 Mar. 11, 1998 DNA48306-1291 209911 May 27, 1998 DNA48328-1355 209843 May 6, 1998 DNA48329-1290 209785 Apr. 21, 1998 DNA48334-1435 209924 Jun. 2, 1998 DNA49141-1431 203003 Jun. 23, 1998 DNA49624-1279 209655 Mar. 5, 1998 DNA49647-1398 209919 Jun. 2, 1998 DNA49819-1439 209931 Jun. 2, 1998 DNA50911-1288 209714 Mar. 31, 1998 DNA50914-1289 209722 Mar. 31, 1998 DNA50919-1361 209848 May 6, 1998 DNA50980-1286 209717 Mar. 31, 1998 DNA52185-1370 209861 May 14, 1998 DNA53906-1368 209747 Apr. 7, 1998 DNA53912-1457 209870 May 14, 1998 DNA53913-1490 203162 Aug. 25, 1998 DNA53977-1371 209862 May 14, 1998 DNA53978-1443 209983 Jun. 16, 1998 DNA53996-1442 209921 Jun. 2, 1998 DNA54002-1367 209754 Apr. 7, 1998 DNA55737-1345 209753 Apr. 7, 1998 DNA56050-1455 203011 Jun. 23, 1998 DNA56052-1454 203026 Jun. 23, 1998 DNA56107-1415 203405 Oct. 27, 1998 DNA56110-1437 203113 Aug. 11, 1998 DNA56406-1704 203478 Nov. 17, 1998 DNA56409-1377 209882 May 20, 1998 DNA56410-1414 209923 Jun. 2, 1998 DNA56436-1448 209902 May 27, 1998 DNA56529-1647 203293 Sep. 29, 1998 DNA56855-1447 203004 Jun. 23, 1998 DNA56859-1445 203019 Jun. 23, 1998 DNA56860-1510 209952 Jun. 9, 1998 DNA56865-1491 203022 Jun. 23, 1998 DNA56868-1478 203024 Jun. 23, 1998 DNA56869-1545 203161 Aug. 25, 1998 DNA56870-1492 209925 Jun. 2, 1998 DNA57039-1402 209777 Apr. 14, 1998 DNA57253-1382 209867 May 14, 1998 DNA57254-1477 203289 Sep. 29, 1998 DNA57699-1412 203020 Jun. 23, 1998 DNA57704-1452 209953 Jun. 9, 1998 DNA57710-1451 203048 Jul. 1, 1998 DNA57827-1493 203045 Jul. 1, 1998 DNA57844-1410 203010 Jun. 23, 1998 DNA58723-1588 203133 Aug. 18, 1998 DNA58727-1474 203171 Sep. 1, 1998 DNA58730-1607 203221 Sep. 15, 1998 DNA58732-1650 203290 Sep. 29, 1998 DNA58737-1473 203136 Aug. 18, 1998 DNA58743-1609 203154 Aug. 25, 1998 DNA58747-1384 209868 May 14, 1998 DNA58828-1519 203172 Sep. 1, 1998 DNA58846-1409 209957 Jun. 9, 1998 DNA58848-1472 209955 Jun. 9, 1998 DNA58849-1494 209958 Jun. 9, 1998 DNA58850-1495 209956 Jun. 9, 1998 DNA58852-1637 203271 Sep. 22, 1998 DNA58853-1423 203016 Jun. 23, 1998 DNA58855-1422 203018 Jun. 23, 1998 DNA59211-1450 209960 Jun. 9, 1998 DNA59212-1627 203245 Sep. 9, 1998 DNA59213-1487 209959 Jun. 9, 1998 DNA59219-1613 203220 Sep. 15, 1998 DNA59497-1496 209941 Jun. 4, 1998 DNA59602-1436 203051 Jul. 1, 1998 DNA59603-1419 209944 Jun. 9, 1998 DNA59605-1418 203005 Jun. 23, 1998 DNA59607-1497 209946 Jun. 9, 1998 DNA59610-1556 209990 Jun. 16, 1998 DNA59612-1466 209947 Jun. 9, 1998 DNA59613-1417 203007 Jun. 23, 1998 DNA59616-1465 209991 Jun. 16, 1998 DNA59619-1464 203041 Jul. 1, 1998 DNA59625-1498 209992 Jun. 16, 1998 DNA59817-1703 203470 Nov. 17, 1998 DNA59827-1426 203089 Aug. 4, 1998 DNA59828-1608 203158 Aug. 25, 1998 DNA59837-2545 203658 Feb. 9, 1999 DNA59844-2542 203650 Feb. 9, 1999 DNA59853-1505 209985 Jun. 16, 1998 DNA59854-1459 209974 Jun. 16, 1998 DNA59855-1485 209987 Jun. 16, 1998 DNA60278-1530 203170 Sep. 1, 1998 DNA60283-1484 203043 Jul. 1, 1998 DNA60608-1577 203126 Aug. 18, 1998 DNA60611-1524 203175 Sep. 1, 1998 DNA60619-1482 209993 Jun. 16, 1998 DNA60625-1507 209975 Jun. 16, 1998 DNA60629-1481 209979 Jun. 16, 1998 DNA60740-1615 203456 Nov. 3, 1998 DNA61608-1606 203239 Sep. 9, 1998 DNA61755-1554 203112 Aug. 11, 1998 DNA62809-1531 203237 Sep. 9, 1998 DNA62812-1594 203248 Sep. 9, 1998 DNA62813-2544 203655 Feb. 9, 1999 DNA62845-1684 203361 Oct. 20, 1998 DNA64849-1604 203468 Nov. 17, 1998 DNA64852-1589 203127 Aug. 18, 1998 DNA64863-1573 203251 Sep. 9, 1998 DNA64881-1602 203240 Sep. 9, 1998 DNA64902-1667 203317 Oct. 6, 1998 DNA64952-1568 203222 Sep. 15, 1998 DNA65403-1565 203230 Sep. 15, 1998 DNA65413-1534 203234 Sep. 15, 1998 DNA65423-1595 203227 Sep. 15, 1998 DNA66304-1546 203321 Oct. 6, 1998 DNA66308-1537 203159 Aug. 25, 1998 DNA66511-1563 203228 Sep. 15, 1998 DNA66512-1564 203218 Sep. 15, 1998 DNA66519-1535 203236 Sep. 15, 1998 DNA66521-1583 203225 Sep. 15, 1998 DNA66658-1584 203229 Sep. 15, 1998 DNA66660-1585 203279 Sep. 22, 1998 DNA66669-1597 203272 Sep. 22, 1998 DNA66674-1599 203281 Sep. 22, 1998 DNA68836-1656 203455 Nov. 3, 1998 DNA68862-2546 203652 Feb. 9, 1999 DNA68866-1644 203283 Sep. 22, 1998 DNA68869-1610 203164 Aug. 25, 1998 DNA68871-1638 203280 Sep. 22, 1998 DNA68879-1631 203274 Sep. 22, 1998 DNA68880-1676 203319 Oct. 6, 1998 DNA68882-1677 203318 Oct. 6, 1998 DNA68883-1691 203535 Dec. 15, 1998 DNA68885-1678 203311 Oct. 6, 1998 DNA71180-1655 203403 Oct. 27, 1998 DNA71184-1634 203266 Sep. 22, 1998 DNA71213-1659 203401 Oct. 27, 1998 DNA71234-1651 203402 Oct. 27, 1998 DNA71269-1621 203284 Sep. 22, 1998 DNA71277-1636 203285 Sep. 22, 1998 DNA71286-1687 203357 Oct. 20, 1998 DNA71883-1660 203475 Nov. 17, 1998 DNA73401-1633 203273 Sep. 22, 1998 DNA73492-1671 203324 Oct. 6, 1998 DNA73730-1679 203320 Oct. 6, 1998 DNA73734-1680 203363 Oct. 20, 1998 DNA73735-1681 203356 Oct. 20, 1998 DNA73742-1662 203316 Oct. 6, 1998 DNA73746-1654 203411 Oct. 27, 1998 DNA73760-1672 203314 Oct. 6, 1998 DNA76393-1664 203323 Oct. 6, 1998 DNA76398-1699 203474 Nov. 17, 1998 DNA76399-1700 203472 Nov. 17, 1998 DNA76522-2500 203469 Nov. 17, 1998 DNA76533-1689 203410 Oct. 27, 1998 DNA77303-2502 203479 Nov. 17, 1998 DNA77626-1705 203536 Dec. 15, 1998 DNA77648-1688 203408 Oct. 27, 1998 DNA81754-2532 203542 Dec. 15, 1998 DNA81757-2512 203543 Dec. 15, 1998 DNA82302-2529 203534 Dec. 15, 1998 DNA82340-2530 203547 Dec. 22, 1998 DNA87991-2540 203656 Feb. 9, 1999 DNA92238-2539 203602 Jan. 20, 1999 DNA115291-2681 PTA-202 Jun. 8, 1999 DNA23336-2861 PTA-1673 Apr. 11, 2000 DNA30862-1396 209920 Jun. 2, 1998 DNA30871-1157 209380 Oct. 16, 1997 DNA32279-1131 209259 Sep. 16, 1997 DNA33206-1165 209372 Oct. 16, 1997 DNA35673-1201 209418 Oct. 28, 1997 DNA47361-1154-2 209431 Nov. 7, 1997 DNA49631-1328 209806 Apr. 28, 1998 DNA52594-1270 209679 Mar. 17, 1998 DNA55800-1263 209680 Mar. 17, 1998 DNA56531-1648 203286 Sep. 29, 1998 DNA56965-1356 209842 May 6, 1998 DNA57037-1444 209903 May 27, 1998 DNA57695-1340 203006 Jun. 23, 1998 DNA57834-1339 209954 Jun. 9, 1998 DNA57841-1522 203458 Nov. 3, 1998 DNA58847-1383 209879 May 20, 1998 DNA59493-1420 203050 Jul. 1, 1998 DNA59586-1520 203288 Sep. 29, 1998 DNA59608-2577 203870 Mar. 23, 1999 DNA59849-1504 209986 Jun. 16, 1998 DNA60292-1506 203540 Dec. 15, 1998 DNA62377-1381-1 203552 Dec. 22, 1998 DNA62880-1513 203097 Aug. 4, 1998 DNA66672-1586 203265 Sep. 22, 1998 DNA67962-1649 203291 Sep. 29, 1998 DNA69555-2867 PTA-1632 Apr. 4, 2000 DNA71162-2764 PTA-860 Oct. 19, 1999 DNA71290-1630 203275 Sep. 22, 1998 DNA76401-1683 203360 Oct. 20, 1998 DNA76541-1675 203409 Oct. 27, 1998 DNA76788-2526 203551 Dec. 22, 1998 DNA77623-2524 203546 Dec. 22, 1998 DNA80136-2503 203541 Dec. 15, 1998 DNA83568-2692 PTA-386 Jul. 20, 1999 DNA84210-2576 203818 Mar. 2, 1999 DNA86576-2595 203868 Mar. 23, 1999 DNA87976-2593 203888 Mar. 30, 1999 DNA92256-2596 203891 Mar. 30, 1999 DNA92289-2598 PTA-131 May 25, 1999 DNA96850-2705 PTA-479 Aug. 3, 1999 DNA96855-2629 PTA-18 May 4, 1999 DNA96857-2636 PTA-17 May 4, 1999 DNA96860-2700 PTA-478 Aug. 3, 1999 DNA96861-2844 PTA-1436 Mar. 2, 2000 DNA96866-2698 PTA-491 Aug. 3, 1999 DNA96870-2676 PTA-254 Jun. 22, 1999 DNA96872-2674 PTA-550 Aug. 17, 1999 DNA96878-2626 PTA-23 May 4, 1999 DNA96879-2619 203967 Apr. 27, 1999 DNA96889-2641 PTA-119 May 25, 1999 DNA96893-2621 PTA-12 May 4, 1999 DNA96897-2688 PTA-379 Jul. 20, 1999 DNA98564-2643 PTA-125 May 25, 1999 DNA107443-2718 PTA-490 Aug. 3, 1999 DNA107786-2723 PTA-474 Aug. 3, 1999 DNA108682-2712 PTA-486 Aug. 3, 1999 DNA108684-2761 PTA-653 Sep. 14, 1999 DNA108701-2749 PTA-554 Aug. 17, 1999 DNA108720-2717 PTA-511 Aug. 10, 1999 DNA108726-2729 PTA-514 Aug. 10, 1999 DNA108728-2760 PTA-654 Sep. 14, 1999 DNA108738-2767 PTA-862 Oct. 19, 1999 DNA108743-2722 PTA-508 Aug. 10, 1999 DNA108758-2759 PTA-655 Sep. 14, 1999 DNA108765-2758 PTA-657 Sep. 14, 1999 DNA108783-2747 PTA-616 Aug. 31, 1999 DNA108789-2748 PTA-547 Aug. 17, 1999 DNA108806-2724 PTA-610 Aug. 31, 1999 DNA108936-2719 PTA-519 Aug. 10, 1999 DNA119510-2771 PTA-947 Nov. 9, 1999 DNA119517-2778 PTA-951 Nov. 16, 1999 DNA119535-2756 PTA-613 Aug. 31, 1999 DNA119537-2777 PTA-956 Nov. 16, 1999 DNA119714-2851 PTA-1537 Mar. 21, 2000 DNA125170-2780 PTA-953 Nov. 16, 1999 DNA129594-2841 PTA-1481 Mar. 14, 2000 DNA129793-2857 PTA-1733 Apr. 18, 2000 DNA130809-2769 PTA-949 Nov. 9, 1999 DNA131639-2874 PTA-1784 Apr. 25, 2000 DNA131649-2855 PTA-1482 Mar. 14, 2000 DNA131652-2876 PTA-1628 Apr. 4, 2000 DNA131658-2875 PTA-1671 Apr. 11, 2000 DNA132162-2770 PTA-950 Nov. 9, 1999 DNA136110-2763 PTA-652 Sep. 14, 1999 DNA139592-2866 PTA-1587 Mar. 28, 2000 DNA139608-2856 PTA-1581 Mar. 28, 2000 DNA143292-2848 PTA-1778 Apr. 25, 2000 DNA144844-2843 PTA-1536 Mar. 21, 2000 DNA144857-2845 PTA-1589 Mar. 28, 2000 DNA145841-2868 PTA-1678 Apr. 11, 2000 DNA148004-2882 PTA-1779 Apr. 25, 2000 DNA149893-2873 PTA-1672 Apr. 11, 2000 DNA149930-2884 PTA-1668 Apr. 11, 2000 DNA150157-2898 PTA-1777 Apr. 25, 2000 DNA150163-2842 PTA-1533 Mar. 21, 2000 DNA153579-2894 PTA-1729 Apr. 18, 2000 DNA164625-2890 PTA-1535 Mar. 21, 2000 DNA57838-1337 203014 Jun. 23, 1998 DNA59777-1480 203111 Aug. 11, 1998 DNA66675-1587 203282 Sep. 22, 1998 DNA76532-1702 203473 Nov. 17, 1998 DNA105849-2704 PTA-473 Aug. 3, 1999 DNA83500-2506 203391 Oct. 29, 1998 [0893] These deposits were made under the provisions of the Budapest Treaty on the International Recognition of the Deposit of Microorganisms for the Purpose of Patent Procedure and the Regulations thereunder (Budapest Treaty). This assures maintenance of a viable culture of the deposit for 30 years from the date of deposit. The deposits will be made available by ATCC under the terms of the Budapest Treaty, and subject to an agreement between Genentech, Inc. and ATCC, which assures permanent and unrestricted availability of the progeny of the culture of the deposit to the public upon issuance of the pertinent U.S. patent or upon laying open to the public of any U.S. or foreign patent application, whichever comes first, and assures availability of the progeny to one determined by the U.S. Commissioner of Patents and Trademarks to be entitled thereto according to 35 USC §122 and the Commissioner's rules pursuant thereto (including 37 CFR §1.14 with particular reference to 886 OG 638). [0894] The assignee of the present application has agreed that if a culture of the materials on deposit should die or be lost or destroyed when cultivated under suitable conditions, the materials will be promptly replaced on notification with another of the same. Availability of the deposited material is not to be construed as a license to practice the invention in contravention of the rights granted under the authority of any government in accordance with its patent laws. Example 5 [0895] Use of PRO as a Hybridization Probe [0896] The following method describes use of a nucleotide sequence encoding PRO as a hybridization probe. [0897] DNA comprising the coding sequence of full-length or mature PRO as disclosed herein is employed as a probe to screen for homologous DNAs (such as those encoding naturally-occurring variants of PRO) in human tissue cDNA libraries or human tissue genomic libraries. [0898] Hybridization and washing of filters containing either library DNAs is performed under the following high stringency conditions. Hybridization of radiolabeled PRO-derived probe to the filters is performed in a solution of 50% formamide, 5×SSC, 0.1% SDS, 0.1% sodium pyrophosphate, 50 mM sodium phosphate, pH 6.8, 2× Denhardt's solution, and 10% dextran sulfate at 42° C. for 20 hours. Washing of the filters is performed in an aqueous solution of 0.1×SSC and 0.1% SDS at42° C. [0899] DNAs having a desired sequence identity with the DNA encoding full-length native sequence PRO can then be identified using standard techniques known in the art. Example 6 [0900] Expression of PRO in E. coli [0901] This example illustrates preparation of an unglycosylated form of PRO by recombinant expression in E. coli. [0902] The DNA sequence encoding PRO is initially amplified using selected PCR primers. The primers should contain restriction enzyme sites which correspond to the restriction enzyme sites on the selected expression vector. A variety of expression vectors may be employed. An example of a suitable vector is pBR322 (derived from E. coli; see Bolivar et al., Gene, 2:95 (1977)) which contains genes for ampicillin and tetracycline resistance. The vector is digested with restriction enzyme and dephosphorylated. The PCR amplified sequences are then ligated into the vector. The vector will preferably include sequences which encode for an antibiotic resistance gene, a trp promoter, a polyhis leader (including the first six STII codons, polyhis sequence, and enterokinase cleavage site), the PRO coding region, lambda transcriptional terminator, and an argU gene. [0903] The ligation mixture is then used to transform a selected E. coli strain using the methods described in Sambrook et al., supra. Transformants are identified by their ability to grow on LB plates and antibiotic resistant colonies are then selected. Plasmid DNA can be isolated and confirmed by restriction analysis and DNA sequencing. [0904] Selected clones can be grown overnight in liquid culture medium such as LB broth supplemented with antibiotics. The overnight culture may subsequently be used to inoculate a larger scale culture. The cells are then grown to a desired optical density, during which the expression promoter is turned on. [0905] After culturing the cells for several more hours, the cells can be harvested by centrifugation. The cell pellet obtained by the centrifugation can be solubilized using various agents known in the art, and the solubilized PRO protein can then be purified using a metal chelating column under conditions that allow tight binding of the protein. [0906] PRO may be expressed in E. coli in a poly-His tagged form, using the following procedure. The DNA encoding PRO is initially amplified using selected PCR primers. The primers will contain restriction enzyme sites which correspond to the restriction enzyme sites on the selected expression vector, and other useful sequences providing for efficient and reliable translation initiation, rapid purification on a metal chelation column, and proteolytic removal with enterokinase. The PCR-amplified, poly-His tagged sequences are then ligated into an expression vector, which is used to transform an E. coli host based on strain 52 (W3110 fuhA(tonA) lon galE rpoHts(htpRts) clpP(lacIq). Transformants are first grown in LB containing 50 mg/ml carbenicillin at 30° C. with shaking until an O.D.600 of 3-5 is reached. Cultures are then diluted 50-100 fold into CRAP media (prepared by mixing 3.57 g (NH4)2SO4, 0.71 g sodium citrate·2H2O, 1.07 g KCl, 5.36 g Difco yeast extract, 5.36 g Sheffield hycase SF in 500 mL water, as well as 110 mM MPOS, pH 7.3, 0.55% (w/v) glucose and 7 mM MgSO4) and grown for approximately 20-30 hours at 30° C. with shaking. Samples are removed to verify expression by SDS-PAGE analysis, and the bulk culture is centrifuged to pellet the cells. Cell pellets are frozen until purification and refolding. [0907]E. coli paste from 0.5 to 1 L fermentations (6-10 g pellets) is resuspended in 10 volumes (w/v) in 7 M guanidine, 20 mM Tris, pH 8 buffer. Solid sodium sulfite and sodium tetrathionate is added to make final concentrations of 0.1M and 0.02 M, respectively, and the solution is stirred overnight at 4° C. This step results in a denatured protein with all cysteine residues blocked by sulfitolization. The solution is centrifuged at 40,000 rpm in a Beckman Ultracentifuge for 30 min. The supernatant is diluted with 3-5 volumes of metal chelate column buffer (6 M guanidine, 20 mM Tris, pH 7.4) and filtered through 0.22 micron filters to clarify. The clarified extract is loaded onto a 5 ml Qiagen Ni-NTA metal chelate column equilibrated in the metal chelate column buffer. The column is washed with additional buffer containing 50 mM imidazole (Calbiochem, Utrol grade), pH 7.4. The protein is eluted with buffer containing 250 mM imidazole. Fractions containing the desired protein are pooled and stored at 4° C. Protein concentration is estimated by its absorbance at 280 nm using the calculated extinction coefficient based on its amino acid sequence. [0908] The proteins are refolded by diluting the sample slowly into freshly prepared refolding buffer consisting of: 20 mM Tris, pH 8.6, 0.3 M NaCl, 2.5 M urea, 5 mM cysteine, 20 mM glycine and 1 mM EDTA. Refolding volumes are chosen so that the final protein concentration is between 50 to 100 micrograms/ml. The refolding solution is stirred gently at 4° C. for 12-36 hours. The refolding reaction is quenched by the addition of TFA to a final concentration of 0.4% (pH of approximately 3). Before further purification of the protein, the solution is filtered through a 0.22 micron filter and acetonitrile is added to 2-10% final concentration. The refolded protein is chromatographed on a Poros R1/H reversed phase column using a mobile buffer of 0.1% TFA with elution with a gradient of acetonitrile from 10 to 80%. Aliquots of fractions with A280 absorbance are analyzed on SDS polyacrylamide gels and fractions containing homogeneous refolded protein are pooled. Generally, the properly refolded species of most proteins are eluted at the lowest concentrations of acetonitrile since those species are the most compact with their hydrophobic interiors shielded from interaction with the reversed phase resin. Aggregated species are usually eluted at higher acetonitrile concentrations. In addition to resolving misfolded forms of proteins from the desired form, the reversed phase step also removes endotoxin from the samples. [0909] Fractions containing the desired folded PRO polypeptide are pooled and the acetonitrile removed using a gentle stream of nitrogen directed at the solution. Proteins are formulated into 20 mM Hepes, pH 6.8 with 0.14 M sodium chloride and 4% mannitol by dialysis or by gel filtration using G25 Superfine (Pharmacia) resins equilibrated in the formulation buffer and sterile filtered. [0910] Many of the PRO polypeptides disclosed herein were successfully expressed as described above. Example 7 [0911] Expression of PRO in Mammalian Cells [0912] This example illustrates preparation of a potentially glycosylated form of PRO by recombinant expression in mammalian cells. [0913] The vector, pRK5 (see EP 307,247, published Mar. 15, 1989), is employed as the expression vector. Optionally, the PRO DNA is ligated into pRK5 with selected restriction enzymes to allow insertion of the PRO DNA using ligation methods such as described in Sambrook et al., supra. The resulting vector is called pRK5-PRO. [0914] In one embodiment, the selected host cells may be 293 cells. Human 293 cells (ATCC CCL 1573) are grown to confluence in tissue culture plates in medium such as DMEM supplemented with fetal calf serum and optionally, nutrient components and/or antibiotics. About 10 μg pRK5-PRO DNA is mixed with about 1 μg DNA encoding the VA RNA gene [Thimmappaya et al., Cell, 31:543 (1982)] and dissolved in 500 μl of 1 mM Tris-HCl, 0.1 mM EDTA, 0.227 M CaCl2. To this mixture is added, dropwise, 500 μl of 50 mM HEPES (pH 7.35), 280 mM NaCl, 1.5 mM NaPO4, and a precipitate is allowed to form for 10 minutes at 25° C. The precipitate is suspended and added to the 293 cells and allowed to settle for about four hours at 37° C. The culture medium is aspirated off and 2 ml of 20% glycerol in PBS is added for 30 seconds. The 293 cells are then washed with serum free medium, fresh medium is added and the cells are incubated for about 5 days. [0915] Approximately 24 hours after the transfections, the culture medium is removed and replaced with culture medium (alone) or culture medium containing 200 μCi/ml 35S-cysteine and 200 μCi/ml 35S-methionine. After a 12 hour incubation, the conditioned medium is collected, concentrated on a spin filter, and loaded onto a 15% SDS gel. The processed gel may be dried and exposed to film for a selected period of time to reveal the presence of PRO polypeptide. The cultures containing transfected cells may undergo further incubation (in serum free medium) and the medium is tested in selected bioassays. [0916] In an alternative technique, PRO may be introduced into 293 cells transiently using the dextran sulfate method described by Somparyrac et al., Proc. Natl. Acad. Sci., 12:7575 (1981). 293 cells are grown to maximal density in a spinner flask and 700 μg pRK5-PRO DNA is added. The cells are first concentrated from the spinner flask by centrifugation and washed with PBS. The DNA-dextran precipitate is incubated on the cell pellet for four hours. The cells are treated with 20% glycerol for 90 seconds, washed with tissue culture medium, and re-introduced into the spinner flask containing tissue culture medium, 5 μg/ml bovine insulin and 0.1 μg/ml bovine transferrin. After about four days, the conditioned media is centrifuged and filtered to remove cells and debris. The sample containing expressed PRO can then be concentrated and purified by any selected method, such as dialysis and/or column chromatography. [0917] In another embodiment, PRO can be expressed in CHO cells. The pRK5-PRO can be transfected into CHO cells using known reagents such as CaPO4 or DEAE-dextran. As described above, the cell cultures can be incubated, and the medium replaced with culture medium (alone) or medium containing a radiolabel such as 35S-methionine. After determining the presence of PRO polypeptide, the culture medium may be replaced with serum free medium. Preferably, the cultures are incubated for about 6 days, and then the conditioned medium is harvested. The medium containing the expressed PRO can then be concentrated and purified by any selected method. [0918] Epitope-tagged PRO may also be expressed in host CHO cells. The PRO may be subcloned out of the pRK5 vector. The subclone insert can undergo PCR to fuse in frame with a selected epitope tag such as a poly-his tag into a Baculovirus expression vector. The poly-his tagged PRO insert can then be subcloned into a SV40 driven vector containing a selection marker such as DHFR for selection of stable clones. Finally, the CHO cells can be transfected (as described above) with the SV40 driven vector. Labeling may be performed, as described above, to verify expression. The culture medium containing the expressed poly-His tagged PRO can then be concentrated and purified by any selected method, such as by Ni2+-chelate affinity chromatography. [0919] PRO may also be expressed in CHO and/or COS cells by a transient expression procedure or in CHO cells by another stable expression procedure. [0920] Stable expression in CHO cells is performed using the following procedure. The proteins are expressed as an IgG construct (immunoadhesin), in which the coding sequences for the soluble forms (e.g. extracellular domains) of the respective proteins are fused to an IgG1 constant region sequence containing the hinge, CH2 and CH2 domains and/or is a poly-His tagged form. [0921] Following PCR amplification, the respective DNAs are subcloned in a CHO expression vector using standard techniques as described in Ausubel et al., Current Protocols of Molecular Biology, Unit 3.16, John Wiley and Sons (1997). CHO expression vectors are constructed to have compatible restriction sites 5′ and 3′ of the DNA of interest to allow the convenient shuttling of cDNA's. The vector used expression in CHO cells is as described in Lucas et al., Nucl. Acids Res. 24:9 (1774-1779 (1996), and uses the SV40 early promoter/enhancer to drive expression of the cDNA of interest and dihydrofolate reductase (DHFR). DHFR expression permits selection for stable maintenance of the plasmid following transfection. [0922] Twelve micrograms of the desired plasmid DNA is introduced into approximately 10 million CHO cells using commercially available transfection reagents Superfect® (Qiagen), Dosper® or Fugene® (Boehringer Mannheim). The cells are grown as described in Lucas et al., supra. Approximately 3×107 cells are frozen in an ampule for further growth and production as described below. [0923] The ampules containing the plasmid DNA are thawed by placement into water bath and mixed by vortexing. The contents are pipetted into a centrifuge tube containing 10 mLs of media and centrifuged at 1000 rpm for 5 minutes. The supernatant is aspirated and the cells are resuspended in 10 mL of selective media (0.2 μm filtered PS20 with 5% 0.2 μm diafiltered fetal bovine serum). The cells are then aliquoted into a 100 mL spinner containing 90 mL of selective media. After 1-2 days, the cells are transferred into a 250 mL spinner filled with 150 mL selective growth medium and incubated at 37° C. After another 2-3 days, 250 mL, 500 mL and 2000 mL spinners are seeded with 3×105 cells/mL. The cell media is exchanged with fresh media by centrifugation and resuspension in production medium. Although any suitable CHO media may be employed, a production medium described in U.S. Pat. No. 5,122,469, issued Jun. 16, 1992 may actually be used. A 3L production spinner is seeded at 1.2×106 cells/mL. On day 0, the cell number pH ie determined. On day 1, the spinner is sampled and sparging with filtered air is commenced. On day 2, the spinner is sampled, the temperature shifted to 33° C., and 30 mL of 500 g/L glucose and 0.6 mL of 10% antifoam (e.g., 35% polydimethylsiloxane emulsion, Dow Corning 365 Medical Grade Emulsion) taken. Throughout the production, the pH is adjusted as necessary to keep it at around 7.2. After 10 days, or until the viability dropped below 70%, the cell culture is harvested by centrifugation and filtering through a 0.22 μm filter. The filtrate was either stored at 4° C. or immediately loaded onto columns for purification. [0924] For the poly-His tagged constructs, the proteins are purified using a Ni-NTA column (Qiagen). Before purification, imidazole is added to the conditioned media to a concentration of 5 mM. The conditioned media is pumped onto a 6 ml Ni-NTA column equilibrated in 20 mM Hepes, pH 7.4, buffer containing 0.3 M NaCl and 5 mM imidazole at a flow rate of 4-5 ml/min. at 4° C. After loading, the column is washed with additional equilibration buffer and the protein eluted with equilibration buffer containing 0.25 M imidazole. The highly purified protein is subsequently desalted into a storage buffer containing 10 mM Hepes, 0.14 M NaCl and 4% mannitol, pH 6.8, with a 25 ml G25 Superfine (Pharmacia) column and stored at −80° C. [0925] Immunoadhesin (Fc-containing) constructs are purified from the conditioned media as follows. The conditioned medium is pumped onto a 5 ml Protein A column (Pharmacia) which had been equilibrated in 20 mM Na phosphate buffer, pH 6.8. After loading, the column is washed extensively with equilibration buffer before elution with 100 mM citric acid, pH 3.5. The eluted protein is immediately neutralized by collecting 1 ml fractions into tubes containing 275 μL of 1 M Tris buffer, pH 9. The highly purified protein is subsequently desalted into storage buffer as described above for the poly-His tagged proteins. The homogeneity is assessed by SDS polyacrylamide gels and by N-terminal amino acid sequencing by Edman degradation. [0926] Many of the PRO polypeptides disclosed herein were successfully expressed as described above. Example 8 [0927] Expression of PRO in Yeast [0928] The following method describes recombinant expression of PRO in yeast. [0929] First, yeast expression vectors are constructed for intracellular production or secretion of PRO from the ADH2/GAPDH promoter. DNA encoding PRO and the promoter is inserted into suitable restriction enzyme sites in the selected plasmid to direct intracellular expression of PRO. For secretion, DNA encoding PRO can be cloned into the selected plasmid, together with DNA encoding the ADH2/GAPDH promoter, a native PRO signal peptide or other mammalian signal peptide, or, for example, a yeast alpha-factor or invertase secretory signal/leader sequence, and linker sequences (if needed) for expression of PRO. [0930] Yeast cells, such as yeast strain AB110, can then be transformed with the expression plasmids described above and cultured in selected fermentation media. The transformed yeast supernatants can be analyzed by precipitation with 10% trichloroacetic acid and separation by SDS-PAGE, followed by staining of the gels with Coomassie Blue stain. [0931] Recombinant PRO can subsequently be isolated and purified by removing the yeast cells from the fermentation medium by centrifugation and then concentrating the medium using selected cartridge filters. The concentrate containing PRO may further be purified using selected column chromatography resins. [0932] Many of the PRO polypeptides disclosed herein were successfully expressed as described above. Example 9 [0933] Expression of PRO in Baculovirus-Infected Insect Cells [0934] The following method describes recombinant expression of PRO in Baculovirus-infected insect cells. [0935] The sequence coding for PRO is fused upstream of an epitope tag contained within a baculovirus expression vector. Such epitope tags include poly-his tags and immunoglobulin tags (like Fc regions of IgG). A variety of plasmids may be employed, including plasmids derived from commercially available plasmids such as pVL1393 (Novagen). Briefly, the sequence encoding PRO or the desired portion of the coding sequence of PRO such as the sequence encoding the extracellular domain of a transmembrane protein or the sequence encoding the mature protein if the protein is extracellular is amplified by PCR with primers complementary to the 5′ and 3′ regions. The 5′ primer may incorporate flanking (selected) restriction enzyme sites. The product is then digested with those selected restriction enzymes and subcloned into the expression vector. [0936] Recombinant baculovirus is generated by co-transfecting the above plasmid and BaculoGold™ virus DNA (Pharmingen) into Spodoptera frugiperda (“Sf9”) cells (ATCC CRL 1711) using lipofectin (commercially available from GIBCO-BRL). After 4-5 days of incubation at 28° C., the released viruses are harvested and used for further amplifications. Viral infection and protein expression are performed as described by O'Reilley et al., Baculovirus expression vectors: A Laboratory Manual, Oxford: Oxford University Press (1994). [0937] Expressed poly-his tagged PRO can then be purified, for example, by Ni2+-chelate affinity chromatography as follows. Extracts are prepared from recombinant virus-infected Sf9 cells as described by Rupert et al., Nature, 362:175-179 (1993). Briefly, Sf9 cells are washed, resuspended in sonication buffer (25 mL Hepes, pH 7.9; 12.5 mM MgCl2; 0.1 mM EDTA; 10% glycerol; 0.1% NP-40; 0.4 M KCl), and sonicated twice for 20 seconds on ice. The sonicates are cleared by centrifugation, and the supernatant is diluted 50-fold in loading buffer (50 mM phosphate, 300 mM NaCl, 10% glycerol, pH 7.8) and filtered through a 0.45 μm filter. A Ni2+-NTA agarose column (commercially available from Qiagen) is prepared with a bed volume of 5 mL, washed with 25 mL of water and equilibrated with 25 mL of loading buffer. The filtered cell extract is loaded onto the column at 0.5 mL per minute. The column is washed to baseline A280 with loading buffer, at which point fraction collection is started. Next, the column is washed with a secondary wash buffer (50 mM phosphate; 300 mM NaCl, 10% glycerol, pH 6.0), which elutes nonspecifically bound protein. After reaching A280 baseline again, the column is developed with a 0 to 500 mM Imidazole gradient in the secondary wash buffer. One mL fractions are collected and analyzed by SDS-PAGE and silver staining or Western blot with Ni2+-NTA-conjugated to alkaline phosphatase (Qiagen). Fractions containing the eluted His10-tagged PRO are pooled and dialyzed against loading buffer. [0938] Alternatively, purification of the IgG tagged (or Fc tagged) PRO can be performed using known chromatography techniques, including for instance, Protein A or protein G column chromatography. [0939] Many of the PRO polypeptides disclosed herein were successfully expressed as described above. Example 10 [0940] Preparation of Antibodies that Bind PRO [0941] This example illustrates preparation of monoclonal antibodies which can specifically bind PRO. [0942] Techniques for producing the monoclonal antibodies are known in the art and are described, for instance, in Goding, supra. Immunogens that may be employed include purified PRO, fusion proteins containing PRO, and cells expressing recombinant PRO on the cell surface. Selection of the immunogen can be made by the skilled artisan without undue experimentation. [0943] Mice, such as Balb/c, are immunized with the PRO immunogen emulsified in complete Freund's adjuvant and injected subcutaneously or intraperitoneally in an amount from 1-100 micrograms. Alternatively, the immunogen is emulsified in MPL-TDM adjuvant (Ribi Immunochemical Research, Hamilton, Mont.) and injected into the animal's hind foot pads. The immunized mice are then boosted 10 to 12 days later with additional immunogen emulsified in the selected adjuvant. Thereafter, for several weeks, the mice may also be boosted with additional immunization injections. Serum samples may be periodically obtained from the mice by retro-orbital bleeding for testing in ELISA assays to detect anti-PRO antibodies. [0944] After a suitable antibody titer has been detected, the animals “positive” for antibodies can be injected with a final intravenous injection of PRO. Three to four days later, the mice are sacrificed and the spleen cells are harvested. The spleen cells are then fused (using 35% polyethylene glycol) to a selected murine myeloma cell line such as P3×63AgU.1, available from ATCC, No. CRL 1597. The fusions generate hybridoma cells which can then be plated in 96 well tissue culture plates containing HAT (hypoxanthine, aminopterin, and thymidine) medium to inhibit proliferation of non-fused cells, myeloma hybrids, and spleen cell hybrids. [0945] The hybridoma cells will be screened in an ELISA for reactivity against PRO. Determination of “positive” hybridoma cells secreting the desired monoclonal antibodies against PRO is within the skill in the art. [0946] The positive hybridoma cells can be injected intraperitoneally into syngeneic Balb/c mice to produce ascites containing the anti-PRO monoclonal antibodies. Alternatively, the hybridoma cells can be grown in tissue culture flasks or roller bottles. Purification of the monoclonal antibodies produced in the ascites can be accomplished using ammonium sulfate precipitation, followed by gel exclusion chromatography. Alternatively, affinity chromatography based upon binding of antibody to protein A or protein G can be employed. Example 11 [0947] Purification of PRO Polypeptides Using Specific Antibodies [0948] Native or recombinant PRO polypeptides may be purified by a variety of standard techniques in the art of protein purification. For example, pro-PRO polypeptide, mature PRO polypeptide, or pre-PRO polypeptide is purified by immunoaffinity chromatography using antibodies specific for the PRO polypeptide of interest. In general, an immunoaffinity column is constructed by covalently coupling the anti-PRO polypeptide antibody to an activated chromatographic resin. [0949] Polyclonal immunoglobulins are prepared from immune sera either by precipitation with ammonium sulfate or by purification on immobilized Protein A (Pharmacia LKB Biotechnology, Piscataway, N.J.). Likewise, monoclonal antibodies are prepared from mouse ascites fluid by ammonium sulfate precipitation or chromatography on immobilized Protein A. Partially purified immunoglobulin is covalently attached to a chromatographic resin such as CnBr-activated SEPHAROSE™ (Pharmacia LKB Biotechnology). The antibody is coupled to the resin, the resin is blocked, and the derivative resin is washed according to the manufacturer's instructions. [0950] Such an immunoaffinity column is utilized in the purification of PRO polypeptide by preparing a fraction from cells containing PRO polypeptide in a soluble form. This preparation is derived by solubilization of the whole cell or of a subcellular fraction obtained via differential centrifugation by the addition of detergent or by other methods well known in the art. Alternatively, soluble PRO polypeptide containing a signal sequence may be secreted in useful quantity into the medium in which the cells are grown. [0951] A soluble PRO polypeptide-containing preparation is passed over the immunoaffinity column, and the column is washed under conditions that allow the preferential absorbance of PRO polypeptide (e.g., high ionic strength buffers in the presence of detergent). Then, the column is eluted under conditions that disrupt antibody/PRO polypeptide binding (e.g., a low pH buffer such as approximately pH 2-3, or a high concentration of a chaotrope such as urea or thiocyanate ion), and PRO polypeptide is collected. Example 12 [0952] Drug Screening [0953] This invention is particularly useful for screening compounds by using PRO polypeptides or binding fragment thereof in any of a variety of drug screening techniques. The PRO polypeptide or fragment employed in such a test may either be free in solution, affixed to a solid support, borne on a cell surface, or located intracellularly. One method of drug screening utilizes eukaryotic or prokaryotic host cells which are stably transformed with recombinant nucleic acids expressing the PRO polypeptide or fragment. Drugs are screened against such transformed cells in competitive binding assays. Such cells, either in viable or fixed form, can be used for standard binding assays. One may measure, for example, the formation of complexes between PRO polypeptide or a fragment and the agent being tested. Alternatively, one can examine the diminution in complex formation between the PRO polypeptide and its target cell or target receptors caused by the agent being tested. [0954] Thus, the present invention provides methods of screening for drugs or any other agents which can affect a PRO polypeptide-associated disease or disorder. These methods comprise contacting such an agent with an PRO polypeptide or fragment thereof and assaying (I) for the presence of a complex between the agent and the PRO polypeptide or fragment, or (ii) for the presence of a complex between the PRO polypeptide or fragment and the cell, by methods well known in the art. In such competitive binding assays, the PRO polypeptide or fragment is typically labeled. After suitable incubation, free PRO polypeptide or fragment is separated from that present in bound form, and the amount of free or uncomplexed label is a measure of the ability of the particular agent to bind to PRO polypeptide or to interfere with the PRO polypeptide/cell complex. [0955] Another technique for drug screening provides high throughput screening for compounds having suitable binding affinity to a polypeptide and is described in detail in WO 84/03564, published on Sep. 13, 1984. Briefly stated, large numbers of different small peptide test compounds are synthesized on a solid substrate, such as plastic pins or some other surface. As applied to a PRO polypeptide, the peptide test compounds are reacted with PRO polypeptide and washed. Bound PRO polypeptide is detected by methods well known in the art. Purified PRO polypeptide can also be coated directly onto plates for use in the aforementioned drug screening techniques. In addition, non-neutralizing antibodies can be used to capture the peptide and immobilize it on the solid support. [0956] This invention also contemplates the use of competitive drug screening assays in which neutralizing antibodies capable of binding PRO polypeptide specifically compete with a test compound for binding to PRO polypeptide or fragments thereof. In this manner, the antibodies can be used to detect the presence of any peptide which shares one or more antigenic determinants with PRO polypeptide. Example 13 [0957] Rational Drug Design [0958] The goal of rational drug design is to produce structural analogs of biologically active polypeptide of interest (i.e., a PRO polypeptide) or of small molecules with which they interact, e.g., agonists, antagonists, or inhibitors. Any of these examples can be used to fashion drugs which are more active or stable forms of the PRO polypeptide or which enhance or interfere with the function of the PRO polypeptide in vivo (c.f., Hodgson, Bio/Technology, 9:19-21 (1991)). [0959] In one approach, the three-dimensional structure of the PRO polypeptide, or of an PRO polypeptide-inhibitor complex, is determined by x-ray crystallography, by computer modeling or, most typically, by a combination of the two approaches. Both the shape and charges of the PRO polypeptide must be ascertained to elucidate the structure and to determine active site(s) of the molecule. Less often, useful information regarding the structure of the PRO polypeptide may be gained by modeling based on the structure of homologous proteins. In both cases, relevant structural information is used to design analogous PRO polypeptide-like molecules or to identify efficient inhibitors. Useful examples of rational drug design may include molecules which have improved activity or stability as shown by Braxton and Wells, Biochemistry, 31:7796-7801 (1992) or which act as inhibitors, agonists, or antagonists of native peptides as shown by Athauda et al., J. Biochem., 113:742-746 (1993). [0960] It is also possible to isolate a target-specific antibody, selected by functional assay, as described above, and then to solve its crystal structure. This approach, in principle, yields a pharmacore upon which subsequent drug design can be based. It is possible to bypass protein crystallography altogether by generating anti-idiotypic antibodies (anti-ids) to a functional, pharmacologically active antibody. As a mirror image of a mirror image, the binding site of the anti-ids would be expected to be an analog of the original receptor. The anti-id could then be used to identify and isolate peptides from banks of chemically or biologically produced peptides. The isolated peptides would then act as the pharmacore. [0961] By virtue of the present invention, sufficient amounts of the PRO polypeptide may be made available to perform such analytical studies as X-ray crystallography. In addition, knowledge of the PRO polypeptide amino acid sequence provided herein will provide guidance to those employing computer modeling techniques in place of or in addition to x-ray crystallography. Example 14 [0962] Identification of PRO Polypeptides that Stimulate TNF-α Release in Human Blood (Assay 128) [0963] This assay shows that certain PRO polypeptides of the present invention act to stimulate the release of TNF-α in human blood. PRO polypeptides testing positive in this assay are useful for, among other things, research purposes where stimulation of the release of TNF-α would be desired and for the therapeutic treatment of conditions wherein enhanced TNF-α release would be beneficial. Specifically, 200 μl of human blood supplemented with 50 mM Hepes buffer (pH 7.2) is aliquoted per well in a 96 well test plate. To each well is then added 300 μl of either the test PRO polypeptide in 50 mM Hepes buffer (at various concentrations) or 50 mM Hepes buffer alone (negative control) and the plates are incubated at 37° C. for 6 hours. The samples are then centrifuged and 50 μl of plasma is collected from each well and tested for the presence of TNF-α by ELISA assay. A positive in the assay is a higher amount of TNF-α in the PRO polypeptide treated samples as compared to the negative control samples. [0964] The following PRO polypeptides tested positive in this assay: [0965] PRO1079, PRO827, PRO791, PRO1131, PRO1316, PRO1183, PRO1343, PRO1760, PRO1567, and PRO4333. Example 15 [0966] Promotion of Chondrocyte Redifferentiation (Assay 129) [0967] This assay is designed to determine whether PRO polypeptides of the present invention show the ability to induce the proliferation and/or redifferentiation of chondrocytes in culture. PRO polypeptides testing positive in this assay would be expected to be useful for the therapeutic treatment of various bone and/or cartilage disorders such as, for example, sports injuries and arthritis. [0968] Porcine chondrocytes are isolated by overnight collagenase digestion of articular cartilage of the metacarpophalangeal joint of 4-6 month old female pigs. The isolated cells are then seeded at 25,000 cells/cm2 in Ham F-12 containing 10% FBS and 4 μg/ml gentamycin. The culture media is changed every third day. On day 12, the cells are seeded in 96 well plates at 5,000 cells/well in 100μl of the same media without serum and 100 μl of either serum-free medium (negative control), staurosporin (final concentration of 5 nM; positive control) or the test PRO polypeptide are added to give a final volume of 200 μ/well. After 5 days at 37° C., 22 μl of media comtaining 100 μg/ml Hoechst 33342 and 50 μg/ml 5-CFDA is added to each well and incubated for an additional 10 minutes at 37° C. A picture of the green fluorescence is taken for each well and the differentiation state of the chondrocytes is calculated by morphometric analysis. A positive result in the assay is obtained when the >50% of the PRO polypeptide treated cells are differentiated (compared to the background obtained by the negative control). [0969] PRO6029 polypeptide tested positive in this assay. Example 16 [0970] Microarray Analysis to Detect Overexpression of PRO Polypeptides in Cancerous Tumors [0971] Nucleic acid microarrays, often containing thousands of gene sequences, are useful for identifying differentially expressed genes in diseased tissues as compared to their normal counterparts. Using nucleic acid microarrays, test and control mRNA samples from test and control tissue samples are reverse transcribed and labeled to generate cDNA probes. The cDNA probes are then hybridized to an array of nucleic acids immobilized on a solid support. The array is configured such that the sequence and position of each member of the array is known. For example, a selection of genes known to be expressed in certain disease states may be arrayed on a solid support. Hybridization of a labeled probe with a particular array member indicates that the sample from which the probe was derived expresses that gene. If the hybridization signal of a probe from a test (disease tissue) sample is greater than hybridization signal of a probe from a control (normal tissue) sample, the gene or genes overexpressed in the disease tissue are identified. The implication of this result is that an overexpressed protein in a diseased tissue is useful not only as a diagnostic marker for the presence of the disease condition, but also as a therapeutic target for treatment of the disease condition. [0972] The methodology of hybridization of nucleic acids and microarray technology is well known in the art. In the present example, the specific preparation of nucleic acids for hybridization and probes, slides, and hybridization conditions are all detailed in U.S. Provisional Patent Application Serial No.60/193,767, filed on Mar. 31, 2000 and which is herein incorporated by reference. [0973] In the present example, cancerous tumors derived from various human tissues were studied for PRO polypeptide-encoding gene expression relative to non-cancerous human tissue in an attempt to identify those PRO polypeptides which are overexpressed in cancerous tumors. Two sets of experimental data were generated. In one set, cancerous human colon tumor tissue and matched non-cancerous human colon tumor tissue from the same patient (“matched colon control”) were obtained and analyzed for PRO polypeptide expression using the above described microarray technology. In the second set of data, cancerous human tumor tissue from any of a variety of different human tumors was obtained and compared to a “universal” epithelial control sample which was prepared by pooling non-cancerous human tissues of epithelial origin, including liver, kidney, and lung. mRNA isolated from the pooled tissues represents a mixture of expressed gene products from these different tissues. Microarray hybridization experiments using the pooled control samples generated a linear plot in a 2-color analysis. The slope of the line generated in a 2-color analysis was then used to normalize the ratios of (test:control detection) within each experiment. The normalized ratios from various experiments were then compared and used to identify clustering of gene expression. Thus, the pooled “universal control” sample not only allowed effective relative gene expression determinations in a simple 2-sample comparison, it also allowed multi-sample comparisons across several experiments. [0974] In the present experiments, nucleic acid probes derived from the herein described PRO polypeptide-encoding nucleic acid sequences were used in the creation of the microarray and RNA from the tumor tissues listed above were used for the hybridization thereto. A value based upon the normalized ratio:experimental ratio was designated as a “cutoff ratio”. Only values that were above this cutoff ratio were determined to be significant. Table 8 below shows the results of these experiments, demonstrating that various PRO polypeptides of the preent invention are significantly overexpressed in various human tumor tissues as compared to a non-cancerous human tissue control. As described above, these data demonstrate that the PRO polypeptides of the present invention are useful not only as diagnostic markers for the presence of one or more cancerous tumors, but also serve as therapeutic targets for the treatment of those tumors. TABLE 8 Molecule is overexpressed in: as compared to: PRO276 lung tumor universal normal control PRO284 colon tumor universal normal control PRO284 lung tumor universal normal control PRO284 breast tumor universal normal control PRO193 colon tumor universal normal control PRO193 lung tumor universal normal control PRO193 breast tumor universal normal control PRO193 prostate tumor universal normal control PRO190 colon tumor universal normal control PRO190 lung tumor universal normal control PRO190 breast tumor universal normal control PRO180 colon tumor universal normal control PRO180 lung tumor universal normal control PRO180 breast tumor universal normal control PRO194 colon tumor universal normal control PRO194 lung tumor universal normal control PRO194 breast tumor universal normal control PRO194 cervical tumor universal normal control PRO218 colon tumor universal normal control PRO218 lung tumor universal normal control PRO260 colon tumor universal normal control PRO260 lung tumor universal normal control PRO260 breast tumor universal normal control PRO260 rectal tumor universal normal control PRO233 colon tumor universal normal control PRO233 lung tumor universal normal control PRO233 breast tumor universal normal control PRO234 colon tumor universal normal control PRO234 lung tumor universal normal control PRO234 breast tumor universal normal control PRO234 liver tumor universal normal control PRO236 colon tumor universal normal control PRO236 lung tumor universal normal control PRO236 breast tumor universal normal control PRO244 colon tumor universal normal control PRO244 lung tumor universal normal control PRO262 colon tumor universal normal control PRO262 lung tumor universal normal control PRO262 breast tumor universal normal control PRO271 colon tumor universal normal control PRO271 lung tumor universal normal control PRO268 colon tumor universal normal control PRO268 lung tumor universal normal control PRO268 breast tumor universal normal control PRO270 colon tumor universal normal control PRO270 lung tumor universal normal control PRO270 breast tumor universal normal control PRO270 liver tumor universal normal control PRO355 lung tumor universal normal control PRO355 breast tumor universal normal control PRO355 prostate tumor universal normal control PRO298 colon tumor universal normal control PRO298 lung tumor universal normal control PRO298 breast tumor universal normal control PRO299 colon tumor universal normal control PRO299 lung tumor universal normal control PRO299 breast tumor universal normal control PRO296 colon tumor universal normal control PRO296 breast tumor universal normal control PRO329 colon tumor universal normal control PRO329 lung tumor universal normal control PRO329 breast tumor universal normal control PRO330 colon tumor universal normal control PRO330 lung tumor universal normal control PRO294 lung tumor universal normal control PRO294 breast tumor universal normal control PRO300 colon tumor universal normal control PRO300 lung tumor universal normal control PRO300 breast tumor universal normal control PRO307 lung tumor universal normal control PRO334 colon tumor universal normal control PRO334 lung tumor universal normal control PRO334 breast tumor universal normal control PRO334 prostate tumor universal normal control PRO352 colon tumor universal normal control PRO352 lung tumor universal normal control PRO352 breast tumor universal normal control PRO352 liver tumor universal normal control PRO710 breast tumor universal normal control PRO873 colon tumor universal normal control PRO873 lung tumor universal normal control PRO873 breast tumor universal normal control PRO873 prostate tumor universal normal control PRO354 colon tumor universal normal control PRO354 lung tumor universal normal control PRO354 breast tumor universal normal control PRO1151 lung tumor universal normal control PRO1151 breast tumor universal normal control PRO382 colon tumor universal normal control PRO382 lung tumor universal normal control PRO382 breast tumor universal normal control PRO1864 lung tumor universal normal control PRO1864 breast tumor universal normal control PRO1864 liver tumor universal normal control PRO386 colon tumor universal normal control PRO386 lung tumor universal normal control PRO386 prostate tumor universal normal control PRO541 colon tumor universal normal control PRO541 lung tumor universal normal control PRO541 breast tumor universal normal control PRO852 breast tumor universal normal control PRO700 colon tumor universal normal control PRO700 lung tumor universal normal control PRO700 breast tumor universal normal control PRO700 rectal tumor universal normal control PRO708 colon tumor universal normal control PRO708 lung tumor universal normal control PRO708 breast tumor universal normal control PRO707 colon tumor universal normal control PRO707 lung tumor universal normal control PRO864 colon tumor universal normal control PRO864 lung tumor universal normal control PRO864 breast tumor universal normal control PRO706 colon tumor universal normal control PRO706 lung tumor universal normal control PRO706 breast tumor universal normal control PRO706 liver tumor universal normal control PRO732 lung tumor universal normal control PRO732 breast tumor universal normal control PRO732 cervical tumor universal normal control PRO537 colon tumor universal normal control PRO537 lung tumor universal normal control PRO537 breast tumor universal normal control PRO545 lung tumor universal normal control PRO545 breast tumor universal normal control PRO718 lung tumor universal normal control PRO718 breast tumor universal normal control PRO872 lung tumor universal normal control PRO872 breast tumor universal normal control PRO872 liver tumor universal normal control PRO704 colon tumor universal normal control PRO704 lung tumor universal normal control PRO704 breast tumor universal normal control PRO705 lung tumor universal normal control PRO705 breast tumor universal normal control PRO871 lung tumor universal normal control PRO871 breast tumor universal normal control PRO871 liver tumor universal normal control PRO702 lung tumor universal normal control PRO944 colon tumor universal normal control PRO944 lung tumor universal normal control PRO944 rectal tumor universal normal control PRO739 lung tumor universal normal control PRO739 breast tumor universal normal control PRO739 prostate tumor universal normal control PRO941 colon tumor universal normal control PRO941 lung tumor universal normal control PRO941 breast tumor universal normal control PRO941 rectal tumor universal normal control PRO1082 lung tumor universal normal control PRO1082 breast tumor universal normal control PRO1133 colon tumor universal normal control PRO1133 lung tumor universal normal control PRO983 colon tumor universal normal control PRO983 lung tumor universal normal control PRO983 breast tumor universal normal control PRO784 colon tumor universal normal control PRO784 lung tumor universal normal control PRO784 breast tumor universal normal control PRO784 prostate tumor universal normal control PRO783 colon tumor universal normal control PRO783 lung tumor universal normal control PRO783 breast tumor universal normal control PRO783 liver tumor universal normal control PRO940 colon tumor universal normal control PRO940 lung tumor universal normal control PRO940 breast tumor universal normal control PRO768 colon tumor universal normal control PRO768 lung tumor universal normal control PRO768 breast tumor universal normal control PRO1079 colon tumor universal normal control PRO1079 lung tumor universal normal control PRO1079 breast tumor universal normal control PRO1079 rectal tumor universal normal control PRO1078 colon tumor universal normal control PRO1078 lung tumor universal normal control PRO1018 colon tumor universal normal control PRO1018 lung tumor universal normal control PRO1018 breast tumor universal normal control PRO793 colon tumor universal normal control PRO793 lung tumor universal normal control PRO793 breast tumor universal normal control PRO793 rectal tumor universal normal control PRO1773 colon tumor universal normal control PRO1773 lung tumor universal normal control PRO1773 prostate tumor universal normal control PRO1014 lung tumor universal normal control PRO1014 breast tumor universal normal control PRO1013 colon tumor universal normal control PRO1013 lung tumor universal normal control PRO1013 breast tumor universal normal control PRO1013 liver tumor universal normal control PRO937 colon tumor universal normal control PRO937 lung tumor universal normal control PRO937 breast tumor universal normal control PRO937 cervical tumor universal normal control PRO937 rectal tumor universal normal control PRO1477 lung tumor universal normal control PRO1477 breast tumor universal normal control PRO1477 rectal tumor universal normal control PRO842 colon tumor universal normal control PRO842 lung tumor universal normal control PRO842 breast tumor universal normal control PRO839 colon tumor universal normal control PRO1180 colon tumor universal normal control PRO1180 lung tumor universal normal control PRO1180 liver tumor universal normal control PRO1134 lung tumor universal normal control PRO1134 breast tumor universal normal control PRO1134 prostate tumor universal normal control PRO1115 colon tumor universal normal control PRO1115 lung tumor universal normal control PRO1115 breast tumor universal normal control PRO1277 colon tumor universal normal control PRO1277 lung tumor universal normal control PRO1135 lung tumor universal normal control PRO1135 breast tumor universal normal control PRO1135 cervical tumor universal normal control PRO827 colon tumor universal normal control PRO827 lung tumor universal normal control PRO827 prostate tumor universal normal control PRO827 cervical tumor universal normal control PRO1057 lung tumor universal normal control PRO1057 breast tumor universal normal control PRO1113 colon tumor universal normal control PRO1113 lung tumor universal normal control PRO1006 colon tumor universal normal control PRO1006 lung tumor universal normal control PRO1006 breast tumor universal normal control PRO1006 rectal tumor universal normal control PRO1074 lung tumor universal normal control PRO1074 rectal tumor universal normal control PRO1073 lung tumor universal normal control PRO1073 breast tumor universal normal control PRO1136 colon tumor universal normal control PRO1136 lung tumor universal normal control PRO1136 breast tumor universal normal control PRO1004 lung tumor universal normal control PRO1344 colon tumor universal normal control PRO1344 lung tumor universal normal control PRO1344 breast tumor universal normal control PRO1344 rectal tumor universal normal control PRO1110 colon tumor universal normal control PRO1110 lung tumor universal normal control PRO1110 breast tumor universal normal control PRO1378 colon tumor universal normal control PRO1378 lung tumor universal normal control PRO1378 prostate tumor universal normal control PRO1378 cervical tumor universal normal control PRO1481 colon tumor universal normal control PRO1481 lung tumor universal normal control PRO1109 lung tumor universal normal control PRO1109 breast tumor universal normal control PRO1383 colon tumor universal normal control PRO1383 lung tumor universal normal control PRO1383 breast tumor universal normal control PRO1072 lung tumor universal normal control PRO1189 colon tumor universal normal control PRO1189 lung tumor universal normal control PRO1189 breast tumor universal normal control PRO1189 prostate tumor universal normal control PRO1003 colon tumor universal normal control PRO1003 lung tumor universal normal control PRO1003 breast tumor universal normal control PRO1003 liver tumor universal normal control PRO1003 rectal tumor universal normal control PRO1108 colon tumor universal normal control PRO1108 lung tumor universal normal control PRO1108 breast tumor universal normal control PRO1137 colon tumor universal normal control PRO1137 lung tumor universal normal control PRO1137 breast tumor universal normal control PRO1138 colon tumor universal normal control PRO1138 lung tumor universal normal control PRO1138 breast tumor universal normal control PRO1415 colon tumor universal normal control PRO1415 lung tumor universal normal control PRO1415 prostate tumor universal normal control PRO1054 lung tumor universal normal control PRO1054 breast tumor universal normal control PRO994 colon tumor universal normal control PRO994 lung tumor universal normal control PRO994 rectal tumor universal normal control PRO1069 lung tumor universal normal control PRO1069 breast tumor universal normal control PRO1411 colon tumor universal normal control PRO1411 lung tumor universal normal control PRO1129 lung tumor universal normal control PRO1129 rectal tumor universal normal control PRO1359 colon tumor universal normal control PRO1359 lung tumor universal normal control PRO1359 breast tumor universal normal control PRO1359 prostate tumor universal normal control PRO1139 lung tumor universal normal control PRO1065 lung tumor universal normal control PRO1028 colon tumor universal normal control PRO1028 lung tumor universal normal control PRO1028 breast tumor universal normal control PRO1028 cervical tumor universal normal control PRO1027 colon tumor universal normal control PRO1027 lung tumor universal normal control PRO1027 breast tumor universal normal control PRO1140 colon tumor universal normal control PRO1140 breast tumor universal normal control PRO1291 colon tumor universal normal control PRO1291 breast tumor universal normal control PRO1105 colon tumor universal normal control PRO1105 lung tumor universal normal control PRO1026 lung tumor universal normal control PRO1026 prostate tumor universal normal control PRO1104 colon tumor universal normal control PRO1104 lung tumor universal normal control PRO1104 breast tumor universal normal control PRO1100 colon tumor universal normal control PRO1100 lung tumor universal normal control PRO1100 breast tumor universal normal control PRO1100 rectal tumor universal normal control PRO1141 lung tumor universal normal control PRO1772 colon tumor universal normal control PRO1772 lung tumor universal normal control PRO1772 breast tumor universal normal control PRO1772 cervical tumor universal normal control PRO1064 colon tumor universal normal control PRO1064 lung tumor universal normal control PRO1379 colon tumor universal normal control PRO1379 lung tumor universal normal control PRO1379 cervical tumor universal normal control PRO3573 lung tumor universal normal control PRO3573 breast tumor universal normal control PRO3566 colon tumor universal normal control PRO3566 lung tumor universal normal control PRO1156 lung tumor universal normal control PRO1156 breast tumor universal normal control PRO1156 prostate tumor universal normal control PRO1098 colon tumor universal normal control PRO1098 lung tumor universal normal control PRO1098 rectal tumor universal normal control PRO1128 colon tumor universal normal control PRO1128 lung tumor universal normal control PRO1128 breast tumor universal normal control PRO1248 lung tumor universal normal control PRO1248 breast tumor universal normal control PRO1127 colon tumor universal normal control PRO1127 lung tumor universal normal control PRO1127 breast tumor universal normal control PRO1316 colon tumor universal normal control PRO1316 lung tumor universal normal control PRO1316 breast tumor universal normal control PRO1197 colon tumor universal normal control PRO1197 lung tumor universal normal control PRO1197 breast tumor universal normal control PRO1125 lung tumor universal normal control PRO1158 breast tumor universal normal control PRO1124 colon tumor universal normal control PRO1124 lung tumor universal normal control PRO1380 colon tumor universal normal control PRO1380 lung tumor universal normal control PRO1380 breast tumor universal normal control PRO1380 liver tumor universal normal control PRO1377 colon tumor universal normal control PRO1377 lung tumor universal normal control PRO1287 lung tumor universal normal control PRO1287 breast tumor universal normal control PRO1249 lung tumor universal normal control PRO1249 breast tumor universal normal control PRO1335 colon tumor universal normal control PRO1335 lung tumor universal normal control PRO1335 breast tumor universal normal control PRO3572 lung tumor universal normal control PRO1599 colon tumor universal normal control PRO1599 lung tumor universal normal control PRO1599 breast tumor universal normal control PRO1374 lung tumor universal normal control PRO1374 breast tumor universal normal control PRO1345 lung tumor universal normal control PRO1345 breast tumor universal normal control PRO1311 lung tumor universal normal control PRO1311 breast tumor universal normal control PRO1357 colon tumor universal normal control PRO1357 lung tumor universal normal control PRO1557 colon tumor universal normal control PRO1557 lung tumor universal normal control PRO1557 breast tumor universal normal control PRO1305 colon tumor universal normal control PRO1305 lung tumor universal normal control PRO1305 breast tumor universal normal control PRO1302 colon tumor universal normal control PRO1302 lung tumor universal normal control PRO1302 breast tumor universal normal control PRO1302 rectal tumor universal normal control PRO1266 colon tumor universal normal control PRO1336 colon tumor universal normal control PRO1336 lung tumor universal normal control PRO1336 breast tumor universal normal control PRO1278 colon tumor universal normal control PRO1278 lung tumor universal normal control PRO1270 breast tumor universal normal control PRO1298 colon tumor universal normal control PRO1298 lung tumor universal normal control PRO1301 lung tumor universal normal control PRO1301 breast tumor universal normal control PRO1268 colon tumor universal normal control PRO1268 breast tumor universal normal control PRO1327 lung tumor universal normal control PRO1327 breast tumor universal normal control PRO1328 colon tumor universal normal control PRO1328 lung tumor universal normal control PRO1328 breast tumor universal normal control PRO1329 colon tumor universal normal control PRO1329 lung tumor universal normal control PRO1329 breast tumor universal normal control PRO1339 colon tumor universal normal control PRO1339 lung tumor universal normal control PRO1342 colon tumor universal normal control PRO1342 lung tumor universal normal control PRO1342 breast tumor universal normal control PRO1342 rectal tumor universal normal control PRO1487 colon tumor universal normal control PRO1487 breast tumor universal normal control PRO3579 lung tumor universal normal control PRO3579 breast tumor universal normal control PRO1472 colon tumor universal normal control PRO1472 lung tumor universal normal control PRO1385 lung tumor universal normal control PRO1385 breast tumor universal normal control PRO1461 colon tumor universal normal control PRO1461 lung tumor universal normal control PRO1461 breast tumor universal normal control PRO1429 colon tumor universal normal control PRO1429 lung tumor universal normal control PRO1429 breast tumor universal normal control PRO1568 lung tumor universal normal control PRO1568 breast tumor universal normal control PRO1569 colon tumor universal normal control PRO1569 lung tumor universal normal control PRO1569 breast tumor universal normal control PRO1753 colon tumor universal normal control PRO1753 lung tumor universal normal control PRO1570 colon tumor universal normal control PRO1570 lung tumor universal normal control PRO1570 breast tumor universal normal control PRO1570 prostate tumor universal normal control PRO1570 rectal tumor universal normal control PRO1559 colon tumor universal normal control PRO1559 lung tumor universal normal control PRO1559 breast tumor universal normal control PRO1486 lung tumor universal normal control PRO1486 breast tumor universal normal control PRO1433 colon tumor universal normal control PRO1433 lung tumor universal normal control PRO1433 breast tumor universal normal control PRO1433 rectal tumor universal normal control PRO1490 lung tumor universal normal control PRO1490 breast tumor universal normal control PRO1482 lung tumor universal normal control PRO1482 breast tumor universal normal control PRO1409 colon tumor universal normal control PRO1409 lung tumor universal normal control PRO1409 breast tumor universal normal control PRO1446 colon tumor universal normal control PRO1446 lung tumor universal normal control PRO1446 breast tumor universal normal control PRO1446 prostate tumor universal normal control PRO1604 colon tumor universal normal control PRO1604 lung tumor universal normal control PRO1604 breast tumor universal normal control PRO1491 colon tumor universal normal control PRO1491 lung tumor universal normal control PRO1491 breast tumor universal normal control PRO1431 colon tumor universal normal control PRO1431 lung tumor universal normal control PRO1563 colon tumor universal normal control PRO1563 lung tumor universal normal control PRO1563 breast tumor universal normal control PRO1571 colon tumor universal normal control PRO1571 lung tumor universal normal control PRO1571 breast tumor universal normal control PRO1572 lung tumor universal normal control PRO1572 prostate tumor universal normal control PRO1573 lung tumor universal normal control PRO1573 breast tumor universal normal control PRO1508 lung tumor universal normal control PRO1508 breast tumor universal normal control PRO1485 colon tumor universal normal control PRO1485 lung tumor universal normal control PRO1564 colon tumor universal normal control PRO1564 lung tumor universal normal control PRO1564 breast tumor universal normal control PRO1550 colon tumor universal normal control PRO1550 lung tumor universal normal control PRO1550 breast tumor universal normal control PRO1757 lung tumor universal normal control PRO1757 breast tumor universal normal control PRO1757 prostate tumor universal normal control PRO1758 lung tumor universal normal control PRO1781 colon tumor universal normal control PRO1781 lung tumor universal normal control PRO1781 breast tumor universal normal control PRO1606 lung tumor universal normal control PRO1606 breast tumor universal normal control PRO1784 colon tumor universal normal control PRO1784 lung tumor universal normal control PRO1784 breast tumor universal normal control PRO1774 colon tumor universal normal control PRO1774 lung tumor universal normal control PRO1774 breast tumor universal normal control PRO1605 colon tumor universal normal control PRO1605 lung tumor universal normal control PRO1605 prostate tumor universal normal control PRO1928 colon tumor universal normal control PRO1928 lung tumor universal normal control PRO1928 cervical tumor universal normal control PRO1865 lung tumor universal normal control PRO1865 liver tumor universal normal control PRO1925 lung tumor universal normal control PRO1926 liver tumor universal normal control PRO2630 colon tumor universal normal control PRO2630 lung tumor universal normal control PRO2630 breast tumor universal normal control PRO2630 liver tumor universal normal control PRO3443 colon tumor universal normal control PRO3443 lung tumor universal normal control PRO3443 breast tumor universal normal control PRO3301 colon tumor universal normal control PRO3301 lung tumor universal normal control PRO3301 breast tumor universal normal control PRO3301 rectal tumor universal normal control PRO3442 colon tumor universal normal control PRO3442 lung tumor universal normal control PRO3442 rectal tumor universal normal control PRO4978 colon tumor universal normal control PRO4978 lung tumor universal normal control PRO4978 breast tumor universal normal control PRO4978 rectal tumor universal normal control PRO5801 colon tumor universal normal control PRO5801 breast tumor universal normal control PRO19630 colon tumor universal normal control PRO203 colon tumor universal normal control PRO204 colon tumor universal normal control PRO204 lung tumor universal normal control PRO204 breast tumor universal normal control PRO204 prostate tumor universal normal control PRO210 colon tumor universal normal control PRO210 lung tumor universal normal control PRO223 lung tumor universal normal control PRO223 breast tumor universal normal control PRO247 colon tumor universal normal control PRO247 lung tumor universal normal control PRO247 breast universal normal control PRO358 lung tumor universal normal control PRO358 breast tumor universal normal control PRO358 prostate tumor universal normal control PRO724 lung tumor universal normal control PRO868 colon tumor universal normal control PRO868 lung tumor universal normal control PRO868 prostate tumor universal normal control PRO868 rectal tumor universal normal control PRO740 colon tumor universal normal control PRO1478 colon tumor universal normal control PRO1478 lung tumor universal normal control PRO162 colon tumor universal normal control PRO162 lung tumor universal normal control PRO162 breast tumor universal normal control PRO828 colon tumor universal normal control PRO828 lung tumor universal normal control PRO828 breast tumor universal normal control PRO828 cervical tumor universal normal control PRO828 liver tumor universal normal control PRO819 lung tumor universal normal control PRO819 breast tumor universal normal control PRO819 rectal tumor universal normal control PRO813 colon tumor universal normal control PRO813 lung tumor universal normal control PRO813 breast tumor universal normal control PRO813 prostate tumor universal normal control PRO1194 colon tumor universal normal control PRO1194 lung tumor universal normal control PRO1194 breast tumor universal normal control PRO887 colon tumor universal normal control PRO887 lung tumor universal normal control PRO887 rectal tumor universal normal control PRO1071 colon tumor universal normal control PRO1071 lung tumor universal normal control PRO1071 breast tumor universal normal control PRO1029 colon tumor universal normal control PRO1029 lung tumor universal normal control PRO1029 breast tumor universal normal control PRO1190 lung tumor universal normal control PRO1190 breast tumor universal normal control PRO4334 lung tumor universal normal control PRO1155 colon tumor universal normal control PRO1155 lung tumor universal normal control PRO1157 breast tumor universal normal control PRO1157 cervical tumor universal normal control PRO1122 lung tumor universal normal control PRO1122 breast tumor universal normal control PRO1183 colon tumor universal normal control PRO1183 lung tumor universal normal control PRO1183 breast tumor universal normal control PRO1337 colon tumor universal normal control PRO1337 lung tumor universal normal control PRO1337 breast tumor universal normal control PRO1480 colon tumor universal normal control PRO1480 lung tumor universal normal control PRO1480 breast tumor universal normal control PRO19645 colon tumor universal normal control PRO9782 colon tumor universal normal control PRO1419 colon tumor universal normal control PRO1575 colon tumor universal normal control PRO1575 lung tumor universal normal control PRO1567 colon tumor universal normal control PRO1567 lung tumor universal normal control PRO1567 breast tumor universal normal control PRO1891 colon tumor universal normal control PRO1889 colon tumor universal normal control PRO1889 lung tumor universal normal control PRO1785 lung tumor universal normal control PRO1785 prostate tumor universal normal control PRO6003 colon tumor universal normal control PRO4333 colon tumor universal normal control PRO4356 colon tumor universal normal control PRO4352 colon tumor universal normal control PRO4354 colon tumor universal normal control PRO4354 lung tumor universal normal control PRO4354 prostate tumor universal normal control PRO4369 colon tumor universal normal control PRO6030 colon tumor universal normal control PRO4433 colon tumor universal normal control PRO4424 colon tumor universal normal control PRO4424 breast tumor universal normal control PRO6017 colon tumor universal normal control PRO19563 colon tumor universal normal control PRO6015 colon tumor universal normal control PRO5779 colon tumor universal normal control PRO5776 colon tumor universal normal control PRO4430 lung tumor universal normal control PRO4421 colon tumor universal normal control PRO4499 colon tumor universal normal control PRO4423 colon tumor universal normal control PRO5998 colon tumor universal normal control PRO5998 lung tumor universal normal control PRO4501 colon tumor universal normal control PRO6240 colon tumor universal normal control PRO6245 colon tumor universal normal control PRO6175 colon tumor universal normal control PRO9742 colon tumor universal normal control PRO7179 colon tumor universal normal control PRO6239 colon tumor universal normal control PRO6493 colon tumor universal normal control PRO9741 colon tumor universal normal control PRO9822 colon tumor universal normal control PRO6244 colon tumor universal normal control PRO9740 colon tumor universal normal control PRO9739 colon tumor universal normal control PRO7177 colon tumor universal normal control PRO7178 colon tumor universal normal control PRO6246 colon tumor universal normal control PRO6241 colon tumor universal normal control PRO9835 colon tumor universal normal control PRO9857 colon tumor universal normal control PRO7436 colon tumor universal normal control PRO9856 colon tumor universal normal control PRO19605 colon tumor universal normal control PRO9859 colon tumor universal normal control PRO12970 colon tumor universal normal control PRO19626 colon tumor universal normal control PRO9883 colon tumor universal normal control PRO19670 colon tumor universal normal control PRO19624 colon tumor universal normal control PRO19680 colon tumor universal normal control PRO19675 colon tumor universal normal control PRO9834 colon tumor universal normal control PRO9744 colon tumor universal normal control PRO19644 colon tumor universal normal control PRO19625 colon tumor universal normal control PRO19597 colon tumor universal normal control PRO16090 colon tumor universal normal control PRO19576 colon tumor universal normal control PRO19646 colon tumor universal normal control PRO19814 colon tumor universal normal control PRO19669 colon tumor universal normal control PRO19818 colon tumor universal normal control PRO20088 colon tumor universal normal control PRO16089 colon tumor universal normal control PRO20025 colon tumor universal normal control PRO20040 colon tumor universal normal control PRO1760 adrenal tumor universal normal control PRO1760 breast tumor universal normal control PRO1760 cervical tumor universal normal control PRO1760 colon tumor universal normal control PRO1760 liver tumor universal normal control PRO1760 lung tumor universal normal control PRO1760 prostate tumor universal normal control PRO1760 rectal tumor universal normal control PRO6029 adrenal tumor universal normal control PRO6029 colon tumor universal normal control PRO6029 prostate tumor universal normal control PRO1801 colon tumor universal normal control PRO1801 lung tumor universal normal control [0975] 0 SEQUENCE LISTING The patent application contains a lengthy “Sequence Listing” section. A copy of the “Sequence Listing” is available in electronic form from the USPTO web site (http://seqdata.uspto.gov/sequence.html?DocID=20030166126). An electronic copy of the “Sequence Listing” will also be available from the USPTO upon request and payment of the fee set forth in 37 CFR 1.19(b)(3). What is claimed is: 1. Isolated nucleic acid having at least 80% nucleic acid sequence identity to a nucleotide sequence that encodes an amino acid sequence selected from the group consisting of the amino acid sequence shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 88), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 110), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 300 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), and FIG. 610 (SEQ ID NO: 610). 2. Isolated nucleic acid having at least 80% nucleic acid sequence identity to a nucleotide sequence selected from the group consisting of the nucleotide sequence shown in FIG. 1 (SEQ ID NO: 1), FIG. 3 (SEQ ID NO: 3), FIG. 5 (SEQ ID NO: 5), FIG. 7 (SEQ ID NO: 7), FIG. 9 (SEQ ID NO: 9), FIG. 11 (SEQ ID NO: 11), FIG. 13 (SEQ ID NO: 13), FIG. 15 (SEQ ID NO: 15), FIG. 17 (SEQ ID NO: 17), FIG. 19 (SEQ ID NO: 19), FIG. 21 (SEQ ID NO: 21), FIG. 23 (SEQ ID NO: 23), FIG. 25 (SEQ ID NO: 25), FIG. 27 (SEQ ID NO: 27), FIG. 29 (SEQ ID NO: 29), FIG. 31 (SEQ ID NO: 31), FIG. 33 (SEQ ID NO: 33), FIG. 35 (SEQ ID NO: 35), FIG. 37 (SEQ ID NO: 37), FIG. 39 (SEQ ID NO: 39), FIG. 41 (SEQ ID NO: 41), FIG. 43 (SEQ ID NO: 43), FIG. 45 (SEQ ID NO: 45), FIG. 47 (SEQ ID NO: 47), FIG. 49 (SEQ ID NO: 49), FIG. 51 (SEQ ID NO: 51), FIG. 53 (SEQ ID NO: 53), FIG. 55 (SEQ ID NO: 55), FIG. 57 (SEQ ID NO: 57), FIG. 59 (SEQ ID NO: 59), FIG. 61 (SEQ ID NO: 61), FIG. 63 (SEQ ID NO: 63), FIG. 65 (SEQ ID NO: 65), FIG. 67 (SEQ ID NO: 67), FIG. 69 (SEQ ID NO: 69), FIG. 71 (SEQ ID NO: 71), FIG. 73 (SEQ ID NO: 73), FIGS. 75A-75B (SEQ ID NO: 75), FIG. 77 (SEQ ID NO: 77), FIG. 79 (SEQ ID NO: 79), FIG. 81 (SEQ ID NO: 81), FIG. 83 (SEQ ID NO: 83), FIG. 85 (SEQ ID NO: 85), FIG. 87 (SEQ ID NO: 87), FIG. 89 (SEQ ID NO: 89), FIG. 91 (SEQ ID NO: 91), FIG. 93 (SEQ ID NO: 93), FIG. 95 (SEQ ID NO: 95), FIG. 97 (SEQ ID NO: 97), FIG. 99 (SEQ ID NO: 99), FIG. 101 (SEQ ID NO: 101), FIG. 103 (SEQ ID NO: 103), FIG. 105 (SEQ ID NO: 105), FIG. 107 (SEQ ID NO: 107), FIG. 109 (SEQ ID NO: 109), FIG. 111 (SEQ ID NO: 111), FIG. 113 (SEQ ID NO: 113), FIG. 115 (SEQ ID NO: 115), FIG. 117 (SEQ ID NO: 117), FIG. 119 (SEQ ID NO: 119), FIG. 121 (SEQ ID NO: 121), FIG. 123 (SEQ ID NO: 123), FIG. 125 (SEQ ID NO: 125), FIG. 127 (SEQ ID NO: 127), FIG. 129 (SEQ ID NO: 129), FIG. 131 (SEQ ID NO: 131), FIG. 133 (SEQ ID NO: 133), FIG. 135 (SEQ ID NO: 135), FIG. 137 (SEQ ID NO: 137), FIG. 139 (SEQ ID NO: 139), FIG. 141 (SEQ ID NO: 141), FIG. 143 (SEQ ID NO: 143), FIG. 145 (SEQ ID NO: 145), FIG. 147 (SEQ ID NO: 147), FIG. 149 (SEQ ID NO: 149), FIG. 151 (SEQ ID NO: 151), FIG. 153 (SEQ ID NO: 153), FIG. 155 (SEQ ID NO: 155), FIG. 157 (SEQ ID NO: 157), FIG. 159 (SEQ ID NO: 159), FIG. 161 (SEQ ID NO: 161), FIG. 163 (SEQ ID NO: 163), FIG. 165 (SEQ ID NO: 165), FIG. 167 (SEQ ID NO: 167), FIG. 169 (SEQ ID NO: 169), FIG. 171 (SEQ ID NO: 171), FIG. 173 (SEQ ID NO: 173), FIG. 175 (SEQ ID NO: 175), FIG. 177 (SEQ ID NO: 177), FIG. 179 (SEQ ID NO: 179), FIG. 181 (SEQ ID NO: 181), FIG. 183 (SEQ ID NO: 183), FIG. 185 (SEQ ID NO: 185), FIG. 187 (SEQ ID NO: 187), FIG. 189 (SEQ ID NO: 189), FIG. 191 (SEQ ID NO: 191), FIG. 193 (SEQ ID NO: 193), FIG. 195 (SEQ ID NO: 195), FIG. 197 (SEQ ID NO: 197), FIG. 199 (SEQ ID NO: 199), FIG. 201 (SEQ ID NO: 201), FIG. 203 (SEQ ID NO: 203), FIG. 205 (SEQ ID NO: 205), FIG. 207 (SEQ ID NO: 207), FIG. 209 (SEQ ID NO: 209), FIG. 211 (SEQ ID NO: 211), FIG. 213 (SEQ ID NO: 213), FIG. 215 (SEQ ID NO: 215), FIG. 217 (SEQ ID NO: 217), FIG. 219 (SEQ ID NO: 219), FIG. 221 (SEQ ID NO: 221), FIG. 223 (SEQ ID NO: 223), FIG. 225 (SEQ ID NO: 225), FIG. 227 (SEQ ID NO: 227), FIG. 229 (SEQ ID NO: 229), FIG. 231 (SEQ ID NO: 231), FIG. 233 (SEQ ID NO: 233), FIG. 235 (SEQ ID NO: 235), FIG. 237 (SEQ ID NO: 237), FIG. 239 (SEQ ID NO: 239), FIG. 241 (SEQ ID NO: 241), FIG. 243 (SEQ ID NO: 243), FIG. 245 (SEQ ID NO: 245), FIG. 247 (SEQ ID NO: 247), FIG. 249 (SEQ ID NO: 249), FIG. 251 (SEQ ID NO: 251), FIG. 253 (SEQ ID NO: 253), FIG. 255 (SEQ ID NO: 255), FIG. 257 (SEQ ID NO: 257), FIG. 259 (SEQ ID NO: 259), FIG. 261 (SEQ ID NO: 261), FIG. 263 (SEQ ID NO: 263), FIG. 265 (SEQ ID NO: 265), FIG. 267 (SEQ ID NO: 267), FIG. 269 (SEQ ID NO: 269), FIG. 271 (SEQ ID NO: 271), FIG. 273 (SEQ ID NO: 273), FIG. 275 (SEQ ID NO: 275), FIG. 277 (SEQ ID NO: 277), FIG. 279 (SEQ ID NO: 279), FIG. 281 (SEQ ID NO: 281), FIG. 283 (SEQ ID NO: 283), FIG. 285 (SEQ ID NO: 285), FIG. 287 (SEQ ID NO: 287), FIGS. 289A-289B (SEQ ID NO: 289), FIG. 291 (SEQ ID NO: 291), FIG. 293 (SEQ ID NO: 293), FIG. 295 (SEQ ID NO: 295), FIG. 297 (SEQ ID NO: 297), FIG. 299 (SEQ ID NO: 299), FIG. 301 (SEQ ID NO: 301), FIG. 303 (SEQ ID NO: 303), FIG. 305 (SEQ ID NO: 305), FIG. 307 (SEQ ID NO: 307), FIG. 309 (SEQ ID NO: 309), FIGS. 311A-311B (SEQ ID NO: 311), FIG. 313 (SEQ ID NO: 313), FIG. 315 (SEQ ID NO: 315), FIG. 317 (SEQ ID NO: 317), FIG. 319 (SEQ ID NO: 319), FIG. 321 (SEQ ID NO: 321), FIG. 323 (SEQ ID NO: 323), FIG. 325 (SEQ ID NO: 325), FIG. 327 (SEQ ID NO: 327), FIG. 329 (SEQ ID NO: 329), FIG. 331 (SEQ ID NO: 331), FIG. 333 (SEQ ID NO: 333), FIG. 335 (SEQ ID NO: 335), FIG. 337 (SEQ ID NO: 337), FIG. 339 (SEQ ID NO: 339), FIG. 341 (SEQ ID NO: 341), FIG. 343 (SEQ ID NO: 343), FIG. 345 (SEQ ID NO: 345), FIG. 347 (SEQ ID NO: 347), FIG. 349 (SEQ ID NO: 349), FIGS. 351A-351B (SEQ ID NO: 351), FIG. 353 (SEQ ID NO: 353), FIG. 355 (SEQ ID NO: 355), FIG. 357 (SEQ ID NO: 357), FIG. 359 (SEQ ID NO: 359), FIG. 361 (SEQ ID NO: 361), FIG. 363 (SEQ ID NO: 363), FIG. 365 (SEQ ID NO: 365), FIG. 367 (SEQ ID NO: 367), FIG. 369 (SEQ ID NO: 369), FIG. 371 (SEQ ID NO: 371), FIG. 373 (SEQ ID NO: 373), FIG. 375 (SEQ ID NO: 375), FIG. 377 (SEQ ID NO: 377), FIG. 379 (SEQ ID NO: 379), FIG. 381 (SEQ ID NO: 381), FIG. 383 (SEQ ID NO: 383), FIG. 385 (SEQ ID NO: 385), FIG. 387 (SEQ ID NO: 387), FIG. 389 (SEQ ID NO: 389), FIG. 391 (SEQ ID NO: 391), FIG. 393 (SEQ ID NO: 393), FIG. 395 (SEQ ID NO: 395), FIG. 397 (SEQ ID NO: 397), FIG. 399 (SEQ ID NO: 399), FIG. 401 (SEQ ID NO: 401), FIG. 403 (SEQ ID NO: 403), FIG. 405 (SEQ ID NO: 405), FIG. 407 (SEQ ID NO: 407), FIG. 409 (SEQ ID NO: 409), FIG. 411 (SEQ ID NO: 41 1), FIG. 413 (SEQ ID NO: 413), FIG. 415 (SEQ ID NO: 415), FIG. 417 (SEQ ID NO: 417), FIG. 419 (SEQ ID NO: 419), FIG. 421 (SEQ ID NO: 421), FIG. 423 (SEQ ID NO: 423), FIG. 425 (SEQ ID NO: 425), FIG. 427 (SEQ ID NO: 427), FIG. 429 (SEQ ID NO: 429), FIG. 431 (SEQ ID NO: 431), FIG. 433 (SEQ ID NO: 433), FIG. 435 (SEQ ID NO: 435), FIG. 437 (SEQ ID NO: 437), FIG. 439 (SEQ ID NO: 439), FIG. 441 (SEQ ID NO: 441), FIG. 443 (SEQ ID NO: 443), FIG. 445 (SEQ ID NO: 445), FIG. 447 (SEQ ID NO: 447), FIG. 449 (SEQ ID NO: 449), FIG. 451 (SEQ ID NO: 451), FIG. 453 (SEQ ID NO: 453), FIG. 455 (SEQ ID NO: 455), FIG. 457 (SEQ ID NO: 457), FIG. 459 (SEQ ID NO: 459), FIG. 461 (SEQ ID NO: 461), FIG. 463 (SEQ ID NO: 463), FIG. 465 (SEQ ID NO: 465), FIG. 467 (SEQ ID NO: 467), FIG. 469 (SEQ ID NO: 469), FIG. 471 (SEQ ID NO: 471), FIG. 473 (SEQ ID NO: 473), FIG. 475 (SEQ ID NO: 475), FIG. 477 (SEQ ID NO: 477), FIG. 479 (SEQ ID NO: 479), FIG. 481 (SEQ ID NO: 481), FIG. 483 (SEQ ID NO: 483), FIG. 485 (SEQ ID NO: 485), FIG. 487 (SEQ ID NO: 487), FIG. 489 (SEQ ID NO: 489), FIG. 491 (SEQ ID NO: 491), FIG. 493 (SEQ ID NO: 493), FIG. 495 (SEQ ID NO: 495), FIG. 497 (SEQ ID NO: 497), FIG. 499 (SEQ ID NO: 499), FIG. 501 (SEQ ID NO: 501), FIG. 503 (SEQ ID NO: 503), FIG. 505 (SEQ ID NO: 505), FIG. 507 (SEQ ID NO: 507), FIG. 509 (SEQ ID NO: 509), FIG. 511 (SEQ ID NO: 511), FIG. 513 (SEQ ID NO: 513), FIG. 515 (SEQ ID NO: 515), FIG. 517 (SEQ ID NO: 517), FIG. 519 (SEQ ID NO: 519), FIG. 521 (SEQ ID NO: 521), FIG. 523 (SEQ ID NO: 523), FIGS. 525A-525B (SEQ ID NO: 525), FIG. 527 (SEQ ID NO: 527), FIG. 529 (SEQ ID NO: 529), FIG. 531 (SEQ ID NO: 531), FIG. 533 (SEQ ID NO: 533), FIG. 535 (SEQ ID NO: 535), FIG. 537 (SEQ ID NO: 537), FIG. 539 (SEQ ID NO: 539), FIG. 541 (SEQ ID NO: 541), FIG. 543 (SEQ ID NO: 543), FIG. 545 (SEQ ID NO: 545), FIG. 547 (SEQ ID NO: 547), FIG. 549 (SEQ ID NO: 549), FIG. 551 (SEQ ID NO: 551), FIG. 553 (SEQ ID NO: 553), FIG. 555 (SEQ ID NO: 555), FIG. 557 (SEQ ID NO: 557), FIG. 559 (SEQ ID NO: 559), FIG. 561 (SEQ ID NO: 561), FIG. 563 (SEQ ID NO: 563), FIG. 565 (SEQ ID NO: 565), FIG. 567 (SEQ ID NO: 567), FIG. 569 (SEQ ID NO: 569), FIG. 571 (SEQ ID NO: 571), FIG. 573 (SEQ ID NO: 573), FIG. 575 (SEQ ID NO: 575), FIG. 577 (SEQ ID NO: 577), FIG. 579 (SEQ ID NO: 579), FIG. 581 (SEQ ID NO: 581), FIG. 583 (SEQ ID NO: 583), FIG. 585 (SEQ ID NO: 585), FIG. 587 (SEQ ID NO: 587), FIG. 589 (SEQ ID NO: 589), FIG. 591 (SEQ ID NO: 591), FIG. 593 (SEQ ID NO: 593), FIG. 595 (SEQ ID NO: 595), FIG. 597 (SEQ ID NO: 597), FIG. 599 (SEQ ID NO: 599), FIG. 601 (SEQ ID NO: 601), FIG. 603 (SEQ ID NO: 603), FIG. 605 (SEQ ID NO: 605), FIG. 607 (SEQ ID NO: 607), and FIG. 609 (SEQ ID NO: 609). 3. Isolated nucleic acid having at least 80% nucleic acid sequence identity to a nucleotide sequence selected from the group consisting of the full-length coding sequence of the nucleotide sequence shown in FIG. 1 (SEQ ID NO: 1), FIG. 3 (SEQ ID NO: 3), FIG. 5 (SEQ ID NO: 5), FIG. 7 (SEQ ID NO: 7), FIG. 9 (SEQ ID NO: 9), FIG. 11 (SEQ ID NO: 11), FIG. 13 (SEQ ID NO: 13), FIG. 15 (SEQ ID NO: 15), FIG. 17 (SEQ ID NO: 17), FIG. 19 (SEQ ID NO: 19), FIG. 21 (SEQ ID NO: 21), FIG. 23 (SEQ ID NO: 23), FIG. 25 (SEQ ID NO: 25), FIG. 27 (SEQ ID NO: 27), FIG. 29 (SEQ ID NO: 29), FIG. 31 (SEQ ID NO: 31), FIG. 33 (SEQ ID NO: 33), FIG. 35 (SEQ ID NO: 35), FIG. 37 (SEQ ID NO: 37), FIG. 39 (SEQ ID NO: 39), FIG. 41 (SEQ ID NO: 41), FIG. 43 (SEQ ID NO: 43), FIG. 45 (SEQ ID NO: 45), FIG. 47 (SEQ ID NO: 47), FIG. 49 (SEQ ID NO: 49), FIG. 51 (SEQ ID NO: 51), FIG. 53 (SEQ ID NO: 53), FIG. 55 (SEQ ID NO: 55), FIG. 57 (SEQ ID NO: 57), FIG. 59 (SEQ ID NO: 59), FIG. 61 (SEQ ID NO: 61), FIG. 63 (SEQ ID NO: 63), FIG. 65 (SEQ ID NO: 65), FIG. 67 (SEQ ID NO: 67), FIG. 69 (SEQ ID NO: 69), FIG. 71 (SEQ ID NO: 71), FIG. 73 (SEQ ID NO: 73), FIGS. 75A-75B (SEQ ID NO: 75), FIG. 77 (SEQ ID NO: 77), FIG. 7 9 (SEQ ID NO: 79), FIG. 81 (SEQ ID NO: 81), FIG. 83 (SEQ ID NO: 83), FIG. 85 (SEQ ID NO: 85), FIG. 87 (SEQ ID NO: 87), FIG. 89 (SEQ ID NO: 89), FIG. 91 (SEQ ID NO: 91), FIG. 93 (SEQ ID NO: 93), FIG. 95 (SEQ ID NO: 95), FIG. 97 (SEQ ID NO: 97), FIG. 99 (SEQ ID NO: 99), FIG. 101 (SEQ ID NO: 101), FIG. 103 (SEQ ID NO: 103), FIG. 105 (SEQ ID NO: 105), FIG. 107 (SEQ ID NO: 107), FIG. 109 (SEQ ID NO: 109), FIG. 111 (SEQ ID NO: 111), FIG. 113 (SEQ ID NO: 113), FIG. 115 (SEQ ID NO: 115), FIG. 117 (SEQ ID NO: 117), FIG. 119 (SEQ ID NO: 119), FIG. 121 (SEQ ID NO: 121), FIG. 123 (SEQ ID NO: 123), FIG. 125 (SEQ ID NO: 125), FIG. 127 (SEQ ID NO: 127), FIG. 129 (SEQ ID NO: 129), FIG. 131 (SEQ ID NO: 131), FIG. 133 (SEQ ID NO: 133), FIG. 135 (SEQ ID NO: 135), FIG. 137 (SEQ ID NO: 137), FIG. 139 (SEQ ID NO: 139), FIG. 141 (SEQ ID NO: 141), FIG. 143 (SEQ ID NO: 143), FIG. 145 (SEQ ID NO: 145), FIG. 147 (SEQ ID NO: 147), FIG. 149 (SEQ ID NO: 149), FIG. 151 (SEQ ID NO: 151), FIG. 153 (SEQ ID NO: 153), FIG. 155 (SEQ ID NO: 155), FIG. 157 (SEQ ID NO: 157), FIG. 159 (SEQ ID NO: 159), FIG. 161 (SEQ ID NO: 161), FIG. 163 (SEQ ID NO: 163), FIG. 165 (SEQ ID NO: 165), FIG. 167 (SEQ ID NO: 167), FIG. 169 (SEQ ID NO: 169), FIG. 171 (SEQ ID NO: 171), FIG. 173 (SEQ ID NO: 173), FIG. 175 (SEQ ID NO: 175), FIG. 177 (SEQ ID NO: 177), FIG. 179 (SEQ ID NO: 179), FIG. 181 (SEQ ID NO: 181), FIG. 183 (SEQ ID NO: 183), FIG. 185 (SEQ ID NO: 185), FIG. 187 (SEQ ID NO: 187), FIG. 189 (SEQ ID NO: 189), FIG. 191 (SEQ ID NO: 191), FIG. 193 (SEQ ID NO: 193), FIG. 195 (SEQ ID NO: 195), FIG. 197 (SEQ ID NO: 197), FIG. 199 (SEQ ID NO: 199), FIG. 201 (SEQ ID NO: 201), FIG. 203 (SEQ ID NO: 203), FIG. 205 (SEQ ID NO: 205), FIG. 207 (SEQ ID NO: 207), FIG. 209 (SEQ ID NO: 209), FIG. 211 (SEQ ID NO: 211), FIG. 213 (SEQ ID NO: 213), FIG. 215 (SEQ ID NO: 215), FIG. 217 (SEQ ID NO: 217), FIG. 219 (SEQ ID NO: 219), FIG. 221 (SEQ ID NO: 221), FIG. 223 (SEQ ID NO: 223), FIG. 225 (SEQ ID NO: 225), FIG. 227 (SEQ ID NO: 227), FIG. 229 (SEQ ID NO: 229), FIG. 231 (SEQ ID NO: 231), FIG. 233 (SEQ ID NO: 233), FIG. 235 (SEQ ID NO: 235), FIG. 237 (SEQ ID NO: 237), FIG. 239 (SEQ ID NO: 239), FIG. 241 (SEQ ID NO: 241), FIG. 243 (SEQ ID NO: 243), FIG. 245 (SEQ ID NO: 245), FIG. 247 (SEQ ID NO: 247), FIG. 249 (SEQ ID NO: 249), FIG. 251 (SEQ ID NO: 251), FIG. 253 (SEQ ID NO: 253), FIG. 255 (SEQ ID NO: 255), FIG. 257 (SEQ ID NO: 257), FIG. 259 (SEQ ID NO: 259), FIG. 261 (SEQ ID NO: 261), FIG. 263 (SEQ ID NO: 263), FIG. 265 (SEQ ID NO: 265), FIG. 267 (SEQ ID NO: 267), FIG. 269 (SEQ ID NO: 269), FIG. 271 (SEQ ID NO: 271), FIG. 273 (SEQ ID NO: 273), FIG. 275 (SEQ ID NO: 275), FIG. 277 (SEQ ID NO: 277), FIG. 279 (SEQ ID NO: 279), FIG. 281 (SEQ ID NO: 281), FIG. 283 (SEQ ID NO: 283), FIG. 285 (SEQ ID NO: 285), FIG. 287 (SEQ ID NO: 287), FIGS. 289A-289B (SEQ ID NO: 289), FIG. 291 (SEQ ID NO: 291), FIG. 293 (SEQ ID NO: 293), FIG. 295 (SEQ ID NO: 295), FIG. 297 (SEQ ID NO: 297), FIG. 299 (SEQ ID NO: 299), FIG. 301 (SEQ ID NO: 301), FIG. 303 (SEQ ID NO: 303), FIG. 305 (SEQ ID NO: 305), FIG. 307 (SEQ ID NO: 307), FIG. 309 (SEQ ID NO: 309), FIGS. 311A-311B (SEQ ID NO: 311), FIG. 313 (SEQ ID NO: 313), FIG. 315 (SEQ ID NO: 315), FIG. 317 (SEQ ID NO: 317), FIG. 319 (SEQ ID NO: 319), FIG. 321 (SEQ ID NO: 321), FIG. 323 (SEQ ID NO: 323), FIG. 325 (SEQ ID NO: 325), FIG. 327 (SEQ ID NO: 327), FIG. 329 (SEQ ID NO: 329), FIG. 331 (SEQ ID NO: 331), FIG. 333 (SEQ ID NO: 333), FIG. 335 (SEQ ID NO: 335), FIG. 337 (SEQ ID NO: 337), FIG. 339 (SEQ ID NO: 339), FIG. 341 (SEQ ID NO: 341), FIG. 343 (SEQ ID NO: 343), FIG. 345 (SEQ ID NO: 345), FIG. 347 (SEQ ID NO: 347), FIG. 349 (SEQ ID NO: 349), FIGS. 351A-351B (SEQ ID NO: 351), FIG. 353 (SEQ ID NO: 353), FIG. 355 (SEQ ID NO: 355), FIG. 357 (SEQ ID NO: 357), FIG. 359 (SEQ ID NO: 359), FIG. 361 (SEQ ID NO: 361), FIG. 363 (SEQ ID NO: 363), FIG. 365 (SEQ ID NO: 365), FIG. 367 (SEQ ID NO: 367), FIG. 369 (SEQ ID NO: 369), FIG. 371 (SEQ ID NO: 371), FIG. 373 (SEQ ID NO: 373), FIG. 375 (SEQ ID NO: 375), FIG. 377 (SEQ ID NO: 377), FIG. 379 (SEQ ID NO: 379), FIG. 381 (SEQ ID NO: 381), FIG. 383 (SEQ ID NO: 383), FIG. 385 (SEQ ID NO: 385), FIG. 387 (SEQ ID NO: 387), FIG. 389 (SEQ ID NO: 389), FIG. 391 (SEQ ID NO: 391), FIG. 393 (SEQ ID NO: 393), FIG. 395 (SEQ ID NO: 395), FIG. 397 (SEQ ID NO: 397), FIG. 399 (SEQ ID NO: 399), FIG. 401 (SEQ ID NO: 401), FIG. 403 (SEQ ID NO: 403), FIG. 405 (SEQ ID NO: 405), FIG. 407 (SEQ ID NO: 407), FIG. 409 (SEQ ID NO: 409), FIG. 411 (SEQ ID NO: 411), FIG. 413 (SEQ ID NO: 413), FIG. 415 (SEQ ID NO: 415), FIG. 417 (SEQ ID NO: 417), FIG. 419 (SEQ ID NO: 419), FIG. 421 (SEQ ID NO: 421), FIG. 423 (SEQ ID NO: 423), FIG. 425 (SEQ ID NO: 425), FIG. 427 (SEQ ID NO: 427), FIG. 429 (SEQ ID NO: 429), FIG. 431 (SEQ ID NO: 431), FIG. 433 (SEQ ID NO: 433), FIG. 435 (SEQ ID NO: 435), FIG. 437 (SEQ ID NO: 437), FIG. 439 (SEQ ID NO: 439), FIG. 441 (SEQ ID NO: 441), FIG. 443 (SEQ ID NO: 443), FIG. 445 (SEQ ID NO: 445), FIG. 447 (SEQ ID NO: 447), FIG. 449 (SEQ ID NO: 449), FIG. 451 (SEQ ID NO: 451), FIG. 453 (SEQ ID NO: 453), FIG. 455 (SEQ ID NO: 455), FIG. 457 (SEQ ID NO: 457), FIG. 459 (SEQ ID NO: 459), FIG. 461 (SEQ ID NO: 461), FIG. 463 (SEQ ID NO: 463), FIG. 465 (SEQ ID NO: 465), FIG. 467 (SEQ ID NO: 467), FIG. 469 (SEQ ID NO: 469), FIG. 471 (SEQ ID NO: 471), FIG. 473 (SEQ ID NO: 473), FIG. 475 (SEQ ID NO: 475), FIG. 477 (SEQ ID NO: 477), FIG. 479 (SEQ ID NO: 479), FIG. 481 (SEQ ID NO: 481), FIG. 483 (SEQ ID NO: 483), FIG. 485 (SEQ ID NO: 485), FIG. 487 (SEQ ID NO: 487), FIG. 489 (SEQ ID NO: 489), FIG. 491 (SEQ ID NO: 491), FIG. 493 (SEQ ID NO: 493), FIG. 495 (SEQ ID NO: 495), FIG. 497 (SEQ ID NO: 497), FIG. 499 (SEQ ID NO: 499), FIG. 501 (SEQ ID NO: 501), FIG. 503 (SEQ ID NO: 503), FIG. 505 (SEQ ID NO: 505), FIG. 507 (SEQ ID NO: 507), FIG. 509 (SEQ ID NO: 509), FIG. 511 (SEQ ID NO: 511), FIG. 513 (SEQ ID NO: 513), FIG. 515 (SEQ ID NO: 515), FIG. 517 (SEQ ID NO: 517), FIG. 519 (SEQ ID NO: 519), FIG. 521 (SEQ ID NO: 521), FIG. 523 (SEQ ID NO: 523), FIGS. 525A-525B (SEQ ID NO: 525), FIG. 527 (SEQ ID NO: 527), FIG. 529 (SEQ ID NO: 529), FIG. 531 (SEQ ID NO: 531), FIG. 533 (SEQ ID NO: 533), FIG. 535 (SEQ ID NO: 535), FIG. 537 (SEQ ID NO: 537), FIG. 539 (SEQ ID NO: 539), FIG. 541 (SEQ ID NO: 541), FIG. 543 (SEQ ID NO: 543), FIG. 545 (SEQ ID NO: 545), FIG. 547 (SEQ ID NO: 547), FIG. 549 (SEQ ID NO: 549), FIG. 551 (SEQ ID NO: 551), FIG. 553 (SEQ ID NO: 553), FIG. 555 (SEQ ID NO: 555), FIG. 557 (SEQ ID NO: 557), FIG. 559 (SEQ ID NO: 559), FIG. 561 (SEQ ID NO: 561), FIG. 563 (SEQ ID NO: 563), FIG. 565 (SEQ ID NO: 565), FIG. 567 (SEQ ID NO: 567), FIG. 569 (SEQ ID NO: 569), FIG. 571 (SEQ ID NO: 571), FIG. 573 (SEQ ID NO: 573), FIG. 575 (SEQ ID NO: 575), FIG. 577 (SEQ ID NO: 577), FIG. 579 (SEQ ID NO: 579), FIG. 581 (SEQ ID NO: 581), FIG. 583 (SEQ ID NO: 583), FIG. 585 (SEQ ID NO: 585), FIG. 587 (SEQ ID NO: 587), FIG. 589 (SEQ ID NO: 589), FIG. 591 (SEQ ID NO: 591), FIG. 593 (SEQ ID NO: 593), FIG. 595 (SEQ ID NO: 595), FIG. 597 (SEQ ID NO: 597), FIG. 599 (SEQ ID NO: 599), FIG. 601 (SEQ ID NO: 601), FIG. 603 (SEQ ID NO: 603), FIG. 605 (SEQ ID NO: 605), FIG. 607 (SEQ ID NO: 607), and FIG. 609 (SEQ ID NO: 609). 4. Isolated nucleic acid having at least 80% nucleic acid sequence identity to the full-length coding sequence of the DNA deposited under any ATCC accession number shown in Table 7. 5. A vector comprising the nucleic acid of claim 1. 6. A host cell comprising the vector of claim 5. 7. The host cell of claim 6, wherein said cell is a CHO cell. 8. The host cell of claim 6, wherein said cell is an E. coli. 9. The host cell of claim 6, wherein said cell is a yeast cell. 10. A process for producing a PRO polypeptide comprising culturing the host cell of claim 6 under conditions suitable for expression of said PRO polypeptide and recovering said PRO polypeptide from the cell culture. 11. An isolated polypeptide having at least 80% amino acid sequence identity to an amino acid sequence selected from the group consisting of the amino acid sequence shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 88), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 110), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 300 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), and FIG. 610 (SEQ ID NO: 610). 12. An isolated polypeptide having at least 80% amino acid sequence identity to an amino acid sequence encoded by the full-length coding sequence of the DNA deposited under any ATCC accession number shown in Table 7. 13. A chimeric molecule comprising a polypeptide according to claim 11 fused to a heterologous amino acid sequence. 14. The chimeric molecule of claim 13, wherein said heterologous amino acid sequence is an epitope tag sequence. 15. The chimeric molecule of claim 13, wherein said heterologous amino acid sequence is a Fc region of an immunoglobulin. 16. An antibody which specifically binds to a polypeptide according to claim 11. 17. The antibody of claim 16, wherein said antibody is a monoclonal antibody, a humanized antibody or a single-chain antibody. 18. Isolated nucleic acid having at least 80% nucleic acid sequence identity to: (a) a nucleotide sequence encoding the polypeptide shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 88), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 110), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 300 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), or FIG. 610 (SEQ ID NO: 610), lacking its associated signal peptide; (b) a nucleotide sequence encoding an extracellular domain of the polypeptide shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 88), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 110), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 360 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), or FIG. 610 (SEQ ID NO: 610), with its associated signal peptide; or (c) a nucleotide sequence encoding an extracellular domain of the polypeptide shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 88), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 110), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 300 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), or FIG. 610 (SEQ ID NO: 610), lacking its associated signal peptide. 19. An isolated polypeptide having at least 80% amino acid sequence identity to: (a) an amino acid sequence of the polypeptide shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 88), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 110), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 300 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), or FIG. 610 (SEQ ID NO: 610), lacking its associated signal peptide; (b) an amino acid sequence of an extracellular domain of the polypeptide shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 88), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 110), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 300 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), or FIG. 610 (SEQ ID NO: 610), with its associated signal peptide; or (c) an amino acid sequence of an extracellular domain of the polypeptide shown in FIG. 2 (SEQ ID NO: 2), FIG. 4 (SEQ ID NO: 4), FIG. 6 (SEQ ID NO: 6), FIG. 8 (SEQ ID NO: 8), FIG. 10 (SEQ ID NO: 10), FIG. 12 (SEQ ID NO: 12), FIG. 14 (SEQ ID NO: 14), FIG. 16 (SEQ ID NO: 16), FIG. 18 (SEQ ID NO: 18), FIG. 20 (SEQ ID NO: 20), FIG. 22 (SEQ ID NO: 22), FIG. 24 (SEQ ID NO: 24), FIG. 26 (SEQ ID NO: 26), FIG. 28 (SEQ ID NO: 28), FIG. 30 (SEQ ID NO: 30), FIG. 32 (SEQ ID NO: 32), FIG. 34 (SEQ ID NO: 34), FIG. 36 (SEQ ID NO: 36), FIG. 38 (SEQ ID NO: 38), FIG. 40 (SEQ ID NO: 40), FIG. 42 (SEQ ID NO: 42), FIG. 44 (SEQ ID NO: 44), FIG. 46 (SEQ ID NO: 46), FIG. 48 (SEQ ID NO: 48), FIG. 50 (SEQ ID NO: 50), FIG. 52 (SEQ ID NO: 52), FIG. 54 (SEQ ID NO: 54), FIG. 56 (SEQ ID NO: 56), FIG. 58 (SEQ ID NO: 58), FIG. 60 (SEQ ID NO: 60), FIG. 62 (SEQ ID NO: 62), FIG. 64 (SEQ ID NO: 64), FIG. 66 (SEQ ID NO: 66), FIG. 68 (SEQ ID NO: 68), FIG. 70 (SEQ ID NO: 70), FIG. 72 (SEQ ID NO: 72), FIG. 74 (SEQ ID NO: 74), FIG. 76 (SEQ ID NO: 76 ), FIG. 78 (SEQ ID NO: 78), FIG. 80 (SEQ ID NO: 80), FIG. 82 (SEQ ID NO: 82), FIG. 84 (SEQ ID NO: 84), FIG. 86 (SEQ ID NO: 86), FIG. 88 (SEQ ID NO: 8 8), FIG. 90 (SEQ ID NO: 90), FIG. 92 (SEQ ID NO: 92), FIG. 94 (SEQ ID NO: 94), FIG. 96 (SEQ ID NO: 96), FIG. 98 (SEQ ID NO: 98), FIG. 100 (SEQ ID NO: 100), FIG. 102 (SEQ ID NO: 102), FIG. 104 (SEQ ID NO: 104), FIG. 106 (SEQ ID NO: 106), FIG. 108 (SEQ ID NO: 108), FIG. 110 (SEQ ID NO: 10), FIG. 112 (SEQ ID NO: 112), FIG. 114 (SEQ ID NO: 114), FIG. 116 (SEQ ID NO: 116), FIG. 118 (SEQ ID NO: 118), FIG. 120 (SEQ ID NO: 120), FIG. 122 (SEQ ID NO: 122), FIG. 124 (SEQ ID NO: 124), FIG. 126 (SEQ ID NO: 126), FIG. 128 (SEQ ID NO: 128), FIG. 130 (SEQ ID NO: 130), FIG. 132 (SEQ ID NO: 132), FIG. 134 (SEQ ID NO: 134), FIG. 136 (SEQ ID NO: 136), FIG. 138 (SEQ ID NO: 138), FIG. 140 (SEQ ID NO: 140), FIG. 142 (SEQ ID NO: 142), FIG. 144 (SEQ ID NO: 144), FIG. 146 (SEQ ID NO: 146), FIG. 148 (SEQ ID NO: 148), FIG. 150 (SEQ ID NO: 150), FIG. 152 (SEQ ID NO: 152), FIG. 154 (SEQ ID NO: 154), FIG. 156 (SEQ ID NO: 156), FIG. 158 (SEQ ID NO: 158), FIG. 160 (SEQ ID NO: 160), FIG. 162 (SEQ ID NO: 162), FIG. 164 (SEQ ID NO: 164), FIG. 166 (SEQ ID NO: 166), FIG. 168 (SEQ ID NO: 168), FIG. 170 (SEQ ID NO: 170), FIG. 172 (SEQ ID NO: 172), FIG. 174 (SEQ ID NO: 174), FIG. 176 (SEQ ID NO: 176), FIG. 178 (SEQ ID NO: 178), FIG. 180 (SEQ ID NO: 180), FIG. 182 (SEQ ID NO: 182), FIG. 184 (SEQ ID NO: 184), FIG. 186 (SEQ ID NO: 186), FIG. 188 (SEQ ID NO: 188), FIG. 190 (SEQ ID NO: 190), FIG. 192 (SEQ ID NO: 192), FIG. 194 (SEQ ID NO: 194), FIG. 196 (SEQ ID NO: 196), FIG. 198 (SEQ ID NO: 198), FIG. 200 (SEQ ID NO: 200), FIG. 202 (SEQ ID NO: 202), FIG. 204 (SEQ ID NO: 204), FIG. 206 (SEQ ID NO: 206), FIG. 208 (SEQ ID NO: 208), FIG. 210 (SEQ ID NO: 210), FIG. 212 (SEQ ID NO: 212), FIG. 214 (SEQ ID NO: 214), FIG. 216 (SEQ ID NO: 216), FIG. 218 (SEQ ID NO: 218), FIG. 220 (SEQ ID NO: 220), FIG. 222 (SEQ ID NO: 222), FIG. 224 (SEQ ID NO: 224), FIG. 226 (SEQ ID NO: 226), FIG. 228 (SEQ ID NO: 228), FIG. 230 (SEQ ID NO: 230), FIG. 232 (SEQ ID NO: 232), FIG. 234 (SEQ ID NO: 234), FIG. 236 (SEQ ID NO: 236), FIG. 238 (SEQ ID NO: 238), FIG. 240 (SEQ ID NO: 240), FIG. 242 (SEQ ID NO: 242), FIG. 244 (SEQ ID NO: 244), FIG. 246 (SEQ ID NO: 246), FIG. 248 (SEQ ID NO: 248), FIG. 250 (SEQ ID NO: 250), FIG. 252 (SEQ ID NO: 252), FIG. 254 (SEQ ID NO: 254), FIG. 256 (SEQ ID NO: 256), FIG. 258 (SEQ ID NO: 258), FIG. 260 (SEQ ID NO: 260), FIG. 262 (SEQ ID NO: 262), FIG. 264 (SEQ ID NO: 264), FIG. 266 (SEQ ID NO: 266), FIG. 268 (SEQ ID NO: 268), FIG. 270 (SEQ ID NO: 270), FIG. 272 (SEQ ID NO: 272), FIG. 274 (SEQ ID NO: 274), FIG. 276 (SEQ ID NO: 276), FIG. 278 (SEQ ID NO: 278), FIG. 280 (SEQ ID NO: 280), FIG. 282 (SEQ ID NO: 282), FIG. 284 (SEQ ID NO: 284), FIG. 286 (SEQ ID NO: 286), FIG. 288 (SEQ ID NO: 288), FIG. 290 (SEQ ID NO: 290), FIG. 292 (SEQ ID NO: 292), FIG. 294 (SEQ ID NO: 294), FIG. 296 (SEQ ID NO: 296), FIG. 298 (SEQ ID NO: 298), FIG. 300 (SEQ ID NO: 300), FIG. 302 (SEQ ID NO: 302), FIG. 304 (SEQ ID NO: 304), FIG. 306 (SEQ ID NO: 306), FIG. 308 (SEQ ID NO: 308), FIG. 310 (SEQ ID NO: 310), FIG. 312 (SEQ ID NO: 312), FIG. 314 (SEQ ID NO: 314), FIG. 316 (SEQ ID NO: 316), FIG. 318 (SEQ ID NO: 318), FIG. 320 (SEQ ID NO: 320), FIG. 322 (SEQ ID NO: 322), FIG. 324 (SEQ ID NO: 324), FIG. 326 (SEQ ID NO: 326), FIG. 328 (SEQ ID NO: 328), FIG. 330 (SEQ ID NO: 330), FIG. 332 (SEQ ID NO: 332), FIG. 334 (SEQ ID NO: 334), FIG. 336 (SEQ ID NO: 336), FIG. 338 (SEQ ID NO: 338), FIG. 340 (SEQ ID NO: 340), FIG. 342 (SEQ ID NO: 342), FIG. 344 (SEQ ID NO: 344), FIG. 346 (SEQ ID NO: 346), FIG. 348 (SEQ ID NO: 348), FIG. 350 (SEQ ID NO: 350), FIG. 352 (SEQ ID NO: 352), FIG. 354 (SEQ ID NO: 354), FIG. 356 (SEQ ID NO: 356), FIG. 358 (SEQ ID NO: 358), FIG. 360 (SEQ ID NO: 360), FIG. 362 (SEQ ID NO: 362), FIG. 364 (SEQ ID NO: 364), FIG. 366 (SEQ ID NO: 366), FIG. 368 (SEQ ID NO: 368), FIG. 370 (SEQ ID NO: 370), FIG. 372 (SEQ ID NO: 372), FIG. 374 (SEQ ID NO: 374), FIG. 376 (SEQ ID NO: 376), FIG. 378 (SEQ ID NO: 378), FIG. 380 (SEQ ID NO: 380), FIG. 382 (SEQ ID NO: 382), FIG. 384 (SEQ ID NO: 384), FIG. 386 (SEQ ID NO: 386), FIG. 388 (SEQ ID NO: 388), FIG. 390 (SEQ ID NO: 390), FIG. 392 (SEQ ID NO: 392), FIG. 394 (SEQ ID NO: 394), FIG. 396 (SEQ ID NO: 396), FIG. 398 (SEQ ID NO: 398), FIG. 400 (SEQ ID NO: 400), FIG. 402 (SEQ ID NO: 402), FIG. 404 (SEQ ID NO: 404), FIG. 406 (SEQ ID NO: 406), FIG. 408 (SEQ ID NO: 408), FIG. 410 (SEQ ID NO: 410), FIG. 412 (SEQ ID NO: 412), FIG. 414 (SEQ ID NO: 414), FIG. 416 (SEQ ID NO: 416), FIG. 418 (SEQ ID NO: 418), FIG. 420 (SEQ ID NO: 420), FIG. 422 (SEQ ID NO: 422), FIG. 424 (SEQ ID NO: 424), FIG. 426 (SEQ ID NO: 426), FIG. 428 (SEQ ID NO: 428), FIG. 430 (SEQ ID NO: 430), FIG. 432 (SEQ ID NO: 432), FIG. 434 (SEQ ID NO: 434), FIG. 436 (SEQ ID NO: 436), FIG. 438 (SEQ ID NO: 438), FIG. 440 (SEQ ID NO: 440), FIG. 442 (SEQ ID NO: 442), FIG. 444 (SEQ ID NO: 444), FIG. 446 (SEQ ID NO: 446), FIG. 448 (SEQ ID NO: 448), FIG. 450 (SEQ ID NO: 450), FIG. 452 (SEQ ID NO: 452), FIG. 454 (SEQ ID NO: 454), FIG. 456 (SEQ ID NO: 456), FIG. 458 (SEQ ID NO: 458), FIG. 460 (SEQ ID NO: 460), FIG. 462 (SEQ ID NO: 462), FIG. 464 (SEQ ID NO: 464), FIG. 466 (SEQ ID NO: 466), FIG. 468 (SEQ ID NO: 468), FIG. 470 (SEQ ID NO: 470), FIG. 472 (SEQ ID NO: 472), FIG. 474 (SEQ ID NO: 474), FIG. 476 (SEQ ID NO: 476), FIG. 478 (SEQ ID NO: 478), FIG. 480 (SEQ ID NO: 480), FIG. 482 (SEQ ID NO: 482), FIG. 484 (SEQ ID NO: 484), FIG. 486 (SEQ ID NO: 486), FIG. 488 (SEQ ID NO: 488), FIG. 490 (SEQ ID NO: 490), FIG. 492 (SEQ ID NO: 492), FIG. 494 (SEQ ID NO: 494), FIG. 496 (SEQ ID NO: 496), FIG. 498 (SEQ ID NO: 498), FIG. 500 (SEQ ID NO: 500), FIG. 502 (SEQ ID NO: 502), FIG. 504 (SEQ ID NO: 504), FIG. 506 (SEQ ID NO: 506), FIG. 508 (SEQ ID NO: 508), FIG. 510 (SEQ ID NO: 510), FIG. 512 (SEQ ID NO: 512), FIG. 514 (SEQ ID NO: 514), FIG. 516 (SEQ ID NO: 516), FIG. 518 (SEQ ID NO: 518), FIG. 520 (SEQ ID NO: 520), FIG. 522 (SEQ ID NO: 522), FIG. 524 (SEQ ID NO: 524), FIG. 526 (SEQ ID NO: 526), FIG. 528 (SEQ ID NO: 528), FIG. 530 (SEQ ID NO: 530), FIG. 532 (SEQ ID NO: 532), FIG. 534 (SEQ ID NO: 534), FIG. 536 (SEQ ID NO: 536), FIG. 538 (SEQ ID NO: 538), FIG. 540 (SEQ ID NO: 540), FIG. 542 (SEQ ID NO: 542), FIG. 544 (SEQ ID NO: 544), FIG. 546 (SEQ ID NO: 546), FIG. 548 (SEQ ID NO: 548), FIG. 550 (SEQ ID NO: 550), FIG. 552 (SEQ ID NO: 552), FIG. 554 (SEQ ID NO: 554), FIG. 556 (SEQ ID NO: 556), FIG. 558 (SEQ ID NO: 558), FIG. 560 (SEQ ID NO: 560), FIG. 562 (SEQ ID NO: 562), FIG. 564 (SEQ ID NO: 564), FIG. 566 (SEQ ID NO: 566), FIG. 568 (SEQ ID NO: 568), FIG. 570 (SEQ ID NO: 570), FIG. 572 (SEQ ID NO: 572), FIG. 574 (SEQ ID NO: 574), FIG. 576 (SEQ ID NO: 576), FIG. 578 (SEQ ID NO: 578), FIG. 580 (SEQ ID NO: 580), FIG. 582 (SEQ ID NO: 582), FIG. 584 (SEQ ID NO: 584), FIG. 586 (SEQ ID NO: 586), FIG. 588 (SEQ ID NO: 588), FIG. 590 (SEQ ID NO: 590), FIG. 592 (SEQ ID NO: 592), FIG. 594 (SEQ ID NO: 594), FIG. 596 (SEQ ID NO: 596), FIG. 598 (SEQ ID NO: 598), FIG. 600 (SEQ ID NO: 600), FIG. 602 (SEQ ID NO: 602), FIG. 604 (SEQ ID NO: 604), FIG. 606 (SEQ ID NO: 606), FIG. 608 (SEQ ID NO: 608), or FIG. 610 (SEQ ID NO: 610), lacking its associated signal peptide. 20. A method for stimulating the release of TNF-α from human blood, said method comprising contacting said blood with a PRO1079, PRO827, PRO791, PRO1131, PRO1316, PRO1183, PRO1343, PRO1760, PRO1567 or PRO4333 polypeptide, wherein the release of TNF-α from said blood is stimulated. 21. A method for stimulating the proliferation or differentiation of chondrocyte cells, said method comprising contacting said cells with a PRO6029 polypeptide, wherein the proliferation or differentiation of said cells is stimulated. 22. A method for detecting the presence of tumor in an mammal, said method comprising comparing the level of expression of any PRO polypeptide shown in Table 8 in (a) a test sample of cells taken from said mammal and (b) a control sample of normal cells of the same cell type, wherein a higher level of expression of said PRO polypeptide in the test sample as compared to the control sample is indicative of the presence of tumor in said mammal. 23. The method of claim 22, wherein said tumor is adrenal tumor, lung tumor, colon tumor, breast tumor, prostate tumor, rectal tumor, cervical tumor or liver tumor. 24. An oligonucleotide probe derived from any of the nucleotide sequences shown in the accompanying figures.

2002-06-20

en

2003-09-04

US-201816121492-A

Sock with support assemblage ABSTRACT The present invention relates generally to a sock having one or more support assemblages for providing structural support to one or more regions of the foot of the wearer. In some exemplary embodiments, a support assemblage may be an arch support assemblage that is adapted to cover an arch of the foot. In some exemplary embodiments, a support assemblage may be an Achilles support assemblage that is adapted to cover the Achilles tendon of the foot. In some exemplary embodiments, a support assemblage may be an ankle support assemblage that is adapted to cover a portion of the ankle of the foot. In some exemplary embodiments, the sock may comprise multiple support assemblages to provide structural support to different regions of the foot of the wearer. Typically, a support assemblage will have an elasticity coefficient that is lower than an elasticity coefficient of the other areas of the sock. PRIORITY NOTICE The present application is a continuation-in-part of U.S. patent application Ser. No. 15/224,626, filed Jul. 31, 2016, which is a continuation of U.S. patent application Ser. No. 14/161,632, filed on Jan. 1, 2014, the disclosure of which are incorporated herein by reference in their entirety. TECHNICAL FIELD OF THE INVENTION The present invention relates in general to a sock with one or more support assemblages, which provides additional structural support and stability to one or more regions of the foot. COPYRIGHT & TRADEMARK NOTICE A portion of the disclosure of this patent application may contain material that is subject to copyright protection. The owner has no objection to the facsimile reproduction of any one of the patent documents or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyrights whatsoever. Certain marks referenced herein may be common law or registered trademarks of third parties affiliated or unaffiliated with the applicant or the assignee. Use of these marks is by way of example and shall not be construed as descriptive or to limit the scope of this invention to material associated only with such marks. BACKGROUND OF THE INVENTION For centuries, stockings or socks have been used to provide comfort and warmth and protect the feet from cracking, dryness, chafing, or general damage that can result from continually rubbing up against one's footwear or, if barefoot, the surrounding environment. More recently, sock entrepreneurs have especially begun focusing on the comfort aspect of sock wearing, for example designing thinner socks that allow for greater airflow or thicker socks that provide greater padding. Thicker socks often employ terry loops to provide greater moisture absorption in addition to increased cushioning. Some prior art has employed terry loops only in particular areas of the sock or simply with greater density in those areas so as to soften the impact of the foot as it makes contact with the ground while walking or otherwise mobile on foot. Prior art has taken this approach with many areas of the foot, including the Achilles tendon, sole, heel, and toes, but seldom the arch or the arch side of the foot. Yet among the enumerated, the arch is of great importance. The arch region principally resides in the inner-middle part of each foot and is predominately comprised of or reliant on the tarsal and metatarsal bone set and various tendons and ligaments to support the weight of the entire human body when erect. Therefore, it is unsurprising that the arch undergoes immense strain and pressure, which can become quite problematic for a person, especially when the arch is not being supported sufficiently by socks or footwear. But despite its importance, the prior art neglect to solely provide support for the arch (inner) side of the foot. Moreover, the prior art emphasizes cushioning to the exclusion of structural support, an important distinction with even more important consequences. While cushioning may ameliorate pain associated with walking or running, structural deficiencies are all but ignored and untreated. Thus, persons with, for example, plantar fasciitis or low or flat foot arches, would likely make very limited improvement by wearing cushioning socks, but could greatly benefit from socks with improved arch regions in light of the problems presented by the prior art. Hence, there is a need in the art for an arch-supporting sock, which reduces pain and strain in the arch regions of the feet and reinforces proper curvature of the arch, whereby other areas important for standing and mobility such as the heel or lower leg are positively impacted as well. Similarly, the prior art inadequately addresses providing for improved structural support to the ankle and or the Achilles tendon of the foot of the wearer. While the prior art includes several structures such as pads, pockets with padded inserts, and cushioning layers that cover these regions of the foot, these prior art structures either improperly support these regions, comprise of components too cumbersome for easy manufacturing, or simply do not provide adequate support. Therefore, the present invention seeks to address the inadequacies and shortcomings of the prior art, by providing a sock with one or more support assemblages, which provides additional structural support and stability to different regions of the foot. It is to these ends that the present invention has been developed. SUMMARY OF THE INVENTION To minimize the limitations in the prior art, and to minimize other limitations that will be apparent upon reading and understanding the present specification, the present invention describes an arch-supporting sock used to reduce pain and strain in the arch region of the foot and stabilize and reinforce proper curvature of the arch. Generally, the present invention is a sock having one or more support assemblages for providing structural support to one or more regions of the foot of the wearer. In some exemplary embodiments, a support assemblage may be an arch support assemblage that is adapted to cover an arch of the foot. In some exemplary embodiments, a support assemblage may be an Achilles support assemblage that is adapted to cover the Achilles tendon of the foot. In some exemplary embodiments, a support assemblage may be an ankle support assemblage that is adapted to cover a portion of the ankle of the foot. In some exemplary embodiments, the sock may comprise multiple support assemblages to provide structural support to different regions of the foot of the wearer. Typically, a support assemblage will have an elasticity coefficient that is lower than an elasticity coefficient of the other areas of the sock. A sock, in accordance with some embodiments of the present invention, may include a sock body defined by a toe section, a heel flap, a sole extending between the toe section and the heel flap on a bottom portion of the sock, and an instep extending between the toe section and the heel flap on a top portion of the sock, the toe section and instep having a first elasticity coefficient; an arch support assemblage, adapted to cover an arch region of the sole of the sock excluding the toe section of the sock, the arch support assemblage having a second elasticity coefficient, wherein the second elasticity coefficient is lower than the first elasticity coefficient; and an Achilles support assemblage, adapted to cover an Achilles tendon of a wearer of the sock, the Achilles support assemblage running from a top edge of the heel flap to a top portion of the leg of the sock. A sock, in accordance with some embodiments of the present invention, may include: a sock body defined by a toe section, a heel flap, a sole extending between the toe section and the heel flap on a bottom portion of the sock, and an instep extending between the toe section and the heel flap on a top portion of the sock, the toe section and instep having a first elasticity coefficient; and an Achilles support assemblage, adapted to cover an Achilles tendon of a wearer of the sock, the Achilles support assemblage running from a top edge of the heel flap to a top portion of the leg of the sock, the Achilles support assemblage having a second elasticity coefficient that is lower than the first elasticity coefficient. A sock, in accordance with some embodiments of the present invention, may include: a sock body defined by a toe section, a heel flap, a sole extending between the toe section and the heel flap on a bottom portion of the sock, and an instep extending between the toe section and the heel flap on a top portion of the sock, the toe section and instep having a first elasticity coefficient; an arch support assemblage, adapted to cover an arch region of the sole of the sock excluding the toe section of the sock, the arch support assemblage having a second elasticity coefficient, wherein the second elasticity coefficient is lower than the first elasticity coefficient; an Achilles support assemblage, adapted to cover an Achilles tendon of a wearer of the sock, the Achilles support assemblage running from a top edge of the heel flap to a top portion of the leg of the sock; and an ankle support assemblage adapted to cover a portion of an ankle of the wearer of the sock, including a pair of bands extending from the Achilles support assemblage to a distal end of the hell flap of the sock, wherein at least one of the pair of bands of the ankle support assemblage wraps around the sole of the sock connecting with a posterior region of the arch support assemblage. An arch-supporting sock, in accordance with one embodiment of the present invention, comprises: a first region having a first elasticity coefficient; and a second region, roughly encompassing the arch of the foot, having a second elasticity coefficient for providing structural support, wherein the second elasticity coefficient is lower than the first elasticity coefficient. An arch-supporting sock, in accordance with another embodiment of the present invention, comprises: a first region having a first elasticity coefficient; and a second region, roughly encompassing the arch of the foot; and one or more perimetric boundaries between the first region and the second region, each perimetric boundary comprising a perimetric elasticity coefficient, wherein at least one of the one or more perimetric boundaries has a perimetric elasticity coefficient less than the first elasticity coefficient. An arch-supporting sock, in accordance with yet another embodiment of the present invention, comprises: a first terry loop region having a first elasticity coefficient; a second tuck-stitched region, roughly encompassing the arch of the foot, having a second elasticity coefficient for providing structural support, wherein the second elasticity coefficient is lower than the first elasticity coefficient; and one or more perimetric boundaries between the first region and the second region, each boundary comprising a perimetric elasticity coefficient, wherein the one or more perimetric boundaries have a perimetric elasticity coefficient less than the first and second elasticity coefficients. It is an objective of the present invention to support the arch region of the foot without forfeiting comfort. It is another objective of the present invention to provide a plurality of types of socks for different occasions and circumstances. It is yet another objective of the present invention to support the Achilles tendon or posterior region of the foot without forfeiting comfort. It is yet another objective of the present invention to support the ankle of the foot without forfeiting comfort. It is yet another objective of the present invention to provide a sock with additional structural support and stability to different regions of the foot. It is yet another objective of the present invention to reinforce proper curvature of the arch region. It is yet another objective of the present invention to provide a wedge support of the inner half of the foot and thereby raise the medial longitudinal arch with respect to the outer half of the foot. Finally, it is yet another objective of the present invention to alleviate pain and decrease strain in the heel, arch and greater foot region. These and other advantages and features of the present invention are described herein with specificity so as to make the present invention understandable to one of ordinary skill in the art. BRIEF DESCRIPTION OF THE DRAWINGS The socks with support assemblages as disclosed herein are further described in terms of exemplary embodiments. These exemplary embodiments are described in detail with reference to the drawings, which have not necessarily been drawn to scale in order to enhance their clarity and improve understanding of the various embodiments of the invention. Furthermore, elements that are known to be common and well understood to those in the industry are not depicted in order to provide a clear view of the various embodiments of the invention. These embodiments are non-limiting exemplary embodiments, in which like reference numerals represent similar structures throughout the several views of the drawings. The drawings that accompany the detailed description can be briefly described as follows: FIG. 1 is a side elevation view of the bones of the lower leg and foot. FIG. 2 is a plantar view of the underside of a human foot. FIG. 3(a) is a side view of a foot with a typical arch, wherein the bottom of the arch is not in contact with the ground. FIG. 3(b) is a side view of a foot with a flat arch, wherein the bottom of the arch is in contact with the ground. FIG. 4(a) is a side view of a right ankle-length sock, in accordance with one embodiment of the present invention. FIG. 4(b) is a side view of a left ankle-length sock, in accordance with one embodiment of the present invention. FIG. 5(a) is a side view of a right liner-length sock, in accordance with one embodiment of the present invention. FIG. 5(b) is a side view of a left liner-length sock, in accordance with one embodiment of the present invention. FIG. 6 is a perspective view of a right one-half knee-length sock, in accordance with one embodiment of the present invention. FIG. 7 is a side view of a left one-fourth knee-length sock, in accordance with one embodiment of the present invention. FIG. 8 depicts one embodiment of the arch support assemblage of a sock in accordance with the present invention. FIG. 9 is a diagram of a human foot depicting various tendons therein. FIG. 10(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention. FIG. 10(b) is a perspective side view of the sock in FIG. 10(a), in accordance with an exemplary embodiment of the present invention. FIG. 10(c) is a cross-sectional side view of the sock in FIGS. 10(a)-10(b), in accordance with an exemplary embodiment of the present invention. FIG. 11(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention. FIG. 11(b) is a perspective side view of the sock in FIG. 11(a), in accordance with an exemplary embodiment of the present invention. FIG. 11(c) is a cross-sectional side view of the sock in FIGS. 11(a)-11(b), in accordance with an exemplary embodiment of the present invention. FIG. 12(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention. FIG. 12(b) is a perspective side view of the sock in FIG. 12(a), in accordance with an exemplary embodiment of the present invention. FIG. 12(c) is a cross-sectional side view of the sock in FIGS. 12(a)-12(b), in accordance with an exemplary embodiment of the present invention. FIG. 13(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention. FIG. 13(b) is a side view of the sock in FIG. 13(a), in accordance with an exemplary embodiment of the present invention. FIG. 13(c) is a bottom view of the sock in FIGS. 13(a)-13(b). DETAILED DESCRIPTION OF THE DRAWINGS In the following discussion that addresses a number of embodiments and applications of the present invention, reference is made to the accompanying figures, which form a part thereof. Depictions are made, by way of illustration, of specific embodiments in which the invention may be practiced; however, it is to be understood that other embodiments may be utilized and changes may be made without departing from the scope of the present invention. In the following detailed description, numerous specific details are set forth by way of examples in order to provide a thorough understanding of the relevant teachings. However, it should be apparent to those skilled in the art that the present teachings may be practiced without such details. In other instances, well-known structures, components, and/or functional or structural relationship thereof, etc., have been described at a relatively high level, without detail, in order to avoid unnecessarily obscuring aspects of the present teachings. Throughout the specification and claims, terms may have nuanced meanings suggested or implied in context beyond an explicitly stated meaning. Likewise, the phrase “in one embodiment/example,” as used herein, does not necessarily refer to the same embodiment. It is intended, for example, that the claimed subject matter include combinations of example embodiments in whole or in part. Conditional language used herein, such as, among others, “can,” “could,” “might,” “may,” “e.g.,” and the like, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements, and/or steps. Thus, such conditional language is not generally intended to imply that features, elements, and/or steps are in any way required for one or more embodiments, whether these features, elements, and/or steps are included or are to be performed in any particular embodiment. The terms “comprising,” “including,” “having,” and the like are synonymous and are used inclusively, in an open-ended fashion, and do not exclude additional elements, features, acts, operations, and so forth. Also, the term “or” is used in its inclusive sense (and not in its exclusive sense) so that when used, for example, to connect a list of elements, the term “or” means one, some, or all of the elements in the list. Conjunctive language such as the phrase “at least one of X, Y, and Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to convey that an item, term, etc., may be either X, Y, or Z. Thus, such conjunctive language is not generally intended to imply that certain embodiments require at least one of X, at least one of Y, and at least one of Z to each be present. The term “and/or” means that “and” applies to some embodiments and “or” applies to some embodiments. Thus, A, B, and/or C can be replaced with A, B, and C written in one sentence and A, B, or C written in another sentence. A, B, and/or C means that some embodiments can include A and B, some embodiments can include A and C, some embodiments can include B and C, some embodiments can include only A, some embodiments can include only B, some embodiments can include only C, and some embodiments can include A, B, and C. The term “and/or” is used to avoid unnecessary redundancy. Similarly, terms such as “a,” “an,” or “the,” again, may be understood to convey a singular usage or to convey a plural usage, depending at least in part upon context. In addition, the term “based on” may be understood as not necessarily intended to convey an exclusive set of facts and may, instead, allow of the existence of additional facts not necessarily expressly described, again, depending at least in part on context. While exemplary embodiments of the disclosure may be described, modifications, adaptations, and other implementations are possible. For example, substitutions, additions, or modifications may be made to the elements illustrated in the drawings, and the methods described herein may be modified by substituting, reordering, or adding stages to the disclosed methods, Thus, nothing in the foregoing description is intended to imply that any particular feature, characteristic, step, module, or block is necessary or indispensable. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions, and changes in the form of the methods and systems described herein may be made without departing from the spirit of the invention or inventions disclosed herein. Accordingly, the following detailed description does not limit the disclosure. Instead, the proper scope of the disclosure is defined by the appended claims. Turning now to the figures, FIG. 1 serves as an introduction to the physical features, namely the bones, which comprise the arch of the foot and other relevant foot and leg bones, so as to provide greater context and understanding to the scope and purpose of the present invention. FIG. 1 is a side view of the bones of the lower leg and foot. The relevant bones of the lower leg and foot 100 consist of talus 106, calcaneus 112, fibula 102, tibia 104, cuboid 114, navicular 108, cuneiforms 110, metatarsals 116, and phalanges 118. Calcaneus 112, talus 106, cuboid 114, navicular 108, and the three cuneiforms 110 form what is referred to as the tarsals. Only two of the three cuneiforms 110 are visible, with the third hidden cuneiform 110 residing on the line of bones ending distally with the big toe, also referred to as the hallux. For the purposes of simplicity, the foot can also be categorized into its relative regions: the hindfoot, midfoot, and forefoot, listed from proximal to distal end. The hindfoot comprises calcaneus 112 and talus 106. The midfoot comprises five important bones, two of which are cuboid 114 and navicular 108, and three of which are cuneiforms 110, together outlining the area of interest: the arch region. The forefoot comprises metatarsals 116, which are the five bones connecting the midfoot to the toe bones, and the toe bones themselves, referred to as phalanges 118. The hallux has two phalanges 118, whereas the remaining four toes are comprised of three phalanges 118. Tibia 104 and fibula 102 do not make up part of foot 100 and are instead long bones of the lower leg, though both tibia 104 and fibula 102 impact and are impacted by the arch region and its constituents. FIG. 2 is a plantar view of the underside of a foot. The figure displays the three primary arches of the human foot as well as a visual approximation of the area supported by an arch support assemblage, in accordance with an exemplary embodiment of the present invention. Medial ball 222 refers to the region on the inner part of foot 100 near the distal end of metatarsals 116 between the hallux and the adjacent long toe, wherein medial ball 222 serves as an arch base. Lateral ball 220 refers to the region on the outer part of foot 100 near the distal end of metatarsals 116 between the fifth toe and fourth toe, wherein lateral ball 220 serves as an arch base. The space between medial ball 222 and lateral ball 220, which under normal circumstances resembles an arch structure, is hereby referred to as transverse arch 224. Similarly, the region between medial ball 222 and calcaneus 112, which under normal circumstances resembles an arch structure, is hereby referred to as medial longitudinal arch 228. Also similarly, the region between lateral ball 220 and calcaneus 112, which under normal circumstances resembles an arch structure, is hereby referred to as lateral longitudinal arch 226. Medial longitudinal arch 228 is the inner-most arch of the three enumerated arches, typically receiving more intense stress than lateral longitudinal arch 226 and transverse arch 224. Thus medial longitudinal arch 228 may benefit most from an arch support assemblage lessening stress and strain on the arch region, heel, and medial and lateral balls 222, 220 of foot 100 upon impacting the ground. Furthermore, the part of the sock underlying or roughly covering medial longitudinal arch 228 may have additional material yielding a lower elasticity coefficient than some or all of the other arch supports, a concept elaborated upon in later figures. Arch support assemblage 250, in accordance with the present exemplary embodiment displayed in FIG. 2, covers a majority of arch region 230, with medial longitudinal arch 228 entirely covered. Thus, arch support assemblage 250 will afford the greatest structural support to the inner, medial portion of foot 100. However, it is important to note that structural support is not limited to arch region 230, since arch support assemblage 250 extends beyond arch region 230. Specifically, in the present embodiment, arch support assemblage 250 extends from the center of the heel, approximated by calcaneus 112, to the end of metatarsals 116 where they reach the start of phalanges 118. Additionally, along the width of foot 100, arch support assemblage 250 reaches from the medial-most part of foot 100 to the vertical boundary between the second and third toes. The scope or area of arch support assemblage 250 may be contracted or expanded without deviating from the spirit or scope of the present invention. For instance, arch support assemblage 250 may extend widthwise to the middle of the third toe, the vertical boundary between the third and fourth toes, or the middle of the second toe to cover more or less of arch region 230. In any case, this may cause the inner or medial half of foot 100 to become slightly wedged or raised by comparison to the outer or lateral half of foot 100. The disparity in support between the inner and outer halves of the feet is representative of the disparity in strain and stress endured by each half of the foot while mobile on foot. In alternative embodiments, arch support assemblage 250 may cover a slightly larger area of foot 100, perhaps to the vertical boundary between the third and fourth toes, so as to more completely encompass arch region 230. However, even in such wider-reaching embodiments, a disproportionate amount of support is offered to the inner half of foot 100 as compared to the outer half. FIG. 3(a) is a side view of a foot with a preferable amount of medial foot matter not in contact with the ground, thus forming a normal arch. The approximate proportion and parts of the foot desired to be in contact with the ground in various instances such as when standing, walking, or running would be known by those skilled in the art. Arch region 230, as displayed in FIG. 3(a), is of great importance because of its elasticity. When erect, the parts of foot 100 that make up arch region 230, such as the plantar fascia, help spread and extend ground contact out over time, in the process reducing the amount of strain put on the rest of arch region 230, as well as the greater foot area and lower leg. Additionally, support of arch region 230, such as that displayed in the discussed figure, is essential for upright posture longevity. Possessing the ideal or close to the ideal curvature of arch region 230 is beneficial for storing some of the energy expended when arch region 230 begins flattening upon impacting the ground, much like a coiling spring, and using it to lessen the energy demand for the following step. This makes walking, running, standing and the like more economical actions. If this level of support is not attainable because of the curvature of the medial portion of the foot, an arch support assemblage affords twofold relief: firstly by lowering the energy demands associated with standing or moving, and secondly by reinforcing proper curvature of arch region 230, thereby assisting arch region 230 in reusing energy expended in flattening the arch for impact with the ground. As a result of the lowered energy demand for erect posture and movement, an arch support assemblage is also useful for persons with normal foot arches. While foot maladies are more likely to occur among those with structural difficulties or deficiencies in the foot or leg, they also occur in persons with no such difficulties or deficiencies, for example when beginning a more rigorous exercise regimen or running long distances on pavement or concrete. Furthermore, such difficulties as flat feet, elaborated upon in the discussion of FIG. 3(b), often develop gradually from slow wear and tear of the tendons, muscles, ligaments, and bones, or as a result of some medical conditions, such as diabetes, or diseases of the nervous system or muscular system, such as cerebral palsy or muscular dystrophy. Lastly, flat feet are known to temporarily develop in some pregnant women. In these instances, among many others, the sock disclosed in FIGS. 4-8, because of its stiff, yet comfortable nature, may help slow the onset of flat feet or, depending on the cause and circumstance, prevent flat feet altogether. FIG. 3(b) is a side view of a foot with an insufficient amount of medial foot matter not in contact with the ground, thus forming a flat arch. Flat arch 334 is also commonly referred to as a fallen arch or as flat feet, and can result in a myriad of complications which may disrupt a sufferer's daily routine. For example, flat arch 334 may result in undue strain being put on calcaneus 112, heel 332, or on medial ball 222 and lateral ball 220 of foot 100. As a result of the discomfort or pain, a person may slowly alter their gait, often unknowingly, culminating then in undue stress being put on other parts of the body associated with standing, walking, or running, such as the back, Achilles tendon, toes, tibia 104, and shins. Frequently, this can lead to a number of subsequent injuries and general complications, typically soreness, inflammation, tendinitis, and fatigue, but also more directed complications such as painful shin splints or heel spurs. Sock 436 disclosed in FIGS. 4-8, because of its stiff, yet comfortable nature, could not only help to alleviate a number of the abovementioned symptoms of flat arch 334, but also address the conformation of the foot which firstly manifests these symptoms. Still referring to FIG. 3(b), flat arch 334 may decrease the functionality of the plantar fascia. The plantar fascia is an important set of thick, connective tissue, running from calcaneus 112 through metatarsals 116, which acts like a shock absorber, whereby it supports arch region 230 of foot 100 and makes manageable the immense stress and tension put on arch region 230 by the rest of the body. Upon decreasing the functionality of the plantar fascia, this tension may become too great, leading to small tears being made in the fascia, eventually resulting, in many instances, in inflammation and irritation, known as plantar fasciitis. Plantar fasciitis can cause severe pain in the heel and sole of the foot when in any foot-reliant erect posture, whether mobile or stationary, and is thus quite common in vocations such as athletics or military service. Sock 436 disclosed in FIGS. 4-8, because of its stiff, yet comfortable nature, could relieve much strain on the plantar fascia and more generally arch region 230, by delegating some of the bodily stress and pressure to the discussed arch-supporting sock 436. Thus, the described invention is useful as a treatment for plantar fasciitis or other inflammatory responses associated with insufficient support of the arch, greater foot area, or leg. Each of the following figures describes the various parts, features, designs, and purposes of the proposed arch-supporting sock. FIG. 4(a) is a side view of a right ankle-length sock. Ankle-length sock 436 generally has the top of sock 436 reaching just above the ankle bone, also referred to as talus 106. Sock 436 displayed in FIG. 4(a) or in any other figure presents only one of many possible variations of sock designs and lengths and should not be seen as limiting or exhaustive. In this figure, sock 436 has sock leg 438, which describes the region from the opening of sock 436 until approximately the beginning of heel flap 440 in the back and instep 444 in the front. Heel flap 440 roughly encompasses heel 112 of foot 100, including the heel bone, also referred to as calcaneus 112, and can vary in weave density depending on a number of factors, such as but not limited to: sock length, style, or material. The sock material is an important feature of the invention. The stiff, reinforcing region of the arch is not specific to a particular type of sock, and as such, can be made for any occasion, formal or informal, athletic, or otherwise. For instance, the sock may be made for the purposes of walking, running, skiing, snowboarding, working, hiking, or backpacking, though the enumerated purposes are by no means exhaustive. As a result of the various purposes wherein a person might find the invention of use, the sock can also comprise a myriad of materials. By way of just a few non-limiting examples, wool, polyester, cotton, acrylic, nylon, and cashmere may be utilized. Sock instep 444 refers to the top region of sock 436 which overlays arch region 230 and arch support assemblage 442 but is not in contact with support assemblage 442 when foot 100 is inside sock 436. Arch support assemblage 442 rests in front of heel flap 440 and behind sock toe 446 and comprises a denser weave than the remaining regions of sock 436, although it does not employ the oft-used terry loops, as the terry loop weave is much better fit for cushioning than providing structural support and stability. Rather, in one non-limiting embodiment, arch support assemblage 442 may employ tuck stitching to achieve a denser weave in which a given sock segment may have multiple rows of stitching overlain. The proposed arch-supporting sock may employ terry loops elsewhere in the sock, where perhaps support and stability are not the goal. Accordingly, arch support assemblage 442 is stiffer than any other part of the sock, though stiffness may vary within arch support assemblage 442 due to differences in strain between parts of the arch. The arch or arch region 230, unless specified as a particular arch, such as transverse arch 224, is to be construed as the region falling on or within the confines of medial longitudinal arch 228, lateral longitudinal arch 226, and transverse arch 224. Additionally, with reference to sock 436 of FIG. 4(a), arch support assemblage 442 is located on the right side of sock 436 to support arch region 230 of the foot, which endures the most stress on the inner portion of the midfoot. Arch support assemblage 442 transitions into sock toe 446, which covers the toes of the foot. FIG. 4(b) is a side view of a right ankle-length sock. Sock 436 of FIG. 4(b) is substantially identical to that of FIG. 4(a) with the exception that the arch support assemblage 442 is on the left side of sock 436 to reflect the mirrored anatomy between the left and right feet. FIG. 5(a) is a side view of a left liner-length sock. A liner length sock 436 generally has the top of sock 436 reaching just below talus 106. In such an embodiment, sock 436, sock leg 438 is largely absent, quickly transitioning from the top of sock 436 into heel flap 440. Heel flap 440 extends to arch support assemblage 442, which itself extends to sock toe 446 roughly parallel to sock instep 444. Generally, a liner-length sock is used for athletics or walking, but is not restricted to doing so. FIG. 5(b) is a side elevation view of a right liner-length sock. Sock 436 of FIG. 4 is substantially identical to that of FIG. 3 with the exception that arch support assemblage 442 is on the left side of sock 436 to reflect the mirrored anatomy between the left and right feet. FIG. 6 is a side perspective view of a one half hose-length sock. This figure better displays a sock that a user might wear in more formal circumstances or engagements, often but not exclusively work or work-related activities. By way of a non-limiting example, sock 436 may be comprised of polyester, cashmere, or nylon, especially if used as a formal or dress sock. In accordance with the present invention, this embodiment also comprises an arch support structure, namely, support assemblage 442. FIG. 7 is a side perspective view of a one fourth hose-length sock in accordance with another embodiment of the present invention. This figure better displays a sock that a user might wear during such activities as hiking. Though not a requirement, a sock of this length will often be thicker than those of ankle, liner, or one-half length socks to provide increased insulation and protection from dampness seeping through the layers of the sock. FIG. 8 depicts one embodiment of the arch support assemblage in a left sock. In the pictured embodiment, arch support assemblage 442 is in the shape of a rectangle, though different shapes may exist in other embodiments without deviating from the spirit or scope of the present invention. The discussed embodiment has arch support assemblage 442 with longer sides running roughly parallel to the length of sock 436 either from heel flap 440 to sock toe 446 or vice versa, and shorter sides running perpendicular to the longer sides, the longer and shorter sides together forming a boundary perimeter between the archetypical sock features and arch support assemblage 442. The archetypical sock features are meant to be construed as those features outside of arch support assemblage 442 very frequently found in basic socks, such as heel flap 440, sock leg 438, and sock toe 446, as well as other features deemed standard or very common by those skilled in the art. Among the longer sides of arch support assemblage 442, a second perimetric boundary or medial longitudinal support 848 lies superior to a first perimetric boundary or lateral longitudinal support 850. In exemplary embodiments, medial longitudinal support 848 roughly extends along medial longitudinal arch 228. Also in exemplary embodiments, lateral longitudinal support 850 roughly extends along lateral longitudinal arch 226, at least to the extent that lateral longitudinal arch 226 is noticeably supported by lateral longitudinal support 850. Among the shorter sides of arch support assemblage 442, with sock toe 446 considered to be the distal-most region and sock leg 438 considered the proximal-most region, a third perimetric boundary or transverse support 852 lies distal to a fourth perimetric boundary or heel support 854. In exemplary embodiments, transverse support 852 roughly extends along transverse arch 224, though other embodiments exist in which transverse support 852 is distal to transverse arch 224 and may more closely outline the boundary between the metatarsals and phalanges. Also in exemplary embodiments, heel support 854 roughly contours the distal end of heel 332 in the approximate region where the midfoot begins and hindfoot ends. Without deviating from the spirit or scope of the present invention, heel support 854 may also begin near the center of heel 332, with reference the length and not the width of sock 436. In the embodiment pictured in FIG. 8, as well as many other exemplary embodiments, the perimetric boundaries or supports that form arch support assemblage 442 are of varying elasticity coefficients. In the present disclosure, elasticity coefficient generally refers to the ratio of acutely endured stress to the temporary change in conformation of an elastic entity, whereby for example, an entity with a low elasticity coefficient would be less flexible, pliable, or otherwise physically influenced than an entity with a high elasticity coefficient, assuming equal stress is applied. The illustrated embodiment comprises medial longitudinal support 848, lateral longitudinal support 850, and transverse support 852 with lower elasticity coefficients than both heel support 854 and most or the rest of arch support assemblage 442 bound within the perimetric supports 848, 850, 852, 854. Parts of the arch-supporting sock having comparably lower elasticity coefficients will be more stiff and obdurate, that is resistant to physical manipulation or persuasion, and resultantly more stable and supportive of the corresponding regions of the foot resting upon these sock regions than will those parts with comparably higher elasticity coefficients. Accordingly, in these embodiments, the arch-supporting sock is able to stabilize and support the entirety of arch region 230, also referred to as the arch, as defined roughly by the dashed lines in FIG. 2, but provide even greater structural support and stability along the perimetric support boundaries where pressure is likely to be highest. The difference of elasticity around and within the perimetric boundary of arch support assemblage 442 may be achieved in any number of ways. For example, and without limiting the scope of the present invention, arch support assemblage 442 is bound within the perimetric boundaries or perimetric supports 848, 850, 852, 854 and may comprise different knitting or stitching techniques known in the art, such as tuck-stitching, implemented in a manner so that arch support assemblage 442 comprises an increased weight, width, or thickness. Other embodiments may comprise of perimetric supports which have elasticity coefficients less than most or the rest of sock 436. For instance, in one embodiment, the supports with the lowest elasticity coefficients are medial longitudinal support 848 and lateral longitudinal support 850, with transverse support 852 and heel support 854 registering elasticity coefficients roughly equal to that of the rest of arch support assemblage 442. Still other embodiments may, for example, provide the lowest elasticity coefficient levels around the entire perimeter of arch support assemblage 442, which comprises medial longitudinal support 848, lateral longitudinal support 850, transverse support 852, and heel support 854. In one embodiment, only medial longitudinal support 848 will have a lower elasticity coefficient than each other part of the sock to account for the expectation that medial longitudinal support 848 will endure the greatest pressure while the user displays an erect posture. In another embodiment, the perimetric supports may consist of varying elasticity coefficients generally based either on typical pressure expectations of the three arches and the distal heel region, or on the specific needs of persons with such aforementioned maladies as plantar fasciitis or a flat arch, among other maladies that would be known by those skilled in the art. FIG. 8 depicts one embodiment of the arch support assemblage of a sock in accordance with the present invention. Hence, the support structure may be placed inside or on the outside of the sock without deviating from the scope of the present invention. Moreover, exemplary embodiments exist which do not require the exterior sock supports to have the same elasticity coefficients as their overlaid interior sock support counterparts. Instead, the interior supports may differ in elasticity coefficient from each other and from the supports of the exterior sock supports, though they need not differ for the proposed arch-supporting sock to be efficacious. Turning now to FIG. 9, a diagram of a human foot depicting various tendons therein is illustrated as a reference to the physical features, namely the tendons and structures, that comprise the human foot, in order to provide greater context and understanding to the scope and purpose of the present invention—and in order to show additional regions outside of the arch of the foot that benefit from structural support by restricting movement of a particular area of the foot. FIG. 9 specifically shows a diagram of a human foot 900, including the Achilles tendon 901, which is the large tendon that attaches the calf muscles to the back of the heel, or more specifically to the calcaneus 902 of foot 900. Achilles tendon 901 serves to attach the plantaris, gastrocnemius (calf) and soleus muscles to calcaneus 902. Achilles tendonitis is characterized by pain that is located 1 to 4 inches above the area where the tendon attaches to the heel bone. This is the weakest part of the tendon and is usually the spot where tendon tears occur. Achilles tendinitis is a common repetitive stress sports injury and can be brought on by any increase in activity or changes in shoes or terrain. Proper support in accordance with the present invention aids in preventing or minimizing stress that may cause such ailment. The posterior tibialis tendon 903, the tendon of the tibialis posterior muscle, wraps around the inside of the ankle (medial malleolus) and instep 904 of the foot. That area is the usual site of pain and swelling associated with posterior tibial tendonitis (inner side of the ankle), which may be typically associated with flat feet. Conversely, peroneal tendonitis is inflammation of the peroneal tendons (not shown in this view) which run behind the lateral malleolus or the bony bit on the outside of the ankle (the other side of foot 900) causing and swelling on the outer ankle. The flexor digitorum longus tendon 905 serves the flexor digitorum longus muscle, which extends from the back surface of the tibia to the foot. Flexor digitorum longus tendon 905 passes along the plantar surface of the foot. There, it divides into four parts that attach to the terminal bones of the four small toes. Flexor digitorum longus tendon 905 assists in plantar flexion of the foot, flexion of the four small toes, and inversion of the foot. A common ailment to this part of the foot is flexor tendonitis, which has characteristic pain deep in the back of the ankle. Yet another common ailment of the foot is retrocalcaneal bursitis, which is an inflammation of the retrocalcaneal bursa 906 located between the calcaneus 902 and the anterior surface of the Achilles tendon 901. Retrocalcaneal bursitis commonly occurs in association with rheumatoid arthritis, spondyloarthropathies, gout, and trauma to this region of the foot. Similarly, the retroachilles bursa 907, the bursa located between the Achilles tendon 901 and skin at the back of the heel, is also susceptible to inflammation. As such, retroachilles bursitis is a similar inflammation, but of the retroachilles bursa 907, typically associated with shoes that dig into the back of the heel. Retroachilles and retrocalcaneal bursitis can occur at the same time, which can make the pain and inflammation more difficult to treat. The pain is usually on the back of the heel and as such swelling may appear on lateral or medial side of Achilles tendon 901 with respect to foot 900. The flexor hallucis longus tendon 908 passes downwards, deep through the flexor retinaculum 909, crossing the posterior ankle joint, lateral to flexor digitorum longus tendon 905. Flexor hallucis longus tendon 908 wraps around the lower end of the of the tibia, the back of the talus, and the inferior surface of the sustentaculum tali, where its passes through a fibrous, synovial-lined tunnel. Flexor retinaculum 909 is a strong fibrous band, extending from the bony ankle prominence (malleolus) above, to the margin of the heel bone or calcaneus 902 below, forming a series of canals for the passage of tendons 903, 905, and 908 of the flexor muscles and the posterior tibial vessels and tibial nerve into the sole 910 of foot 900. In order to prevent injuries and or minimize some of the ailments mentioned above, a proper support behind the foot, along a length of the Achilles tendon, and or a proper lateral support of the ankle (on both sides) may be implemented. For example, and without limiting the scope of the present invention, a sock in accordance with the present invention may provide support to minimize conditions such as injuries and or symptoms associated with tendonitis of the foot typically caused from overuse, abnormal foot structure, trauma or other medical conditions. Overuse may result from overly stretching during increased activity such as prolonged walking or participating in competitive sports. Problems such as flat feet or high arches can create muscular imbalances that put stress on one or more tendons. A foot or ankle injury can also cause tendonitis; typically due to sudden, powerful motions like jumping or from chronic rubbing against a show—for example at the heel—resulting in tendonitis in the inflicted area. Of course, other medical conditions that cause inflammation can also lead to tendonitis, such as rheumatoid arthritis, gout, and spondyloarthropathy, which can cause Achilles tendonitis or posterior tibial tendonitis. Accordingly, in order to prevent injuries and or minimize some of the ailments mentioned above, a proper support behind the foot along a length of the Achilles tendon and or a proper support of the ankle may be implemented in accordance with the present invention. Turning to the next set of figures, FIG. 10(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention; FIG. 10(b) is a perspective side view thereof; and FIG. 10(c) is a cross-sectional side view of the sock in FIGS. 10(a)-10(b). More specifically, FIGS. 10(a)-10(c) depict sock 1000, comprising a sock body 1001 defined by a toe section 1002, a heel flap 1003, a sole 1004 extending between toe section 1002 and heel flap 1003 on a bottom portion of sock 1000, and an instep 1005 extending between the toe section 1002 and the heel flap 1003 on a top portion of sock 1000. Furthermore, sock 1000 also comprises an arch support assemblage 1006, adapted to cover an arch region of the sole 1004 of the sock 1000 excluding the toe section 1002 of the sock 1000. In some exemplary embodiments, such as the one depicted in FIG. 10(a), the toe section 1002 and instep 1005 have a first elasticity coefficient, and arch support assemblage 1006, adapted to cover an arch region of the sole 1004 of the sock 1000 excluding the toe section 1002 of the sock 1000, has a second elasticity coefficient, wherein the second elasticity coefficient is lower than the first elasticity coefficient. In some exemplary embodiments, the portion of sole 1004 of sock 1000 that is not covered by arch support assemblage 1006 comprises the first elasticity coefficient since these sections are typically formed of the same material—for example, and without limiting the scope of the present invention, using the same number of terry loops throughout. Furthermore, sock 1000 also comprises an Achilles support assemblage 1007, adapted to cover a portion of an Achilles tendon of a wearer of the sock 1000. In some exemplary embodiments, such as the one depicted in FIG. 10(a), Achilles support assemblage 1007 runs from a top edge of the heel flap 1003 to a top portion of a leg of sock body 1001 of sock 1000, terminating at an edge between the leg of sock body 1001 and cuff 1008. In some exemplary embodiments, Achilles support assemblage 1007 comprises a narrow band situated along a posterior region of the leg of sock body 1001 that lays adjacent and is adapted to cover a portion of the Achilles tendon of the wearer, wherein the narrow band includes a first region 1009 that is narrow and extends upwards from a distal end of heel flap 1003 towards cuff 1008 along a center posterior portion of the leg of sock body 1001, and a second region 1010 that widens as Achilles support assemblage 1007 reaches a distal edge of cuff 1008. In some exemplary embodiments, Achilles support assemblage 1007 has an elasticity coefficient that is lower than the elasticity coefficient of the sock body 1001. In some exemplary embodiments, Achilles support assemblage 1007 has an elasticity coefficient that is equal to the elasticity coefficient of the arch support assemblage 1006. In some exemplary embodiments, Achilles support assemblage 1007 has an elasticity coefficient that is lower than the elasticity coefficient of the sock body 1001, but not necessarily equal to an elasticity coefficient of arch support assemblage 1006. In some exemplary embodiments, Achilles support assemblage 1007 has an elasticity coefficient that is equal to the elasticity coefficient of the heel flap 1003. In some exemplary embodiments, arch support assemblage 1006, Achilles support assemblage 1007, and heel flap 1003 have the same elasticity coefficient, and that elasticity coefficient is lower than an elasticity coefficient of sock body 1001 (i.e. which in some embodiments, this region of the sock with a higher elasticity coefficient includes toe section 1002, the leg of sock body 1001, and sole 1004). In some exemplary embodiments, Achilles support assemblage 1007 and the heel flap 1003 of sock 1000 comprise an integral component adhered to sock body 1001 of sock 1000. In some exemplary embodiments, Achilles support assemblage 1007 is separately adhered or constructed into sock body 1001 as a first component, heel flap 1003 of sock 1000 is separately adhered or constructed into sock body 1001 as a second component, and arch support assemblage 1007 is separately adhered or constructed into sock body 1001 of sock 1000 as a third component. Materials and construction of Achilles support assemblage 1007 may vary without deviating from the scope of the present invention. In some embodiments, Achilles support assemblage comprises a denser weave than the remaining regions of sock 1000, although it does not employ the oft-used terry loops, as the terry loop weave is much better fit for cushioning than providing structural support and stability. Rather, in one non-limiting embodiment, Achilles support assemblage 1007 may employ tuck stitching to achieve a denser weave in which a given sock segment may have multiple rows of stitching overlain. The sock 1000 may employ terry loops elsewhere in the sock, where perhaps support and stability are not the goal. Accordingly, Achilles support assemblage 1007 may be stiffer than other parts of the sock (including the arch support assemblage 1006). In some exemplary embodiments, components other than threaded materials that may be woven into sock 1000 may form the construction of Achilles support assemblage 1007. For example, and without limiting the scope of the present invention, padded materials, silicon, rubber or other materials may be used and or implemented with Achilles support assemblage 1007 in order to provide a desired stiffness. In the cross-sectional view of FIG. 10(c), it may be appreciated that in some exemplary embodiments sock 1000 comprises a layer 1011 that comprises an elasticity coefficient that is lower than an elasticity coefficient of the remaining portion of sock body 1001. As mentioned above, the elasticity coefficient of layer 1011 is lower than an elastic coefficient of the remaining sock body 1001. This construction stiffens the affected regions of sock 1000 such that added support is provided to the foot. With respect to the arch support assemblage, the structural support aids the arch in a manner consistent with the disclosure above with reference to earlier figures. With respect to the Achilles support assemblage, the structural support aids by minimizing movement or decrease range in motion of the foot at the areas covered by the support assemblage. This helps prevents or minimizes injuries to associated with the Achilles tendon. Furthermore, the added support of Achilles support assemblage reduces helps prevents or minimizes injuries due to inflammation of the bursa 906 and 907. Turning to the next set of figures, FIG. 11(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention; FIG. 11(b) is a perspective side view thereof; and FIG. 11(c) is a cross-sectional side view of the sock in FIGS. 11(a)-11(b). More specifically, FIGS. 11(a)-11(c) depict sock 1100, which is similar to sock 1000, with the notable exception that sock 1100 excludes an arch support assemblage at the sole of the sock. Accordingly, in such exemplary embodiments in which an arch support assemblage is excluded, sock 1100 may comprise a sock body 1101 defined by a toe section 1102, a heel flap 1103, a sole 1104 extending between toe section 1102 and heel flap 1103 on a bottom portion of sock 1100, and an instep 1105 extending between the toe section 1102 and the heel flap 1103 on a top portion of sock 1100. As such, although sock 1100 excludes an arch support assemblage, sock 1100 comprises an Achilles support assemblage 1107. In some exemplary embodiments, Achilles support assemblage 1107 comprises a narrow band situated along a posterior region of the leg of sock body 1101 that lays adjacent and is adapted to cover a portion of the Achilles tendon of the wearer, wherein the narrow band includes a first region 1109 that is narrow and extends upwards from a distal end of heel flap 1103 towards cuff 1108 along a center posterior portion of the leg of sock body 1101, and a second region 1110 that widens as Achilles support assemblage 1107 reaches a distal edge of cuff 1008. In some exemplary embodiments, Achilles support assemblage 1107 has an elasticity coefficient that is lower than the elasticity coefficient of the sock body 1101. In some exemplary embodiments, Achilles support assemblage 1107 has an elasticity coefficient that is equal to the elasticity coefficient of the heel flap 1103. In some exemplary embodiments, Achilles support assemblage 1107 and heel flap 1103 have the same elasticity coefficient, and that elasticity coefficient is lower than an elasticity coefficient of sock body 1101 (i.e. which in some embodiments, this region of the sock with a higher elasticity coefficient includes toe section 1102, the leg of sock body 1101, and sole 1104). In some exemplary embodiments, Achilles support assemblage 1107 and the heel flap 1103 of sock 1100 comprise an integral component adhered to sock body 1101 of sock 1100. In some exemplary embodiments, Achilles support assemblage 1107 is separately adhered or constructed into sock body 1101 as a first component, and heel flap 1103 of sock 1000 is separately adhered or constructed into sock body 1101 as a second component. Moreover, as mentioned with regard to Materials and construction of Achilles support assemblage 1107, different materials and or manners of construction may be implemented in order to achieve a desired stiffness of Achilles support assemblage 1107. In the cross-sectional view of FIG. 11(c), it may be appreciated that in some exemplary embodiments sock 1100 comprises a layer 1111 that comprises an elasticity coefficient that is lower than an elasticity coefficient of the remaining portion of sock body 1101. Notably, the extra support layer 1111 does not extend into the arch region of the sole of sock 11000 since this embodiment does not include an arch support assemblage. As mentioned above, this construction stiffens the affected regions of sock 1100 such that added support is provided to the foot. Turning now to the next set of figures, FIG. 12(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention; FIG. 12(b) is a perspective side view thereof; and FIG. 12(c) is a cross-sectional side view of the sock in FIGS. 12(a)-12(b). More specifically, FIGS. 12(a)-12(c) depict sock 1200, which includes an Achilles support assemblage 1201 that is structured differently than Achilles support assemblages 1007 or 1107. In this embodiment, Achilles support assemblage 1201 comprises a plurality of lateral bands or strips 1202 aligned along a height of the leg 1203 of the sock 1200, each strip laying adjacent to a portion of the Achilles tendon and adapted to cover a portion of the Achilles tendon of the wearer, wherein the plurality of strips 1202 includes a first terminal end strip 1202 a that is shorter in relation to a second terminal end strip 1202 b situated at the top of sock leg 1203 near an edge of cuff 1208. Each of the strips 1202 of Achilles support assemblage 1201 are aligned and spaced apart from a distal end of heel flap 1204 towards cuff 1208 along a center posterior portion of the leg 1203 of sock 1200, with each successive strip longer that the strip below so that the region covered by each strip widens as Achilles support assemblage 1201 reaches a distal edge of cuff 1208. In this embodiment, heel flap 1204 may include a heel flap lip 1205 that forms a part of the support provided by Achilles support assemblage 1201. As mentioned with regard to materials and construction of an Achilles support assemblage in accordance with other embodiments of the present invention, different materials and or manners of construction may be implemented in order to achieve a desired stiffness of Achilles support assemblage 1201. In the embodiment depicted by FIGS. 12(a)-12(c) an arch support assemblage 1206 may be provided. In exemplary embodiments, arch support assemblage 1206 is similar to one of the various arch support assemblages described above with respect to previous embodiments, and as such is similarly adapted to cover an arch region of the sole of the sock 1200 excluding the toe section of sock 1200. In the cross-sectional view of FIG. 12(c), it may be appreciated that in some exemplary embodiments sock 1200 comprises a support layer 1207 that includes an elasticity coefficient that is lower than an elasticity coefficient of the remaining portion of sock 1200. As mentioned above, the elasticity coefficient of layer 1207 is lower than an elastic coefficient of the remaining sock 1200. This construction stiffens the affected regions of sock 1200 such that added support is provided to the foot, as mentioned above. From this view a plurality of spaces 1202 c may be appreciated laying in between each of the plurality of strips 1202 that form Achilles support assemblage 1201. Turning to the next set of figures, FIG. 13(a) is a back view of a sock in accordance with an exemplary embodiment of the present invention; FIG. 13(b) is a side view thereof; and FIG. 13(c) is a bottom view of the sock in FIGS. 13(a)-13(b). More specifically, FIGS. 13(a)-13(c) depict sock 1300, which includes a sock body 1301 defined by a toe section 1302, a heel flap 1303, a sole 1304 extending between the toe section 1302 and the heel flap 1303 on a bottom portion of the sock 1300, and an instep 1305 extending between the toe section 1302 and the heel flap 1303 on a top portion of the sock, the toe section 1302 and instep 1305 having a first elasticity coefficient. Moreover, sock 1300 includes an arch support assemblage 1306, adapted to cover an arch region of the sole 1304 of the sock 1300 excluding the toe section 1302 of the sock 1300 and in some embodiments as shown also excluding the heel flap 1303 of sock 1300 as well as the remainder of sole 1304, the arch support assemblage 1306 having a second elasticity coefficient, wherein the second elasticity coefficient is lower than the first elasticity coefficient such that this region of the sock comprises a stiffer more resilient structure. Moreover, sock 1300 includes an Achilles support assemblage 1307. Achilles support assemblage 1307 is adapted to cover a portion of an Achilles tendon of a wearer of the sock 1300. In some exemplary embodiments, such as the one depicted in FIG. 13(a), Achilles support assemblage 1307 runs from a top edge of the heel flap 1303 to a top portion of leg 1301 a of sock body 1301 of sock 1300, terminating at an edge between the leg of sock body 1301 and cuff 1308. In some exemplary embodiments, Achilles support assemblage 1307 comprises a narrow band situated along a posterior region of the leg of sock body 1301 that lays adjacent and is adapted to cover a portion of the Achilles tendon of the wearer, wherein the narrow band includes a first region 1309 that is narrow and extends upwards from a distal end of heel flap 1303 towards cuff 1308 along a center posterior portion of the leg of sock body 1301, and a second region 1310 that widens as Achilles support assemblage 1307 reaches a distal edge of cuff 1308. In some exemplary embodiments, Achilles support assemblage 1307 has an elasticity coefficient that is lower than the elasticity coefficient of the sock body 1301. In some exemplary embodiments, Achilles support assemblage 1307 has an elasticity coefficient that is equal to the elasticity coefficient of the arch support assemblage 1306. In some exemplary embodiments, Achilles support assemblage 1307 has an elasticity coefficient that is lower than the elasticity coefficient of the sock body 1301, but not necessarily equal to an elasticity coefficient of arch support assemblage 1306. In some exemplary embodiments, Achilles support assemblage 1307 has an elasticity coefficient that is equal to the elasticity coefficient of the heel flap 1303. In some exemplary embodiments, arch support assemblage 1306, Achilles support assemblage 1307, and heel flap 1303 have the same elasticity coefficient, and that elasticity coefficient is lower than an elasticity coefficient of sock body 1301 (i.e. which in some embodiments, this region of the sock with a higher elasticity coefficient includes toe section 1302, the leg of sock body 1301, and sole 1304). In some exemplary embodiments, Achilles support assemblage 1306 and the heel flap 1303 of sock 1300 comprise an integral component adhered to sock body 1301 of sock 1300. In some exemplary embodiments, Achilles support assemblage 1306 is separately adhered or constructed into sock body 1301 as a first component, heel flap 1303 of sock 1300 is separately adhered or constructed into sock body 1301 as a second component, and arch support assemblage 1306 is separately adhered or constructed into sock body 1301 of sock 1300 as a third component. Moreover, sock 1300 includes an ankle support assemblage 1311. Ankle support assemblage 1310 comprises a pair of bands or strips 1311 a and 1311 b extending from the Achilles support assemblage 1307 to distal end of the hell flap 1303 of the sock 1300, adapted to cover a portion of an ankle of the wearer of the sock. More specifically, a first strip 1311 a may be a peroneal strip adapted to partially cover or run adjacent to an outer portion of the ankle of the wearer, or more specifically cover a portion of the peroneal tendons that run behind the lateral malleolus or the bony bit on the outside of the outer ankle. On the opposite side of sock 1300, a second strip 1311 b may be a posterior tibial strip adapted to partially cover or run adjacent to an inner portion of the ankle of the wearer, or more specifically cover a portion of the posterior tibialis tendon that wraps around the inside of the ankle (medial malleolus) and instep of the foot of the wearer. In exemplary embodiments, each of peroneal strip 1311 a and posterior tibial strip 1311 b may have an elasticity coefficient that is lower than an elasticity coefficient of the remaining of the sock body 1301. As such, the portion of the sock body outside of strips 1311 a and 1311 b, including the spaces formed between each strip such as space 1312, will have a higher elasticity coefficient than each strip 1311 a and 1311 b since each strip comprises a denser or more rigid construction. In exemplary embodiments, as shown in FIG. 13(a) and FIG. 13(b), ankle support assemblage 1311 further comprises a third strip or wrap 1311 c, which may be a peroneal tendon wrap that wraps around the sole 1304 of the sock 1300 connecting with a posterior region of the arch support assemblage 1306. More specifically, wrap 1311 c wraps along the outer side of the sock 1300 and underneath the wearer's heel such that the peroneal tendon wrap 1311 c connects both the heel flap 1303 and the arch support assemblage 1306 with the Achilles support assemblage 1307. In some exemplary embodiments, ankle support assemblage 1311 has an elasticity coefficient that is lower than the elasticity coefficient of the sock body 1301. In some exemplary embodiments, ankle support assemblage 1311 has an elasticity coefficient that is equal to the elasticity coefficient of the arch support assemblage 1306. In some exemplary embodiments, ankle support assemblage 1311 has an elasticity coefficient that is lower than the elasticity coefficient of the sock body 1301, but not necessarily equal to an elasticity coefficient of arch support assemblage 1306. FIG. 13(c) is a bottom view of the sock in FIGS. 13(a)-13(b). From this view, it may be appreciated how the peroneal tendon wrap 1311 c connects both the heel flap 1303 and the arch support assemblage 1306 with the Achilles support assemblage 1307. More specifically, the boundaries of the support assemblages (i.e. arch support assemblage 1306 and ankle support assemblage 1311) that divide the sole 1304 of sock 1300 into different regions are described with reference to this figure. That is, in accordance with some exemplary embodiments of the present invention, sole 1304 may include a first region that has a higher elasticity coefficient than a second region, wherein the second region includes the arch support assemblage 1306, peroneal tendon wrap 1311 c of ankle support assemblage 1310, and heel flap 1302. In accordance with some exemplary embodiments of the present invention, sole 1304 may include a first region that has a higher elasticity coefficient than a second region, wherein the second region includes the arch support assemblage 1306 and peroneal tendon wrap 1311 c of ankle support assemblage 1310, but excludes heel flap 1302 (i.e. heel flap 1303 may have in some exemplary embodiments an elasticity coefficient equal to that of the first region or sole 1304, or heel flap 1303 may have a lower elasticity coefficient than sole 1304 but nonetheless higher elasticity coefficient than the arch support assemblage 1306 and peroneal tendon wrap 1311 c of ankle support assemblage 1310). From this view, it may be appreciated that arch support assemblage 1306 may include a first perimetric boundary 1306 a on an outer bottom portion of sole 1304 of sock 1300; a second perimetric boundary 1306 b that runs roughly parallel to the first perimetric boundary 1306 a; a third perimetric boundary 1306 c that runs roughly perpendicular to the first and second perimetric boundaries and along a distal end of toe section 1302; and a fourth perimetric boundary 1306 d that runs roughly perpendicular to the first and second perimetric boundaries and roughly parallel to the third perimetric boundary 1306 c and along a distal end of heel flap 1303 touching a portion of peroneal tendon wrap 1311 c of ankle support assemblage 1311. Ankle support assemblage 1311 is almost entirely above the sole and thus not visible in FIG. 13(c) with the exception of peroneal tendon wrap 1311 c, which together with perimetric boundary 1306 c of arch support assemblage 1306 touch a distal end of heel flap 1303 situated at a bottom portion of sock 1300 along sole 1304. Materials and construction of ankle support assemblage 1311 may vary without deviating from the scope of the present invention. In some embodiments, ankle support assemblage 1311 (including as mentioned above strips 1311 a, 1311 b and wrap 1311 c) comprises a denser weave than the remaining regions of sock 1300, although it does not employ the oft-used terry loops, as the terry loop weave is much better fit for cushioning than providing structural support and stability. In other exemplary embodiments, ankle support assemblage 1311 may employ tuck stitching to achieve a denser weave in which a given sock segment may have multiple rows of stitching overlain. The sock 1300 may employ terry loops elsewhere in the sock, where perhaps support and stability are not the goal. Accordingly, ankle support assemblage 1311 is typically stiffer than other parts of the sock. In some exemplary embodiments, components other than threaded materials that may be woven into sock 1300 may form the construction of ankle support assemblage 1311. For example, and without limiting the scope of the present invention, padded materials, silicon, rubber or other materials may be used and or implemented with ankle support assemblage 1311 (including implementation of the same into one or more of strips 1311 a, 1311 b and wrap 1311 c) in order to provide a desired stiffness and thus desired support for the target region of the foot. A sock with one or more support assemblages, which provides additional structural support and stability to one or more regions of the foot, has been described. The foregoing description of the various exemplary embodiments of the invention has been presented for the purposes of illustration and disclosure. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention not be limited by this detailed description, but by the claims and the equivalents to the claims. DESCRIPTION OF THE REFERENCE SYMBOLS 100: Foot 102: Fibula 104: Tibia 106: Talus 108: Navicular 110: Cuneiforms 112: Calcaneus 114: Cuboid 116: Metatarsals 118: Phalanges 220: Lateral ball 222: Medial ball 224: Transverse arch 226: Lateral longitudinal arch 228: Medial longitudinal arch 230: Arch region 250: Arch support assemblage 332: Heel 334: Flat arch 436: Sock 438: Sock leg 440: Heel flap 442: Arch support assemblage 444: Sock instep 446: Sock toe 848: Medial longitudinal support 850: Lateral longitudinal support 852: Transverse support 854: Heel support 900: Foot 901: Achilles tendon 902: Calcaneus 903: Posterior tibialis tendon 904: Instep 905: Flexor digitorum longus tendon 906: Retrocalcaneal bursa 907: Retroachilles bursa 908: Flexor hallucis longus tendon 909: Flexor retinaculum 910: Sole 1000: Sock 1001: Sock body 1002: Toe section 1003: Heel flap 1004: Sole 1005: Instep 1006: Arch support assemblage 1007: Achilles support assemblage 1008: Cuff 1009: First region 1010: Second region 1011: Layer 1100: Sock 1101: Sock body 1102: Toe section 1103: Heel flap 1104: Sole 1105: Instep 1106: Arch support assemblage 1107: Achilles support assemblage 1108: Cuff 1109: First region 1110: Second region 1111: Layer 1200: Sock 1201: Achilles support assemblage 1202: Lateral bands or strips 1202 a: First terminal end strip 1202 b: Second terminal end strip 1202 c: Spacing (between lateral bands or strips) 1203: Height of the leg 1204: Heel flap 1205: Heel flap lip 1206: Arch support assemblage 1207: Layer 1208: Edge of cuff 1300: Sock 1301: Sock body 1301 a: Leg 1302: Toe section 1303: Heel flap 1304: Sole 1305: Instep 1306: Arch support assemblage 1307: Achilles support assemblage 1308: Cuff 1309: First region 1310: Second region 1311: Ankle support assemblage 1311 a: Peroneal strip 1311 b: Posterior tibial strip 1311 c: Peroneal tendon wrap What is claimed is: 1. A sock, comprising: a sock body defined by a toe section, a heel flap, a sole extending between the toe section and the heel flap on a bottom portion of the sock, and an instep extending between the toe section and the heel flap on a top portion of the sock, the toe section and the instep having a first elasticity coefficient; an arch support assemblage, adapted to cover an arch region of the sole of the sock excluding the toe section of the sock, the arch support assemblage having a second elasticity coefficient, wherein the second elasticity coefficient is lower than the first elasticity coefficient; and an Achilles support assemblage, adapted to cover an Achilles tendon of a wearer of the sock, the Achilles support assemblage running from a top edge of the heel flap to a top portion of a leg of the sock. 2. The sock of claim 1, wherein the Achilles support assemblage has an elasticity coefficient that is lower than the first elasticity coefficient. 3. The sock of claim 1, wherein the Achilles support assemblage has an elasticity coefficient that is equal to the second elasticity coefficient. 4. The sock of claim 1, wherein the Achilles support assemblage comprises a narrow band adapted to cover the Achilles tendon of the wearer. 5. The sock of claim 4, wherein the narrow band widens at a top region of a rear portion of the leg of the sock. 6. The sock of claim 1, further comprising: an ankle support assemblage adapted to cover a portion of an ankle of the wearer of the sock. 7. The sock of claim 1, wherein the ankle support assemblage has an elasticity coefficient that is lower than the first elasticity coefficient. 8. The sock of claim 1, wherein the ankle support assemblage has an elasticity coefficient that is equal to the second elasticity coefficient. 9. The sock of claim 7, wherein the ankle support assemblage comprises a pair of bands extending from the Achilles support assemblage to distal end of the hell flap of the sock. 10. The sock of claim 9, wherein at least one of the pair of bands of the ankle support assemblage wraps around the sole of the sock connecting with a posterior region of the arch support assemblage. 11. The sock of claim 1, wherein the Achilles support assemblage comprises a plurality of lateral bands aligned along a height of the leg of the sock adapted to cover the Achilles tendon of the wearer. 12. A sock, comprising: a sock body defined by a toe section, a heel flap, a sole extending between the toe section and the heel flap on a bottom portion of the sock, and an instep extending between the toe section and the heel flap on a top portion of the sock, the toe section and instep having a first elasticity coefficient; and an Achilles support assemblage, adapted to cover an Achilles tendon of a wearer of the sock, the Achilles support assemblage running from a top edge of the heel flap to a top portion of a leg of the sock, the Achilles support assemblage having a second elasticity coefficient that is lower than the first elasticity coefficient. 13. The sock of claim 12, wherein the heel flap of the sock has an elasticity coefficient that is lower than the first elasticity coefficient. 14. The sock of claim 12, wherein the heel flap of the sock has an elasticity coefficient that is equal to the second elasticity coefficient. 15. The sock of claim 12, wherein the Achilles support assemblage comprises a narrow band running from the top edge of the heel flap to the top portion of the leg of the sock and widening at a top region of a rear portion of the leg of the sock. 16. The sock of claim 12, wherein the Achilles support assemblage and the heel flap of the sock comprise an integral component adhered to the sock. 17. The sock of claim 12, further comprising: an arch support assemblage, adapted to cover an arch region of the sole of the sock excluding the toe section of the sock, the arch support assemblage having an elasticity coefficient that is lower than the first elasticity coefficient. 18. A sock, comprising: a sock body defined by a toe section, a heel flap, a sole extending between the toe section and the heel flap on a bottom portion of the sock, and an instep extending between the toe section and the heel flap on a top portion of the sock, the toe section and instep having a first elasticity coefficient; an arch support assemblage, adapted to cover an arch region of the sole of the sock excluding the toe section of the sock, the arch support assemblage having a second elasticity coefficient, wherein the second elasticity coefficient is lower than the first elasticity coefficient; an Achilles support assemblage, adapted to cover an Achilles tendon of a wearer of the sock, the Achilles support assemblage running from a top edge of the heel flap to a top portion of the leg of the sock; and an ankle support assemblage adapted to cover a portion of an ankle of the wearer of the sock, including a pair of bands extending from the Achilles support assemblage to a distal end of the hell flap of the sock, wherein at least one of the pair of bands of the ankle support assemblage wraps around the sole of the sock connecting with a posterior region of the arch support assemblage. 19. The sock of claim 1, wherein the ankle support assemblage has an elasticity coefficient that is lower than the first elasticity coefficient. 20. The sock of claim 1, wherein the ankle support assemblage has an elasticity coefficient that is equal to the second elasticity coefficient.

2018-09-04

en

2018-12-27

US-201715700201-A

Concave display ABSTRACT A concave display including a first substrate, a second substrate, a display medium, a color filter layer, an optical film and an active device layer is provided. The second substrate is disposed opposite to the first substrate. The display medium is disposed between the first substrate and the second substrate. The color filter layer is disposed on the first substrate. The active device layer is disposed on the first substrate or the second substrate. The optical film is disposed on the first substrate. The optical film is further away from the display medium than the color filter. The optical film includes a base material and optical microstructures embedded in the base material, wherein a refractive index of each of the optical microstructures is smaller than a refractive index of the base material. CROSS-REFERENCE TO RELATED APPLICATION This application claims the priority benefit of Taiwan application serial no. 105218167, filed on Nov. 28, 2016. The entirety of the above-mentioned patent application is hereby incorporated by reference herein and made a part of this specification. BACKGROUND OF THE INVENTION Field of the Invention The invention relates to a display, and particularly relates to a concave display. Description of Related Art Along with development of technology, the application of curved displays is more and more extensive. For example, the curved displays have been widely applied in wearable devices, mobile phones, televisions, etc. Devices that are often used in daily life may all be installed with the curved surfaces, which represents a great market potential of the curved displays. The curved displays include convex displays and concave displays. A display surface of the convex display protrudes towards a user. A display surface of the concave display is recessed towards a direction away from the user. However, in the conventional concave display, lights emitted from both sides of the concave display are concentrated to the center to cause problems such as color mixing, rainbow stripes, display brightness unevenness, etc., which causes quality decrease of the concave display. SUMMARY OF THE INVENTION The invention is directed to a concave display, which has a good performance. The invention provides a concave display including a first substrate, a second substrate, a display medium, a color filter layer, an optical film and an active device layer. The second substrate is disposed opposite to the first substrate. The display medium is disposed between the first substrate and the second substrate. The color filter layer is disposed on the first substrate. The active device layer is disposed on the first substrate or the second substrate. The optical film is disposed on the first substrate, and the optical film is farther away from the display medium than the color filter layer. The optical film includes a base material and optical microstructures embedded in the base material, where a refractive index of each of the optical microstructures is smaller than a refractive index of the base material. In an embodiment of the invention, at least a part of the optical microstructures are not parallel to each other. In an embodiment of the invention, the first substrate has a first concave surface, the first concave surface has a first lowest point and a first edge and a second edge respectively located at two opposite sides of the first lowest point. The optical microstructures include a plurality of first optical microstructures and a plurality of second optical microstructures. The first optical microstructures are located between the first edge and the first lowest point and are inclined from the first lowest point toward the first edge. The second optical microstructures are located between the second edge and the first lowest point and are inclined from the first lowest point toward the second edge. In an embodiment of the invention, the second substrate, the display medium and the first substrate are sequentially stacked in a first direction. Each of the first optical microstructures and the first direction include an angle α1. The angle α1 is increased as the first optical microstructure is away from the first lowest point. Each of the second optical microstructures and the first direction include an angle α2. The angle α2 is increased as the second optical microstructure is away from the first lowest point. In an embodiment of the invention, the second substrate, the display medium and the first substrate are sequentially stacked in a first direction, and the optical microstructures further include a plurality of third optical microstructures. The third optical microstructures are located in a region where the first lowest point is located, where each of the third optical microstructures is substantially parallel to the first direction. In an embodiment of the invention, the first substrate has a first concave surface, the first concave surface has a first lowest point, and a distribution density of the optical microstructures in a region away from the first lowest point is greater than a distribution density of the optical microstructures in a region close to the first lowest point. In an embodiment of the invention, the concave display further includes a reflective layer. The reflective layer is disposed on the second substrate. The reflective layer includes a plurality of reflective microstructures. The reflective microstructures respectively have a plurality of reflective surfaces, and at least a part of the reflective surfaces are inclined relative to the second substrate. In an embodiment of the invention, the second substrate, the display medium and the first substrate are sequentially stacked in the first direction, the second substrate has a second concave surface, the second concave surface has a second lowest point and a third edge and a fourth edge respectively located at two opposite sides of the second lowest point. The reflective microstructures include a plurality of first reflective microstructures and a plurality of second reflective microstructures. The first reflective microstructures are located between the third edge and the second lowest point. Each of the first reflective microstructures has a first reflective surface, and the first reflective surface faces an edge of the concave display. The second reflective microstructures are located between the fourth edge and the second lowest point. Each of the second reflective microstructures has a second reflective surface, and the second reflective surface faces the edge of the concave display. In an embodiment of the invention, the first reflective surface and the second substrate include an angle β1, and the angle β1 is increased as the first reflective microstructure is away from the second lowest point. The second reflective surface and the second substrate include an angle β2. The angle β2 is increased as the second reflective microstructure is away from the second lowest point. In an embodiment of the invention, the reflective microstructures further include a plurality of third reflective microstructures. The third reflective microstructures are located in a region where the second lowest point is located, where each of the third reflective microstructures has a third reflective surface, and the third reflective surface is substantially parallel to the second substrate. In an embodiment of the invention, a distribution density of the reflective microstructures in a region away from the second lowest point is greater than a distribution density of the reflective microstructures in a region close to the second lowest point. According to the above description, the concave display of an embodiment of the invention includes the optical film. The optical film includes a base material and a plurality of optical microstructures respectively embedded in the base material, where a refractive index of each of the optical microstructures is smaller than a refractive index of the base material. When a light emitting from the display medium of the concave display passes through the optical film, the light is deflected by the optical film, such that the light originally concentrated to the center of the concave display is adjusted to be deflected towards the edge of the display panel. In this way, the problems of the conventional technique such as color mixing, rainbow stripes, display brightness unevenness, etc., can be mitigated. In order to make the aforementioned and other features and advantages of the invention comprehensible, several exemplary embodiments accompanied with figures are described in detail below. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification. The drawings illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention. FIG. 1A is a cross-sectional view of a concave display according to an embodiment of the invention. FIG. 1B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 1A. FIG. 2 is a cross-sectional view of a portion of an optical film according to an embodiment of the invention. FIG. 3 is a cross-sectional view of a concave display according to another embodiment of the invention. FIG. 4A is a cross-sectional view of a concave display according to still another embodiment of the invention. FIG. 4B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 4A. FIG. 5A is a cross-sectional view of a concave display according to still another embodiment of the invention. FIG. 5B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 5A. FIG. 6A is a cross-sectional view of a concave display according to still another embodiment of the invention. FIG. 6B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 6A. DESCRIPTION OF EMBODIMENTS FIG. 1A is a cross-sectional view of a concave display according to an embodiment of the invention. FIG. 1B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 1A. Referring to FIG. 1A and FIG. 1B, the concave display 100 includes a first substrate 110, a second substrate 120, a display medium 130, a color filter layer 140, an optical film 150 and an active device layer 170. The second substrate 120 is disposed opposite to the first substrate 110. The display medium 130 is disposed between the first substrate 110 and the second substrate 120. The color filter layer 140 is disposed on the first substrate 110. The optical film 150 is disposed on the first substrate 110, and is farther away from the display medium 130 than the color filter layer 140. The optical film 150 includes a base material 152 and a plurality of optical microstructures 154 embedded in the base material 152, where a refractive index of each of the optical microstructures 154 is smaller than a refractive index of the base material 152. In the present embodiment, the display medium 130 is, for example, liquid crystal, though the invention is not limited thereto, and in other embodiments, the display medium 130 may also be other suitable material, for example, an organic electroluminescent layer, etc. In the present embodiment, the active device layer 170 may be selectively disposed on the second substrate 120, and is located between the second substrate 120 and the display medium 130. However, the invention is not limited thereto, and in other embodiment, the active device layer 170 may also be disposed on the first substrate 110, which is described below with reference of other figures in subsequent paragraphs. For example, in the present embodiment, the active device layer 170 includes a plurality of thin-film transistors (TFTs, not shown), a plurality of scan lines electrically connected to gates of the TFTs, a plurality of data lines electrically connected to sources of the TFTs and a plurality of pixel electrodes electrically connected to drains of the TFTs. However, the invention is not limited thereto, and in other embodiment, the active device layer 170 may also include other proper components. Referring to FIG. 1A, in the present embodiment, the color filter layer 140 is located at an inner side of the first substrate 110, and the optical film 150 may be located at an outer side of the first substrate 110. In other words, the first substrate 110, the second substrate 120 and the display medium 130 form a cell, and the optical film 150 may be located outside the cell. However, the invention is not limited thereto, and in other embodiment, the optical film 150 may also be located at the inner side of the first substrate 110. To be specific, the optical film 150 may be located between the first substrate 110 and the color filter layer 140. In other words, in other embodiment, the optical film 150 may be located within the cell. Referring to FIG. 1B, in the present embodiment, the optical film 150 includes a plurality of optical microstructures 154. The optical microstructures 154 are arranged on a first concave surface 112 of the first substrate 110. At least a part of the optical microstructures 154 are not parallel with each other. To be specific, the optical microstructures 154 include a plurality of first optical microstructures 154 a, a plurality of second optical microstructures 154 b and a plurality of optical microstructures 154 c. The first substrate 110 has the first concave surface 112. The first concave surface 112 has a first lowest point 112 a and a first edge 112 b and a second edge 112 c respectively located at two opposite sides of the first lowest point 112 a. The first optical microstructures 154 a are located between the first edge 112 b and the first lowest point 112 a and are inclined from the first lowest point 112 a toward the first edge 112 b. In other words, the second substrate 120, the display medium 130 and the first substrate 110 are sequentially stacked in a first direction D1, and the first optical microstructures 154 a are inclined towards the first edge 112 b. The second optical microstructures 154 b are located between the second edge 112 c and the first lowest point 112 a and are inclined from the first lowest point 112 a toward the second edge 112 c. The second optical microstructures 154 b are inclined towards the second edge 112 c, and an inclined direction of the second optical microstructures 154 b is opposite to an inclined direction of the first optical microstructures 154 a. The third optical microstructures 154 c are located in a region 100 a where the first lowest point 112 a is located. The third optical microstructures 154 c are substantially perpendicular to the first concave surface 112 of the first substrate 110. Further, in the present embodiment, each of the first optical microstructures 154 a and the first direction D1 include an angle α1, the angle α1 is increased as the first optical microstructure 154 a is away from the first lowest point 112 a. Each of the second optical microstructures 154 b and the first direction D1 include an angle α2, and the angle α2 is increased as the second optical microstructure 154 b is away from the first lowest point 112 a. In other words, the farther the optical microstructure 154 is away from the center of the concave display 100, the larger an inclination degree of the optical microstructure 154, though the invention is not limited thereto. FIG. 2 is a cross-sectional view of a portion of an optical film according to an embodiment of the invention. It should be noted that FIG. 2 is an enlarged view of the optical film according to an embodiment of the invention. In detail, FIG. 2 is an enlarged view of a part of the optical film 150 in regions 100 b-100 e of FIG. 1B. Moreover, a dimension scale of each component in FIG. 2 is only schematic and is not used for limiting the invention. Referring to FIG. 1A, FIG. 1B and FIG. 2, when a light L coming from the first substrate 110 passes through the optical film 150, the light L is deflected by the optical film 150, and the light L originally concentrated to the center is adjusted to deflect towards an edge of the display panel 100. In this way, the problems of the concave display such as color mixing, rainbow stripes, display brightness unevenness, etc., are mitigated. FIG. 3 is a cross-sectional view of a concave display according to another embodiment of the invention. The concave display 100A of FIG. 3 is similar to the concave display 100 of FIG. 1A, so that the same or corresponding devices are denoted by the same or corresponding referential numbers. A difference between the concave display 100A and the concave display 100 is that a position of the active device layer 170 of the concave display 100A is different to the position of the active device layer 170 of the concave display 100. The above difference is mainly described below, and the same parts of the two concave displays may refer to the aforementioned description, and details thereof are not repeated. Referring to FIG. 3, the concave display 100A includes the first substrate 110, the second substrate 120, the display medium 130, the color filter layer 140, the optical film 150 and the active device layer 170. The second substrate 120 is disposed opposite to the first substrate 110. The display medium 130 is disposed between the first substrate 110 and the second substrate 120. The color filter layer 140 is disposed on the first substrate 110. The optical film 150 is disposed on the first substrate 110, and is farther away from the display medium 130 than the color filter layer 140. The optical film 150 includes a base material 152 and a plurality of optical microstructures 154 embedded in the base material 152, where a refractive index of each of the optical microstructures 154 is smaller than a refractive index of the base material 152. Different to the concave display 100, the active device layer 170 is disposed on the first substrate 110, and is not disposed on the second substrate 120. In other words, in the present embodiment, the active device layer 170 and the color filter layer 140 may be disposed on the same substrate to form a color filter on array (COA) structure. The concave display 100A has similar effects and advantages with that of the concave display 100, and details thereof are not repeated. FIG. 4A is a cross-sectional view of a concave display according to still another embodiment of the invention. FIG. 4B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 4A. The concave display 100B of FIG. 4A is similar to the concave display 100 of FIG. 1A, so that the same or corresponding devices are denoted by the same or corresponding referential numbers. A difference between the concave display 100B and the concave display 100 is that the optical film 150B of the concave display 100B is different to the optical film 150 of the concave display 100. The above difference is mainly described below, and the same parts of the two concave displays may refer to the aforementioned description, and details thereof are not repeated. Referring to FIG. 4A and FIG. 4B, the concave display 100B includes the first substrate 110, the second substrate 120, the display medium 130, the color filter layer 140, the optical film 150B and the active device layer 170. The second substrate 120 is disposed opposite to the first substrate 110. The display medium 130 is disposed between the first substrate 110 and the second substrate 120. The color filter layer 140 is disposed on the first substrate 110. The optical film 150 is disposed on the first substrate 110, and is farther away from the display medium 130 than the color filter layer 140. The optical film 150B includes a base material 152 and a plurality of optical microstructures 154 embedded in the base material 152, where a refractive index of each of the optical microstructures 154 is smaller than a refractive index of the base material 152. The active device layer 170 is disposed on the second substrate 120. Different to the concave display 100, a distribution density of the optical microstructures 154 in the regions 100 b-100 e located away from the first lowest point 112 a is greater than a distribution density of the optical microstructures 154 in the region 100 a located close to the first lowest point 112 a, and a distribution density of the optical microstructures 154 in the regions 100 f-100 i located away from the first lowest point 112 a is greater than the distribution density of the optical microstructures 154 in the region 100 a located close to the first lowest point 112 a. In other words, the more the region is closer to the edge of the concave display 100B, the higher the distribution density of the optical microstructures 154 in the region is, and the more the region is closer to the center of the concave display 100B, the lower the distribution density of the optical microstructures 154 in the region is. In an embodiment, none optical microstructure 154 is disposed in the region 100 a close to the first lowest point 112 a. FIG. 5A is a cross-sectional view of a concave display according to another embodiment of the invention. FIG. 5B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 5A. The concave display 100C of FIG. 5A is similar to the concave display 100 of FIG. 1A, so that the same or corresponding devices are denoted by the same or corresponding referential numbers. A difference between the concave display 100C and the concave display 100 is that the concave display 100C further includes a reflective layer 160 disposed on the second substrate 120. The above difference is mainly described below, and the same parts of the two concave displays may refer to the aforementioned description, and details thereof are not repeated. Referring to FIG. 5A and FIG. 5B, the concave display 100C includes the first substrate 110, the second substrate 120, the display medium 130, the color filter layer 140, the optical film 150 and the active device layer 170. The second substrate 120 is disposed opposite to the first substrate 110. The display medium 130 is disposed between the first substrate 110 and the second substrate 120. The color filter layer 140 is disposed on the first substrate 110. The optical film 150 is disposed on the first substrate 110, and is farther away from the display medium 130 than the color filter layer 140. The optical film 150B includes a base material 152 and a plurality of optical microstructures 154 embedded in the base material 152, where a refractive index of each of the optical microstructures 154 is smaller than a refractive index of the base material 152. The active device layer 170 is disposed on the second substrate 120. Different to the concave display 100, the concave display 100C further includes the reflective layer 160 disposed on the second substrate 120. The reflective layer 160 includes a plurality of reflective microstructures 162. The reflective microstructures 162 respectively have a plurality of reflective surfaces 164. At least a part of the reflective surfaces 164 are inclined relative to the second substrate 120. In detail, the second substrate 120 has a second concave surface 122, the second concave surface 122 has a second lowest point 122 a and a third edge 122 b and a fourth edge 122 c respectively located at two opposite sides of the second lowest point 122 a. The reflective microstructures 162 include a plurality of first reflective microstructures 162 a and a plurality of second reflective microstructures 162 b. The first reflective microstructures 162 a are located between the third edge 122 b and the second lowest point 122 a, and the second reflective microstructures 162 b are located between the fourth edge 122 c and the second lowest point 122 a. Each of the first reflective microstructures 162 a has a first reflective surface 164 a, each of the second reflective microstructures 162 b has a second reflective surface 164 b, and the first reflective surfaces 164 a and the second reflective surfaces 164 b are inclined relative to the second substrate 120. Further, the first reflective surface 164 a of the first reflective microstructure 162 a inclines and faces the edge of the concave display 100C, and the second reflective surface 164 b of the second reflective microstructure 162 b inclines and faces the edge of the concave display 100C, where an inclination direction of the first reflective surface 164 a is opposite to an inclination direction of the second reflective surface 164 b. Referring to FIG. 5A and FIG. 5B, in the present embodiment, the first reflective surface 164 a and the second substrate 120 include an angle β1, and the angle β1 is increased as the first reflective microstructure 162 a is away from the second lowest point 122 a. In other words, the farther the first reflective microstructure 162 a is away from the center of the concave display 100C, the larger an inclination degree of the first reflective surface 164 a is. The second reflective surface 164 b and the second substrate 120 include an angle β2, and the angle β2 is increased as the second reflective microstructure 162 b is away from the second lowest point 122 a. In other words, the farther the second reflective microstructure 162 b is away from the center of the concave display 100C, the larger an inclination degree of the second reflective surface 164 b is. Moreover, in the present embodiment, the reflective microstructures 162 further include a plurality of third reflective microstructures 162 c. The third reflective microstructures 162 c are located in a region 100 a where the second lowest point 122 a is located, where each of the third reflective microstructures 162 c has a third reflective surface 164 c, and the third reflective surface 164 c is substantially parallel to the second substrate 120. In the present embodiment, the reflective microstructures 162 and the optical microstructures 154 correspond to each other. To be specific, the reflective microstructures 162 located in the region 100 a correspond to the optical microstructures 154 located in the same region 100 a, the reflective microstructures 162 located in the region 100 b correspond to the optical microstructures 154 located in the same region 100 b, the reflective microstructures 162 located in the region 100 c correspond to the optical microstructures 154 located in the same region 100 c, the reflective microstructures 162 located in the region 100 d correspond to the optical microstructures 154 located in the same region 100 d, the reflective microstructures 162 located in the region 100 e correspond to the optical microstructures 154 located in the same region 100 e, the reflective microstructures 162 located in the region 100 f correspond to the optical microstructures 154 located in the same region 100 f, the reflective microstructures 162 located in the region 100 g correspond to the optical microstructures 154 located in the same region 100 g, the reflective microstructures 162 located in the region 100 h correspond to the optical microstructures 154 located in the same region 100 h, and the reflective microstructures 162 located in the region 100 i correspond to the optical microstructures 154 located in the same region 100 i. In brief, the first reflective microstructure 162 a with the larger angle β1 corresponds to the first optical microstructure 154 a with the larger angle α1, and the second reflective microstructure 162 b with the larger angle β2 corresponds to the second optical microstructure 154 b with the larger angle α2, and the third optical microstructures 154 c parallel to the first direction D1 corresponds to the third reflective microstructures 162 c having the third reflective surface 164 c parallel to the second substrate 120. The active device layer 170 includes a plurality of TFTs (not shown), a plurality of scan lines (not shown) electrically connected to gates of the TFTs, and a plurality of data lines (not shown) electrically connected to sources of the TFTs. In the present embodiment, the reflective microstructures 162 are conductive and are electrically connected to the drains of the TFTs. In other words, in the present embodiment, the reflective microstructures 162 may function as pixel electrodes. However, the invention is not limited thereto, and in other embodiment, the reflective microstructures 162 may be independently disposed outside the pixel electrodes. It should be noted that in the present embodiment, the light from external may be reflected by the reflective microstructures 162 and transmitted to the optical film 150 in a proper direction. In collaboration with a reflection function of the reflective microstructures 162 and a deflection function of the optical film 150, a transmission direction of the light passing through the optical film 150 further approaches to a direction parallel to a line of sight of the user (for example, a direction overlapped to the first direction). In this way, the problems of the conventional technique such as color mixing, rainbow stripes, display brightness unevenness, etc., can be further mitigated. FIG. 6A is a cross-sectional view of a concave display according to still another embodiment of the invention. FIG. 6B is a cross-sectional view of a first substrate and an optical film of the concave display of FIG. 6A. The concave display 100D of FIG. 6A is similar to the concave display 100C of FIG. 5A, so that the same or corresponding devices are denoted by the same or corresponding referential numbers. A difference between the concave display 100D and the concave display 100C is that the reflective layer 160D of the concave display 100D is different to the reflective layer 160 of the concave display 100C. The above difference is mainly described below, and the same parts of the two concave displays may refer to the aforementioned description, and details thereof are not repeated. Referring to FIG. 6A and FIG. 6B, the concave display 100C includes the first substrate 110, the second substrate 120, the display medium 130, the color filter layer 140, the optical film 150 and the active device layer 170. The second substrate 120 is disposed opposite to the first substrate 110. The display medium 130 is disposed between the first substrate 110 and the second substrate 120. The color filter layer 140 is disposed on the first substrate 110. The optical film 150 is disposed on the first substrate 110, and is farther away from the display medium 130 than the color filter layer 140. The optical film 150B includes a base material 152 and a plurality of optical microstructures 154 embedded in the base material 152, where a refractive index of each of the optical microstructures 154 is smaller than a refractive index of the base material 152. The active device layer 170 is disposed on the second substrate 120. In the present embodiment, a distribution density of the reflective microstructures 162 in the regions 100 b-100 e away from the second lowest point 122 a is greater than a distribution density of the reflective microstructures 162 in the region 100 a close to the second lowest point 122 a, and a distribution density of the reflective microstructures 162 in the regions 100 f-100 i away from the second lowest point 122 a is greater than a distribution density of the reflective microstructures 162 in the region 100 a close to the second lowest point 122 a. In other words, the more the region is closer to the edge of the concave display 100D, the higher the distribution density of the reflective microstructures 162 in the region is, and the more the region is closer to the center of the concave display 100D, the lower the distribution density of the reflective microstructures 162 in the region is. In an embodiment, none reflective microstructure 162 is disposed in the region 100 a close to the second lowest point 122 a. The concave display 100D and the concave display 100C have the similar effects and advantages, and details thereof are not repeated. In summary, the concave display of an embodiment of the invention includes the optical film. The optical film includes a base material and a plurality of optical microstructures respectively embedded in the base material, where a refractive index of each of the optical microstructures is smaller than a refractive index of the base material. When a light coming from the display medium passes through the optical film, the light is deflected by the optical film, such that the light originally concentrated to the center of the concave display is adjusted to be deflected towards the edge of the display panel. In this way, the problems of the conventional technique such as color mixing, rainbow stripes, display brightness unevenness, etc., can be mitigated. It will be apparent to those skilled in the art that various modifications and variations can be made to the structure of the invention without departing from the scope or spirit of the invention. In view of the foregoing, it is intended that the invention cover modifications and variations of this invention provided they fall within the scope of the following claims and their equivalents. What is claimed is: 1. A concave display, comprising: a first substrate; a second substrate, disposed opposite to the first substrate; a display medium, disposed between the first substrate and the second substrate; a color filter layer, disposed on the first substrate; an optical film, disposed on the first substrate and located farther away from the display medium than the color filter layer, and the optical film comprising: a base material; and a plurality of optical microstructures, respectively embedded in the base material, wherein a refractive index of each of the optical microstructures is smaller than a refractive index of the base material; and an active device layer, disposed on the first substrate or the second substrate. 2. The concave display as claimed in claim 1, wherein at least a part of the optical microstructures are not parallel to each other. 3. The concave display as claimed in claim 1, wherein the first substrate has a first concave surface, the first concave surface has a first lowest point and a first edge and a second edge respectively located at two opposite sides of the first lowest point, and the optical microstructures comprise: a plurality of first optical microstructures, located between the first edge and the first lowest point, and inclined from the first lowest point toward the first edge; and a plurality of second optical microstructures, located between the second edge and the first lowest point, and inclined from the first lowest point toward the second edge. 4. The concave display as claimed in claim 3, wherein the second substrate, the display medium and the first substrate are sequentially stacked in a first direction, each of the first optical microstructures and the first direction include an angle α1, the angle α1 is increased as the first optical microstructure is away from the first lowest point, each of the second optical microstructures and the first direction include an angle α2, and the angle α2 is increased as the second optical microstructure is away from the first lowest point. 5. The concave display as claimed in claim 3, wherein the second substrate, the display medium and the first substrate are sequentially stacked in a first direction, and the optical microstructures further comprise: a plurality of third optical microstructures, located in a region where the first lowest point is located, wherein each of the third optical microstructures is substantially perpendicular to the first concave surface. 6. The concave display as claimed in claim 1, wherein the first substrate has a first concave surface, the first concave surface has a first lowest point, and a distribution density of the optical microstructures in a region away from the first lowest point is greater than a distribution density of the optical microstructures in a region close to the first lowest point. 7. The concave display as claimed in claim 1, wherein the first substrate has a first concave surface, the first concave surface has a first lowest point, and the optical microstructures are not disposed in the region close to the first lowest point. 8. The concave display as claimed in claim 1, further comprising: a reflective layer, disposed on the second substrate, wherein the reflective layer comprises a plurality of reflective microstructures, the reflective microstructures respectively have a plurality of reflective surfaces, and at least a part of the reflective surfaces are inclined relative to the second substrate. 9. The concave display as claimed in claim 8, wherein the second substrate, the display medium and the first substrate are sequentially stacked in a first direction, the second substrate has a second concave surface, the second concave surface has a second lowest point and a third edge and a fourth edge respectively located at two opposite sides of the second lowest point, and the reflective microstructures comprise: a plurality of first reflective microstructures, located between the third edge and the second lowest point, wherein each of the first reflective microstructures has a first reflective surface, and the first reflective surface faces an edge of the concave display; and a plurality of second reflective microstructures, located between the fourth edge and the second lowest point, wherein each of the second reflective microstructures has a second reflective surface, and the second reflective surface faces the edge of the concave display. 10. The concave display as claimed in claim 9, wherein the first reflective surface and the second substrate include an angle β1, and the angle β1 is increased as the first reflective microstructure is away from the second lowest point; the second reflective surface and the second substrate include an angle β2, and the angle β2 is increased as the second reflective microstructure is away from the second lowest point. 11. The concave display as claimed in claim 9, wherein the reflective microstructures further comprise: a plurality of third reflective microstructures, located in a region where the second lowest point is located, wherein each of the third reflective microstructures has a third reflective surface, and the third reflective surface is substantially parallel to the second substrate. 12. The concave display as claimed in claim 9, wherein a distribution density of the reflective microstructures in a region away from the second lowest point is greater than a distribution density of the reflective microstructures in a region close to the second lowest point. 13. The concave display as claimed in claim 9, wherein the reflective microstructures are not disposed in a region close to the second lowest point.

2017-09-11

en

2018-05-31

US-201113225849-A

Mail server ABSTRACT A mail server includes an address information table in which address information is registered including ability or inability to use each mail address, and a notify party information table in which notify party information is registered specifying each notify party to notify that a mail address cannot be used. The mail server further includes a control section, which carries out a first process to judge, referring to the address information table, whether a mail address of a destination of a received mail is available or not; a second process to judge, referring to the notify party information table, whether the mail address of the source of the received mail falls within the notify party information; a third process to create a reply mail stating that the mail address of the destination cannot be used; and a fourth process to transmit the reply mail to the mail address of the source. CROSS REFERENCE This Nonprovisional application claims priority under 35 U.S.C. §119(a) on Patent Application No. 2010-199502 filed in Japan on Sep. 7, 2010, the entire contents of which are hereby incorporated by reference. BACKGROUND OF THE INVENTION The present invention relates to a mail server that administers transmission and reception of emails. A mail server administers at least one domain, and has a mail box for each mail address that has a domain it administers. Upon receiving an email (hereinafter, referred to as “mail”), the mail server, referring to header information of the mail, acquires a mail address of a destination of the mail. When a domain of the mail address of the destination accords with any domain the apparatus of its own administers, the mail server temporarily stores the received mail in a mail box for the mail address of the destination. The temporarily stored mail is downloaded by a user to a client apparatus, and is then referred to. Also, when a change of a mail address is made by a user, the mail server sets the mail address before the change (i.e., mail address from which the change has been made) being unable to be used (i.e., unavailable), while setting a mail address after the change (i.e., mail address to which the change has been made) being able to be used (i.e., available). In a case where the change includes a change of a domain, a mail server that administers the domain after the change (i.e., domain to which the change has been made) sets, based on the direction of the user, the mail address after the change being available. The mail server, on receiving a mail to a mail address before the change after the change of the mail address has been made, returns an error-informing mail to a source of the mail (i.e., the mail sender). The error-informing mail enables the mail server to notify the source of the mail that the mail address before the change cannot be used; however, this alone does not allow the mail server to notify the source of the mail of the mail address after the change. As a result, it is necessary for a user who has changed its mail address to send to many specific users notice to the effect that its mail address has been changed. Such notice is a procedure that is troublesome for the user. To eliminate such a troublesome procedure, among the conventional mail server is one that notifies, on receiving a mail to a mail address before the change, the source of the mail of the mail address after the change (refer to Japanese Patent Unexamined Publication No. 2001-111601 bulletin). The mail server includes a transfer information database, and registers therein a mail address after the change associating thereof with a mail address before the change at the time of the change of the mail address. The mail server as described in the Japanese Patent Unexamined Publication No. 2001-111601 bulletin, however, on receiving a mail to the mail address before the change, notifies any source of such mail equally of a mail address after the change. Consequently, the mail server may send notice of the mail address after the change even to a source of the mail to which it is not necessary to do so; so that it cannot protect personal information. Then, the present invention is directed to providing a mail server capable of sending notice to the effect that the mail address has been changed only to sources of mails to which it is deemed necessary to do so based on the user's decision. SUMMARY OF THE INVENTION A mail server of the present invention administers at least one domain, and comprises a mail box for storing per mail address mails to a mail address that has any said domain (hereinafter, simply referred to as “the domain”), a memory means, an acquisition means and a control means. The mail server may further comprise an address information updating means, and a notify party information updating means. The memory means stores an address information table in which address information is registered that includes ability or inability to use each mail address that has the domain, and a notify party information table in which notify party information is registered that specifies one or more notify parties that are to be notified that a mail address having the domain cannot be used. The address information updating means accepts addition, change and/or deletion of a mail address having the domain, and thereby updates the address information table. The notify party information updating means accepts addition and/or deletion of a piece of the notify party information, and thereby updates the notify party information table. The acquisition means acquires a mail address of a source of a received mail along with a mail address of its destination. The control means controls a first through a fourth processes. In the first process, the control means judges, referring to the address information table, ability or inability to use the mail address of the destination. In the second process, the control means judges, referring to the notify party information table, whether the mail address of the source of the mail falls within the notify party information. In the third process, the control means creates a reply mail stating that the mail address of the destination cannot be used. In the fourth process, the control means transmits the reply mail to the mail address of the source of the mail. The control means creates the reply mail in the third process in a case where it is judged in the first process that the mail address of the destination is unable to be used (i.e. unavailable) and where it is judged in the second process that the mail address of the source of the mail falls within the notify party information. With this configuration, the address information updating means accepts addition, updating and/or deletion of a piece of the address information, and stores the address information in the address information table beforehand; and the notify party information updating means accepts addition and/or deletion of a piece of the notify party information, and stores the notify party information in the notify party information table beforehand. The acquisition means, on receiving a mail, acquires an address of the source of the mail and an address of the destination of the mail. The control means, referring to the address information table in the first process, judges ability or inability to use the mail address of the destination; and then referring to the notify party information table in the second process, judges whether the mail address of the source of the mail falls within the notify party information. The control means creates, in the third process, the reply mail stating that the mail address of the destination cannot be used, in the case where it is judged in the first process that the mail address of the destination is unavailable and where it is judged in the second process that the mail address of the source of the mail falls within the notify party information. The control means transmits, in the fourth process, the reply mail created in the third process to the mail address of the source of the mail. Preferably, the address information updating means is configured such that upon accepting a change from a mail address having the domain to a new mail address, it associates the new mail address with the mail address having the domain, and such that it renders the mail address having the domain unavailable. In this case, the control means, referring to the address information table in the third process, makes, in the reply mail, a statement of the new mail address associated with the mail address of the destination. With this configuration, the address information updating means, on accepting the change to the new mail address, associates the new mail address with the mail address before the change, and then renders the mail address before the change unavailable. The control means creates, in the third process, the reply mail that states the mail address after the change. As a consequence, the mail server is, on receiving a mail to a mail address before the change, capable of sending notice of a mail address after the change only to a necessary source of the mail. Preferably, the notify party information is on domain. In this case, the control means, referring to the notify party information table in the third process, creates the reply mail when a domain of the mail address of the source of the mail is registered in the notify party information table. With this configuration, the control means creates the reply mail when the domain of the mail address of the source of the mail is registered in the notify party information table. As a consequence, the mail server is capable of making a decision as to whether to create the reply mail in units of domain or not. Preferably, the notify party information is on mail address. In this case, the control means, referring to the notify party information table in the third process, creates the reply mail when a mail address of the source of the mail is registered in the notify party information table. With this configuration, the control means creates the reply mail when the mail address of the source of the mail is registered in the notify party information table. As a consequence, the mail server is capable of making a decision as to whether to create the reply mail in units of mail address or not. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram showing a functional configuration of a mail server according to an embodiment of the present invention. FIG. 2 is a diagram showing an example of an address information table. FIG. 3A and FIG. 3B are diagrams each showing an example of a notify party information table. FIG. 4 is a flowchart showing an address information updating operation and a notify party information updating operation by a control section. FIG. 5 is a flowchart showing a mail reception process by the control section. DETAILED DESCRIPTION OF THE INVENTION A mail server according to an embodiment of the present invention is explained below, referring to the drawings. First of all, it is assumed that a mail server 1A is connected to a mail server 1B and client apparatus 2A, 2B through a network. Also, the numbers of the mail server 1B and the client apparatus 2A, 2B that are connected to the mail server 1A are not limited to one and two, respectively. Further, the mail server 1A carries out transmission and reception of mails to and from the mail server 1B either directly or via a DNS server (not shown). The mail server 1A includes an operating section 10, a memory section 11, a control section 12 and a communications section 13, and administers a domain (ABC.COM). The mail server 1A receives mails to mail addresses (hereinafter, referred to as “address(es)”) having the domain (ABC.COM). The operating section 10 accepts operations for addition, change and/or deletion of an address, along with operations for addition and/or deletion of a piece of notify party information, and/or the like. The memory section 11 stores an address information table 111, a notify party information table 112 and a mail box 113. The address information table 111, as shown in FIG. 2 as an example, stores destination addresses, ability or inability to use the destination addresses and new destination addresses, each of the categories being associated with others. A destination address is an address having the domain (ABC.COM). Among the destination addresses are ones currently able to be used (i.e., available) and the others currently unable to be used (i.e., unavailable). ‘Ability or inability to use’ status of a destination address indicates whether the destination address is currently available or unavailable. A new destination address is an address after a change that has become newly available by the change of a destination address. A domain of a new destination address is not limited to one having the domain (ABC.COM). The notify party information table 112, as shown in FIG. 3A and FIG. 3B each as an example, respectively stores, for each destination address, a notify party domain 112A and a notify party address 112B, both of which are for parties to which a reply mail stating that the destination address cannot be used is to be sent. The destination address indicated by ALL means all the destination addresses that are unavailable among those registered in the address information table 111. In this manner, registered in the notify party information table 112 are notify parties to all of which addresses that have become unavailable the reply mail is to be sent, along with notify parties to each of which address that has become unavailable the reply mail is to be sent. The mail box 113 is provided per every available address, and mails to each address are saved by the control section 12. The mails stored in the mail box 113 are downloaded to the client apparatus 2A and 2B by users, and then they are referred to. The mails are erased from the mail box 113 when they are downloaded to the client apparatus 2A and 2B, or after the passage of a predetermined period (such as a week or a month) after they have been saved in the mail box 113. The control section 12 updates the address information table 111 and the notify party information table 112 depending on an operational input from the operating section 10. To be concrete, as shown in FIG. 4, when the operating section 10 accepts an addition of an address ([email protected]) (S1: YES), the control section 12 adds it to the destination address ([email protected]) of the address information table 111, renders the added destination address available (S2), and then completes a process. When the operating section 10 accepts a change from an address ([email protected]) to an address ([email protected]) (S1: YES), the control section 12 renders the destination address ([email protected]) of the address information table 111 unavailable, adds the new destination address ([email protected]) associating it with the former destination address ([email protected]) (S2), and then completes a process. When the operating section 10 accepts a deletion of an address ([email protected]) (S1: YES), the control section 12 renders the destination address ([email protected]) of the address information table 111 (S2) unavailable, and completes a process. Further, when the operating section 10 accepts additions of the destination address (ALL) that is unavailable and a domain (ABC.COM) that is a piece of the notify party information (S1: NO→S3:, YES), the control section 12 adds them to the notify party information table 112, associating the notify party domain (ABC.COM) 112A with the destination address (ALL) (S4), and completes a process. When the operating section 10 accepts a deletion of a destination address ([email protected]) and a mail address ([email protected]) (S1: NO→S3: YES), the control section 12 deletes the destination address ([email protected]) and the notify party address ([email protected]) 112B associated with the destination address ([email protected]) from the notify party information table 112 (S4), and completes a process. FIG. 3A shows a state of the notify party information table 112 after the destination address (ALL) has been added to it being associated with the notify party domain (ABC.COM) 112A; and FIG. 3B shows a state of the notify party information table 112 after the destination address ([email protected]) and the notify party address ([email protected]) 112B associated with the destination address ([email protected]) have been deleted from it. The communications section 13, based on the direction from the control section 12, carries out transmission and reception of mails to and from the mail server 1B and the client apparatus 2A, 2B. Subsequently, a process flow of the control section 12 at the time of mail reception is explained referring to FIG. 5. Explained below as an exemplification is a case where the mail server 1A has received a mail to a destination address ([email protected]) from a source address ([email protected]). As shown in FIG. 5, the control section 12, waiting until the communications section 13 receives a mail (S11: NO) and on receiving a mail (S11: YES), acquires the destination address ([email protected]) and the source address ([email protected]) from the header information of the mail (S12). The control section 12, referring to the address information table 111, saves the mail in the mail box 113 for the destination address (S14) if the destination address ([email protected]) is available (S13: YES), and then completes a task. However, since the destination address ([email protected]) is unavailable (S13: NO), the control section 12, referring to the notify party information table 112, checks the domain first. That is, the control section 12 judges whether the domain (ABC.COM) of the source address ([email protected]) accords with any notify party domain 112A (S15) or not. In other words, the control section 12 judges whether the domain (ABC.COM) accords with any notify party domain 112A associated with the destination address (ALL or [email protected]). Since the domain (ABC.COM) of the source address accords with a notify party domain 112A (S15: YES), the control section 12, referring to the address information table 111, judges whether there is any new destination address associated with the destination address ([email protected]) (S17). Since the new destination address ([email protected]) is associated with the destination address ([email protected]) (S17: YES), the control section 12 transfers the mail to the new destination address ([email protected]) (S18). To be concrete, since the apparatus of its own administers the domain (ABC.COM) of the new destination address ([email protected]), the control section 12 saves the received mail in a mail box for the new destination address ([email protected]), causing the source address ([email protected]) and the destination address ([email protected]) to be a piece of header information. Or, the control section 12 may, without changing the destination address, save the received mail as it is in the mail box for the new destination address ([email protected]). Whereas in a case where the apparatus of its own does not administer the domain (ABC.COM) of the new destination address ([email protected]), the control section 12 transmits the mail to another mail server administering the domain (ABC.COM) of the new destination address ([email protected]), causing the source address ([email protected]) and the destination address ([email protected]) to be a piece of header information. The control section 12 creates a reply mail stating the new destination address ([email protected]), transmits it to the source address ([email protected]) (S19), and completes a task. The reply mail has a piece of header information including the source address ([email protected]) and the destination address ([email protected]). In a case where there is no new destination address associated with the destination address (S17: NO), the control section 12 creates a reply mail stating that the destination address ([email protected]) cannot be used, transmits it to the source address ([email protected]) (S20), and completes a task. The reply mail has a piece of header information including the source address ([email protected]) and the destination address ([email protected]). Further, in a case where a domain does not match in a domain check in step S15, or for instance, when it has received a mail to a destination address ([email protected]) from a source address (YYY@ CCC.COM), the control section 12, since the domain (CCC.COM) of the source address ([email protected]) does not accord with any notify party domain 112A (S15: NO), judges whether the source address ([email protected]) accords with any notify party address 112B (S16) or not. That is to say, the control section 12 judges whether the source address ([email protected]) accords with any notify party address 112B associated with the destination address (ALL or [email protected]) or not. The control section 12, since the source address ([email protected]) accords with a notify party address 112B (S16: YES), proceeds to S17. Also, in a case where the source address ([email protected]) does not accord with any notify party address 112B (S16: NO), the control section 12, referring to the address information table 111, judges whether there is a new destination address ([email protected]) associated with the destination address ([email protected]) (S21) or not. The control section 12, since the new destination address ([email protected]) is associated with the destination address ([email protected]) (S21: YES), transfers the mail to the new destination address ([email protected]) (S22), and completes a task. To be concrete, when the apparatus of its own administers the domain (ABC.COM) of the new destination address ([email protected]), the control section 12 may save the received mail as it is in the mail box for the new destination address ([email protected]), causing the source address ([email protected]) and the destination address ([email protected]) to be a piece of header information. Or, the control section 12 may, without changing the header information, save the received mail as it is in the mail box for the new destination address ([email protected]). In a case where the apparatus of its own does not administer the domain (ABC.COM) of the new destination address ([email protected]), the control section 12 transmits the mail to another mail server administering the domain (ABC.COM) of the new destination address ([email protected]), causing the source address ([email protected]) and the destination address ([email protected]) to be a piece of header information. In a case where a new destination address is not associated with the destination address ([email protected]) (S21: NO), the control section 12 just finish a task. As described above, it is only when a source address of a mail is registered beforehand in the notify party information table 112 as a notify party domain 112A or as a notify party address 112B that the control section 12 transmits to the source address a reply mail stating that the destination address cannot be used any more along with an indication of the new destination address. This enables the control section 12 to notify only necessary source(s) that the destination address has become unavailable and of the new destination address, thereby making it possible to protect personal information. Additionally, it has been explained in S18 and S22 of FIG. 5 that the control section 12 transfers a mail to a new destination address. However, instead of doing so, the control section 12 may transmit to the new destination address notice to the effect that the mail has reached the destination address. Further, instead of doing this, the control section 12 may transfer the mail to the new destination address in S18, and send to the new destination address notice to the effect that the mail has reached the destination address in S22. Thus, the control section 12 is capable of transferring, to a new destination address, only the mails from source addresses matching any notify party domain or any notify party address each of which is registered beforehand. Also, it has been explained in the above described embodiment that addition, change and/or deletion of an address, and addition and/or deletion of a piece of the notify party information and/or the like are accepted by the operating section 10. However, the mail server 1A may include a WEB server facility, and may accept addition, change and/or deletion of an address, and addition and/or deletion a piece of the notify party information and/or the like from the client apparatus 2A, 2B by way of WEB. The above explanation of the embodiment is nothing more than illustrative in any respect, nor should be thought of as restrictive. Scope of the present invention is indicated by claims rather than the above embodiment. Further, it is intended that all changes that are equivalent to a claim in the sense and realm of the doctrine of equivalence be included within the scope of the present invention. What is claimed is: 1. A mail server administering at least one domain and provided with a mail box for storing mails to a mail address having the domain, the mail server comprising: a memory section to store: (a) an address information table in which address information is registered that includes ability or inability to use each mail address having the domain; and (b) a notify party information table in which notify party information is registered that specifies each notify party to notify that a mail address having the domain cannot be used; an acquisition means to acquire mail addresses of a source and a destination of the received mail; and a control section for performing: (A) a first process to judge, referring to the address information table, whether the mail address of the destination is available or not; (B) a second process to judge, referring to the notify party information table, whether the mail address of the source falls within the notify party information; (C) a third process to create a reply mail stating that the mail address of the destination cannot be used; and (D) a fourth process to transmit the reply mail to the mail address of the source, wherein the control section creates the reply mail in the third process in a case where it is judged in the first process that the mail address of the destination is unavailable and where it is judged in the second process that the mail address of the source falls within the notify party information. 2. The mail server as claimed in claim 1 further comprising: an address information updating means to accept addition, change and/or deletion of a mail address having the domain and therewith to update the address information table; and a notify party information updating means to accept addition and/or deletion of a piece of the notify party information and therewith to update the notify party information table. 3. The mail server as claimed in claim 2 wherein the address information updating means, upon accepting a change from a mail address having the domain to a new mail address, renders the mail address having the domain unavailable, associating the new mail address with the mail address having the domain; and wherein the control section, referring to the address information table in the third process, gives in the reply mail a statement of the new mail address associated with the mail address of the destination. 4. The mail server as claimed in claim 1 wherein the notify party information is on domain; and wherein the control section, referring to the notify party information table in the third process, creates the reply mail when a domain of the mail address of the source is registered in the notify party information table. 5. The mail server as claimed in claim 1 wherein the notify party information is on mail address; and wherein the control section, referring to the notify party information table in the third process, creates the reply mail when the mail address of the source is registered in the notify party information table.

2011-09-06

en

2012-03-08

US-79337610-A

Iron-type golf club head ABSTRACT An iron-type golf club head is assembled from a front component ( 4 ) made of a metal material having a specific gravity ρ1, a rear component ( 5 ) made of a fiber reinforced resin having a specific gravity ρ2 lower than the specific gravity ρ1, a toe-side component ( 6 ) made of a metal material having a specific gravity ρ3 higher than the specific gravity ρ1, and a heel-side component ( 7 ) made of a metal material having a specific gravity ρ4 higher than the specific gravity ρ1. BACKGROUND OF THE INVENTION The present invention relates to an iron-type golf club head, more particularly to a hybrid golf club head assembled from components made of at least two kind of metal materials and a fiber reinforced resin. Heretofore, in order to lower or adjust the position of the center of gravity and increase the moment of inertia of an iron-type golf club head, there have been widely employed a technique to insert a weight member in a lower part of the club head. For example, in the Japanese published unexamined application No. 10-314349, as shown in FIG. 6(A), the sole (s) of the head (i) is provided with a hollow, and a weight member KO made of a tungsten alloy is placed in the hollow, and the opening of the hollow is closed by a metallic alloy plate. In the US Patent application publication US 2007-281796-A1, as shown in FIG. 6(B), a plurality of weight members are inserted in the toe (t), heel (h) and sole (s) of the head. In these techniques, in order to insert the weight members KO, their maximum sizes are limited, and thereby the increase in the moment of inertia and the lowering of the position of the center of gravity are limited. Further, when making the weight members KO and forming the holes or hollows into which the weight members KO are inserted, high dimensional accuracy is required, therefore, the production efficiency is not good. SUMMARY OF THE INVENTION It is therefore, an object of the present invention to provide an iron-type golf club head, which has a hybrid structure of metal materials and fiber reinforced resin capable of increasing the lateral moment of inertia and decreasing or optimizing the position of the center of gravity, and thereby performance such as the directional stability and carry distance of the balls, ball controllability and the like can be improved. According to the present invention, an iron-type golf club head comprises a main body and a hosel, wherein the main body comprises a front surface including an impact area for striking a ball, a back surface opposite to the front surface, and an outer circumferential surface extending between the front surface and the back surface and including a top surface, a toe surface and a sole surface, the hosel extends upwardly from the main body on its heel-side and has a shaft inserting hole into which an end of a club shaft is inserted, a major part of the front surface and a major part of the sole surface are formed by a metal material having a specific gravity ρ1, a major part of the back surface and a major part of the top surface are formed by a fiber reinforced resin having a specific gravity ρ2 lower than the specific gravity ρ1, a lower part of the toe surface is formed by a metal material having a specific gravity ρ3 higher than the specific gravity ρ1, and the hosel is made of a metal material having a specific gravity ρ4 higher than the specific gravity ρ1. Therefore, owing to the metal material having the specific gravity ρ1 and fiber reinforced resin having the specific gravity ρ2, it becomes possible to make the club head heavy on the sole-side and light on the upper side. Further, owing to the metal material having the specific gravity ρ3 and the metal material having the specific gravity ρ4, it becomes possible to make the club head heavy on the toe-side and heel-side and light in the central portion therebetween. Accordingly, it is possible to increase the lateral moment of inertia and to lower the position of the center of gravity, and thereby the directionality of the hit ball can be improved. Further, it becomes easy to strike a ball at a high launching angle. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a front view of an iron-type golf club head according to the present invention. FIG. 2 is a rear view of the head. FIG. 3 is a left side view of the head. FIG. 4(A) shows a cross section of the head taken along line A-A in FIG. 1. FIG. 4(B) shows a cross section of the head taken along line B-B in FIG. 1. FIG. 5 is an exploded perspective view of the head. FIG. 6(A) is a cross-sectional view of a prior art golf club head. FIG. 6(B) is a rear view of a prior art golf club head. DESCRIPTION OF THE PREFERRED EMBODIMENTS Embodiments of present invention will now be described in detail in conjunction with accompanying drawings. In the drawings, an iron-type golf club head 1 according to the present invention comprises a main body 2 and a hosel 3. The hosel 3 comprises a tubular main part extending upward from the heel-side of the main body 2 and having a shaft inserting hole 3 e into which a club shaft (not shown) is inserted. The main body 2 has a front surface FF including an impact area for striking a ball, a back surface FB opposite to the front surface FF, and an outer circumferential surface Ph between the front surface FF and the back surface FB. In this embodiment, the lie angle can be in a range of from 50 to 70 degrees, and the loft angle can be in a range of from 15 to 70 degrees. The mass of the club head 1 is set in a range of not less than 200 g, preferably not less than 220 g, more preferably not less than 230 g, but not more than 300 g, preferably not more than 290 g, more preferably not more than 280 g. If the mass is less than 200 g, there is a tendency that the flexibility of designing the mass distribution decreases. If more than 300 g, it becomes difficult swing the golf club. The above-mentioned front surface FF is substantially flat, excepting impact area markings (not shown) such as grooves and punch marks. FIGS. 1 to 3 show the club head 1 under a measuring state. The measuring state is different from its normal state. The normal state is such that the club head is set on a horizontal plane HP so that the axis of the club shaft is inclined at the lie angle while keeping the axis on a vertical plane, and the club face forms its loft angle with respect to the horizontal plane HP. Incidentally, in the case of the club head alone, the center line of the shaft inserting hole can be used instead of the axis of the club shaft. The measuring state is such that the club head is first set in the above-mentioned normal state, and then the above-mentioned vertical plane is inclined forwardly by the loft angle, while keeping the club head in contact with the horizontal plane HP, so that the club face becomes vertical or perpendicular to the horizontal plane HP. In this application including the description and claims, sizes, positions, directions and the like relating to the club head refer to those under the measuring state unless otherwise noted. The “lateral moment of inertia” or shortly “moment of inertia” is a moment of inertia around an axis passing through the center of gravity of the head perpendicularly to the horizontal plane HP in the normal state. “Sweet spot” is the intersecting point between the front surface FF and a straight line drawn from the center of gravity of the head to the front surface FF perpendicularly thereto. “Sweet spot height” is the distance between the sweet spot and the horizontal plane HP measured perpendicularly to the horizontal plane HP. In the measuring state, as shown in FIG. 1, the upper edge of the front surface FF has a highest point P1 on the toe-side (hereinafter, the “highest toe-side point P1”) and a lowest point P2 on the heel-side (hereinafter, the “lowest heel-side point P2”). Using these points, a vertical plane being perpendicular to the front surface FF and including the toe-side point P1 (hereinafter, the “toe-side vertical plane VP1”) is defined. Further, a vertical plane being perpendicular to the front surface FF and including the heel-side point P2 (hereinafter, the “heel-side vertical plane VP2”) is defined. The above-mentioned outer circumferential surface Ph includes: an upper surface TP extending between the toe-side vertical plane VP1 and heel-side vertical plane VP2; a lower surface so extending between the toe-side vertical plane VP1 and heel-side vertical plane VP2; and a toe surface TO extending on the toe-side of the toe-side vertical plane VP1 between the upper surface TP and lower surface SO. The upper surface TP extends almost straight while inclining downwardly towards the heel from the toe. The lower surface SO slightly and convexly curves so as to swell downwards. The toe surface TO convexly curves so as to swell toward the heel-side. According to the present invention: a major part of the front surface FF and a major part of the lower surface SO are formed by a metal material M1 having a specific gravity ρ1; a major part of the back surface FB and a major part of the upper surface TP are formed by a fiber reinforced resin M2 having a specific gravity ρ2 less than the specific gravity ρ1; a lower part of the toe surface TO is formed by a metal material M3 having a specific gravity ρ3 more than the specific gravity ρ1; and the hosel 3 is made of a metal material M4 having a specific gravity ρ4 more than the specific gravity ρ1. In order to achieve this arrangement, as best shown in FIG. 5, the club head 1 is assembled from a front component 4 made of the metal material M1, a rear component 5 made of the fiber reinforced resin M2, a toe-side component 6 made of the metal material M3, and a heel-side component 7 made of the metal material M4. In this embodiment, the toe-side component 6 and heel-side component 7 are made of the identical metal material (namely, M3=M4, and ρ3=ρ4). As best shown in FIG. 4 and FIG. 5, the front component 4 integrally includes a thin main plate 4 a and a thick sole plate 4 b. The main plate 4 a is defined as having a substantially constant thickness t1, and forms a major part of the front surface FF. The major part of the front surface FF means a part having at least 60%, preferably at least 70%, more preferably at least 75% of the total area of the front surface FF. The main plate 4 a has a contour shape similar to that of the front surface FF so as to extend almost allover the width of the front surface FF in the toe-heel direction, and almost allover the height of the front surface FF in the top-sole direction. The upper edge 4TP and the toe-side edge 4TO of the main plate 4 a are positioned within the front surface FF at a distance W1 from the upper edge Ea and the toe-side edge EC of the front surface FF toward the center of the main body 2. The lower edge 4SO of the main plate 4 a is positioned at the lower edge Eb of the front surface FF. The heel-side edge 4H of the main plate 4 a is positioned within the front surface FF at a distance W2 from the heel-side vertical plane VP2 toward the toe-side. The thick sole plate 4 b extends backwardly of the head from the lower end of the main plate 4 a so as to form a major part of the above-mentioned lower surface SO. The major part of the lower surface SO means a part having an area of at least 60%. preferably at least 70%, more preferably at least 75% of the total area of the lower surface SO. The sole plate 4 b has a thickness more than that of the main plate 4 a in order to distribute a large mass to the sole. As shown in FIGS. 1 and 5, the sole plate 4 b protrudes from the heel-side edge 4H of the main plate 4 a towards the heel-side. In the front view, the heel-side end 4 bh of the sole plate 4 b is positioned at a distance W3 from the heel-side vertical plane VP2 towards the toe-side. The distance W3 is smaller than the above-mentioned distance W2. (W3<W2) Therefore, in the front view, the heel-side edge of the front component 4 has a stepwise configuration. The heel-side end 4 bh in this embodiment is defined by a surface parallel with the heel-side vertical plane VP2. Such stepwise configuration increases the bonding area with the heel-side component and the bonding strength is increased. Further, the sole plate 4 b is, as shown in FIG. 4(A), provided at the rear end part thereof with a rising part 4 bw rising upwards by a small height in order to deepen the center of gravity by distributing the mass to the backward. The rear component 5 integrally includes a thin backside plate 5 a and a flange 5 b as shown in FIG. 5. The backside plate 5 a is defined as having a substantially constant thickness t2 and fixed to the back surface of the main plate 4 a of the front component 4 so as to cover the entirety of the back surface of the main plate 4 a. The backside plate 5 a can reinforce the thin main plate 4 a and reduce unnecessary vibrations to improve impact feelings. The flange 5 b is formed at the edge of the backside plate 5 a and protrudes forward from the front surface of the backside plate 5 a. The flange 5 b includes a top-side flange 8, an upper toe-side flange 9 and an upper heel-side flange 10, and as shown in FIG. 1 and FIG. 5, no flange is formed on the sole-side of the backside plate 5 a from the lower end of the upper toe-side flange 9 to the lower end of the upper heel-side flange 10. The top-side flange 8 covers a major part (in this embodiment, the entirety) of the upper end surface of the main plate 4 a of the front component 4, and forms an upper edge portion of the front surface FF and the entirety of the upper surface TP. The upper toe-side flange 9 covers an upper part of the toe-side end surface the main plate 4 a, and forms an upper part (in this embodiment, about one half) of the toe surface TO and an upper part of the toe-side edge portion of the front surface FF. The upper heel-side flange 10 covers the heel-side end surface of the main plate 4 a of the front component 4, and forms an upper part of the heel-side edge portion of the front surface FF. As shown in FIG. 1, the upper heel-side flange 10 extends towards the heel-side beyond the above-mentioned heel-side end 4 bh of the sole plate 4 b of the front component 4 so that its heel-side end 10 h is positioned on the heel-side of the heel-side end 4 bh. The heel-side end 10 h in this embodiment is defined by a surface parallel with the heel-side vertical plane VP2. Therefore, a stepped surface is formed by the front component 4 and the rear component 5 on their heel-side. The toe-side component 6 integrally includes a main part 6 a and a lower toe-side flange 6 b. The main part 6 a is disposed in a lower position on the toe-side of the rear component 5 and on the back side of the rear component 5. As shown in FIG. 4(B), the front surface 6 f of the main part 6 a is spaced apart from the back surface of the rear component 5, forming a gap therebetween. Accordingly, the mass is further shifted backward. The lower toe-side flange 6 b protrudes forward from the main part 6 a on the toe-side of the main part 6 a and is disposed in a lower part on the toe-side of the front component 4. The lower toe-side flange 6 b covers a lower part of the toe-side end surface of the front component 4 and forms a lower part (in this embodiment, about one half) of the surface TO and a lower part of the toe-side edge portion of the front surface FF. As shown in FIG. 2, in the rear view of the club head under the measuring state, at least on the toe-side of the toe-side vertical plane VP1, the width W4 of the toe-side component 6 is gradually increased from the top-side toward the sole-side. Here, the width W4 is measured from the outer circumferential edge of the main body 2 perpendicularly thereto. Therefore, it is possible to design a more effective mass distribution which helps to lower the center of gravity and increase the moment of inertia. In this embodiment, on the heel-side of the toe-side vertical plane VP1, the width W4 is gradually decreased toward the heel-side, and the toe-side component 6 terminates at a position which is about ⅓ of the distance in the toe-heel direction between the heel-side vertical plane VP2 and the toe-side vertical plane VP1, from the toe-side vertical plane VP1. The heel-side component 7 integrally includes the above-mentioned tubular hosel 3 and an attaching portion 11. The attaching portion 11 has a stepped surface adapted to the above-mentioned stepped surface formed by the front component 4 and the rear component 5 on their heel-side. The stepped surface comprises: a lower vertical surface 11 a which abuts on and is bonded to the surface of the heel-side end 4 bh of the front component 4; an upper vertical surface 11 b which abuts on and is bonded to the surface of the heel-side end 10 h of the rear component 5; and an in-between surface 11 c with which the upper vertical surface 11 b and the lower vertical surface 11 a are connected and which abuts on and is bonded to the heel-side downward surface of the upper heel-side flange 10 of the rear component 5. In this embodiment, the in-between surface 11 c and the heel-side downward surface are substantially parallel with the horizontal plane HP in the measuring state. In the attaching portion 11, a lower part defining the lower vertical surface 11 a extends toward the toe-side more than an upper part defining the upper vertical surface 11 b, therefore, it is possible to distribute a mass to a lower part on the heel-side. The above-mentioned specific gravity ρ1 is set in a range of from not less than 1.8, preferably not less than 2.0, more preferably not less than 4.0, but not more than 10.0, preferably not more than 9.0, more preferably not more than 8.0. If the specific gravity ρ1 is more than 10.0, the mass of the club head increases, and it becomes difficult to design an effective mass distribution. If the specific gravity ρ1 is less than 1.8, the strength of the metal material is liable to become insufficient. As to the metal material M1 of the front component 4 having the specific gravity ρ1, stainless steels, maraging steels, pure titanium, titanium alloys, aluminum alloys, magnesium alloys or the like, or amorphous alloys may be used. Especially, metal materials whose specific strength is high, for example, titanium alloys are preferably used. Thus, it is possible to improve the durability of the front surface FF which directly contacts with the ball, and the durability of the lower surface so which is liable to contact with the ground during golf swing. The specific gravity ρ2 of the fiber reinforced resin M2 is set in a range of from not less than 1.0, preferably not less than 1.2, more preferably not less than 1.5, but not more than 3.0, preferably not more than 2.5, more preferably not more than 2.0. If the specific gravity ρ2 is less than 1.0, the strength decreases and becomes insufficient. If the specific gravity ρ2 is more than 3.0, it becomes difficult to get a sufficient mass margin. As to the reinforcing fibers of the fiber reinforced resin M2, for example, carbon fibers, graphite fibers, glass fibers, alumina fibers, boron fibers, aromatic polyester fibers, aramid fibers, PBO fibers, amorphous metal fibers, titanium fibers, and the like can be used. Especially, carbon fibers are preferable because of the low specific gravity and high tensile strength. As to the matrix resin of the fiber reinforced resin M2, for example, thermosetting resins such as epoxide resin, phenol resin, polyester resin, and unsaturated polyester resin, and thermoplastic resins such as polycarbonate resin and nylon resin can be used. Especially, epoxide resins are preferable in view of the cost and general versatility. The specific gravity ρ3, ρ4 of the metal material M3, M4 is preferably set in a range of from not less than 7.0, more preferably not less than 7.5, still more preferably not less than 8.0, but not more than 18.0, more preferably not more than 17.0, still more preferably not more than 16.0. If the specific gravity ρ3, ρ4 is less than 7.0, it is difficult to obtain a large lateral moment of inertia. If the specific gravity ρ3, ρ4 is more than 18.0, the mass of the club head tends to excessively increase. As to the metal material M3, M4 having the specific gravity ρ3, ρ4, for example, tungsten, tungsten alloys (W—Ni, W—Cu), copper, brass, and stainless steels can be used. Especially, W—Ni tungsten alloys are preferred in view of the specific gravity and cost. Preferably, the specific gravity ratio ρ2/ρ1 is not less than 0.1, more preferably not less than 0.2, still more preferably not less than 0.3, but less than 1.0; the specific gravity ratio ρ1/ρ3 is not less than 0.1, more preferably not less than 0.2, still more preferably not less than 0.3, but less than 1.0; and the specific gravity ratio ρ1/ρ4 is not less than 0.1, more preferably not less than 0.2, still more preferably not less than 0.3, but less than 1.0. If the specific gravity ratios ρ2/ρ1, ρ1/ρ3, ρ1/ρ43 are less than 0.1, there is a tendency that the position of the center of gravity becomes very low, and further it is difficult to obtain a large lateral moment of inertia. If the specific gravity ratios ρ1/ρ3 and ρ1/ρ4 are less than 0.1, there is a tendency that the mass of the hosel 3 is increased, and the height of the center of gravity is increased. The above-mentioned thickness t1 of the thin main plate 4 a of the front component 4 is preferably set in a range of from not less than 1.0 mm, more preferably not less than 1.1 mm, still more preferably not less than 1.2 mm, but not more than 3.0 mm, more preferably not more than 2.9 mm, still more preferably not more than 2.8 mm. If the thickness t1 is less than 1.0 mm, it is difficult to provide a sufficient strength and durability for the club face. If the thickness t1 is more than 3.0 mm, the coefficient of restitution is decreased, and the carry distance tends to decrease. The thickness t2 of the thin backside plate 5 a of the rear component 5 is preferably set in a range of from not less than 1.0 mm, more preferably not less than 1.1 mm, still more preferably not less than 1.2 mm, but not more than 3.0 mm, more preferably not more than 2.9 mm, still more preferably not more than 2.8 mm. If the thickness t2 is less than 1.0 mm, it is difficult to effectively reinforce the thin main plate 4 a. If the thickness t2 is more than 3.0 mm, the coefficient of restitution is decreased, and the carry distance tends to decrease. The distance W1 of the upper edge 4TP and toe-side edge 4TO of the main plate 4 a from the upper edge Ea and toe-side edge Ec of the front surface FF, and the distance W2 between the heel-side edge 4H of the main plate 4 a and the heel-side vertical plane VP2 are set in a range of not less than 1 mm, preferably not less than 3 mm, more preferably not less than 5 mm, but not more than 20 mm, preferably not more than 15 mm, more preferably not more than 10 mm. Since the top-side flange 8, upper toe-side flange 9 and upper heel-side flange 10 are lower in the specific gravity than the main plate 4 a, a mass margin can be obtained corresponding to the difference (ρ1−ρ2) in the specific gravity therebetween and the volume of the flanges 8-10, and the freedom of designing the mass distribution is increased. In the front view of the club head under the measuring state, when the maximum height H of the main body 2, the lowest height h1 of the rear component 5 appearing on the toe-side, and the lowest height h2 of the rear component 5 appearing on the heel-side are defined as shown in FIG. 1: the ratio (h1/H) is set in a range of not less than 0.2, preferably not less than 0.3, more preferably not less than 0.4, but not more than 0.8, preferably not more than 0.7, more preferably not more than 0.6; and the ratio (h2/H) is set in a range of not less than 0.20, preferably not less than 0.25, more preferably not less than 0.30, but not more than 0.60, preferably not more than 0.55, more preferably not more than 0.50. Thereby, it is possible to effectively increase the lateral moment of inertia and lower the position of the center of gravity of the head. Further, it is possible to facilitate to work out a mass margin to increase the freedman of the mass distribution design. If the ratio (h1/H) decreases under the lower limit, it becomes difficult to effectively increase the lateral moment of inertia. If the ratio (h1/H) increases over the upper limit, it becomes difficult to lower the position of the center of gravity of the head. If the ratio (h2/H) decreases under the lower limit, it becomes difficult to effectively increase the lateral moment of inertia. If the ratio (h2/H) increases over the upper limit, it becomes difficult to lower the position of the center of gravity of the head. Preferably, the height h1 is set in a range of not less than 10 mm, more preferably not less than 15 mm, still more preferably not less than 20 mm, but not more than 35 mm, more preferably not more than 30 mm, still more preferably not more than 25 mm. If the height h1 is less than 10 mm, the toe-side component 6 becomes small, and as a result, it becomes difficult to increase the lateral moment of inertia and lower the center of gravity. If the height h1 is more than 35 mm, the center of gravity becomes high, and the mass of the club head 1 increases, and as a result, it becomes difficult to swing the golf club. Preferably, the maximum height H is set in a range of not less than 40 mm, more preferably not less than 45 mm, still more preferably not less than 50 mm, but not more than 80 mm, more preferably not more than 75 mm, still more preferably not more than 70 mm. If the maximum height H is less than 40 mm, there is a tendency that the golf club head at address gives the user uncomfortable impression, and as a result, it becomes difficult to swing the golf club. If the maximum height H is more than 80 mm, the center of gravity is liable to become high. In the rear view of the club head 1 under the measuring state, when the lowest height A1 of the rear component 5 appearing on the heel-side, the lowest height A3 of the rear component 5 appearing on the toe-side, and the lowest height A2 of the rear component 5 appearing in the central portion of the back surface FB are defined as shown in FIG. 2, the height A1 is more than the height A2 and the height A3 is more than the height A2. (A1>A2<A3) Thereby, the lateral moment of inertia can be increased. In order to make the position of the center of gravity of the head lower, while increasing the lateral moment of inertia: the height A1 is preferably set in a range of not less than 11 mm, more preferably not less than 12 mm, still more preferably not less than 13 mm, but not more than 20 mm, more preferably not more than 19 mm, still more preferably not more than 18 mm; the height A2 is preferably set in a range of not less than 1 mm, more preferably not less than 2 mm, still more preferably not less than 3 mm, but not more than 10 mm, more preferably not more than 9 mm, still more preferably not more than 8 mm; and the height A3 is preferably set in a range of not less than 21 mm, more preferably not less than 22 mm, still more preferably not less than 23 mm, but not more than 30 mm, more preferably not more than 29 mm, still more preferably not more than 28 mm. In order to reduce the mass of the central portion of the club face and to obtain a mass margin therefrom, the ratio (A2/H) of the height A2 to the maximum height H of the main body 2 is preferably set in a range of not less than 0.02, more preferably not less than 0.05, still more preferably not less than 0.1, but not more than 0.4, more preferably not more than 0.3, still more preferably not more than 0.25. In order to distribute a mass to a toe-side part of the main body 2 as much as possible, and to increase the lateral moment of inertia, the ratio (A3/H) of the height A3 to the maximum height H of the main body 2 is preferably set in a range of not less than 0.2, more preferably not less than 0.3, still more preferably not less than 0.4, but not more than 0.8, more preferably not more than 0.7, still more preferably not more than 0.6. The front component 4 can be formed by forging, casting, sintering or the like. The rear component 5 can be formed by integral molding, for example, a prepreg method, a filament winding method, a resin transfer molding and the like. The toe-side component 6 and the heel-side component 7 can be formed by casting, sintering, machining and the like. The front component 4, rear component 5, toe-side component 6 and heel-side component 7 are assembled into the club head 1. When assembled, the front surface of the main plate 4 a, the front surface of the flange 5 b and the front surface of the lower toe-side flange 6 b become substantially flat and forms the front surface FF. In order to fix the front component 4 to the toe-side component 6 and the heel-side component 7, for example, welding, soldering, adhesive bonding, frictional jointing, explosion bonding, press fitting, and/or screw/bolt may be used. In this embodiment, however, an adhesive agent is used. In order to fix the front component 4 to the rear component 5, for example, adhesive bonding, and/or screw/bolt may be used. In this embodiment, however, in view of production efficiency, an adhesive agent is preferably used. Owing to the above-mentioned stepped surface of the attaching portion 11 and the stepped surface formed by the front component 4 and rear component 5 on their heel-side, even when an adhesive agent is used, a high bonding strength can be obtained. Further, since the components 4-7 are connected to each other by abutting their surfaces which are mainly flat surfaces, in other words, it is not necessary to make holes or hollows and make the components having the shapes adapted to those of the holes as in the prior arts, the production efficiency can be improved in comparison with the prior arts. Whereas, the club head 1 may be provided with a weight member having a specific gravity higher than ρ3 and ρ4, a vibration damper made of an elastic material, and/or a decorative badge. Comparison Test Based on the structure as shown in FIGS. 1-4, iron-type golf club heads for #5 iron (club head mass 250 g, lie angle 61 degrees, loft angle 24 degrees) were made and tested. All of the heads had the same structures and specifications except for the specifications shown in Table 1. Specifications common to all of the heads are as follows: Material M1: titanium alloy (Ti-6Al-4V) Specific gravity ρ1: 4.4 Thickness t1 of main part: 1.3 mm Material M2: carbon fiber reinforced resin (CFRP) Specific gravity ρ2: 1.8 Thickness t2 of backside wall: 1.3 mm Material M3: tungsten-nickel alloy Material M4: tungsten-nickel alloy Specific gravity ρ3=ρ4: 15 Fixing Method Front and Rear components: adhesive agent Front and Heel-side components: adhesive agent Front and Toe-side components: adhesive agent Rear and Heel-side components: adhesive agent Rear and Toe-side components: adhesive agent In the comparison test, the club heads were attracted to identical FRP shafts (“MP-300” Flex R, manufactured by SRI Sports Ltd.) to make 38-inch #5 iron clubs. Using each of the iron clubs, five golfers having handicap ranging from 5 to 15 struck three-piece golf balls (“XXIO” manufactured by SRI Sports Ltd.) five times for each person. And the directional stability of the balls and whether easy to rise the balls were evaluated into five ranks. The mean values are shown in Table 1, wherein the larger rank number is better. TABLE 1 Club Head Ref. 1 Ex. 1 Ex. 2 Ex. 3 Ex. 4 Ex. 5 Height H (mm) 55 55 55 55 55 55 h1 (mm) — 27.5 22 33 11 44 h2 (mm) — 22 16.5 27.5 11 33 A1 (mm) — 22 16.5 27.5 11 33 A2 (mm) — 10 10 10 10 10 A3 (mm) — 27.5 22 33 11 44 h1/H — 0.5 0.4 0.6 0.2 0.8 h2/H — 0.4 0.3 0.5 0.2 0.6 A2/H — 0.18 0.18 0.18 0.18 0.18 A3/H — 0.5 0.4 0.6 0.2 0.8 Moment of 2000 3700 3500 3800 3000 3850 inertia (g sq.cm) Sweet spot 21 20 19.5 21 19 23 height (mm) Directional 1 5 4 5 3 5 stability Whether easy 4 5 5 4 5 3 to rise Ref. 1: The entirety of the head was made of Ti-6Al-4V. REFERENCE SIGNS LIST 1 iron-type golf club head 2 main body 3 hosel 3 e shaft inserting hole 4 front component 5 rear component 6 toe-side component 7 heel-side component FF front surface FB back surface TP top surface TO toe surface SO sole surface Ph outer circumferential surface 1. An iron-type golf club head comprising a main body (2) having a front surface (FF) including an impact area for striking a ball, a back surface (FB) opposite to the front surface, and an outer circumferential surface (Ph) extending between the front surface and the back surface and including a top surface (TP), a toe surface (TO) and a sole surface (SO), and a hosel (3) protruding upwardly from the main body on the heel-side of the main body and having a shaft inserting hole (3 e) into which an end of a club shaft is inserted, wherein a major part of the front surface (FF) and a major part of the sole surface (FB) are formed by a metal material having a specific gravity ρ1, a major part of the back surface (FB) and a major part of the top surface (TP) are formed by a fiber reinforced resin having a specific gravity ρ2 lower than the specific gravity ρ1, a lower part of the toe surface (TO) is formed by a metal material having a specific gravity ρ3 higher than the specific gravity ρ1, and the hosel (3) is made of a metal material having a specific gravity ρ4 higher than the specific gravity ρ1. 2. The iron-type golf club head according to claim 1, which comprises: a front component (4) made of said metal material having the specific gravity ρ1, a rear component (5) made of said fiber reinforced resin having the specific gravity ρ2, and a toe-side component (6) made of said metal material having the specific gravity ρ3. 3. The iron-type golf club head according to claim 2, which further comprises: a heel-side component (7) made of said metal material having the specific gravity ρ4. 4. The iron-type golf club head according to claim 2, wherein the front component (4) has an upper edge (4TP) positioned within the front surface (FF), and the rear component (5) comprises a backside plate (5 a) extending along a back surface of the front component (4), and a top-side flange (8) protruding forward from the backside plate (5 a) so as to form the top surface (TP) and an upper edge portion of the front surface (FF) above said upper edge (4TP). 5. The iron-type golf club head according to claim 2, wherein the front component (4) has a toe-side edge (4TO) positioned within the front surface (FF), and the rear component (5) comprises a backside plate (5 a) extending along a back surface of the front component (4), and an upper toe-side flange (9) protruding forward from the backside plate (5 a) so as to form an upper part of said toe surface (TO) and an upper toe-side edge portion of the front surface (FF) outside said toe-side edge (4TO). 6. The iron-type golf club head according to claim 5, wherein said toe-side component (6) comprises a main part (6 a) disposed backward of the front component (4), and a lower toe-side flange (6 b) protruding forward from the main part (6 a) so as to form a lower part of said toe surface (TO) and a lower toe-side edge portion of the front surface (FF) outside said toe-side edge (4TO). 7. The iron-type golf club head according to claim 2, wherein the front component (4) has an upper edge (4TP) positioned within the front surface (FF), and a toe-side edge (4TO) positioned within the front surface (FF), and the rear component (5) comprises a backside plate (5 a) extending along a back surface of the front component (4), a top-side flange (8) protruding forward from the backside plate (5 a) so as to form the top surface (TP) and an upper edge portion of the front surface (FF) above said upper edge (4TP), and an upper toe-side flange (9) protruding forward from the backside plate (5 a) so as to form an upper part of said toe surface (TO) and an upper toe-side edge portion of the front surface (FF) outside said toe-side edge (4TO). 8. The iron-type golf club head according to claim 7, wherein said toe-side component (6) comprises a main part (6 a) disposed backward of the front component (4), and a lower toe-side flange (6 b) protruding forward from the main part (6 a) so as to form a lower part of said toe surface (TO) and a lower toe-side edge portion of the front surface (FF) outside said toe-side edge (4TO). 9. The iron-type golf club head according to claim 4 or 5, wherein in the front view of the golf club head under a measuring state, the maximum height H of the main body, the lowest height h1 of the rear component (5) appearing on the toe-side, and the lowest height h2 of the rear component (5) appearing on the heel-side satisfy the following conditional expressions: 0.2=<h1/H=<0.8, and 0.2=<h2/H=<0.6. 10. The iron-type golf club head according to claim 4 or 5, wherein in the front view of the golf club head under a measuring state, the maximum height H of the main body, the lowest height h1 of the rear component (5) appearing on the toe-side, and the lowest height h2 of the rear component (5) appearing on the heel-side satisfy the following conditional expressions: 0.2=<h1/H=<0.8 and 0.2=<h2/H=<0.6, and in the rear view of the golf club head under the measuring state, the lowest height A1 of the rear component (5) appearing on the heel-side, the lowest height A3 of the rear component (5) appearing on the toe-side, and the lowest height A2 of the rear component (5) appearing in a central portion of the head satisfy the following conditional expression: A1>A2<A3.

2010-06-03

en

2010-12-23

US-47813906-A

Plasma display panel and method of manufacturing the same ABSTRACT A plasma display panel is disclosed. The plasma display panel includes a substrate, a fist electrode and a second electrode formed on the substrate, and a dielectric layer formed on the first electrode and the second electrode. The dielectric layer has at least one groove formed between the first electrode and the second electrode. A slope of the side of the groove ranges from 0.2 to 1.5. A horizontal distance ranging from an end of a first transparent electrode of the first electrode or an end of a second transparent electrode of the second electrode to an end of a bottom surface of the groove ranges from 10 μm to 100 μm. The depth of the groove ranges from 5 μm to 30 μm. This Non-provisional application claims priority under 35 U.S.C. § 119(a) on Patent Application No. 10-2005-0059434 filed in Korea on Jul. 1, 2005 the entire contents of which are hereby incorporated by reference. BACKGROUND OF THE INVENTION 1. Field of the Invention This document relates to a plasma display panel and a method of manufacturing the plasma display panel. 2. Description of the Background Art Each of cells of a plasma display panel is filled with an inert gas containing a main discharge gas such as neon (Ne), helium (He) or a Ne-He gas mixture and a small amount of xenon (Xe). When a high frequency voltage is supplied to electrodes of the plasma display panel, the inert gas within the cells generates vacuum ultraviolet rays. The vacuum ultraviolet rays emit a phosphor formed between barrier ribs such that the image is displayed. A driving signal is supplied to the electrodes of the plasma display panel. The supply of the driving signal generates a reset discharge, an address discharge and a sustain discharge within discharge cells of the plasma display panel. The reset discharge is generated to uniformly form wall charges within the discharge cells. The address discharge is generated to select a discharge cell where light will be emitted. The sustain discharge is generated to emit light in the selected discharge cell. When the sustain discharge is generated within the discharge cell, the inert gas within the discharge cell generates vacuum ultraviolet rays. The vacuum ultraviolet rays emit the phosphor formed within the discharge cell such that the image is displayed. A distance between the electrodes of the plasma display panel affects a firing start voltage and discharge efficiency of the plasma display panel. Accordingly, the plasma display panel, in which the distance between the electrodes of the plasma display panel is optimized, is required. SUMMARY OF THE INVENTION According to an aspect, there is provided a plasma display panel comprising a substrate, a first electrode and a second electrode formed on the substrate, a distance between the first electrode and the second electrode ranging 10 μm to 200 μm, and a dielectric layer formed on the first electrode and the second electrode, wherein a first distance ranging from the substrate between the first electrode and the second electrode to the surface of the dielectric layer is different from a second distance ranging from the substrate, on which at least one of the first electrode and the second electrode is formed, to the surface of the dielectric layer. According to another aspect, there is provided a plasma display panel comprising a substrate, a first electrode and a second electrode formed on the substrate, a distance between the first electrode and the second electrode ranging 10 μm to 200 μm, and a dielectric layer, formed on the first electrode and the second electrode, comprising at least one groove formed between the first electrode and the second electrode. According to still another aspect, there is provided a plasma display panel comprising a substrate, a first electrode and a second electrode formed on the substrate, and a dielectric layer, formed on the first electrode and the second electrode, comprising at least one groove formed between the first electrode and the second eleccode, wherein a slope of the side of the groove ranges from 0.2 to 1.5, a horizontal distance ranging from an end of a first transparent electrode of the first electrode or an end of a second transparent electrode of the second electrode to an end of a bottom surface of the groove ranges from 10 μm to 100 μm, and the depth of the groove ranges from 5 μm to 30 μm. According to yet still another aspect, there is provided a method of manufacturing a plasma display panel comprising forming a first electrode and a second electrode on a substrate, forming a dielectric layer on the first electrode and the second electrode, and forming at least one groove on the dielectric layer between the first electrode and the second electrode. BRIEF DESCRIPTION OF THE DRAWINGS The embodiment of the invention will be described in detail with reference to the following drawings in which like numerals refer to like elements. FIG. 1 illustrates a plasma display panel according to an embodiment of the present invention; FIG. 2 is a cross-sectional view of a front panel of the plasma display panel according to the embodiment of the present invention; FIGS. 3 a and 3 b illustrate a comparison between discharge paths of the plasma display panel depending on whether a groove is or not formed in the plasma display panel according to the embodiment of the present invention; FIG. 4 is a cross-sectional view of a front panel of a plasma display panel according to another embodiment of the present invention; and FIGS. 5 a to 5 f illustrate processes for manufacturing the front panel of the plasma display panel according to the embodiments of the present invention. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS Embodiments of the present invention will be described in a more detailed manner with reference to the drawings. A plasma display panel according to embodiments of the present invention comprises a substrate, a first electrode and a second electrode formed on the substrate, a distance between the first electrode and the second electrode ranging 10 μm to 200 μm, and a dielectric layer formed on the first electrode and the second electrode. A first distance ranging from the substrate between the first electrode and the second electrode to the surface of the dielectric layer is different from a second distance ranging from the substrate, on which at least one of the first electrode and the second electrode is formed, to the surface of the dielectric layer. The first distance may be less than the second distance. A plasma display panel according to the embodiments of the present invention comprises a substrate, a first electrode and a second electrode formed on the substrate, a distance between the first electrode and the second electrode ranging 10 μm to 200 μm, and a dielectric layer, formed on the first electrode and the second electrode, comprising at least one groove formed between the first electrode and the second electrode. A slope of the side of the groove may range from 0.2 to 1.5. The first electrode may comprise a first transparent electrode, and the second electrode may comprise a second transparent electrode. A horizontal distance ranging from an end of the first transparent electrode or an end of the second transparent electrode to an end of a bottom surface of the groove may range from 10 μm to 100 μm. The depth of the groove may range from 5 μm to 30 μm. A plasma display panel according to the embodiments of the present invention comprises a substrate, a first electrode and a second electrode formed on the substrate, and a dielectric layer, formed on the first electrode and the second electrode, comprising at least one groove formed between the first electrode and the second electrode. A slope of the side of the groove ranges from 0.2 to 1.5. A horizontal distance ranging from an end of a first transparent electrode of the first electrode or an end of a second transparent electrode of the second electrode to an end of a bottom surface of the groove ranges from 10 μm to 100 μm. The depth of the groove ranges from 5 μm to 30 μm. The groove may be formed between the first transparent electrode and the second transparent electrode. A method of manufacturing a plasma display panel according to the embodiments of the present invention comprises forming a first electrode and a second electrode on a substrate, forming a dielectric layer on the first electrode and the second electrode, and forming at least one groove on the dielectric layer between the first electrode and the second electrode. The forming of the first electrode and the second electrode may comprise forming a first transparent electrode and a second transparent electrode. The groove may be formed between the first transparent electrode and the second transparent electrode. The dielectric layer may be formed using a dielectric paste or a dielectric dry film. A distance between the first electrode and the second electrode may range from 10 μm to 200 μm. The groove may be formed using a pattern printing method. A slope of the side of the groove may range from 0.2 to 1.5. The depth of the groove may range from 5 μm to 30 μm. The forming of the first electrode and the second electrode may comprise forming a first transparent electrode and a second transparent electrode. A horizontal distance from an end of the first transparent electrode or an end of the second transparent electrode to an end of a bottom surface of the groove may range from 10 μm to 100 μm. Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the attached drawings. A plasma display panel according to embodiments of the present invention has a long column structure, in which a distance between a scan electrode and a sustain electrode ranges from 10 μm to 200 μm. A dielectric layer is formed on the scan electrode and the sustain electrode of the plasma display panel according to the embodiments of the present invention. The dielectric layer has a groove. FIG. 1 illustrates a plasma display panel according to an embodiment of the present invention. As illustrated in FIG. 1, the plasma display panel according to the embodiment of the present invention comprises a front panel 100 and a rear panel 110. The front panel 100 on which an image is displayed comprises a front substrate 101. The rear panel 110 comprises a rear substrate 111. A scan electrode 102 and a sustain electrodes 103 are formed on the front substrate 101. An address electrode 113 is formed on the rear substrate 111 to intersect the scan electrode 102 and the sustain electrodes 103. The scan electrode 102 and the sustain electrode 103 each comprise transparent electrodes 102 a and 103 a and bus electrodes 102 b and 103 b. The transparent electrodes 102 a and 103 a are formed on the front substrate 101, and are made of indium-tin-oxide (ITO). The bus electrodes 102 b and 103 b are formed on the transparent electrodes 102 a and 103 a, respectively, and are made of a metal material. A distance between the transparent electrode 102 a of the scan electrode 102 and the transparent electrode 103 a of the sustain electrode 103 ranges from 100 μm to 200 μm. When the distance between the transparent electrode 102 a of the scan electrode 102 and the transparent electrode 103 a of the sustain electrode 103 ranges from 10 μm to 200 μm, a discharge corresponding to positive column is generated in a discharge cell. Accordingly, discharge efficiency of the plasma display panel is improved. An upper dielectric layer 104 is formed on the scan electrode 102 and the sustain electrode 103. The upper dielectric layer 104 limits a discharge current and provides insulation between the scan electrode 102 and the sustain electrode 103. At least one groove is formed between the transparent electrode 102 a of the scan electrode 102 and the transparent electrode 103 a of the sustain electrode 103 in the upper dielectric layer 104. The groove formed in the upper dielectric layer 104 will be described in detail with reference to FIG. 2. A protective layer 105 made of MgO is formed on an upper part of the upper dielectric layer 104. A lower dielectric layer 115 is formed on an upper part of the address electrode 113. Barrier ribs 112 are formed on the lower dielectric layer 115 to form discharge cells. A phosphor layer 114 is formed between the barrier ribs 112. The phosphor layer 114 generates visible light with one of red, green and blue during the generation of the discharge. FIG. 2 is a cross-sectional view of a front panel of the plasma display panel according to the embodiment of the present invention. As illustrated in FIG. 2, the scan electrode 102 and the sustain electrodes 103 are formed on the front substrate 101. The scan electrode 102 and the sustain electrode 103 each comprise the transparent electrodes 102 a and 103 a and the bus electrodes 102 b and 103 b. A distance d between the transparent electrode 102 a of the scan electrode 102 and the transparent electrode 103 a of the sustain electrode 103 ranges from 10 μm to 200 μm. Accordingly, in the plasma display panel according to the embodiment of the present invention, a discharge corresponding to positive column is generated such that discharge efficiency of the plasma display panel is improved. A groove G is formed in the upper dielectric layer 104 between the scan electrode 102 and the sustain electrode 103. In FIG. 2, a first distance D1 ranges from the front substrate 101 between the scan electrode 102 and the sustain electrode 103 to the surface of the upper dielectric layer 104. A second distance D2 ranges from the front substrate 101, on which at least one of the scan electrode 102 and the sustain electrode 103 is formed, to the surface of the upper dielectric layer 104. The first distance D1 is less than the second distance D2 due to the groove G. A slope of the side of the groove G formed in the upper dielectric layer 104 ranges from 0.2 to 1.5. In other words, the tan θ of an angle θ at the side of the groove G ranges from 0.2 to 1.5. A horizontal distance A ranging from an end of the transparent electrode 102 a of the scan electrode 102 or an end of the transparent electrode 103 a of the sustain electrode 103 to an end of a bottom surface of the groove G ranges from 10 μm to 100 μm . A depth B of the groove G ranges from 5 μm to 30 μm. FIGS. 3 a and 3 b illustrate a comparison between discharge paths of the plasma display panel depending on whether a groove is or not formed in the plasma display panel according to the embodiment of the present invention. FIG. 3 a illustrates a discharge path of the plasma display panel when the groove G is formed. FIG. 3 b illustrates a discharge path of the plasma display panel when the groove G is not formed. When the slope of the side of the groove G ranges from 0.2 to 1.5, the horizontal distance A ranges from 10 μm to 100 μm, and the depth B of the groove G ranges from 5 μm to 30 μm, the discharge path illustrated in FIG. 3 a is shorter than the discharge path illustrated in FIG. 3 b. Therefore, a firing start voltage of the plasma display panel decreases. When the distance between the scan electrode 102 and the sustain electrode 103 ranges from 10 μm to 200 μm, the discharge efficiency increases. However, there is a likelihood to increase the firing start voltage. Accordingly, as illustrated in FIG. 3 a, when the groove G is formed, the discharge efficiency increases while reducing the firing start voltage. FIG. 4 is a cross-sectional view of a front panel of a plasma display panel according to another embodiment of the present invention. As illustrated in FIG. 4, a distance d between a transparent electrode 102 a of a scan electrode 102 and a transparent electrode 103 a of a sustain electrode 103 ranges from 10 μm to 200 μm. Accordingly, in the plasma display panel according to another embodiment of the present invention, a discharge corresponding to positive column is generated such that discharge efficiency of the plasma display panel is improved. A curve-shaped groove G is formed in an upper dielectric layer 104 between the scan electrode 102 and the sustain electrode 103. In FIG. 4, a first distance D1 ranges from a front substrate 101 between the scan electrode 102 and the sustain electrode 103 to the surface of the upper dielectric layer 104. A second distance D2 ranges from the front substrate 101, on which at least one of the scan electrode 102 and the sustain electrode 103 is formed, to the surface of the upper dielectric layer 104. The first distance D1 is less than the second distance D2 due to the groove G. The tan θ of an angle θ at a curved surface of the groove G ranges from 0.2 to 1.5. A horizontal distance A ranging from an end of the transparent electrode 102 a of the scan electrode 102 or an end of the transparent electrode 103 a of the sustain electrode 103 to an end of a bottom surface of the groove G ranges from 10 μm to 100 μm. A depth B of the groove G ranges from 5 μm to 30 μm. FIGS. 5 a to 5 f illustrate processes for manufacturing the front panel of the plasma display panel according to the embodiments of the present invention. As illustrated in FIG. 5 a, the transparent electrode 102 a of the scan electrode 102 and the transparent electrode 103 a of the sustain electrode 103 are formed on the front substrate 101. The distance between the transparent electrode 102 a of the scan electrode 102 and the transparent electrode 103 a of the sustain electrode 103 ranges from 10 μm to 200 μm. As illustrated in FIG. 5 b, the bus electrodes 102 b and 103 b are formed on the transparent electrodes 102 a and 103 a, respectively. As illustrated in FIG. 5 c, a dielectric paste or a dielectric dry film 104 a is formed on the upper parts of the scan electrode 102 and the sustain electrode 103. Then, as illustrated in FIG. 5 d, a pattern of the groove G is formed on the dielectric paste or the dielectric dry film 104 a using a mask 505 for performing a pattern printing method As illustrated in FIG. 5 e, an etching process is performed to form the groove G on the dielectric paste or the dielectric dry film 104 a. A firing process is performed at a temperature of about 500 □ to about 600 □ to form the upper dielectric layer 104. A slope of the side of the groove G f ranges from 0.2 to 1.5. The horizontal distance A ranging from the end of the transparent electrode 102 a of the scan electrode 102 or the end of the transparent electrode 103 a of the sustain electrode 103 to the end of the bottom surface of the groove G ranges from 10 μm to 100 μm. The depth of the groove G ranges from 5 μm to 30 μm. As illustrated in FIG. 5 f, the protective layer 105 made of MgO is formed on the upper part of the upper dielectric layer 104. The embodiment of the invention being thus described, it will be obvious that the same may be varied in many ways. Such variations are not to be regarded as a departure from the spirit and scope of the invention, and all such modifications as would be obvious to one skilled in the art are intended to be included within the scope of the following claims. 1. A plasma display panel comprising: a substrate; a first electrode and a second electrode formed on the substrate, a distance between the first electrode and the second electrode ranging 10 μm to 200 μm; and a dielectric layer formed on the first electrode and the second electrode, wherein a first distance ranging from the substrate between the first electrode and the second electrode to the surface of the dielectric layer is different from a second distance ranging from the substrate, on which at least one of the first electrode and the second electrode is formed, to the surface of the dielectric layer. 2. The plasma display panel of claim 1, wherein the first distance is less than the second distance. 3. A plasma display panel comprising: a substrate; a first electrode and a second electrode formed on the substrate, a distance between the first electrode and the second electrode ranging 10 μm to 200 μm; and a dielectric layer, formed on the first electrode and the second electrode, comprising at least one groove formed between the first electrode and the second electrode. 4. The plasma display panel of claim 3, wherein a slope of the side of the groove ranges from 0.2 to 1.5. 5. The plasma display panel of claim 3, wherein the first electrode comprises a first transparent electrode, and the second electrode comprises a second transparent electrode, and a horizontal distance ranging from an end of the first transparent electrode or an end of the second transparent electrode to an end of a bottom surface of the groove ranges from 10 μm to 100 μm. 6. The plasma display panel of claim 3, wherein the depth of the groove ranges from 5 μm to 30 μm. 7. A plasma display panel comprising: a substrate; a first electrode and a second electrode formed on the substrate; and a dielectric layer, formed on the first electrode and the second electrode, comprising at least one groove formed between the first electrode and the second electrode, wherein a slope of the side of the groove ranges from 0.2 to 1.5, a horizontal distance ranging from an end of a first transparent electrode of the first electrode or an end of a second transparent electrode of the second electrode to an end of a bottom surface of the groove ranges from 10 μm to 100 μm, and the depth of the groove ranges from 5 μm to 30 μm. 8. The plasma display panel of claim 7, wherein the groove is formed between the first transparent electrode and the second transparent electrode. 9. A method of manufacturing a plasma display panel comprising: forming a first electrode and a second electrode on a substrate; forming a dielectric layer on the first electrode and the second electrode; and forming at least one groove on the dielectric layer between the first electrode and the second electrode. 10. The method of claim 9, wherein the forming of the first electrode and the second electrode comprises forming a first transparent electrode and a second transparent electrode, and the groove is formed between the first transparent electrode and the second transparent electrode. 11. The method of claim 9, wherein the dielectric layer is formed using a dielectric paste or a dielectric dry film. 12. The method of claim 9, wherein a distance between the first electrode and the second electrode ranges from 10 μm to 200 μm. 13. The method of claim 9, wherein the groove is formed using a pattern printing method. 14. The method of claim 9, wherein a slope of the side of the groove ranges from 0.2 to 1.5. 15. The method of claim 9, wherein the depth of the groove ranges from 5 μm to 30 μm. 16. The method of claim 9, wherein the forming of the first electrode and the second electrode comprises forming a first transparent electrode and a second transparent electrode, and a horizontal distance from an end of the first transparent electrode or an end of the second transparent electrode to an end of a bottom surface of the groove ranges from 10 μm to 100 μm.

2006-06-30

en

2007-01-04

US-53684806-A

Methods and Apparatus for Timing Synchronization in Packet Networks ABSTRACT Methods and apparatus for synchronizing a first clock of a transmit node and a second clock of a receive node in a packet network are provided. Receive time stamps are generated for transferred packets at a receive node in-accordance with the second clock. Propagation delay variation is filtered from receive time stamp intervals through a filter in accordance with a frequency of the second clock. The filtered receive time stamp intervals and transmit time stamp intervals of the transferred packets are input into a phase locked loop to generate a new frequency for the second clock. The filter and the second clock are updated in accordance with the new frequency for synchronization with the first clock of the transfer node. FIELD OF THE INVENTION The present invention relates generally to packet transfer networks and, more particularly, to timing synchronization over packet transfer networks. BACKGROUND OF THE INVENTION During operation, telecommunication equipment requires timing synchronization for proper communication purposes. Traditional synchronization methods utilize expensive specialized circuits to provide synchronization signals. Currently, with the prevalence of packet networks, such as, for example, Ethernet, cost can be reduced for timing synchronization by transmitting timing synchronization signals between telecommunication equipment within the packet network. However, due to the store-and-forward operation of packet networks, the synchronization signals or messages will experience an uncertain delay, which will affect the accuracy of synchronization. This uncertainty in delay is commonly referred to as packet delay variation (PDV). To improve timing synchronization accuracy, it is necessary for such delay to be significantly reduced or eliminated. There are two known categories of methods for providing timing synchronization with reduced PDV. These categories include probabilistic filtering algorithms and long time averaging. A probabilistic filtering algorithm filters out any large packet delays and uses the small packet delays for calculation of correction factors and timing synchronization of a local clock of a receive node with a transmit clock of a transmit node. This method usually has high complexity. The process of obtaining satisfactory small delays for calculation is random, therefore, successful performance of the probabilistic filtering algorithms in the short-term is not guaranteed. In a second category, long time averaging provides a method that averages the delay of multiple transferred packets in order to eliminate the PDV. However, in an actual system, obtaining an absolute time is difficult because the local clock of the receive node is not accurate and requires synchronization. Any adjustment of the local clock may adversely affect the result of the delay averaging. Moreover, this method is not flexible, in that the result of the averaging cannot be controlled. SUMMARY OF THE INVENTION The present invention provides a two-parameter low pass filter with feedback control that provides a simple and efficient way to filter PDV of transferred packets. In accordance with one aspect of the invention, a method of synchronizing a first clock of a transmit node and a second clock of a receive node in a packet network is provided. Receive time stamps are generated for transferred packets at a receive node in accordance with the second clock. Propagation delay variation is filtered from receive time stamp intervals through a filter in accordance with a frequency of the second clock. The filtered receive time stamp intervals and transmit time stamp intervals of the transferred packets are input into a phase locked loop to generate a new frequency for the second clock. The filter and the second clock are updated in accordance with the new frequency for synchronization with the first clock of the transfer node. In an illustrative embodiment, receive time stamp intervals may be determined in accordance with the receive time stamps and the second clock. The generating, filtering, inputting and updating steps may also be repeated for the continuously transferred packets. In an additional embodiment, the filter may be a double exponentially weighted moving average filter having one or more weight factors, one or more delay blocks, and one or more state machines. Further, the phase locked loop may be a digital phase locked loop having a phase detector, a loop filter and a numerically controlled oscillator. In accordance with another aspect of the present invention a receive node is provided having a clock generator for generating a first clock. A processor of the receive node is configured to generate receive time stamps for transferred packets at the receive node in accordance with the first clock. A filter of the receive node is configured to filter propagation delay variation from receive time stamp intervals in accordance with a frequency of the first clock. A phase locked loop of the receive node is configured to receive the filtered receive time stamp intervals and transmit time stamp intervals of the transferred packets and generate a new frequency for the first clock. The filter and the first clock are updated in accordance with the new frequency for synchronization with a clock of a transmit node, These and other features and advantages of the present invention will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagram illustrating a packet transfer network, according to an embodiment of the present invention; FIG. 2 is a diagram illustrating unidirectional time-stamped packet transfer, according to an embodiment of the present invention; FIG. 3 is a block diagram illustrating a clock synchronization system for a packet transfer network, according to an embodiment of the present invention; FIG. 4 is a chart illustrating the power spectrum density of T+PDV; FIG. 5 is a block diagram illustrating a low pass filter for a clock synchronization system in a packet transfer network, according to an embodiment of the present invention; and FIG. 6 is a flow diagram illustrating a clock synchronization methodology in a packet transfer network, according to an embodiment of the present invention. DETAILED DESCRIPTION As will be described in detail below, the present invention in the illustrative embodiment relates generally to the field of packet transfer networks and, more particularly, to improved techniques for the synchronization of a first clock source and a second clock source over packet networks having propagation delay. The illustrative embodiment of the present invention introduces a two-parameter low pass filter with feedback control that provides a simple and efficient way to filter PDV of transferred packets. Referring initially to FIG. 1, a diagram illustrates a packet transfer system, according to an embodiment of the present invention. A transmit node 102 includes a transmit clock 104, or master clock, in communication with a transmit node processor 106. Packets for transfer may be stored in a transfer queue of transmit node and time-stamped at transmit node 102 in accordance with transmit clock 104 and transmit node processor 106. The packets, which include data and timing information, are transferred through a network 108 to a receive node 1 10. Receive node 110 includes a receive clock 112, or slave clock, in communication with a receive node processor 114. The packets are time-stamped again at receive node 110 in accordance with receive clock 1 12 and receive node processor 114. Time-stamps are provided in accordance with the embodiments of the present invention which synchronize transmit clock 104 and receive clock 112 and eliminate PDV of the transferred packets. Referring now to FIG. 2, a diagram illustrates unidirectional time-stamped packet transfer, according to an embodiment of the present invention. FIG. 2 allows for the synchronization of a clock of receive node B with a clock of transmit node A. At times tn and tn+1, the nth and (n+1)th time-stamped packets receive time stamp values Sn and Sn+1 from in accordance with a clock of transmit node A. After some delay, these two time-stamped packets arrive at receive node B at times tn+Dn and tn+1+Dn+1. Receive node B then derives its own time stamps for the transferred packets in accordance with an arrival time of the local clock, Rn, and Rn+1. The time stamps of the transferred packets are related to the frequency of transmit node A, fA, and the frequency of receive node B, fB, by the following equations: ΔS n+1 =S n+1 −S n =f A(t n+1 −t n)=f A T   (1) ΔR n+1 =R n+1 −R n =f B(t n+1 +D n+1 −t n −D n)=f B(T+PDV n+1)   (2) where PDVn+1=Dn+1−Dn. Let Δf=fB−fA be the frequency offset between receive and transmit clocks at time tn+1. If in equation (2), PDV is removed, the ratio of the frequencies of transmit node A and receive node B is then obtained by: However, since PDV can be as large as 2 ms in packet networks such as those illustrated in FIGS. 1 and 2, huge errors may result if equation (3) is applied. The existing averaging algorithms described above assume that the time stamp difference ΔRn+1 is known in terms of real time, T+PDV. Thus, by averaging ΔRn+1, T is obtained as: T=E(ΔR n)=E(T+PDV)   (4) since the average of PDV is equal to 0. If the ΔRn+1 is measured by local clock and the resulting frequency difference in equation (3) is used to adjust the local clock, the above averaging method will produce an unexpected result, such as, for example, the system becoming unstable. This averaging may be regarded as a type of low pass filter, however it is in a fixed form without any parameter to control its behavior. When the filter has a small bandwidth, it has large time constant. Therefore, the adjustment in local frequency will take long time to be reflected in the output of this low pass filter. The consequence is that the local frequency fB will be over-adjusted. The system will be in an unstable state with the fB oscillating in a large range around its nominal frequency. Referring now to FIG. 3, a block diagram illustrates a clock synchronization system for a packet transfer network, according to an embodiment of the present invention. Such as system is utilized in accordance with transferred time stamped packets and a local clock of the receive node. A receive time stamp, Rn, is generated at block 302 for a transferred time-stamped packet through the measurement of a receive time stamp interval using a local clock 304. More specifically the receive time stamp is calculated for the transferred time-stamped packet using the local clock as well as the last receive time stamp provided for the last transferred time-stamped packet. As described above, the continuously transferred time-stamped packet intervals include PDV. Therefore, as receive time stamps for transferred time-stamped packets are continuously provided, a double exponentially weighted moving average (D-EWMA) filter 306 is utilized to filter out the PDV from the receive time stamp intervals. D-EWMA filter 306 is a low pass filter (LPF). A LPF is utilized to filter out PDV due to the fact that most of the power of PDV is located in its high frequency range. FIG. 4 is a chart that plots the power spectrum density of T+PDV. As a low pass filter, low frequencies are passed, but frequencies higher than a cutoff are attenuated or reduced. The filtered receive time stamp intervals and a transmit time stamp interval 308 are input to a digital phase locked loop (DPLL) 310. DPLL 310 is a closed-loop feedback control system that generates and outputs a signal in relation to a frequency and phase of an input signal. DPLL 310 responds both to the frequency and phase of the input signals, automatically raising or lowering the frequency of a controlled oscillator until it is matched to the reference in both frequency and phase. DPLL 310 includes a phase detector 312, a loop filter 314 and a numerically controlled oscillator 316. DPLL 310 outputs an updated local clock frequency used to adjust local clock 304. In order to overcome the problem of instability described above with regard to existing averaging algorithms, the output clock frequency from DPLL 310 is used to update the state of D-EWMA filter 306, thereby providing a dynamic adjustment to the filter cutoff for PDV. The updated local clock frequency is also utilized in providing receive time stamps. Referring now to FIG. 5, a block diagram illustrates a D-EWMA filter for a clock synchronization system in a packet transfer network, according to an embodiment of the present invention. An individual EWMA applies weighting factors that decrease exponentially. More specifically, the weighting decreases by a factor, or percentage, of the previous. A receive time stamp x(n) is fed into D-EWMA filter 500, at time n. A first exponentially weighted moving average (EWMA) filter 502 continuously utilizes receive time stamps x(n), a weight a1, a state machine s(n), a delay block z−1 and a state update from DPLL to provide a result for use in a second EWMA filter 504. Second filter utilizes a second weight a2 in combination with a state machine u(n), a delay block z−1 and a state update from DPLL in a similar configuration to produce a receive time stamp interval output without PDV. The state update from the local clock frequency is provided to both EWMA filters 502, 504. If the state update is ignored, the transfer function of D-EWMA is: Smaller a1 and a2 will result in smaller bandwidth. Choosing different parameters will result in different bandwidths, which also affects the system's dynamic response. Suppose that the DPLL changes the local frequency fB by: f B(n+1)=f B(n)·ζ  (6) The corresponding state update on the D-EWMA filter will be: s(n)s(n)·ζ u(n)u(n)·ζ  (7) The above update can be intuitively explained as constant component jump. In the ideal case, the output of low pass filter should only keep its constant component. With the change of local frequency, such constant component is then changed and must be immediately updated in the filter. A low pass filter alone will take long time to provide such an update as described above. Therefore, this state update forces the filter to make a sudden jump which will eliminate the oscillation of frequency adjustment. Referring now to FIG. 6, a flow diagram illustrates a clock synchronization methodology in a packet network, according to an embodiment of the present invention. The methodology begins in block 602 where a transferred packets are continuously received at a receive node of a packet transfer network. In block 604, a local clock provides receive time stamps for the transferred packets. In block 606, receive time stamp intervals are determined for the transferred packets in accordance with the local clock and previous receive time stamps for previously transferred packets. In block 608, propagation variation delay of the receive time stamp intervals are filtered out through a D-EWMA filter. The D-EWMA filter is updateable in accordance with a frequency of the local clock. In block 610, the filtered receive time stamp intervals and transmit time stamp intervals are input to a DPLL to output a new local clock frequency. In block 612, the D-EWMA filter and the local clock are updated in accordance with the new local clock frequency. The methodology then returns to block 602 for repetition of the methodology in accordance with the updated local clock and D-EWMA filter for the continuously arriving transferred packets at the receive node. The embodiment of the present invention illustrates the use of a D-EWMA filter with feedback control in unidirectional timing transport over packet networks. However, its utilization can be applied to any situation where the PDV is required to be filtered to update the frequency or phase of a local clock. The D-EWMA filter with feedback control has a simple implementation and provides efficient PDV filtering. This embodiment of the present invention can be integrated into hardware (DPLL) without any interference from software. But due to the feedback update on the D-EWMA filter, the frequency of a transmit node may be intentionally changed to introduce large PDV, for observation of the output frequency at the receive node. The present invention may be implemented in the form of one or more integrated circuits or computer programs. For example, a given system node in accordance with the invention may be implemented as one or more integrated circuits comprising at least one processor and at least one memory. Numerous other configurations are possible. In such an integrated circuit implementation, a plurality of identical die is typically formed in a repeated pattern on a surface of a semiconductor wafer. Each die includes a device described herein, and may include other structures or circuits. The individual die are cut or diced from the wafer, then packaged as an integrated circuit. One skilled in the art would know how to dice wafers and package die to produce integrated circuits. Integrated circuits so manufactured are considered part of this invention. Although illustrative embodiments of the present invention have been described herein with reference to the accompanying drawings, it is to be understood that the invention is not limited to those precise embodiments, and that various changes and modifications may be made therein by one skilled in the art without departing from the scope of the invention. It is also possible for the illustrative embodiments of the present invention to be implemented as a software program or any other logical method to process information. 1. A method for synchronizing a first clock of a transmit node with a second clock of a receive node in a packet transfer network, comprising the steps of: generating receive time stamps for transferred packets at a receive node in accordance with the second clock; filtering propagation delay variation from receive time stamp intervals through a filter in accordance with a frequency of the second clock; inputting the filtered receive time stamp intervals and transmit time stamp intervals of the transferred packets into a phase locked loop to generate a new frequency for the second clock; and updating the filter and the second clock in accordance with the new frequency for synchronization with the first clock of the transfer node. 2. The method of claim 1, wherein the step of generating receive time stamps comprises the step of determining receive time stamp intervals in accordance with the receive time stamps and the second clock. 3. The method of claim 1, further comprising the step of repeating the generating, filtering, inputting and updating steps for additional transferred packets. 4. The method of claim 1, wherein, in the filtering step, the filter comprises a low pass filter. 5. The method of claim 4, wherein, in the filtering step, the low pass filter comprises a double exponentially weighted moving average filter. 6. The method of claim 5, wherein, in the filtering step, the double exponentially weighted moving average filter comprises at least one of one or more weight factors, one or more delay blocks, and one or more state machines. 7. The method of claim 1, wherein, in the inputting step, the phase locked loop comprises a digital phase locked loop. 8. The method of claim 7, wherein, in the inputting step, the digital phase locked loop comprises a phase detector, a loop filter and a numerically controlled oscillator. 9. An article of manufacture for synchronizing a first clock of a transmit node and a second clock of a receive node in a packet network, comprising a machine readable medium containing one or more programs which when executed implement the steps of claim 1. 10. An integrated circuit device in a receive node for synchronizing a first clock of a transmit node and a second clock of the receive node, wherein the integrated circuit device is configured to: generate receive time stamps for transferred packets at a receive node in accordance with the second clock; filter propagation delay variation from receive time stamp intervals through a filter in accordance with a frequency of the second clock; input the filtered receive time stamp intervals and transmit time stamp intervals of the transferred packets into a phase locked loop to generate a new frequency for the second clock; and update the filter and the second clock in accordance with the new frequency for synchronization with the first clock of the transmit node. 11. The integrated circuit device of claim 10, wherein the integrated circuit device is further configured to determine receive time stamp intervals in accordance with the receive time stamps and the second clock. 12. The integrated circuit device of claim 10, wherein the integrated circuit device is further configured to repeat the generating, filtering, inputting and updating steps for additional transferred packets. 13. The integrated circuit device of claim 10, wherein the filter comprises a low pass filter. 14. The integrated circuit device of claim 13, wherein the low pass filter comprises a double exponentially weighted moving average filter. 15. The integrated circuit device of claim 14, wherein, the double exponentially weighted moving average filter comprises at least one of one or more weight factors, one or more delay blocks, and one or more state machines. 16. The integrated circuit device of claim 10, wherein the phase locked loop comprises a digital phase locked loop. 17. The integrated circuit device of claim 16, wherein the digital phase locked loop comprises a phase detector, a loop filter and a numerically controlled oscillator. 18. A receive node comprising: a clock generator for generating a first clock; a processor configured to generate receive time stamps for transferred packets at the receive node in accordance with the first clock; a filter configured to filter propagation delay variation from receive time stamp intervals in accordance with a frequency of the first clock; and a phase locked loop configured to receive the filtered receive time stamp intervals and transmit time stamp intervals of the transferred packets and generate a new frequency for the first clock, wherein the filter and the first clock are updated in accordance with the new frequency for synchronization with a clock of a transmit node. 19. A packet transfer system comprising: a transmit node comprising the first clock generator for generating a first clock; and a receive node comprising: a clock generator for generating a second clock; a processor configured to generate receive time stamps for transferred packets at the receive node in accordance with the second clock; a filter configured to filter propagation delay variation from receive time stamp intervals in accordance with a frequency of the second clock; and a phase locked loop configured to receive the filtered receive time stamp intervals and transmit time stamp intervals of the transferred packets and generate a new frequency for the second clock, wherein the filter and the second clock are updated in accordance with the new frequency for synchronization with the first clock of a transmit node,

2006-09-29

en

2008-04-03

US-202016774738-A

5g fixed wireless access device self-installation ABSTRACT A fixed wireless access device may include a memory configured to store instructions and a processor configured to execute the instructions to activate a Fifth Generation (5G) scanning mode and scan for 5G wireless signals associated with a provider that is also associated with the fixed wireless access device. The processor may be further configured to detect a 5G wireless signal associated with the provider; determine a signal strength for the detected 5G wireless signal; and generate an indication of the determined signal strength to be displayed in a user interface associated with the fixed wireless access device. CROSS REFERENCE TO RELATED APPLICATIONS This patent application is a continuation of U.S. patent application Ser. No. 16/121,934, filed on Sep. 5, 2018, the contents of which are hereby incorporated by reference in their entirety. BACKGROUND INFORMATION Wireless communication services continue to improve and expand available services as well as networks used to deliver such services. One aspect of such improvements includes the development of wireless access networks as well as options to utilize such wireless access networks. Network providers may manage a large number of wireless access networks and a particular wireless access network may manage a large number of devices. In order to maintain a quality of service across a network, or across multiple networks, network providers may need to manage different radio technology types. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagram illustrating an environment according to an implementation described herein; FIG. 2 is a diagram illustrating exemplary components of the wireless access network of FIG. 1; FIG. 3 is a diagram illustrating exemplary components of a device that may be included in a device of FIG. 1 and/or FIG. 2; FIG. 4 is a diagram illustrating exemplary functional components of the eNodeB and gNodeB of FIG. 2; FIG. 5 is a diagram illustrating exemplary functional components of the fixed wireless access device of FIG. 1; FIG. 6 is a flowchart of a process for obtaining the signal strength associated with a Fifth Generation wireless signal according to an implementation described herein; FIG. 7A is a flowchart of a first process for scanning for a Fifth Generation wireless signal according to implementations described herein; FIG. 7B is a flowchart of a second process for scanning for a Fifth Generation wireless signal according to implementations described herein; FIG. 8 is a flowchart of a process for enabling a fixed wireless access device to scan for a Fifth Generation wireless signal according to implementations described herein; FIG. 9 illustrates a first exemplary signal flow for obtaining the signal strength associated with a Fifth Generation wireless signal according to an implementation described herein; FIG. 10 illustrates a second exemplary signal flow for obtaining the signal strength associated with a Fifth Generation wireless signal according to an implementation described herein; FIG. 11 illustrates a third exemplary signal flow for obtaining the signal strength associated with a Fifth Generation wireless signal according to an implementation described herein; FIG. 12 illustrates a fourth exemplary signal flow for obtaining the signal strength associated with a Fifth Generation wireless signal according to an implementation described herein; FIG. 13 illustrates a fifth exemplary signal flow for obtaining the signal strength associated with a Fifth Generation wireless signal according to an implementation described herein; FIG. 14A is a diagram of a first exemplary user interface according to an implementation described herein; and FIG. 14B is a diagram of a second exemplary user interface according to an implementation described herein. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS The following detailed description refers to the accompanying drawings. The same reference numbers in different drawings identify the same or similar elements. As communication networks and services increase in size, complexity, and number of users, management of the communication networks may become increasingly more complicated. One way in which wireless access networks are continuing to become more complicated is by incorporating various aspects of next generation networks, like Fifth Generation (5G) mobile networks, as defined by the 3rd Generation Partnership Project (3GPP). These aspects may include, for example, high frequency bands and a large number of antennas. 5G mm-wave air interface technology, referred to as 5G New Radio (NR) radio access technology (RAT), may provide significant improvements in bandwidth and/or latency over other wireless network technologies. Furthermore, coverage and signal quality may be improved using multiple-input and multiple-output (MIMO) adaptive antenna arrays. Additionally, user equipment (UE) devices may also include multiple antennas to improve spectral efficiency. The 5G NR mm-wave air interface may include a high bandwidth that provides high data throughput in comparison to the data throughput of a Fourth Generation (4G) Long Term Evolution (LTE) air interface. However, because of the high mm-wave frequencies, the 5G NR air interface may be susceptible to intermittent signal quality degradation due to multipath wave propagation and fading, as a result of scattering from terrain objects, such as buildings, foliage, mountains, vehicles, etc.; reflection from bodies of water; ionospheric reflection and/or refraction; atmospheric attenuation and scattering; and/or other types of signal interference. Such variations in signal quality may be particularly important in areas with a low density of 5G coverage, such as during the initial deployment of 5G base stations. 5G NR coverage may initially be deployed as islands relative to existing air interface coverage. Thus, areas with 5G NR coverage may also provide existing 4G LTE coverage, and UE devices enabled to communicate using 5G NR may be able to attach to both a 4G base station and a 5G base station. A UE device may be simultaneously attached to a master cell group (MCG), also known as a master eNodeB, and a secondary cell group (SCG), also known as a secondary eNodeB. If 5G NR coverage is available, the SCG may correspond to a 5G NR base station, referred to as a gNodeB. Dual coverage using 4G and 5G networks may be referred to as Non-Standalone (NSA) architecture. The NSA architecture may include an interoperability option referred to as Option 3x. Option 3x may include a split bearer option in which a gNodeB splits user plane traffic when the 5G NR air interface is not available (e.g., signal quality of the 5G NR air interface is below a signal quality threshold, the capacity of the 5G NR air interface is below a capacity threshold, etc.). Thus, when the 5G NR link is available, downlink data may be sent to the UE device via the gNodeB. When the 5G NR link is not available, downlink data may be sent by the 5G base station to the eNodeB and the eNodeB may send the downlink data to the UE device via the 4G LTE air interface. Therefore, gNodeB may switch back and forth between sending the data via the 5G air interface and the 4G LTE air interface. Additionally, Option 3X may enable simultaneous data transfer over a 5G NR air interface and a 4G LTE air interface. In order to take advantage of the high bandwidths available via the 5G NR air interface, a provider of communication services may deploy fixed wireless access (FWA) devices to provide telecommunication services, such as Internet service that includes Voice over Internet Protocol (VoIP), video streaming, live gaming, Internet browsing, etc. Thus, instead of a wired electrical connection (e.g., a coaxial cable connection, etc.) or an optical connection (e.g., an optical network terminal (ONT) connected to an optical fiber, etc.), an FWA device may connect a customer to a network through one or more base stations via wireless signals. The FWA device may function as a UE device with respect to the one or more base stations. An FWA device may be installed in a fixed location at the customer premises associated with a customer, such as a residential house, an apartment building, an office building, etc. In order to install and configure Internet service for a customer, a provider may need to dispatch a technician to the customer premises to install and configure a network device. However, dispatching a technician is costly to the provider and inconvenient to the customer. Therefore, if a customer is able to install an FWA device without a technician, the provider may save money and the customer may be able to install the FWA device at the customer's convenience. As the signal strength of 5G NR wireless signals may vary significantly at different locations in a customer premises location, the customer may need to identify a good location, inside or outside a building (e.g., a house, apartment, office building, etc.) at which to install the FWA device for good 5G NR wireless signal coverage. In order to identify a good location, the customer may need to determine the signal strength of 5G NR wireless signals as the customer places the FWA device in various locations around the customer premises. However, in the NSA architecture, a UE device may not always connect to a gNodeB on its own and may need to wait for the network to configure a 5G NR connection after the UE device attaches to a master 4G LTE base station. Moreover, the 3GPP standard for 5G does not include an operator identifier (ID) (e.g., a Public Land Mobile Network (PLMN) ID, etc.) to be broadcast or require that a system information block (SIB) be broadcast in an NSA option 3x implementation. Therefore, an FWA device may not be able to identify 5G NR wireless signals from the gNodeB associated with the provider during installation. Implementations described herein relate to 5G FWA device self-installation by enabling an FWA device to scan for 5G signals and to provide, to a customer, an indication of the signal strength of a 5G signal during installation. The FWA device may be configured to activate a 5G scanning mode and scan for 5G wireless signals associated with a provider that is also associated with the fixed wireless access device. The FWA device may be further configured to detect a 5G wireless signal associated with the provider; determine strength for the detected 5G wireless signal; and generate an indication of the determined signal strength to be displayed in a user interface associated with the fixed wireless access device. In some implementations, the gNodeB may be configured to broadcast a SIB that includes one or more operator IDs, such as a PLMN ID. Thus, the FWA device may be configured to determine a 5G operator ID associated with the provider and scan for 5G wireless signals that include the determined 5G operator identifier. Configuring the gNodeB to broadcast an operator ID may not require an active connection or data transfer between the FWA device and the network. In some implementations, configuring a gNodeB to transmit an operator ID may not be possible or desired. Furthermore, broadcasting a SIB, which may require higher level channels, such as a logical channel and/or transport channel, may consume network resources. Therefore, in some implementations, a gNodeB may not be broadcasting a SIB when a user initiates a scan for 5G signals in connection with the installation of an FWA device. Rather, the FWA device may be configured to obtain information identifying a 5G synchronization signal, such as, for example, a 5G NR Synchronization Signal Block (SSB). In a 5G NR NSA implementation, an SSB may be broadcast using different bands and/or channels and may include various timing and spacing configurations. Thus, the FWA device may need to obtain information on how to locate and identify the 5G synchronization signal. In some implementations, information identifying parameters associated with the SSB may be stored on the FWA device and/or on a Subscriber Identity Module (SIM) card included in the FWA device. In other implementations, the FWA device may obtain information identifying a frequency at which a 5G synchronization signal is broadcast, and/or other 5G synchronization signal parameters, and may scan for the 5G synchronization signal at the identified frequency and/or using the other 5G synchronization signal parameters, such as the timing and/or spacing of the 5G synchronization signal. As an example, the FWA device may obtain the 5G synchronization signal parameters after attaching to a 4G LTE base station, via a SIM Over-the-air (OTA) system during a SIM update, via a server device communicating with an application installed on a smart phone (or another type of client device) connected to the FWA device, and/or using another technique. In other implementations, the FWA device may be configured to attach to a 4G LTE base station; cause the 4G LTE base station to add a 5G NR base station as a secondary node base station for the fixed wireless access device; and scan for 5G wireless signals associated with the 5G NR base station. In some implementations, the FWA device may be configured to cause the 4G LTE base station to add the 5G NR base station as a secondary node by transmitting an FWA ID in an attach request. For example, the FWA device may be configured to send an attach request to a 4G LTE base station with an FWA ID included in the attach request. The FWA ID may be recognized by the wireless access network, and, in response, the wireless access network may trigger the 4G LTE base station to add a 5G NR base station as a secondary node to the 4G LTE base station. The FWA device may then receive, from the 4G LTE base station, a reconfiguration message that indicates to the FWA device that the 5G secondary node has been added and that includes information identifying a synchronization signal associated with the added 5G secondary node. The FWA device may then measure and report the 5G signal strength based on the indicated frequency of the SSB signal. In other implementations, the FWA device may be identified using other techniques. As example, rather than sending a FWA ID in an attach request, the wireless access network may identify the FWA device as an FWA device type based on another type of ID associated with the FWA device, such as, for example, a Service Profile ID (SPID), an International Mobile Equipment Identity (IMEI), International Mobile Subscriber Identity (IMSI), and/or another type of device ID or subscription type. The device ID may be associated with a FWA device type during provisioning and stored in a subscriber profile associated with the FWA device. As another example, the wireless access network may identify the FWA device as an FWA device type based on how the FWA device select to connect to the wireless access network, such as by the FWA device requesting to access a particular Access Point Name (APN), requesting a bearer with a particular Allocation and Retention Priority (ARP) and/or Quality of Service Class ID (QCI), and/or another type of request for a particular type of connection. As yet another example, the FWA device may inform the wireless access network of its FWA device type status during a UE capability transfer procedure. In yet other implementations, the FWA device may be configured to cause the 4G LTE base station to add the 5G NR base station as a secondary node by requesting a high data rate traffic connection. For example, the FWA device may be configured to attach to a 4G LTE base station and request high data rate traffic via a connection with the 4G LTE base station. The high data rate traffic may trigger the 4G LTE base station to add a 5G NR base station as a secondary node. The FWA device may then receive, from the 4G LTE base station, a reconfiguration message that indicates to the FWA device that the 5G secondary node has been added and that includes information identifying a synchronization signal associated with the added 5G secondary node. The FWA device may then measure and report the 5G signal strength based on the indicated frequency of the SSB signal. In yet other implementations, the FWA device may not cause the 4G LTE base station to add the 5G NR base station as a secondary node by transmitting an FWA ID in an attach request. Rather, the FWA ID, and/or other technique of detecting a FWA device type, may cause the 4G LTE base station to instruct the FWA device to perform a 5G signal strength measurement. For example, the 4G LTE base station may instruct the FWA device to perform a B1 event measurement using a measurement object specified in a reconfiguration message. A B1 event corresponds to an inter RAT neighbor becoming better than a threshold. Thus, the B1 event measurement causes the FWA device to measure the 5G signal strength to determine whether the 5G signal strength is high enough to trigger a measurement report. The measurement object in the reconfiguration message may specify one or more parameters of a 5G synchronization signal, such as a carrier frequency, subcarrier spacing, timing configuration, and/or other types of parameters, which enable the FWA device to identify, and determine the strength of, the 5G synchronization signal. In yet other implementations, the 4G LTE base station may instruct the FWA device to perform the 5G signal strength measurement without first detecting the FWA device as a FWA device type. Rather, the 4G LTE base station may instruct all UE devices to perform a 5G signal strength measurement. In some implementations, generating the indication of the determined signal strength may include displaying the indication of the determined signal strength on an output device included on the fixed wireless access device. In other implementations, generating the indication of the determined signal strength may include sending the indication of the determined signal strength to a client device configured to communicate with the fixed wireless access device, to be displayed by the client device. In some implementations, the FWA device may be further configured to keep track of the signal strength for the detected 5G wireless signal over a time period and generate an indication of how the signal strength for the detected 5G wireless signal varies over the time period, to be displayed in the user interface associated with the fixed wireless access device. Additionally, in some implementations, the FWA device may be further configured to keep track of the signal strength for the detected 5G wireless signal at different installed locations for the fixed wireless access device and generate an indication of how the signal strength for the detected 5G wireless signal varies over the different installed locations, to be displayed in the user interface associated with the fixed wireless access device. FIG. 1 is a diagram of an exemplary environment 100 in which the systems and/or methods, described herein, may be implemented. As shown in FIG. 1, environment 100 may include a customer premises equipment (CPE) network 110, a wireless access network 140, a packet data network 170, a SIM OTA system 180, and an FWA device system 190. CPE network 110 may include a Layer 2 and/or Layer 3 local area network (LAN) associated with a customer's premises. For example, CPE network 110 may be located at or within a residential home, in an apartment building, in a school, in a commercial office building, in a shopping mall, in a connected mass transit vehicle (e.g., bus, train, plane, boat, etc.), and/or in another type of location associated with a customer of a provider of telecommunication services. CPE network 110 may receive one or more services via a wireless connection between FWA device 120 and packet data network 170, such as, for example, a television service, Internet service, and/or voice communication (e.g., telephone) service. CPE network 110 may be implemented as a gigabit network that enables gigabit speed connections. CPE network 110 may include FWA device 120, a CPE controller 130, WiFi APs 132-A to 132-M (referred to herein collectively as “WiFi APs 132” and individually as “WiFi AP 132”), and client devices 134-A to 134-M (referred to herein collectively as “client devices 134” and individually as “client device 134”). FWA device 120 may be installed in a particular location at, or near, the customer premises, such as outside a building (e.g., on a roof, attached to an outside wall, et.) or inside a building (e.g., next to a window or at another location associated with good wireless signal reception). FWA device 120 may be configured to attach to, and communicate with, wireless access network 140. FWA device 120 may be configured to communicate via both a 4G LTE air interface and a 5G NR air interface. FWA device 120 may be configured to detect 5G wireless signals associated with a provider and to generate an indication of signal strength for the detected 5G wireless signals on a user interface associated with FWA device 120. CPE controller 130 may include a network device configured to function as a switch and/or router for devices in CPE network 110. CPE controller 130 may connect devices in CPE network 110 to FWA device 120. CPE controller 130 may include a layer 2 and/or layer 3 network device, such as a switch, router, firewall, and/or gateway and may support different types of interfaces, such as an Ethernet interface, a WiFi interface, a Multimedia over Coaxial Alliance (MoCa) interface, and/or other types of interfaces. CPE controller 130 may further manage WiFi APs 132 and/or client devices 134 connected to WiFi APs 132. WiFi AP 132 may include a transceiver configured to communicate with client devices 134 using WiFi signals based on the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standards for implementing a wireless LAN network. WiFi AP 132 may enable client devices 134 to communicate with each other and/or with FWA device 120 via CPE controller 130. WiFi AP 132 may be connected to CPE controller 130 via a wired connection (e.g., an Ethernet cable). Furthermore, WiFi APs 132 may include one or more Ethernet ports for connecting client devices 134 via a wired Ethernet connection. In some implementations, FWA device 120 may include, and/or perform the functions of, CPE controller 130 and/or WiFi AP 132. Client device 134 may include any computer device that connects to a particular WiFi AP 132 using WiFi wireless signals. For example, client device 134 may include a handheld wireless communication device (e.g., a mobile phone, a smart phone, a phablet device, etc.); a wearable computer device (e.g., a head-mounted display computer device, a head-mounted camera device, a wristwatch computer device, etc.), a global positioning system (GPS) device; a laptop computer, a tablet computer, or another type of portable computer; a desktop computer; a set-top box or a digital media player (e.g., Apple TV, Google Chromecast, Amazon Fire TV, etc.); a smart television; a portable gaming system; a home appliance device; a home monitoring device; and/or any other type of computer device with wireless communication capabilities. Client device 134 may be used for voice communication, mobile broadband services (e.g., video streaming, real-time gaming, premium Internet access etc.), best effort data traffic, and/or other types of applications. As another example, client device 134 may correspond to an embedded wireless device that communicates wirelessly with other devices over an M2M interface using MTC and/or another type of M2M communication. As an example, client device 134 may be electrically connected or coupled to a sensor device, an actuator device, a microcontroller controlling one or more sensors, a microcontroller controlling one or more actuators, a microcontroller that performs data processing, and/or another type of MTC device. Examples of such devices may include a health monitoring device (e.g., a blood pressure monitoring device, a blood glucose monitoring device, etc.), an asset tracking device (e.g., a system monitoring the geographic location of a fleet of vehicles, etc.), a traffic management device (e.g., a traffic light, traffic camera, road sensor, road illumination light, etc.), a climate controlling device (e.g., a thermostat, a ventilation system, etc.), a device controlling an electronic sign (e.g., an electronic billboard, etc.), a device controlling a manufacturing system (e.g., a robot arm, an assembly line, etc.), a device controlling a security system (e.g., a camera, a motion sensor, a window sensor, etc.), a device controlling a power system (e.g., a smart grid monitoring device, a utility meter, a fault diagnostics device, etc.), a device controlling a financial transaction system (e.g., a point-of-sale terminal, a vending machine, a parking meter, etc.), and/or another type of electronic device. Wireless access network 140 may provide access to packet data network 170 for wireless devices, such as FWA device 120. Wireless access network 140 may enable FWA device 120 to connect to packet data network 170 for mobile telephone service, Short Message Service (SMS) message service, Multimedia Message Service (MMS) message service, Internet access, cloud computing, and/or other types of data services. Wireless access network 140 may establish or may be incorporated into a packet data network connection between FWA device 120 and packet data network 170 via one or more Access Point Names (APNs). For example, wireless access network 140 may establish an Internet Protocol (IP) connection between FWA device 120 and packet data network 170. Furthermore, wireless access network 140 may enable FWA device 120 to communicate with an application server, and/or another type of device, located in packet data network 170 using a communication method that does not require the establishment of an IP connection between FWA device 120 and packet data network 170, such as, for example, Data over Non-Access Stratum (DoNAS). In some implementations, wireless access network 140 may include a Long Term Evolution (LTE) access network (e.g., an evolved packet core (EPC) network). In other implementations, wireless access network 140 may include a Code Division Multiple Access (CDMA) access network. For example, the CDMA access network may include a CDMA enhanced High Rate Packet Data (eHRPD) network (which may provide access to an LTE access network). Furthermore, wireless access network 140 may include an LTE Advanced (LTE-A) access network and/or a 5G access network or other advanced network that includes functionality such as carrier aggregation; advanced or massive multiple-input and multiple-output (MIMO) configurations (e.g., an 8×8 antenna configuration, a 16×16 antenna configuration, a 256×256 antenna configuration, etc.); cooperative MIMO (CO-MIMO); relay stations; Heterogeneous Networks (HetNets) of overlapping small cells and macrocells; Self-Organizing Network (SON) functionality; MTC functionality, such as 1.4 MHz wide enhanced MTC (eMTC) channels (also referred to as category Cat-M1), Low Power Wide Area (LPWA) technology such as Narrow Band (NB) IoT (NB-IoT) technology, and/or other types of MTC technology; and/or other types of LTE-A and/or 5G functionality. As described herein, wireless access network 140 may include a 4G base station 150 (e.g., an eNodeB) and a 5G base station 160 (e.g., a gNodeB). 4G base station 150 and 5G base station 160 may each include one or more cells that include devices and/or components configured to enable wireless communication with FWA devices 120. For example, each cell may include a radio frequency (RF) transceiver facing a particular direction. 4G base station 150 may be configured to communicate with FWA device 120 using a 4G LTE air interface. 5G base station 160 may be configured to communicate with FWA device 120 using a 5G NR air interface. For example, 5G base station 160 may include one or more antenna arrays configured to send and receive wireless signals in the mm-wave frequency range. Packet data network 170 may include, and/or be connected to and enable communication with, a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), an optical network, a cable television network, a satellite network, a wireless network (e.g., a CDMA network, a general packet radio service (GPRS) network, and/or an LTE network), an ad hoc network, a telephone network (e.g., the Public Switched Telephone Network (PSTN) or a cellular network), an intranet, or a combination of networks. Some or all of packet data network 170 may be managed by a provider of communication services that also manages wireless access network 140 and/or FWA device 120. Packet data network 170 may allow the delivery of Internet Protocol (IP) services to FWA device 120, and may interface with other external networks. Packet data network 170 may include one or more server devices and/or network devices, or other types of computation or communication devices. In some implementations, Packet data network 170 may include an IP Multimedia Sub-system (IMS) network (not shown in FIG. 1). An IMS network may include a network for delivering IP multimedia services and may provide media flows between FWA device 120 and external IP networks or external circuit-switched networks (not shown in FIG. 1). SIM OTA system 180 may include one or more devices, such as computer devices and/or server devices, which manage SIM cards for UE devices, such as FWA device 120. For example, SIM OTA system 180 may provide SIM updates to the SIM card included in FWA device 120. Furthermore, SIM OTA system 180 may include information relating to 5G signals in a SIM update sent to FWA device 120. For example, SIM OTA system 180 may obtain information relating to the parameters of a 5G synchronization signal from FWA device system 190 and include the obtained information in the SIM update to FWA device 120. FWA device system 190 may include one or more devices, such as computer devices and/or server devices, which manage various aspects of the functionality of FWA device 120. For example, FWA device system 190 may maintain a database of parameters relating to 5G synchronization signals for 5G base stations 160 associated with a provider. For example, for each particular 5G base station 160, FWA device system 190 may store information relating to the location of the particular 5G base station 160 and/or the geographical area serviced by the particular 5G base station 160, information relating to an operator ID associated with the particular 5G base station 160, information relating to one or more parameters relating to 5G a 5G synchronization signal that is broadcast by the particular 5G base station 160, and/or other types of information associated with the particular 5G base station 160. Furthermore, FWA device system 190 may manage an FWA device application associated with FWA device 120. For example, FWA device system 190 may provide the FWA device application to client device 134, such as a customer's smart phone, and may communicate with client device 134 via the FWA device application. For example, FWA device system 190 may provide information relating to one or more parameters of a 5G synchronization signal to client device 134 and client device 134 may forward the information to FWA device 120. Although FIG. 1 shows exemplary components of environment 100, in other implementations, environment 100 may include fewer components, different components, differently arranged components, or additional functional components than depicted in FIG. 1. Additionally, or alternatively, one or more components of environment 100 may perform functions described as being performed by one or more other components of environment 100. FIG. 2 is a diagram illustrating exemplary components of wireless access network 140 in the context of environment 100 according to an implementation described herein. As shown in FIG. 2, wireless access network 140 may include eNodeB 210, gNodeB 220, a Serving Gateway (SGW) 230, a Packet Data Network (PDN) Gateway (PGW) 240, a Mobility Management Entity (MME) 250, a Policy and Charging Rules Function (PCRF) device 260, and Home Subscriber Server (HSS) 270. While FIG. 2 depicts a single eNodeB 210, a single gNodeB 220, a single SGW 230, a single PGW 240, a single MME 250, a single PCRF device 260, and a single HSS 270, for illustration purposes, in practice, wireless access network 140 may include multiple eNodeBs 210, multiple gNodeB 220, multiple SGW 230, multiple PGW 240, multiple MME 250, multiple PCRF device 260, and/or multiple HSS 270. eNodeB 210 may correspond to 4G base station 130. eNodeB 210 may communicate with FWA device 120 using a 4G LTE air interface referred to as an Evolved Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (E-UTRA) interface 212. eNodeB 210 may interface with wireless access network 140 via an interface referred to as an S1 interface, which may include both a control plane S1-MME interface 218 and a data plane S1-U interface 216. S1-MME interface 218 may interface with MME 250. S1-MME interface 218 may be implemented, for example, with a protocol stack that includes a Non-Access Stratum (NAS) protocol and/or Stream Control Transmission Protocol (SCTP). An S1-U interface 216 may interface with SGW 230 and may be implemented, for example, using General Packet Radio Service (GPRS) Tunneling Protocol version 2 (GTPv2). gNodeB 220 may correspond to 5G base station 140. gNodeB 220 may communicate with FWA device 120 using a 5G NR air interface referred to as an F1 interface 222. gNodeB 220 may communicate with SGW 230 using an S1-U interface 226. gNodeB 220 may communicate with eNodeB 210 using an X2 interface 214. For example, when gNodeB 220 determines that F1 interface 222 is not available, gNodeB 220 may forward downlink data to FWA device 120 via eNodeB 210 using X2 interface 214. SGW 230 may provide an access point to and from FWA device 120, may handle forwarding of data packets for FWA device 120, and may act as a local anchor point during handover procedures between eNodeBs 210 and/or gNodeB 220. SGW 230 may interface with PGW 240 through an S5/S8 interface 232. S5/S8 interface 232 may be implemented, for example, using GTPv2. PGW 240 may function as a gateway to packet data network 170 through an SGi interface 242. A particular FWA device 120, while connected to a single SGW 230, may be connected to multiple PGWs 240, one for each packet network with which FWA device 120 communicates. For example, a particular PGW 240 may be associated with a particular APN and FWA device 120 may connect to the particular APN by connecting to the PGW 240 associated with the particular APN. Thus, FWA device 120 may be connected to one or more APNs at a particular time. MME 250 may implement control plane processing for wireless access network 140. For example, MME 250 may implement tracking and paging procedures for FWA device 120, may activate and deactivate bearers for FWA device 120, may authenticate a user of FWA device 120, and may interface to non-LTE radio access networks. A bearer may represent a logical channel with particular quality of service (QoS) requirements. MME 250 may also select a particular SGW 230 for a particular FWA device 120. A particular MME 250 may interface with other MMES 250 in wireless access network 130 (not shown in FIG. 2) and may send and receive information associated with FWA devices 120, which may allow one MME 250 to take over control plane processing of FWA devices 120 serviced by another MME 250, if the other MME 250 becomes unavailable. Furthermore, MME 250 may manage non-IP communication with FWA device 120 using NAS. MME 250 may communicate with SGW 230 through an S11 interface 234. S11 interface 234 may be implemented, for example, using GTPv2. S11 interface 234 may be used to create and manage a new session for a particular FWA device 120. S11 interface 234 may be activated when MME 250 needs to communicate with SGW 230, such as when the particular FWA device 120 attaches to wireless access network 130, when bearers need to be added or modified for an existing session for the particular FWA device 120, when a connection to a new PGW 240 needs to be created, or during a handover procedure (e.g., when the particular FWA device 120 needs to switch to a different SGW 230). PCRF device 260 may implement policy and charging rules functions, such as establishing QoS requirements, setting allowed bandwidth and/or data throughput limits for particular bearers and/or FWA devices 120, determining charges for a particular service for a FWA device 120, and/or other types of policy or charging rules. PCRF device 260 may communicate with PGW 240 through a Gx interface 262. Gx interface 262 may be implemented, for example, using Diameter protocol. HSS 270 may store subscription information associated with FWA devices 120 and/or information associated with users of FWA devices 120. For example, HSS 270 may store subscription profiles that include authentication, access, and/or authorization information. Each subscription profile may include information identifying FWA device 120, authentication and/or authorization information for FWA device 120, services enabled and/or authorized for FWA device 120, device group membership information for FWA device 120, and/or other types of information associated with FWA device 120. HSS 270 may communicate with MME 250 through an S6a interface 272. S6a interface 272 may be implemented, for example, using a Diameter protocol. HSS 270 may communicate with PCRF device 260 using an S6t interface 274 and with PGW 240 using an S6b interface 276. Although FIG. 2 shows exemplary components of wireless access network 140, in other implementations, wireless access network 140 may include fewer components, different components, differently arranged components, or additional components than depicted in FIG. 2. Additionally, or alternatively, one or more components of wireless access network 140 may perform functions described as being performed by one or more other components of wireless access network 140. FIG. 3 is a diagram illustrating example components of a device 300 according to an implementation described herein. FWA device 120, CPE controller 130, WiFi AP 132, client device 134, SIM OTA system 180, FWA device system 190, eNodeB 210, gNodeB 220, SGW 230, PGW 240, MME 250, PCRF device 260, and/or HSS 270 may each include one or more devices 300. As shown in FIG. 3, device 300 may include a bus 310, a processor 320, a memory 330, an input device 340, an output device 350, and a communication interface 360. Bus 310 may include a path that permits communication among the components of device 300. Processor 320 may include any type of single-core processor, multi-core processor, microprocessor, latch-based processor, and/or processing logic (or families of processors, microprocessors, and/or processing logics) that interprets and executes instructions. In other embodiments, processor 320 may include an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and/or another type of integrated circuit or processing logic. Memory 330 may include any type of dynamic storage device that may store information and/or instructions, for execution by processor 320, and/or any type of non-volatile storage device that may store information for use by processor 320. For example, memory 330 may include a random access memory (RAM) or another type of dynamic storage device, a read-only memory (ROM) device or another type of static storage device, a content addressable memory (CAM), a magnetic and/or optical recording memory device and its corresponding drive (e.g., a hard disk drive, optical drive, etc.), and/or a removable form of memory, such as a flash memory. Input device 340 may allow an operator to input information into device 300. Input device 340 may include, for example, a keyboard, a mouse, a pen, a microphone, a remote control, an audio capture device, an image and/or video capture device, a touch-screen display, and/or another type of input device. In some embodiments, device 300 may be managed remotely and may not include input device 340. In other words, device 300 may be “headless” and may not include a keyboard, for example. Output device 350 may output information to an operator of device 300. Output device 350 may include a display, a printer, a speaker, and/or another type of output device. For example, device 300 may include a display, which may include a liquid-crystal display (LCD) for displaying content to the customer. In some embodiments, device 300 may be managed remotely and may not include output device 350. In other words, device 300 may be “headless” and may not include a display, for example. Communication interface 360 may include a transceiver that enables device 300 to communicate with other devices and/or systems via wireless communications (e.g., radio frequency, infrared, and/or visual optics, etc.), wired communications (e.g., conductive wire, twisted pair cable, coaxial cable, transmission line, fiber optic cable, and/or waveguide, etc.), or a combination of wireless and wired communications. Communication interface 360 may include a transmitter that converts baseband signals to radio frequency (RF) signals and/or a receiver that converts RF signals to baseband signals. Communication interface 360 may be coupled to an antenna for transmitting and receiving RF signals. Communication interface 360 may include a logical component that includes input and/or output ports, input and/or output systems, and/or other input and output components that facilitate the transmission of data to other devices. For example, communication interface 360 may include a network interface card (e.g., Ethernet card) for wired communications and/or a wireless network interface (e.g., a WiFi) card for wireless communications. Communication interface 360 may also include a universal serial bus (USB) port for communications over a cable, a Bluetooth™ wireless interface, a radio-frequency identification (RFID) interface, a near-field communications (NFC) wireless interface, and/or any other type of interface that converts data from one form to another form. As will be described in detail below, device 300 may perform certain operations relating to the determination of signal strength for a 5G wireless signal. Device 300 may perform these operations in response to processor 320 executing software instructions contained in a computer-readable medium, such as memory 330. A computer-readable medium may be defined as a non-transitory memory device. A memory device may be implemented within a single physical memory device or spread across multiple physical memory devices. The software instructions may be read into memory 330 from another computer-readable medium or from another device. The software instructions contained in memory 330 may cause processor 320 to perform processes described herein. Alternatively, hardwired circuitry may be used in place of, or in combination with, software instructions to implement processes described herein. Thus, implementations described herein are not limited to any specific combination of hardware circuitry and software. Although FIG. 3 shows exemplary components of device 300, in other implementations, device 300 may include fewer components, different components, additional components, or differently arranged components than depicted in FIG. 3. Additionally, or alternatively, one or more components of device 300 may perform one or more tasks described as being performed by one or more other components of device 300. FIG. 4 is a diagram illustrating exemplary functional components of eNodeB 210 and gNodeB 220. The functional components of eNodeB 210 and gNodeB 220 may be implemented, for example, via processor 320 executing instructions from memory 330. Alternatively, some or all of the functional components included in eNodeB 210 and/or gNodeB 220 may be implemented via hard-wired circuitry. As shown in FIG. 4, eNodeB 210 may include an LTE packet data convergence protocol (PDCP) manager 410, an LTE Radio Link Control (RLC) manager 416, and an LTE media access control (MAC) 418 layer, and gNodeB 220 may include a 5G NR PDCP manager 420, a 5G NR RLC manager 426, and a 5G NR MAC 428 layer. LTE PDCP manager 410 may manage data traffic for data packets to and from FWA device 120 via eNodeB 210. LTE RLC manager 416 may manage Layer 2 processes associated with the 4G LTE air interface, such as sending acknowledgement messages, error correction through automatic repeat requests (ARQs), error detection and recovery, packet re-ordering and re-assembly, and/or other RLC processes. LTE MAC 418 may manage MAC processes associated with eNodeB 210. 5G NR PDCP manager 420 may manage data traffic for data packets to and from FWA device 120 via gNodeB 220. 5G NR PDCP manager 420 may determine whether to send or receive packets via a 5G NR air interface, via a 4G LTE air interface, or via both the 5G NR air interface and the 4G LTE air interface. If 5G NR PDCP manager 420 decides to use a 5G NR air interface, 5G NR PDCP manager 420 may send F1 interface data 422 to 5G NR RLC manager 426 and may receive F1 interface downlink data delivery status (DDDS) information 424 from 5G NR RLC manager 426, and/or may receive uplink data via the F1 interface. If 5G NR PDCP manager 420 decides to use a 4G LTE air interface, 5G NR PDCP manager 420 may send X2 interface data 430 to 4G LTE RLC manager 416 and may receive X2 interface DDDS information 440 from LTE RLC manager 416, and/or may receive uplink data via the X2 interface. 5G NR RLC manager 426 may manage Layer 2 associated with the 5G NR air interface, such as sending acknowledgement messages, error correction through ARQs, error detection and recovery, and/or other RLC processes. 5G NR MAC 428 may manage MAC processes associated with eNodeB 210. Although FIG. 4 shows exemplary components of eNodeB 210 and gNodeB 220, in other implementations, eNodeB 210 and/or gNodeB 220 may include fewer components, different components, additional components, or differently arranged components than depicted in FIG. 4. Additionally, or alternatively, one or more components of eNodeB 210 and/or gNodeB 220 may perform one or more tasks described as being performed by one or more other components of eNodeB 210 and/or gNodeB 220. FIG. 5 is a diagram illustrating exemplary functional components of FWA device 120. The functional components of FWA device 120 may be implemented, for example, via processor 320 executing instructions from memory 330. Alternatively, some or all of the functional components included in FWA device 120 may be implemented via hard-wired circuitry. As shown in FIG. 5, FWA device 120 may include a 5G signal strength monitor 510, a 5G signal strength database (DB) 520, a 5G signal strength user interface 530, and a SIM manager 540. 5G signal strength monitor 510 may monitor the signal strength of a 5G wireless signal associated with a provider that is also associated with FWA device 120. For example, in response to a scan mode being activated by a user, 5G signal strength monitor 510 may identify 5G wireless signals associated with a provider that is also associated with FWA device 120. In some implementations, 5G signal strength monitor 510 may retrieve a 5G operator ID from 5G signal strength DB 520. In other implementations, 5G signal strength monitor 510 may obtain information relating to one or more parameters of a 5G synchronization signal, which may enable 5G signal strength monitor 510 to locate and identify the 5G synchronization signal when scanning for 5G signals. In yet other implementations, 5G signal strength monitor 510 may cause eNodeB 210 to add gNodeB 220 as a secondary node base station for FWA device 120; and scan for 5G wireless signals associated with gNodeB 220. In some implementations, 5G signal strength monitor 510 may cause eNodeB 210 to add gNodeB 220 as a secondary node by causing wireless access network 140 to detect FWA device 120 as a FWA device type. As an example, 5G signal strength monitor 510 may transmit an FWA ID in an attach request to eNodeB 210. As another example, 5G signal strength monitor 510 may send a different type of ID, such as a SPID, an IMEI, an IMSI, and/or another type of ID, to cause wireless access network 140 to detect a FWA device type based on information stored in a subscriber profile associated with FWA device 120. As yet another example, 5G signal strength monitor 510 may request a particular APN, ARP, QCI, and/or another type of connection to cause wireless access network 140 to detect a FWA device type. As yet another example, FWA device 120 may inform wireless access network 140 of its FWA device type status during a UE capability transfer procedure. In response, 5G signal strength monitor 510 may receive, from eNodeB 210, a reconfiguration message, which indicates that gNodeB 220 has been added as the secondary node, and which includes information to enable 5G signal strength monitor 510 to identify 5G signals from gNodeB 220, such as information identifying a synchronization signal associated with gNodeB 220. In other implementations, 5G signal strength monitor 510 may cause eNodeB 210 to add gNodeB 220 as a secondary node by requesting a high data rate traffic connection via a bearer established with eNodeB 210. 5G signal strength monitor 510 may receive, from eNodeB 210, a reconfiguration message, which indicates that gNodeB 220 has been added as the secondary node, and which includes information to enable 5G signal strength monitor 510 to identify 5G signals from gNodeB 220, such as information identifying a synchronization signal associated with gNodeB 220. 5G signal strength DB 520 may store an operator ID associated with gNodeB. Furthermore, 5G signal strength DB 520 may store records of signal strengths determined for 5G wireless signals at particular times. In some implementations, 5G signal strength DB 520 may store indications of 5G signal strength over a time period and/or for different locations at which FWA device 120 is installed. The location of FWA device 120 may be determined by, for example, a GPS technique, a base station multilateration technique, a WiFi positioning system technique, and/or another technique. 5G signal strength user interface 530 may display or generate data indicating determined 5G signal strengths. Additionally, or alternatively, 5G signal strength user interface 530 may be configured to interface with another device, such as a smart phone configured to communicate with FWA device 120. The smart phone may include an FWA device application (e.g., downloaded from FWA device system 190) that displays the data indicating 5G signal strengths or the data indicating how the 5G signal strength has varied over a time period and/or at different locations where FWA device 120 has been placed or installed. Furthermore, the user may activate the 5G scanning mode via 5G signal strength user interface 530 (e.g., using a button included on FWA device 120 and/or using the FWA device application running on another device). Moreover, in some implementations, 5G signal strength user interface 530 may be configured to obtain information relating to the parameters of a 5G synchronization signal from the FWA device application, which the FWA device application obtained from FWA device system 190. SIM manager 540 may manage a SIM card associated with FWA device 120. For example, SIM manager 540 may receive updates for the SIM card from SIM OTA system 180. A SIM update may include information relating to the parameters of a 5G synchronization signal, and/or other types of information relating to gNodeB 220, and SIM manager 540 may be configured to detect the information in a SIM update and may, in response, provide the detected information to 5G signal strength monitor 510. For example, SIM OTA system 180 may set a flag in the SIM update to indicate that the SIM update includes information relating to gNodeB 220. Although FIG. 5 shows exemplary components of FWA device 120, in other implementations, FWA device 120 may include fewer components, different components, additional components, or differently arranged components than depicted in FIG. 5. Additionally, or alternatively, one or more components of FWA device 120 may perform one or more tasks described as being performed by one or more other components of FWA device 120. FIG. 6 is a flowchart 600 of a process for obtaining the signal strength associated with a 5G wireless signal according to an implementation described herein. In some implementations, the process of FIG. 6 may be performed by FWA device 120. In other implementations, some or all of the process of FIG. 6 may be performed by another device or a group of devices separate from FWA device 120. The process of flowchart 600 may include activating a 5G scanning mode (block 610). As an example, a user may activate a 5G scanning mode by pressing a button, switch, and/or another activation device included on the housing of FWA device 120. As another example, the user may activate a 5G scanning mode using an FWA device application installed on a smart phone, or another client device 134, in communication with FWA device 120. A scan may be performed for a 5G wireless signal associated with the provider (block 620). In some implementations, 5G signal strength monitor 510 may retrieve a 5G operator ID from 5G base stations DB 520 and may scan for 5G wireless signals that include the retrieved 5G operator ID. For example, the 5G operator ID may include a Tracking Area Identifier (TAI). The TAI may include a PLMN ID and a Tracking Area Code (TAC). A PLMN ID may include a Mobile Country Code (MCC) and a Mobile Network Code (MNC). A tracking area code may identify a particular tracking area. In other implementations, as described below with reference to FIGS. 7A and 7B, 5G signal strength monitor 510 may cause eNodeB 210 to add gNodeB 220 as a secondary node base station for FWA device 120 and scan for 5G wireless signals associated with gNodeB 220, or to cause eNodeB 210 to request an event B1 measurement without having to add gNodeB 220 as the secondary node base station. In yet other implementations, FWA device 120 may obtain information relating to the parameters of a 5G synchronization signal, such as a 5G NR SSB, that is being broadcast by gNodeB 220. The parameters may include, for example, the frequency range at which the 5G synchronization signal is being broadcast, such as a carrier frequency, a 5G band and/or channel, etc. Furthermore, the parameters may include information relating to the timing and/or spacing of the 5G NR SSB, such as a timing configuration and/or a subcarrier spacing (SCS) of the 5G NR SSB. The frequency information may enable FWA device 120 to identify at what frequencies to scan for the 5G signal, rather than having to scan across a potentially large frequency range. Furthermore, the timing and/or spacing information may enable FWA device 120 to identify the 5G NR SSB. Thus, providing the 5G NR SSB information to FWA device 120 may conserve the resource of FWA device 120 and significantly speed up the scanning process. In some implementations, the information relating to the parameters of the 5G synchronization signal may be stored on FWA device 120 or on the SIM included with FWA device 120 before FWA device 120 is provided to the customer. In other implementations, the information relating to the parameters of the 5G synchronization signal may be obtained from FWA device system 190 via SIM OTA system 180 during a SIM update. In yet other implementations, the information relating to the parameters of the 5G synchronization signal may be obtained from FWA device system 190 by an FWA device application running on client device 134 and provided to FWA device 120. A 5G signal associated with a provider may be detected (block 630) and the strength of the 5G signal may be determined (block 640). As an example, 5G signal strength monitor 510 may identify a 5G SSB associated with the provider and may determine the signal strength based on the identified 5G SSB. The signal strength may be based on, for example, by a channel quality indicator (CQI) value, signal to noise ratio (SNR) value, a signal-to-interference-plus-noise ratio (SINR) value, a block error rate (BLER) value, a Received Signal Strength Indication (RSSI) value, a Reference Signal Received Quality (RSRQ) value, a Reference Signal Received Power (RSRP) value, and/or other types of radio signal strength or quality parameters. The strength of the 5G signal may be displayed (block 650). As an example, 5G signal strength user interface 530 may generate an indication of determined 5G signal strength to be displayed on a display of FWA device 120. As another example, 5G signal strength user interface 530 may generate the indication of determined 5G signal strength and send the indication to another device in CPE network 110 to be displayed to the user. The 5G signal strength may be tracked (block 660). As an example, 5G signal strength monitor 510 may record the signal strengths for the detected 5G wireless signal over a time period and generate data indicating the signal strengths for the detected 5G wireless signal varies over the time period. The data a may be displayed on the user interface. As another example, 5G signal strength monitor 510 may record the signal strengths for the detected 5G wireless signal at different locations for FWA device 120 and generate data indicating how the signal strengths for the detected 5G wireless signal vary over the different locations. The data may be displayed via the user interface. FIG. 7A is a flowchart 701 of a first process for scanning for a 5G wireless signal according to implementations described herein. In some implementations, the process of FIG. 7A may be performed by FWA device 120. In other implementations, some or all of the process of FIG. 7A may be performed by another device or a group of devices separate from FWA device 120. The process of flowchart 701 may include sending an attach request with an included FWA ID to a 4G LTE base station (block 710). For example, FWA device 120 may send an attach request to eNodeB 210. The attach request may include an FWA ID that identifies the attach request as being associated with a 5G scan mode of FWA device 120. A configuration may be received from the 4G LTE base station for a 5G NR base station secondary node (block 720) and scanning for signal strength of the 5G NR base station may be performed (block 730). After eNodeB 210 has established gNodeB 220 as a secondary node, eNodeB 210 my send a reconfiguration message to FWA device 120. The reconfiguration message may inform FWA device 120 that gNodeB 220 has been added as a secondary node and that FWA device 120 may now communicate with gNodeB 220 via 5G wireless signals. The reconfiguration message may include one or more parameters of a 5G synchronization signal, such as a carrier frequency, subcarrier spacing, timing configuration, and/or other types of parameters, which enables FWA device 120 to identify, and determine the strength of, the 5G synchronization signal. In some implementations, eNodeB 210 may not add gNodeB 220 as a secondary node to the attachment of FWA device 120. Rather, in response to receiving an attach request with the FWA ID, and completing the attach procedure, eNodeB 210 may send a reconfiguration message to FWA device 120 that includes an instruction to perform a B1 event measurement. Furthermore, in some implementation, eNodeB 210 may request a B1 event measurement for all UE devices that attach to eNodeB 210. A B1 event corresponds to an inter RAT neighbor becoming better than a threshold and the B1 event measurement of 5G signal strength is used to determine whether the 5G signal strength is high enough to trigger a measurement report. The measurement object in the reconfiguration message may specify the one or more parameters of the 5G synchronization signal. Thus, the B1 event measurement may enable FWA device 120 to determine the strength of the 5G signals from gNodeB 220 without eNodeB 210 having to add gNodeB 220 as a secondary node, which may conserve the resources of wireless access network 140. FIG. 7B is a flowchart 702 of a second process for scanning for a 5G wireless signal according to implementations described herein. In some implementations, the process of FIG. 7B may be performed by FWA device 120. In other implementations, some or all of the process of FIG. 7B may be performed by another device or a group of devices separate from FWA device 120. The process of flowchart 702 may include requesting high data rate traffic to trigger a 5G NR air interface (block 715). For example, FWA device 120 may perform an attach process to attach to eNodeB 210. After the attach process has been completed, FWA device 120 may request high data rate traffic using a bearer established between FWA device 120 and PGW 240 to packet data network 170, such as, for example, a video file stream from a particular server device. eNodeB 210 may detect a large data throughput for the bearer associated with FWA device 120 as a result of the streaming video file and may, in response, trigger the addition of a 5G secondary node to the attachment associated with FWA device 120. A configuration may be received from the 4G LTE base station for a 5G NR base station secondary node (block 725) and scanning for signal strength of the 5G NR base station may be performed (block 735). After eNodeB 210 has established gNodeB 220 as a secondary node, eNodeB 210 my send a reconfiguration message to FWA device 120. The reconfiguration message may inform FWA device 120 that gNodeB 220 has been added as a secondary node and that FWA device 120 may now communicate with gNodeB 220 via 5G wireless signals. The reconfiguration message may include one or more parameters of a 5G synchronization signal, such as a carrier frequency, subcarrier spacing, timing configuration, and/or other types of parameters, which enables FWA device 120 to identify, and determine the strength of, the 5G synchronization signal. FIG. 8 is a flowchart 800 of a process for enabling FWA device 120 to scan for a 5G wireless signal according to implementations described herein. In some implementations, the process of FIG. 8 may be performed by eNodeB 210. In other implementations, some or all of the process of FIG. 8 may be performed by another device or a group of devices in wireless access network 140, such as, for example, MME 250 and/or HSS 270. The process of flowchart 800 may include receiving an attach request from FWA device 120 (block 810), detecting an FWA device type based on the received attach request (block 820), configuring a 5G NR base station as a secondary node (block 830), and providing information identifying the 5G NR base station to FWA device 120 (block 840). As an example, eNodeB 210 may receive an attach request from FWA device 120, may detect an FWA ID in the received attach request, may send a secondary node add request to gNodeB 220 to add gNodeB 220 for the attachment associated with FWA device 120. eNodeB 210 may send a reconfiguration request that includes information identifying gNodeB 210 to FWA device 120. An example of such information includes information identifying one or more parameters of a 5G synchronization signal being broadcast by gNodeB 220. As another example, eNodeB 210 may receive an attach request from FWA device 120 and may forward the attach request to MME 250. MME 250 may detect an FWA ID in the received attach request, and may, in response, send an instruction to eNodeB 210 to add gNodeB 220 as a secondary node for FWA device 210. In response, eNodeB 210 may send a secondary node add request to gNodeB 220 to add gNodeB 220 to the attachment associated with FWA device 120, and may send a reconfiguration request to FWA device 120 that includes information identifying one or more parameters of a 5G synchronization signal being broadcast by gNodeB 220. As yet another example, eNodeB 210 may receive an attach request from FWA device 120 and may forward the attach request to MME 250. MME 250 may send an authentication request to HSS 270 and may include the FWA ID in the authentication request. HSS 270 may detect the FWA ID and may verify in a subscription record associated with FWA device 120 that FWA device 120 is a fixed wireless access device. In response, HSS 270 may generate an authentication answer that includes an FWA priority indication. The FWA priority indication may instruct eNodeB 210 to activate option 3X for FWA device 120. MME 250 may forward the FWA priority indication in an attach accept message to eNodeB 210 after authenticating FWA device 120. In response, eNodeB 210 may send a secondary node add request to gNodeB 220 to add gNodeB 220 to the attachment associated with FWA device 120, and may send a reconfiguration request to FWA device 120 that includes information identifying gNodeB 210, such as information identifying one or more parameters of a 5G synchronization signal being broadcast by gNodeB 220. As explained above, in some implementations, rather than adding gNodeB 220 as a secondary node, eNodeB 210 may request that FWA device 120 perform B1 event measurement for 5G signals associated with gNodeB 220. To that end, eNodeB 210 may send a reconfiguration message to FWA device 120 with a measurement object. The measurement object may specify the parameters of the 5G synchronization signal being broadcast by gNodeB 220, enabling FWA device 120 to locate and identify the 5G synchronization signal. Furthermore, as explained above, in other implementations, eNodeB 210, MME 250, HSS 270, and/or another component of wireless access network 140, may detect a FWA device type for FWA device 120 without FWA device 120 sending an FWA ID in an attach request. As an example, HSS 270 may detect an FWA device type based on an ID associated with FWA device 120, such as a SPID, an IMEI, an IMSI, and/or another type of device ID or subscription type. HSS 270 may identify a subscriber profile associated with FWA device 120 and may detect an indication in the subscriber profile that FWA device 120 is associated with an FWA device type. As another example, MME 250 may detect an FWA device type based on a type of connection request, such as a request for a particular APN, ARP bearer, QCI bearer, and/or another type of connection and may determine that the particular connection request is only made by FWA devices. As yet another example, FWA device 120 may inform wireless access network 140 of its FWA device type status during a UE capability transfer procedure. FIG. 9 illustrates a first exemplary signal flow 900 for obtaining the signal strength associated with a 5G wireless signal according to an implementation described herein. Signal flow 900 illustrates an implementation in which gNodeB 220 is configured to broadcast a SIB that includes a 5G operator ID. Signal flow 900 may include a user activating a 5G signal scan mode via user interface (UI) 530 (signal 910). As an example, the user may press a scan button located on the housing of FWA device 120. As another example, the client may use an application, installed on a smart phone coupled to FWA device 120 as one of client devices 134-A to 134-N, to activate the 5G signal scan mode. gNodeB 220 may broadcast wireless signals, at particular intervals, which include a SIB that includes one or more 5G operator IDs (signal 920). In response to the activation of the 5G scan mode, communication interface (CI) 360 may retrieve one or more 5G operator IDs from 5G base stations DB 520 and may scan (block 930) for a SIB that includes the retrieved 5G one or more 5G operator IDs being broadcast by gNodeB 220. FWA device 120 may detect the 5G wireless signals, determine the signal strength of the detected 5G wireless signals, and display an indication of the determined signal strength of the 5G wireless signals to the user via user interface 530 (signal 940). FIG. 10 illustrates a second exemplary signal flow 1000 for obtaining the signal strength associated with a 5G wireless signal according to an implementation described herein. Signal flow 1000 illustrates an implementation in which FWA device 120 obtains information relating to the parameters of a 5G synchronization signal, enabling FWA device 120 to locate and identify the 5G synchronization signal in order to determine the signal strength of the 5G synchronization signal. Signal flow 1000 may include a user activating a 5G signal scan mode via user interface 530 (signal 1010). As an example, the user may press a scan button located on the housing of FWA device 120. As another example, the client may use an application, installed on a smart phone coupled to FWA device 120 as one of client devices 134-A to 134-N, to activate the 5G signal scan mode. In response, communication interface 360 of FWA device 120 may initiate an attachment procedure to attach to eNodeB 210 (signal 1020). After the attachment procedure is completed, FWA device 120 may use the attached connection to eNodeB 210 to request a SIM update from SIM OTA 180 (signals 1030 and 1034). The SIM request may include an indication 1032 that includes an FWA ID that identifies the SIM request as originating from FWA device 120 and information identifying the location of FWA device 120. SIM OTA 180 may receive the SIM request and may detect FWA ID included in the SIM request. In response, SIM OTA 180 may request SSB information from FWA device system 190 based on the location of FWA device 120 (signal 1040) and FWA device system 190 may provide the requested SSB information (signal 1042). The SSB information may include parameters for the SSB broadcast by gNodeB 220, such as, for example, a carrier frequency, subcarrier spacing, timing configuration, and/or other types of parameters, that enable FWA device 120 to locate and identify the 5G NR SSB broadcast by gNodeB 220. SIM OTA system 180 may generate the requested SIM update, include the obtained 5G SSB information 1046 in the SIM update, and send the SIM update to FWA device 120 via eNodeB 210 (signals 1044 and 1048). FWA device 120 may use the obtained 5G SSB information to locate and identify the SSB being broadcast by gNodeB 220 (signal 1050 and block 1060). Thus, FWA device 120 may detect the 5G wireless signals, determine the strength of the detected 5G wireless signals, and display an indication of the determined signal strength of the 5G wireless signals to the user via user interface 530 (signal 1070). While signal flow 1000 illustrates an implementation in which the 5G SSB information is obtained during a SIM update, in other implementations, the 5G SBB information may be obtained by FWA device 120 using a different technique. As an example, the 5G SSB information may be stored on the SIM, or a storage device or memory included in FWA device 120, before FWA device 120 is provided to the customer. As another example, the customer may download and install an FWA device application from FWA device system 190 onto a particular client device 134 that is connected to FWA device 120 (e.g., via a WiFi connection). The FWA device application may obtain the 5G SSB information from FWA device system 190 and provide the 5G SSB information to FWA device 120. FIG. 11 illustrates a third exemplary signal flow 1100 for obtaining the signal strength associated with a 5G wireless signal according to an implementation described herein. Signal flow 1100 illustrates an implementation in which FWA device 120 triggers the addition of a secondary node gNodeB 220 to an attachment to eNodeB 210 via an FWA ID sent in an attach request. Signal flow 1100 may include a user activating a 5G signal scan mode via user interface 530 (signal 1110). As an example, the user may press a scan button located on the housing of FWA device 120. As another example, the client may use an application, installed on a smart phone coupled to FWA device 120 as one of client devices 134-A to 134-N, to activate the 5G signal scan mode. In response, communication interface 360 of FWA device 120 may initiate an attachment procedure to attach to eNodeB 210 by sending a Radio Resource Control (RRC) request to eNodeB 210 (signal 1120) and eNodeB 210 may respond with an RRC setup message (signal 1122) to establish a 4G LTE air interface link with FWA device 120. FWA device 120 may then send an attach request to eNodeB 210 (signal 1130). The attach request may include an FWA ID 1132 that identifies the attach request as being associated with a FWA device type. eNodeB 210 may forward the attach request, with FWA ID 1132, to MME 250 (signal 1134). MME 250 may send an Authentication Information Request (AIR) to HSS 270 (signal 1136). The AIR may include FWA ID 1132. HSS 270 may identify a subscriber profile associated with FWA device 120 based on information included in the AIR. HSS 270 may respond with an Authentication Information Answer (AIA) that includes authentication information for FWA device 120 (signal 1140). Furthermore, HSS 270 may detect that the AIR includes FWA ID 1132 and may, in response, include an FWA priority indication 1142 in the AIA. FWA priority indication 1142 may instruct eNodeB 210 to activate option 3X for FWA device 120. MME 250 may receive the AIA and perform authentication with FWA device 120 (signals 1144 and 1146). Furthermore, MME 250 may send a create session request to SGW 230 and/or PGW 240 (signal 1150) and SGW 230 and/or PGW 240 may respond with create session answer (signal 1152). MME 250 may, after receiving the create session answer, send an attach accept message back to eNodeB 210 (signal 1154). The attach accept message may include FWA priority indication 1142. In response to receiving FWA priority indication 1142, eNodeB 210 may activate gNodeB 220 as a secondary node by sending a secondary gNodeB (sgNB) add request to gNodeB 220 (signal 1160). gNodeB 220 may respond by sending a request acknowledgement (ACK) message back to eNodeB 210 (signal 1162). eNodeB 210 may then send an RRC reconfiguration message to FWA device 120 (signal 1170). The RRC reconfiguration message may inform FWA device 120 that gNodeB 220 has been added as a secondary node and that FWA device 120 may now communicate with gNodeB 220 via 5G wireless signals. The RRC reconfiguration message may include 5G SSB information 1172, such as, for example, a carrier frequency, subcarrier spacing, timing configuration, and/or other types of parameters, that enable FWA device 120 to locate and identify the 5G NR SSB broadcast by gNodeB 220. 5G SSB information may be obtained by eNodeB 210 from gNodeB 220 in the request ACK message. Additionally, or alternatively, eNodeB 210 may maintain a DB of 5G SSB information for gNodeB 220. FWA device 120 may respond back to eNodeB 210 with an RRC reconfiguration complete message (signal 1174). eNodeB may then inform gNodeB 220 that the RRC reconfiguration is compete by sending an sgNB reconfiguration complete message to gNodeB 220 (signal 1176). FWA device 120 may use the obtained 5G SSB information to locate and identify the SSB being broadcast by gNodeB 220 (signal 1180). Thus, FWA device 120 may detect the 5G wireless signals, determine the strength of the detected 5G wireless signals, and display an indication of the determined signal strength of the 5G wireless signals to the user via user interface 530 (signal 1182). FIG. 12 illustrates a fourth exemplary signal flow 1200 for obtaining the signal strength associated with a 5G wireless signal according to an implementation described herein. Signal flow 1200 illustrates an implementation in which FWA device 120 sends an attach request to eNodeB 210 with an FWA ID, which causes eNodeB 210 to request a B1 event measurement to be performed by FWA device 120. Signal flow 1200 may include a user activating a 5G signal scan mode via user interface 530 (signal 1210). As an example, the user may press a scan button located on the housing of FWA device 120. As another example, the client may use an application, installed on a smart phone coupled to FWA device 120 as one of client devices 134-A to 134-N, to activate the 5G signal scan mode. In response, communication interface 360 of FWA device 120 may initiate an attachment procedure to attach to eNodeB 210 by sending an RRC request to eNodeB 210 (signal 1220) and eNodeB 210 may respond with an RRC setup message (signal 1222) to establish a 4G LTE air interface link with FWA device 120. FWA device 120 may then send an attach request to eNodeB 210 (signal 1230). The attach request may include an FWA ID 1232 that identifies the attach request as being associated with a FWA device type. eNodeB 210 may forward the attach request, with FWA ID 1232, to MME 250 (signal 1234). MME 250 may send an Authentication Information Request (AIR) to HSS 270 (signal 1236). The AIR may include FWA ID 1232. HSS 270 may identify a subscriber profile associated with FWA device 120 based on information included in the AIR. HSS 270 may respond with an Authentication Information Answer (AIA) that includes authentication information for FWA device 120 (signal 1240). Furthermore, HSS 270 may detect that the AIR includes FWA ID 1232 and may, in response, include an FWA priority indication 1242 in the AIA. FWA priority indication 1242 may instruct eNodeB 210 to activate option 3X for FWA device 120. MME 250 may receive the AIA and perform authentication with FWA device 120 (signals 1244 and 1246). Furthermore, MME 250 may send a create session request to SGW 230 and/or PGW 240 (signal 1250) and SGW 230 and/or PGW 240 may respond with create session answer (signal 1252). MME 250 may, after receiving the create session answer, send an attach accept message back to eNodeB 210 (signal 1254). The attach accept message may include FWA priority indication 1242. In response to receiving FWA priority indication 1242, eNodeB 210 may select to instruct FWA device 120 to perform a B1 event measurement. eNodeB 210 may send an RRC reconfiguration message to FWA device 120 (signal 1270) that includes a measurement object 1272 for the B1 event measurement. The measurement object in the reconfiguration message may specify 5G SSB information, such as, for example, a carrier frequency, subcarrier spacing, timing configuration, and/or other types of parameters, that enable FWA device 120 to locate and identify the 5G NR SSB broadcast by gNodeB 220. 5G SSB information may be obtained by eNodeB 210 from gNodeB 220 in the request ACK message. Additionally, or alternatively, eNodeB 210 may maintain a DB of 5G SSB information for gNodeB 220. FWA device 120 may respond back to eNodeB 210 with an RRC reconfiguration complete message (signal 1274). FWA device 120 may use the obtained 5G SSB information to locate and identify the SSB being broadcast by gNodeB 220 (signal 1280). Thus, FWA device 120 may detect the 5G wireless signals, determine the strength of the detected 5G wireless signals, and display an indication of the determined signal strength of the 5G wireless signals to the user via user interface 530 (signal 1282). FIG. 13 illustrates a third exemplary signal flow 1300 for obtaining the signal strength associated with a 5G wireless signal according to an implementation described herein. Signal flow 1300 illustrates an implementation in which FWA device 120 triggers the addition of a secondary node gNodeB 220 to an attachment to eNodeB 210 by requesting a high data rate connection. Signal flow 1300 may include a user activating a 5G signal scan mode via user interface 530 (signal 1310). As an example, the user may press a scan button located on the housing of FWA device 120. As another example, the client may use an application, installed on a smart phone coupled to FWA device 120 as one of client devices 134-A to 134-N, to activate the 5G signal scan mode. In response, communication interface 360 of FWA device 120 may initiate an attachment procedure to attach to eNodeB 210 by sending an RRC request to eNodeB 210 (signal 1320) and eNodeB 210 may respond with an RRC setup message (signal 1322) to establish a 4G LTE air interface link with FWA device 120. FWA device 120 may then send an attach request to eNodeB 210 (signal 1330). eNodeB 210 may forward the attach request, with FWA ID 1032, to MME 250 (signal 1334). MME 250 may send an AIR to HSS 270 (signal 1336). HSS 270 may identify a subscriber profile associated with FWA device 120 based on information included in the AIR. HSS 270 may respond with an AIA that includes authentication information for FWA device 120 (signal 1340). MME 250 may receive the AIA and perform authentication with FWA device 120 (signals 1344 and 1346). Furthermore, MME 250 may send a create session request to SGW 230 and/or PGW 240 (signal 1350) and SGW 230 and/or PGW 240 may respond with create session answer (signal 1352). MME 250 may, after receiving the create session answer, send an attach accept message back to eNodeB 210 (signal 1354). After the attach process has been completed, FWA device 120 may request high data rate traffic using a bearer established between FWA device 120 and PGW 240 to packet data network 170 (signal flows 1360 and 1362). For example, FWA device 120 may request to perform a speed test by requesting a particular file used for testing download speeds, request to stream a video file from a particular server device, etc. eNodeB 210 may detect a large data throughput for the bearer associated with FWA device 120 as a result of the streaming video file and may, in response, trigger the addition of a 5G secondary node to the attachment associated with FWA device 120 (block 1064). eNodeB 120 may send a secondary gNodeB add request to gNodeB 220 (signal 1370). gNodeB 220 may respond by sending a request acknowledgement (ACK) message back to eNodeB 210 (signal 1372). eNodeB 210 may then send an RRC reconfiguration message to FWA device 120 (signal 1380). The RRC reconfiguration message may inform FWA device 120 that gNodeB 220 has been added as a secondary node and that FWA device 120 may now communicate with gNodeB 220 via 5G wireless signals. The RRC reconfiguration message may include 5G SSB information 1382, such as, for example, a carrier frequency, subcarrier spacing, timing configuration, and/or other types of parameters, that enable FWA device 120 to locate and identify the 5G NR SSB broadcast by gNodeB 220. 5G SSB information may be obtained by eNodeB 210 from gNodeB 220 in the request ACK message. Additionally, or alternatively, eNodeB 210 may maintain a DB of 5G SSB information for gNodeB 220. FWA device 120 may respond back to eNodeB 210 with an RRC reconfiguration complete message (signal 1384). eNodeB may then inform gNodeB 220 that the RRC reconfiguration is complete by sending an sgNB reconfiguration complete message to gNodeB 220 (signal 1386). FWA device 120 may use the obtained 5G SSB information to locate and identify the SSB being broadcast by gNodeB 220 (signal 1390). Thus, FWA device 120 may detect the 5G wireless signals, determine the strength of the detected 5G wireless signals, and display an indication of the determined signal strength of the 5G wireless signals to the user via user interface 530 (signal 1392). FIG. 14A is a diagram of a first exemplary user interface 1401 according to an implementation described herein. User interface 1401 may include a display 1410 that includes a set of LEDs, and/or another type of indicator, located on the housing of FWA device 120 and a scan activator 1415, such as a hardware button, switch, and/or another type of activation object to initiate a scan for 5G wireless signals. Display 1410 may indicate the strength of a detected 5G wireless signal by the number of LEDs that are lit when a 5G scanning mode is detected in response to the user pressing scan activator 1415. Based on the 5G wireless signal strength indicated by display 1410, a user may identify an appropriate location where to install FWA device 120 so that FWA device 120 experiences high 5G signal strength. FIG. 14B is a diagram of a second exemplary user interface 1402 according to an implementation described herein. User interface 1402 may be generated by an FWA device application installed on a user's smart phone configured as one of client devices 134-A to 134-N of FWA device 120 and/or CPE controller 130. User interface 1402 may include a scan activator 1425, such as a button and/or another selection object displayed on the touchscreen of the smart phone. Furthermore, user interface 1402 may keep track of locations where the user has placed FWA device 120 and scanned for 5G wireless signals. For example, the FWA device application may generate a map of the user's customer premises. In some implementations, the FWA device application may be configured to enable the user to sketch or otherwise generate a layout of the customer premises. In other implementations, the user may download or select a layout of the customer premises from a database of layouts. In some implementations, the user may manually indicate a position of FWA device 120 on the layout of the customer premises each time the user moves FWA device 120 to a new location and selects to perform a scan for 5G wireless signals. In other implementations, the FWA device application may detect a location of FWA device 120, and/or client device 134 on which the FWA device application is running using one or more techniques, such as a GPS technique, a base station multilateration technique, a WiFi positioning system technique, and/or another technique. User interface 1402 may include a position indicator icon 1430 for each location at which FWA device 120 scanned for 5G wireless signals. For example, user interface 1402 shows a first position indicator icon 1430-A, a second position indicator icon 1430-B, and a third position indicator icon 1430-C. The 5G signal strength experienced by FWA device 120 at each location may be indicated by the darkness of shading for each position indicator icon 1430, and/or using another type of attribute, such as a size of the icon, a number or tooltip displayed in connection with the icon, etc. The current location of FWA device 120 may also be indicated, such as, for example, by a stronger border around the icon (e.g., third position indicator icon 1430-C in FIG. 14B) and/or by using another type of attribute. Moreover, user interface 1402 may keep track of the 5G signal strength over time at particular locations. For example, as shown in FIG. 14B, user interface 1402 may include a time tracking indicator 1440, associated with the current location of FWA 120, that displays the strength of 5G wireless signals over a time period, such as over the last 24-hour period, averaged over multiple 24-hour periods, and/or over another type of time period. Keeping track of the signal strength of 5G wireless signals over a time period may enable the user to determine whether a particular location experiences stable signal strength over time. In the preceding specification, various preferred embodiments have been described with reference to the accompanying drawings. It will, however, be evident that various modifications and changes may be made thereto, and additional embodiments may be implemented, without departing from the broader scope of the invention as set forth in the claims that follow. The specification and drawings are accordingly to be regarded in an illustrative rather than restrictive sense. For example, while series of blocks have been described with respect to FIGS. 6, 7A, 7B, and 8, and series of signal flows have been described with respect to FIGS. 9, 10, 11, 12, and 13, the order of the blocks and/or signal flows may be modified in other implementations. Further, non-dependent blocks may be performed in parallel. It will be apparent that systems and/or methods, as described above, may be implemented in many different forms of software, firmware, and hardware in the implementations illustrated in the figures. The actual software code or specialized control hardware used to implement these systems and methods is not limiting of the embodiments. Thus, the operation and behavior of the systems and methods were described without reference to the specific software code--it being understood that software and control hardware can be designed to implement the systems and methods based on the description herein. Further, certain portions, described above, may be implemented as a component that performs one or more functions. A component, as used herein, may include hardware, such as a processor, an ASIC, or a FPGA, or a combination of hardware and software (e.g., a processor executing software). It should be emphasized that the terms “comprises”/“comprising” when used in this specification are taken to specify the presence of stated features, integers, steps or components but does not preclude the presence or addition of one or more other features, integers, steps, components or groups thereof. The term “logic,” as used herein, may refer to a combination of one or more processors configured to execute instructions stored in one or more memory devices, may refer to hardwired circuitry, and/or may refer to a combination thereof. Furthermore, a logic may be included in a single device or may be distributed across multiple, and possibly remote, devices. For the purposes of describing and defining the present invention, it is additionally noted that the term “substantially” is utilized herein to represent the inherent degree of uncertainty that may be attributed to any quantitative comparison, value, measurement, or other representation. The term “substantially” is also utilized herein to represent the degree by which a quantitative representation may vary from a stated reference without resulting in a change in the basic function of the subject matter at issue. To the extent the aforementioned embodiments collect, store or employ personal information of individuals, it should be understood that such information shall be collected, stored, and used in accordance with all applicable laws concerning protection of personal information. Additionally, the collection, storage and use of such information may be subject to consent of the individual to such activity, for example, through well known “opt-in” or “opt-out” processes as may be appropriate for the situation and type of information. Storage and use of personal information may be in an appropriately secure manner reflective of the type of information, for example, through various encryption and anonymization techniques for particularly sensitive information. No element, act, or instruction used in the present application should be construed as critical or essential to the embodiments unless explicitly described as such. Also, as used herein, the article “a” is intended to include one or more items. Further, the phrase “based on” is intended to mean “based, at least in part, on” unless explicitly stated otherwise. The following acronyms are used in the Figures: FIG. 1 FWA device 120 Fixed Wireless Access device 120 CPE controller 130 Customer Premises Equipment controller 130 WiFi AP 132-A to 132-M WiFi Access Point 132-A to 132-M SIM OTA system 180 Subscriber Identity Module Over-The-Air system 180 FWA device system 190 Fixed Wireless Access device system 190 FIG. 2 FWA device 120 Fixed Wireless Access device 120 SGW 230 Serving Gateway 230 PGW 240 Packet Data Network Gateway 240 MME 250 Mobility Management Entity 250 PCRF 260 Policy and Charging Rules Function 260 HSS 270 Home Subscriber Server 270 What is claimed is: 1. A method comprising: attaching, by a fixed wireless access device, to a Fourth Generation (4G) Long Term Evolution (LTE) base station; causing, by the fixed wireless access device, the 4G LTE base station to add a Fifth Generation (5G) New Radio (NR) base station as a secondary base station for the fixed wireless access device; scanning, by the fixed wireless access device, for 5G wireless signals associated with the 5G NR base station; and generating, by the fixed wireless access device, an indication of signal strength for the 5G wireless signals associated with the 5G NR base station. 2. The method of claim 1, wherein causing the 4G LTE base station to add the 5G NR base station as the secondary base station for the fixed wireless access device includes: sending an attach request to the 4G LTE base station, wherein the attach request includes an identifier that identifies the fixed wireless access device as a fixed wireless access device type. 3. The method of claim 1, wherein scanning for the 5G wireless signals associated with the 5G NR base station includes: receiving, from the 4G LTE base station, a reconfiguration message, wherein the reconfiguration message includes information identifying one or more parameters for a 5G synchronization signal; and scanning for the 5G synchronization signal based on the identified one or more parameters. 4. The method of claim 3, wherein the one or more parameters for the 5G synchronization signal include at least one of a carrier frequency, a subcarrier spacing, or a timing configuration for the 5G synchronization signal. 5. The method of claim 1, wherein scanning for 5G wireless signals includes: determining a 5G operator identifier associated with a provider of wireless services; and scanning for 5G wireless signals associated with the determined 5G operator identifier. 6. The method of claim 1, wherein scanning for 5G wireless signals includes: obtaining information identifying a frequency at which a 5G synchronization signal is broadcast; and scanning for the 5G synchronization signal at the identified frequency. 7. The method of claim 1, wherein causing the 4G LTE base station to add the 5G NR base station as the secondary base station for the fixed wireless access device includes: requesting high data rate traffic via a connection with the 4G LTE base station, wherein the high data rate traffic causes the 4G LTE base station to add the 5G NR base station as the secondary base station for the fixed wireless access device. 8. The method of claim 1, wherein generating the indication of the signal strength for the 5G wireless signals further includes: displaying the indication of the determined signal strength on an output device included on the fixed wireless access device. 9. The method of claim 1, wherein generating the indication of the signal strength for the 5G wireless signals further includes: sending the indication, of the determined signal strength to a client device configured to communicate with the fixed wireless access device, to be displayed by the client device. 10. The method of claim 1, further comprising: tracking the signal strength for the 5G wireless signals over a time period; and generating an indication of how the signal strength for the 5G wireless signals varies over the time period, to be displayed on a user interface associated with the fixed wireless access device. 11. The method of claim 1, further comprising: tracking the signal strength for the 5G wireless signals at a plurality of locations for the fixed wireless access device; and generating an indication of how the signal strength for the 5G wireless signals varies over the plurality of locations, to be displayed in a user interface associated with the fixed wireless access device. 12. A fixed wireless access device comprising: a memory configured to store instructions; and a processor configured to execute the instructions to: attach to a Fourth Generation (4G) Long Term Evolution (LTE) base station; cause the 4G LTE base station to add a Fifth Generation (5G) New Radio (NR) base station as a secondary base station for the fixed wireless access device; scan for 5G wireless signals associated with the 5G NR base station; and generate an indication of signal strength for the 5G wireless signals associated with the 5G NR base station. 13. The fixed wireless access device of claim 12, wherein, when causing the 4G LTE base station to add the 5G NR base station as the secondary base station for the fixed wireless access device, the processor is further configured to: send an attach request to the 4G LTE base station, wherein the attach request includes an identifier that identifies the fixed wireless access device as a fixed wireless access device type. 14. The fixed wireless access device of claim 12, wherein, when scanning for the 5G wireless signals associated with the 5G NR base station, the processor is further configured to: receive, from the 4G LTE base station, a reconfiguration message, wherein the reconfiguration message includes information identifying one or more parameters for a 5G synchronization signal; and scan for the 5G synchronization signal based on the identified one or more parameters. 15. The fixed wireless access device of claim 14, wherein the one or more parameters for the 5G synchronization signal include at least one of a carrier frequency, a subcarrier spacing, or a timing configuration for the 5G synchronization signal. 16. The fixed wireless access device of claim 12, wherein, when scanning for the 5G wireless signals associated with the 5G NR base station, the processor is further configured to: determine a 5G operator identifier associated with a provider of wireless services; and scan for 5G wireless signals associated with the determined 5G operator identifier. 17. The fixed wireless access device of claim 12, wherein, when scanning for the 5G wireless signals associated with the 5G NR base station, the processor is further configured to: obtain information identifying a frequency at which a 5G synchronization signal is broadcast; and scan for the 5G synchronization signal at the identified frequency. 18. The fixed wireless access device of claim 12, wherein, when causing the 4G LTE base station to add the 5G NR base station as the secondary base station for the fixed wireless access device, the processor is further configured to: request high data rate traffic via a connection with the 4G LTE base station, wherein the high data rate traffic causes the 4G LTE base station to add the 5G NR base station as the secondary base station for the fixed wireless access device. 19. The fixed wireless access device of claim 12, wherein the processor is further configured to: track the signal strength for the 5G wireless signals over a time period or at a plurality of locations for the fixed wireless access device; and generate an indication of how the signal strength for the 5G wireless signals varies over the time period or over the plurality of locations, to be displayed on the user interface associated with the fixed wireless access device. 20. A system comprising: a base station configured to: detect a fixed wireless access device type based on an attach request message; and configure a 5G New Radio (NR) base station as a secondary base station for a connection associated with the attach request message based on the detected fixed wireless access device type; and a fixed wireless access device configured to: send the attach request to the base station; cause the base station to add the 5G NR base station as the secondary base station for the fixed wireless access device; scan for 5G wireless signals associated with the 5G NR base station; and generate an indication of signal strength associated with the 5G wireless signals for the 5G NR base station.

2020-01-28

en

2020-05-28

US-201615213492-A

High speed memory systems and methods for designing hierarchical memory systems ABSTRACT A system and method for designing and constructing hierarchical memory systems is disclosed. A plurality of different algorithmic memory blocks are disclosed. Each algorithmic memory block includes a memory controller that implements a specific storage algorithm and a set of lower level memory components. Each of those lower level memory components may be constructed with another algorithmic memory block or with a fundamental memory block. By organizing algorithmic memory blocks in various different hierarchical organizations, may different complex memory systems that provide new features may be created. RELATED APPLICATIONS The present patent application is a continuation of U.S. patent application Ser. No. 12/806,631, filed Aug. 17, 2010, which claims the benefit of previous U.S. Provisional Patent Application entitled “SYSTEM AND METHOD FOR STORING DATA IN A VIRTUALIZED HIGH SPEED MEMORY SYSTEM” filed on Mar. 17, 2009 having Ser. No. 61/161,025 and previous U.S. Provisional Patent Application entitled “SYSTEM AND METHOD FOR REDUCED LATENCY CACHING” filed on Dec. 15, 2009 having Ser. No. 61/284,260. U.S. patent application Ser. No. 12/806,631 is in turn is a continuation in-part of previous U.S. Patent Application entitled “SYSTEM AND METHOD FOR STORING DATA IN A VIRTUALIZED HIGH SPEED MEMORY SYSTEM” filed on Sep. 8, 2009 having Ser. No. 12/584,645, now U.S. Pat. No. 8,433,880, which also claims the benefit of previous U.S. Provisional Patent Application entitled “SYSTEM AND MEMORY FOR STORING IN A VIRTUALIZED HIGH SPEED MEMORY SYSTEM” filed on Mar. 17, 2009 having Ser. No. 61/161,025. TECHNICAL FIELD The present invention relates to the field of memory systems for of digital computer systems. In particular, but not by way of limitation, the present invention discloses techniques for designing and constructing hierarchical digital memory systems. BACKGROUND Most modern computer systems include at least one processor for processing computer instructions and a main memory system that stores the instructions and data processed by the processor. The main memory system is generally implemented with some form of Dynamic Random Access Memory generally known as DRAM. DRAM devices have a very high memory density (amount of data stored per area of integrated circuit used), low power usage, and a relative inexpensive cost. Thus, DRAM devices are used to construct large main memory systems for computer systems. The speed at which computer processors operate has been continually increasing. Specifically, decreasing the size of the semiconductor transistors and decreasing the operating voltages of these transistors has allowed processor clocks to run at faster rates. However, the performance of DRAM main memory systems that provide data to these faster processors have not kept pace with the increasingly faster processors. Thus, DRAM based main memory systems have become a bottleneck for computer performance. To mitigate this issue, larger Static Random Access Memory (SRAM) based cache memory systems are often used. SRAM devices operate at much faster rates than DRAM devices but have a lower memory density, consume more power, and are more expensive. Furthermore, cache memory systems only provide a speed improvement when a cache “hit” occurs (the needed data is available in the cache memory system). When a cache miss occurs, data must be fetched from the lower speed DRAM memory system. In some applications that require a guaranteed fast performance, the use of cache memory system will not suffice. Thus, it is desirable to improve the speed of memory systems such that memory systems can handle memory read and write operations as fast as possible. BRIEF DESCRIPTION OF THE DRAWINGS In the drawings, which are not necessarily drawn to scale, like numerals describe substantially similar components throughout the several views. Like numerals having different letter suffixes represent different instances of substantially similar components. The drawings illustrate generally, by way of example, but not by way of limitation, various embodiments discussed in the present document. FIG. 1 illustrates a diagrammatic representation of machine in the example form of a computer system within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed. FIG. 2A illustrates a conceptual diagram of a pipelined processing system used in digital electronics. FIG. 2B illustrates a time flow diagram of instructions flowing through the pipelined processing system of FIG. 2A. FIG. 2C illustrates a time flow diagram with result data being propagated back to an earlier pipeline stage. FIG. 3 illustrates a high level conceptual diagram of a virtualized memory system 300. FIG. 4 illustrates a block diagram of a first embodiment of an algorithmic memory block that can handle either simultaneous read and write operations or two simultaneous write operations. FIG. 5 illustrates a flow diagram describing the operation of the algorithmic memory block disclosed in FIG. 4. FIG. 6A illustrates an algorithmic memory block as disclosed in FIG. 4 receiving write to virtualized address 101 and write to virtualized address 103. FIG. 6B illustrates the algorithmic memory block of FIG. 6A after processing the write to virtualized address 101 and the write to virtualized address 103. FIG. 6C illustrates the algorithmic memory block of FIG. 6B receiving write to virtualized address 201 and read of virtualized address 204. FIG. 6D illustrates the algorithmic memory block of FIG. 6C after processing the write to virtualized address 201 and read of virtualized address 204. FIG. 6E illustrates an algorithmic memory block that can handle multiple write memory operations receiving four different simultaneous memory operations. FIG. 6F illustrates the algorithmic memory block of FIG. 6E after processing the four different simultaneous memory operations. FIG. 7 illustrates an algorithmic memory block that can handle two simultaneous read operations using two independent memory arrays. FIG. 8 illustrates an algorithmic memory block that can handle two simultaneous read operations using an extra memory bank with a second encoded copy of each data item. FIG. 9A illustrates an algorithmic memory block using the teachings of FIG. 8 receiving a single write operation to address 302. FIG. 9B illustrates the algorithmic memory block of FIG. 9A after handling the single write operation with a first method. FIG. 9C illustrates an algorithmic memory block using the teachings of FIG. 8 receiving a read operation for address 103 and a read operation for address 101. FIG. 9D illustrates the algorithmic memory block of FIG. 9C handling the two read operations. FIG. 9E illustrates an algorithmic memory block using the teachings of FIG. 8 receiving a read operation for address 103 and a read operation for the entire 01 row. FIG. 9F illustrates the algorithmic memory block of FIG. 9E handling the two read operations. FIG. 9G illustrates an algorithmic memory block using the teachings of FIG. 8 receiving a single write operation to address 302. FIG. 9H illustrates the algorithmic memory block of FIG. 9G after handling the single write operation with a second method using two port memories. FIG. 9I illustrates an algorithmic memory block receiving a single write operation to address 302 and executing a first cycle of operations. FIG. 9J illustrates the algorithmic memory block of FIG. 91 executing a second cycle of operations to handle the single write operation. FIG. 9K illustrates an algorithmic memory block using the teachings of FIG. 8 receiving a read operation for address 304 and a write operation for address 302. FIG. 9L illustrates the algorithmic memory block of FIG. 91 after handling the read and write operations. FIG. 10 illustrates an algorithmic memory block for handling four simultaneous read operations. FIG. 11A illustrates how a first data value is read from the B11 block of the algorithmic memory block of FIG. 10. FIG. 11B illustrates how a second data value is read from the B11 block of the algorithmic memory block of FIG. 10. FIG. 11C illustrates how a third data value is read from the B11 block of the algorithmic memory block of FIG. 10. FIG. 11D illustrates all of the memory blocks read during the read operations depicted in FIGS. 11A, 11B, and 11C. FIG. 11E illustrates how a fourth data value is read from the B11 block of the algorithmic memory block of FIG. 10. FIG. 11F illustrates how a data value is read from the B07 block of the algorithmic memory block of FIG. 10. FIG. 12A illustrates an algorithmic memory block using the teachings of FIG. 7 receiving a read operation for address 302 and a write operation for same address 302 wherein both operations are associated with an update operation. FIG. 12B illustrates the algorithmic memory block of FIG. 12A after handling the read and write operations. FIG. 12C illustrates an algorithmic memory block using the teachings of FIG. 7 receiving a read operation for address 302 and a write operation for same address 104 wherein both operations are associated with an update operation. FIG. 12D illustrates the algorithmic memory block of FIG. 12C after handling the read and write operations. FIG. 12E illustrates an algorithmic memory block using the teachings of FIG. 7 receiving a read operation for address 301 and a write operation for same address 302 wherein both operations are associated with an update operation. FIG. 12F illustrates the algorithmic memory block of FIG. 12E after handling the read and write operations. FIG. 13 illustrates an algorithmic memory block for handling read, read-clear, and write operations. FIG. 14A illustrates an algorithmic memory block using the teachings of FIG. 13 receiving a write operation for address 302. FIG. 14B illustrates the algorithmic memory block of FIG. 14A after handling the write operation. FIG. 14C illustrates the algorithmic memory block of FIG. 14B receiving a write operation for address 102. FIG. 14D illustrates the algorithmic memory block of FIG. 14C after handling the write operation. FIG. 14E illustrates an algorithmic memory block using the teachings of FIG. 13 receiving a write operation for address 100 and a read operation for address 104. FIG. 14F illustrates the algorithmic memory block of FIG. 14E after handling the write operation and the read operation if the read operation was a normal read operation. FIG. 14G illustrates the algorithmic memory block of FIG. 14E after handling the write operation and the read operation if the read operation was a read-clear operation. FIG. 15A illustrates a first embodiment of a hierarchical memory system that can handle two simultaneous read operations and two simultaneous write operations. FIG. 15B illustrates how the hierarchical memory system of FIG. 15A avoids memory bank conflicts. FIG. 15C conceptually illustrates the hierarchical memory organization of the hierarchical memory system of FIG. 15A. FIG. 16 illustrates the hierarchical memory system of FIG. 15A extended to handle additional simultaneous read and write operations. FIG. 17A illustrates a second embodiment of a hierarchical memory system that can handle two simultaneous read operations and two simultaneous write operations. FIG. 17B illustrates how the hierarchical memory system of FIG. 17A handles two simultaneous read operations and two simultaneous write operations all directed toward the same memory bank in the same memory block. FIG. 17C illustrates how the hierarchical memory system of FIG. 17A uses an extra memory bank to prevent conflicts between read operations and write operations. FIG. 17D conceptually illustrates the hierarchical memory organization of the hierarchical memory system of FIG. 17A. FIG. 18 illustrates a conceptual diagram depicting different paths to achieve the same type of multiple read and multiple write memory systems. DETAILED DESCRIPTION The following detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show illustrations in accordance with example embodiments. These embodiments, which are also referred to herein as “examples,” are described in enough detail to enable those skilled in the art to practice the invention. It will be apparent to one skilled in the art that specific details in the example embodiments are not required in order to practice the present invention. For example, although some of the example embodiments are disclosed with reference to computer processing systems used for packet-switched networks, the teachings can be used in many other environments. Thus, any digital system that uses digital memory can benefit from the teachings of the present disclosure. The example embodiments may be combined, other embodiments may be utilized, or structural, logical and electrical changes may be made without departing from the scope of what is claimed. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope is defined by the appended claims and their equivalents. In this document, the terms “a” or “an” are used, as is common in patent documents, to include one or more than one. In this document, the term “or” is used to refer to a nonexclusive or, such that “A or B” includes “A but not B,” “B but not A,” and “A and B,” unless otherwise indicated. Furthermore, all publications, patents, and patent documents referred to in this document are incorporated by reference herein in their entirety, as though individually incorporated by reference. In the event of inconsistent usages between this document and those documents so incorporated by reference, the usage in the incorporated reference(s) should be considered supplementary to that of this document; for irreconcilable inconsistencies, the usage in this document controls. Computer Systems The present disclosure concerns digital computer systems. FIG. 1 illustrates a diagrammatic representation of a machine in the example form of a computer system 100 that may be used to implement portions of the present disclosure. Within computer system 100 of FIG. 1, there are a set of instructions 124 that may be executed for causing the machine to perform any one or more of the methodologies discussed within this document. In a networked deployment, the machine of FIG. 1 may operate in the capacity of a server machine or a client machine in a client-server network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a cellular telephone, a web appliance, a network server, a network router, a network switch, a network bridge, or any machine capable of executing a set of computer instructions (sequential or otherwise) that specify actions to be taken by that machine. Furthermore, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein. The example computer system 100 of FIG. 1 includes a processor 102 (e.g., a central processing unit (CPU), a graphics processing unit (GPU) or both) and a main memory 104 and a static memory 106, which communicate with each other via a bus 108. The computer system 100 may further include a video display adapter 110 that drives a video display system 115 such as a Liquid Crystal Display (LCD) or a Cathode Ray Tube (CRT). The computer system 100 also includes an alphanumeric input device 112 (e.g., a keyboard), a cursor control device 114 (e.g., a mouse or trackball), a disk drive unit 116, a signal generation device 118 (e.g., a speaker) and a network interface device 120. Note that not all of these parts illustrated in FIG. 1 will be present in all embodiments. For example, a computer server system may not have a video display adapter 110 or video display system 115 if that server is controlled through the network interface device 120. The disk drive unit 116 includes a machine-readable medium 122 on which is stored one or more sets of computer instructions and data structures (e.g., instructions 124 also known as ‘software’) embodying or utilized by any one or more of the methodologies or functions described herein. The instructions 124 may also reside, completely or at least partially, within the main memory 104 and/or within a cache memory 103 associated with the processor 102. The main memory 104 and the cache memory 103 associated with the processor 102 also constitute machine-readable media. The instructions 124 may further be transmitted or received over a computer network 126 via the network interface device 120. Such transmissions may occur utilizing any one of a number of well-known transfer protocols such as the well known File Transport Protocol (FTP). While the machine-readable medium 122 is shown in an example embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies described herein, or that is capable of storing, encoding or carrying data structures utilized by or associated with such a set of instructions. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical media, and magnetic media. For the purposes of this specification, the term “module” includes an identifiable portion of code, computational or executable instructions, data, or computational object to achieve a particular function, operation, processing, or procedure. A module need not be implemented in software; a module may be implemented in software, hardware/circuitry, or a combination of software and hardware. Pipelining In Digital Circuit Design Pipelining is a design technique used in modern digital electronics. To perform a complex operation (such as a table look-up, a multiplication, etc.), a digital computing system must generally perform a sequential series of smaller individual operations. These small individual operations may be performed internally and a final result is provided. If a computer system uses an individual instruction to perform complex operations, then the processor executing the instruction may decode the instruction, perform the series of steps internally, and provide a processing result before executing the next instruction. With such a processor architecture, the processor requires a significant amount of time to perform all of the individual steps to complete the instruction. Thus, this architecture does not provide optimal results. To improve processing speeds, virtually all modern processors (and other digital systems such as DSPs, ASICs, etc.) implement “pipeline” processing architectures. In a pipelined processor architecture, each individual step required to implement a complex computer instruction is broken down into an individual processing stage. The processing of a complex computer instruction is then handled by having the state data for the instruction proceed through the individual processing stages one by one. Then, to achieve performance gains, multiple complex instructions are handled at the same time with each pipelined stage handling data from a processing successive stage. This processing of multiple instructions simultaneously greatly improves the performance of the processor. FIG. 2A illustrates a conceptual diagram of a pipeline for processing a computer instruction. A computer instruction 205 enters the pipeline at a first processing stage, processing stage A 210 in FIG. 2A. The computer instruction will then pass through subsequent processing stages B 220, C 230, and D 240. The computer instruction may pass through these processing stages during sequential clock cycles of a clock signal within the processor core. At the end of the processing pipeline, some results 295 will be output. The results may be the output of an arithmetic operation, the output of a logical operation, the results of a comparison, or any other processing result. FIG. 2B conceptually illustrates how several instructions may be processed in parallel in the pipelined processing system of FIG. 2A. The diagram of FIG. 2B illustrates time moving to the right along a horizontal axis and new instructions entering the pipeline along a vertical axis. Initially, at time 261, a first instruction 210 enters stage A as depicted by processing 211. Next, at time 262, the first instruction 210 is passed to processing stage B as illustrated by processing 212. Simultaneously at time 262, a second instruction 220 enters processing stage A as depicted by processing 221. Next, at time 263, the first instruction 210 is passed to processing stage C as illustrated by processing 213. Similarly, the second instruction 220 is passed to processing stage B as illustrated by processing 222. And simultaneously, a third instruction 230 enters stage A of the processing pipeline as depicted by processing 231. The pipeline system proceeds to process instructions sequentially in this manner. Thus, for every new time cycle, a new instruction enters the pipeline and an older instruction exits the pipeline. For example, at time 265, a new instruction 250 enters the pipeline as depicted with processing 251 but the first instruction 210 (at the top row) has completed all four processing stages and is no longer in the pipeline. In this manner, the processing pipeline is able to complete an instruction in every clock cycle. There will be a latency between when processing is started on an instruction and when processing is finished for that instruction. However, the throughput of the processor has been greatly increased since an instruction is completed during every clock cycle. One problem that may occur in a pipelined processing system is that one instruction may be dependent on the output of an earlier instruction. For example, an output data value for a first instruction may be an input data value for a later instruction. If that later instruction enters the pipeline before the first instruction has been complete, the processor cannot process that later instruction until it receives the result from the earlier instruction. There are different manners of handling this problem. The ideal way to handle this problem is process the instruction normally but have the needed result data propagate back in the instruction processing pipeline as soon as the needed result data becomes available. For example, FIG. 2C conceptually illustrates this solution. Referring to FIG. 2C, a third instruction 230 enters the instruction processing pipeline at stage 263. This third instruction 230 is dependent on output data from the first instruction 210. To handle the situation in the most efficient manner, the system will continue processing normally and resolve the data issue internally. Specifically, instruction 230 may be processed in the first processing stage 231 at time 232. However, this processing stage may not need the input data yet. For example, stage 231 may simply decode the instruction. Then, at time 264, instruction 210 may be near completion and can pass the needed state data 207 back to the earlier pipeline stage 232 that needs the state data 207 as illustrated in FIG. 2C. With the needed state data now available, instruction 230 can continue processing at stage C 233 at time 265 using the state data was propagated forward up the pipeline. Thus, as long as output data from earlier instructions can be propagated back up the pipeline to later instructions that need the data as inputs, then the processor pipeline can continue operating despite various data dependencies. In certain situations, the needed data cannot be propagated back fast enough to allow a particular instruction to proceed through the pipeline. When this occurs, a pipeline stall may occur wherein the later instructions cannot advance along the processing pipeline until the needed data becomes available. Thus, some “bubbles” may occur within the pipeline. Although these bubbles may reduce performance to some degree, the system will still be faster than a system that completely processes every instruction before fetching a subsequent instruction. The memory systems that will be disclosed in this document often use a series of independent processing steps in order to locate data, fetch data, resolve conflicts, store data, and perform other operations. To implement these processing steps in an efficient manner, the memory systems will use pipelined design techniques as disclosed in this section. However, instead of processing individual computer instructions, the pipeline will process a sequential series of memory accesses (reads and writes). In a memory system that uses pipelined logic, there can be at least two different circumstances wherein data dependency issues may occur: memory data dependencies and internal state dependencies. Both types of dependencies must be handled properly in order for the memory system to provide proper results. Memory data dependencies occur when data from one unresolved memory operation is used within a later operation that follows shortly thereafter. For example, a read operation from one memory location may shortly be followed by a write operation to another memory location. If these two memory requests enter a memory request processing pipeline in close proximity, the data needed to perform the memory write will not be available until the data fetch for the memory read operation is performed. However, these two instructions may both enter the memory request processing pipeline and progress through the pipeline as long as the data fetched for the memory read operation is propagated back along the pipeline to the data write operation. The other type of dependency issue involves internal state data. The logic of memory request processing pipeline may operate using several different pieces of internal state data. This internal state data may include pointers, Boolean values, counters, coded values, etc. For example, one system may keep track of a ‘free’ memory location that may be used to store a data value if a memory bank conflict occurs. This value will change upon each use since a new ‘free’ memory location must be made available. If there is a long memory request processing pipeline, then later memory instructions will enter the memory request processing pipeline without this needed information being available. However, as long as the needed value is determined and propagated up the memory request processing pipeline before the value is needed, there will be no stall of the memory request processing pipeline. This document will disclose multi-step procedures that must be performed in order to handle memory operations. In should be assumed that these multi-step procedures will be implemented with pipelined logic as set forth in this section. Furthermore, if a particular data value needed to perform a particular step is not available when the memory request enters the memory request processing pipeline then that needed data will be propagated back from a later processing stage. In a pipelined computer processor, the instruction stream will include conditional branch instructions that will specify if the processor should follow one instruction path or another. Such branch instructions greatly increase the difficultly of implementing a pipelined system since it is not clear which instructions after a branch instructions should be fetched. To handle this situation, most processors implement a branch prediction system that makes an educated guess as to the most probably direction that will be taken. However, if the branch prediction unit predicts incorrectly, the instruction processing pipeline must be flushed and reloaded with the proper instructions. Although this is a concern when designing computer processors, this pipelining issue is generally not an issue in a memory system. Memory Design Overview and Methodology This document discloses various different memory system designs and methods of combining those memory system designs to create sophisticated memory systems with specific design characteristics. Specifically, a memory system with a desired set of memory requirements may be created by combining together various different types of memory blocks in a hierarchical arrangement that will fulfil the desired memory requirements. The memory requirements may include factors such as the number of simultaneous reads, the number of simultaneous writes, the memory system size, the data width, the clock speed, the maximum acceptable latency, the minimum throughput, etc. The sophisticated hierarchical memory system designs are constructed from two different types of memory building blocks: algorithmic memory building blocks and fundamental memory building blocks. The algorithmic memory building blocks are memory systems implement algorithms with digital processing logic in order to improve the performance of the memory system. The fundamental memory blocks consist of various different memory circuit designs such as DRAMs, SRAMs, etc. Each of the algorithmic memory building blocks includes internal memory that be constructed from other algorithmic memory building blocks or with fundamental memory building blocks. By using algorithmic memory building blocks to provide memory services to higher level algorithmic memory building blocks various hierarchical memory systems may be created. However, each hierarchical memory arrangement ultimately terminates with fundamental memory blocks at the end (“leaf”) nodes of the hierarchy. Almost any type of fundamental memory circuit design may be used to construct the hierarchical memory systems of the present disclosure. Each fundamental memory circuit design provides different advantages and disadvantages. Traditional Dynamic Random Access Memory (DRAM) may be used to construct hierarchical memory systems using the teachings of the present invention. However, since traditional DRAM tends to be constructed using semiconductor process technologies that differ from the semiconductor process technologies used for most digital circuits such as the logic circuitry is this disclosure, traditional DRAM may not be the best choice of memory technology. Embedded DRAM (eDRAM) is a volatile memory circuit design that is now very often used since it may be constructed with the industry standard CMOS processes used to fabricate most digital circuit designs. Embedded DRAM (eDRAM) is generally for the main memory within ASIC designs due to its high memory density. Static Random Access Memory (SRAM) is often used when DRAM or eDRAM memory technology does not provide adequate memory performance. However, SRAM generally requires more die area, consumes more power, and generates more heat. Many different types of SRAM may be used such as the higher density 3T-SRAM and 1T-SRAM. In certain situations, individual flip-flops may be used to implement small amounts of memory that must operate at very high speeds. However, such memory should be used sparingly due to the low memory density of using individual flip-flops. Thyristor RAM (T-RAM) may be used as a fundamental memory design in the present disclosure. T-RAM is a type of DRAM computer memory that exploits the electrical property known as negative differential resistance. T-RAM memory devices combine strengths of the DRAM (memory density) and SRAM (high speed). Zero capacitor RAM (Z-RAM) may be used as a fundamental memory design in the present disclosure. Z-RAM is a type of digital memory that uses the floating body effect of silicon on insulator (SOI) process technology. Z-RAM memory makers claim that Z-RAM technology provide memory access speeds similar to traditional SRAM cells but provides higher memory density due to the use of only a single transistor. The hierarchical memory systems will be disclosed primarily with reference to volatile memory designs, however hierarchical memory systems may also be constructed with non-volatile memory. For example, flash memory cells may be used in certain applications wherein non-volatile storage is needed. Flash memory tends not to operate as fast as other types of memory but has the advantage of not losing the memory state when power is removed from the system. Magnetoresistive Random Access Memory (MRAM) is another type of non volatile memory technology that may be used. The various different memory types may be implemented with various different features. For example, memory cells may be implemented with a single port, two ports, or dual ports. A single port memory can handle only one read operation or one write operation. A two port memory has an independent read port and an independent write port. Thus, a two port memory can handle one read operation and one write operation simultaneously. A dual port memory has two completely independent memory ports. Thus, a dual port memory can handle two read operations simultaneously, two write operations simultaneously, or one read operation and one write operation simultaneously. Memory cells may have additional memory ports. The above fundamental memory building blocks (and others not disclosed) may be used to implement various different algorithmic memory blocks. And these first-level algorithmic memory blocks constructed from fundamental memory devices may be used within other higher-level algorithmic memory blocks to create complex hierarchical memory systems. Note that the algorithmic memory blocks combined in various arrangements may create various different dependencies that need to be taken into account by the hierarchical circuit designs. Algorithmic Memory Block Basics To construct high performance memory systems, the algorithmic memory blocks of present disclosure often implement “virtualized memory systems”. These virtualized memory systems generally provide memory performance increases without imposing any specific programming restraints upon the user of the virtualized memory system. Greater details about virtualized memory systems can be found in U.S. patent application entitled “SYSTEM AND METHOD FOR STORING DATA IN A VIRTUALIZED HIGH SPEED MEMORY SYSTEM” filed on Sep. 8, 2009 having Ser. No. 12/584,645. A virtualized memory system operates in a manner analogous to traditional virtual memory but with a different goal. In traditional virtual memory system, a large virtual memory space is mapped onto a small physical memory (with the aid of a long term storage system) to provide a programmer with a larger memory space to work with. To the contrary, in a virtualized memory system a smaller virtualized memory space is mapped onto a larger physical memory space to provide the programmer with improved memory performance. The computer programmers work in the virtualized memory address space without having to worry about the specific details of how the virtualized memory system internally handles the data in a real physical memory address space. A memory controller in a virtualized memory system is used to perform various logical operations that implement the techniques which improve memory performance. The memory controller may translate the memory requests made in a virtualized address space into a real physical address space using one of several different techniques. In one technique, an extra memory bank and a set of address space mapping tables is used to ensure there will be no memory bank conflicts that will reduce memory performance. Using the larger physical memory address space (the extra memory bank), the virtualized memory system hides the effects of any potential memory bank conflicts from the user of the memory system. In other embodiments, the virtualized memory system uses extra memory to encode a redundant copy of each data item such that there are always at least two different methods of fetching requested data. FIG. 3 illustrates a high level conceptual diagram of a virtualized memory system 3300. In the particular virtualized memory system disclosed in FIG. 3, memory user 311 and memory user 312 access the same virtualized memory system 300. The concurrent memory requests to the virtualized memory system 300 may be from a single entity operating at twice the speed of two individual entities. Thus, processor 310 operating at twice the clock speed of memory user 311 and memory user 312 could issue two consecutive memory requests that would appear as two memory requests received concurrently by virtualized memory system 300. All of the memory access requests to the virtualized memory system 300 are handled by a virtualized memory system controller 321. The virtualized memory system controller 321 receives memory access requests (reads, writes, or other memory commands) containing virtualized memory addresses and performs request memory operation. In some embodiments, the virtualized memory system controller 321 translates virtualized memory addresses (in the virtualized memory address space 304) into real physical memory addresses in a larger physical memory address space 320. The memory system controller 321 then accesses the requested information using the physical addresses in the physical memory address space. As set forth in an earlier section of this document, the virtualized memory system controller 321 may be implemented with pipelined digital logic such that the virtualized memory system controller 321 may be handling several sequentially received memory requests through several processing stages concurrently. The virtualized memory system controller 321 performs the needed logical operations (such virtualized to physical address translations) with the aid of virtualized memory state information 323 in the virtualized memory system controller 321. The virtualized memory state information 323 is a set of state information needed to implement the particular memory performance technique implemented by the virtualized memory system controller 321. For example, in a virtualized memory system controller 321 that translates from virtualized addresses to physical address, the virtualized memory state information 323 may include virtual to physical address translation tables. Other techniques will maintain other state information. The end result of the logical operations performed by the virtualized memory system controller 321 using the virtualized memory state information 323 is some type of memory operation (a read, a write, or another memory operation) on the physical memory address space 320. However, that “physical address space” 320 may be a real physical memory address space implemented with fundamental memory blocks or it may actually be another algorithmic memory building block. If the “physical address space” is implemented with another algorithmic memory block, that algorithmic memory building block will implement its own memory performance enhancing techniques. It is this ability to design and build hierarchies of algorithmic memory building blocks (which all ultimately terminate with a fundamental memory block) that allows the system of the present disclosure to construct a wide variety of complex high-performance memory systems. Thus, a key aspect of the present disclosure is the set of different algorithmic memory building blocks used to create complex memory systems. Each different algorithmic memory building block provides different features. The following sections will describe a set of several different algorithmic memory building blocks that may be used to created hierarchical memory systems. However, the disclosed set of algorithmic memory building blocks is not exhaustive. Algorithmic Memory System 1: Extra Memory To Obtain 2X Performance (1R & 1W) or (1R or 2W) The first algorithmic memory block is a memory block that uses extra memory to allow either simultaneous read and write operations; or two simultaneous write operations. This algorithmic memory block operates by using extra memory to prevent memory conflicts between the two simultaneous memory operations. The extra memory may be implemented in various different methods. For example, the extra memory may comprise a cache that handles incoming memory requests that may cause conflicts. However, this section will primarily focus on an implementation which uses an extra memory that is the same as the other memory banks in the memory system. FIG. 4 illustrates a block diagram of a first embodiment of a algorithmic memory block 400 that can handle either simultaneous read and write operations (1R1W); or two simultaneous write operations (2W). The example depicted in FIG. 4 and in the following description will provide specific numbers of memory banks, memory addresses, etc. However, it will be obvious to one skilled in the art that these are just numbers for this one example implementation. Various different memory system sizes may be constructed using very different numbers of memory banks, memory addresses, etc. As previously depicted in the conceptual diagram of FIG. 3, the algorithmic memory block 400 mainly consists of a memory system controller 421 and physical memory array 420. As set forth earlier, the “physical memory array” 420 may not actually be physical memory array. Instead, physical memory array 420 may be implemented with another algorithmic memory block. However, for purposes of this document, it will be referred to as a physical memory array since that allows the familiar concept of virtual to physical memory translation to be used in the explanation of the algorithmic memory block 400. Referring to the algorithmic memory block 400 of FIG. 4, the physical memory array 420 is organized into five independent memory banks (Bank A to E) having 100 rows each. For ease of explanation, this document will refer to memory bank sizes and memory addresses with base 10 (decimal) numbers but most actual implementations would use an even multiple of 2 for a base 2 (binary) address system. In the algorithmic memory block 400 embodiment of FIG. 4 that has five memory banks with 100 rows in each memory bank, there are 500 unique physical memory addresses in the physical memory 420. The algorithmic memory block 400 presents a virtualized memory address space to users Of the algorithmic memory block 400 that is smaller than the actual physical address space. Thus, in the embodiment of FIG. 4, an initial virtual memory address space 404 (surrounded by a rectangle made of dotted lines) comprising virtualized memory addresses 000 to 399 is represented within physical memory banks A to D. Physical memory bank E does not initially represent any of the virtualized memory locations such that memory bank E's memory locations are marked ‘empty’. As depicted in FIG. 4, this document will specify a virtualized memory address that is currently being represented by a physical memory location as a three-digit virtualized memory address within the box of the physical memory location. For example, the physical memory location at row 00 of Bank B initially represents virtualized memory address 100 such that ‘100’ is depicted within the box at row 00 of memory bank B. As will be set forth later in this document, the actual locations of the various virtualized memory addresses will move around in the physical memory space 420. Thus, the virtual memory address space 404 organization depicted in FIG. 4 only represents one possible state of many. In the algorithmic memory block 400 of FIG. 4, the virtualized memory system controller 421 is responsible for handling all virtualized memory access requests from the memory user(s) 410. The memory system controller 421 translates virtualized memory addresses (the 000 to 399 addresses in FIG. 4) into actual physical memory-addresses (identified in FIG. 4 by the memory bank letter and the row within that memory bank) within the physical memory 420. To accomplish this virtualized to physical address translation task, the memory system controller 421 uses a virtualized memory mapping table 423. In the specific virtualized memory system embodiment illustrated in FIG. 4, the virtualized memory addresses are split into a most significant digit (the first digit of a three digit virtualized address) and two least significant digits (the second two digits of a three digit virtualized address). The virtualized memory system of FIG. 4 uses the least significant digits of virtualized memory address (the second two digits of the virtualized memory address) as the physical row designation in the physical memory system. Thus, there is no translation needed for the two least significant digits of the virtualized memory address since they are the same as the two least significant digits of the physical memory address. Note that other embodiments may use other bits or even any other type of suitable virtual-to-physical address translation system. The most significant digit of a virtualized memory address must still be translated into a physical memory address. In the system of FIG. 4, the most significant digit of a virtualized memory address is translated into a physical memory bank. To perform the translation, the virtualized memory mapping table 423 includes a number of rows equal to the number of rows in the memory banks and a number of columns equal to the number of most significant address digit possibilities (0, 1, 2, and 3 in this example of a virtualized address space from 000 to 399). To translate from the virtualized memory address to the physical memory location, the virtualized memory system controller 421 examines the entry of the virtualized memory mapping table 423 having the same row of the virtualized memory address' two least significant digits and the same column as the virtualized memory address' most significant digit. For example, to translate virtualized address 304 to a physical memory location, the virtualized memory system controller 421 consults the entry of column ‘3’ and row ‘04’ to obtain ‘D’ as the memory bank that currently represents virtualized address 304. Specifically, virtualized address 304 is currently represented in row 04 of memory bank D. In addition to the 0 to 3 columns, the virtualized memory mapping table 423 embodiment of FIG. 4 also includes a column labelled “e”. This column is used to identify a memory bank containing an empty memory location for that particular designated row. For example, row ‘02’ of column ‘e’ in the virtualized memory mapping table 423 lists memory bank ‘E’ as a memory bank with an empty location for row 02. However, this column need not be implemented since the memory bank with an empty memory location in that particular row can be inferred by determining the memory bank designation (A, B, C, D, or E) not represented in the 0 to 3 columns of that same row. The algorithmic memory block 400 of FIG. 4 is configured to handle either a read request with a simultaneous write request or two simultaneous write requests. The algorithmic memory block 400 accomplishes these simultaneous actions without ever forcing the memory user(s) 410 to stall due to a memory bank conflict. Thus, even if the simultaneous memory request are directed to the same memory bank (which would cause a memory bank conflict in most memory systems), the algorithmic memory block 400 will handle the two memory requests without stalling the memory user(s) 410. Thus, the virtualized memory system 400 provides a guaranteed memory bandwidth such that all applications which require a guaranteed memory access time can use the virtualized memory system 400. It should be noted that one situation that cannot be dealt with easily is when both a read and a write are received at the same time for the exact same virtualized address. Normally, a memory user should never issue such a pair of simultaneous requests since there is really no reason to read an address when that same address is being written to by the same entity. However, if such a case occurs, the reader may be given the original data or the newly written data depending on the particular implementation. The virtualized memory system controller 421 prevents memory bank conflicts wherein two memory operations are simultaneously directed toward the same memory bank by moving the virtualized memory address for a write operation to an unused memory location in a different memory bank. The unused memory location is located by reading the virtualized memory table 423. After writing the data into that formerly unused memory location the memory controller 421 then updates the virtualized memory table 423 with the virtualized address from the write operation to reflect the new location of data associated with that virtualized memory address. The technique is best described with the use of examples. An example operation of the virtualized memory system 400 embodiment of FIG. 4 is set forth with reference to FIGS. 5, 6A, and 6B. FIG. 6A illustrates the same virtualized memory system 400 of FIG. 4 in the same initial condition. If the virtualized memory system controller simultaneously receives a memory write to virtualized address 101, written as W(101) in FIG. 6A, and memory write to virtualized address 103, written as W(103), this memory access pattern would normally cause a memory bank conflict since both virtualized address 101 and 103 are in the same memory bank (memory bank B). To prevent the memory bank conflict, the virtualized memory system controller 621 allows one of the write operations (the write to virtualized address 103 in this example) to proceed as normal in physical memory bank B but handles the other write to virtualized address 101 using a different memory bank. The data currently residing in the current physical memory location associated with virtualized address 101 is no longer relevant since a new data value is being written to virtualized address 101. If instead of a write to address 103 it was a read from address 103, the system would perform in the same manner. Specifically, the read would be performed from address 103 and the write to address 101 would be placed in a different memory bank to prevent a memory bank conflict. Note that in this particular type of algorithmic memory block, the read operation must always use the current physical location associated with the requested virtualized address since that is the only location where the data can be found. The full chain of events will be set forth with reference to the flow diagram disclosed in FIG. 5. Note that the flow diagram of FIG. 5 is being used to disclose the method of operation of the system in a simplified manner for explanation purposes. In a physical implementation, several of the stages disclosed in FIG. 5 (such as the table look-ups in stages 510 and 530) may be performed in parallel. Initially, at stage 505, the virtualized memory system controller 521receives either one read and one write request or two write requests. (In the example of FIG. 6A it is write requests to address 103 and to address 101). Next, at stage 510, the virtualized memory system controller 621 consults the virtualized memory table 623 to determine the current physical location the read address or one of the write addresses. (In the example of FIG. 6A the write request to address 103 is chosen.) The most significant digit of the address is used to select a column and the two least significant digits are used to select a row in virtualized memory table 623 which specifies that virtualized address 103 is currently located in memory bank B. Thus, the virtualized memory system controller 621 access that physical memory location and performs the requested memory operation (read or write) at stage 520. At stage 530, the virtualized memory system controller 621 consults the virtualized memory table 623 to determine the physical location of the virtualized address (101 in this example) associated with (other) write request. Consulting virtualized memory table 623, it can be seen that virtualized address 101 is in memory bank B. Next, at stage 535, the system determines if this location causes a memory bank conflict with the read operation. If the write had been to a memory location in a different memory bank (such as address 200 in bank D) then the write operation could simply be performed using that location at stage 540 thus completing both memory operations. This operation could be performed in parallel with the previous memory operation. However, in this example, the write is to virtualized address 101 that is in memory bank B thus causing a memory bank conflict with the memory operation that used virtualized address 103 which is also located in memory bank B. To prevent the memory bank conflict between addresses 101 and 103, the system proceeds to stage 550 where the virtualized memory system controller 621 consults the “e” column of the 01 row in the virtualized memory table 623 to determine the physical location of an available memory bank to write the data for virtualized address 101. Row 01 of column “e” in virtualized memory table 623 specifies memory bank E as being available memory bank for accepting data into the 01 row. Thus, the virtualized memory system controller 621 writes the data from the write request targeted at virtualized address 101 into row 01 of memory bank E. (The actual data value is not shown in FIG. 6A or 6B since the actual data value does not matter for this discussion.) Since the physical location of virtualized memory address 101 has moved, the virtualized memory table 623 must be updated to reflect the new physical location of virtualized address 101. Thus at stage 560, the virtualized memory system controller 621 writes “E” into row 01 of the 1 column in the virtualized memory table 623. This signifies that virtualized address 101 is now located in memory bank E. If the particular memory system implementation uses a ‘free bank’ column then the new free memory bank associated with the 01 row must also be updated in that free bank column. Therefore, at stage 570, the virtualized memory system controller 621 writes “B” into the “e” column of row 01 in the virtualized memory table 623. Note that in implementations where the free memory bank is inferred by the memory bank not listed in that particular row, this stage does not need to be performed. At this point, both the memory operation (read or write) using address 103 and the write operation to address 101 have been performed without stalling due to a memory bank conflict. A second example of a simultaneous read operation and write operation is provided with reference to FIGS. 6C and 6D. FIG. 6C uses the state of FIG. 613 as a starting point and then simultaneously receives a write to virtualized address 201 and a read from virtualized address 204. To perform the read of virtualized address 204, the memory controller 621 first determines the location of virtualized address 204 in the physical memory. Thus, the memory controller first reads out the entry at column 2 of row 04 in virtualized address table 623 which specifies that virtualized address 204 is currently located in memory bank C. Thus, the memory controller 621 reads the data for virtualized address 204 out of the 04 row of memory bank C to handle the read request. To handle the write to virtualized address 201 which was previously in the 01 row of column C thus causing a memory bank conflict with the read from row 04 of memory bank C, the memory controller 621 reads the entry from the “e” column in row 01 of virtualized address table Q23 to determine that the free memory bank for row 01 is memory bank B. Thus, the data associated with the write to location 201 is placed in row 01 of physical memory bank B as depicted in FIG. 6D. The memory controller 621 then updates table 623 to reflect the new location of virtual address 201 (by writing “B” in entry at row 01 of column 2) and the location of the new free memory location for row 01 (by writing a “C” in the entry at “e” column of row 01. The final state after the read from address 204 and the write to address 201 is illustrated in FIG. 6D. As can be seen from the above two examples, the virtualized memory system will always have at least two locations where it can perform a write for any virtualized address: the current location of that virtualized address or the memory bank for that row designated as empty. If an incoming write does not cause a memory bank conflict with another simultaneous memory operation (read or write), then the virtualized memory controller 621 may store the data in its current location. However, if there is a memory bank conflict caused by a write and one other memory operation to the same memory bank, then the virtualized memory controller 621 will write the data to a memory bank having an empty location for that row and update the new location of that virtualized memory address in the virtualized memory table 623. In the implementation depicted, the lowest two digits of the virtualized address space location will always designate the row in the physical memory space. However, in a real digital implementation, a subset of bits from the virtualized memory address may be used (such as a set of least significant bits of the virtualized memory address). The memory systems disclosed with reference to FIGS. 6A to 6 operates using extra memory banks added to a memory system. However, similar results may be achieved by adding extra memory to the memory system in different forms. For example, instead of using an extra memory bank, a cache memory system may be added to the memory controller 621 portion of the memory system. The Provisional Patent Application entitled “SYSTEM AND METHOD FOR REDUCED LATENCY CACHING” filed on Dec. 15, 2009 having Ser. No. 61/284,260 discloses a method of using a cache memory to achieve a similar result and is hereby incorporated by reference. Algorithmic Memory System 2: Additional Memory to Obtain Even Greater Write Performance (1R and nWs) or (nWs) The preceding section disclosed an algorithmic memory block that allowed for two simultaneous write operations or, alternatively, one read operation and one write operation simultaneously. That algorithmic memory block achieved that result by adding extra memory that is used when a write operation conflicted with another memory operation (either a read or a write). A memory mapping table was then used to keep track of the new location of the data. This technique can be expanded to handle many additional concurrent write operations by adding additional memory to handle each additional write operation. Again, although this technique will be described with reference to an implementation that uses additional memory banks that operate like the other memory banks, a memory system that handles several simultaneous write operations can also be implemented using a cache memory within the memory controller. For example, the memory system disclosed in the provisional patent application “SYSTEM AND METHOD FOR REDUCED LATENCY CACHING” filed on Dec. 15, 2009 having Ser. No. 61/284,260 could be modified to include additional caches to handle additional write operations. To construct a memory system that handles many additional concurrent write operations, one additional memory bank must be added to the memory system for each additional write operation after a first memory operation (which may be a read or a write operation). For example, if a system needs to handle four concurrent write operations then the system needs a main set of memory banks and then three additional memory banks to handle the additional write operations. The first write operation is handled by the main memory bank and the remainder of the write operations are either handled by the main memory (when there is no conflict with another write operation) or one of the additional extra memory banks (when there is a conflict with another write operation). Similarly, if a system needs to hand one read operation and two write operations then the system will require a main memory bank and two additional memory banks. The read operation is handled by the main memory bank and the write operations are either handled by the main memory (when there is no conflict with the read operation) or one of the additional extra memory banks (when there is a conflict with the read or another write operation). FIGS. 6E and 6F illustrate the operation of an example algorithmic memory block that has three additional memory banks labelled E1, E2, and E3. By having three extra memory banks, the algorithmic memory block can simultaneously handle a first memory operation (a read operation or a write operation) and three additional write operations. An example of the operation of the algorithmic memory block is set forth with reference to FIGS. 6E and 6F. In FIG. 6E, the algorithmic memory block is an initial state wherein all of the externally addressable memory locations are currently located in the main memory banks A, B, C, and D. The algorithmic memory block also includes three additional memory banks E1, E2, and E3 for handing write operations that may conflict with a first memory operation. The algorithmic memory block then receives four memory operations: a first memory operation (that may be a read or a write) addressing location 201 and three additional write operations to addresses 299, 204, and 200. If a read operation is received, that read operation can only be handled by the memory bank that currently stores the data for the address specified in the read operation. Write operations can be handled by the current location for the specified address or in any free memory bank. In FIG. 6E, the first operation (a read or write) directed toward address 201 is handled by the memory bank that currently stores the data for address 201 (memory bank B in this example). The remaining write operations cannot access memory bank B. In the example of FIG. 6E, all of the operations are directed toward addresses located in memory bank B. Thus, the additional write operations must be handled by other memory banks. In this example, the write to address 299 is handled with memory bank E1, the write to address 204 is handled with memory bank E2, and the write to address to address 200 is handled with memory bank E3. The result after handling all of the memory operations is illustrated in FIG. 6F. Algorithmic Memory System 3: Duplicated Memory Banks to Obtain 0(Read Performance (nR or 1W) The algorithmic memory blocks disclosed in the previous sections were able to handle additional write operations by writing an empty physical memory location and then changing a mapping table to associate the virtual address in write operation with the physical address used to store the data. However, that type of algorithmic memory block was unable to support more than a single read operation. Two read operations could not be supported since if two simultaneous read operations were directed to the same memory bank, a memory bank conflict would prevent the memory controller from reading and return both data values without stalling. To handle two simultaneous read operations, a simple algorithmic memory block may store two copies of every piece of data stored in the memory block. Specifically, the entire memory array could be duplicated. FIG. 7 illustrates a block diagram of a memory system wherein there is a first memory array 704 and a second memory array 705. Each memory bank is the same size and can be accessed independently. When the memory system 700 of FIG. 7 receives two read operations for data that would be stored in the same memory bank then the first read operation can access the first memory array 704 and the second read operation would access the second memory array This method of implementing a multiple read memory system can obviously be extended to handle many read operations by creating many additional copies of the entire memory array. However, without any other extensions, this duplicate memory system could only handle a single write operation at a time. Each write operation must write to all the memory arrays (both arrays 704 and 705 in FIG. 7) to keep all of the data current. This method of implementing a memory system capable of handling multiple simultaneous reads is well-known and may be implemented with many variations. However, this method is certainly not elegant. Such a full duplicate memory system would have a very low memory density since a full copy of the entire memory array is required for each additional simultaneous read operation to be handled. Thus, it would be desirable to have alternative solutions for handling simultaneous read operations. Algorithmic Memory System 4: An Additional memory Bank to Obtain 2X Read Performance (2R or IW) Instead of providing two full independent representations of every piece of data, this section discloses an algorithmic memory block that instead stores one full representation of each data item and one encoded version of each data item. The full representation of a data value is stored in a consistent location in a main memory bank. The encoded version of the data value is implemented in a manner that efficiently combines multiple data items such that only a small amount of additional memory is required to store the encoded versions of data. When such a memory system receives two simultaneous read operations requesting data that have their full representations in the same memory bank then the memory controller may retrieve the full representation of the first data item from the main memory bank and retrieve the second data item by decoding the encoded version of the second data item. To operate properly, the memory system must always be able to fetch the encoded version of the second data item without the use of the main memory bank that is being accessed to retrieve the first data item. Since this algorithmic memory block always requires a main full representation of each data item in a consistent main memory bank location, the algorithmic memory block will not be able to handle two write operations concurrently. Specifically, if two write operations are directed to memory addresses with full representations stored in the same memory bank then the two write operations will not be able to simultaneously access that main memory bank. The memory system would stall in order to execute a first write in a first cycle and a second write in a second cycle. Thus, such a memory system cannot handle two write operations simultaneously. In one embodiment, the encoded version of each data item is stored in an extra memory bank added to a multi-bank memory system. For example, each row of the extra memory bank may store an encoded value that is function which combines all of the data items from the corresponding rows of all the normal memory banks. To retrieve a single specific data item from the encoded version, the memory system would read the encoded version and process that encoded version with decode function that extracts a single specific requested data item. In one particular implementation, all of the data items from the corresponding row in the main memory banks are combined together with a logical exclusive-OR function (commonly known as an ‘XOR’ function) and stored in the extra memory bank. This extra memory bank is sometimes referred to as the “XOR bank” since it stores a logical XOR combination of all the other data items. To reverse the XOR function encoding in order to obtain a desired data item from a particular memory bank, the XOR encoded data value from one row of the XOR bank is combined (using an XOR function) with the all the data items from the same row of all the other main memory banks except for the main memory bank containing the desired data item. This operation will eliminate the data items from other memory banks that were also encoded in the same row of the XOR bank using the exclusive-OR (XOR) function thereby leaving only the desired data item. Although the disclosed embodiment operates using an XOR function, there is a general class of “erasure codes” that may be used to allow multiple data reads. Erasure codes encode a set of N data bits into a larger set of N+X bits that allow a system to recover a subset of the N data bits if that subset of data bits becomes unavailable (usually due to being lost or corrupted). Such erasure codes are commonly used in encoding data for transmission across an unreliable channel. In the disclosed memory system, a set of data bits from the same row of the memory banks can be viewed as the original N data bits and the X data bits are the data stored in the extra memory bank using the erasure code. Thus, when a subset of the N data bits become unavailable (a memory bank containing a subset of the N bits is being accessed for a simultaneous read operation), that subset of data bits can be reconstructed using X data bits in the extra memory bank and the remaining data bits from the set of N data bits. In this manner, any erasure coding system that allows the quick full reconstruction of data bits from an unavailable memory bank (a memory bank blocked due to another memory access to that memory bank) may be used to encode the data in the extra memory bank. Examples of erasure coding systems that may be used include Reed-Solomon coding, Maximum Distance Separable (MDS) codes, and Galois Fields. Some coding systems that do not guarantee the exact same data to be recovered or take too long to return a result would not be used. There may be several different encoding systems that can be used which each have properties. Some codes may require more layout area but provide faster results. The encoding system for a particular application should guarantee that data can be recovered within a prescribed maximum time period and use minimal resources. FIG. 8 illustrates a block diagram of an algorithmic memory block 800 that allows two read operations to be handled simultaneously using an extra memory bank with erasure coding. The algorithmic memory block 800 stores a first (full) data representation in the main memory bank 804 and a second (encoded) data representation in an XOR memory bank 830. Note that in the illustration of FIG. 8 the XOR memory bank 830 is only illustrated wider in order to fit the notation in the illustration. In an actual implementation, the XOR memory bank 830 would be physically the same as the other memory banks in the memory system (Bank 0, Bank 1, Bank 2, and Bank 3). As illustrated in FIG. 8, the algorithmic memory block 800 stores a full representation of data items using addresses 000 to 399 in the set of main memory banks 804. In the example of FIG. 8, each main memory bank (Bank 0 to Bank 3) is labeled with a number that is the same as the most significant digit of the memory addresses stored within that memory bank. (In FIG. 8, bank 0 is associated with addresses having ‘0’ as the most significant digit, bank 1 is associated with addresses having ‘1’ as the most significant digit, and so on.) The full data representation for each item of data is stored within the appropriate location in the main memory bank 804. Note that the XOR-based algorithmic memory block 800 does not require any virtual to physical memory mapping table in the memory controller 821 to keep track of where each piece of data currently resides. In addition to storing the full representation in the main memory banks 804, the memory controller 821 also stores a second (encoded) representation of data items in the XOR memory bank 830. In each row of the XOR memory bank 830, the memory controller 821 stores an exclusive-OR (XOR) encoded version of all the data that has been written into the corresponding row of all the main memory banks (banks 0 to 3). For example, as illustrated in FIG. 8, row 00 of the XOR memory bank 830 stores an exclusive-OR (XOR) combination of the data items from row 00 of memory banks 0, 1, 2, and 3. This is depicted in FIG. 8 as having row 00 of XOR memory bank 830 store the logical function of XOR(000,100,200,300). In the XOR-based algorithmic memory block 800 of FIG. 8, all data write operations will store information into both a row of one of the main memory banks 804 and the corresponding row of the XOR bank 830. The storing of the full representation of data into a bank of the main memory 804 is a normal write operation that uses the address specified in the write operation. The storing of the encoded representation into the corresponding row in the XOR bank 830 must first create a new encoded value by encoding the new data value with existing data (either data from the other memory banks or the current encoded value in the XOR bank 830) and then store that new encoded value into XOR bank 830. Different methods may be used to create the new encoded value to be stored into the corresponding row in the XOR bank 830. In the embodiment of FIG. 8, the system has N main memory banks for storing full representations of data and one XOR bank 830 for storing an encoded version. One method of creating new encoded value to store into the corresponding location in the XOR bank 830 is to create an entirely new encoded value that does not use the existing encoded value already stored within the XOR bank 830. For example, the memory controller 821 could read all the data currently stored in the same row of other memory banks, combine those existing data values together with the new data value from the write operation using an XOR operation, and then write the newly encoded value into the XOR bank 830. Such an implementation would access every memory bank on each write operation. To implement that method, the memory controller 821 would write the new data value into the target memory bank designated by the write address while simultaneously updating the corresponding XOR bank 830 entry with a new XOR encoded value. Specifically, the memory controller 821 would read the corresponding row of all the other memory banks to obtain their current data values, combine those data values from the other memory banks with the new data value using an XOR function to create a new XOR encoded value, and then write that new XOR encoded value into the XOR bank 830. In summary, to write a new data value into the memory system, the system may write the new data value into one of the N main memory banks, read N-1 data values (from the other memory banks), and then write one encoded data value into the XOR bank. This method allows the system to be constructed with simple single port memory cells since there is only a single memory operation performed on each memory location. Specifically, there is a single write to the addressed memory row of the addressed memory bank, there is a single read from the corresponding row of all the other main memory banks, and there is a single write to the corresponding row of the XOR bank 830 to write the new encoded XOR value. Examples of the operation of the XOR based algorithmic memory block of FIG. 8 are set forth with reference to FIGS. 9A to 9D. FIGS. 9A and 9B illustrate how the memory system stores a single new data value into the XOR based algorithmic memory block. FIGS. 9C and 9D illustrate how the memory system may simultaneously respond to two different read operations. FIG. 9A illustrates an XOR based memory system that has received a single write request to store data into address 302. To complete the write request, the memory controller 921 must write the data value associated with the write request into address 302 in the main memory banks and must write an encoded XOR version into the XOR Bank 930. In the example presented in FIGS. 9A and 9B, the memory controller 921 will created the encoded XOR version for the XOR Bank 930 without reference to the currently existing encoded XOR version for the XOR Bank 930. To respond to the write request, the memory controller 921 reads data values 002, 102, and 202 (in memory banks 0, 1, and 2 respectively) to obtain the other data values in the same 02 row as address 302. The data value for the write operation may simultaneously be stored into address 302. In FIG. 9A, the reads of data from addresses 002, 102, and 202 are depicted with italics and the write of the new data into address 302 is illustrated with underlining. The memory controller 921 must then update the encoded XOR value for the XOR Bank 930. The memory controller 921 combines the new data value for address 302 with the data just read from addresses 002, 102, and 202 using an XOR operation (illustrated symbolically as ⊕) to generate a new encoded XOR representation as illustrated in FIG. 9A. The newly encoded version is stored into the corresponding row (row 02) of the XOR Bank 930. The final state after processing the write request address to location 302 is illustrated in FIG. 9B. The primary advantage of the XOR-based algorithmic memory block 800 of FIG. 8 is the ability to handle two simultaneous read operations. An example of concurrently reading of two pieces of data from addresses that reside in the same main memory bank is presented with reference to FIGS. 9C and 9D. In FIG. 9C, an XOR-based algorithmic memory block receives simultaneous read operations for addresses 103 and 101 that are both located in memory block 1. Since both addresses are located in the same memory block, this causes a potential memory bank conflict. (Note that if the addresses from the two concurrent read operations targeted addresses in two different memory banks, the two read operations could easily be handled by the two different independent memory banks concurrently since no memory bank conflict occurs.) To handle both read operations without a memory bank conflict, one read request will be serviced using the main representation in memory bank 1 and the other read request will be serviced using the encoded XOR representation in the corresponding row of XOR bank 830 (with the help of data read from the corresponding row of memory banks 0, 2, and 3). Referring to FIG. 9C, the memory controller 921 reads five different data values to handle the two simultaneous read requests. Specifically, the memory controller 921 reads from: 1) Address 103 from row 03 of main memory bank 1; 2) Address 001 from the 01 row of main memory bank 0; 3) Address 201 from the 01 row of main memory bank 2; 4) Address 301 from the 01 row of main memory bank 3; and 5) The encoded XOR value from row 01 in the XOR bank 930 Note that all five of these read operations all access different memory banks such that there is no memory bank conflict between any of these read operations. Furthermore, note that every memory bank in the memory system is accessed such that the technique of this XOR-based algorithmic memory block may consume more power than techniques used by other types of algorithmic memory blocks. However, the system will only need to read from every memory bank when there is a memory bank conflict between the two requested addresses. If the read requests were directed toward data in two different memory banks, then the memory controller 921 would only read from those two different memory banks. FIG. 9D illustrates how the memory controller 921 then responds with the two requested data values using the data from these five read operations. The memory controller 921 responds with the data read from address 103 to handle the read operation for address 103. To handle the read operation for address 103, the memory controller 921 performs an XOR operation combining the encoded XOR value from row 01 in the XOR bank 930 with the data read from addresses 001, 201, and 301 from row 01 in the main memory banks. This removes the effect of those data values from the encoded XOR value in row 01 the XOR bank 930 thereby leaving only the data value from address 101. Thus, FIG. 9E illustrates the memory controller 921 responding with the data values for addresses 103 and 101. One nice feature of the XOR-based algorithmic memory block is that no mapping table is required within the memory controller. This eliminates the need for mapping table memory and sophisticated control logic required read the mapping table and to update the mapping table as necessary. However, the XOR-based algorithmic memory block is not ideal for wide data values since parallel data paths must be routed from all of the different memory banks (including the XOR bank) back to the memory controller in order to implement the XOR-based algorithmic memory block. Algorithmic Memory System 5: Alternative XOR Bank Implementations to Obtain 2X Performance (2R or 1W), (2R or 1/2W) and (1R and 1W) The algorithmic memory block of FIG. 8 allows two read operations to be handled simultaneously. FIG. 9A to 9D illustrated one particular method of implementing such an algorithmic memory block. However, many variations of the algorithmic memory block of FIG. 8 may be implemented that each provide different features. This section discloses several variations of the algorithmic memory block of FIG. 8 that can handle two different read operations simultaneously. Referring back to FIGS. 9C and 9D, the memory controller 921 had to read the entire 01 row of the memory bank (with the exception of address 101 that could not be read due a memory bank conflict) in order to respond to the read request for address 101. Using the XOR function allowed the data value for address 101 to be decoded from the XOR bank 930. Since the other data in the same 01 row is already being read, the system of FIGS. 9C and 9D may be used to implement an algorithmic memory block that implements a “row read” that provides the data from an entire data row in the main memory bank. Such an algorithmic memory block could respond to both a normal read request and a row read request simultaneously. FIGS. 9E and 9F illustrate a memory system that implements the row read feature. As illustrated in FIG. 9E, the memory system receives a read request for address 103 and a row read request for the entire memory row 01 (address 001, 101, 201, and 301). The memory controller 921 reads the data value for address 103 read directly out of the main memory bank. The memory controller 921 also reads the entire row 01 of the memory system with the exception of location 101 since reading address 101 would conflict with the reading of address 103 since both are stored in bank 1. Then, in FIG. 9F, the memory controller 921 outputs the data read from addresses 103, 001, 201, and 301 from the direct read operations and the data from address 101 as decoded from the row 01 XOR bank entry in the same manner as set forth in FIG. 9D. As described in FIGS. 9A and 9B, the use of erasure codes increases the speed of reads from memory; however this had a consequence on write performance. FIGS. 9A and 9B illustrated one possible method of encoding the second representation of data (the XOR bank entry) that must read all of the other data in the same row before adding a new data item to the second representation (the XOR bank entry). In what follows, a different method to create a new or second representation of a data item is described. For example, one implementation may read the existing second representation (the XOR bank entry), update that second representation with new data item, and then write-back the newly updated second representation. Referring to FIG. 8, the memory controller 821 may perform this method by first reading both the current data value from the target address in the main memory bank 804 of a write request and the current encoded value stored within the corresponding row of the XOR bank 830. Next, the memory controller 821 removes the representation of that current data from the encoded version of the XOR bank 830 by XORing that current data value with the current encoded value from the XOR bank 830. After the old data has been removed from the encoded value, the memory controller 821 then creates a new encoded XOR value by XORing the new data value with the encoded value that has had the old data removed. Finally, the memory controller 821 may then write the new data value into the target address in the main memory bank and write the newly encoded XOR value into corresponding row of the XOR bank 830. To store a new data item in this manner, the memory system must perform the following four memory operations: (1) read an old data value from one of the N main memory banks, (2) write a new data value into that main memory bank, (3) read the old encoded value from the XOR bank, and (4) write a new encoded data value back into the XOR bank. In order to perform all of these memory operations in a single cycle, both the main memory banks 804 and the XOR bank 830 must be implemented with two-port memory (one read port and one write port). The main memory banks must be two-port memory such that the target address in the main memory bank 804 can be read from (to obtain the old data value that must be removed from the existing encoded value in the XOR bank 830) and written to (to store the new data value) within a single cycle. Similarly, the XOR bank 830 must be implemented with two port memory so it can be read from (to obtain the existing encoded XOR data value) and written to (to write the updated encoded XOR value) within a single cycle. The use of two-port memory for both the main memory banks 804 and the XOR bank 830 in this method may make this method more costly to implement. However, some memory cell circuit designs are able to implement two-port memory cells with only a small increase in cost. FIGS. 9G and 9H illustrate the alternate method of updating the second representation of data using the existing representation. In the example of FIGS. 9G and 9H, the current encoded XOR representation stored in the XOR Bank 930 is used to generate a new encoded XOR representation that is written back into XOR Bank 930. Referring to FIG. 9G, the memory system receives a write to address 312. As illustrated by italics in FIG. 9G, memory controller 921 responds to the write to address 302 by reading the existing data value in address 302 and reading the 02 row entry of the XOR Bank 930 that contains the function XOR(002,102,202,302). This data will be used to create the new encoded XOR value for the row 02 entry the XOR bank 930. Next, as illustrated in FIG. 9H, the memory controller 921 then generates a new encoded value for the row by XORing the old data value of address 302 with the current encoded value (in order to remove the old data associated with address 302) and also the new data value being written to address 302 (in order to add the new data for address 302 into the encoded XOR value). Finally, the memory controller 921 writes the new data value into address location 302 and writes the newly created encoded XOR value for the row 02 entry of the XOR bank 930. The final state after the write to address location 302 is illustrated in FIG. 9H. In the write operation disclosed in FIGS. 9G and 9H, there were four internal memory accesses (two read operations and two write operations) to handle a single write request received. The number of memory accesses is independent of the number of banks used in the memory sub-system. In the write operation disclosed FIGS. 9A and 9B, the system used five memory accesses (three read operations and two write operations). The number of memory read accesses is dependent on the number of banks used in the memory sub-system, and in implementations with greater numbers of memory banks, the system of FIGS. 9A and 9B will use even more memory accesses since the corresponding row in every memory bank must be read to create the updated second representation. Thus, the second method of handling write operations as disclosed in FIGS. 9G and 9H consumes less power than the original method of handling write operations as disclosed in FIGS. 9A and 9B. The example of FIGS. 9G and 9H operates in a single memory cycle by using two-port memory cells. For systems that must handle a write operation in every cycle, this type of implementation will work but may be costly due to the two-port memory that must be implemented in both the main memory bank and the XOR bank 930. However, if an application does not need to be able to handle a new write operation every cycle then the system may be allowed to use less expensive single port memory. For example, a memory system may use two cycles to complete each write request while using only one cycle to handle two simultaneous read requests. Such a memory system may be referred to as a two-read or half-write (2R or 1/2W) algorithmic memory block two read operations can be handled in a single cycle but only half of a write operation can be handled in a single write cycle. (Two memory cycles would be required to compete a full write operation.) FIGS. 9I and 9J illustrates how such a two-read or half-write algorithmic memory block may handle a write operation into address 302. FIG. 9I illustrates a first memory cycle wherein the memory controller 921 reads the existing data value from address 302 and the existing encoded XOR representation from the XOR bank 930, FIG. 9J illustrates a second memory cycle wherein the memory controller 921 writes the new data value into address 302 and writes an updated encoded XOR representation into the 02 row entry of the XOR bank 930. In the memory systems disclosed in FIGS. 9G to 9H, the memory controller 921 accessed only a single memory bank from the set of main memory banks when writing a new data value into the memory system. Specifically, the system disclosed with reference to FIGS. 9G to 9H only accessed the target memory location (address 302 in the examples) in the main memory bank. Since the other main memory banks were not touched, a read operation could be added such that a memory system that supports one read and one write operation per cycle (in addition to alternatively supporting two read operations per cycle) may be constructed. However, this embodiment requires a three port memory to implement the XOR 5 bank. FIGS. 9K and 9L illustrate an XOR-based algorithmic memory block that handles one write operation and one read operation. As illustrated in FIG. 9I, the memory controller 921 receives a write to address 302 and a read from address 304. To handle the write operation, the memory controller 921 must first access address 302 and the 02 row entry XOR bank 930. The memory controller 921 first reads original data value in address 302 (the data value in address 302 before this write request was received) and then may write the new data into address 302. The memory controller 921 then combines the original data value from address 302 with the 02 row entry XOR bank 930 to remove the original address 302 data. Finally, the memory controller 921 XORs in the new data value from the write operation and then writes the result back into the 02 row entry XOR bank 930. To simultaneously handle the request to read address 304, the memory controller 921 cannot directly access memory bank 3 since the write to address 302 is already using memory bank 3. Instead, the memory controller 921 reads the 04 row entries from the other memory banks (addresses 004, 104, and 204) and the row 04 entry in the XOR bank 930 that contains XOR(004,104,204,304). Note that this reading of the 04 entry in the XOR bank 930 is occurring while the row 02 entry from the XOR Bank 930 is also being read such that more than one row of the XOR Bank 930 must be independently accessible during the same clock cycle. Thus, the XOR Bank 930 needs to be implemented with three port memory as depicted. The memory controller 921 then XORs together the data values from addresses 004, 104, and 204 with the XOR(004,104,204,304) entry from the XOR Bank 930 to retrieve the data value from address 304. Algorithmic Memory System 6: Additional XOR Banks to Obtain NX Read Performance (NR or 1W) The XOR-based algorithmic memory block disclosed in the previous sections may be expanded to handle more than just two simultaneous read operations. The technique of expanding the XOR-based algorithmic memory block involves adding additional XOR memory banks that cover the main memory banks with various different disjoint sets. In this manner, the multiple-read XOR-based algorithmic memory block will respond to multiple read operations to the same memory bank with one data value directly read from the addressed memory bank and multiple other data values created by combining data values read from the other memory banks with XOR memory banks. FIG. 10 illustrates a conceptual diagram of a XOR-based algorithmic memory block 1000 designed to handle four simultaneous read operations. The XOR-based algorithmic memory block 1000 has a main memory bank set 1004 that includes sixteen independent memory banks labelled B01 to B16. Each of the memory banks B01 to B16 can be independently accessed simultaneously. The XOR-based algorithmic memory block 1000 also includes a set of XOR memory banks 1030. Each memory bank in the main memory bank set 1004 is represented within three of the XOR memory banks 1030 such that data within each memory bank can be accessed four different ways: a direct read to the memory bank within the main memory bank set 1004 and an XOR decoding of the three different XOR memory banks that contain an alternate representation of the data. Only one data item can be written into the XOR-based algorithmic memory block 1000 at a time. The writing of a new data item requires writing the new data value into the target address of main memory bank for that item (one of the memory banks 01 to 16 in main memory bank set 1004) and updating the three XOR memory banks within the XOR memory banks 1030 that also contain a representation of the new data item. The methods that may be used to write a data item into the XOR-based algorithmic memory block 1000 are the same as the methods disclosed in the previous two sections of this document. FIGS. 11A to 11E illustrate how four data items located in the same memory bank (bank B11 in this example) may be read simultaneously by accessing one main data representation within bank B11 and three encoded data representations from XOR banks 1030. Initially, the XOR-based algorithmic memory block receives a request for four data items that all reside within main memory bank B11. The four addresses within memory bank B11 may be designated BMA, B11.B, B11.C, and B11.D wherein the postfix letter specifies an address within memory bank B11. Note that all of the memory banks are of the same size and may be addressed internally with the same A, B, C, etc. style addressing. A first requested data item, B11.A, may be read directly from the B11 memory bank as illustrated in FIG. 11A. The other three data items (B1LB, B11.C, and B11.D) cannot be read directly from memory bank B11 since this would cause a memory bank conflict. FIG. 11B illustrates how a second data item, B11.B, may be accessed by using a first XOR bank 1132 that contains an encoded representation of the B11 memory bank and thus contains a representation of the data at address B 11.8. The requested B data address from XOR bank 1132 is XORed with the data from the corresponding B address location in the other memory banks represented by the XOR bank 1132. In this example, the B address location from a first XOR bank 1132 containing a combination of entries from the B09, B10, B11, and B12 memory banks is combined with data items retrieved from the corresponding B address memory location in main memory banks 809, B10, and B12 in order to extract requested data item B11.B. FIG. 11C illustrates how a third data item, B11.C, may be accessed by using a second XOR bank 1133 that also contains a representation of the 811 memory bank and thus contains the requested data at address B11.C. In addition to the data from the desired B11 bank, the second XOR bank 1133 contains a representation of data from other memory banks (banks B03, B07, and B15). Note that these data banks are all different than the data banks represented in the first XOR bank 1133 (which had banks B09, B10, and B12) such that the corresponding other memory banks (banks B03, B07, and B15) can be accessed without a memory bank conflict. In this example, a C address from a second XOR bank 1133 containing a combination of entries from the B03, B07, 811, and B15 memory banks is combined with data items retrieved from the corresponding C address in main memory banks B03, B07, and B15 to reconstruct the desired data item 811.C. FIG. 11D illustrates all of the memory banks that have been accessed to obtain the first three data items (B11.A, B11.B, and B11.C). Specifically, FIG. 11D illustrates all of the memory banks that were read in the memory reads disclosed with reference to FIG. 11A, FIG. 11B, and FIG. 11C. As illustrated in FIG. 11D, the only memory bank that contains a representation of data from the B11 bank and has not been read yet is XOR bank 1134 in the lower right corner. XOR bank 1134 contains an XOR combination of all the data values in all of the main memory banks B01 to B16. To retrieve the last requested data value (the data from address B11.D), the memory system will XOR together the D memory address from all of the memory banks not yet accessed as illustrated in FIG. 11E. To illustrate why this works, consider the horizontal row of memory banks 1139. With reference to FIG. 11B, the data values at address B in memory banks B09, B10, and 812 were combined with the value at address B in XOR bank 1132 to obtain the desired data value B11.B. (B11=XOR(B09, B10, B12, XOR bank 1132) If those same memory banks could be read again, the final B11.D data value could be obtained in the same manner. Although those memory banks cannot be read again (due to memory bank conflict), the desired contents from those memory banks can be reconstructed using memory banks that have not been read yet. The following equations illustrate how data values from all the other memory banks in the same row as B11 may be reconstructed: B09=XOR (B01, B05, B13, XOR bank 1135) B10=XOR (B02, B06, B14, XOR bank 1136) B12=XOR (804, B08, B16, XOR bank 1137) XOR bank 1132=XOR (XOR bank 1151, XOR bank 1152, XOR bank 1153, XOR bank 1134) Thus, when data values from those four memory banks are combined, the result is the same value from B11. Note that the previous four equations list all of the memory banks highlighted in FIG. 11E. Therefore, to reconstruct the B11.D value, the address D location from all of the memory banks highlighted in FIG. 11E may be XORed together to obtain the data from address B11.D. The example set forth in FIGS. 11A to 11E illustrates the worst case scenario where all of the read requests are directed toward the same memory bank (memory bank B11 in this example) thus creating a potential four-way memory conflict. When the memory requests are spread out among different memory banks, the system does not have to rely so much on the XOR banks. For example, FIG. 11C illustrates how a second data item, 811.C, needed to be accessed using an XOR bank 1133 and all of the memory banks in a vertical column with memory bank B11. If the second memory request had instead been directed to an address B07.0 located in memory bank B07 then XOR bank 1133 would not be needed to obtain the B07.0 value. Specifically, FIG. 11F illustrates how data item B07.0 can be read directly out of memory bank 07 since there is no memory bank conflict with bank B11. Thus, the decoding of a second representation as illustrated FIG. 11C. Algorithmic Memory System 7: An Additional XOR Bank to obtain 2X Performance (1 Update) The XOR-bank based methodology disclosed in the preceding sections can also be used to implement a specialized “1 Update” memory. An “Update” operation is a special type of memory operation consisting of a read operation and a simultaneous write operation wherein the write operation writes to a memory location that was read from a few memory cycles earlier. The read operation will be followed by a corresponding write operation a few cycle later. This is generally referred to as “read-modify-write” operation within the field of computer science. An update type of memory operation is frequently used when keeping track of statistics or state. For example, a network router that is handling many different communication lines, connections, sessions, data packet queues, and other data abstractions may need to keep track of various statistics for each data abstraction. For example, the network router may keep track of the number of packets serviced, the number of packets dropped, packet types, the total amount of data carried for a particular session, etc. Similarly, read-modify-write operations are also very useful for maintaining state values such as TCP connection state, policer state, and other system states. For each of these statistics and state values maintained, the network router may periodically read the current value from memory, modify the current value, and then write the updated statistic or state value back into memory. If a large number of statistics must be kept track of, a specialized statistics memory could be used to optimize such statistic handling. Since an update operation involves reading a data value from memory and then writing back an updated data value to same memory location in the near future, the memory system may take advantage of the fact that it can expect a later write operation to be received. For example, after the memory read stage of an update operation, the memory controller may carry forward state information from that memory read operation such that the carried-forward state information will be available when the later write operation is received. To optimize the handling of the stored carried-forward information, the carried-forward information may be carried along a pipeline in an internal shift register that is synchronized with the related read and write operations of the read-modify-write. Referring back to the XOR-based algorithmic memory block of FIG. 8, the XOR-based algorithmic memory block must update both the main representation in the addressed memory location in the main memory bank area 804 and the secondary (encoded) representation in the appropriate row in the XOR bank 830 for each write operation. To update the XOR bank 830 during a write operation, the memory controller 821 requires either all the other data values from the same row of the XOR bank 830 (as disclosed with reference to FIGS. 9A and 9B) or the contents of the appropriate row in the XOR bank 830 with the old data value removed (as disclosed with reference to FIGS. 9G to 9J). In an update memory system, this additional data needed to create the encoded representation may be fetched during the read operation, carried forward in a pipeline or shift register, and then used when the later write operation is received. There are a few different cases that must be considered with an update memory system. Each case will be illustrated with an example. FIG. 12A illustrates a first case to consider wherein a read operation and a write-back operation (from two different update operations a few cycles apart) are being handled in the same cycle both target the same address. This is a potential a memory bank conflict since the same address is obviously within the same memory bank. To handle the read operation, the memory controller 1221 reads the 02 row of the XOR bank 1230 and the other data values in the 02 row (addresses 002, 102, and 202) and then combines those values to retrieve the current data value of address 302. Specifically, the memory controller 1221 combines XOR(002,102,202,302) with the data values from addresses 002, 102, and 202 to obtain the requested data from address 302. This is illustrated in FIG. 12B wherein the memory controller 1221 calculates the value of XOR(002,102,202,302)⊕ 002 ⊕ 102 ⊕ 202 to return the data for address 302. The memory controller 1221 handles the write operation using state data that has been carried forward from an earlier read operation to the same address. Specifically, the state information that is carried forward is the old data value for the target address and the value of the associated row of the XOR bank 1230. Thus, for the example of FIG. 12A wherein the write is directed to address 302, the memory controller 1221 would carry forward the old data value for address 302 and the 02 row entry of the XOR bank 1230 (which is XOR(002,102,202,302)). To create the new entry for the XOR bank 1230, the memory controller 1221 XORs together the carried-forward old data value for address 302, the carried forward XOR(002,102,202,302) value, and the new data value for address 302 to create a new XOR(002,102,202,302) value. The memory controller 1221 writes this newly created XOR(002,102,202,302) value into the 02 row entry of the XOR bank 1230 as illustrated by line 1228 in FIG. 12B. The memory controller 1221 also writes new data value for address 302 directly into the address 302 location in the main memory bank. Thus, to handle the write into address 302, the memory controller only needs to perform two write operations: a write of the primary representation into the address 302 location and a write of the secondary (encoded) representation of the address 302 data into the 02 row entry of the XOR bank 1230. Note that in the example of FIG. 12A, the XOR(002,102,202,302) value that is carried forward in the pipeline from the read operation may change before it is used with a subsequent write operation. For example, between the time the data value for address 302 was read and the time that a new data is written into address 302, the data value for address 102 may have changed. If this occurs, then simply using the XOR(002,102,202,302) value from when the original read occurred would result in an outdated value for address 102 within the XOR(002,102,202,302) value. To prevent this situation, the pipeline that carries data forward must propagate changed data values to later pipeline stages such that the data remains coherent. Thus, when the write operation changes a data value that is represented in later pipeline station (such an XOR bank entry being carried forward), that data value (such as an XOR bank entry) must be updated to reflect the new data value. There are variations of implementing the data carry forward system. For example, in some implementations, the memory controller may carry forward the data values for all of the memory bank entries in the same row instead of carrying forward the XOR bank entry. In the case of the read operation to address 302 illustrated in FIG. 12A, the memory controller 1221 could carry forward the data values for addresses 002, 102, and 202. Then, to create the new 02 row entry for the XOR bank 1230 at the time of the write-back, the memory controller 1221 would then XOR together the new data value for address 302 with the carried-forward data values for addresses 002, 102, and 202. This is illustrated in FIG. 1213 with line 1229. Note that if the other data values (002, 102, or 202) changed with a write before the write-back for address 302 occurs then those data values being carried in the pipeline should also be changed. FIGS. 12C and 12D illustrates a second case to consider wherein a read to address 104 and a write-back operation to address 302 target different addresses in different memory banks. In the case of FIGS. 12C and 12D, the write to address 302 is handled in the same manner. Specifically, the memory controller writes the new data for address 302 directly into address 302 and uses carry-forward data to create a new row 02 entry for the XOR bank 1230. As illustrated in FIG. 12D, the row 02 entry for the XOR bank 1230 can be created using a carried forward 02 row XOR bank entry as illustrated by line 1228 or the row 02 entry for the XOR bank 1230 can be created using carried-forward data values from the same memory bank row (data from addresses 002, 102, and 202) as depicted by line 1229. The memory controller 1221 can handle the read from address 104 by simply reading the data value directly from address 104 and responding with the data as depicted in FIG. 12D. However, the memory controller 1221 will also access other information from the 04 row to obtain needed carry-forward information. In an embodiment that carries the XOR bank entry value, the memory controller 1221 would only accesses the row 04 entry of the XOR bank 1230 to obtain the XOR(004,104,204,304) value. In an embodiment that carries the data values from the other memory banks forward, the memory controller 1221 would also read the 004 and 204 data values. The memory controller 1221 would calculate the data value for address 304 by combining the XOR(004,104,204,304) value with the data values of addresses 004, 104, and 204 with an XOR operation. FIGS. 12E and 12F illustrates a third case wherein a read to address 301 and a write-back operation to address 302 target different addresses in the same memory bank. In the case of FIGS. 12E and 12F, the write to address 302 is handled with the carry-forward state information from the earlier read operation in the same manner as set forth in the previous two cases. To handle the read operation, the memory controller 1221 reads the row 01 entry of the XOR bank 1230 and the other data values from the 01 row (addresses 001, 101, and 201). The memory controller 1221 generates the requested address 301 data value by XORing together the row 01 entry of the XOR bank 1230 with data values from addresses 001, 101, and 201 as illustrated in FIG. 12F. The memory controller 1221 then carries the row 01 entry from the XOR bank 1230 and/or the data values from addresses 001, 101, and 201 for use with the subsequent write-back operation. Algorithmic Memory System 8: An Additional XOR Bank to Obtain 2X performance (1R and 1W) But Does Not Allow Overwrites In the XOR-based algorithmic memory block disclosed in FIGS. 9K and 9L that was able to handle a simultaneous read operation and write operation, the memory system used two-memory cells to read an existing data value from a main memory bank location before writing in the new data value. The two-port memory needed in the main memory banks that would allow such a feature is uses more lay out area and thus reduces the bit density of the memory system. It would be desirable to have another method of being able to perform a simultaneous read and write without requiring two-port memory. FIG. 13 discloses such an XOR-based algorithmic memory block that can handle a simultaneous read operation and write operation using single port memory in the main memory banks. However, the XOR-based algorithmic memory block 1300 of FIG. 13 does impose a specific use restriction on the memory system that must be followed as will be set forth below. As illustrated in FIG. 13, a set of addresses 000 to 399 are stored into a set of main memory banks 1304 wherein each memory bank is associated with addresses having a particular digit of the memory address. As with the previous XOR-based system, the XOR-based algorithmic memory block 1300 also includes an XOR memory bank 1330 that stores an exclusive-OR encoded version of all the data that has been written into the corresponding rows of all the main memory banks. However, the XOR-based algorithmic memory block 1300 also includes a new data structure, a small XOR bank contents table 1333. The XOR bank contents table 1333 keeps track of which addresses in the main memory bank area 1304 currently have valid data represented in the XOR bank 1620. Thus, the XOR bank contents table 1333 is a memory array that has the same number of individually addressable elements as the main memory banks 1304 but only contains a single bit entry for each element in the memory array. To simplify the task of keeping the XOR memory bank 1330 updated, the XOR-based algorithmic memory block 1300 of FIG. 13 imposes a restriction that forbids a user from writing new data into an address if the memory system already has valid data stored in that particular memory address. With this usage restriction, when a new write operation is received, the memory controller 1321 does not need to remove the participation of the old data from the XOR memory bank 1330 when a new write operation is received since there is no old data in the XOR memory bank 1330 for that address. To handle a write operation, the memory controller 1321 merely needs to write the new data into the target address in the main memory array 1304 and update the representation in the XOR memory bank 1330 with the new data. Since there not any valid data from that target address currently represented in the corresponding row entry in the XOR memory bank 1330, the memory controller 1321 can simply read the appropriate XOR memory bank entry, XOR in the new data value, and then write that updated encoded representation back into XOR memory bank entry. Note that a four-port memory is used to implement the XOR bank 1330 since a read and a write to the same memory bank will both require access to the XOR bank 1330, however the main memory banks 1304 will not require multi-port memory circuits. To allow target addresses to be cleared such that new data can be written, the XOR-based algorithmic memory block 1300 implements two different types of read operations: A normal read operation and a read-clear operation. The normal read operation simple reads the data and provides the data to the requestor as done in the previous implementations. The read-clear operation reads the data, provides the data to the requestor, and then removes the representation of that data from the XOR bank 1330. To implement such different read operations, the memory device could use a signal line to the memory device that specifies if a read operation is a normal read operation or a read-clear operation. The read-clear operation reads the requested data, removes the representation of that data from the corresponding row of the XOR bank 1330, and then clears the associated flag in the XOR bank contents table 1333 to indicate that the XOR bank 1330 no longer contains a representation of the data for that particular memory address. If the XOR-based algorithmic memory block 1300 receives a read operation for a target address that is marked in the XOR bank contents table 1333 as not containing valid data, then the memory controller 1321 will indicate a memory fault since it cannot always provide valid data in such instances. This case should never happen since if an address is not represented in the XOR bank 1330 then that address must have received a “read-clear” operation earlier or never had valid data stored in it. Thus, a properly designed system should not be reading from that memory address since the memory location will only contain a junk value. When a read request (either normal or read-clear) and a write request are received which do not cause a memory bank conflict occurs, then the read request and write operations can occur simultaneously in the two independent main memory banks. However, if the read operation is a read-clear operation, then the read-clear operation and the write operation will both need to access the XOR bank 1330. As set forth above, the write operation must always access the XOR bank 1330 in order to add the XOR encoded data into the XOR bank 1330. When the read operation is a read-clear operation then the read-clear operation will also have to access the XOR bank 1330 to remove the XOR representation of the data from the XOR bank 1330. Since both the read operation and the write operation may need read, modify, and write the XOR bank 1330; the XOR bank must support two read operations and two write operations in a single memory cycle. Thus, the XOR bank 1330 may need to be a 4-ported memory device. When a read and write operation both address data values in the same main memory bank then a potential memory bank conflict does occur. To handle this, the memory write operation is given priority to access the memory bank in the main memory 1304 since it must write the new data into that address. (This is referred to as an “inverted XOR” operation, since the read is done indirectly using the rest of the memory banks and the XOR bank, rather than directly from the memory bank; even though the memory bank has no read to read conflicts.) In addition, the write operation must also update the corresponding location in the XOR bank 1330. The memory read operation (which cannot access the same bank in the main memory 1304 that the write operation is accessing) is handled by retrieving the corresponding XOR coded version from the XOR bank 1330. Specifically, the memory controller reads the appropriate row entry from the XOR bank 1330, reads the data from the corresponding row in the other memory banks that have valid data encoded in the entry from the XOR bank 1330, and then decodes the XOR coded version to obtain the requested data. Note that the XOR bank contents table 1333 is used to select only those memory banks that currently have valid data in the corresponding row of the XOR bank 1330. If this is a normal read for this memory location, then the corresponding location in the XOR bank 1330 may remain unchanged. However, if this is a read-clear operation, then the memory controller 1321 must write back an XOR encoded version that only contains the data from the other memory banks that still have valid data in that row. Examples of the operation of this particular XOR-based algorithmic memory block 1300 are set forth with reference to FIGS. 14A to 14F. FIG. 14A illustrates the memory system in an empty initial state. The memory system depicted in FIG. 14A must receive at least one write operation before it receives any read operations. FIG. 14A depicts the memory system receiving first write operation into the memory system addressed to address location 302. The memory controller 1421 writes the data into memory location 302 in the main memory and XORs the data into the same row of the XOR bank. Since the XOR bank 1430 was empty, the 02 row in the XOR bank 1430 will end up containing the same data that was written to address 302. The memory controller 1421 then updates the XOR Bank contents table 1433 to indicate that the 02 row of the XOR bank 1430 now contains valid data from main memory bank 3 (XOR bank 1430 now contains valid data for address 302). The final state after the write to address location 302 is illustrated in FIG. 14B. FIG. 14C illustrates the memory system with the state from FIG. 14B receiving a subsequent write to address 102. The data is written into the 102 location of the main memory and the XOR bank 1430 is also updated. Specifically, row 02 of the XOR bank 1430 is read, combined with the new data written to address 102 using an XOR operation, and then written back into row 02 of XOR bank 1430. The XOR Bank contents table 1433 is also updated to reflect that row 02 of the XOR bank 1430 now contains both data from bank 1 and bank 3.The final state of the XOR-based algorithmic memory block after the write to address 102 is illustrated in FIG. 14D. The XOR-based algorithmic memory block will continue to fill up in this manner. FIG. 14E illustrates an example state of the memory system after more data has been added. The system of FIG. 14E may then receive a write to address 100 and a read from address 104 simultaneously as illustrated. In this inverted XOR system, the write operation is given priority and the data associated with the write operation is written into address 100 in the main memory bank (as indicated by the underlined 100 in the main memory bank). To update the XOR bank 1430, the memory controller 1421 reads the 00 row from the XOR bank 1430, XORs the data value written to address 100, and then writes the result back to the 00 row of the XOR bank 1430. Finally, the XOR bank contents table 1433 must also be updated. The memory controller 1421 sets the bit in the XOR bank contents table 1433 to indicate that the row 00 of the XOR bank 1430 now also contains data from memory bank 1 (address 100 now has valid data in the XOR bank 1430). The read from address 104 cannot handled by reading the data directly from address 104 in the main memory due to a bank conflict with the write to location 100. So the read must be handled using the XOR bank 1430 and the other main memory banks. The memory controller first reads row 04 of the XOR bank contents table 1433 to identify which main memory banks have data represented in row 04 of the XOR bank 1430. Row 04 of the XOR bank contents table 1433 specifies that banks 1, 2, and 3 (addresses 104, 204, and 304) all have data XORed in row 04 of the XOR bank 1730. At this point, if the row 04 entry of the XOR bank contents table 1433 had indicated that address 104 did not contain valid data then the memory system should issue a memory fault response since the requestor is requesting data from an address that does not contain any valid data. But in this situation, the XOR bank contents table 1433 indicates that address 104 does have valid data represented in row 04 of the XOR bank 1730. To retrieve the data for address 104, the memory controller 1421 reads row 04 of the XOR bank 1430 and the data values from the other banks (banks 2 and 3) that have data represented in row 04 of the XOR bank 1430. In this case banks 2 and 3 have valid data in row 04 of the XOR bank 1430 such that the memory controller 1421 reads the data in address 204, the data in address 304, and row 04 of XOR bank 1430. The data values read from these three locations are XORed together to obtain the original data from address 104 that is used to respond to the read request. If the read operation was a normal read operation, then the read operation would be complete at this point. If the read operation was instead a read-clear operation, then the memory controller 1421 needs to remove the data associated with address 104 from the XOR bank 1430. FIG. 14G illustrates the effect of such a read-clear operation. The memory controller 1421 may perform this by XORing the data value for address 104 with the original value read from row 04 of the XOR bank XR30 to remove the data associated with address 104 and then writing that value back to the XOR bank 1430. The memory controller 1421 must also clear the bit in address 104 location in the XOR bank contents table 1433 to indicate that the data from address 104 is no longer represented in the XOR bank 1430. The final result after the write to address 100 and a read-clear operation of FIG. 14E is the state illustrated in FIG. 14G. As set forth above, the memory controller always removes data from the XOR bank after a read-clear operation (whether the data is read from the main memory bank or the XOR bank) such that a subsequent write operation can easily update the encoded XOR representation in the XOR bank without needing to remove old data. In an alternate embodiment there is only a read-clear operation such that the memory controller removes the representation from the XOR bank after every read operation. Such an implementation is referred to as a “read once” memory system since each data item can only be read once. The XOR system disclosed with reference to FIGS. 13 to 14G has features that make it advantageous in some applications but less than ideal in other applications. The fact that normal single port memory can be used to implement the main memory bank is very important. However, this comes at the cost of requiring a user to issue a read-clear operation before a subsequent write may be received for that address. However, this is not a difficult restriction to follow. As with the other XOR-based memory systems, this XOR-based system is not ideal for wide data values since parallel data paths from all of the different memory banks (including the XOR bank) must be routed to the memory controller in order to use the XOR bank properly. In an alternate embodiment, the memory system may handle write operation with two memory cycles. In such an embodiment, the memory system would read the old data value in the first memory cycle and update the XOR entry in the second memory cycle. Combining Algorithmic Memory Blocks The preceding sections disclosed a set of different algorithmic memory blocks that each have various unique capabilities and various restrictions. By combining these different types of algorithmic memory blocks in various hierarchical arrangements that take advantage of the capabilities and restrictions of each algorithmic memory block then complex memory systems can be constructed that have capabilities greater than the individual lower level memories. Thus, a synergistic effect is achieved since the capabilities of whole (the complex hierarchical memory system) is greater than the sum of its parts (the individual algorithmic or fundamental memory blocks). Several examples will be provided to show the reader several possible combinations of algorithmic or fundamental memory blocks. However, these are only presented as examples and various other combinations of algorithmic memory blocks and fundamental memory blocks may also be created as will be apparent to those skilled in the art. A First 2 Read and 2 Write Memory Implementation In all of the algorithmic memory blocks disclosed in the previous sections, none of the algorithmic memory blocks was capable of handling multiple read operations and multiple write operations simultaneously. Some algorithmic memory blocks could handle multiple write operations by using extra banks but only one simultaneous read operation could be handled. Other algorithmic memory blocks could handle multiple read operations by adding extra XOR banks but could only handle one write operation. If one combines the teachings from these various algorithmic memory blocks in a hierarchical manner then one may construct a complex memory system that can handle both multiple read operations and multiple write operations simultaneously. This section will disclose a first complex memory system that may handle two read operations and two write operations simultaneously. FIG. 15A illustrates first example of a complex memory system that combines algorithmic memory blocks from the previous sections in a hierarchical manner. In the hierarchical memory system of FIG. 15A, several algorithmic memory blocks are organized into a hierarchical arrangement that allows the hierarchical memory system to perform two simultaneous read operations and two simultaneous read operations. Specifically, a high-level algorithmic memory block that can handle one read operation and two simultaneous write operations is implemented on top of lower-level algorithmic memory blocks that can handle two simultaneous read operations or one write operation. The hierarchical combination of these two different algorithmic memory blocks creates a memory system that can handle two simultaneous read operations and two simultaneous read operations (2R2W). Since the present disclosure constructs complex hierarchical memory systems, the terminology must be used carefully. This document will refer to multiple instances of particular algorithmic memory blocks as ‘memory macros’. The actual memory banks within a memory macro may be constructed with fundamental memory blocks or with other algorithmic memory blocks (that can also be referred to as memory macros). Referring to FIG. 15A, a first high-level organization implements an algorithmic memory block that can handle one read operation and two simultaneous write operations. In the system of FIG. 15A, the algorithmic memory block from the earlier section “Memory System 2” is used to achieve this goal. This organization is achieved with a set of main memory macros 1591 for storing data, a set of three extra memory macros 1592, and a memory controller 1511. The memory controller 1511 implements the extra-memory-banks technique to handle simultaneous write operations. Specifically, when the memory controller 1511 receives a set of read and write operations addressed to the same memory macro (in the set of main memory macros 1591) thus causing a potential conflict then the memory controller 1511 moves any potential conflicting write operations to a new memory macro and remaps the new location of the written data items in the virtualized memory table 1513. Thus, this first algorithmic memory block organization allows the hierarchical memory system of FIG. 15A to handle two simultaneous write operations. (Note that three extra memory macros can be used to handle three extra write operations, however only two extra write operations are handled by this memory system. The reason why three extra memory macros are required will be explained below.) To handle two simultaneous read operations, the main memory macros 1591 and the extra memory macros 1592 are each implemented with algorithmic memory blocks designed to handle 2 simultaneous read operations or 1 write operation (2R or 1W) such as the “Memory System 4” algorithmic memory blocks. Specifically, memory macro blocks 1520, 1521, 1522, 1523, 1541, 1542, and 1543 can each handle two simultaneous read operations or one write operation. Each of the memory macro blocks 1520, 1521, 1522, 1523, 1541, 1542, and 1543 includes its own memory controller 1530, 1531, 1532, 1533, 1551, 1552, and 1553, respectively. These memory controllers in each memory macro block implement the XOR-based algorithmic memory block technique used to provide the capability of handling two simultaneous read operations or one write operation. Thus, each individual memory macro in the higher memory organization (made up of main memory macros 1591, extra memory macros 1592, and memory controller 1511) can handle two simultaneous read operations or one write operation. Since the high level algorithmic memory block organization (of main memory macros 1591 and extra memory macros 1592) can handle two simultaneous write operations and the lower-level algorithmic memory blocks (memory macro blocks 1520, 1521, 1522, 1523, 1541, 1542, and 1543) can handle two simultaneous read operations, the overall hierarchical memory system 1590 of FIG. 15A is thus capable of handling two simultaneous write operations and two simultaneous read operations. The following paragraphs set forth various different cases of handling two read and two write operations. In a trivial case, the two read and two write operations received simultaneously all address different ‘memory macros of the main memory macros 1591 and extra memory macros 1592. In such cases there are no potential memory conflicts at all such that each addressed memory macro can handle a memory access independent of the other memory macros. When one of the write operations has a potential memory conflict with one of the other memory operations (either a read or write), then the memory controller 1511 will examine the virtualized memory table 1513 to locate a free memory macro for that write operation thus avoiding the conflict. The memory controller 1511 then executes the write operation into the free macro and then re-maps the address for that write operation to the new memory macro that was used to handle the write operation. One particular difficult case is when all of the memory operations (two simultaneous read operations and two simultaneous write operations) are all directed at the same memory macro. For example, if all four memory operations are addressed to memory macro 1522 (in the higher level main memory macros 1591) then the two read operations may be handled by memory macro 1522 directly since the memory macro is constructed with an algorithmic memory block capable of handling two simultaneous read operations. (Memory macro 1522 must handle both of the read operations since memory macro 1522 is the only place where the addressed data is stored.) However, the write operations must be directed elsewhere since the memory macro 1522 can only handle two read operations or one write operation. To handle the write operations, the memory controller 1511 will consult the virtualized memory table 1513 to identify two free memory macros that can handle the two write operations. The memory controller 1511 then re-maps the addresses of those write operations to the identified free memory macros to avoid the potential memory conflict. For example, the memory controller 1511 may re-map the first write operation into extra memory macro 1541 and the re-map the second write into extra memory macro 1542. In this manner, the memory system 1590 simultaneously handled two read operations and two write operations addressed to memory macro 1522 by handling both read operations with memory macro 1522 directly, remapping a first write operation to extra memory macro 1541, and remapping a second write operation to extra memory macro 1542. (Note that the location of the free memory macros will differ based upon the current state of the virtualized memory mapping table.) FIG. 15B illustrates one particular difficult case that may be solved with the third extra memory macro (in extra memory macros 1592). In the example of FIG. 15B, a first read operation 1571, a first write operation 1561-1, and a second write operation 1562-1 are all directed to the same memory macro 1521. Since the data value requested by the read operation 1571 is only stored in that one memory macro 1521, the memory controller must access memory macro 1521 to service the read operation 1571. And since the memory macro 1521 can only handle two read operations or a single write operation, the memory controller must redirect the two write operations to different memory banks. In this example, the memory table in memory controller designates extra memory macros 1541, 1542, and 1543 as the alternate memory macros for handling the write operations. However, the second read operation 1572 is directed at memory macro 1541 such that memory macro 1541 cannot be used to handle either of the write operations. Thus, the memory controller uses memory macro 1542 to handle first write operation 1561-2. Finally, the memory controller uses memory macro 1543 to handle second operation 1562-2. As illustrated in the example of FIG. 15B, the two read operations (1571 and 1572) may block two of the available memory macros for handling the write operations. And each memory macro can handle only a single write operation. Thus, four different memory macros must be available for each write operation, so that a second write operation can access a memory macro that is not being used by any of two read operations or the first write operation. This is why the hierarchical memory system 1590 of FIG. 15A uses three extra memory macros 1592 (extra memory macros 1541, 1542, and 1543) instead of just two extra memory macros to handle the two write operations. Note that other techniques may also be used to handle this issue of requiring four available locations to write data values. For example, an alternate implementation may use a cache memory within the memory controller to cache write operations instead of using an extra memory macro. The teachings of the Provisional Patent Application entitled “SYSTEM AND METHOD FOR REDUCED LATENCY CACHING” filed on Dec. 15, 2009 having Ser. No. 61/284,260 may be used to implement a cache system. FIG. 15C illustrates a conceptual hierarchical block diagram of the various memory components used to construct the hierarchical memory system 1590 of FIG. 15A. Recall that each algorithmic memory block must be implemented with other lower level algorithmic memory blocks or lower level fundamental memory blocks. And fundamental memory blocks must be used to implement all of the ‘leaf’ memory blocks. In FIG. 15C, the overall high-level memory design is a memory system 1590 that handles two simultaneous read operations and two simultaneous write operations. To implement these features, a one read and two simultaneous write (1R and 2W) algorithmic memory block 1580 is used as a high level algorithmic memory block. However, the goal is to construct a 2R and 2W memory system. Thus, the system must be enhanced to provide the ability of handling another read operation. To handle the two read operations, each individual memory bank within the one read and two write (IR and 2W) algorithmic memory block 1580 is implemented with a two read or one write (2R or 1W) algorithmic memory block. Thus, below 1R and 2W block 1580 are the 1R or 1W memory macro 1520, 1521, 1522, 1523, 1541, 1542, and 1543 that provide memory service to algorithmic memory block 1580. In addition, the IR and 2W algorithmic memory block 1580 also uses a fundamental SRAM memory block 1503 to implement the memory table within the memory controller (virtualized memory table 1513 as illustrated in FIG. 15A) to keep track of which addresses are stored in which memory macros. Since each memory bank within the 1R and 2W algorithmic memory block 1580 can now handle two read operations simultaneously, the overall hierarchical memory system 1590 is now a 2R and 2R memory system. Every memory block must ultimately terminate with some type of fundamental memory block that actually provides the storage circuitry. Thus, each of the two read or one write algorithmic memory blocks (2R or 1W memory blocks 1520, 1521, 1522, 1523, 1541, 1542, and 1543) must also be implemented with some type of underlying memory system. In the embodiment illustrated in FIG. 15C, each of the two read or one write algorithmic memory blocks 1520, 1521, 1522, 1523, 1541, 1542, and 1543 is implemented with a fundamental embedded DRAM memory block. Note that any other type of appropriate fundamental memory system such SRAM may also be used. The selection will depend upon the demands of the particular memory application. Thus, as illustrated in FIG. 15C, a complex memory system with new features (the ability to handle two read operations and two write operations all simultaneously) can be implemented by organizing algorithmic memory blocks with less features such as (1R and 2W) memories and (2R or 1W) memories in a hierarchical arrangement. Each algorithmic memory block consists of a memory controller implementing control logic for a particular algorithmic memory and one or more lower-level memory systems. Each of the lower level memory systems may be other algorithmic memory blocks or fundamental memory blocks. Ultimately, at the ‘leaf’ ends of the hierarchical memory system arrangement, some type of fundamental memory block is used to provide fundamental memory storage capabilities. A First n Read and m Write Memory Implementation The two read and two write (2R2W) hierarchical memory system of the previous section can be generalized into an n read and m write memory system that can handle n simultaneous read operations and m simultaneous write operations. FIG. 16 illustrates an n read and m write memory system that uses the same general hierarchical, architecture as the system of FIG. 15A. In the hierarchical memory system of FIG. 16, a set of main memory macros 1691 are used to store data and a set of extra memory macros 1692 are used to handle potential memory conflicts between write operations and other memory operations attempting to access the same memory macro. The algorithmic memory block from the section “Memory System 2” may be used to achieve this goal. The number of extra memory macros 1692 should be large enough such that there will be enough available memory macros to handle all m write operation even in the worst case of memory conflicts between read operations and write operations. The memory controller 1611 uses a virtualized memory table 1613 to keep track of the current physical location of each data value. Specifically, the virtualized memory table 1613 specifies which virtualized memory addresses are stored in which physical memory macros. Note that the virtualized memory table 1613 itself may be constructed using an algorithmic memory block. In a system that handles n simultaneous read operations and m simultaneous write operations then n+m-1 extra memory macros will always ensure that there are enough extra memory macros to move the addresses of write operations that conflict with other memory accesses. However, other memory means, such as write buffers, may also be used to handle conflicting write operations such that the n+m-1 extra memory macros will not always be required. Each of the individual memory macros within the main memory macros 1691 and extra memory macros 1692 are n read or one write (nR or 1W) memory macros implemented with an algorithmic memory block (or hierarchy of memory blocks). For example, the XOR-based algorithmic memory block from the section “Memory System 6” may used to provide the n read or one write feature. In this manner, even if when all n read operations are directed toward the same memory macro, that memory macro will be able to respond to all n read operations simultaneously. A Second 2 Read and 2 Write Memory Implementation In the two read and two write memory system disclosed in a previous section, a high-level multiple-write algorithmic memory block was constructed using multiple-read algorithmic memory blocks as subcomponents. This architecture may be reversed such that a two read and two write memory system may be constructed as a high-level multiple-read algorithmic memory block that uses multiple-write algorithmic memory blocks as subcomponents. FIG. 17A illustrates second example of a hierarchical memory system that can handle two read operations and two write operations simultaneously. Referring to FIG. 17A, a first high-level organization implements an algorithmic memory block that can handle two simultaneous read operations or one write operation using the XOR-based system disclosed in the section on “Memory System 4”. Specifically, the first high-level organization has a set of main memory macros 1791 for handling normal read or write operations and an XOR macro 1792 for handling a second read operation. The XOR macro 1792 contains an encoded representation of the data from the other main memory macros 1791. Thus, when two read operations are received, one read operation can be serviced directly by a bank in the set of set of main memory blocks 1791 and the other read operation can be serviced by another of the main memory blocks (when there is no conflict) or by using the encoded version of data within the XOR macros 1792 (when both read requests are addressed to the same memory macro in the set of main memory macros 1791). To handle two simultaneous write operations in addition to the two read operations, each of the main memory macros 1791 and the XOR macro 1792 are implemented with an algorithmic memory block from the “Memory System 2” section that discloses a one read and n write algorithmic memory block. In the embodiment of FIG. 17A, each of the main memory macros 1791 and the XOR macro 1792 can handle one read and two write operations simultaneously. Specifically, any of the main memory blocks 1791 can handle the worst case scenario of one read operation and two write operations simultaneously attempting to access the same memory bank in the same memory macro. And the XOR macro 1792 can be used to handle an extra read operation such that two read operations and two write operations can handled simultaneously. FIG. 17B illustrates the case wherein all four memory operations (a read from address W, a read from address X, a write to address Y, and a write to address Z) are all directed toward a single memory bank (the second block from the left) within memory macro 1720. A first read operation 1771 (from address W) is handled directly by that addressed memory bank within memory macro 1720. Since that internal memory bank within memory macro 1720 is being used to handle the first read, it cannot be used by any of the other memory operations. To indicate this blockage, the targeted memory bank within memory macro 1720 is marked with an “W”. All three remaining memory operations (the read from address X and the writes to addresses Y and Z), cannot use that memory bank labelled “W” within memory macro 1720. Since the second read operation 1772-1 directed at address X cannot directly access that same targeted bank within memory macro 1720, the second read operation must be handled using the encoded version of the data within the XOR macro 1792. Thus, the memory controller for the high-level organization of the memory system reads the corresponding location in within the XOR macro 1792 with read operation 1772-5 to obtained the encoded representation of the data. To decode the encoded representation, the memory controller must also read the corresponding locations in all of the other memory macros. Thus, the memory controller reads from the second from the left memory bank within memory macros 1721, 1722, and 1723 with read operations 1772-2, 1772-3, and 1772-4. The data values read from read operations 1772-5, 1772-2, 1772-3, and 1772-4 are combined with an XOR operation to produce the requested data value for the read operation to address X. (The main representation of the address X data was in the second from the left memory bank in memory macro 1720 that could not be accessed due to a conflict with the read to address W.) The memory banks accessed by read operations 1772-5, 1772-2, 1772-3, and 1772-4 to handle the second read operation cannot be used by any of the other memory operations. To indicate this blockage, the memory banks accessed with read operations 1772-5, 1772-2, 1772-3, and 1772-4 are marked with a “X”. The two write operations 1775-1 are also blocked from accessing the targeted (second from left) memory bank in memory macro 1720 such that the memory controller of memory macro 1720 must direct the two write operations 1775-1 to other (free) memory banks within memory macro 1720. The memory controller of memory macro 1720 then remaps the target addresses (Y and Z) associated with the two write operations 1775-1 in a virtualized address table within memory macro 1720. However, since the higher-level structure of main memory macros 1791 and the XOR macro 1792 is an XOR-based system that must also keep an encoded version of each value written into the memory system, the high level memory controller must also update XOR macro 1792 with the data written to addresses Y and Z. To update the XOR macro 1792, for each of the write operations, the high-level memory controller reads the corresponding locations of the write operation in all of the other main memory macros (memory macros 1721, 1722, and 1723), combines that data with the new data value being written into memory macro 1720 with an XOR operation, and writes the result into the corresponding location in the XOR macro 1792. For example, to handle the write to address Y, the system writes the data into a free memory bank in memory macro 1720 (depicted as the ‘Y’ in memory macro 1720), reads the corresponding location in the other main memory macros (as depicted by reads 1775-2, 1775-3, and 1775-4), combines the data from those reads with the new data for address Y using an XOR operation, and then writes that encoded version into the XOR macro 1792 with write 1775-5. All of the memory banks that are accessed by the writes to addresses Y and Z are marked as “Y” and “Z” respectively. Note that memory macros 1721, 1722, and 1723 are all actually handling three write operations simultaneously even though those memory macros are only designated as 1 Read and 2 Write (1R and 2W) memories. This is possible since these three memory read operations are ‘load balanced’ such that they will always access different memory banks. The load-balancing occurs due to the resolution of potential bank conflict in memory macro 1720 that moves the two write operations (to addresses Y and Z) to different memory banks. And since the memory banks in each memory bank are independent from each other, memory macros 1721, 1722, and 1723 can handle the three ‘load-balanced’ read operations simultaneously. As illustrated in FIG. 17B, all four memory operations (a read from address W, a read from address X, a write to address Y, and a write operation to address Z) to a single memory bank in a single memory macro 1720 can be handled simultaneously by the hierarchical memory system of FIG. 17B. All of the memory banks that were accessed (with either a read or a write) are labelled with the letter of the address from the original memory operation (W, X, Y, or Z.). The read from address W only accessed the one bank that stored the main representation of the data. The read from address X accessed the encoded representation from the XOR macro 1792 and three data values from memory macros 1721, 1722, and 1723 to decode the encoded representation. The writes to both address Y and Z each accessed five different memory banks: a write to a bank in memory macro 1720 to store the main representation; reads from memory macros 1721, 1722, and 1723 to create an encoded representation; and a write to XOR macro 1792 to store the encoded representation. None of these many memory operations conflict with each other. FIG. 17C illustrates a particularly difficult case for the 2R and 2W hierarchical memory system of FIG. 17A. The case of FIG. 17C explains why three extra banks are used within each of the main memory macros 1720 to 1723 and XOR macro 1731. In the example of FIG. 17C, a first read operation 1771 directed to address W and two write operations 1775-1 to addresses Y and Z all target the same second-from-left bank in memory block 1720. The memory controller for memory block 1720 allows the read to address W 1771 to access the bank to obtain the data needed to respond to the read operation. Thus, the memory controller for memory block 1720 must move the writes to addresses Y and Z to different memory banks that are available to accept the memory writes. In this example, the three extra memory banks are deemed to be the currently available memory banks for accepting the write operations to addresses Y and Z. However, the second read operation 1772 is accessing one of the extra memory banks in memory macro 1721 Since, a write operation (into memory macro 1720 in this example) must also read access the corresponding memory bank in every other memory macro (memory macros 1721, 1722, and 1723 in this example) in order to update the XOR macro 1792 with the second representation of data, the writes cannot access the same extra memory bank as that second read operation 1772. Thus, when handling the write operations to addresses Y and Z the system cannot access the first of the extra memory banks since that first extra memory bank is being used by the read from address X 1772. Therefore, the system directs the write operations to addresses Y and Z 1775-1 to the last two extra memory banks in the memory macro 1720. This prevents a memory bank conflict in memory macro 1721 since the read 1772 of address X reads from the first extra memory bank and the two writes (to address Y and Z) can read from the last two extra memory banks in the memory macro 1721 as needed to update the XOR block 1792. Thus, the use of three extra memory banks in each of the memory blocks 1721, 1722, and 1723 and XOR macro 1731 allows the two write operations to avoid a conflict with either of the two read operations. FIG. 17D illustrates a hierarchical block diagram of the overall high level memory design of the memory system disclosed in FIGS. 17A to 17C that handles two simultaneous read operations and two simultaneous write operations. To implement the memory system, a two read algorithmic memory block 1780 is used as a high level algorithmic memory block. This high-level structure allows the hierarchical memory system to handle two simultaneous read operations. To handle the two write operations, each of the five individual memory blocks within the high-level two read algorithmic memory block 1780 is implemented one read and two write algorithmic memory blocks (algorithmic memory blocks 1720, 1721, 1722, 1723, and 1731). Combining the multiple write capability of these lower memory blocks with the two read capability of the higher-level organization allows the full hierarchical memory system to handle two simultaneous reads and two simultaneous writes. As set forth earlier, all of the algorithmic memory blocks must eventually terminate at the final “leaf’ level with some type of fundamental memory block used to provide actual storage circuitry. In the memory system disclosed in FIGS. 17A to 17C, the lower algorithmic memory blocks are the one read and two write algorithmic memory blocks (algorithmic memory blocks 1720, 1721, 1722, 1723, and 1731). In the specific example embodiment of FIG. 17D, the memory banks of the one read and two write algorithmic memory blocks are each implemented with embedded DRAM memory 1760 to 1764 and the virtualized memory tables are implemented with fundamental SRAM 1765 to 1769. Other embodiments may use other memory choices as long as the required performance metric for the memory system are met. Thus, as illustrated in FIGS. 17A to 17D, the ability to handle two read operations and two write operations all simultaneously can be implemented with an alternate hierarchical arrangement other than the arrangement presented in FIGS. 15A to 15C. In both hierarchical memory systems, each algorithmic memory block consists of a memory controller implementing control logic and one or more lower-level memory blocks. Each lower level memory block may be other algorithmic memory blocks or fundamental memory blocks. And the very lowest level (‘leaf’) ends of the hierarchical memory system arrangement are implemented with some type of fundamental memory block to provide fundamental memory storage capabilities. The memory architecture of FIGS. 17A to 17D, can extended to handle more simultaneous read operations by adding more XOR blocks and more write operations by adding more memory banks within each memory macro. Other Hierarchical Memory Arrangements Using the various different algorithmic memory blocks disclosed and various different types of fundamental memory devices, a wide variety of complex hierarchical memory systems may be constructed. Furthermore, memory systems that provide the same general functional characteristics, such as the number of simultaneous read and write operations supported, may be created in many different ways. FIG. 18 illustrates a chart with a horizontal axis specifying a number of simultaneous write operations supported and a vertical axis specifying a number of simultaneous read operations supported. Any point on the graph represents a possible memory system that may be constructed with a hierarchical intelligent memory system. In the upper right, location system 1890 represents a memory system that supports four read operations and four write operations. That four read and four write memory system at position 1890 may be constructed in a variety of different manners. A first method of constructing a four read and four write memory system 1890 is to used the teachings disclosed in FIG. 16 wherein a high-level algorithmic memory block organization uses extra memory banks to support multiple write operations. This is represented on FIG. 18 by the horizontal dot-dashed line 1811 to support four write operations. The individual memory banks are then implemented with an XOR-based algorithmic memory block organization that supports multiple read operations. This is represented on FIG. 18 by the vertical dot-dashed line 1815 to support four read operations. A second method of constructing a four read and four write memory system 1890 is to used the teachings disclosed in FIGS. 17A to 17D wherein a high-level algorithmic memory block organization uses XOR banks to support multiple read operations. This is represented on FIG. 18 by the vertical solid line 1831 to support four read operations. The individual memory blocks within the high-level structure may be implemented with algorithmic memory blocks that contain extra memory banks for supporting additional write operations. This is represented on FIG. 18 by the horizontal sold line 1835 to support four write operations. Other methods of constructing a four read and four write memory system 1890 may use other hierarchical structures that follow a path within the graph of FIG. 18. For example, one possible arrangement may use a first memory organizational layer to create a 1 read and 1 write memory system as depicted by dashed diagonal line 1861, a second memory organizational layer to implement three additional write operations as depicted by horizontal dashed line 1862, and a third memory organizational layer to implement three additional read operations as depicted by vertical dashed line 1863. The preceding technical disclosure is intended to be illustrative, and not restrictive. For example, the above-described embodiments (or one or more aspects thereof) may be used in combination with each other. Other embodiments will be apparent to those of skill in the art upon reviewing the above description. The scope of the claims should, therefore, be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled. In the appended claims, the terms “including” and “in which” are used as the plain-English equivalents of the respective terms “comprising” and “wherein.” Also, in the following claims, the terms “including” and “comprising” are open-ended, that is, a system, device, article, or process that includes elements in addition to those listed after such a term in a claim is still deemed to fall within the scope of that claim. Moreover, in the following claims, the terms “first,” “second,” and “third,” etc. are used merely as labels, and are not intended to impose numerical requirements on their objects. The Abstract is provided to comply with 37 C.F.R. §1.72(b), which requires that it allow the reader to quickly ascertain the nature of the technical disclosure. The abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. Also, in the above Detailed Description, various features may be grouped together to streamline the disclosure. This should not be interpreted as intending that an unclaimed disclosed feature is essential to any claim. Rather, inventive subject matter may lie in less than all features of a particular disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment. What is claimed is: 1. A memory circuit, comprising: a set of memory banks each having a plurality of data entries; an algorithm operation result bank having a plurality of algorithm operation result entries, the plurality of data entries and the plurality of algorithm operation result entries forming a plurality of rows; and a memory controller configured to: generate algorithmic operation results to be stored in each of the plurality of algorithm operation result entries using values stored in data entries of a corresponding row; and resolve a memory access conflict of reading a first data entry and a second data entry in a first memory bank of the set of memory banks during one clock cycle by: reading a first value stored at the first data entry of the first memory bank, values of all data entries other than the second data entry for a first row to which the second data entry belongs, and a first algorithmic operation result stored in a first algorithm operation result entry for the first row; and generating a second value stored at the second data entry of the first memory bank from the values of all data entries other than the second data entry for the first row and the first algorithmic operation result. 2. The memory circuit of claim 1, wherein each of the algorithmic operation results is generated from all data entries of a corresponding row combined together with an exclusive-OR operation. 3. The memory circuit of claim 1, wherein each of the algorithmic operation results is generated from all data entries of a corresponding row using an erasure coding. 4. The memory circuit of claim 3, wherein the erasure coding is one of: Reed-Solomon coding, Maximum Distance Separable (MDS) codes and Galois Fields. 5. The memory circuit of claim 1, wherein the memory controller is further configured to write a new data value to a third data entry by: writing the new data value to the third data entry; reading values of all data entries other than the third data entry for a corresponding row; generating an algorithmic operation result from the new data value and the values of all data entries other than the third data entry for the corresponding row; and writing the generated algorithmic operation result to an algorithmic operation result entry for the corresponding row. 6. The memory circuit of claim 5, wherein each of the plurality of data entries is a simple single port memory cell. 7. The memory circuit of claim 1, wherein the memory controller is further configured to write a new data value to a third data entry by: reading a currently stored data value at the third data entry; writing the new data value to the third data entry; reading a currently stored algorithmic operation result from an algorithmic operation result entry for the corresponding row; generating an updated algorithmic operation result by replacing the currently stored data value with the new data value; and writing the updated algorithmic operation result to the algorithmic operation result entry for the corresponding row. 8. The memory circuit of claim 7, wherein each of the plurality of data entries is a two port memory cell and the new data value is written to the third data entry in a single clock cycle. 9. The memory circuit of claim 7, wherein each of the plurality of data entries is a single port memory cell and the new data value is written to the third data entry in two clock cycles. 10. The memory circuit of claim 1, wherein the memory access conflict is caused by reading all data entries for the first row that includes the second data entry. 11. A method of handling memory access requests in a memory circuit, comprising: receiving a first memory read request for a first data entry and a second memory read request for a second data entry during one clock cycle, the first data entry and the second data entry located in a first memory bank of a set of memory banks of the memory circuit, the memory circuit comprising: the set of memory banks each having a plurality of data entries; and an algorithm operation result bank having a plurality of algorithm operation result entries, the plurality of data entries and the plurality of algorithm operation result entries forming a plurality of rows; and reading a first value stored at the first data entry of the first memory bank, values of all data entries other than the second data entry for a first row to which the second data entry belongs, and a first algorithmic operation result stored in a first algorithm operation result entry for the first row; and generating a second value stored at the second data entry of the first memory bank from the values of all data entries other than the second data entry for the first row and the first algorithmic operation result. 12. The method of claim 11, wherein the first algorithmic operation result is generated from all data entries of the first row combined together with an exclusive-OR operation. 13. The method of claim 11, wherein the first algorithmic operation result is generated from all data entries of the first row using an erasure coding. 14. The method of claim 13, wherein the erasure coding is one of: Reed-Solomon coding, Maximum Distance Separable (MDS) codes and Galois Fields. 15. The method of claim 11, further comprising: receiving a new data value to be written to a third data entry; writing the new data value to the third data entry; reading values of all data entries other than the third data entry for a corresponding row; generating an algorithmic operation result from the new data value and the values of all data entries other than the third data entry for the corresponding row; and writing the generated algorithmic operation result to an algorithmic operation result entry for the corresponding row. 16. The method of claim 11, wherein each of the plurality of data entries is a simple single port memory cell. 17. The method of claim 11, further comprising: receiving a new data value to be written to a third data entry; reading a currently stored data value at the third data entry; writing the new data value to the third data entry; reading a currently stored algorithmic operation result from an algorithmic operation result entry for the corresponding row; generating an updated algorithmic operation result by replacing the currently stored data value with the new data value; and writing the updated algorithmic operation result to the algorithmic operation result entry for the corresponding row. 18. The method of claim 17, wherein each of the plurality of data entries is a two port memory cell and the new data value is written to the third data entry in a single clock cycle. 19. The method of claim 17, wherein each of the plurality of data entries is a single port memory cell and the new data value is written to the third data entry in two clock cycles. 20. The method of claim 11, wherein the second memory read request is a request for reading all data entries for the first row that includes the second data entry.

2016-07-19

en

2016-11-10

US-202117141315-A

Variable cylinder wall for seals on plug valve ABSTRACT A rotary valve includes a rotary component configured to rotate about an axis of rotation thereof. The rotary component includes a plurality of fluid openings formed at an exterior surface thereof with each of the fluid openings forming a fluid inlet or a fluid outlet into one of a plurality of fluid passageways formed through the rotary component. The rotary component further comprises a valve body rotatably receiving the rotary component therein. The valve body includes a five fluid ports formed therethrough with each of the fluid ports configured to be selectively aligned with one of the fluid openings of the rotary component depending on a rotational position of the rotary component relative to the valve body to allow the rotary valve to operate as a five-way switching valve. CROSS-REFERENCE TO RELATED APPLICATION This patent application claims priority to U.S. Provisional Patent Application Ser. No. 63/072,991 filed on Sep. 1, 2020, the entire disclosure of which is hereby incorporated herein by reference. FIELD OF THE INVENTION The invention relates to a rotary valve. More particularly, the rotary valve includes five different fluid ports to allow the rotary valve to be operational as a five-way switching valve. Additionally, the rotary valve includes a rotary component rotatable within a valve body, wherein the rotary component has a variable outer circumferential wall radius for creating variable sealing forces between the rotary component and the sealing elements associated with the valve body. BACKGROUND A plug valve typically includes a “plug” having a substantially cylindrical or conical outer surface that is received within a valve body having a corresponding cylindrical or conical inner surface. The plug typically includes at least one passageway formed therethrough with at least one of the ends of each of the passageways intersecting the outer surface of the plug. Each of the passageways is configured to communicate a fluid through the plug with respect to any of a variety of different flow configurations. The valve body in turn typically includes one or more ports intersecting the inner surface of the valve body in order to communicate the fluid between any combination of the ports of the valve body and the passageways of the plug. The plug is operatively connected to a rotary actuator configured to rotate the plug relative to the stationary valve body to cause a repositioning of each of the passageways relative to each of the stationary ports. Depending on the configuration of the plug and the valve body, such rotation of the plug relative to the valve body may switch which of the passageways are placed in fluid communication with the corresponding ports or may cease flow through at least one of the passageways by placing the at least one of the passageways in alignment with a portion of the inner surface of the valve body devoid of one of the ports. The manner in which the plug rotates relative to the valve body requires that a suitable fluid-tight seal is established between the outer surface of the plug and the inner surface of the valve body to ensure that the corresponding fluid does not leak into a relatively small cylindrical or conical gap that may be present between the plug and valve body to allow for the ease of rotation of the plug relative to the valve body. Traditionally, such seals are established by placing a sealing element on the inner surface of the valve body around a periphery of each of the ports. Each of the sealing elements is typically compressed between the inner surface of the valve body and the outer surface of the plug to ensure that a suitable sealing effect is maintained regardless of the rotational position of the plug. Such sealing elements may be formed from elastomeric materials, hard plastic materials, or combinations of the two, for example. Unfortunately, such sealing elements present a disadvantageous relationship wherein an increase in the sealing effect between the plug and the valve body also tends to increase the amount of torque required to rotate the plug relative to the valve body. This occurs because the amount of compression applied to such a sealing element in a radial direction of the plug valve relates directly to the sealing effect provided thereby. As the degree of compression is increased, a radial force present between an inner surface of the sealing element and the outer surface of the plug also increases. This increased radial force increases the frictional forces present between the sealing element and the outer surface of the plug with respect to a circumferential direction of the plug, which in turn increases the amount of torque required to overcome such frictional forces when rotating the plug relative to the valve body. Accordingly, the type of rotary actuator capable of supplying the desired degree of sealing effect for a given plug valve configuration may be limited to only those rotary actuators having a corresponding torque rating, which leads to such rotary actuators being more costly while also requiring greater power to operate in the desired manner. One solution for minimizing the amount of torque that must be delivered to the plug for the desired rotation thereof is to reduce the friction present between the plug and each of the sealing elements associated with the ports of the valve body. This may be achieved by forming the engaging surface of the sealing element and/or the engaging surface of the plug from a relatively low friction material. However, such low friction materials often are cost prohibitive, require special and more complex manufacturing, or lack other properties such as having undesirable thermal expansion or corrosion resistance characteristics. Accordingly, there exists a need in the art to produce a plug (rotary component) that can provide a desired degree of sealing effect to each of the associated sealing elements without requiring a corresponding increase in the amount of torque required to rotate the plug relative to the associated valve body. Additionally, such plug valves of the prior art typically include only a limited number of possible configurations for prescribing flow configurations through the plug valve, such as a maximum of two or three suitable configurations. This greatly limits the ability of such plug valves to accommodate more complex flow configurations where one or more fluid streams must be routed to more than two or three possible flow paths. As a result, it may be necessary to incorporate multiple different valve elements at different locations within the corresponding fluid system or systems in order to achieve the desired flow configurations thereof. The use of additional valve elements increases the cost, complexity, and packaging space required to achieve such flow configurations. Accordingly, there further exists a need in the art to produce a plug valve that is repositionable to a greater number of different flow configurations that can be utilized while maintaining the aforementioned fluid tight seal at each of the interactions between the plug and the valve body in order to minimize the cost, complexity, and packaging space of the plug valve. SUMMARY OF THE INVENTION According to an embodiment of the present invention, a rotary valve comprises a rotary component configured to rotate about an axis of rotation thereof. The rotary component includes a plurality of fluid openings formed at an exterior surface thereof with each of the fluid openings forming a fluid inlet or a fluid outlet into one of a plurality of fluid passageways formed through the rotary component. The rotary component further comprises a valve body rotatably receiving the rotary component therein. The valve body includes a plurality of fluid ports formed therethrough with each of the fluid ports configured to be selectively aligned with one of the fluid openings of the rotary component depending on a rotational position of the rotary component relative to the valve body. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is an exploded perspective view of a rotary valve according to an embodiment of the present invention; FIG. 2 is an exploded elevational cross-sectional view of the rotary valve taken through an axis of rotation of the rotary valve; FIG. 3 is a bottom perspective cross-sectional view of the rotary valve taken through one of a pair of tiers of the rotary valve; FIG. 4 is a fragmentary enlarged perspective view of a rotary component of the rotary valve showing a variable radius of an outer circumferential surface of the rotary component; FIG. 5 is an enlarged fragmentary cross-sectional view showing an interaction between the rotary component, a valve body, and a sealing element of the rotary valve; FIG. 6 is a schematic view of a fluid system utilizing the rotary valve; FIG. 7A is a cross-sectional view taken through a first tier of the rotary valve when the rotary valve operates in a first mode of operation; FIG. 7B is a cross-sectional view taken through a second tier of the rotary valve when the rotary valve operates in the first mode of operation; FIG. 8A is a cross-sectional view taken through the first tier of the rotary valve when the rotary valve operates in a second mode of operation; FIG. 8B is a cross-sectional view taken through the second tier of the rotary valve when the rotary valve operates in the second mode of operation; FIG. 9A is a cross-sectional view taken through the first tier of the rotary valve when the rotary valve operates in a third mode of operation; FIG. 9B is a cross-sectional view taken through the second tier of the rotary valve when the rotary valve operates in the third mode of operation; FIG. 10A is a cross-sectional view taken through the first tier of the rotary valve when the rotary valve operates in a fourth mode of operation; and FIG. 10B is a cross-sectional view taken through the second tier of the rotary valve when the rotary valve operates in the fourth mode of operation. DETAILED DESCRIPTION OF THE INVENTION The following description of technology is merely exemplary in nature of the subject matter, manufacture and use of one or more inventions, and is not intended to limit the scope, application, or uses of any specific invention claimed in this application or in such other applications as may be filed claiming priority to this application, or patents issuing therefrom. Regarding methods disclosed, the order of the steps presented is exemplary in nature, and thus, the order of the steps can be different in various embodiments. “A” and “an” as used herein indicate “at least one” of the item is present; a plurality of such items may be present, when possible. Except where otherwise expressly indicated, all numerical quantities in this description are to be understood as modified by the word “about” and all geometric and spatial descriptors are to be understood as modified by the word “substantially” in describing the broadest scope of the technology. “About” when applied to numerical values indicates that the calculation or the measurement allows some slight imprecision in the value (with some approach to exactness in the value; approximately or reasonably close to the value; nearly). If, for some reason, the imprecision provided by “about” and/or “substantially” is not otherwise understood in the art with this ordinary meaning, then “about” and/or “substantially” as used herein indicates at least variations that may arise from ordinary methods of measuring or using such parameters. When an element or layer is referred to as being “on,” “engaged to,” “connected to,” or “coupled to” another element or layer, it may be directly on, engaged, connected or coupled to the other element or layer, or intervening elements or layers may be present. In contrast, when an element is referred to as being “directly on,” “directly engaged to,” “directly connected to” or “directly coupled to” another element or layer, there may be no intervening elements or layers present. Other words used to describe the relationship between elements should be interpreted in a like fashion (e.g., “between” versus “directly between,” “adjacent” versus “directly adjacent,” etc.). As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items. Although the terms first, second, third, etc. may be used herein to describe various elements, components, regions, layers and/or sections, these elements, components, regions, layers and/or sections should not be limited by these terms. These terms may be only used to distinguish one element, component, region, layer or section from another region, layer or section. erms such as “first,” “second,” and other numerical terms when used herein do not imply a sequence or order unless clearly indicated by the context. Thus, a first element, component, region, layer or section discussed below could be termed a second element, component, region, layer or section without departing from the teachings of the example embodiments. FIGS. 1-10 illustrate a rotary valve 10 utilizing a rotary component 50 (plug) according to an embodiment of the present invention. The rotary component 50 has a reduced frictional contact surface for decreasing the amount of torque necessary for rotating the rotary component 50 relative to a corresponding valve body 60. The illustrated rotary valve 10 may alternatively be referred to as a “plug valve,” as desired. The rotary valve 10 as shown and described herein may also be utilized for any number of different applications and for selectively conveying any variety of different fluids or combinations of fluids therethrough. The presently disclosed rotary valve 10 may be utilized in automotive applications, for example, including the control of various fluids associated with operation of a hydraulic system, a pneumatic system, a fuel system, a heating, ventilating, and air conditioning (HVAC) system, or a coolant system of the associated vehicle. The fluids suitable for use with the rotary valve 10 may be air, any hydraulic fluids, any types of fuel, any refrigerants, or any liquid coolants typically utilized with respect to such vehicular systems, as desired. However, it should also be apparent that the present rotary valve 10 may be adapted for use with any fluid associated with any fluid conveying system without necessarily departing from the scope of the present invention. FIG. 6 illustrates one exemplary application of the rotary valve 10 wherein the rotary valve 10 is utilized to control multiple different flows of a coolant (water) therethrough depending on the heating/cooling needs of various components of the associated motor vehicle. The rotary valve 10 generally includes the rotary component 50, the valve body 60, and at least one sealing element 20 for providing a fluid-tight seal between the rotary component 50 and the valve body 60. The rotary component 50 and the valve body 60 are each substantially cylindrical in shape. The valve body 60 further includes a substantially cylindrical opening 67 formed therein for rotatably receiving the rotary component 50. However, it should be apparent that the beneficial features of the present invention may be maintained if the rotary component and a complimentary opening formed in the valve body include other substantially axially symmetric shapes. For example, the rotary component and the complimentary opening formed in the valve body may each include a truncated conical shape or a truncated ellipsoidal shape without necessarily departing from the scope of the present invention. The rotary component 50 is configured to rotate relative to the valve body 60 about an axis of rotation thereof. The axis of rotation of the rotary component 50 extends through a center of the rotary component 50 and defines an axial direction thereof. The axis of rotation of the rotary component 50 also coincides with a central axis of the valve body 60 as well as a central axis of the rotary valve 10 more generally, hence subsequent references to an axial direction of any of the rotary valve 10, the rotary component 50, or the valve body 60 refer to directions arranged parallel to the axis of rotation of the rotary component 50. Additionally, a radial direction of any one of the rotary valve 10, the rotary component 50, or the valve body 60 may refer to any of the directions passing through and arranged perpendicular to the axis of rotation of the rotary component 50. The rotary component 50 is operably coupled to a rotary motor or actuator (not shown) configured to provide a torque necessary to rotate the rotary component 50 about the axis of rotation thereof relative to the stationary valve body 60. The rotary motor or actuator may be a torque motor, a servo motor, an electric stepper motor, or a brushless DC motor, as non-limiting examples. Any rotary motor or actuator having the necessary torque and the precision for establishing a desired rotational position of the rotary component 50 relative to the valve body 60 may be selected without departing from the scope of the present invention. The rotary component 50 extends axially from a first end 151 to a second end 152 thereof. A first end wall 161 extends substantially perpendicular to the axial direction of the rotary component 50 adjacent the first end 151 thereof and a second end wall 162 extends substantially perpendicular to the axial direction of the rotary component 50 adjacent the second end 152 thereof. As shown in FIGS. 1 and 2, the rotary component 50 may include a stem 56 extending from the first end 151 thereof for operationally engaging the corresponding rotary motor or actuator of the rotary valve 10. The rotary component 50 further includes a cylindrically shaped circumferential wall 153 extending between the first and second end walls 161, 162. The circumferential wall 153 includes an outer circumferential surface 171 facing radially outwardly towards a surrounding portion of the valve body 60 and an inner circumferential surface 175 facing radially inwardly towards the axis of rotation of the rotary component 50. The rotary component 50 defines a plurality of fluid passageways 211, 212, 213 therethrough. Each of the fluid passageways 211, 212, 213 provides fluid communication between two or more fluid openings 181, 191 formed at an outer or exterior surface of the rotary component 50. Specifically, the fluid openings 181, 191 include eight circumferential fluid openings 181 extending through the circumferential wall 153 to the outer circumferential surface 171 thereof and a single axial fluid opening 191 extending through the second end wall 162 to the second end 152 of the rotary component 50. Depending on the instantaneous mode of operation of the rotary valve 10, each of the fluid openings 181, 191 may represent an inlet or an outlet into the corresponding fluid passageway 211, 212, 213. A specific arrangement of the fluid openings 181, 191 relative to the fluid passageways 211, 212, 213 is explained in detail hereinafter when describing the different possible modes of operation of the rotary valve 10. As best shown in FIG. 4, the outer circumferential surface 171 of the circumferential wall 153 is subdivided into at least one sealing zone 172 and at least one non-sealing zone 173, wherein each of the circumferential fluid openings 181 is formed along the outer circumferential surface 171 at a position corresponding to one of the sealing zones 172. As a result, an entirety of a perimeter of each of the circumferential fluid openings 181 is surrounded by a corresponding one of the sealing zones 172 while each of the non-sealing zones 173 is spaced apart from a perimeter of each of the circumferential fluid openings 181. Each of the sealing zones 172 forms a portion of the outer circumferential surface 171 configured to sealingly engage one of the sealing elements 20 with a first sealing force when the rotary component 50 is rotated to one of a plurality of operational positions thereof, including both the operational positions wherein the corresponding circumferential fluid opening 181 is communicating a fluid therethrough and the operational positions wherein the corresponding circumferential fluid opening 181 is not communicating the fluid therethrough. In contrast, each of the non-sealing zones 173 refers to a portion of the outer circumferential surface 171 that is not directly surrounding one of the circumferential fluid openings 181 and therefore is not in need of direct sealing to one of the sealing elements 20 when the rotary valve 10 is actuated to one of the plurality of the operational positions thereof. Accordingly, each of the non-sealing zones 173 is configured to engage one of the sealing elements 20 with a second sealing force that is less than the first sealing force. The first sealing force may alternatively be referred to as a maximum sealing force while the second sealing force may alternatively be referred to as a minimum sealing force, as desired. The sealing zones 172 and the non-sealing zones 173 are distinguished from each other by a difference in a radius of the outer circumferential surface 171 along each of the identified zones 172, 173 as measured from the axis of rotation of the rotary component 50. Specifically, each of the sealing zones 172 may include a first radius while each of the non-sealing zones 173 may include a second radius that is smaller than the first radius. The first radius may be representative of a maximum radius of the outer circumferential surface 171 configured to engage one of the sealing elements 20 while the second radius may be representative of a minimum radius of the outer circumferential surface 171 configured to engage one of the sealing elements 20. The sealing zones 172 may accordingly be referred to alternatively as large radius zones 172 of the outer circumferential surface 171 while the non-sealing zones 173 may accordingly be referred to alternatively as small radius zones 173 of the outer circumferential surface 171. FIG. 5 illustrates the transition of the outer circumferential surface 171 from one of the sealing zones 172 having the first (maximum) radius to one of the non-sealing zones 173 having the second (minimum) radius. FIG. 5 further illustrates a radial gap 179 formed between the non-sealing zone 173 and a facing radially innermost surface of one of the sealing elements 20. The sealing elements 20 are configured to engage the outer circumferential surface 171 along both the sealing zones 172 and the non-sealing zones 173 due to the sealing elements 20 being dimensioned to be compressed between the rotary component 50 and the valve body 60 regardless of the rotational position of the rotary component 50, hence the illustrated gap 179 is not actually present during operational use of the rotary valve 10. The gap 179 is shown merely to illustrate the difference in radial compression of each of the sealing elements 20 depending on whether the corresponding portion of each of the sealing elements 20 is compressed between the valve body 60 and one of the sealing zones 172 or between the valve body 60 and one of the non-sealing zones 173. The radial gap 179 is representative of a reduction in the radial distance the corresponding portion of the sealing element 20 must be radially compressed when sandwiched between the rotary component 50 and the valve body 60. This reduction is radial compression results in the reduced sealing force present at each of the non-sealing zones 173. Each of the sealing zones 172 may be offset outwardly along the outer circumferential surface 171 from the periphery of the corresponding circumferential fluid opening 181 by a suitable distance for forming the sealing engagement with the instantaneously aligned one of the sealing elements 20. In the illustrated example, the circular perimeter shape of each of the circumferential fluid openings 181 results in each of the sealing zones 172 having a similarly circular perimeter shape that is enlarged relative to the circular perimeter shape of the corresponding circumferential fluid opening 181 by the constant offset distance. The offset distance may correspond to a dimension of the engaging sealing element 20 radially aligned with the corresponding sealing zone 172 to ensure a desired engagement between the sealing zone 172 and the engaging surface of the sealing element 20. For example, each of the sealing zones 172 may be offset outwardly about 3 mm from the periphery of the corresponding circumferential fluid opening 181 to maintain engagement with an aligned one of the sealing elements 20, as one non-limiting example. As can be seen in FIG. 4, the position and size of each of the circumferential fluid openings 181 as well as the size of the offset of the periphery of each of the sealing zones 172 may result in some of the sealing zones 172 intersecting and hence merging with an adjacent one of the sealing zones 172 with respect to the circumferential direction of the rotary component 50. Such merging may occur in what is hereinafter referred to as one of the transition zones 177 of the outer circumferential surface 171. In the illustrated embodiment, the transition zones 177 are formed by portions of the outer circumferential surface 171 disposed between adjacent ones of the circumferential fluid openings 181. The merging of the adjacent sealing zones 172 at each of the transition zones 177 ensures that the first sealing force is applied to at least a portion of each of the merged sealing zones 172 during a rotational transition of the rotary component 50 from one operational position to another. Although not shown herein, it should be apparent that the sealing zones 172 may also merge in the axial direction of the rotary valve 10 to similarly form the transition zones 177 depending on the size of the offset and the axial spacing present between the adjacent circumferential fluid openings 181. As explained in detail hereinafter, the circumferential fluid openings 181 of the illustrated embodiment are provided in two different tiers that are spaced axially apart from one another. As such, the non-sealing zones 173 may extend along those axial positions of the outer circumferential surface 171 devoid of one of the tiers of the circumferential fluid openings 181, such as those portions of the outer circumferential surface 171 disposed between the axially spaced apart tiers of the circumferential fluid openings 181 or the axial end portions of the outer circumferential surface 171 disposed axially beyond each of the tiers of the circumferential fluid openings 181. The presence of both the sealing zones 172 and the non-sealing zones 173 within the outer circumferential surface 171 distinguishes the rotary component 50 from similar rotary components (plugs) of the rotary valves of the prior art. Specifically, an outer circumferential surface of each of the rotary components of the prior art typically includes no differentiation between a radius of the outer circumferential surface depending on the presence of any circumferential fluid openings formed therein. For example, the cylindrical rotary components of the prior art typically include a constant radius across an entirety of the outer circumferential surface regardless of the presence of one or more circumferential fluid openings intersecting the outer circumferential surface. As such, there exists no structural feature for reducing the radial sealing force applied to the outer circumferential surface in order to reduce the frictional forces present between the outer circumferential surface and any engaging sealing elements. Although the rotary component 50 is described hereinafter as having a specific configuration relative to the valve body 60 for achieving multiple beneficial modes of operation of the rotary valve 10, it should be apparent that the general concept regarding the change in radius between the sealing zones 172 and the non-sealing zones 173 depending on the position of each of the corresponding circumferential fluid openings 181 may be utilized in a variety of different rotary valve configurations without necessarily departing from the scope of the present invention. For example, the rotary component 50 may include substantially any number and arrangement of the circumferential fluid openings 181 contrary to that shown and described herein while still appreciating the benefits of varying the radius of the outer circumferential surface 171 into the sealing zones 172 and the non-sealing zones 173. Additionally, it should also be apparent that the benefits of the change in radius of the outer circumferential surface 171 between the sealing zones 172 and the non-sealing zones 173 may also be appreciated when the rotary valve 10 utilizes any radially compressible sealing assembly or sealing element in addition to the sealing elements 20 as shown and described herein. Referring back to FIGS. 1 and 2, the valve body 60 extends axially from a first end 61 to a second end 62 thereof. The first end 61 of the valve body 60 is configured to receive a cover 63 after the valve body 60 has axially received the rotary component 50 and each of the corresponding sealing elements 20 therein. The cover 63 includes an opening 64 centered on the axis of rotation of the rotary component 50 with the opening 64 configured to receive the stem 56 of the rotary component 50 therethrough. An O-ring 65 is disposed between the first end 61 of the valve body 60 and an inner axial surface of the cover 63 to form a fluid-tight seal therebetween. Another pair of O-rings (not shown) may be received between an inner circumferential surface of the cover 63 defining the opening 64 thereof and an outer circumferential surface of the stem 56 of the rotary component 50 to form a fluid-tight seal therebetween, including during periods of rotation of the rotary component 50 relative to the valve body 60. The opening 67 of the valve body 60 defines each of an axial end wall 68 and a circumferential wall 69 of the valve body 60. The axial end wall 68 is configured to engage an axial end of the rotary component 50 and the circumferential wall 69 is configured to surround the rotary component 50 when the rotary component 50 is rotatably received within the valve body 60. The circumferential wall 69 of the valve body 60 includes an inner circumferential surface 70 extending peripherally around the rotary component 50. A plurality of support elements 71 extend radially inwardly from the inner circumferential surface 70 towards the axis of rotation of the rotary component 50. The support elements 71 are circumferentially spaced apart from each other by equal 72 degree angular intervals as measured from the axis of rotation of the rotary component 50. A pocket 72 is formed circumferentially between each adjacent pair of the support elements 71. Each of the pockets 72 is shaped to receive one of the sealing elements 20 therein. The pockets 72 may include various surface features for establishing and maintaining a position of a corresponding one of the sealing elements 20 therein during rotation of the rotary component 50 relative to the stationary valve body 60. The valve body 60 further defines a plurality of fluid ports 82, 83 therethrough. Each of the fluid ports 82, 83 provides fluid communication between a component of an associated fluid system disposed external to the rotary valve 10 (such as those shown in FIG. 6) and one of the fluid passageways 211, 212, 213 formed through the interior of the rotary component 50. Specifically, the fluid ports 82, 83 include four circumferential fluid ports 82 extending radially through the circumferential wall 69 to the inner circumferential surface 70 thereof and one axial fluid port 83 extending through the axial end wall 68 to the interior of the valve body 60 as defined by the opening 67. Each of the circumferential fluid ports 82 is configured for selective fluid communication with one of the circumferential fluid openings 181 of the rotary component 50 depending on the rotational position of the rotary component 50 relative to the valve body 60. The axial fluid port 83 is aligned with and in fluid communication with the axial fluid opening 191 of the rotary component 50 along an axis coinciding with the axis of rotation of the rotary component 50. The specific arrangement of the fluid ports 82, 83 is described in detail when discussing the different modes of operation of the rotary valve 10. FIGS. 1, 2, and 5 best illustrate the features of each of the sealing elements 20. Each of the sealing elements 20 includes a first sealing structure 21 and a second sealing structure 22. The first sealing structure 21 may alternatively be referred to as the “hard” sealing structure 21 while the second sealing structure 22 may alternatively be referred to as the “soft” sealing structure 22, as desired. The hard sealing structure 21 is configured to directly engage the outer circumferential surface 171 of the rotary component 50 to provide a fluid-tight seal therebetween when the rotary component 50 is rotated to any of the different prescribed positions thereof for causing any of the prescribed flow configurations through the rotary valve 10. More specifically, the hard sealing structure 21 is configured to engage one of the sealing zones 172 or one of the non-sealing zones 173 depending on the operational position of the rotary component 50. In contrast, the soft sealing structure 22 is configured to directly engage the circumferential wall 69 of the valve body 60 within one of the pockets 72 thereof. At least one of the soft sealing structures 22 is configured to surround and form a fluid-tight seal around a periphery of the radial innermost end of a corresponding one of the circumferential fluid ports 82 of the valve body 60. Additionally, the hard sealing structure 21 is also configured to engage the soft sealing structure 22 to form a fluid-tight seal therebetween at positions where the sealing structures 21, 22 are placed in direct contact with each other. As such, the sealing element 20 is configured to provide a fluid-tight seal between the instantaneously aligned one of the circumferential fluid openings 181 formed through the rotary component 50 and the radial innermost end of the circumferential fluid port 82 corresponding to the position of the sealing element 20 within the valve body 60. However, it should be apparent to one skilled in the art that alternative configurations of the corresponding sealing elements 20 may be utilized for maintaining the beneficial relationship between each of the sealing elements 20 and the outer circumferential surface 171 of the rotary component 50 as described hereinafter. For example, each of the sealing elements may be formed exclusively from a resiliently compressible (soft) material, such as an elastomeric material, in the absence of an adjoining rigid (hard) material, as desired. Each of the hard sealing structures 21 includes a pair of axially spaced apart peripheral portions 25. Each of the peripheral portions 25 defines a cylindrically shaped flow opening 24 therethough that is substantially circular in perimeter shape when viewed from the radial direction of the rotary valve 10. Each of the flow openings 24 includes a perimeter size and shape substantially corresponding to that of any of the circumferential fluid openings 181 formed through the rotary component 50. As shown in FIG. 5, each of the peripheral portions 25 further includes a radial inner surface 28 and a radial outer surface 29. The radial inner surface 28 is configured to sealingly engage the outer circumferential surface 171 of the rotary component 50 along one of the sealing zones 172 or along one of the non-sealing zones 173, depending on the operational position of the rotary component 50 relative to the valve body 60. The radial outer surface 29 is configured to bear against the soft sealing structure 22 with respect to the radial direction of the rotary component 50. The hard sealing structure 21 is formed from a substantially rigid material such as a relatively rigid and relatively hard thermoplastic material. More specifically, the selected material may desirably be a semi-crystalline thermoplastic. If a thermoplastic material is utilized, the thermoplastic material may preferably be polyphthalamide (PPA) or polyphenylene sulfide (PPS). It may be preferable to utilize either of PPA or PPS due to each of the materials having a relatively strong chemical resistance, heat resistance, and resistance to permanent deformation or abrasion. Additionally, each of PPA and PPS can be provided as thermoplastic resins that are capable of being injection molded for forming the above described shape and configuration of the hard sealing structure 21 using a relatively inexpensive manufacturing process while remaining within the desired tolerances for establishing the desired sealing engagement with the outer circumferential surface 171 of the rotary component 50. Other rigid thermoplastic materials may be utilized for forming the hard sealing structure 21, such as polytetrafluoroethylene (PTFE), although PTFE is incapable of being manufactured using an injection molding process, hence a more expensive and difficult manufacturing process is required to properly form the hard sealing structure 21 to the desired configuration for providing the fluid-tight seal with the outer circumferential surface 171 of the rotary component 50. Additional rigid materials may also be utilized for forming the hard sealing structure 21 as well, including various metals, various ceramics, carbon graphite, and even glass, depending on the application specific requirements for the associated rotary valve 10. However, once again, such alternative materials other than the preferable thermoplastic materials listed above may be cost prohibitive or increasingly difficult to manufacture within the desired tolerances for maintaining the fluid-tight seal between the hard sealing structure 21 and the rotary component 50. The rotary component 50, and specifically the portion of the rotary component 50 forming the outer circumferential surface 171 thereof, may be formed from the same materials described as being suitable for forming the hard sealing structure 21. For example, the rotary component 50 may be formed from a rigid thermoplastic material such as PPA or PPS, as non-limiting examples. In some embodiments, the same material may be selected to form each of the rotary component 50 and the hard sealing structure 21. However, any rigid material may be selected to form the rotary component 50 without necessarily departing from the scope of the present invention. Each of the soft sealing structures 22 has a shape substantially complimentary to that of each of the pockets 72 formed in the valve body 60. The soft sealing structures 22 are received within a corresponding one of the pockets 72 in a manner preventing motion of each of the soft sealing structures 22 in the radial or circumferential directions of the valve body 60. Each of the soft sealing structures 22 includes a pair of axially spaced apart flow openings 44 formed therethrough. Each of the flow openings 44 is cylindrical in shape and extends through the corresponding soft sealing structure 22 in the radial direction of the rotary valve 10. Each of the flow openings 44 includes a circular perimeter shape when viewed in the radial direction of the rotary valve 10. Each of the flow openings 44 includes a slightly reduced radius relative to each of the flow openings 24 formed through the hard sealing structure 21 to ensure that the radial outer surface 29 of the hard sealing structure 21 bears against the soft sealing structure 22. As suggested by the given names, the hard sealing structure 21 is formed from a material that is harder and stiffer than the material selected for forming the soft sealing structure 22. More specifically, the soft sealing structure 22 is formed from a relatively soft material that is resiliently deformable. As used herein, a resiliently deformable material is a material that can be deformed in such a way that the material attempts to return to its original position following deformation thereof, and especially when the material is compressed to be reduced in dimension in a given direction. The resiliency of the material selected for the soft sealing structure 22 should be such that the material applies a radial spring force to the hard sealing structure 21 in response to the soft sealing structure 22 being compressed in the radial direction towards the circumferential wall 69. The resiliently deformable material may preferably be an elastomeric material such as Santoprene® thermoplastic elastomer, ethylene propylene diene monomer (EPDM) rubber, Nylabond® thermoplastic elastomer, EPDM foam, silicone rubber, nitrile, or urethane, as non-limiting examples. The elastomeric material may be selected based on the type of fluid and operating characteristics of the fluid being communicated through the rotary valve 10, such as including a desired chemical resistance and heat resistance. In a preferred embodiment, the elastomeric material may be selected to be a low durometer, 35-45 shore A, soft seal rubber to provide a low spring force to displacement ratio with respect to the soft sealing structure 22. The use of the low durometer material also aids in addressing concerns relating to tolerance stack-up in any given direction, including the radial direction of the rotary valve 10, because the low spring force to displacement ratio allows for larger and more manufacturing friendly tolerances to be used in forming each of the sealing elements 20. The rigid material forming the hard sealing structure 21 is selected to include a lower co-efficient of friction than the resilient and soft material selected for forming the soft sealing structure 22. As such, the rotation of the rotary component 50 via the corresponding rotary motor or actuator requires less torque to overcome the frictional forces present between the radial inner surface 28 of the hard sealing structure 21 and the outer circumferential surface 171 of the rotary component 50 than would be the case if the soft sealing structure 22 were placed in direct contact with the rotary component 50 during the rotation thereof. When the rotary valve 10 is in the fully assembled position, each of the flow openings 24 formed through one of the hard sealing structures 21 cooperates with one of the flow openings 44 formed through the corresponding soft sealing structure 22 to provide fluid communication between one of the circumferential fluid openings 181 formed through the rotary component 50 and an aligned one of the circumferential fluid ports 82 formed through the valve body 60. Each of the sealing elements 20 having the corresponding fluid passing therethrough establishes the necessary fluid-tight seals for preventing any leakage of the fluid outside of the desired flow path of the fluid. The rotary actuator or motor can rotate the rotary component 50 to any of a variety of different rotational positions relative to the valve body 60 with each of the sealing elements 20 maintaining the fluid-tight sealing effect both during and after the rotation of the rotary component 50 due to the continuous spring force applied by each of the soft sealing structures 22 to the corresponding hard sealing structures 21. A more thorough description of the structure of each of the sealing elements 20 is found in co-pending U.S. patent application Ser. No. 16/939,270 to Graichen, which is hereby incorporated herein by reference in its entirety. Referring now to FIGS. 7A-10B, the specific configurations of the rotary component 50 and the valve body 60 for achieving the different modes of operation of the rotary valve 10 are shown and described. As can be seen in FIGS. 1-3, the rotary valve 10 generally includes a two-tiered configuration with each of the two tiers spaced apart from one another with respect to the axial direction of the rotary valve 10. A first tier includes a first set of the circumferential fluid openings 181, a first set of the flow openings 24, 44 (as formed by the structures 21, 22 of each of the sealing elements 20), and a first set of the circumferential fluid ports 82 all arranged on a first plane. The first plane is arranged perpendicular to the axial direction of the rotary valve 10 and is disposed towards the first end 151 of the rotary component 50 when the rotary valve 10 is fully assembled. A second tier includes a second set of the circumferential fluid openings 181, a second set of the flow openings 24, 44, and a second set of the circumferential fluid ports all arranged on a second plane. The second plane is similarly arranged perpendicular to the axial direction of the rotary valve 10 and is axially spaced from the first plane having the first tier towards the second end 152 of the rotary component 50 when the rotary valve 10 is fully assembled. Each of FIGS. 7A, 8A, 9A, and 10A show cross-sections through the first tier (first plane) of the rotary valve 10 while each of FIGS. 7B, 8B, 9B, and 10B show cross-sections through the second tier (second plane) of the rotary valve 10 with respect to four potential modes of operation of the rotary valve 10. FIGS. 7A and 7B show the two tiers when the rotary valve 10 is operating in a first mode of operation, FIGS. 8A and 8B show the two tiers when the rotary valve 10 is operating in a second mode of operation, FIGS. 9A and 9B show the two tiers when the rotary valve 10 is operating in a third mode of operation, and FIGS. 10A and 10B show the two tiers when the rotary valve 10 is operating in a fourth mode of operation. The four different modes of operation include the potential for fluid communication between combinations of five different fluid ports 82, 83 formed through the valve body 60, hence the rotary valve 10 may be referred to as a five-way valve or five-way switching valve. As can be seen throughout FIGS. 7A-10B, the cylindrically shaped rotary valve 10 can generally be subdivided into five different 72 degree sectors of a circle with each of the sectors including one of the sealing elements 20 disposed within one of the pockets 72 of the valve body 60. Each of the sectors of the circle further corresponds to a potential position of one of the circumferential fluid openings 181 formed at the outer circumferential surface 171 of the rotary component 50. Similarly, each of the circumferential fluid ports 82 corresponds in position to one of the sectors of the circle, wherein the pair of the circumferential fluid ports 82 of a common tier are disposed in adjacent ones of the sectors. The two adjacent sectors including the circumferential fluid ports 82 of the first tier also coincide with the two adjacent sectors including the circumferential fluid ports 82 of the second tier such that each of the circumferential fluid ports 82 of the first tier is aligned with and spaced apart from a corresponding one of the circumferential fluid ports 82 of the second tier with respect to the axial direction of the rotary valve 10. This division of the rotary valve 10 into five different sectors generally results in the different analogous features forming the rotary valve 10 being separated angularly from each other by 72 degree increments with respect to the circumferential direction of the rotary valve 10. Specifically, the circumferential wall 153 of the rotary component 50 may be divided into five equal circumferential segments with each of the circumferential segments extending through an arc of 72 degrees as measured from the axis of rotation of the rotary component 50. Similarly, the circumferential wall 69 of the valve body 60 may be divided into five equal circumferential segments with each of the circumferential segments once again extending through an arc of 72 degrees as measured from the axis of rotation of the rotary component 50. As such, the rotary component 50 is configured to be rotated in 72 degree increments to radially align a desired one of the circumferential fluid openings 181 with a desired one of the circumferential fluid ports 82 of that same tier to provide fluid communication therebetween (via a radially aligned set of the flow openings 24, 44 formed through a corresponding one of the sealing elements 20). The two different tiers of the rotary valve 10 then communicate the corresponding fluid axially through the interior of the rotary component 50 via the different fluid passageways 211, 212, 213 formed therein to achieve the different modes of operation of the rotary valve 10. Referring now to FIG. 7A, the first tier of the rotary valve 10 includes the rotary component 50 having a first circumferential fluid opening 251, a second circumferential fluid opening 252, and a third circumferential fluid opening 253. The position of the first circumferential fluid opening 251 of the first tier corresponds to a first circumferential segment of the circumferential wall 153, which is located towards the lower right corner of FIG. 7A. The remaining circumferential segments of the circumferential wall 153 are formed in succession with respect to a first circumferential direction of the rotary component 50 (clockwise with respect to the perspective of FIG. 7A), wherein the second circumferential segment is disposed adjacent the first circumferential segment, the third circumferential segment is disposed adjacent the second circumferential segment, the fourth circumferential segment is disposed adjacent the third circumferential segment, and the fifth circumferential segment is disposed adjacent the fourth circumferential segment (as well as the first circumferential segment at a position opposite the fourth circumferential segment). Based on this convention, the second circumferential fluid opening 252 of the first tier is positioned to correspond to the second circumferential segment while the third circumferential fluid opening 253 of the first tier is positioned to correspond to the fourth circumferential segment. The remaining third circumferential segment and fifth circumferential segment are each devoid of one of the circumferential fluid openings 181, and are instead occupied by continuous portions (arcs) of the circumferential wall 153 preventing a radial flow of any fluid into or out of the rotary component 50. Referring now to FIG. 7B while utilizing the same naming convention of the circumferential segments of the circumferential wall 153, the second tier of the rotary valve 10 includes the rotary component 50 having a first circumferential fluid opening 261 corresponding in position to the first circumferential segment (lower right corner in FIG. 7B), a second circumferential fluid opening 262 corresponding in position to the second circumferential segment, a third circumferential fluid opening 263 corresponding in position to the third circumferential segment, a fourth circumferential fluid opening 264 corresponding in position to the fourth circumferential segment, and a fifth circumferential fluid opening 265 corresponding in position to the fifth circumferential segment. The first circumferential segment of the rotary component 50 accordingly includes the first circumferential fluid opening 251 of the first tier aligned with and spaced apart from the first circumferential fluid opening 261 of the second tier with respect to the axial direction of the rotary valve 10. Similarly, the second circumferential fluid opening 252 of the first tier is axially aligned with and spaced apart from the second circumferential fluid opening 262 of the second tier while the third circumferential fluid opening 253 of the first tier is axially aligned with and spaced apart from the fourth circumferential fluid opening 264 of the second tier. These relationships are maintained regardless of the rotational position of the rotary component 50 relative to the valve body 60. As can be seen in FIGS. 7A and 7B, a dividing structure 155 extends between different portions of the inner circumferential surface 175 of the rotary component 50 to divide the interior of the rotary component 50 into the three different fluid passageways 211, 212, 213. Specifically, the dividing structure 155 forms a wall extending from a boundary formed between the first circumferential segment and the second circumferential segment of the circumferential wall 153 to a boundary formed between the fourth circumferential segment and the fifth circumferential segment of the circumferential wall 153. The first fluid passageway 211 is formed to one side of the dividing structure 155 along the first and fifth circumferential segments while the second fluid passageway 212 is formed to an opposing side of the dividing structure 155 along the second, third, and fourth circumferential segments. The dividing structure 155 also defines an opening extending through the interior of the rotary component 50 for forming the third fluid passageway 213. The dividing structure 155 fluidly separates each of the fluid passageways 211, 212, 213 from one another within the rotary component 50. That is, the dividing structure 155 prevents direct fluid communication between any of the fluid passageways 211, 212, 213, hence none of the independent fluid flows passing through any one of the fluid passageways 211, 212, 213 mixes or otherwise combines with one another of the independent fluid flows passing through another one of the fluid passageways 211, 212, 213 within the confines of the circumferential wall 153 of the rotary component 50. The end walls 161, 162 of the rotary component 50 further delimit each of the fluid passageways 211, 212, 213 with respect to the axial direction of the rotary valve 10 as can be seen in FIG. 2. The first fluid passageway 211 provides fluid communication between the first circumferential fluid opening 251 of the first tier and the first circumferential fluid opening 261 of the second tier. The second fluid passageway 212 provides fluid communication between any combination of the second circumferential fluid opening 252 of the first tier, the third circumferential fluid opening 253 of the first tier, the second circumferential fluid opening 262 of the second tier, the third circumferential fluid opening 263 of the second tier, and the fourth circumferential fluid opening 264 of the second tier. The third passageway 213 formed by the dividing structure 155 includes a 90 degree turn therein and provides fluid communication between the axial fluid opening 191 disposed along the axis of rotation of the rotary component 50 and the fifth circumferential fluid opening 265 of the second tier. Referring again to FIG. 7A, the first tier of the rotary valve 10 includes the valve body 60 having a first circumferential fluid port 281 and a second circumferential fluid port 282. The first circumferential fluid port 281 is positioned along a first circumferential segment of the circumferential wall 69 of the valve body 60 that is instantaneously aligned radially with the first circumferential segment of the circumferential wall 153 of the rotary component 50 with respect to the illustrated first mode of operation of the rotary valve 10. Once again, the remaining circumferential segments of the circumferential wall 69 are formed in succession with respect to the circumferential direction of the valve body 60 (clockwise with respect to the perspective of FIG. 7A), wherein the second circumferential segment is disposed adjacent the first circumferential segment, the third circumferential segment is disposed adjacent the second circumferential segment, the fourth circumferential segment is disposed adjacent the third circumferential segment, and the fifth circumferential segment is disposed adjacent the fourth circumferential segment (as well as the first circumferential segment disposed opposite the fourth circumferential segment). Based on this convention, the second circumferential fluid port 282 of the first tier is positioned along the second circumferential segment of the circumferential wall 69 while the remaining third, fourth, and fifth circumferential segments of the circumferential wall 69 are formed by a continuous portion (arc) of the circumferential wall 69 devoid of one of the circumferential fluid ports 82. Referring now to FIG. 7B while utilizing the same naming convention of the circumferential segments of the circumferential wall 69, the second tier of the rotary valve 10 includes the valve body 60 having a first circumferential fluid port 291 corresponding in position to the first circumferential segment and a second circumferential fluid port 292 corresponding in position to the second circumferential segment. The remaining third, fourth, and fifth circumferential segments of the circumferential wall 69 are once again formed by a continuous portion (arc) of the circumferential wall 69 devoid of one of the circumferential fluid ports 82. The first circumferential fluid port 281 of the first tier is aligned with and spaced apart from the first circumferential fluid port 291 of the second tier with respect to the axial direction of the rotary valve 10 while the second circumferential fluid port 282 of the first tier is similarly aligned with and spaced apart from the second circumferential fluid port 292 of the second tier with respect to the axial direction of the rotary valve 10. The first mode of operation as shown in FIGS. 7A and 7B includes the rotary component 50 rotated to the illustrated position wherein the first circumferential fluid port 281 of the first tier is radially aligned with the first circumferential fluid opening 251 of the first tier, the second circumferential fluid port 282 of the first tier is radially aligned with the second circumferential fluid opening 282 of the first tier, the first circumferential fluid port 291 of the second tier is radially aligned with the first circumferential fluid opening 261 of the second tier, and the second circumferential fluid port 292 of the second tier is radially aligned with the second circumferential fluid opening 262 of the second tier. A first flow of the fluid flows, in order, through the first circumferential fluid port 291 of the second tier, the first circumferential fluid opening 261 of the second tier, the first flow passageway 211 formed through the rotary component 50, the first circumferential fluid opening 251 of the first tier, and then the first circumferential fluid port 281 of the first tier. A second flow of the fluid flows, in order, through the second circumferential fluid port 292 of the second tier, the second circumferential fluid opening 262 of the second tier, the second flow passageway 212 formed through the rotary component 50, the second circumferential fluid opening 252 of the first tier, and then the second circumferential fluid port 282 of the first tier. In the illustrated flow configuration, the first and second circumferential fluid ports 291, 292 of the second tier act as fluid inlets of the rotary valve 10 while the first and second circumferential fluid ports 281, 282 of the first tier act as fluid outlets of the rotary valve 10. However, it should be readily apparent to one skilled in the art that one or both of the fluid flows may pass axially through the fluid passageways 211, 212 in opposing flow directions to that shown and described without departing from the scope of the present invention, depending on the flow configuration of the fluid through the remainder of the fluid system having the rotary valve 10. As such, any of the circumferential fluid ports 281, 282, 291, 292 may act as fluid inlets or fluid outlets into the rotary valve 10 with respect to the configuration of the rotary component 50 relative to the valve body 60 as shown in FIGS. 7A and 7B. The second mode of operation as shown in FIGS. 8A and 8B includes the rotary component 50 rotated 72 degrees (counter clockwise from the illustrated perspective) from the rotational position of the rotary component 50 associated with the first mode of operation. The second mode of operation includes a configuration wherein the first circumferential fluid port 281 of the first tier is radially aligned with the second circumferential fluid opening 252 of the first tier, the second circumferential fluid port 282 of the first tier is blocked by a portion of the circumferential wall 153, the first circumferential fluid port 291 of the second tier is radially aligned with the second circumferential fluid opening 262 of the second tier, and the second circumferential fluid port 292 of the second tier is radially aligned with the third circumferential fluid opening 263 of the second tier. A first flow of the fluid flows, in order, through the first circumferential fluid port 291 of the second tier, the second circumferential fluid opening 262 of the second tier, the second flow passageway 212 formed through the rotary component 50, the second circumferential fluid opening 252 of the first tier, and then the first circumferential fluid port 281 of the first tier. A second flow of the fluid flows, in order, through the second circumferential fluid port 292 of the second tier, the third circumferential fluid opening 263 of the second tier, the second flow passageway 212 formed through the rotary component 50, the second circumferential fluid opening 252 of the first tier, and then the first circumferential fluid port 281 of the first tier. In the illustrated flow configuration, the first and second circumferential fluid ports 291, 292 of the second tier act as fluid inlets of the rotary valve 10 while the first circumferential fluid port 281 of the first tier acts as a fluid outlet of the rotary valve 10, wherein the two flows of the fluid mix with each other within the second fluid passageway 212 before exiting the rotary component 50. However, it should be readily apparent to one skilled in the art that one or both of the fluid flows may pass through the second fluid passageway 212 using a different flow configuration to that shown and described without departing from the scope of the present invention, depending on the flow configuration through the remainder of the fluid system having the rotary valve 10. For example, the fluid may enter any two of the circumferential fluid ports 281, 291, 292, combine within the second fluid passageway 212, and then exit through the remaining one of the circumferential fluid ports 281, 291, 292, or the fluid may enter through a single one of the circumferential fluid ports 281, 291, 292, separate into two different partial flows within the second fluid passageway 212, and then exit through the remaining two of the circumferential fluid ports 281, 291, 292. The third mode of operation as shown in FIGS. 9A and 9B includes the rotary component 50 rotated 72 degrees (counter clockwise from the illustrated perspective) from the rotational position of the rotary component 50 associated with the second mode of operation. The third mode of operation includes a configuration wherein the first circumferential fluid port 281 of the first tier is blocked by a portion of the circumferential wall 153, the second circumferential fluid port 282 of the first tier is radially aligned with the third circumferential fluid opening 253 of the first tier, the first circumferential fluid port 291 of the second tier is radially aligned with the third circumferential fluid opening 263 of the second tier, and the second circumferential fluid port 292 of the second tier is radially aligned with the fourth circumferential fluid opening 264 of the second tier. A first flow of the fluid flows, in order, through the first circumferential fluid port 291 of the second tier, the third circumferential fluid opening 263 of the second tier, the second flow passageway 212 formed through the rotary component 50, the third circumferential fluid opening 253 of the first tier, and then the second circumferential fluid port 282 of the first tier. A second flow of the fluid flows, in order, through the second circumferential fluid port 292 of the second tier, the fourth circumferential fluid opening 264 of the second tier, the second flow passageway 212 formed through the rotary component 50, the third circumferential fluid opening 253 of the first tier, and then the second circumferential fluid port 282 of the first tier. In the illustrated flow configuration, the first and second circumferential fluid ports 291, 292 of the second tier act as fluid inlets of the rotary valve 10 while the second circumferential fluid port 282 of the first tier acts as a fluid outlet of the rotary valve 10, wherein the two flows of the fluid mix with each other within the second fluid passageway 212 before exiting the rotary component 50. However, it should be readily apparent to one skilled in the art that one or both of the fluid flows may pass through the second fluid passageway 212 using a different flow configuration to that shown and described without departing from the scope of the present invention, depending on the flow configuration through the remainder of the fluid system having the rotary valve 10. For example, the fluid may enter any two of the circumferential fluid ports 282, 291, 292, combine within the second fluid passageway 212, and then exit through the remaining one of the circumferential fluid ports 282, 291, 292, or the fluid may enter through a single one of the circumferential fluid ports 282, 291, 292, separate into two different partial flows within the second fluid passageway 212, and then exit through the remaining two of the circumferential fluid ports 282, 291, 292. The fourth mode of operation as shown in FIGS. 10A and 10B includes the rotary component 50 rotated 144 degrees (counter clockwise from the illustrated perspective) from the rotational position of the rotary component 50 associated with the third mode of operation. The fourth mode of operation includes a configuration wherein the first circumferential fluid port 281 of the first tier is blocked by a portion of the circumferential wall 153, the second circumferential fluid port 282 of the first tier is radially aligned with the first circumferential fluid opening 251 of the first tier, the first circumferential fluid port 291 of the second tier is radially aligned with the fifth circumferential fluid opening 265 of the second tier, and the second circumferential fluid port 292 of the second tier is radially aligned with the first circumferential fluid opening 261 of the second tier. A first flow of the fluid flows, in order, through the first circumferential fluid port 291 of the second tier, the fifth circumferential fluid opening 265 of the second tier, the third flow passageway 213 formed through the rotary component 50, the axial fluid opening 191 of the rotary component 50, and then the axial fluid port 83 of the valve body 60. A second flow of the fluid flows, in order, through the second circumferential fluid port 292 of the second tier, the first circumferential fluid opening 261 of the second tier, the first flow passageway 211 formed through the rotary component 50, the first circumferential fluid opening 251 of the first tier, and then the second circumferential fluid port 282 of the first tier. In the illustrated flow configuration, the first and second circumferential fluid ports 291, 292 of the second tier act as fluid inlets of the rotary valve 10 while the second circumferential fluid port 282 of the first tier and the axial fluid port 83 act as fluid outlets of the rotary valve 10. However, it should be readily apparent to one skilled in the art that one or both of the fluid flows may pass through the fluid passageways 211, 213 using a different flow configuration to that shown and described without departing from the scope of the present invention, depending on the flow configuration through the remainder of the fluid system having the rotary valve 10. Specifically, the flow direction through one or both of the fluid passageways 211, 213 may be reversed, as desired, to switch which of the ports 83, 282, 291, 292 act as the inlets and the outlets of the rotary valve 10. Although the rotary valve 10 is shown and described as utilizing the rotary component 50 having the outer circumferential surface 171 with the variable radius to form the sealing zones 172 and the non-sealing zones 173, it should be apparent to one skilled in the art that the different flow configurations disclosed with respect to the rotary valve 10 may be beneficially utilized in the absence of the formation of the sealing zones 172 and the non-sealing zones 173 without necessarily departing from the scope of the present invention. That is, the novel flow configurations through the rotary valve 10 may be useful in the absence of the lowered frictional forces supplied by the different zones 172, 173, hence the rotary valve 10 is not limited only to embodiments including this feature. The four disclosed modes of operation of the rotary valve 10 are now discussed with reference to the exemplary fluid system 301 of FIG. 6 in order to illustrate one possible use of the rotary valve 10 as a five-way switching valve. As mentioned previously, the fluid system 301 as illustrated in FIG. 6 is representative of a coolant system of an electric vehicle utilizing water as the coolant circulating through the rotary valve 10. However, it should be apparent that the flexibility of the rotary valve 10 in prescribing different flow configurations therethrough may be beneficially adapted for use with any fluid system having five different flow paths merged at a single valve element. The fluid system 301 includes a radiator coolant loop 310, a battery coolant loop 320, and an electric component coolant loop 330. The radiator coolant loop 310 and the battery coolant loop 320 may be placed in fluid communication with each other via the rotary valve 10 or by a pair of valves 315, 325 disposed remotely from the rotary valve 10 with respect to each of the loops 310, 320. A pump 303 is disposed immediately upstream of the rotary valve 10 with respect to each of the loops 310, 320 to cause the water to flow through each of the loops 310, 320 in a desired flow direction. The battery coolant loop 320 is in heat exchange relationship with the electric component coolant loop 330 via a coolant-to-coolant heat exchanger 305. The electric component coolant loop 330 includes at least one electric component 335 of the electric vehicle for exchanging heat energy with the coolant circulated through the electric component coolant loop 330. The at least one electric component 335 may be configured to generate heat that can be transferred to the battery coolant loop 320 via the coolant-to-coolant heat exchanger 305. The radiator coolant loop 310 includes a radiator 312, the valve 315, at least one electric drive unit 314, one of the pumps 303, and the rotary valve 10. A bypass flow path 318 extends from the rotary valve 10 to a position on the radiator coolant loop 310 downstream of the radiator 312 and upstream of the valve 315. The radiator coolant loop 310 also includes a pair of temperature sensors 302 for determining the temperature of the coolant immediately upstream of the radiator 312 and downstream of the position where the bypass flow path 318 joins the radiator coolant loop 310, wherein the determination of the temperature of the coolant may be utilized to determine the mode of operation of the rotary valve 10 for bypassing the radiator 312. The battery coolant loop 320 includes the coolant-to-coolant heat exchanger 305, a chiller 321, the valve 325, a battery 322, a battery charger 323, one of the pumps 303, and the rotary valve 10. According to the first mode of operation disclosed in FIGS. 7A and 7B, the rotary valve 10 communicates a first flow of the coolant from the port 291 to the port 281 and a second flow of the coolant from the port 292 to the port 282. This mode of operation includes the flow of the coolant through the battery 322 and the battery charger 323 of the battery coolant loop 320 flowing through the rotary valve 10 to be subsequently passed through the radiator 312 of the radiator coolant loop 310 to remove heat from the coolant. Additionally, the flow of the coolant through the at least one electric drive unit 314 is bypassed around the radiator 312 via flow through the bypass flow path 318. The first mode of operation may also include the valve 315 distributing the coolant towards the valve 325 for passage through the battery 322 and the battery charger 323 as well as towards the at least one electric drive unit 314. The second mode of operation disclosed in FIGS. 8A and 8B includes the rotary valve 10 communicating the coolant from each of the ports 291, 292 to the port 281. This results in the portion of the coolant passing through the at least one electric drive component 314 and the portion of the coolant passing through the battery 322 and the battery charger 323 combining within the rotary valve 10 before being passed through the radiator 312 to remove heat from the combined coolant flow. The second mode of operation relies upon the valve 315 distributing the coolant to the at least one electric drive unit 314 as well as the valve 325 for subsequent passage through the battery 322 and the battery charger 323. The third mode of operation disclosed in FIGS. 9A and 9B includes the rotary valve 10 communicating the coolant from each of the ports 291, 292 to the port 282. This results in the portion of the coolant passing through the at least one electric drive component 314 and the portion of the coolant passing through the battery 322 and the battery charger 323 combining within the rotary valve 10 before being passed through the bypass flow path 318 for bypassing the radiator 312. The third mode of operation relies upon the valve 315 distributing the coolant to the at least one electric component 314 as well as the valve 325 for subsequent passage through the battery 322 and the battery charger 323. The fourth mode of operation disclosed in FIGS. 10A and 10B includes the rotary valve 10 communicating a first flow of the coolant from the port 291 to the axially arranged port 191 as well as a second flow of the coolant from the port 292 to the port 282. Additionally, the valves 315, 325 are adjusted to send all coolant encountering each of the valves 315, 325 to flow towards the inlet ports 291, 292 of the rotary valve 10, hence no coolant is exchanged between the valves 315, 325. This configuration results in the coolant flowing through the two loops 310, 320 in a figure-eight flow shape. Specifically, the flow of the coolant through the battery 322 and the battery charger 323 is passed through the rotary valve 10 towards the radiator 312. The flow exiting the radiator 312 then flows through the at least one electric drive unit 314 and the rotary valve 10 towards the coolant-to-coolant heat exchanger 305. The coolant of the battery coolant loop 320 exchanges heat energy with the coolant of the electric component coolant loop 330 within the coolant-to-coolant heat exchanger 305. The coolant may then exchange additional heat energy with another fluid within the chiller 321 before flowing back through the battery 322 and the battery charger 323 to start the circulating process again. The fourth mode of operation may be utilized during periods of time when the battery 322 of the electric vehicle is in need of heating to achieve a desired degree of efficiency thereof, such as when the electric vehicle is first started when the electric vehicle is exposed to an especially cold ambient environment. The coolant-to-coolant heat exchanger 305 beneficially allows for heat to be added to the coolant from the electric component coolant loop 330 prior to passage of the coolant through the battery 322, thereby allowing for the battery 322 to be heated more quickly. The flow of the coolant in sequence through each of the loops 310, 320 during the fourth mode of operation also beneficially allows for the heat generated by the at least one electric drive unit 314 to similarly be transferred to the battery 322 prior to the heat being removed from the coolant within the radiator 312, thereby further aiding in quickly heating the battery 322. The use of the rotary component 50 having the variably radiused sealing zones 172 and non-sealing zones 173 allows for a lower total radial force to be applied to the rotary component 50 in comparison to the rotary components of the prior art. Specifically, the different operational positions of the rotary component 50 include at least some of the sealing elements 20 being compressed between the sealing zones 172 and the valve body 60 with the first sealing force and some of the sealing elements 20 being compressed between the non-sealing zones 173 and the valve body 60 with the lower second sealing force. By reducing the sealing force present with respect to at least some of the sealing elements 20 via the smaller radius of the non-sealing zones 173, the frictional forces present between the engaging hard sealing structure 21 and the rotary component 50 are reduced at various positions on the outer circumferential surface 171. As such, the total frictional forces present between the rotary component 50 and the sealing elements 20 is reduced, thereby requiring less torque to rotate the rotary component 50 relative to the valve body 60. The reduced torque requirement beneficially expands the suitable rotary motors or actuators capable for use with the rotary valve 10 while also reducing the amount of energy required to rotate the rotary component 50 relative to the valve body 60. The lower torque requirement may also beneficially allow for the rotary motor or actuator to be smaller in size to reduce a packaging space of any assembly including the rotary valve 10. The disclosed configuration of the rotary valve 10 also allows for the rotary valve 10 to control flow of the coolant through five different ports 83, 281, 282, 291, 292 of the valve body 60 via the use of a single rotary component 50, hence the rotary valve 10 is operational as a five-way switching valve despite having only a single actuating input. This is possible due to the two-tiered configuration of the rotary component 50 and the valve body 60, as the specific configuration of the fluid passageways 211, 212, 213 formed through the rotary component 50 allows for the coolant to be communicated axially between the two tiers to expand the number of possible flow configurations through the rotary valve 10. The rotary valve 10 is accordingly compact and able to be more easily integrated into any fluid system in need of a valve capable of controlling flow through at least five different flow paths meeting at the valve. The use of a single valve for controlling multiple different flow paths also simplifies the fluid system while eliminating potential problems associated with simultaneously controlling multiple valve elements or a valve element having multiple moving parts. From the foregoing description, one ordinarily skilled in the art can easily ascertain the essential characteristics of this invention and, without departing from the spirit and scope thereof, can make various changes and modifications to the invention to adapt it to various usages and conditions. What is claimed is: 1. A rotary valve comprising: a rotary component configured to rotate about an axis of rotation thereof, the rotary component including a plurality of fluid openings formed at an exterior surface thereof with each of the fluid openings forming a fluid inlet or a fluid outlet into one of a plurality of fluid passageways formed through the rotary component; a valve body rotatably receiving the rotary component therein, the valve body including a plurality of fluid ports formed therethrough with each of the fluid ports configured to be selectively aligned with one of the fluid openings of the rotary component depending on a rotational position of the rotary component relative to the valve body. 2. The rotary valve of claim 1, wherein the plurality of the fluid openings includes a plurality of circumferential fluid openings formed through a circumferential wall of the rotary component, and wherein the plurality of the fluid ports includes a plurality of circumferential fluid ports formed through a circumferential wall of the valve body. 3. The rotary valve of claim 2, wherein the circumferential fluid openings and the circumferential fluid ports are arranged in a first tier and a second tier, the first tier having a first plurality of the circumferential fluid openings and a first plurality of the circumferential fluid ports arranged on a first plane and the second tier having a second plurality of the circumferential fluid openings and a second plurality of the circumferential fluid ports arranged on a second plane, wherein the first plane and the second plane are each arranged perpendicular to the axis of rotation of the rotary component, and wherein the first plane is spaced apart axially from the second plane with respect to the axis of rotation of the rotary component. 4. The rotary valve of claim 3, wherein at least one of the fluid passageways formed through the rotary component is in fluid communication with at least one of the circumferential fluid openings of the first tier and at least one of the circumferential fluid openings of the second tier. 5. The rotary valve of claim 3, wherein at least two of the fluid passageways formed through the rotary component are in fluid communication with at least one of the circumferential fluid openings of the first tier and at least one of the circumferential fluid openings of the second tier. 6. The rotary valve of claim 3, wherein the plurality of fluid passageways include a first fluid passageway fluidly coupling at least one of the circumferential fluid openings of the first tier to at least one of the circumferential fluid openings of the second tier, a second fluid passageway fluidly coupling at least one of the circumferential fluid openings of the first tier to at least one of the circumferential fluid openings of the second tier, and a third fluid passageway fluidly coupling at least one of the circumferential fluid openings of the second tier to an axial fluid opening of the plurality of the fluid openings formed through an axial end wall of the rotary component. 7. The rotary valve of claim 6, wherein the first fluid passageway fluidly couples a first one of the circumferential fluid openings of the first tier to a first one of the circumferential fluid openings of the second tier, wherein the second fluid passageway fluidly couples second and third ones of the circumferential fluid openings of the first tier to second, third, and fourth ones of the circumferential fluid openings of the second tier, and the third fluid passageway fluidly couples a fifth one of the circumferential fluid openings of the second tier to the axial fluid opening. 8. The rotary valve of claim 3, wherein the first plurality of the circumferential fluid openings of the first tier includes three of the circumferential fluid openings spaced circumferentially about the circumferential wall of the rotary component and wherein the second plurality of the circumferential fluid openings of the second tier includes five of the circumferential fluid openings spaced circumferentially about the circumferential wall of the rotary component, and wherein the first plurality of the circumferential fluid ports of the first tier includes two of the circumferential fluid ports spaced circumferentially from each other about the circumferential wall of the valve body and the second plurality of the circumferential fluid ports of the second tier includes two of the circumferential fluid ports spaced circumferentially from each other about the circumferential wall of the valve body. 9. The rotary valve of claim 3, wherein the circumferential wall of the rotary component is divided into five equal circumferential segments including a first circumferential segment, a second circumferential segment, a third circumferential segment, a fourth circumferential segment, and a fifth circumferential segment when progressing in a first circumferential direction, wherein the first plurality of the circumferential fluid openings includes a first circumferential fluid opening of the first tier formed within the first circumferential segment, a second circumferential fluid opening of the first tier formed within the second circumferential segment, and a third circumferential fluid opening of the first tier formed within the fourth circumferential segment, and wherein the second plurality of the circumferential fluid openings includes a first circumferential fluid opening of the second tier formed within the first circumferential segment, a second circumferential fluid opening of the second tier formed within the second circumferential segment, a third circumferential fluid opening of the second tier formed within the third circumferential segment, a fourth circumferential fluid opening of the second tier formed within the fourth circumferential segment, and a fifth circumferential fluid opening of the second tier formed within the fifth circumferential segment. 10. The rotary valve of 9, wherein the plurality of fluid passageways include a first fluid passageway fluidly coupled to each of the first circumferential fluid opening of the first tier and the first circumferential fluid opening of the second tier, a second fluid passageway fluidly coupled to each of the second circumferential fluid opening of the first tier, the third circumferential fluid opening of the first tier, the second circumferential fluid opening of the second tier, the third circumferential fluid opening of the second tier, and the fourth circumferential fluid opening of the second tier, and a third fluid passageway fluidly coupled to each of the fifth circumferential fluid opening of the second tier and an axial fluid opening of the plurality of the fluid openings formed through an axial end wall of the rotary component. 11. The rotary valve of claim 10, wherein the circumferential wall of the valve body is divided into five equal circumferential segments, wherein the first plurality of the circumferential fluid ports includes a first circumferential fluid port of the first tier and a second circumferential fluid port of the first tier disposed within circumferentially adjacent circumferential segments of the circumferential wall of the valve body, and wherein the second plurality of the circumferential fluid ports includes a first circumferential fluid port of the second tier axially aligned with the first circumferential fluid port of the first tier and a second circumferential fluid port of the second tier axially aligned with the second circumferential fluid port of the first tier. 12. The rotary valve of claim 11, wherein a first mode of operation of the rotary valve includes the first circumferential fluid port of the first tier fluidly coupled to the first circumferential fluid port of the second tier through the first fluid passageway and the second circumferential fluid port of the first tier fluidly coupled to the second circumferential fluid port of the second tier through the second fluid passageway, a second mode of operation of the rotary valve includes each of the first circumferential fluid port of the second tier and the second circumferential fluid port of the second tier fluidly coupled to the first circumferential fluid port of the first tier through the second fluid passageway, a third mode of operation of the rotary valve includes each of the first circumferential fluid port of the second tier and the second circumferential fluid port of the second tier fluidly coupled to the second circumferential fluid port of the first tier through the second fluid passageway, and a fourth mode of operation of the rotary valve includes the second circumferential fluid port of the first tier fluidly coupled to the second circumferential fluid port of the second tier through the first passageway and the first circumferential fluid port of the second tier fluidly coupled to an axial fluid port of the plurality of the fluid ports formed through an axial end wall of the valve body through the third fluid passageway. 13. The rotary valve of claim 1, wherein all of the fluid passageways formed through the rotary component are fluidly separated from each other within the rotary component. 14. The rotary valve of claim 1, wherein the valve body includes five of the fluid ports and the rotary valve operates as a five-way switching valve. 15. The rotary valve of 14, wherein the five of the fluid ports includes a first inlet port, a second inlet port, a first outlet port, a second outlet port, and a third outlet port, wherein a first mode of operation of the rotary valve includes the first inlet port fluidly coupled to the first outlet port and the second inlet port fluidly coupled to the second outlet port, a second mode of operation of the rotary valve includes the first inlet port and the second inlet port both fluidly coupled to the first outlet port, a third mode of operation of the rotary valve includes the first inlet port and the second inlet port both fluidly coupled to the second outlet port, and a fourth mode of operation of the rotary valve includes the first inlet port fluidly coupled to the third outlet port and the second inlet port fluidly coupled to the second outlet port. 16. The rotary valve of claim 1, wherein a dividing structure forms a division between the fluid passageways within the rotary component. 17. The rotary valve of claim 16, wherein the dividing structure extends across a circumferential wall of the rotary component to separate a first fluid passageway from a second fluid passageway, and wherein the dividing structure defines an enclosed opening forming a third fluid passageway. 18. The rotary valve of claim 1, wherein at least one sealing element is disposed radially between an inner circumferential surface of the valve body and an outer circumferential surface of the rotary component, the outer circumferential surface of the rotary component having at least one sealing zone having a first radius measured from the axis of rotation and at least one non-sealing zone having a second radius measured from the axis of rotation, the first radius greater than the second radius. 19. The rotary valve of claim 18, wherein each of the at least one sealing elements applies a first sealing force to the rotary component when engaging one of the sealing zones or a second sealing force to the rotary component when engaging one of the non-sealing zones, the first sealing force greater than the second sealing force. 20. The rotary valve of claim 18, wherein the plurality of the fluid openings includes a plurality of circumferential fluid openings formed through a circumferential wall of the rotary component, wherein each of the sealing zones surrounds a perimeter of one of the circumferential fluid openings and each of the non-sealing zones is spaced from the perimeter of each of the circumferential fluid openings.

2021-01-05

en

2022-03-03

US-201716076979-A

Haloallylamine indole and azaindole derivative inhibitors of lysyl oxidases and uses thereof ABSTRACT The present invention relates to novel compounds which are capable of inhibiting certain amine oxidase enzymes. These compounds are useful for treatment of a variety of indications, e.g., fibrosis, cancer and/or angiogenesis in human subjects as well as in pets and livestock. In addition, the present invention relates to pharmaceutical compositions containing these compounds, as well as various uses thereof. TECHNICAL FIELD The present invention relates to novel compounds which are capable of inhibiting certain amine oxidase enzymes. These compounds are useful for treatment of a variety of indications, e.g., fibrosis, cancer and/or angiogenesis in human subjects as well as in pets and livestock. In addition, the present invention relates to pharmaceutical compositions containing these compounds, as well as various uses thereof. BACKGROUND A family of five closely relating enzymes have been linked to fibrotic disease and to metastatic cancer. The enzymes are related to lysyl oxidase (LOX), the first family member to be described and four closely related enzymes, LOX-like1 (LOXL1), LOXL2, LOXL3, and LOXL4 (Kagan H. M. and Li W., Lysyl oxidase: properties, specificity, and biological roles inside and outside of the cell. J Cell Biochem 2003; 88: 660-672). Lysyl oxidase isoenzymes are copper-dependent amine oxidases which initiate the covalent cross-linking of collagen and elastin. A major function of lysyl oxidase isoenzymes is to facilitate the cross-linking of collagen and elastin by the oxidative deamination of lysine and hydroxylysine amino acid side chains to aldehydes which spontaneously react with neighbouring residues. The resulting cross-linked strands contribute to extracellular matrix (ECM) stability. Lysyl oxidase activity is essential to maintain the tensile and elastic features of connective tissues of skeletal, pulmonary, and cardiovascular systems, among others. The biosynthesis of LOX is well understood; the protein is synthesized as a pre-proLOX that undergoes a series of post-translational modifications to yield a 50 kDa pro-enzyme which is secreted into the extracellular environment. For LOX and LOXL1 proteolysis by bone morphogenetic protein-1 (BMP-1) and other procollagen C-proteinases releases the mature and active form. LOXL2, LOXL3 and LOXL4 contain scavenger receptor cysteine-rich protein domains and are directly secreted as active forms. Lysyl oxidase isoenzymes belong to a larger group of amine oxidases which include flavin-dependent and copper-dependent oxidases which are described by the nature of the catalytic co-factor. Flavin-dependent enzymes include monoamine oxidase-A (MAO-A), MAO-B, polyamine oxidase and lysine demethylase (LSD1), and the copper-dependent enzymes include semicarbazide sensitive amine oxidase (vascular adhesion protein-1, SSAO/VAP-1), retinal amine oxidase, diamine oxidase and the lysyl oxidase isoenzymes. The copper-dependent amine oxidases have a second co-factor which varies slightly from enzyme to enzyme. In SSAO/VAP-1 it is an oxidized tyrosine residue (TPQ, oxidized to a quinone), whereas in the lysyl oxidase isoenzymes the TPQ has been further processed by addition of a neighboring lysine residue (to form LTQ); see Kagan, H. M. and Li, W., Lysyl oxidase: Properties, specificity, and biological roles inside and outside of the cell. J Cell Biochem 2003; 88: 660-672. Since lysyl oxidase isoenzymes exhibit different in vivo expression patterns it is likely that specific isoenzymes will have specific biological roles. Catalytically active forms of LOX have been identified in the cytosolic and nuclear compartments which suggest the existence of undefined roles of LOX in cellular homeostasis. Significant research is currently underway to define these roles. LOX itself, for example, plays a major role in epithelial-to-mesenchymal transition (EMT), cell migration, adhesion, transformation and gene regulation. Different patterns of LOX expression/activity have been associated with distinct pathological processes including fibrotic diseases, Alzheimer's disease and other neurodegenerative processes, as well as tumour progression and metastasis. See, for example, Woznick, A. R., et al. Lysyl oxidase expression in bronchogenic carcinoma. Am J Surg 2005; 189: 297-301. Catalytically active forms of LOXL2 can be also found in the nucleus (J Biol Chem. 2013; 288: 30000-30008) and can deaminate lysine 4 in histone H3 (Mol Cell 2012 46: 369-376). Directed replacement of dead or damaged cells with connective tissue after injury represents a survival mechanism that is conserved throughout evolution and appears to be most pronounced in humans serving a valuable role following traumatic injury, infection or diseases. Progressive scarring can occur following more chronic and/or repeated injuries that causes impaired function to parts or all of the affected organ. A variety of causes, such as chronic infections, chronic exposure to alcohol and other toxins, autoimmune and allergic reactions or radio- and chemotherapy can all lead to fibrosis. This pathological process, therefore, can occur in almost any organ or tissue of the body and, typically, results from situations persisting for several weeks or months in which inflammation, tissue destruction and repair occur simultaneously. In this setting, fibrosis most frequently affects the lungs, liver, skin and kidneys. Liver fibrosis occurs as a complication of haemochromatosis, Wilson's disease, alcoholism, schistosomiasis, viral hepatitis, bile duct obstruction, exposure to toxins and metabolic disorders. Liver fibrosis is characterized by the accumulation of extracellular matrix that can be distinguished qualitatively from that in normal liver. This fibrosis can progress to cirrhosis, liver failure, cancer and eventually death. This is reviewed in Kagan, H. M. Lysyl oxidase: Mechanism, regulation and relationship to liver fibrosis. Pathology—Research and Practice 1994; 190: 910-919. Fibrotic tissues can accumulate in the heart and blood vessels as a result of hypertension, hypertensive heart disease, atherosclerosis and myocardial infarction where the accumulation of extracellular matrix or fibrotic deposition results in stiffening of the vasculature and stiffening of the cardiac tissue itself. See Lopez, B., et al. Role of lysyl oxidase in myocardial fibrosis: from basic science to clinical aspects. Am J Physiol Heart Circ Physiol 2010; 299: H1-H9. A strong association between fibrosis and increased lysyl oxidase activity has been demonstrated. For example, in experimental hepatic fibrosis in rat (Siegel, R. C., Chen, K. H. and Acquiar, J. M, Biochemical and immunochemical study of lysyl oxidase in experimental hepatic fibrosis in the rat. Proc. Natl. Acad. Sci. USA 1978; 75: 2945-2949), in models of lung fibrosis (Counts, D. F., et al., Collagen lysyl oxidase activity in the lung decreases during bleomycin-induced lung fibrosis. J Pharmacol Exp Ther 1981; 219: 675-678) in arterial fibrosis (Kagan, H. M., Raghavan, J. and Hollander, W., Changes in aortic lysyl oxidase activity in diet-induced atherosclerosis in the rabbit. Arteriosclerosis 1981; 1: 287-291.), in dermal fibrosis (Chanoki, M., et al., Increased expression of lysyl oxidase in skin with scleroderma. Br J Dermatol 1995; 133: 710-715) and in adriamycin-induced kidney fibrosis in rat (Di Donato, A., et al., Lysyl oxidase expression and collagen cross-linking during chronic adriamycin nephropathy. Nephron 1997; 76: 192-200). Of these experimental models of human disease, the most striking increases in enzyme activity are seen in the rat model of CCl4-induced liver fibrosis. In these studies, the low level of enzyme activity in the healthy liver increased 15- to 30-fold in fibrotic livers. The rationale for the consistent and strong inhibition of fibrosis by lysyl oxidase isoenzyme blockers is that the lack of cross-linking activity renders the collagen susceptible to matrix metalloproteinases and causes degradation. Hence, any type of fibrosis should be reversed by treatment with lysyl oxidase isoenzyme inhibitors. In humans, there is also a significant association between lysyl oxidase activity measured in the plasma and liver fibrosis progression. Lysyl oxidase activity level is normally negligible in the serum of healthy subjects, but significantly increased in chronic active hepatitis and even more in cirrhosis, therefore lysyl oxidase might serve as a marker of internal fibrosis. BAPN (β-aminopropionitrile) is a widely used, nonselective lysyl oxidase inhibitor. Since the 1960s BAPN has been used in animal studies (mainly rat, mouse and hamster) and has been efficacious in reducing collagen content in various models (eg. CCl4, bleomycin, quartz) and tissues (eg. liver, lung and dermis). See Kagan, H. M. and Li, W., Lysyl oxidase: Properties, specificity and biological roles inside and outside of the cell. J Cell Biochem 2003; 88: 660-672. Lysyl oxidase isoenzymes are highly regulated by Hypoxia-Induced Factor 1α (HIF-1α) and TGF-β, the two most prominent growth factor that cause fibrosis (Halberg et al., Hypoxia-inducible factor 1α induces fibrosis and insulin resistance in white adipose tissue. Cell Biol 2009; 29: 4467-4483). Collagen cross linking occurs in every type of fibrosis, hence a lysyl oxidase isoenzyme inhibitor could be used in idiopathic pulmonary fibrosis, scleroderma, kidney or liver fibrosis. Lysyl oxidase isoenzymes are not only involved in the cross-linking of elastin and collagen during wound healing and fibrosis but also regulate cell movement and signal transduction. Its intracellular and intranuclear function is associated with gene regulation and can lead to tumorgenesis and tumor progression (Siddikiuzzaman, Grace, V. M and Guruvayoorappan, C., Lysyl oxidase: a potential target for cancer therapy. Inflammapharmacol 2011; 19: 117-129). Both down and upregulation of lysyl oxidase isoenzymes in tumour tissues and cancer cell lines have been described, suggesting a dual role for lysyl oxidase isoenzymes and LOX pro-peptide as a metastasis promoter gene as well as a tumour suppressor gene. To date, an increase in lysyl oxidase isoenzymes mRNA and/or protein has been observed in breast, CNS cancer cell lines, head and neck squamous cell, prostatic, clear cell renal cell and lung carcinomas, and in melanoma and osteosarcoma cell lines. Statistically significant clinical correlations between lysyl oxidase isoenzymes expression and tumor progression have been observed in breast, head and neck squamous cell, prostatic and clear cell renal cell carcinomas. The role of lysyl oxidase isoenzymes in tumor progression has been most extensively studied in breast cancer using in vitro models of migration/invasion and in in vivo tumorgenesis and metastasis mouse models. Increased lysyl oxidase isoenzymes expression was found in hypoxic patients, and was associated with negative estrogen receptor status (ER-), decreased overall survival in ER-patients and node-negative patients who did not receive adjuvant systemic treatment, as well as shorter metastasis-free survival in ER-patients and node negative patients. Lysyl oxidase isoenzymes mRNA was demonstrated to be up-regulated in invasive and metastatic cell lines (MDA-MB-231 and Hs578T), as well as in more aggressive breast cancer cell lines and distant metastatic tissues compared with primary cancer tissues. In head and neck squamous cell carcinomas, increased lysyl oxidase isoenzyme expression was found in association with CA-IX, a marker of hypoxia, and was associated with decreased cancer specific survival, decreased overall survival and lower metastasis-free survival. In oral squamous cell carcinoma, lysyl oxidase isoenzyme mRNA expression was upregulated compared to normal mucosa. Gene expression profiling of gliomas identified over-expressed lysyl oxidase isoenzyme as part of a molecular signature indicative of invasion, and associated with higher-grade tumors that are strongly correlated with poor patient survival. Lysyl oxidase isoenzyme protein expression was increased in glioblastoma and astrocytoma tissues, and in invasive U343 and U251 cultured astrocytoma cells. In tissues, lysyl oxidase isoenzyme mRNA was upregulated in prostate cancer compared to benign prostatic hypertrophy, correlated with Gleason score, and associated with both high grade and short time to recurrence (Stewart, G. D., et al., Analysis of hypoxia-associated gene expression in prostate cancer: lysyl oxidase and glucose transporter-1 expression correlate with Gleason score. Oncol Rep 2008; 20: 1561-1567). Up-regulation of lysyl oxidase isoenzyme mRNA expression was detected in renal cell carcinoma (RCC) cell lines and tissues. Clear cell RCC also demonstrated lysyl oxidase isoenzyme up-regulation. Indeed, LOX over expression appeared preferentially in clear cell RCC compared to mixed clear and granular, granular, oxyphil, tubulopapillary and chromophobe RCC/ontocytomas. In clear cell RCC, smoking was associated with allelic imbalances at chromosome 5q23.1, where the LOX gene is localized, and may involve duplication of the gene. SiHa cervical cancer cells demonstrated increased invasion in vitro under hypoxic/anoxic conditions; this was repressed by inhibition of extracellular catalytically active lysyl oxidase activity by treatment with BAPN as well as LOX antisense oligos, LOX antibody, LOX shRNA or an extracellular copper chelator. The scientific and patent literature describes small molecule inhibitors of lysyl oxidase isoenzymes and antibodies of LOX and LOXL2 with therapeutic effects in animal models of fibrosis and cancer metastasis. Some known MAO inhibitors also are reported to inhibit lysyl oxidase isoenzyme (e.g., the MAO-B inhibitor Mofegiline illustrated below). This inhibitor is a member of the haloallylamine family of MAO inhibitors; the halogen in Mofegiline is fluorine. Fluoroallylamine inhibitors are described in U.S. Pat. No. 4,454,158. There are issued patents claiming fluoroallylamines and chloroallylamines, for example MDL72274 (illustrated below) as inhibitors of lysyl oxidase (U.S. Pat. Nos. 4,943,593; 4,965,288; 5,021,456; 5,059,714; 5,182,297; 5,252,608). Many of the compounds claimed in these patents are also reported to be potent MAO-B and SSAO/VAP-1 inhibitors. Additional fluoroallylamine inhibitors are described U.S. Pat. No. 4,699,928. Other examples structurally related to Mofegiline can be found in WO 2007/120528. WO 2009/066152 discloses a family of 3-substituted 3-haloallylamines that are inhibitors of SSAO/VAP-1 useful as treatment for a variety of indications, including inflammatory disease. None of these documents specifically disclose the fluoroallylamine compounds of formula (I) according to the present invention. Antibodies to LOX and LOXL2 have been disclosed in US 2009/0053224 with methods to diagnostic and therapeutic applications. Anti-LOX and anti-LOXL2 antibodies can be used to identify and treat conditions such as a fibrotic condition, angiogenesis, or to prevent a transition from an epithelial cell state to a mesenchymal cell state: US 2011/0044907. SUMMARY The present invention provides substituted fluoroallylamine compounds that inhibit lysyl oxidase (LOX), lysyl oxidase-like2 (LOXL2) and other lysyl oxidase isoenzymes. Surprisingly, modification of 3-substituted-3-fluoroallylamine structures described previously has led to the discovery of novel compounds that are potent inhibitors of the human LOX and LOXL isoenzymes. Furthermore, certain of these novel compounds also selectively inhibit certain LOX and LOXL isoenzymes with respect to the other enzymes in the amine oxidase family. A first aspect of the invention provides for a compound of Formula I: or a stereoisomer, pharmaceutically acceptable salt, polymorphic form, solvate, tautomeric form or prodrug thereof; wherein: a is N or CR3; b is N or CR4; c is N or CR5; d is N or CR6; and from 0 to 2 of a, b, c and d are N; R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. A second aspect of the invention provides for a pharmaceutical composition comprising a compound according to the first aspect of the invention, or a pharmaceutically acceptable salt, solvate or prodrug thereof, and at least one pharmaceutically acceptable excipient, carrier or diluent. A third aspect of the invention provides for a method of inhibiting the amine oxidase activity of LOX, LOXL1, LOXL2, LOXL3 and LOXL4 in a subject in need thereof, comprising administering to the subject an effective amount of a compound according to the first aspect of the invention, or a pharmaceutically acceptable salt, solvate or prodrug thereof, or a pharmaceutical composition according to the second aspect of the invention. A fourth aspect of the invention provides for a method of treating a condition associated with LOX, LOXL1, LOXL2, LOXL3 and LOXL4 protein, comprising administering to a subject in need thereof a therapeutically effective amount of compound according to the first aspect of the invention, or a pharmaceutically acceptable salt, solvate or prodrug thereof, or a pharmaceutical composition according to the second aspect of the invention. A fifth aspect of the invention provides for use of a compound according to the first aspect of the invention, or a pharmaceutically acceptable salt, solvate or prodrug thereof, for the manufacture of a medicament for treating a condition associated with LOX, LOXL1, LOXL2, LOXL3 and LOXL4 protein. A sixth aspect of the invention provides for a compound according to the first aspect of the invention, or a pharmaceutically acceptable salt, solvate or prodrug thereof, for use in treating a condition associated with LOX, LOXL1, LOXL2, LOXL3 and LOXL4 protein. In one embodiment of the methods and uses of the present invention the condition is selected from a liver disorder, kidney disorder, cardiovascular disease, fibrosis, cancer and angiogenesis. Contemplated herein is combination therapy in which the methods further comprise co-administering additional therapeutic agents that are used for the treatment of liver disorders, kidney disorders, cardiovascular diseases, cancer, fibrosis, angiogenesis and inflammation. Definitions The following are some definitions that may be helpful in understanding the description of the present invention. These are intended as general definitions and should in no way limit the scope of the present invention to those terms alone, but are put forth for a better understanding of the following description. Unless the context requires otherwise or specifically states to the contrary, integers, steps, or elements of the invention recited herein as singular integers, steps or elements clearly encompass both singular and plural forms of the recited integers, steps or elements. Throughout this specification, unless the context requires otherwise, the word “comprise”, or variations such as “comprises” or “comprising”, will be understood to imply the inclusion of a stated step or element or integer or group of steps or elements or integers, but not the exclusion of any other step or element or integer or group of elements or integers. Thus, in the context of this specification, the term “comprising” means “including principally, but not necessarily solely”. Those skilled in the art will appreciate that the invention described herein is susceptible to variations and modifications other than those specifically described. It is to be understood that the invention includes all such variations and modifications. The invention also includes all of the steps, features, compositions and compounds referred to or indicated in this specification, individually or collectively, and any and all combinations or any two or more of said steps or features. As used herein, the term “alkyl” includes within its meaning monovalent (“alkyl”) and divalent (“alkylene”) straight chain or branched chain saturated hydrocarbon radicals having from 1 to 6 carbon atoms, e.g., 1, 2, 3, 4, 5 or 6 carbon atoms. The straight chain or branched alkyl group is attached at any available point to produce a stable compound. For example, the term alkyl includes, but is not limited to, methyl, ethyl, 1-propyl, isopropyl, 1-butyl, 2-butyl, isobutyl, tert-butyl, amyl, 1,2-dimethylpropyl, 1,1-dimethylpropyl, pentyl, isopentyl, hexyl, 4-methylpentyl, 1-methylpentyl, 2-methylpentyl, 3-methylpentyl, 2,2-dimethylbutyl, 3,3-dimethylbutyl, 1,2-dimethylbutyl, 1,3-dimethylbutyl, 1,2,2-trimethylpropyl, 1,1,2-trimethylpropyl, and the like. The term “alkoxy” or “alkyloxy” as used herein refers to straight chain or branched alkyloxy (i.e, O-alkyl) groups, wherein alkyl is as defined above. Examples of alkoxy groups include methoxy, ethoxy, n-propoxy, and isopropoxy. The term “cycloalkyl” as used herein includes within its meaning monovalent (“cycloalkyl”) and divalent (“cycloalkylene”) saturated, monocyclic, bicyclic, polycyclic or fused analogs. In the context of the present disclosure the cycloalkyl group may have from 3 to 10 carbon atoms. In the context of the present disclosure the cycloalkyl group may also have from 3 to 7 carbon atoms. A fused analog of a cycloalkyl means a monocyclic ring fused to an aryl or heteroaryl group in which the point of attachment is on the non-aromatic portion. Examples of cycloalkyl and fused analogs thereof include cyclopropyl, cyclobutyl, cyclopentyl, cyclohexyl, cycloheptyl, tetrahydronaphthyl, decahydronaphthyl, indanyl, adamantyl and the like. The term “aryl” or variants such as “arylene” as used herein refers to monovalent (“aryl”) and divalent (“arylene”) single, polynuclear, conjugated and fused analogs of aromatic hydrocarbons having from 6 to 10 carbon atoms. A fused analog of aryl means an aryl group fused to a monocyclic cycloalkyl or monocyclic heterocyclyl group in which the point of attachment is on the aromatic portion. Examples of aryl and fused analogs thereof include phenyl, naphthyl, indanyl, indenyl, tetrahydronaphthyl, 2,3-dihydrobenzofuranyl, dihydrobenzopyranyl, 1,3-benzodioxolyl, 1,4-benzodioxanyl, and the like. A “substituted aryl” is an aryl that is independently substituted, with one or more, preferably 1, 2 or 3 substituents, attached at any available atom to produce a stable compound. The term “alkylaryl” as used herein, includes within its meaning monovalent (“aryl”) and divalent (“arylene”), single, polynuclear, conjugated and fused aromatic hydrocarbon radicals attached to divalent, saturated, straight or branched chain alkylene radicals. Examples of alkylaryl groups include benzyl. The term “heteroaryl” and variants such as “heteroaromatic group” or “heteroarylene” as used herein, includes within its meaning monovalent (“heteroaryl”) and divalent (“heteroarylene”), single, polynuclear, conjugated and fused heteroaromatic radicals having from 5 to 10 atoms, wherein 1 to 4 ring atoms, or 1 to 2 ring atoms are heteroatoms independently selected from O, N, NH and S. Heteroaryl is also intended to include oxidized S or N, such as sulfinyl, sulfonyl and N-oxide of a tertiary ring nitrogen. A carbon or nitrogen atom is the point of attachment of the heteroaryl ring structure such that a stable compound is produced. The heteroaromatic group may be C5-8 heteroaromatic. A fused analog of heteroaryl means a heteroaryl group fused to a monocyclic cycloalkyl or monocyclic heterocyclyl group in which the point of attachment is on the aromatic portion. Examples of heteroaryl groups and fused analogs thereof include pyrazolyl, pyridyl, oxazolyl, oxadiazolyl, thiadiazolyl, tetrazolyl, triazinyl, thienyl, benzoxazolyl, benzothiazolyl, benzimidazolyl, benzofuranyl, benzothiophenyl, furo(2,3-b)pyridyl, quinolyl, indolyl, isoquinolyl, pyrimidinyl, pyridazinyl, pyrazinyl, 2,2′-bipyridyl, phenanthrolinyl, quinolinyl, isoquinolinyl, imidazolinyl, thiazolinyl, pyrrolyl, furanyl, thiophenyl, oxazolyl, isoxazolyl, isothiazolyl, triazolyl, and the like. “Nitrogen containing heteroaryl” refers to heteroaryl wherein any heteroatoms are N. A “substituted heteroaryl” is a heteroaryl that is independently substituted, with one or more, preferably 1, 2 or 3 substituents, attached at any available atom to produce a stable compound. The term “heterocyclyl” and variants such as “heterocycloalkyl” as used herein, includes within its meaning monovalent (“heterocyclyl”) and divalent (“heterocyclylene”), saturated, monocyclic, bicyclic, polycyclic or fused hydrocarbon radicals having from 3 to 10 ring atoms, wherein from 1 to 5, or from 1 to 3, ring atoms are heteroatoms independently selected from O, N, NH, or S, in which the point of attachment may be carbon or nitrogen. A fused analog of heterocyclyl means a monocyclic heterocycle fused to an aryl or heteroaryl group in which the point of attachment is on the non-aromatic portion. The heterocyclyl group may be C3-8 heterocyclyl. The heterocycloalkyl group may be C3-6 heterocyclyl. The heterocyclyl group may be C3-5 heterocyclyl. Examples of heterocyclyl groups and fused analogs thereof include aziridinyl, pyrrolidinyl, thiazolidinyl, piperidinyl, piperazinyl, imidazolidinyl, 2,3-dihydrofuro(2,3-b)pyridyl, benzoxazinyl, tetrahydroquinolinyl, tetrahydroisoquinolinyl, dihydroindolyl, quinuclidinyl, azetidinyl, morpholinyl, tetrahydrothiophenyl, tetrahydrofuranyl, tetrahydropyranyl, and the like. The term also includes partially unsaturated monocyclic rings that are not aromatic, such as 2- or 4-pyridones attached through the nitrogen or N-substituted uracils. The term “halogen” or variants such as “halide” or “halo” as used herein refers to fluorine, chlorine, bromine and iodine. The term “heteroatom” or variants such as “hetero-” or “heterogroup” as used herein refers to O, N, NH and S. In general, “substituted” refers to an organic group as defined herein (e.g., an alkyl group) in which one or more bonds to a hydrogen atom contained therein are replaced by a bond to non-hydrogen or non-carbon atoms. Substituted groups also include groups in which one or more bonds to a carbon(s) or hydrogen(s) atom are replaced by one or more bonds, including double or triple bonds, to a heteroatom. Thus, a substituted group will be substituted with one or more substituents, unless otherwise specified. In some embodiments, a substituted group is substituted with 1, 2, 3, 4, 5, or 6 substituents. The term “optionally substituted” as used herein means the group to which this term refers may be unsubstituted, or may be substituted with one or more groups independently selected from alkyl, alkenyl, alkynyl, cycloalkyl, cycloalkenyl, heterocycloalkyl, halo, haloalkyl, haloalkynyl, hydroxyl, hydroxyalkyl, alkoxy, thioalkoxy, alkenyloxy, haloalkoxy, haloalkenyloxy, NO2, NH(alkyl), N(alkyl)2, nitroalkyl, nitroalkenyl, nitroalkynyl, nitroheterocyclyl, alkylamino, dialkylamino, alkenylamine, alkynylamino, acyl, alkenoyl, alkynoyl, acylamino, diacylamino, acyloxy, alkylsulfonyloxy, heterocycloxy, heterocycloamino, haloheterocycloalkyl, alkylsulfenyl, alkylcarbonyloxy, alkylthio, acylthio, phosphorus-containing groups such as phosphono and phosphinyl, aryl, heteroaryl, alkylaryl, aralkyl, alkylheteroaryl, cyano, cyanate, isocyanate, CO2H, CO2alkyl, C(O)NH2, —C(O)NH(alkyl), and —C(O)N(alkyl)2. Preferred substituents include halogen, C1-C6alkyl, C2-C6alkenyl, C1-C6haloalkyl, C1-C6alkoxy, hydroxy(C1-6)alkyl, C3-C6cycloalkyl, C(O)H, C(O)OH, NHC(O)H, NHC(O)C1-C4alkyl, C(O)C1-C4alkyl, NH2, NHC1-C4alkyl, N(C1-C4alkyl)2, NO2, OH and CN. Particularly preferred substituents include C1-3alkyl, C1-3alkoxy, halogen, OH, hydroxy(C1-3)alkyl (e.g. CH2OH), C(O)C1-C4alkyl (e.g. C(O)CH3), and C1-3haloalkyl (e.g. CF3, CH2CF3). Further preferred optional substituents include halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. The term “bioisostere” refers to a compound resulting from the exchange of an atom or of a group of atoms with another, broadly similar, atom or group of atoms. The objective of a bioiosteric replacement is to create a new compound with similar biological properties to the parent compound. The bioisosteric replacement may be physiochemically or topologically based. The present invention includes within its scope all stereoisomeric and isomeric forms of the compounds disclosed herein, including all diastereomeric isomers, racemates, enantiomers and mixtures thereof. It is also understood that the compounds described by Formula I may be present as E and Z isomers, also known as cis and trans isomers. Thus, the present disclosure should be understood to include, for example, E, Z, cis, trans, (R), (S), (L), (D), (+), and/or (−) forms of the compounds, as appropriate in each case. Where a structure has no specific stereoisomerism indicated, it should be understood that any and all possible isomers are encompassed. Compounds of the present invention embrace all conformational isomers. Compounds of the present invention may also exist in one or more tautomeric forms, including both single tautomers and mixtures of tautomers. Also included in the scope of the present invention are all polymorphs and crystal forms of the compounds disclosed herein. The present invention includes within its scope isotopes of different atoms. Any atom not specifically designated as a particular isotope is meant to represent any stable isotope of that atom. Thus, the present disclosure should be understood to include deuterium and tritium isotopes of hydrogen. All references cited in this application are specifically incorporated by cross-reference in their entirety. Reference to any such documents should not be construed as an admission that the document forms part of the common general knowledge or is prior art. In the context of this specification the term “administering” and variations of that term including “administer” and “administration”, includes contacting, applying, delivering or providing a compound or composition of the invention to an organism, or a surface by any appropriate means. In the context of this specification, the term “treatment”, refers to any and all uses which remedy a disease state or symptoms, prevent the establishment of disease, or otherwise prevent, hinder, retard, or reverse the progression of disease or other undesirable symptoms in any way whatsoever. In the context of this specification the termnn “effective amount” includes within its meaning a sufficient but non-toxic amount of a compound or composition of the invention to provide a desired effect. Thus, the term “therapeutically effective amount” includes within its meaning a sufficient but non-toxic amount of a compound or composition of the invention to provide the desired therapeutic effect. The exact amount required will vary from subject to subject depending on factors such as the species being treated, the sex, age and general condition of the subject, the severity of the condition being treated, the particular agent being administered, the mode of administration, and so forth. Thus, it is not possible to specify an exact “effective amount”. However, for any given case, an appropriate “effective amount” may be determined by one of ordinary skill in the art using only routine experimentation. BRIEF DESCRIPTION OF THE FIGURES FIG. 1 shows the ability of Compound 25 to reduce fibrosis in a rat model of liver fibrosis. FIG. 2 shows the ability of Compound 12 to reduce fibrosis in a mouse model of lung fibrosis. FIG. 3A-3C shows the ability of Compound 12 to reduce fibrosis and to improve kidney function in a mouse model of kidney fibrosis. FIG. 4 shows the ability of Compound 12 to improve kidney function in a mouse model of kidney fibrosis. FIG. 5 shows the ability of Compound 25 to reduce fibrosis after carotic ligation in a mouse model of myocardial infarction. FIG. 6 shows the ability of Compound 112 to reduce lilver fibrosis in a STAM™ mice model. FIGS. 7a and 7b show the ability of Compound 112 to reduce collagen cross-link formation in an in vitro fibroblastic foci model of idiopathic pulmonary fibrosis (IPF). DETAILED DESCRIPTION The present invention relates to substituted fluoroallylamine derivatives which may inhibit lysyl oxidase (LOX), lysyl oxidase-like2 (LOXL2) and other lysyl oxidase isoenzymes. In particular the present invention relates to substituted fluoroallylamine derivatives with an indole or azaindole group. In particular the present invention relates to compounds of Formula I: or a stereoisomer, pharmaceutically acceptable salt, polymorphic form, solvate, tautomeric form or prodrug thereof; wherein: a is N or CR3; b is N or CR4; c is N or CR5; d is N or CR6; and from 0 to 2 of a, b, c and d are N; R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In one embodiment of compounds of the present invention none of a, b, c and d is N and a is CR3, b is CR4, c is CR5 and d is CR6 so that the compounds of Formula I are indole derivatives. In a further embodiment of compounds of the present invention one of a, b, c and d is N so that the compounds of Formula I are azaindole derivatives. In another embodiment of compounds of the present invention a is N, b is CR4, c is CR5 and d is CR6. In a further embodiment of compounds of the present invention a is CR3, b is N, c is CR5 and d is CR6. In another embodiment of compounds of the present invention a is CR3, b is CR4, c is N and d is CR6. In a still further embodiment of compounds of the present invention a is CR3, b is CR4, c is CR5 and d is N. In another embodiment of compounds of the present invention two of a, b, c and d are N. In a further embodiment of compounds of the present invention a is CR3, b is CR4, c is N and d is N. In another embodiment of compounds of the present invention a is CR3, b is N, c is CR5 and d is N. In another embodiment of compounds of the present invention a is N, b is CR4, c is N and d is CR6. In a further embodiment of compounds of the present invention a is CR3, b is N, c is N and d is CR6. In another embodiment of compounds of the present invention a is N, b is N, c is CR5 and d is CR6. In a further embodiment of compounds of the present invention a is N, b is CR4, c is CR5 and d is N. In one embodiment of compounds of the present invention R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In another embodiment of compounds of the present invention each R1 is independently selected from the group consisting of hydrogen, halogen, C1-6alkyl, and —C(O)NR9R10; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In a further embodiment of compounds of the present invention each R1 is independently selected from the group consisting of hydrogen, halogen, C1-3alkyl, and —C(O)N(CH3)2; wherein each C1-3alkyl is a straight or branched chain alkyl; and wherein each C1-3alkyl is optionally substituted by one or more substituents selected from the group consisting of halogen and —OH. In one embodiment of compounds of the present invention R1 is selected from the group consisting of hydrogen, methyl, ethyl, isopropyl, 1-hydroxyethyl, 2-hydroxyisopropyl, chloro and —C(O)N(CH3)2. In another embodiment of compounds of the present invention R1 is selected from the group consisting of hydrogen, methyl and isopropyl. In a further embodiment of compounds of the present invention R1 is methyl. In another embodiment of compounds of the present invention R1 is isopropyl. In one embodiment of compounds of the present invention R2 is aryl or heteroaryl where each R2 is optionally substituted by one or more R12. In another embodiment of compounds of the present invention R2 is aryl optionally substituted by one or more R12. In another embodiment of compounds of the present invention R2 is phenyl substituted by one R12. In a further embodiment of compounds of the present invention R2 is heteroaryl substituted by one or more R12. In another embodiment of compounds of the present invention R2 is heteroaryl substituted by one or more R12. In a further embodiment of compounds of the present invention R2 is selected from the group consisting of phenyl 1,3-benzodioxolyl 2-pyridinyl 3-pyridinyl 4-pyridinyl and 5-pyrimidinyl wherein each R2 is optionally substituted by one or more R12. In another embodiment of compounds of the present invention R2 is phenyl substituted by one R12 or 1,3-benzodioxolyl In a further embodiment of compounds of the present invention R2 is a heteroaryl selected from the group consisting of 2-pyridinyl 3-pyridinyl 4-pyridinyl and 5-pyrimidinyl wherein each R2 is optionally substituted by one or more R12. In another embodiment of compounds of the present invention R2 is a heteroaryl selected from the group consisting of 2-pyridinyl 3-pyridinyl and 4-pyridinyl wherein each R2 is substituted by one or two R12. In a further embodiment of compounds of the present invention R2 is 3-pyridinyl substituted by one or two R12. In another embodiment of compounds of the present invention R2 is 3-pyridinyl substituted by —S(O2)NR9R10 or —S(O2)R11. In a further embodiment of compounds of the present invention R2 is 3-pyridinyl substituted by —S(O2)N(CH3)2 or —S(O2)CH3. In one embodiment of compounds of the present invention R2 is substituted by one R12. In another embodiment of compounds of the present invention R2 is substituted by two R12. In another embodiment of compounds of the present invention R2 is substituted by one or two R12. In a further embodiment of compounds of the present invention R2 is substituted by three R2. In another embodiment of compounds of the present invention R2 is substituted by four or five R12. In one embodiment of compounds of the present invention R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In another embodiment of compounds of the present invention R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH and —O—C1-3alkyl. In a further embodiment of compounds of the present invention R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, fluoro, chloro, hydroxyl, methyl, cyclopropyl, —CN, —NO2, —NH2, —C(O)OH, —C(O)OMe, —C(O)OEt, —C(O)NR9R10, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole, oxadiazole, —CH2F, —CHF2, —OCF3, —CH2OCH3, —CF3, —CHF2CH3, —C(CH3)2OH. In one embodiment of compounds of the present invention R8 is selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In another embodiment of compounds of the present invention R8 is hydrogen. In a further embodiment of compounds of the present invention R8 is C1-6alkyl or C3-7cycloalkyl. In a still further embodiment of compounds of the present invention R8 is hydrogen or C1-6alkyl. In another embodiment of compounds of the present invention R8 is C1-6alkyl. In another embodiment of compounds of the present invention R8 is C1-3alkyl. In a further embodiment of compounds of the present invention R8 is methyl or ethyl. In another embodiment of compounds of the present invention R8 is selected from the group consisting of hydrogen, methyl and ethyl. In one embodiment of compounds of the present invention R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In another embodiment of compounds of the present invention R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl. In another embodiment of compounds of the present invention R9 and R10 are independently selected from the group consisting of hydrogen and C1-6alkyl. In another embodiment of compounds of the present invention R9 and R10 are hydrogen. In a further embodiment of compounds of the present invention R9 and R10 are C1-6alkyl. In another embodiment of compounds of the present invention R9 and R10 are both methyl. In a further embodiment of compounds of the present invention R9 and R10 are independently selected from the group consisting of hydrogen and C3-7cycloalkyl. In another embodiment of compounds of the present invention R9 is hydrogen and R10 is C1-6alkyl. In one embodiment of compounds of the present invention R9 is hydrogen and R10 is methyl or isopropyl. In a further embodiment of compounds of the present invention R9 is methyl and R10 is isopropyl. In one embodiment of compounds of the present invention R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members. In another embodiment R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 1 additional heteroatoms as ring members. In a further embodiment R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having 1 additional heteroatom as ring members. In another embodiment R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having 0 additional heteroatoms as ring members. In one embodiment of compounds of the present invention R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In another embodiment of compounds of the present invention R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl. In another embodiment of compounds of the present invention R11 is C1-6alkyl. In a further embodiment of compounds of the present invention R11 is selected from the group consisting of methyl, ethyl and isopropyl. In another embodiment of compounds of the present invention R11 is selected from the group consisting of methyl and isopropyl. In a further embodiment of compounds of the present invention R11 is C3-7cycloalkyl. In another embodiment of compounds of the present invention R11 is cyclopropyl. In one embodiment of compounds of the present invention R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In a further embodiment of compounds of the present invention R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11. In another embodiment of compounds of the present invention R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, —C(O)OR8, —C(O)NR9R10, —S(O2)NR9R10—NR9S(O2)R11 and —S(O2)R11. In a further embodiment of compounds of the present invention R12 is selected from the group consisting of —S(O2)NR9R10 and —S(O2)R11. In another embodiment of compounds of the present invention R12 is —S(O2)NR9R10. In a further embodiment of compounds of the present invention R12 is —S(O2)N(CH3)2. In another embodiment of compounds of the present invention R12 is —S(O2)R11. In a further embodiment of compounds of the present invention R12 is —S(O2)CH3. In another embodiment of compounds of the present invention R12 is —S(O2)iPr. In one embodiment the present invention also relates to compounds of Formula Ia: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In another embodiment of compounds of Formula Ia of the invention R1 is hydrogen, methyl or chlorine; R2 is aryl or heteroaryl optionally substituted by one or more R12; R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen and —OH; and R12 is selected from the group consisting selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen and —OH. In another embodiment the present invention also relates to compounds of Formula Ib: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4 and R5 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —S—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In one embodiment of compounds of Formula Ib of the invention R1 is hydrogen, methyl, chlorine, isopropyl, 1-hydroxyethyl, 2-hydroxyisopropyl; R2 is phenyl or 3-pyridyl optionally substituted by one or more R12; R3, R4 and R5 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, cyclopropyl, —O—C1-6alkyl, —NR9R10, —C(O)OR8 and —C(O)NR9R10; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen and —OH; and R12 is selected from the group consisting selected from the group consisting of halogen, —S—C1-6alkyl, —S(O2)NR9R10, —S(O)R11 and —S(O2)R11. In a further embodiment of compounds of Formula Ib of the invention R1 is hydrogen, methyl, chlorine, isopropyl, 1-hydroxyethyl, 2-hydroxyisopropyl; R2 is phenyl or 3-pyridyl optionally substituted by one or more R12; R3, R4 and R5 are each independently selected from the group consisting of hydrogen, fluorine, chlorine, hydroxyl, methyl, cyclopropyl, —OCH3, —CF3, —CH2F, —CHF2CH3, —CH2OCH3, —C(CH3)2OH, —N(CH3)2, —C(O)OH, —C(O)OEt, —C(O)NHCH3, —C(O)N(CH3)2, —C(O)NHiPr; and R12 is selected from the group consisting selected from the group consisting of chlorine, —S—CH3, —S(O2)N(CH3)2, —S(O2)CH3, —S(O2)Et, —S(O2)iPr and —S(O2)cyclopropyl. In another embodiment the present invention also relates to compounds of Formula Ic: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R2; R3, R4 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In one embodiment of compounds of Formula Ic of the invention R1 is methyl, R2 is phenyl optionally substituted by S(O2)N(CH3)2 or —S(O2)CH3; and R3, R4 and R6 are independently selected from the group consisting of hydrogen and methyl. In another embodiment the present invention also relates to compounds of Formula Id: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In one embodiment of compounds of Formula Id of the invention R1 is methyl; R2 is phenyl substituted by S(O2)N(CH3)2; and R3, R5 and R6 are hydrogen. In another embodiment the present invention also relates to compounds of Formula Ie: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In one embodiment of compounds of Formula Ie of the invention R1 is methyl, R2 is phenyl or 3-pyridyl substituted by S(O2)N(CH3)2; and R4, R5 and R6 are independently selected from the group consisting of hydrogen and chlorine. In another embodiment the present invention also relates to compounds of Formula If: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3 and R4 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)ORB, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In another embodiment the present invention also relates to compounds of Formula Ig: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3 and R5 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. In the context of the present disclosure, any one or more aspect(s) or embodiment(s) may be combined with any other aspect(s) or embodiment(s). Exemplary compounds according to the present invention include the compounds set forth in Table 1: TABLE 1 1 (Z)-3-fluoro-4-(3-(4-fluorophenyl)-1H- indol-1-yl)but-2-en-1-amine 2 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 3 (Z)-4-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 4 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-pyrrolo[2,3-b]pyridin-3-yl)- N,N-dimethylbenzenesulfonamide 5 (Z)-methyl 1-(4-amino-2-fluorobut-2-en- 1-yl)-3-(3-N,N- dimethylsulfamoyl)phenyl)-2-methyl-1H- indole-5-carboxylate 6 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-5-carboxamide 7 (Z)-methyl 1-(4-amino-2-fluorobut-2-en- 1-yl)-3-(3-(N,N- dimethylsulfamoyl)phenyl)-2-methyl-1H- indole-6-carboxylate 8 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-indole-5-carboxylic acid 9 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-indole-6-carboxylic acid 10 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-6-carboxamide 11 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-indole-6-carboxamide 12 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)- 2-methyl-1H-indole-5-carboxylate 13 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)-2- methylphenyl)-2-methyl-1H-indole-5- carboxylic acid 14 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2- methyl-3-(3-(methylsulfonyl)phenyl)-1H- indole-5-carboxylic acid 15 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(dimethylcarbamoyl)phenyl)-2- methyl-1H-indole-5-carboxylate 16 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(dimethylcarbamoyl)phenyl)-2-methyl- 1H-indole-5-carboxylic acid 17 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-3-(3- (methylsulfonyl)phenyl)-1H-indole-5- carboxylate 18 (Z)-1-(4-amino-2-fluorobut-2-en-l-yl)-2- methyl-3-(3-(N-methylsulfamoyl)phenyl)- 1H-indole-5-carboxylic acid 19 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(5-(N,N-dimethylsulfamoyl)-2- methylphenyl)-2-methyl-1H-indole-5- carboxylate 20 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (5-(N,N-dimethylsulfamoyl)-2- methylphenyl)-2-methyl-1H-indole-5- carboxylic acid 21 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-6- fluoro-2-methyl-1H-indole-5-carboxylic acid 22 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)- 6-fluoro-2-methyl-1H-indole-5- carboxylate 23 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (4-fluorophenyl)-2-methyl-1H-indole-5- carboxylic acid 24 ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1- yl)-3-(4-fluorophenyl)-2-methyl-1H- indole-5-carboxylate 25 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)- N,N-dimethylbenzenesulfonamide 26 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-pyrrolo[3,2-c]pyridin-3-yl- N,N-dimethylbenzenesulfonamide 27 ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-chlorophenyl)-2-methyl-1H- indole-5-carboxylate 28 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-chlorophenyl)-2-methyl-1H-indole-5- carboxylic acid 29 (Z)-3-(1-(4-amino-2-fluorobut-2-en-l-yl)- 2-methyl-5-(2H-tetrazol-5-yl)-1H-indol-3- yl)-N,N-dimethylbenzenesulfonamide 30 ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(tert-butyl)phenyl)-2-methyl-1H- indole-5-carboxylate 31 (Z)-1-(4-amino-2-fluorobut-2-en-l-yl)-3- (3-(tert-butyl)phenyl)-2-methyl-1H- indole-5-carboxylic acid 32 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-pyrrolo[2,3-c]pyridin-3-yl)- N,N-dimethylbenzenesulfonamide 33 ethyl (Z)-3-(1-(4-amino-2-fluorobut-2-en- 1-yl)-5-(N,N-dimethylsulfamoyl)-2- methyl-1H-indol-3-yl)benzoate 34 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-(N,N-dimethylsulfamoyl)-2-methyl-1H- indol-3-yl)benzoic acid 35 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-N- isopropyl-2-methyl-1H-indole-5- carboxamide 36 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-N- isopropyl-N,2-dimethyl-1H-indole-5- carboxamide 37 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-hydroxy-2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 38 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2- methyl-3-(3-(N- methylmethylsulfonamido)phenyl)-1H- indole-5-carboxylic acid 39 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3-(N- methylmethylsulfonamido)phenyl)-1H- indole-5-carboxamide 40 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (5-(N,N-dimethylsulfamoyl)pyridin-3-yl)- 2-methyl-1H-indole-5-carboxylic acid 41 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (5-(N,N-dimethylsulfamoyl)pyridin-3-yl)- N,N,2-trimethyl-1H-indole-5-carboxamide 42 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl- 2-methyl-1H-pyrrolo[3,2-b]pyridine-5- carboxylate 43 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-pyrrolo[3,2-b]pyridine-5- carboxylic acid 44 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-pyrrolo[3,2- b]pyridine-5-carboxamide 45 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-N- isopropyl-2-methyl-1H-pyrrolo[3,2- b]pyridine-5-carboxamide 46 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-N,2- dimethyl-1H-pyrrolo[3,2-b]pyridine-5- carboxamide 47 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-7-carboxamide 48 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-indole-7-carboxylic acid 49 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-methoxy-2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 50 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3- (methylsulfonyl)phenyl)-1H-indole-5- carboxamide 51 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-cyano-2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 52 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-5-carboxamide 53 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl- N,N,2-trimethyl-1H-pyrrolo[3,2- b]pyridine-5-carboxamide 54 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3-sulfamoylphenyl)- 1H-indole-5-carboxamide 55 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-5-(1,2,4-oxadiazol-3-yl)-1H- indol-3-yl)-N,N- dimethylbenzenesulfonamide 56 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3- (trifluoromethyl)phenyl)-1H-indole-5- carboxamide 57 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3- ((trifluoromethyl)sulfonyl)phenyl)-1H- indole-5-carboxamide 58 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-5-sulfonamide 59 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-(difluoromethyl)-2-methyl-1H-indol-3- yl)-N,N-dimethylbenzene-sulfonamide 60 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-hydroxy-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N-dimethylbenzene- sulfonamide 61 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-methoxy-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N-dimethylbenzene- sulfonamide 62 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 63 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 64 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 65 (Z)-4-(5-chloro-2-methyl-3-(5- (methylsulfonyl)pyridin-3-yl)-1H-indol-1- yl)-3-fluorobut-2-en-1-amine 66 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 67 (Z)-5-(1-(4-amino-2-fluorobut-2-en-l-yl)- 6-chloro-2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 68 (Z)-3-fluoro-4-(5-methoxy-2-methyl-3-(3- (methylthio)phenyl)-1H-pyrrolo[3,2- b]pyridin-1-yl)but-2-en-1-amine 69 (Z)-3-fluoro-4-(5-methoxy-2-methyl-3-(3- (methylsulfonyl)phenyl)-1H-pyrrolo[3,2- b]pyridin-1-yl)but-2-en-1-amine 70 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-2-methyl-1H-indol-3-yl)-N- methylpyridine-3-sulfonamide 71 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-fluoro-2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 72 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 6-chloro-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N-dimethylpyridine-3- sulfonamide 73 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-2-methyl-1H-pyrrolo[2,3- b]pyridin-3-yl)-N,N-dimethylpyridine-3- sulfonamide 74 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 7-chloro-2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 75 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 4-chloro-2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 76 (Z)-4-(5-chloro-2-methyl-3-(pyridin-4-yl)- 1H-indol-1-yl)-3-fluorobut-2-en-1-amine 77 (Z)-4-(5-chloro-2-methyl-3-(pyridin-3-yl)- 1H-indol-1-yl)-3-fluorobut-2-en-1-amine 78 (Z)-6-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-2-sulfonamide 79 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-cyclopropyl-2-methyl-1H-indol-3-yl)- N,N-dimethylpyridine-3-sulfonamide 80 (Z)-4-(5-chloro-2-methyl-3-(pyrimidin-5- yl)-1H-indol-1-yl)-3-fluorobut-2-en-1- amine 81 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(pyridin-4-yl)-1H- indole-5-sulfonamide 82 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-7-fluoro-2-methyl-1H-indol-3- yl)-N,N,4-trimethylbenzenesulfonamide 83 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-chloro-2-methyl-1H-indol-3- yl)pyridine-3-sulfonamide 84 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2- methyl-3-(pyridin-4-yl)-1H-indole-5- sulfonamide 85 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-5-(trifluoromethoxy)-1H-indol- 3-yl)-N,N-dimethylpyridine-3- sulfonamide 86 (Z,)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-phenyl-1H-indole-5- sulfonamide 87 (Z)-3-fluoro-4-(2-methyl-5- (methylsulfonyl)-3-phenyl-1H-indol-1- yl)but-2-en-1-amine 88 (Z)-3-fluoro-4-(2-methyl-5- (methylsulfonyl)-3-(pyridin-4-yl)-1H- indol-1-yl)but-2-en-1-amine 89 (Z)-4-(3-(2,6-dimethylpyridin-4-yl)-2- methyl-5-(methylsulfonyl)-1H-indol-1- yl)-3-fluorobut-2-en-1-amine 90 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (2,6-dimethylpyridin-4-yl)-N,N,2- trimethyl-1H-indole-5-carboxamide 91 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N- (tert-butyl)-2-methyl-3-(pyridin-4-yl)-1H- indole-5-carboxamide 92 (Z)-4-(3-(benzo[d][1,3]dioxol-5-yl)-2- methyl-5-(methylsulfonyl)-1H-indol-1- yl)-3-fluorobut-2-en-1-amine 93 (Z)-3-fluoro-4-(3-(4-fluorophenyl)-2- methyl-5-(methylsulfonyl)-1H-indol-1- yl)but-2-en-1-amine 94 (Z)-3-fluoro-4-(2-methyl-3-(2- methylpyridin-4-yl)-5-(methylsulfonyl)- 1H-indol-1-yl)but-2-en-l-amine 95 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (4-fluorophenyl)-2-methyl-1H-indole-5- sulfonamide 96 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-chloro-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 97 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-5-(methylsulfonyl)-1H-indol-3- yl)-N,N-dimethylbenzenesulfonamide 98 (Z)-3-fluoro-4-(3-(2-methoxypyridin-4- yl)-2-methyl-5-(methylsulfonyl)-1H- indol-1-yl)but-2-en-1-amine 99 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-chloro-1H-pyrrolo[3,2-b]pyridin-3-yl)- N,N-dimethylbenzenesulfonamide 100 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-chloro-5-(methylsulfonyl)-1H-indol-3- yl)-N,N-dimethylbenzenesulfonamide 101 (Z)-4-(3-(2,6-dimethylpyridin-4-yl)-2- methyl-5-nitro-1H-indol-1-yl)-3- fluorobut-2-en-1-amine 102 (Z)-N-(1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(2,6-dimethylpyridin-4-yl)-2-methyl- 1H-indol-5-yl)methanesulfonamide 103 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-(methoxymethyl)-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 104 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-5-(methylsulfonamido)-1H- indol-3-yl)-N,N- dimethylbenzenesulfonamide 105 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-(dimethylamino)-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 106 (Z)-3-(1-(4-amino-2-fluorobut-2-en-l-yl)- 5-(isopropylsulfonyl)-2-methyl-1H-indol- 3-yl)-N,N-dimethylbenzenesulfonamide 107 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2,5-dimethyl-1H-pyrrolo[3,2-b]pyridin-3- yl)-N,N-dimethylbenzenesulfonamide 108 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 6-fluoro-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 109 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-fluoro-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 110 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-5-(trifluoromethyl)-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 111 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 5-(1,1-difluoroethyl)-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 112 (Z)-4-(2,5-dimethyl-3-(3- (methylsulfonyl)phenyl)-1H-pyrrolo[3,2- b]pyridin-1-yl)-3-fluorobut-2-en-1-amine 113 (Z)-4-(3-(3-(ethylsulfonyl)phenyl)-2- isopropyl-5-methyl-1H-pyrrolo[3,2- b]pyridin-1-yl)-3-fluorobut-2-en-1-amine 114 (Z)-4-(3-(3-(ethylsulfonyl)phenyl)-2,5- dimethyl-1H-pyrrolo[3,2-b]pyridin-1-yl)- 3-fluorobut-2-en-1-amine 115 (Z)-3-fluoro-4-(5-(fluoromethyl)-2- methyl-3-(3-(methylsulfonyl)phenyl)-1H- pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1- amine 116 (Z)-2-(1-(4-amino-2-fluorobut-2-en-1-yl- 2-methyl-3-(3-(methylsulfonyl)phenyl)- 1H-pyrrolo[3,2-b]pyridin-5-yl)propan-2-ol 117 (Z)-2-(1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(isopropylsulfonyl)phenyl)-2-methyl- 1H-pyrrolo[3,2-b]pyridin-5-yl)propan-2-ol Preparation of Compounds of Formula I Compounds of Formula I can be readily prepared by those skilled in the art using methods and materials known in the art and with reference to standard textbooks, such as “Advanced Organic Chemistry” by Jerry March (third edition, 1985, John Wiley and Sons) or “Comprehensive Organic Transformations” by Richard C. Larock (1989, VCH Publishers). Compounds of Formula I may be synthesised as described below. The following schemes provide an overview of representative non-limiting embodiments of the invention. Those skilled in the art will recognize that analogues of Formula I, including different isomeric forms, may also be prepared from the analogous starting materials. Scheme 1: The preparation of compounds described by Formula I is described in Scheme 1 below. P1 is a functional group used to protect a nitrogen functionality. Examples of P1 are carbonates such as the tert-butyloxycarbonyl (BOC), the 9-fluorenylmethyloxycarbonyl (FMOC), and the benzyloxycarbonyl (CBZ) groups. In general Scheme 1 the starting material described by Formula II can be obtained from commercial sources or can be prepared by many methods well known in the art. Method A involves reaction of this starting material with the anion derived from an appropriately substituted 1,3-dicarbonyl compound, as is described by Formula III. For example, a solution of compounds described by Formulae II and III in a solvent such as N,N-dimethylformamide (DMF) can be treated with a base, such as potassium carbonate, at ambient temperatures for up to 24 hours. The product described by Formula IV can be recovered by standard work-up procedures. One convenient protocol for the conversion of compounds described by Formula IV to compounds described by Formula V is Method B which involves heating at 155° C. in DMSO/H2O (10:1) for several hours. The product described by Formula V can be recovered by standard work-up procedures. One convenient protocol for the conversion of compounds described by Formula V to compounds described by Formula VI is Method C which involves heating with palladium on carbon and ammonium formate at 70° C. in methanol for several hours. The product described by Formula VI can be recovered by standard work-up procedures. One convenient protocol for the conversion of compounds described by Formula VI to compounds described by Formula VII is Method D which involves reaction with 1-bromopyrrolidine-2,5-dione in dichloromethane at ambient temperatures for 1 hour followed by the in situ incorporation of a suitable protecting group. For example if P1 is a BOC protecting group, reaction with 4-(dimethylamino) pyridine and di-tert-butyl dicarbonate will afford the desired protected product. The protected product described by Formula VII can be recovered by standard work-up procedures. In general Scheme 1 Method E involves the use of a Suzuki coupling reaction to combine compounds described by Formulae VII and VIII. There are numerous variants of the Suzuki reaction described in the literature. For example, a solution of the compounds described by Formulae VII and VIII, in the presence of K2CO3, can be dissolved in a solvent such as aqueous dioxane under an atmosphere of nitrogen, then treated with a catalytic amount of tetrakis(triphenylphosphine)palladium(0) and heated at reflux for several hours. Following standard extraction and purification methods, the protected coupled product can be obtained. Conversion of the protected compound to compounds described by Formula IX is readily achieved by the method best suited to removal of the particular protecting group. Whilst there are many ways to achieve the reaction described by Method F, one convenient protocol involves reaction of compounds described by Formulae IX and X with a base such as cesium carbonate in a solvent such as N,N-dimethylfonnamide (DMF) at ambient temperature for approximately 16 hours. Following standard extraction and purification methods the product described by Formula XI can be obtained in good yield and purity. There are many well established chemical procedures for the deprotection of the compounds described by Formula XI to the compounds described by Formula I (Method G). For example if P1 is a BOC protecting group, compounds described by Formula XI can be treated with an acidic reagent such as dry hydrogen chloride in a solvent such as diethyl ether or dichloromethane to furnish the compounds described by Formula I as the hydrochloride salts. In general, the free amino compounds are converted to acid addition salts for ease of handling and for improved chemical stability. Examples of acid addition salts include but are not limited to hydrochloride, hydrobromide, 2,2,2-trifluoroacetate, methanesulfonate and toluenesulfonate salts. Cis/trans (E/Z) isomers may be separated by conventional techniques well known to those skilled in the art, for example, chromatography and fractional crystallisation. Therapeutic Uses and Formulations Another aspect of the present invention relates to a pharmaceutical composition comprising a compound of Formula I, or a pharmaceutically acceptable salt or stereoisomer thereof, together with a pharmaceutically acceptable diluent, excipient or adjuvant. The present invention also relates to use of the compounds of Formula I in therapy, in particular to inhibit members of the lysyl oxidase family members, LOX, LOXL1, LOXL2, LOXL3 and LOXL4. In one embodiment the invention provides for the selective inhibition of specific lysyl oxidase isoenzymes. In another embodiment the invention provides for the simultaneous inhibition of 2, 3 or 4 LOX isoenzymes. The relative inhibitory potencies of the compounds can be determined by the amount needed to inhibit the amine oxidase activity of LOX, LOXL1, LOXL2, LOXL3 and LOXL4 in a variety of ways, e.g., in an in vitro assay with recombinant or purified human protein or with recombinant or purified non-human enzyme, in cellular assays expressing normal rodent enzyme, in cellular assays which have been transfected with human protein, in in vivo tests in rodent and other mammalian species, and the like. Accordingly, a further aspect of the invention is directed to a method of inhibiting the amine oxidase activity of LOX, LOXL1, LOXL2, LOXL3 and LOXL4 in a subject in need thereof, comprising administering to the subject an effective amount of a compound of Formula I, or a pharmaceutically acceptable salt or solvate thereof, or a pharmaceutical composition thereof. In one embodiment the present invention is directed to a method of inhibiting the amine oxidase activity of LOXL2. In another embodiment the present invention is directed towards inhibiting the amine oxidase activity of LOX and LOXL2. As discussed previously, LOX and LOXL1-4 enzymes are members of a large family of flavin-dependent and copper-dependent amine oxidases, which includes SSAO/VAP-1, monoamine oxidase-B (MAO-B) and diamine oxidase (DAO). In one embodiment compounds of the present invention selectively inhibit members of the lysyl oxidase isoenzyme family with respect to SSAO/VAP-1, MAO-B and other members of the amine oxidase family. The present invention also discloses methods to use the compounds described by Formula I to inhibit one or more lysyl oxidase isoenzymes (LOX, LOXL1, LOXL2, LOXL3 and LOXL4) in patients suffering from a fibrotic disease, and methods to treat fibrotic diseases. Furthermore, the present invention discloses methods to use the compounds described by Formula I to inhibit one or more lysyl oxidase isoenzymes (LOX, LOXL1, LOXL2, LOXL3 and LOXL4) in patients suffering from cancer, including metastatic cancer, and methods to treat cancer and metastatic cancer. In a further aspect of the invention there is provided a method of treating a condition associated with LOX, LOXL1, LOXL2, LOXL3 and LOXL4 protein, comprising administering to a subject in need thereof a therapeutically effective amount of compound of Formula I, or a pharmaceutically acceptable salt or solvate thereof, or a pharmaceutical composition thereof. In another aspect there is a provided a method of treating a condition modulated by LOX, LOXL1, LOXL2, LOXL3 and LOXL4, comprising administering to a subject in need thereof a therapeutically effective amount of compound of Formula I, or a pharmaceutically acceptable salt or solvate thereof, or a pharmaceutical composition thereof. In one embodiment of the methods of the present invention the condition is selected from the group consisting of fibrosis, cancer and angiogenesis. In another aspect, the present invention provides a method for decreasing extracellular matrix formation by treating human subjects, pets and livestock with fluoroallylamine inhibitors of lysyl oxidase isoenzyme family of Formula I as described herein. The above-described methods are applicable wherein the condition is a liver disorder. As described herein the term “liver disorder” includes any disorder affecting the liver, and in particular any acute or chronic liver disease that involves the pathological disruption, inflammation, degeneration, and/or proliferation of liver cells. In particular, the liver disorder is liver fibrosis, liver cirrhosis, or any other liver disease in which the level in the plasma of some markers of hepatocellular injury, alteration or necrosis, is elevated when compared to normal plasma levels. These biochemical markers associated to liver activity and status can be selected among those disclosed in the literature and in particular Alanine aminotransferase (ALAT), Aspartate aminotransfersase (ASAT), Alkaline Phosphatase (AP), Gamma Glutamyl transpeptidase (GGT), Cytokeratin-18 (CK-18) or Resistin. In a particular embodiment, the liver disorder is a fatty liver disease in which the elevation of one or more of these markers is associated to a more or less significant steatosis in the liver, as it can be confirmed by a liver biopsy. A non-exhaustive list of fatty liver diseases includes non-alcoholic fatty liver disease (NAFLD), nonalcoholic steatohepatitis (NASH), and fatty liver disease associated to disorders such as hepatitis or metabolic syndrome (obesity, insulin resistance, hypertriglyceridemia, and the like). In one embodiment the liver disorder is selected from the group consisting of biliary atresia, cholestatic liver disease, chronic liver disease, nonalcoholic steatohepatitis (NASH), non-alcoholic fatty liver disease (NAFLD), hepatitis C infection, alcoholic liver disease, primary biliary cirrhosis (PBC), primary schlerosing cholangitis (PSC), liver damage due to progressive fibrosis, liver fibrosis and liver cirrhosis. The above-described methods are applicable wherein the condition is a kidney disorder. In one embodiment the kidney disorder is selected from the group consisiting of kidney fibrosis, renal fibrosis, acute kidney injury, chronic kidney disease, diabetic nephropathy, glomerulosclerosis, vesicoureteral reflux, tubulointerstitial renal fibrosis and glomerulonephritis. The above-described methods are applicable wherein the condition is a cardiovascular disease. In one embodiment the cardiovascular disease is selected from the group consisting of atherosclerosis, arteriosclerosis, hypercholesteremia, and hyperlipidemia. The above-described methods are applicable wherein the condition is fibrosis. As employed here “fibrosis” includes such diseases as cystic fibrosis, idiopathic pulmonary fibrosis, liver fibrosis, kidney fibrosis, scleroderma, radiation-induced fibrosis, ocular fibrosis, Peyronie's disease, scarring and other diseases where excessive fibrosis contributes to disease pathology including Crohn's disease and inflammatory bowel disease. In one embodiment the fibrosis is selected from the group consisting of liver fibrosis, lung fibrosis, kidney fibrosis, cardiac fibrosis, cystic fibrosis, idiopathic pulmonary fibrosis, radiation-induced fibrosis and scleroderma or is associated with respiratory disease, abnormal wound healing and repair, post-surgical operations, cardiac arrest and all conditions where excess or aberrant deposition of fibrous material is associated with disease. In another embodiment the fibrosis is selected from the group consisting of liver fibrosis, lung fibrosis, kidney fibrosis, cardiac fibrosis, and scleroderma. In one embodiment, kidney fibrosis includes, but is not limited to, diabetic nephropathy, vesicoureteral reflux, tubulointerstitial renal fibrosis; glomerulonephritis or glomerular nephritis, including focal segmental glomerulosclerosis and membranous glomerulonephritis, and mesangiocapillary glomerular nephritis. In one embodiment, liver fibrosis results in cirrhosis, and includes associated conditions such as chronic viral hepatitis, non-alcoholic fatty liver disease (NAFLD), alcoholic steatohepantis (ASH), non-alcoholic steatohepatiris (NASH), primary biliary cirrhosis (PBC), biliary cirrhosis, and autoimmune hepatitis. The above-described methods are also applicable wherein the condition is cancer. In one embodiment the cancer is selected from the group consisting of lung cancer; breast cancer; colorectal cancer; anal cancer; pancreatic cancer; prostate cancer; ovarian carcinoma; liver and bile duct carcinoma; esophageal carcinoma; non-Hodgkin's lymphoma; bladder carcinoma; carcinoma of the uterus; glioma, glioblastoma, medullablastoma, and other tumors of the brain; kidney cancer; myelofibrosis, cancer of the head and neck; cancer of the stomach; multiple myeloma; testicular cancer; genn cell tumor; neuroendocrine tumor; cervical cancer; oral cancer; carcinoids of the gastrointestinal tract, breast, and other organs; signet ring cell carcinoma; mesenchymal tumors including sarcomas, fibrosarcomas, haemangioma, angiomatosis, haemangiopericytoma, pseudoangiomatous stromal hyperplasia, myofibroblastoma, fibromatosis, inflammatory myofibroblastic tumour, lipoma, angiolipoma, granular cell tumour, neurofibroma, schwannoma, angiosarcoma, liposarcoma, rhabdomyosarcoma, osteosarcoma, leiomyoma or a leiomysarcoma. In one embodiment the cancer is selected from the group consisting of breast cancer, head and neck squamous cell carcinoma, brain cancer, prostate cancer, renal cell carcinoma, liver cancer, lung cancer, oral cancer, cervical cancer and tumour metastasis. In one embodiment lung cancer includes lung adenocarcinoma, squamous cell carcinoma, large cell carcinoma, bronchoalveolar carcinoma, non-small-cell carcinoma, small cell carcinoma and mesothelioma. In one embodiment breast cancer includes ductal carcinoma, lobular carcinoma, inflammatory breast cancer, clear cell carcinoma, and mucinous carcinoma. In one embodiment colorectal cancer includes colon cancer and rectal cancer. In one embodiment pancreatic cancer includes pancreatic adenocarcinoma, islet cell carcinoma and neuroendocrine tumors. In one embodiment ovarian carcinoma includes ovarian epithelial carcinoma or surface epithelial-stromal tumour including serous tumour, endometrioid tumor and mucinous cystadenocarcinoma, and sex-cord-stromal tumor. In one embodiment liver and bile duct carcinoma includes hepatocelluar carcinoma, cholangiocarcinoma and hemangioma. In one embodiment esophageal carcinoma includes esophageal adenocarcinoma and squamous cell carcinoma. In one embodiment carcinoma of the uterus includes endometrial adenocarcinoma, uterine papillary serous carcinoma, uterine clear-cell carcinoma, uterine sarcomas and leiomyosarcomas and mixed mullerian tumors. In one embodiment kidney cancer includes renal cell carcinoma, clear cell carcinoma and Wilm's tumor. In one embodiment cancer of the head and neck includes squamous cell carcinomas. In one embodiment cancer of the stomach includes stomach adenocarcinoma and gastrointestinal stromal tumor. In one embodiment, the cancer is selected from the group consisting of colon cancer, ovarian cancer, lung cancer, esophageal carcinoma, breast cancer and prostate cancer. The above-described methods are applicable wherein the condition is angiogenesis. In one embodiment of the methods of the present invention the subject is selected from the group consisting of humans, pets and livestock. In another embodiment of the methods of the present invention the subject is a human. A further aspect of the invention provides for use of a compound of Formula I, or a pharmaceutically acceptable salt or solvate thereof, for the manufacture of a medicament for treating a condition associated with LOX, LOXL1, LOXL2, LOXL3 and LOXL4 protein. Another aspect of the invention provides for use of a compound of Formula I, or a pharmaceutically acceptable salt or solvate thereof, for the manufacture of a medicament for treating a condition modulated by LOX, LOXL1, LOXL2, LOXL3 and LOXL4. Pharmaceutical and/or Therapeutic Formulations In another embodiment of the present invention, there are provided compositions comprising a compound having Formula I and at least one pharmaceutically acceptable excipient, carrier or diluent thereof. The compound(s) of Formula I may also be present as suitable salts, including pharmaceutically acceptable salts. The phrase “pharmaceutically acceptable carrier” refers to any carrier known to those skilled in the art to be suitable for the particular mode of administration. In addition, the compounds may be formulated as the sole phannaceutically active ingredient in the composition or may be combined with other active ingredients. The phrase “pharmaceutically acceptable salt” refers to any salt preparation that is appropriate for use in a pharmaceutical application. By pharmaceutically acceptable salt it is meant those salts which, within the scope of sound medical judgement, are suitable for use in contact with the tissues of humans and lower animals without undue toxicity, irritation, allergic response and the like, and are commensurate with a reasonable benefit/risk ratio. Pharmaceutically acceptable salts are well known in the art and include acid addition and base salts. Hemisalts of acids and bases may also be formed. Pharmaceutically acceptable salts include amine salts of mineral acids (e.g., hydrochlorides, hydrobromides, sulfates, and the like); and amine salts of organic acids (e.g., formates, acetates, lactates, malates, tartrates, citrates, ascorbates, succinates, maleates, butyrates, valerates, fumarates, and the like). For compounds of formula (I) having a basic site, suitable pharmaceutically acceptable salts may be acid addition salts. For example, suitable pharmaceutically acceptable salts of such compounds may be prepared by mixing a pharmaceutically acceptable acid such as hydrochloric acid, sulfuric acid, methanesulfonic acid, succinic acid, fumaric acid, maleic acid, benzoic acid, phosphoric acid, acetic acid, oxalic acid, carbonic acid, tartaric acid, or citric acid with the compounds of the invention. S. M. Berge et al. describe pharmaceutically acceptable salts in detail in J. Pharmaceutical Sciences, 1977, 66:1-19. The salts can be prepared in situ during the final isolation and purification of the compounds of the invention, or separately by reacting the free base function with a suitable organic acid. Representative acid addition salts include acetate, adipate, alginate, ascorbate, asparate, benzenesulfonate, benzoate, bisulfate, borate, butyrate, camphorate, camphorsulfonate, citrate, digluconate, cyclopentanepropionate, dodecylsulfate, ethanesulfonate, fumarate, glucoheptonate, glycerophosphate, hemisulfate, heptonate, hexanoate, hydrobromide, hydrochloride, hydroiodide, 2-hydroxy-ethanesulfonate, lactobionate, lactate, laurate, lauryl sulfate, malate, maleate, malonate, methanesulfonate, 2-naphthalenesulfonate, nicotinate, nitrate, oleate, oxalate, palmitate, pamoate, pectinate, persulfate, 3-phenylpropionate, phosphate, picrate, pivalate, propionate, stearate, succinate, sulfate, tartrate, thiocyanate, toluenesulfonate, undecanoate, valerate salts, and the like. Suitable base salts are formed from bases that form non-toxic salts. Examples include the aluminium, arginine, benzathine, calcium, choline, diethylamine, diolamine, glycine, lysine, magnesium, meglumine, olamine, potassium, sodium, tromethamine and zinc salts. Representative alkali or alkaline earth metal salts include sodium, lithium potassium, calcium, magnesium, and the like, as well as non-toxic ammonium, quaternary ammonium, and amine cations, including, but not limited to ammonium, tetramethylammonium, tetraethylammonium, methylamine, dimethylamine, trimethylamine, triethylamine, ethylamine, triethanolamine and the like. Pharmaceutically acceptable salts of compounds of formula I may be prepared by methods known to those skilled in the art, including for example: (i) by reacting the compound of formula I with the desired acid or base; (ii) by removing an acid- or base-labile protecting group from a suitable precursor of the compound of formula I or by ring-opening a suitable cyclic precursor, for example, a lactone or lactam, using the desired acid or base; or (iii) by converting one salt of the compound of formula I to another by reaction with an appropriate acid or base or by means of a suitable ion exchange column. The above reactions (i)-(iii) are typically carried out in solution. The resulting salt may precipitate out and be collected by filtration or may be recovered by evaporation of the solvent. The degree of ionisation in the resulting salt may vary from completely ionised to almost non-ionised. Thus, for instance, suitable pharmaceutically acceptable salts of compounds according to the present invention may be prepared by mixing a pharmaceutically acceptable acid such as hydrochloric acid, sulfuric acid, methanesulfonic acid, succinic acid, fumaric acid, maleic acid, benzoic acid, phosphoric acid, acetic acid, oxalic acid, carbonic acid, tartaric acid, or citric acid with the compounds of the invention. Suitable pharmaceutically acceptable salts of the compounds of the present invention therefore include acid addition salts. The compounds of the invention may exist in both unsolvated and solvated forms. The term ‘solvate’ is used herein to describe a molecular complex comprising the compound of the invention and a stoichiometric amount of one or more pharmaceutically acceptable solvent molecules, for example, ethanol. The term ‘hydrate’ is employed when the solvent is water. In one embodiment the compounds of Formula I may be administered in the fonn of a “prodrug”. The phrase “prodrug” refers to a compound that, upon in vivo administration, is metabolized by one or more steps or processes or otherwise converted to the biologically, pharmaceutically or therapeutically active form of the compound. Prodrugs can be prepared by modifying functional groups present in the compound in such a way that the modifications are cleaved, either in routine manipulation or in vivo, to a compound described herein. For example, prodrugs include compounds of the present invention wherein a hydroxy, amino, or sulfhydryl group is bonded to any group that, when administered to a mammalian subject, can be cleaved to form a free hydroxyl, free amino, or free sulfhydryl group, respectively. Representative prodrugs include, for example, amides, esters, enol ethers, enol esters, acetates, formates, benzoate derivatives, and the like of alcohol and amine functional groups in the compounds of the present invention. The prodrug form can be selected from such functional groups as —C(O)alkyl, —C(O)cycloalkyl, —C(O)aryl, —C(O)-arylalkyl, C(O)heteroaryl, —C(O)-heteroarylalkyl, or the like. By virtue of knowledge of pharmacodynamic processes and drug metabolism in vivo, those of skill in this art, once a pharmaceutically active compound is known, can design prodrugs of the compound (see, e.g., Nogrady (1985) Medicinal Chemistry A Biochemical Approach, Oxford University Press, New York, pages 388-392). Compositions herein comprise one or more compounds provided herein. The compounds are, in one embodiment, formulated into suitable pharmaceutical preparations such as solutions, suspensions, tablets, creams, gels, dispersible tablets, pills, capsules, powders, sustained release formulations or elixirs, for oral administration or in sterile solutions or suspensions for parenteral administration, as well as transdermal patch preparation and dry powder inhalers. In one embodiment, the compounds described above are formulated into pharmaceutical compositions using techniques and procedures well known in the art (see, e.g., Ansel Introduction to Pharmaceutical Dosage Forms, Fourth Edition 1985, 126). In the compositions, effective concentrations of one or more compounds or pharmaceutically acceptable derivatives thereof is (are) mixed with a suitable pharmaceutical carrier. The compounds may be derivatized as the corresponding salts, esters, enol ethers or esters, acetals, ketals, orthoesters, hemiacetals, hemiketals, acids, bases, solvates, hydrates or prodrugs prior to formulation, as described above. The concentrations of the compounds in the compositions are effective for delivery of an amount, upon administration, that treats, prevents, or ameliorates one or more of the symptoms of diseases or disorders to be treated. In one embodiment, the compositions are formulated for single dosage administration. To formulate a composition, the weight fraction of compound is dissolved, suspended, dispersed or otherwise mixed in a selected carrier at an effective concentration such that the treated condition is relieved, prevented, or one or more symptoms are ameliorated. The active compound is included in the pharmaceutically acceptable carrier in an amount sufficient to exert a therapeutically useful effect in the absence of undesirable side effects on the patient treated. The therapeutically effective concentration may be determined empirically by testing the compounds in in vitro and in vivo systems described herein and in PCT publication WO 04/018997, and then extrapolated from there for dosages for humans. The concentration of active compound in the pharmaceutical composition will depend on absorption, distribution, inactivation and excretion rates of the active compound, the physicochemical characteristics of the compound, the dosage schedule, and amount administered as well as other factors known to those of skill in the art. In one embodiment, a therapeutically effective dosage should produce a serum concentration of active ingredient of from about 0.1 ng/mL to about 50-100 μg/mL. The pharmaceutical compositions, in another embodiment, should provide a dosage of from about 0.001 mg to about 2000 mg of compound per kilogram of body weight per day. Pharmaceutical dosage unit forms are prepared to provide from about 0.01 mg, 0.1 mg or 1 mg to about 500 mg, 1000 mg or 2000 mg, and in one embodiment from about 10 mg to about 500 mg of the active ingredient or a combination of essential ingredients per dosage unit form. Dosing may occur at intervals of minutes, hours, days, weeks, months or years or continuously over any one of these periods. Suitable dosages lie within the range of about 0.1 ng per kg of body weight to 1 g per kg of body weight per dosage. The dosage is preferably in the range of 1 μg to 1 g per kg of body weight per dosage, such as is in the range of 1 mg to 1 g per kg of body weight per dosage. Suitably, the dosage is in the range of 1 μg to 500 mg per kg of body weight per dosage, such as 1 μg to 200 mg per kg of body weight per dosage, or 1 μg to 100 mg per kg of body weight per dosage. Other suitable dosages may be in the range of 1 mg to 250 mg per kg of body weight, including 1 mg to 10, 20, 50 or 100 mg per kg of body weight per dosage or 10 μg to 100 mg per kg of body weight per dosage. Suitable dosage amounts and dosing regimens can be determined by the attending physician and may depend on the particular condition being treated, the severity of the condition, as well as the general health, age and weight of the subject. In instances in which the compounds exhibit insufficient solubility, methods for solubilizing compounds may be used. Such methods are known to those of skill in this art, and include, but are not limited to, using cosolvents, such as dimethylsulfoxide (DMSO), using surfactants, such as TWEEN®, dissolution in aqueous sodium bicarbonate, formulating the compounds of interest as nanoparticles, and the like. Derivatives of the compounds, such as prodrugs of the compounds may also be used in formulating effective pharmaceutical compositions. Upon mixing or addition of the compound(s), the resulting mixture may be a solution, suspension, emulsion or the like. The form of the resulting mixture depends upon a number of factors, including the intended mode of administration and the solubility of the compound in the selected carrier or vehicle. The effective concentration is sufficient for ameliorating the symptoms of the disease, disorder or condition treated and may be empirically determined. The pharmaceutical compositions are provided for administration to humans and animals in unit dosage forms, such as tablets, capsules, pills, powders, granules, sterile parenteral solutions or suspensions, and oral solutions or suspensions, and oil-water emulsions containing suitable quantities of the compounds or pharmaceutically acceptable derivatives thereof. The pharmaceutically therapeutically active compounds and derivatives thereof are, in one embodiment, formulated and administered in unit-dosage forms or multiple-dosage forms. The active ingredient may be administered at once, or may be divided into a number of smaller doses to be administered at intervals of time. Unit-dose forms as used herein refers to physically discrete units suitable for human and animal subjects and packaged individually as is known in the art. Each unit-dose contains a predetermined quantity of the therapeutically active compound sufficient to produce the desired therapeutic effect, in association with the required pharmaceutical carrier, vehicle or diluent. Examples of unit-dose forms include ampoles and syringes and individually packaged tablets or capsules. Unit-dose forms may be administered in fractions or multiples thereof. A multiple-dose form is a plurality of identical unit-dosage forms packaged in a single container to be administered in segregated unit-dose form. Examples of multiple-dose forms include vials, bottles of tablets or capsules or bottles of pints or gallons. Hence, multiple dose form is a multiple of unit-doses which are not segregated in packaging. Actual methods of preparing such dosage forms are known, or will be apparent, to those skilled in this art; for example, see Remington's Pharmaceutical Sciences, Mack Publishing Company, Easton, Pa., 15th Edition, 1975. Dosage forms or compositions containing active ingredient in the range of 0.005% to 100% (wt %) with the balance made up from non-toxic carrier may be prepared. Methods for preparation of these compositions are known to those skilled in the art. The contemplated compositions may contain 0.001%-100% (wt %) active ingredient, in one embodiment 0.1-95% (wt %), in another embodiment 75-85% (wt %). Modes of Administration Convenient modes of administration include injection (subcutaneous, intravenous, etc.), oral administration, inhalation, transdermal application, topical creams or gels or powders, vaginal or rectal administration. Depending on the route of administration, the formulation and/or compound may be coated with a material to protect the compound from the action of enzymes, acids and other natural conditions which may inactivate the therapeutic activity of the compound. The compound may also be administered parenterally or intraperitoneally. Compositions for Oral Administration Oral pharmaceutical dosage forms are either solid, gel or liquid. The solid dosage forms are tablets, capsules, granules, and bulk powders. Types of oral tablets include compressed, chewable lozenges and tablets which may be enteric-coated, sugar-coated or film-coated. Capsules may be hard or soft gelatin capsules, while granules and powders may be provided in non-effervescent or effervescent form with the combination of other ingredients known to those skilled in the art. Solid Compositions for Oral Administration In certain embodiments, the formulations are solid dosage forms, in one embodiment, capsules or tablets. The tablets, pills, capsules, troches and the like can contain one or more of the following ingredients, or compounds of a similar nature: a binder; a lubricant; a diluent; a glidant; a disintegrating agent; a coloring agent; a sweetening agent; a flavoring agent; a wetting agent; an emetic coating; and a film coating. Examples of binders include microcrystalline cellulose, gum tragacanth, glucose solution, acacia mucilage, gelatin solution, molasses, polvinylpyrrolidine, povidone, crospovidones, sucrose and starch paste. Lubricants include talc, starch, magnesium or calcium stearate, lycopodium and stearic acid. Diluents include, for example, lactose, sucrose, starch, kaolin, salt, mannitol and dicalcium phosphate. Glidants include, but are not limited to, colloidal silicon dioxide. Disintegrating agents include crosscarmellose sodium, sodium starch glycolate, alginic acid, corn starch, potato starch, bentonite, methylcellulose, agar and carboxymethylcellulose. Coloring agents include, for example, any of the approved certified water soluble FD and C dyes, mixtures thereof; and water insoluble FD and C dyes suspended on alumina hydrate. Sweetening agents include sucrose, lactose, mannitol and artificial sweetening agents such as saccharin, and any number of spray dried flavors. Flavoring agents include natural flavors extracted from plants such as fruits and synthetic blends of compounds which produce a pleasant sensation, such as, but not limited to peppermint and methyl salicylate. Wetting agents include propylene glycol monostearate, sorbitan monooleate, diethylene glycol monolaurate and polyoxyethylene laural ether. Emetic-coatings include fatty acids, fats, waxes, shellac, ammoniated shellac and cellulose acetate phthalates. Film coatings include hydroxyethylcellulose, sodium carboxymethylcellulose, polyethylene glycol 4000 and cellulose acetate phthalate. The compound, or pharmaceutically acceptable derivative thereof, could be provided in a composition that protects it from the acidic environment of the stomach. For example, the composition can be formulated in an enteric coating that maintains its integrity in the stomach and releases the active compound in the intestine. The composition may also be formulated in combination with an antacid or other such ingredient. When the dosage unit form is a capsule, it can contain, in addition to material of the above type, a liquid carrier such as a fatty oil. In addition, dosage unit forms can contain various other materials which modify the physical form of the dosage unit, for example, coatings of sugar and other enteric agents. The compounds can also be administered as a component of an elixir, suspension, syrup, wafer, sprinkle, chewing gum or the like. A syrup may contain, in addition to the active compounds, sucrose as a sweetening agent and certain preservatives, dyes and colorings and flavors. The active materials can also be mixed with other active materials which do not impair the desired action, or with materials that supplement the desired action, such as antacids, H2 blockers, and diuretics. The active ingredient is a compound or pharmaceutically acceptable derivative thereof as described herein. Higher concentrations, up to about 98% by weight of the active ingredient may be included. In all embodiments, tablets and capsules formulations may be coated as known by those of skill in the art in order to modify or sustain dissolution of the active ingredient. Thus, for example, they may be coated with a conventional enterically digestible coating, such as phenylsalicylate, waxes and cellulose acetate phthalate. Liquid Compositions for Oral Administration Liquid oral dosage forms include aqueous solutions, emulsions, suspensions, solutions and/or suspensions reconstituted from non-effervescent granules and effervescent preparations reconstituted from effervescent granules. Aqueous solutions include, for example, elixirs and syrups. Emulsions are either oil-in-water or water-in-oil. Liquid pharmaceutically administrable compositions can, for example, be prepared by dissolving, dispersing, or otherwise mixing an active compound as defined above and optional pharmaceutical adjuvants in a carrier, such as, for example, water, saline, aqueous dextrose, glycerol, glycols, ethanol, and the like, to thereby form a solution or suspension. If desired, the pharmaceutical composition to be administered may also contain minor amounts of nontoxic auxiliary substances such as wetting agents, emulsifying agents, solubilizing agents, pH buffering agents and the like, for example, acetate, sodium citrate, cyclodextrine derivatives, sorbitan monolaurate, triethanolamine sodium acetate, triethanolamine oleate, and other such agents. Elixirs are clear, sweetened, hydroalcoholic preparations. Pharmaceutically acceptable carriers used in elixirs include solvents. Syrups are concentrated aqueous solutions of a sugar, for example, sucrose, and may contain a preservative. An emulsion is a two-phase system in which one liquid is dispersed in the form of small globules throughout another liquid. Pharmaceutically acceptable carriers used in emulsions are non-aqueous liquids, emulsifying agents and preservatives. Suspensions use pharmaceutically acceptable suspending agents and preservatives. Pharmaceutically acceptable substances used in non-effervescent granules, to be reconstituted into a liquid oral dosage form, include diluents, sweeteners and wetting agents. Pharmaceutically acceptable substances used in effervescent granules, to be reconstituted into a liquid oral dosage form, include organic acids and a source of carbon dioxide. Coloring and flavoring agents are used in all of the above dosage forms. Solvents include glycerin, sorbitol, ethyl alcohol and syrup. Examples of preservatives include glycerin, methyl and propylparaben, benzoic acid, sodium benzoate and ethanol. Examples of non-aqueous liquids utilized in emulsions include mineral oil and cottonseed oil. Examples of emulsifying agents include gelatin, acacia, tragacanth, bentonite, and surfactants such as polyoxyethylene sorbitan monooleate. Suspending agents include sodium carboxymethylcellulose, pectin, tragacanth, Veegum and acacia. Sweetening agents include sucrose, syrups, glycerin and artificial sweetening agents such as saccharin. Wetting agents include propylene glycol monostearate, sorbitan monooleate, diethylene glycol monolaurate and polyoxyethylene lauryl ether. Organic acids include citric and tartaric acid. Sources of carbon dioxide include sodium bicarbonate and sodium carbonate. Coloring agents include any of the approved certified water soluble FD and C dyes, and mixtures thereof. Flavoring agents include natural flavors extracted from plants such fruits, and synthetic blends of compounds which produce a pleasant taste sensation. For a solid dosage form, the solution or suspension, in for example propylene carbonate, vegetable oils or triglycerides, is in one embodiment encapsulated in a gelatin capsule. For a liquid dosage form, the solution, e.g., for example, in a polyethylene glycol, may be diluted with a sufficient quantity of a pharmaceutically acceptable liquid carrier, e.g., water, to be easily measured for administration. Alternatively, liquid or semi-solid oral formulations may be prepared by dissolving or dispersing the active compound or salt in vegetable oils, glycols, triglycerides, propylene glycol esters (e.g., propylene carbonate) and other such carriers, and encapsulating these solutions or suspensions in hard or soft gelatin capsule shells. Other useful formulations include those set forth in U.S. Pat. Nos. RE28,819 and 4,358,603. Briefly, such formulations include, but are not limited to, those containing a compound provided herein, a dialkylated mono- or poly-alkylene glycol, including, but not limited to, 1,2-dimethoxymethane, diglyme, triglyme, tetraglyme, polyethylene glycol-350-dimethyl ether, polyethylene glycol-550-dimethyl ether, polyethylene glycol-750-dimethyl ether wherein 350, 550 and 750 refer to the approximate average molecular weight of the polyethylene glycol, and one or more antioxidants, such as butylated hydroxytoluene (BHT), butylated hydroxyanisole (BHA), propyl gallate, vitamin E, hydroquinone, hydroxycoumarins, ethanolamine, lecithin, cephalin, ascorbic acid, malic acid, sorbitol, phosphoric acid, thiodipropionic acid and its esters, and dithiocarbamates. Other formulations include, but are not limited to, aqueous alcoholic solutions including a phannaceutically acceptable acetal. Alcohols used in these formulations are any pharmaceutically acceptable water-miscible solvents having one or more hydroxyl groups, including, but not limited to, propylene glycol and ethanol. Acetals include, but are not limited to, di(lower alkyl) acetals of lower alkyl aldehydes such as acetaldehyde diethyl acetal. Injectables, Solutions and Emulsions Parenteral administration, in one embodiment characterized by injection, either subcutaneously, intramuscularly or intravenously is also contemplated herein. Injectables can be prepared in conventional forms, either as liquid solutions or suspensions, solid forms suitable for solution or suspension in liquid prior to injection, or as emulsions. The injectables, solutions and emulsions also contain one or more excipients. Suitable excipients are, for example, water, saline, dextrose, glycerol or ethanol. In addition, if desired, the pharmaceutical compositions to be administered may also contain minor amounts of non-toxic auxiliary substances such as wetting or emulsifying agents, pH buffering agents, stabilizers, solubility enhancers, and other such agents, such as for example, sodium acetate, sorbitan monolaurate, triethanolamine oleate and cyclodextrins. Implantation of a slow-release or sustained-release system, such that a constant level of dosage is maintained is also contemplated herein. Briefly, a compound provided herein is dispersed in a solid inner matrix, e.g., polymethylmethacrylate, polybutylmethacrylate, plasticized or unplasticized polyvinylchloride, plasticized nylon, plasticized polyethyleneterephthalate, natural rubber, polyisoprene, polyisobutylene, polybutadiene, polyethylene, ethylene-vinylacetate copolymers, silicone rubbers, polydimethylsiloxanes, silicone carbonate copolymers, hydrophilic polymers such as hydrogels of esters of acrylic and methacrylic acid, collagen, cross-linked polyvinylalcohol and cross-linked partially hydrolyzed polyvinyl acetate, that is surrounded by an outer polymeric membrane, e.g., polyethylene, polypropylene, ethylene/propylene copolymers, ethylene/ethyl acrylate copolymers, ethylene/vinylacetate copolymers, silicone rubbers, polydimethyl siloxanes, neoprene rubber, chlorinated polyethylene, polyvinylchloride, vinylchloride copolymers with vinyl acetate, vinylidene chloride, ethylene and propylene, ionomer polyethylene terephthalate, butyl rubber epichlorohydrin rubbers, ethylene/vinyl alcohol copolymer, ethylene/vinyl acetate/vinyl alcohol terpolymer, and ethylene/vinyloxyethanol copolymer, that is insoluble in body fluids. The compound diffuses through the outer polymeric membrane in a release rate controlling step. The percentage of active compound contained in such parenteral compositions is highly dependent on the specific nature thereof, as well as the activity of the compound and the needs of the subject. Parenteral administration of the compositions includes intravenous, subcutaneous and intramuscular administrations. Preparations for parenteral administration include sterile solutions ready for injection, sterile dry soluble products, such as lyophilized powders, ready to be combined with a solvent just prior to use, including hypodermic tablets, sterile suspensions ready for injection, sterile dry insoluble products ready to be combined with a vehicle just prior to use and sterile emulsions. The solutions may be either aqueous or nonaqueous. If administered intravenously, suitable carriers include physiological saline or phosphate buffered saline (PBS), and solutions containing thickening and solubilizing agents, such as glucose, polyethylene glycol, and polypropylene glycol and mixtures thereof. Pharmaceutically acceptable carriers used in parenteral preparations include aqueous vehicles, nonaqueous vehicles, antimicrobial agents, isotonic agents, buffers, antioxidants, local anesthetics, suspending and dispersing agents, emulsifying agents, sequestering or chelating agents and other pharmaceutically acceptable substances. Examples of aqueous vehicles include Sodium Chloride Injection, Ringers Injection, Isotonic Dextrose Injection, Sterile Water Injection, Dextrose and Lactated Ringers Injection. Nonaqueous parenteral vehicles include fixed oils of vegetable origin, olive oil, cottonseed oil, corn oil, sesame oil and peanut oil. Antimicrobial agents in bacteriostatic or fungistatic concentrations must be added to parenteral preparations packaged in multiple-dose containers which include phenols or cresols, mercurials, benzyl alcohol, chlorobutanol, methyl and propyl p-hydroxybenzoic acid esters, thimerosal, benzalkonium chloride and benzethonium chloride. Isotonic agents include sodium chloride and dextrose. Buffers include phosphate and citrate. Antioxidants include sodium bisulfate. Local anesthetics include procaine hydrochloride. Suspending and dispersing agents include sodium carboxymethylcelluose, hydroxypropyl methylcellulose and polyvinylpyrrolidone. Emulsifying agents include Polysorbate 80 (TWEEN® 80). A sequestering or chelating agent of metal ions include EDTA. Pharmaceutical carriers also include ethyl alcohol, polyethylene glycol and propylene glycol for water miscible vehicles; and sodium hydroxide, hydrochloric acid, citric acid or lactic acid for pH adjustment. The concentration of the pharmaceutically active compound is adjusted so that an injection provides an effective amount to produce the desired pharmacological effect. The exact dose depends on the age, weight and condition of the patient or animal as is known in the art. The unit-dose parenteral preparations are packaged in an ampule, a vial or a syringe with a needle. All preparations for parenteral administration must be sterile, as is known and practiced in the art. Illustratively, intravenous or intraarterial infusion of a sterile aqueous solution containing an active compound is an effective mode of administration. Another embodiment is a sterile aqueous or oily solution or suspension containing an active material injected as necessary to produce the desired pharmacological effect. Injectables are designed for local and systemic administration. In one embodiment, a therapeutically effective dosage is formulated to contain a concentration of at least about 0.1% w/w up to about 90% w/w or more, in certain embodiments more than 1% w/w of the active compound to the treated tissue(s). The compound may be suspended in micronized or other suitable form or may be derivatized to produce a more soluble active product or to produce a prodrug. The form of the resulting mixture depends upon a number of factors, including the intended mode of administration and the solubility of the compound in the selected carrier or vehicle. The effective concentration is sufficient for ameliorating the symptoms of the condition and may be empirically determined. Lyophilized Powders Of interest herein are also lyophilized powders, which can be reconstituted for administration as solutions, emulsions and other mixtures. They may also be reconstituted and formulated as solids or gels. The sterile, lyophilized powder is prepared by dissolving a compound provided herein, or a pharmaceutically acceptable derivative thereof, in a suitable solvent. The solvent may contain an excipient which improves the stability or other pharmacological component of the powder or reconstituted solution, prepared from the powder. Excipients that may be used include, but are not limited to, dextrose, sorbital, fructose, corn syrup, xylitol, glycerin, glucose, sucrose or other suitable agent. The solvent may also contain a buffer, such as citrate, sodium or potassium phosphate or other such buffer known to those of skill in the art at, in one embodiment, about neutral pH. Subsequent sterile filtration of the solution followed by lyophilization under standard conditions known to those of skill in the art provides the desired formulation. In one embodiment, the resulting solution will be apportioned into vials for lyophilization. Each vial will contain a single dosage or multiple dosages of the compound. The lyophilized powder can be stored under appropriate conditions, such as at about 4° C. to room temperature. Reconstitution of this lyophilized powder with water for injection provides a formulation for use in parenteral administration. For reconstitution, the lyophilized powder is added to sterile water or other suitable carrier. The precise amount depends upon the selected compound. Such amount can be empirically determined. Topical Administration Topical mixtures are prepared as described for the local and systemic administration. The resulting mixture may be a solution, suspension, emulsions or the like and are formulated as creams, gels, ointments, emulsions, solutions, elixirs, lotions, suspensions, tinctures, pastes, foams, aerosols, irrigations, sprays, suppositories, bandages, dermal patches or any other formulations suitable for topical administration. The compounds or pharmaceutically acceptable derivatives thereof may be formulated as aerosols for topical application, such as by inhalation. These formulations for administration to the respiratory tract can be in the form of an aerosol or solution for a nebulizer, or as a microfine powder for insufflation, alone or in combination with an inert carrier such as lactose. In such a case, the particles of the formulation will, in one embodiment, have diameters of less than 50 microns, in one embodiment less than 10 microns. The compounds may be formulated for local or topical application, such as for topical application to the skin and mucous membranes, such as in the eye, in the form of gels, creams, and lotions and for application to the eye or for intracisternal or intraspinal application. Topical administration is contemplated for transdermal delivery and also for administration to the eyes or mucosa, or for inhalation therapies. Nasal solutions of the active compound alone or in combination with other pharmaceutically acceptable excipients can also be administered. These solutions, particularly those intended for ophthalmic use, may be formulated as 0.01%-10% (vol %) isotonic solutions, pH about 5-7, with appropriate salts. Compositions for Other Routes of Administration Other routes of administration, such as transdermal patches, including iontophoretic and electrophoretic devices, vaginal and rectal administration, are also contemplated herein. Transdermal patches, including iontophoretic and electrophoretic devices, are well known to those of skill in the art. For example, pharmaceutical dosage forms for rectal administration are rectal suppositories, capsules and tablets for systemic effect. Rectal suppositories are used herein mean solid bodies for insertion into the rectum which melt or soften at body temperature releasing one or more pharmacologically or therapeutically active ingredients. Pharmaceutically acceptable substances utilized in rectal suppositories are bases or vehicles and agents to raise the melting point. Examples of bases include cocoa butter (theobroma oil), glycerin-gelatin, carbowax (polyoxyethylene glycol) and appropriate mixtures of mono-, di- and triglycerides of fatty acids. Combinations of the various bases may be used. Agents to raise the melting point of suppositories include spermaceti and wax. Rectal suppositories may be prepared either by the compressed method or by molding. The weight of a rectal suppository, in one embodiment, is about 2 to 3 gm. Tablets and capsules for rectal administration are manufactured using the same pharmaceutically acceptable substance and by the same methods as for formulations for oral administration. Targeted Formulations The compounds provided herein, or pharmaceutically acceptable derivatives thereof, may also be formulated to be targeted to a particular tissue, receptor, or other area of the body of the subject to be treated. Many such targeting methods are well known to those of skill in the art. All such targeting methods are contemplated herein for use in the instant compositions. In one embodiment, liposomal suspensions, including tissue-targeted liposomes, such as tumor-targeted liposomes, may also be suitable as pharmaceutically acceptable carriers. These may be prepared according to methods known to those skilled in the art. For example, liposome formulations may be prepared as described in U.S. Pat. No. 4,522,811. Briefly, liposomes such as multilamellar vesicles (MLV's) may be formed by drying down egg phosphatidyl choline and brain phosphatidyl serine (7:3 molar ratio) on the inside of a flask. A solution of a compound provided herein in phosphate buffered saline lacking divalent cations (PBS) is added and the flask shaken until the lipid film is dispersed. The resulting vesicles are washed to remove unencapsulated compound, pelleted by centrifugation, and then resuspended in PBS. Co-Administration with Other Drugs In accordance with another aspect of the present invention, it is contemplated that compounds of Formula I as described herein may be administered to a subject in need thereof in combination with medication considered by those of skill in the art to be current standard of care for the condition of interest. Such combinations provide one or more advantages to the subject, e.g., requiring reduced dosages to achieve similar benefit, obtaining the desired palliative effect in less time, and the like. Compounds in accordance with the present invention may be administered as part of a therapeutic regimen with other drugs. It may desirable to administer a combination of active compounds, for example, for the purpose of treating a particular disease or condition. Accordingly, it is within the scope of the present invention that two or more pharmaceutical compositions, at least one of which contains a compound of Formula (I) according to the present invention, may be combined in the form of a kit suitable for co-administration of the compositions. In one embodiment of the methods of the present inventions a compound of Formula I may be administered with a second therapeutic agent. In one embodiment the second therapeutic agent is selected from the group consisting of an anti-cancer agent, an anti-inflammatory agent, an anti-hypertensive agent, an anti-fibrotic agent, an anti-angiogenic agent and an immunosuppressive agent. When two or more active ingredients are co-administered, the active ingredients may be administered simultaneously, sequentially or separately. In one embodiment the compound of Formula I is co-administered simultaneously with a second therapeutic agent. In another embodiment the compound of Formula I and the second therapeutic agent are administered sequentially. In a further embodiment the compound of Formula I and the second therapeutic agent are administered separately. The invention will now be described in greater detail, by way of illustration only, with reference to the following non-limiting examples. The examples are intended to serve to illustrate the invention and should not be construed as limiting the generality of the disclosure of the description throughout this specification. Example 1 Preparation of (Z)-tert-butyl (4-bromo-3-fluorobut-2-en-1-yl)carbamate Procedure A: Preparation of tert-butyl 2-oxoethylcarbamate To a stirring solution of 3-amino-1,2-propanediol (20.0 g, 0.22 mol) in water (200 mL) at 0-5° C. was added di-tert-butyl dicarbonate (55.5 mL, 0.24 mol). After adjusting the alkalinity of the solution to pH˜9 by addition of aq. NaOH (6 N), the mixture was left to stir at rt for 18 h. The reaction mixture was cooled to 0-5° C. and then acidified to pH˜6 before the addition of sodium metaperiodate (56.3 g, 0.26 mol). The resulting suspension was stirred at rt for 2 h. The mixture was filtered to remove all solids and the filtrate was transferred to a separatory funnel and extracted with ethyl acetate (200 mL). Sodium chloride was added to the aqueous layer until a saturated solution was obtained. The aqueous layer was then extracted further with ethyl acetate (100 mL). The combined organics were dried over Na2SO4 and then concentrated in vacuo to give crude tert-butyl 2-oxoethylcarbamate (45.7 g) as a yellow gum. The crude material was used in the subsequent step without purification. Procedure B: Preparation of (E)-ethyl 4-(tert-butoxycarbonylamino)-2-fluorobut-2-enoate and (Z)-ethyl 4-(tert-butoxycarbonylamino)-2-fluorobut-2-enoate To a stirring suspension of crude tert-butyl 2-oxoethylcarbamate (43.7 g, 0.22 mol) and magnesium sulfate (32.0 g) in acetonitrile (200 mL) at 0° C. under N2 was added sequentially ethyl 2-fluorophosphonoacetate (55.7 mL, 0.27 mol) and 1,8-diazabicyclo[5.4.0]undec-7-ene (32.8 mL, 0.22 mol). The reaction mixture was allowed to warm to rt and stirring was continued for 3 h. After removing the solvent under reduced pressure the residue was taken up in ethyl acetate (200 mL) and then transferred to a separatory funnel. The organics were washed successively with aq. HCl (2 M; 100 mL×2), aq. NaOH (2 M; 100 mL×2) and brine (100 mL). After drying over MgSO4, the organics were concentrated in vacuo to give the crude, desired product as a mixture of E/Z isomers (2:3; 57.0 g). This crude material was progressed to the next step without purification. Procedure C: Preparation of (E)-tert-butyl 3-fluoro-4-hydroxybut-2-enylcarbamate and (Z)-tert-butyl 3-fluoro-4-hydroxybut-2-enylcarbamate To a stirring solution of crude E/Z-ethyl 4-(tert-butoxycarbonylamino)-2-fluorobut-2-enoate (18.0 g, 72.8 mmol) in THF (150 mL) at 0° C. under N2 was added diisobutylaluminum hydride (1 M in toluene, 182 mL, 182 mmol) dropwise over 45 min. After complete addition, the mixture was left to stir at 0° C. for 3 h. The reaction mixture was transferred to a separatory funnel and added dropwise to a stirring mixture of ice (100 g) and aq. NaOH (2 M; 200 mL). Following addition the mixture was stirred for 2 h. The quenched reaction mixture was extracted with diethyl ether (100 mL×2) and the combined organics were washed with brine (100 mL). After drying over MgSO4 the organics were concentrated in vacuo to give the crude alcohol as a mixture of E/Z isomers. This mixture was purified over silica gel (135 g), eluting with 25% ethyl acetate in n-hexane to give (Z)-tert-butyl 3-fluoro-4-hydroxybut-2-enylcarbamate (6.20 g, 30% over three steps) and (E)-tert-butyl 3-fluoro-4-hydroxybut-2-enylcarbamate (1.85 g, 8.9% over three steps). (E)-tert-butyl 3-fluoro-4-hydroxybut-2-enylcarbamate: 1H-NMR (200 MHz; CDCl3) δ ppm: 1.43 (9H, s), 3.72 (2H, dd, J 7.5, 5.4 Hz), 4.25 (2H, d, J 21.5 Hz), 4.85 (1H, br. s), 5.18 (1H, dt, J 19.2, 8.5 Hz). (Z)-tert-butyl 3-fluoro-4-hydroxybut-2-enylcarbamate: 1H-NMR (300 MHz; CDCl3) δ ppm: 1.46 (9H, s), 3.84 (2H, dd, J 6.2, 6.2 Hz), 4.13 (2H, d, J 13.9 Hz), 4.68 (1H, br. s), 5.03 (1H, dt, J 36.0, 7.1 Hz). Procedure D: Preparation of (Z)-tert-butyl 4-bromo-3-fluorobut-2-enylcarbamate To a stirring solution of (Z)-tert-butyl 3-fluoro-4-hydroxybut-2-enylcarbamate (6.20 g, 30.2 mmol) and triethylamine (6.32 mL, 45.3 mmol) in acetone (100 mL) at 0° C. was added methanesulfonyl chloride (2.81 mL, 36.3 mmol) dropwise. After complete addition the mixture was left to stir at 0° C. for 30 min. After this time, lithium bromide (13.1 g, 0.15 mol) was added portionwise and the resulting suspension was stirred for a further 2 h. The reaction mixture was filtered to remove all solids and the filtrate was concentrated under reduced pressure. The residue was partitioned between water (50 mL) and CH2Cl2 (50 mL) and the aqueous layer was extracted with further CH2Cl2 (50 mL×2). The combined organics were dried over Na2SO4 and concentrated in vacuo. The crude residue was purified over silica gel (100 g) eluting with n-hexane followed by 25% ethyl acetate in n-hexane to afford (Z)-tert-butyl 4-bromo-3-fluorobut-2-enylcarbamate (7.00 g, 86%) as a colourless solid. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.46 (9H, s), 3.85 (2H, dd, J 6.2, 6.2 Hz), 3.93 (2H, d, J 19.5 Hz), 4.66 (1H, br. s), 5.16 (1H, dt, J 34.0, 6.5 Hz). Example 2 Preparation of (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-indole-5-carboxamide hydrochloride (Compound 6) Procedure E: Preparation of 3-bromo-N,N,-dimethylbenzenesulfonamide To a stirring solution of dimethylamine (6.00 mL, 40% w/w aqueous solution) in THF (20 mL) at 5° C. was added a solution of 3-bromobenzenesulfonyl chloride (5.11 g, 20 mmol) in THF (10 mL) over 5 min. Following addition, the mixture was left to stir at rt for 10 min. The reaction mixture was then concentrated in vacuo and the resultant residue partitioned between water (25 mL) and CH2Cl2 (20 mL) and the aqueous layer extracted with further CH2Cl2 (20 mL×2). The combined organics were dried over Na2SO4 and concentrated in vacuo to afford 3-bromo-N,N,-dimethylbenzenesulfonamide (5.30 g, Quant.) as white crystals. 1H-NMR (300 MHz; CDCl3) δ ppm: 2.76 (6H, s), 7.44 (1H, dt, J 7.8, 0.3 Hz), 7.71-7.77 (2H, m), 7.94 (1H, dt, J 1.8, 0.3 Hz). Procedure F: Preparation of N,N-dimethyl-3-(4,4,5,5-tetramethyl-1,3,2-dioxaborolan-2-yl)benzene sulfonamide A stirring solution of 3-bromo-N,N-dimethyl-benzenesulfonamide (2.0 g, 7.57 mmol) 4,4,5,5-tetramethyl-2-(4,4,5,5-tetramethyl-1,3,2-dioxaborolan-2-yl)-1,3,2-dioxaborolane (2.31 g, 9.09 mmol) and potassium acetate (2.23 g, 22.7 mmol) in 1,4-dioxane (40 mL) was flushed with nitrogen for 15 min before the addition of 1,1′-bis(diphenylphosphino)ferrocene-palladium(II)dichloride dichloromethane complex (309 mg, 0.38 mmol). The resultant solution was heated at 80° C. under nitrogen for 16 h. The mixture was cooled to rt, filtered through Celite™, and then partitioned between ethyl acetate (20 mL) and water. The organic layer was separated and the aqueous layer was extracted with further ethyl acetate (20 mL×2). The combined organics were then washed with brine, dried over Na2SO4 and concentrated in vacuo. The crude residue thus obtained was purified over silica gel (40 g), eluting with 20% ethyl acetate in n-hexane, to afford N,N-dimethyl-3-(4,4,5,5-tetramethyl-1,3,2-dioxaborolan-2-yl)benzenesulfonamide (1.60 g, 68%) as a white solid. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.37 (12H, s), 2.74 (6H, s), 7.56 (1H, dd, J 7.4, 7.4 Hz), 7.88 (1H, ddd, J 7.9, 1.9, 1.3 Hz), 8.03 (1H, dd, J 7.4, 1.1 Hz), 8.22 (1H, br. s). Procedure G: Preparation of ethyl 3-(1-ethoxycarbonyl-2-oxo-propyl)-4-nitro-benzoate To a stirring mixture of ethyl 3-fluoro-4-nitro-benzoate (5.30 g, 24.9 mmol) and ethyl acetoacetate (3.80 mL, 29.9 mmol) in DMF (25 mL) at rt was added potassium carbonate (6.87 g, 49.8 mmol). The reaction mixture was stirred at rt overnight and then poured onto aq. HCl (1 M, 40 mL). The mixture was further diluted with water (200 mL) and extracted with EtOAc (100 mL×3). The combined organic layers were washed with saturated NH4Cl solution (50 mL) and brine (50 mL), dried over Na2SO4 and concentrated in vacuo to afford ethyl 3-(1-ethoxycarbonyl-2-oxo-propyl)-4-nitro-benzoate (8.70 g, 97%) as a yellow oil. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.13 (3H, t, J 6.9 Hz), 1.44 (3H, t, J 7.2 Hz), 1.90 (3H, s), 2.29 (1H, s), 4.17-4.31 (2H, m), 4.44 (2H, q, J 6.9 Hz), 7.99 (1H, d, J 1.8 Hz), 8.02 (1H, d, J 8.5 Hz), 8.12 (1H, d, J 8.5 Hz), 13.07 (1H, s). Procedure H: Preparation of ethyl 3-acetonyl-4-nitro-benzoate A stirring mixture of ethyl 3-(1-ethoxycarbonyl-2-oxo-propyl)-4-nitro-benzoate (8.70 g, 24.2 mmol) and water (7 mL) in DMSO (70 mL) was heated at 155° C. for 2 h. The mixture was then cooled to rt, diluted with water (250 mL) and extracted with EtOAc (200 mL×3). The combined organic layers were washed with brine (50 mL), dried over Na2SO4 and concentrated in vacuo. The crude residue thus obtained was purified over silica gel (100 g), eluting with 25%, then 40% ethyl acetate in n-hexane, to afford ethyl 3-acetonyl-4-nitro-benzoate (5.03 g, 83%) as a light yellow solid. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.43 (3H, t, J 7.2 Hz), 2.35 (3H, s), 4.22 (2H, s), 4.45 (2H, q, J 7.2 Hz), 7.96 (1H, d, J 1.2 Hz), 8.10-8.18 (2H, in). Procedure I: Preparation of ethyl 2-methyl-1H-indole-5-carboxylate To a stirring solution of methyl 3-acetonyl-4-nitro-benzoate (600 mg, 2.53 mmol) and ammonium formate (7.92 g, 125 mmol) in methanol (120 mL) was added palladium on carbon (10% w/w; 3.20 g), suspended in water (4.5 mL), under a nitrogen blanket. The mixture was then immersed in a preheated oil bath and heated at reflux for 1 h. The reaction was allowed to cool to rt and filtered through Celite™, washing with methanol (10 mL×2). The filtrate was concentrated and then taken up in CH2Cl2 (200 mL), washed with water (50 mL×2), dried over Na2SO4 and concentrated in vacuo to afford ethyl 2-methyl-1H-indole-5-carboxylate (3.70 g, 91%) as an off-white solid. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.43 (3H, t, J 7.2 Hz), 2.47 (3H, s), 4.40 (2H, q, J 7.2 Hz), 6.33 (1H, s), 7.29 (1H, d, J 9.0 Hz), 7.86 (1H, dd, J 9.0, 1.8 Hz), 8.16 (1H, br.s), 8.30 (1H, d, J 1.8 Hz). Procedure J: Preparation of 1-(tert-butyl) 5-ethyl 3-bromo-2-methyl-1H-indole-1,5-dicarboxylate To a stirring solution of ethyl 2-methyl-1H-indole-5-carboxylate (500 mg, 2.46 mmol) in CH2Cl2 (15 mL) at rt under nitrogen was added 1-bromopyrrolidine-2,5-dione (460 mg, 2.58 mmol) in one lot. The resulting mixture was stirred at rt for 1 h then cooled to 0° C. before addition of 4-(dimethylamino) pyridine (300 mg, 2.46 mmol) followed by a solution of di-tert-butyl dicarbonate (1.07 g, 4.9 mmol) in of CH2Cl2 (5 mL). The mixture was allowed to slowly warm to rt over 1 h, concentrated in vacuo and purified over silica gel (40 g), eluting with 10% ethyl acetate in n-hexane, to afford 1-(tert-butyl) 5-ethyl 3-bromo-2-methyl-1H-indole-1,5-dicarboxylate (760 mg, 81%) as a white solid. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.45 (3H, t, J 7.2 Hz), 1.71 (9H, s), 2.68 (3H, s), 4.44 (2H, q, J 7.2 Hz), 8.02 (1H, dd, J 9.0, 1.8 Hz), 8.16 (1H, dd, J 9.0 Hz), 8.19 (1H, d, J 1.8 Hz). Procedure K: Preparation of ethyl 3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate A stirred solution of 1-(tert-butyl) 5-ethyl 3-bromo-2-methyl-1H-indole-1,5-dicarboxylate (900 mg, 2.35 mmol), N,N-dimethyl-3-(4,4,5,5-tetramethyl-1,3,2-dioxaborolan-2-yl)benzenesulfonamide (186 mg, 0.60 mmol), aqueous potassium carbonate solution (21.2 mL, 42.4 mmol) and 1,4-dioxane (9 mL) was degassed by passing nitrogen through it for 5 mins. Tetrakis(triphenylphosphine)palladium(0) (272 mg, 0.24 mmol) was then added under nitrogen and the reaction mixture heated at 90° C. over 16 h. The reaction was allowed to cool to rt and filtered through Celite™, washing with ethyl acetate (20 mL). The organic layer was separated and the aqueous layer extracted with ethyl acetate (20 mL×2). The combined organic layers were dried over Na2SO4 and concentrated in vacuo. The residue thus obtained was then dissolved in CH2Cl2 (4 mL) with stirring and trifluoroacetic acid (4 mL) added. The mixture was stirred at rt for 1 hour, then concentrated in vacuo. Methanol (5 mL) was added to the residue and the resulting precipitate was filtered, washed with MeOH (1 mL×2), and dried under vacuum to afford ethyl 3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate (585 mg, 51%) as a yellow solid. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.41 (3H, t, J 7.1 Hz), 2.56 (3H, s), 2.84 (6H, s), 4.39 (2H, q, J 7.0 Hz), 7.39 (1H, d, J 8.5 Hz), 7.69 (1H, d, J 7.7 Hz), 7.75-7.80 (2H, m), 8.27 (1H, br. s), 8.36 (1H, br. s). Procedure L: Preparation of ethyl (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate A mixture of ethyl 3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate (130 mg, 0.34 mmol), cesium carbonate (132 mg, 0.4 mmol) and tert-butyl (Z)-(4-bromo-3-fluorobut-2-en-1-yl)carbamate (99.0 mg, 0.37 mmol) in DMF (1.3 mL) was stirred at rt overnight. Water (13 mL) was then added, followed by brine (2.6 mL). The resulting suspension was stirred at rt for 5 mins and the precipitate was filtered and dried under vacuum. The crude solid thus obtained was purified over silica gel (25 g) eluting with a mixture of n-hexane, DCM and ethyl acetate in a ratio of 4:4:1, then 2:2:1 to afford ethyl (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate (150 mg, 78%) as a light grey oil. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.40 (3H, t, J 7.1 Hz), 1.42 (9H, s), 2.51 (3H, s), 2.83 (6H, s), 3.82 (2H, apparent t, J 5.2 Hz), 4.38 (2H, q, J 7.1 Hz), 4.73-4.87 (1H, m), 4.86 (2H, d, J 9.8 Hz), 7.35 (1H, d, J 8.7 Hz), 7.65-7.79 (3H, m), 7.90 (1H, dd, J 1.6, 1.6 Hz), 7.97 (11H, dd, J 8.7, 1.6 Hz), 8.33 (1H, d, J 1.2 Hz). Procedure M: Preparation of (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1 yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid To a stirring solution of ethyl (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate (469 mg, 0.82 mmol) in MeOH (18 mL) was added aqueous KOH solution (10% w/w; 9 mL). The mixture was heated at 60° C. for 1 h, then cooled to rt and concentrated in vacuo. The residue thus obtained was taken up in water (20 mL) and made acidic by adding 2 M HCl (aq) until pH=4.5. The product was extracted with ethyl acetate (20 mL×3) and the combined organic layers dried over Na2SO4 and concentrated in vacuo to afford (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid (390 mg, 87%) as an off white solid. 1H-NMR (300 MHz; DMSO-d6) δ ppm: 1.36 (9H, s), 2.52 (3H, s), 2.70 (6H, s), 3.58 (2H, br. s), 4.98-5.17 (1H, m), 5.15 (2H, d, J 14.2 Hz), 7.00 (1H, br. s), 7.68 (1H, d, J 8.7 Hz), 7.71-7.83 (5H, m), 8.18 (1H, d, J 1.1 Hz), 12.49 (1H, br. s). Procedure N: Preparation of tert-butyl (Z)-(4-(5-(dimethylcarbamoyl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate To a stirring mixture of dimethylamine hydrochloride (10 mg, 0.12 mmol) in DMF (0.5 mL), triethylamine (57 uL, 0.41 mmol) was added at rt. After 10 mins (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid (45.0 mg, 0.08 mmol) was added, followed by HATU (38.0 mg, 0.10 mmol). The resulting mixture was stirred at rt for 2 h then diluted with water (10 mL). The pale yellow solid thus obtained was filtered and washed with aq. HCl (1 M; 5 mL) and water (5 mL), and then dried in oven at 60° C. to afford tert-butyl (Z)-(4-(5-(dimethylcarbamoyl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (45.0 mg, 95%) as a pale yellow solid. 1H-NMR (300 MHz; CDCl3) δ ppm: 1.43 (9H, s), 2.52 (3H, s), 2.79 (6H, s), 3.10 (6H, br. s), 3.82-3.86 (2H, m), 4.71-4.86 (1H, m), 4.84 (2H, d, J 9.5 Hz), 7.34 (2H, apparent d, J 1.1 Hz), 7.65 (1H, dd, J 7.6, 7.6 Hz), 7.71-7.77 (3H, m), 7.87 (1H, dd, J 1.5, 1.5 Hz). Procedure O: Preparation of methyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-indole-5-carboxamide hydrochloride (Compound 6) To a stirring solution of tert-butyl (Z)-(4-(5-(dimethylcarbamoyl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (45.0 mg, 0.08 mmol) in methanol (1 mL) was added HCl (2 M in diethyl ether, 4.0 mL, 8.0 mmol). The reaction was then stirred for 90 mins at rt, then concentrated in vacuo. Ethyl acetate (2 mL) was added and the resulting suspension stirred for 5 min during which time a fine white precipitate formed. The white solid was collected and dried to afford (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-indole-5-carboxamide hydrochloride (37.0 mg, 98%) as a low melting point white solid; 1H-NMR (300 MHz, DMSO-d6) δ ppm: 2.54 (3H, s), 2.69 (6H, s), 2.97 (6H, s), 3.43-3.54 (2H, m), 5.09 (1H, dt, J 36.0, 7.5 Hz), 5.23 (2H, d, J 12.5 Hz), 7.28 (1H, dd, J 8.4, 1.4 Hz), 7.56 (1H, d, J 1.3 Hz), 7.66 (1H, d, J 8.5 Hz), 7.69-7.86 (4H, m), 7.98 (2H, br. s). Example 3 The following compounds were prepared according to the procedures set forth in Example 2. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-indole-6-carboxamide hydrochloride (Compound 10) White solid; m.p 140-145° C.; H-NMR (300 MHz; Methanol-d4) δ ppm: 2.58 (3H, s), 2.78 (6H, s), 3.12 (3H, br. s), 3.16 (3H, br. s), 3.63 (2H, br. d, J 7.3 Hz), 4.89 (1H, dt, J 34.2, 7.5 Hz), 5.18 (2H, d, J 9.1 Hz), 7.24 (1H, dd, J 8.3, 1.3 Hz), 7.59-7.65 (2H, m), 7.75-7.87 (4H m). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-6-carboxamide hydrochloride (Compound 11) White solid; m.p 144-147° C.; 1H-NMR (300 MHz; Methanol-d4) δ ppm: 2.59 (3H, s), 2.78 (6H, s), 3.64 (2H, br. d, J 7.4 Hz), 4.92 (1H, dt, J 33.6, 7.5 Hz), 5.21 (2H, d, J 8.8 Hz), 7.61 (1H, d, J 8.3 Hz), 7.69 (1H, dd, J 8.4, 1.5 Hz), 7.76-7.87 (4H, m), 8.11 (1H, d, J 0.9 Hz) (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N-isopropyl-2-methyl-1H-indole-5-carboxamide hydrochloride (Compound 35) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.11 (d, J=7.8 Hz, 1H), 8.06 (d, J=1.5 Hz, 1H), 7.97 (s, 3H), 7.86 (d, J=7.7 Hz, 1H), 7.83 (d, J=7.7 Hz, 1H), 7.79-7.70 (m, 3H), 7.65 (d, J=8.6 Hz, 1H), 5.23 (d, J=12.3 Hz, 2H), 5.05 (dt, J=36.0, 7.3 Hz, 1H), 4.17-4.04 (m, 1H), 3.55-3.39 (m, 3H), 2.73 (s, 6H), 2.53 (s, 3H), 1.15 (d, J=6.5 Hz, 6H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N-isopropyl-N,2-dimethyl-1H-indole-5-carboxamide hydrochloride (Compound 36) 1H NMR (300 MHz, DMSO-d6) δ ppm: 7.95 (s, 3H), 7.85-7.69 (m, 4H), 7.66 (d, J=8.5 Hz, 1H), 7.50 (d, J=1.5 Hz, 1H), 7.22 (dd, J=8.3, 1.6 Hz, 1H), 5.23 (d, J=12.5 Hz, 2H), 5.08 (dt, J=35.9, 7.3 Hz, 1H), 3.70-3.57 (m, 1H), 3.54-3.43 (m, 2H), 2.79 (s, 3H), 2.69 (s, 6H), 2.54 (s, 3H), 1.11 (d, J=6.6 Hz, 6H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-indole-7-carboxamide hydrochloride (Compound 47) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.86-7.77 (m, 5H), 7.64 (dd, J=7.9, 1.3 Hz, 1H), 7.23 (dd, J=7.9, 7.3 Hz, 1H), 7.15 (dd, J=7.3, 1.3 Hz, 1H), 5.20 (d, J=18.5 Hz, 2H), 4.36 (dt, J=34.3, 7.5 Hz, 1H), 3.24 (s, 3H), 2.94 (s, 3H), 2.78 (s, 6H), 2.53 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-indole-5-carboxamide hydrochloride (Compound 52) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.87-7.84 (m, 1H), 7.84-7.73 (m, 3H), 7.67 (dd, J=1.6, 0.7 Hz, 1H), 7.49 (dd, J=8.5, 0.7 Hz, 1H), 7.31 (dd, J=8.5, 1.6 Hz, 1H), 5.39-5.26 (m, 1H), 5.04-4.95 (m, 2H), 3.53 (dd, J=6.8, 1.4 Hz, 2H), 3.10 (s, 6H), 2.77 (s, 6H), 2.54 (s, 3H). Example 4 The following compound was prepared according to procedures F, G, H, I, J, K, L, M, N and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-(methylsulfonyl)phenyl)-1H-indole-5-carboxamide hydrochloride (Compound 50) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.03 (d, J=1.8 Hz, 1H), 7.95 (dt, J=7.5, 1.6 Hz, 1H), 7.85 (dt, J=7.7, 1.5 Hz, 1H), 7.79 (d, J=7.6 Hz, 1H), 7.69 (d, J=1.5 Hz, 1H), 7.62 (d, J=8.5 Hz, 1H), 7.36 (dd, J=8.5, 1.6 Hz, 1H), 5.19 (d, J=9.6 Hz, 2H), 4.97 (dt, J=34.2, 7.2 Hz, 1H), 3.64 (d, J=7.4 Hz, 2H), 3.21 (s, 3H), 3.13 (s, 6H), 2.58 (s, 3H). Example 5 The following compounds were prepared according to procedures G, H, I, J, K, L, M, N and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-(trifluoromethyl)phenyl)-1H-indole-5-carboxamide hydrochloride (Compound 56) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.78-7.64 (m, 4H), 7.62 (d, J=1.5 Hz, 1H), 7.57 (d, J=8.5 Hz, 1H), 7.33 (dd, J=8.5, 1.6 Hz, 1H), 5.17 (d, J=8.7 Hz, 2H), 4.85 (dt, J=33.9, 6.9 Hz, 1H), 3.67-3.60 (m, 2H), 3.09 (s, 6H), 2.56 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-((trifluoromethyl)sulfonyl)phenyl)-1H-indole-5-carboxamide hydrochloride (Compound 57) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.15-8.04 (m, 3H), 7.94 (dd, J=8.0 Hz, 1H), 7.65 (s, 1H), 7.64 (d, J=11.1 Hz, 1H), 7.37 (dd, J=8.5, 1.6 Hz, 1H), 5.20 (d, J=9.6 Hz, 2H), 4.96 (dt, J=34.1, 7.2 Hz, 1H), 3.65 (d, J=7.4 Hz, 2H), 3.12 (s, 6H), 2.59 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(2,6-dimethylpyridin-4-yl)-N,N,2-trimethyl-1H-indole-5-carboxamide dihydrochloride (Compound 90) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.31 (s, 3H), 7.80 (s, 3H), 7.74 (d, J=8.5 Hz, 1H), 7.32 (dd, J=8.5, 1.5 Hz, 1H), 5.32 (d, J=13.2 Hz, 2H), 5.22 (dt, J=34.9, 7.2 Hz, 1H), 3.52-3.39 (m, 2H), 2.98 (s, 6H), 2.78 (s, 6H), 2.68 (d, J=5.3 Hz, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N-(tert-butyl)-2-methyl-3-(pyridin-4-yl)-1H-indole-5-carboxamide dihydrochloride (Compound 91) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.84 (d, J=6.2 Hz, 2H), 8.30 (d, J=6.4 Hz, 2H), 8.26 (d, J=1.6 Hz, 1H), 7.78 (dd, J=8.7, 1.5 Hz, 1H), 7.70 (d, J=8.7 Hz, 1H), 5.28 (d, J=11.4 Hz, 2H), 5.12 (dt, J=35.4, 7.4 Hz, 1H), 3.66 (dd, J=6.9, 3.7 Hz, 2H), 2.78 (s, 3H), 1.51 (s, 9H). Example 6 The following compounds were prepared according to the procedures G, H, I, J, K, L, M and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(4-fluorophenyl)-2-methyl-1H-indole-5-carboxylic acid hydro-chloride (Compound 23) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.13 (d, J=1.6 Hz, 1H), 7.79 (dd, J=8.6, 1.6 Hz, 1H), 7.65 (d, J=8.6 Hz, 1H), 7.49 (dd, J=8.6, 5.7 Hz, 2H), 7.37 (dd, J=8.9 Hz, 2H), 5.22 (d, J=12.4 Hz, 2H), 5.04 (dt, J=35.9, 7.3 Hz, 1H), 3.49 (d, J=7.2 Hz, 2H), 2.49 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(tert-butyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 31) 1H NMR (300 MHz, DMSO-d6) δ ppm: 12.47 (s, 1H), 8.19 (d, J=1.6 Hz, 1H), 7.90 (s, 3H), 7.79 (dd, J=8.6, 1.6 Hz, 1H), 7.65 (d, J=8.7 Hz, 1H), 7.50-7.43 (m, 2H), 7.40 (dt, J=8.1, 1.6 Hz, 1H), 7.28 (ddd, J=7.4, 1.5 Hz, 1H), 5.22 (d, J=12.6 Hz, 2H), 5.07 (dt, J=35.9, 7.3 Hz, 1H), 3.49 (s, 2H), 2.51 (s, 3H), 1.36 (s, 9H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-chlorophenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 28) 1H NMR (300 MHz, Methanol-d4) δ 8.27 (d, J=1.4 Hz, 1H), 7.93 (dd, J=8.7, 1.6 Hz, 1H), 7.54 (d, J=8.7 Hz, 1H), 7.52-7.49 (m, 1H), 7.47 (dd, J=1.8 Hz, 1H), 7.45-7.36 (m, 2H), 5.16 (d, J=8.7 Hz, 2H), 4.84 (dt, J=34.1, 7.4 Hz, 1H), 3.67-3.58 (m, 2H), 2.55 (s, 3H). (Z)-3-fluoro-4-(3-(2-methoxypyridin-4-yl)-2-methyl-5-(methylsulfonyl)-1H-indol-1-yl)but-2-en-1-amine dihydrochloride (Compound 98) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.31 (d, J=5.7 Hz, 1H), 8.10 (d, J=1.7 Hz, 1H), 8.06 (s, 4H), 7.89 (d, J=8.7 Hz, 1H), 7.74 (dd, J=8.7, 1.8 Hz, 1H), 7.18 (dd, J=5.3, 1.5 Hz, 1H), 6.95 (d, J=1.2 Hz, 1H), 5.32 (d, J=13.1 Hz, 2H), 5.15 (dt, J=35.9, 7.2 Hz, 1H), 3.94 (s, 3H), 3.52-3.41 (m, 3H), 3.20 (s, 3H), 2.59 (s, 3H). Example 7 The following compounds were prepared according to the procedures E, F, G, H, I, J, K, L, M and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-6-fluoro-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 21) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.18 (d, J=7.0 Hz, 1H), 7.86 (dt, J=1.0 Hz, 1H), 7.83-7.77 (m, 3H), 7.37 (d, J=11.9 Hz, 1H), 5.15 (d, J=9.3 Hz, 2H), 4.92 (dt, J=34-1, 7.5 Hz, 1H), 3.65 (d, J=7.4 Hz, 2H), 2.80 (s, 6H), 2.57 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-7-carboxylic acid hydrochloride (Compound 48) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.83-7.78 (m, 4H), 7.77 (dd, J=7.6, 1.2 Hz, 1H), 7.72 (dd, J=7.9, 1.2 Hz, 1H), 5.51 (d, J=6.7 Hz, 2H), 4.55 (dt, J=34.3, 7.5 Hz, 1H), 3.56 (d, J=8.3 Hz, 2H), 2.78 (s, 611), 2.55 (s, 3H). Example 8 The following compounds were prepared according to the procedures G, H, I, J, K, L and O. Ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(4-fluorophenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 24) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.22 (d, J=1.6 Hz, 1H), 7.90 (dd, J=8.7, 1.7 Hz, 1H), 7.53 (d, J=8.7 Hz, 1H), 7.48 (dd, J=8.8, 5.4 Hz, 2H), 7.26 (dd, J=8.8 Hz, 2H), 5.20-5.09 (m, 2H), 4.85 (dt, J=34.1, 7.5 Hz, 1H), 4.36 (q, J=7.1 Hz, 2H), 3.67-3.57 (m, 2H), 2.52 (s, 3H), 1.39 (t, J=7.1 Hz, 3H). Ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(tert-butyl)phenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 30) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.22 (d, J=1.6 Hz, 1H), 7.97 (s, 3H), 7.80 (dd, J=8.7, 1.6 Hz, 1H), 7.68 (d, J=8.7 Hz, 1H), 7.50 (dd, J=1.8 Hz, 1H), 7.45 (d, J=7.5 Hz, 1H), 7.40 (dt, J=7.9, 1.5 Hz, 1H), 7.28 (dt, J=7.4, 1.5 Hz, 1H), 5.23 (d, J=13.0 Hz, 2H), 5.11 (dt, J=35.9, 7.6 Hz, 1H), 3.48 (d, J=7.2 Hz, 2H), 2.53 (s, 3H), 1.36 (s, 9H). Ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-chlorophenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 27) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.24 (d, J=1.4 Hz, 1H), 7.92 (dd, J=8.7, 1.7 Hz, 1H), 7.55 (d, J=8.7 Hz, 1H), 7.51 (d, J=7.7 Hz, 1H), 7.46 (dd, J=1.8 Hz, 1H), 7.44-7.37 (m, 2H), 5.16 (d, J=8.9 Hz, 2H), 4.85 (dt, J=34.0, 7.5 Hz, 1H), 4.37 (q, J=7.1 Hz, 2H), 3.63 (d, J=7.5 Hz, 2H), 2.54 (s, 3H), 1.39 (t, J=7.1 Hz, 3H). (Z)-3-fluoro-4-(2-methyl-5-(methylsulfonyl)-3-phenyl-1H-indol-1-yl)but-2-en-1-amine hydrochloride (Compound 87) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.12 (dd, J=1.8, 0.7 Hz, 1H), 7.77 (dd, J=8.7, 1.8 Hz, 1H), 7.71 (d, J=8.3 Hz, 1H), 7.58-7.46 (m, 4H), 7.43-7.37 (m, 1H), 5.22 (d, J=9.3 Hz, 2H), 4.88 (dt, J=33.9, 7.4 Hz, 1H), 3.67-3.60 (m, 2H), 3.11 (s, 3H), 2.57 (s, 3H). (Z)-3-fluoro-4-(2-methyl-5-(methylsulfonyl)-3-(pyridin-4-yl)-1H-indol-1-yl)but-2-en-1-amine hydro-chloride (Compound 88) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.88 (d, J=7.3 Hz, 2H), 8.41 (dd, J=1.7, 0.8 Hz, 1H), 8.29 (d, J=6.8 Hz, 2H), 7.93 (dd, J=8.7, 1.6 Hz, 1H), 7.89 (dd, J=8.5, 0.6 Hz, 1H), 5.35 (d, J=11.7 Hz, 2H), 5.20 (dt, J=34.1, 7.4 Hz, 1H), 4.90 (s, 7H), 3.66 (d, J=7.4 Hz, 2H), 3.19 (s, 3H), 2.80 (s, 3H). (Z)-4-(3-(2,6-dimethylpyridin-4-yl)-2-methyl-5-(ethylsulfonyl)-1H-indol-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 89) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.34 (dd, J=1.7, 0.7 Hz, 1H), 7.90 (dd, J=8.8, 1.7 Hz, 1H), 7.88-7.83 (m, 3H), 5.32 (d, J=11.7 Hz, 2H), 5.18 (dt, J=34.1, 7.4 Hz, 1H), 3.66 (d, J=7.3 Hz, 2H), 3.19 (s, 3H), 2.84 (s, 6H), 2.76 (s, 3H). (Z)-4-(3-(benzo[d][1,3]dioxol-5-yl)-2-methyl-5-(methylsulfonyl)-1H-indol-1-yl)-3-fluorobut-2-en-1-amine hydrochloride (Compound 92) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.10 (d, J=1.3 Hz, 1H), 7.75 (dd, J=8.7, 1.8 Hz, 1H), 7.69 (d, J=8.6 Hz, 1H), 7.00 (dd, J=7.7, 0.7 Hz, 1H), 6.96-6.91 (m, 2H), 6.04 (s, 2H), 5.19 (d, J=8.0 Hz, 1H), 4.80 (dt, J=35.2, 7.5 Hz, 1H), 3.63 (d, J=7.5 Hz, 2H), 3.12 (s, 3H), 2.55 (s, 3H). (Z)-3-fluoro-4-(3-(4-fluorophenyl)-2-methyl-5-(methylsulfonyl)-1H-indol-1-yl)but-2-en-1-amine hydro-chloride (Compound 93) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.11-8.07 (m, 1H), 7.77 (dd, J=8.7, 1.8 Hz, 1H), 7.71 (d, J=8.5 Hz, 1H), 7.54-7.46 (m, 2H), 7.33-7.23 (m, 2H), 5.21 (dd, J=9.5, 1.3 Hz, 2H), 4.89 (dt, J=35.3, 7.5 Hz, 1H), 3.64 (d, J=7.5 Hz, 2H), 3.12 (s, 3H), 2.55 (s, 3H). (Z)-3-fluoro-4-(2-methyl-3-(2-methylpyridin-4-yl)-5-(methylsulfonyl)-1H-indol-1-yl)but-2-en-1-amine dihydrochloride (Compound 94) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.71 (dd, J=6.3, 0.7 Hz, 1H), 8.37 (dd, J=1.6, 0.7 Hz, 1H), 8.10 (d, J=1.8 Hz, 1H), 8.07 (d, J=6.3 Hz, 1H), 7.92 (dd, J=8.7, 1.6 Hz, 1H), 7.87 (d, J=8.3 Hz, 1H), 5.34 (d, J=11.7 Hz, 2H), 5.19 (dt, J=34.1, 7.4 Hz, 1H), 3.66 (d, J=7.4 Hz, 2H), 3.19 (s, 3H), 2.89 (s, 3H), 2.78 (s, 3H). Example 9 The following compound was prepared according to the procedures E, F, P, Q, R, J, K, L and O. (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxylate dihydrochloride (Compound 42) Procedure P: Preparation of 5-chloro-2-methyl-3-(methylthio)-1H-pyrrolo[3,2-b]pyridine To a solution of 6-chloropyridin-3-amine (6.72 g, 62.0 mmol) in CH2Cl2 (150 mL) at −78° C. was added a solution of t-BuOCl (124 mmol, 14 mL) in CH2Cl2 (50 mL). The reaction stirred for 30 min prior to the addition of methylthioacetone (62.0 mmol, 6.47 g) in CH2Cl2 (50 mL). After 90 min, a solution of NEt3 (62.0 mmol, 9.60 mL) in CH2C2 (50 mL) was added and the reaction warmed to ambient temperature. The reaction was quenched by the addition of water and the aqueous layer was extracted with CH2Cl2. The organic layer was dried over Na2SO4 and concentrated in vacuo. The residue was purified over silica gel, eluting with CH2Cl2/MeOH (20:1) to afford 5-chloro-2-methyl-3-(methylthio)-1H-pyrrolo[3,2-b]pyridine (9.50 g, 72%). Procedure Q: Preparation of 5-chloro-2-methyl-1H-pyrrolo[3,2-b]pyridine A mixture of 5-chloro-2-methyl-3-(methylthio)-1H-pyrrolo[3,2-b]pyridine (9.50 g, 45.0 mmol), AcOH (80 mL) and Raney Nickel (˜150 g) in ethanol (85% w/w, 300 mL) was stirred for 6 h. Raney Nickel was removed by filtration through Celite™ and the reaction mixture was concentrated in vacuo. The residue was purified over silica gel, eluting with 50% ethyl acetate in hexane to afford 5-chloro-2-methyl-1H-pyrrolo[3,2-b]pyridine (2.70 g, 36%) as brown solid. Procedure R: Preparation of ethyl 2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxylate A mixture of 5-chloro-2-methyl-1H-pyrrolo[3,2-b]pyridine (2.70 g, 16.0 mmol) in ethanol (100 ml), PdCl2dppf (587 mg, 0.80 mmol) and Et3N (4.80 g, 48.0 mmol) was transferred into a 300 mL autoclave and a carbon monoxide pressure of 15 bar was applied. The reaction mixture was heated at 120° C. overnight. After cooling to rt, the pressure was released, the reaction mixture was concentrated and then diluted with water (100 ml). The aqueous phase was extracted with dichloromethane (100 ml×3). The combined organic phases were dried over Na2SO4 and concentrated under reduced pressure. The residue was purified over silica gel, eluting with 50% ethyl acetate in hexane to afford ethyl 2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxylate (1.21 g, 37%) as white solid. 1H-NMR (300 MHz, CDCl3): δ ppm: 9.75 (s, 1H), 7.97-7.94 (m, 1H), 7.64-7.61 (m, 1H), 6.47 (s, 1H), 4.49-4.42 (m, 2H), 2.49 (s, 3H), 1.38-1.33 (m, 3H). (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxylate dihydrochloride (Compound 42) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.17 (d, J=8.8 Hz, 2H), 8.01 (s, 3H), 7.97 (d, J=8.8 Hz, 2H), 7.79 (t, J=7.7 Hz, 1H), 7.71 (dt, J=7.8, 1.5 Hz, 1H), 5.33 (d, J=12.8 Hz, 2H), 5.11 (dt, J=36.1, 7.5 Hz, 1H), 4.33 (q, J=7.1 Hz, 2H), 3.55-3.40 (m, 2H), 2.75 (s, 6H), 2.67 (s, 3H), 1.32 (t, J=7.1 Hz, 3H). Example 10 The following compounds were prepared according to the procedures E, F, P, Q, J, K, L, and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-6-fluoro-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 108) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.74 (dd, J=8.6, 2.2 Hz, 1H), 8.65 (dd, J=3.4, 2.2 Hz, 1H), 7.97-7.82 (m, 4H), 5.40 (d, J=13.4 Hz, 2H), 5.37 (dt, J=35.2, 7.4 Hz, 1H), 3.69 (d, J=7.3 Hz, 21-), 2.78 (s, 6H), 2.66 (s, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-fluoro-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 109) 1H-NMR (400 MHz, DMSO-d6): δ ppm: 8.25-8.21 (m, 1H), 8.15-8.12 (m, 3H), 7.98-7.95 (m, 2H), 7.78-7.74 (m, 1H), 7.70-7.68 (m, 1H), 6.99-6.96 (m, 1H), 5.30-5.27 (m, 2H), 5.21-5.10 (m, 1H), 3.48-3.44 (m, 2H), 2.67 (s, 6H), 2.63 (s, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(trifluoromethyl)-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 110) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.30 (d, J=8.5 Hz, 1H), 8.14 (t, J=1.7 Hz, 1H), 8.05-7.87 (m, 5H), 7.80 (dd, J=7.7 Hz, 1H), 7.76-7.69 (m, 2H), 5.37 (d, J=12.5 Hz, 2H), 5.09 (dt, J=36.0, 7.2 Hz, 1H), 3.47 (d, J=7.0 Hz, 2H), 2.72 (s, 6H), 2.70 (s, 3H). Example 11 The following compound was prepared according to the procedures E, F, P, Q, R, J, K, L, M, and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxylic acid dihydrochloride (Compound 43) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.15 (d, J=8.5 Hz, 2H), 8.15 (s, 1H) 8.02 (dt, J=7.7, 1.5 Hz, 1H), 7.96 (d, J=8.5 Hz, 1H), 7.96 (s, 3H), 7.78 (t, J=7.7 Hz, 1H), 7.70 (dt, J=7.9, 1.5 Hz, 1H), 5.32 (d, J=12.7 Hz, 1H), 5.10 (dt, J=35.9, 7.2 Hz, 1H), 3.48 (t, J=6.1 Hz, 2H), 2.73 (s, 6H), 2.67 (s, 3H). Example 12 The following compounds were prepared according to the procedures E, F, P, Q, R, J, K, L, M, N and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-pyrrolo[3,2-b]pyridine-5-carboxamide dihydrochloride (Compound 44) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.18-8.10 (m, 2H), 8.03 (s, 3H), 7.97 (td, 1H), 7.77 (t, J=7.7 Hz, 1H), 7.68 (dt, J=7.8, 1.4 Hz, 1H), 7.45 (d, J=8.5 Hz, 1H), 5.30 (d, J=13.1 Hz, 2H), 5.14 (dt, J=35.8, 7.1 Hz, 1H), 3.47 (d, J=7.0 Hz, 2H), 3.05 (s, 3H), 3.01 (s, 3H), 2.68 (s, 6H), 2.67 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N-isopropyl-2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxamide dihydrochloride (Compound 45) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.42 (dd, J=1.8 Hz, 1H), 8.19 (d, J=8.5 Hz, 1H), 8.01 (dt, J=7.7, 1.5 Hz, 1H), 7.95 (dd, J=8.5 Hz, 1H), 7.79 (dd, J=7.7 Hz, 1H), 7.71 (dt, J=7.9, 1.5 Hz, 1H), 5.33 (d, J=13.0 Hz, 1H), 5.12 (dt, J=35.8, 7.2 Hz, 1H), 4.21-4.08 (m, 1H), 3.54-3.38 (m, 2H), 2.71 (s, 6H), 2.70 (s, 2H), 1.21 (d, J=6.6 Hz, 6H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,2-dimethyl-1H-pyrrolo[3,2-b]pyridine-5-carboxamide dihydrochloride (Compound 46) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.24-7.97 (m, 6H), 7.93 (d, J=8.4 Hz, 1H), 7.79 (dd, J=7.8 Hz, 1H), 7.71 (d, J=7.6 Hz, 2H), 5.31 (d, J=13.0 Hz, 2H), 5.14 (dt, J=35.8, 7.0 Hz, 1H), 3.47 (s, 2H), 2.84 (d, J=4.6 Hz, 3H), 2.72 (s, 6H), 2.67 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1H-pyrrolo[3,2-b]pyridine-5-carboxamide dihydrochloride (Compound 53) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.17 (dd, J=1.7 Hz, 1H), 8.09 (s, 3H), 8.06 (d, J=8.5 Hz, 1H), 7.98 (dt, J=7.7, 1.5 Hz, 1H), 7.76 (dd, J=7.7 Hz, 1H), 7.67 (dt, J=8.0, 1.4 Hz, 1H), 7.43 (d, J=8.4 Hz, 1H), 5.42 (dt, J=14.4, 6.4 Hz, 1H), 5.03 (d, J=4.9 Hz, 2H), 3.46-3.36 (m, 2H), 3.05 (s, 3H), 3.01 (s, 3H), 2.69 (s, 6H). Example 13 The following compounds were prepared according to procedures J, K, L and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 2) White solid; m.p 242-245° C.; 1H-NMR (300 MHz; d6-DMSO) δ ppm: 2.52 (3H, s), 2.70 (6H, s), 3.47 (2H, br. d, J 7.1 Hz), 5.04 (1H, dt, J 36.0, 7.2 Hz), 51.9 (2H, d, J 12.3 Hz), 7.13 (1H, dt, J 7.0, 7.0, 1.0 Hz), 7.21 (1H, dt, J 6.9, 6.9, 1.1 Hz), 7.53 (1H, d, J 7.6 Hz), 7.61 (1H, d, J 8.0 Hz), 7.70 (1H, dd, J 7.2, 1.8 Hz), 7.73-7.76 (1H, m), 7.79 (1H, d, J 7.9 Hz), 7.83 (1H, dd, J 7.6, 1.7 Hz), 7.97 (2H, br. s). (Z)-4-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 3) Glassy solid; m.p 145-150° C.; 1H-NMR (300 MHz; d6-DMSO) δ ppm: 2.55 (3H, s), 2.68 (6H, s), 3.41-3.53 (2H, in), 5.06 (1H, dt, J 36.0, 7.3 Hz), 5.20 (2H, d, J 12.2 Hz), 7.13 (1H, dd, J 7.4, 7.4 Hz), 7.21 (1H, dd, J 7.4, 7.4 Hz), 7.61 (2H, apparent d, J 7.9 Hz), 7.74 (2H, d, J 8.4 Hz), 7.85 (2H, d, J 8.4 Hz), 8.04 (2H, br. s). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-pyrrolo[2,3-b]pyridin-3-yl)-N,N dimethylbenzene-sulfonamide dihydrochloride (Compound 4) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.31 (dd, J=4.7, 1.5 Hz, 1H), 8.11 (s, 3H), 7.87 (ddd, J=7.6, 1.6 Hz, 1H), 7.84-7.69 (m, 4H), 7.23 (dd, J=7.9, 4.7 Hz, 1H), 5.27 (d, J=11.2 Hz, 2H), 5.02 (dt, J=35.9, 7.3 Hz, 1H), 3.55-3.40 (m, 2H), 2.70 (s, 6H), 2.59 (s, 3H). (Z)-4-(5-chloro-2-methyl-3-(5-(methylsulfonyl)pyridin-3-yl)-1H-indol-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 65) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.25 (s, 1H), 9.20 (s, 1H), 8.86 (t, J=2.0 Hz, 1H), 7.69-7.65 (m, 1H), 7.58 (d, J=8.8 Hz, 1H), 7.28 (dd, J=8.7, 2.0 Hz, 1H), 5.20 (d, J=10.2 Hz, 2H), 5.03 (dt, J=34.2, 7.5 Hz, 1H), 3.65 (d, J=7.6 Hz, 3H), 3.42 (s, 3H), 2.63 (s, 3H). (Z)-4-(5-chloro-2-methyl-3-(pyridin-4-yl)-1H-indol-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 76) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.80 (d, J=7.0 Hz, 2H), 8.20 (d, J=7.0 Hz, 2H), 7.86 (dd, J=2.0, 0.5 Hz, 1H), 7.65-7.60 (m, 1H), 7.34 (dd, J=8.8, 2.0 Hz, 1H), 5.24 (dd, J=11.0, 1.1 Hz, 3H), 5.11 (dt, J=34.1, 7.4 Hz, 1H), 3.65 (d, J=7.4 Hz, 2H), 2.75 (s, 3H). (Z)-4-(5-chloro-2-methyl-3-(pyridin-3-yl)-1H-indol-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 77) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.99 (s, 1H), 8.81 (d, J=5.7 Hz, 1H), 8.74 (ddd, J=8.2, 2.1, 1.4 Hz, 1H), 8.20 (dd, J=8.2, 5.7 Hz, 1H), 7.67 (d, J=2.0 Hz, 1H), 7.56 (d, J=8.8 Hz, 1H), 7.29 (dd, J=8.7, 2.0 Hz, 1H), 5.19 (d, J=10.9 Hz, 1H), 5.05 (dt, J=34.1, 7.5 Hz, 1H), 3.65 (d, J=7.4 Hz, 2H), 2.62 (s, 3H). (Z)-4-(5-chloro-2-methyl-3-(pyrimidin-5-yl)-1H-indol-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 80) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.32 (s, 1H), 9.16 (s, 2H), 7.63 (dd, J=2.0, 0.5 Hz, 1H), 7.55 (d, J=8.7 Hz, 1H), 7.27 (dd, J=8.7, 2.0 Hz, 1H), 5.18 (d, J=10.0 Hz, 2H), 4.98 (dt, J=34.1, 7.5 Hz, 1H), 3.64 (d, J=7.4 Hz, 3H), 2.60 (s, 3H). (Z)-4-(3-(2,6-dimethylpyridin-4-yl)-2-methyl-5-nitro-1H-indol-1-yl)-3-fluorobut-2-en-1-amine dihydro-chloride (Compound 101) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.58 (d, J=2.2 Hz, 1H), 8.18 (dd, J=9.1, 2.2 Hz, 1H), 8.10 (s, 3H), 7.94 (d, J=9.1 Hz, 1H), 7.86 (s, 2H), 5.41 (d, J=14.1 Hz, 2H), 5.28 (dt, J=36.0, 7.2 Hz, 1H), 3.47 (d, J=6.3 Hz, 1H), 2.77 (s, 6H), 2.68 (s, 3H). Example 14 The following compounds were prepared according to procedures E, F, G, H, I, J, K, L and O Methyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 5) Off-white solid; m.p 242-244° C.; 1H-NMR (300 MHz; d6-DMSO) δ ppm: 2.55 (3H, s), 2.73 (6H, s), 3.48 (2H, br. d, J 6.5 Hz), 3.83 (3H, s), 5.09 (1H, dt, J 36.0, 7.1 Hz), 5.27 (2H, d, J 12.7 Hz), 7.71-7.87 (6H, m), 7.91 (2H, br. s), 8.20 (1H, d, J 1.3 Hz). Methyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-6-carboxylate hydrochloride (Compound 7) White solid; m.p 265-266° C.; 1H-NMR (300 MHz; Methanol-d4) δ ppm: 2.59 (3H, s), 2.78 (6H, s), 3.64 (2H, br. d, J 7.6 Hz), 3.95 (3H, s), 4.87 (1H, dt, J 34.0, 7.5 Hz), 5.23 (2H, d, J 8.7 Hz), 7.61 (1H, d, J 8.3 Hz), 7.76-7.86 (5H, m), 8.22 (1H, d, J 0.9 Hz). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(methylsulfonyl)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 97) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.07 (s, 3H), 8.06 (d, J=1.9 Hz, 1H), 7.93-7.80 (m, 3H), 7.80-7.71 (m, 3H), 5.33 (d, J=12.8 Hz, 2H), 5.14 (dt, J=36.0, 7.2 Hz, 1H), 3.48 (s, 2H), 3.18 (s, 3H), 2.72 (s, 6H), 2.57 (s, 3H). Example 15 The following compound was prepared according to procedures F, G, H, I, J, K, L and O. (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-indole-5-carboxylate hydrochloride (Compound 17) 1H NMR (300 MHz, DMSO-d6) δ 8.17 (d, J=1.6 Hz, 1H), 7.99-7.91 (m, 2H), 7.88-7.79 (m, 3H), 7.72 (d, J=8.7 Hz, 1H), 5.27 (d, J=12.7 Hz, 2H), 5.10 (dt, J=35.9, 7.3 Hz, 1H), 4.30 (q, J=7.1 Hz, 2H), 3.54-3.45 (m, 2H), 3.30 (s, 3H), 2.54 (s, 3H), 1.31 (t, J=7.1 Hz, 3H). Example 16 The following compound was prepared according to procedures K, L and O (Z)-3-fluoro-4-(3-(4-fluorophenyl)-1H-indol-1-yl)but-2-en-1-amine hydrochloride (Compound 1) Pale brown; m.p 184-187° C.; 1H-NMR (300 MHz; Methanol-d4) δ ppm: 3.62 (2H, br. d, J 7.5 Hz), 4.96 (1H, dt, J 33.8, 7.5 Hz), 5.10 (2H, dd, J 10.7, 0.8 Hz), 7.14-7.22 (3H, m), 7.28 (1H, ddd, J 8.3, 7.1, 1.1 Hz), 7.48 (1H, s), 7.51 (1H, d, J 8.2 Hz), 7.63-7.70 (2H, m), 7.85 (1H, ddd, J 8.0, 1.1, 0.9 Hz). Example 17 The following compound was prepared according to procedures E, F, G, H, I, J, K, S, L, M and T. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(3-(N-methylsulfamoyl)phenyl)-1H-indole-5-carboxylic acid hydrochloride (Compound 18) Procedure S: Preparation of ethyl 3-(3-(N-(4-methoxybenzyl)-N-methylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate To a stirring suspension of ethyl 2-methyl-3-(3-(N-methylsulfamoyl)phenyl)-1H-indole-5-carboxylate (195 mg, 0.52 mmol) and potassium carbonate (73.0 mg, 0.53 mmol) in DMF (1 mL) at rt was added 4-methoxybenzyl chloride (81 uL, 0.58 mmol) and stirring continued for 3 h. Water (10 mL) was then added and the product was extracted with ethyl acetate (10 mL×3). The combined organic layers were dried over Na2SO4 and concentrated in vacuo. The crude residue thus obtained was purified over silica gel (12 g), eluting with 35% ethyl acetate in n-hexane, to afford ethyl 3-(3-(N-(4-methoxybenzyl)-N-methylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate (105 mg, 41%) as a white solid. H-NMR (300 MHz; CDCl3) δ ppm: 1.37 (3H, t, J 7.1 Hz), 2.57 (3H, s), 2.70 (3H, s), 3.81 (3H, s), 4.20 (2H, s), 4.37 (2H, q, J 7.1 Hz), 6.88 (2H, d, J 8.7 Hz), 7.28 (2H, d, J 8.6 Hz), 7.39 (1H, d, J 8.5 Hz), 7.69 (1H, dd, J 7.7, 7.7 Hz), 7.78-7.84 (2H, m), 7.93-7.97 (2H, m), 8.26 (1H, br. s), 8.38 (1H, br. s). Procedure T: Preparation of (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(3-(N-methylsulfamoyl)phenyl)-1H-indole-5-carboxylic acid hydrochloride (Compound 18) To a stirring solution of (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N-(4-methoxybenzyl)-N-methylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid (95 mg, 0.15 mmol) in CH2Cl2 (1 mL), was added triflouroacetic acid (1 mL). The reaction was stirred for 3 hours at rt, then concentrated in vacuo. Ethyl acetate (2 mL) was added followed by ethereal HCl (2 M, 1.00 mL) and the resulting suspension stirred for 5 min forming a fine white precipitate. The solid was collected and dried to afford (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(3-(N-methylsulfamoyl)phenyl)-1H-indole-5-carboxylic acid hydrochloride (55 mg, 81%) as an off white solid; m.p. 275-278° C.; 1H-NMR (300 MHz; DMSO-d6) δ ppm: 2.54 (3H, s), 3.34 (3H, br. s), 3.43-3.54 (2H, m), 5.09 (1H, dt, J 36.0, 7.4 Hz), 5.26 (2H, d, J 12.4 Hz), 7.60 (1H, q, J 5.0 Hz), 7.70 (1H, d, J 8.7 Hz), 7.74-7.87 (5H, m), 7.95 (2H, br. s), 8.17 (1H, d, J 1.1 Hz). Example 18 The following compound was prepared according to procedures E, F, G, H, I, J, K, L, M and U. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 8) Procedure U: Preparation of (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)-phenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 8) To a stirring solution of (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid (200 mg, 0.37 mmol) in CH2Cl2 (4 mL), was added trifluoroacetic acid (1 mL). The resulting mixture was stirred at rt for 1 h then concentrated in vacuo. The solid thus obtained was purified over C-18-reversed phase silica gel (40 g), eluting over a gradient of 20-50% acetonitrile in water (+0.1% HCl) to afford (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (102 mg, 58%) as an off-white solid; m.p. 240-242° C.; 1H-NMR (300 MHz; d6-DMSO) δ ppm: 2.55 (3H, s), 2.71 (6H, s), 3.49 (2H, br. d, J 7.0 Hz), 5.07 (1H, dt, J 35.9, 7.3 Hz), 5.26 (2H, d, J 12.8 Hz), 7.70 (1H, d, J 8.7 Hz), 7.73-7.87 (7H, m), 8.20 (1H, d, J 1.2 Hz). Example 19 The following examples were prepared according to the procedures set forth in Example 18. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-6-carboxylic acid hydrochloride (Compound 9) White solid; m.p 255-257° C.; 1H-NMR (300 MHz; DMSO-d6) δ ppm: 2.56 (3H, s), 2.70 (6H, s), 3.49 (2H, br. s), 5.02 (1H, dt, J 35.9, 7.3 Hz), 5.32 (2H, d, J 12.0 Hz), 7.58 (1H, d, J 8.3 Hz), 7.70-7.88 (5H, m), 7.94 (2H, br. s), 8.25 (1H, s), 12.67 (1H, s). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)-2-methylphenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 13) Beige solid; m.p 180-185° C.; 1H-NMR (300 MHz; DMSO-d6) δ ppm: 2.28 (3H, s), 2.33 (3H, s), 2.84 (6H, s), 3.44-3.55 (2H, m), 5.03 (1H, dt, J 35.9, 7.2 Hz), 5.23 (2H, d, J 11.7 Hz), 7.51-7.56 (2H, m), 7.67 (1H, d, J 8.7 Hz), 7.70 (1H, d, J 1.2 Hz), 7.79 (1H, dd, J 8.6, 1.5 Hz), 7.82-7.94 (4H, in), 12.50 (1H, br. s). Example 20 The following compounds were prepared according to procedures E, F, G, H, I, J, K, L and V. Ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 12) Procedure V: Preparation of ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 12) To a stirring solution of ethyl (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate (510 mg, 0.89 mmol) in ethanol (5 mL) was added HCl (2 M in diethyl ether, 20 mL, 40 mmol). The reaction was stirred for 5 hours at rt, then concentrated in vacuo. Diethyl ether (25 mL) was added and the resulting suspension stirred for 5 min forming a fine, off-white, precipitate. The solid was collected and dried to afford ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (403 mg, 89%) as an off-white solid; m.p. 145-147° C.; 1H-NMR (300 MHz; Methanol-d4) δ ppm: 1.38 (3H, t, J 7.1 Hz), 2.59 (3H, s), 2.81 (6H, s), 3.64 (2H, br. d, J 7.3 Hz), 4.36 (2H, q, J 7.1 Hz), 4.88 (1H, dt, J 33.8, 7.5 Hz), 5.19 (2H, d, J 8.8 Hz), 7.58 (1H, d, J 8.7 Hz), 7.78-7.83 (3H, m), 7.87 (1H, br. s), 7.94 (1H, dd, J 8.7, 1.6 Hz), 8.29 (1H, d, J 1.2 Hz). (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-6-fluoro-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 22) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.05 (d, J=6.9 Hz, 1H), 8.02 (s, 1H), 7.86-7.72 (m, 4H), 7.67 (d, J=12.2 Hz, 1H), 5.24 (d, J=13.0 Hz, 2H), 5.13 (dt, J=36.1, 7.4 Hz, 1H), 3.56-3.42 (m, 4H), 2.72 (s, 6H), 2.52 (s, 3H), 1.06 (t, J=7.0 Hz, 3H). Example 21 The following compound was prepared according to procedures W, F, G, H, I, J, K, L and V. Ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)-2-methylphenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 19) Procedure W: Preparation of 3-bromo-N,N,-dimethylbenzenecarboxamide To a stirring mixture of N,N,4-trimethylbenzenesulfonamide (1.00 g, 5.0 mmol) in concentrated sulfuric acid (4.5 mL, 84 mmol) at rt was added 1-bromopyrrolidine-2,5-dione (983 mg, 5.5 mmol) and the resulting solution allowed to stir at rt for 3 h. The reaction mixture was then poured into cold water and the resulting off-white precipitate filtered and dried to afford 3-bromo-N,N,4-trimethyl-benzenesulfonamide (1.36 g, 97%) as a white solid. 1H-NMR (300 MHz; Methanol-d4) δ ppm: 2.50 (3H, s), 2.70 (6H, s), 7.56 (1H, d, J 8.0 Hz), 7.67 (1H, dd, J 8.0, 1.8 Hz), 7.93 (1H, d, J 1.8 Hz). Ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)-2-methylphenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 19) Off-white solid; m.p 147-150° C.; 1H-NMR (300 MHz; DMSO-d) δ ppm: 1.28 (3H, t, J 7.1 Hz), 2.22 (3H, s), 2.32 (3H, s), 2.68 (6H, s), 3.49 (2H, d, J 7.1 Hz), 4.26 (2H, q, J 7.1 Hz), 5.05 (1H, dt, J 35.5, 7.2 Hz), 5.25 (2H, d, J 12.0 Hz), 7.53 (1H, s), 7.70-7.83 (5H, m), 7.91 (2H, br. s). Example 22 The following compound was prepared according to procedures F, G, H, I, J, K, L M and U. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-indole-5-carboxylic acid hydrochloride (Compound 14) Off-white solid; m.p 268-269° C.; 1H-NMR (300 MHz; Methanol-d4) δ ppm: 2.58 (3H, s), 3.22 (3H, s), 3.64 (2H, br. d, J 7.3 Hz), 4.88 (1H, dt, J 34.0, 7.5 Hz), 5.19 (2H, d, J 8.8 Hz), 7.57 (1H, d, J 8.7 Hz), 7.82 (1H, dd, J 7.5, 7.5 Hz), 7.87 (1H, ddd, J 7.7, 1.5, 1.5 Hz), 7.95 (1H, dd, J 8.9, 1.6 Hz), 7.98 (1H, ddd, J 7.7, 1.5, 1.5 Hz), 8.03 (1H, s), 8.28 (1H, d, J 1.2 Hz). Example 23 The following compound was prepared according to procedures W, F, G, H, I, J, K, L, M and U. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)-2-methylphenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 20) Off-white solid; m.p 248-251° C.; 1H-NMR (300 MHz; DMSO-d6) δ ppm: 2.21 (3H, s), 2.33 (3H, s), 2.66 (3H, s), 3.45-3.55 (2H, m), 5.06 (1H, dt, J 35.9, 7.1 Hz), 5.24 (2H, d, J 12.2 Hz), 7.52 (1H, s), 7.67-7.82 (5H, m), 7.98 (2H, br. s), 12.47 (1H, br. s). Example 24 The following compound was prepared according to procedures G, H, I, J, K, L, X and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(2H-tetrazol-5-yl)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 29) Procedure X: Preparation of (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(2H-tetrazol-5-yl)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 29) A stirring solution of tert-butyl (Z)-(4-(5-cyano-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (120 mg, 0.23 mmol), triethylamine hydrochloride (94.1 mg, 0.68 mmol) and sodium azide (44.4 mg, 0.68 mmol) in DMF (2 mL) under N2 was heated at 100° C. for 5h. The reaction mixture was partitioned between aq. HCl (2 M, 20 mL) and ethyl acetate (20 mL). The organic layer was washed with sat aq. NaCl (20 mL), dried over Na2SO4. 1H-NMR analysis of the crude material indicated only 10% conversion. The crude residue was taken up in toluene (2 mL) and to this was added triethylamine hydrochloride (94.1 mg, 0.68 mmol) followed by sodium azide (44.4 mg, 0.68 mmol). The resulting mixture was heated under reflux for 12 h. The reaction mixture was partitioned between aq. HCl (2 M, 20 mL) and ethyl acetate (20 mL). The organic layer was washed with sat aq. NaCl (20 mL), dried over Na2SO4. The crude material was purified over silica gel (adsorbed onto 1 g; 10 g silica in total) eluting with 50% ethyl acetate in hexane followed by ethyl acetate to give (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(2H-tetrazol-5-yl)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (14.0 mg, 11%). 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.27 (dd, J=1.7, 0.6 Hz, 1H), 7.92 (dd, J=8.6, 1.7 Hz, 1H), 7.89-7.79 (m, 4H), 7.73 (d, J=8.6 Hz, 1H), 5.22 (d, J=9.4 Hz, 2H), 4.96 (dt, J=34.1, 7.3 Hz, 1H), 3.65 (d, J=7.4 Hz, 2H), 2.80 (s, 6H), 2.60 (s, 3H). Example 25 The following compound was prepared according to procedures G, H, I, J, Y, K, L, M, N and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-(N-methylmethylsulfonamido)phenyl)-1H-indole-5-carboxamide hydrochloride (Compound 39) Procedure Y: Preparation of 1-(tert-butyl) 5-ethyl 2-methyl-3-(3-(N-methylmethylsulfonamido)phenyl)-1H-indole-1,5-dicarboxylate To a stirring solution of 1-(tert-butyl) 5-ethyl 2-methyl-3-(3-(methylsulfonamido)phenyl)-1H-indole-1,5-dicarboxylate (150 mg, 0.32 mmol) in DMF (3 mL) was added potassium carbonate (65.8 mg, 0.48 mmol) followed by iodomethane (30 uL, 0.48 mmol). The resulting reaction mixture was stirred at rt overnight. Water (20 mL) was added to the reaction mixture, and the resulting precipitated solid was isolated by filtration. The solid was dissolved in dichloromethane, and then dried over MgSO4. After removal of the solvent in vacuo, 1-(tert-butyl) 5-ethyl 2-methyl-3-(3-(N-methylmethylsulfonamido)phenyl)-1H-indole-1,5-dicarboxylate (153 mg, 99%) was afforded as a white solid. 1H NMR (300 MHz, CDCl3) δ ppm: 8.23 (dd, J=8.8, 0.7 Hz, 1H), 8.17 (dd, J=1.8, 0.7 Hz, 1H), 8.01 (dd, J=8.8, 1.8 Hz, 1H), 7.55 (t, J=7.7 Hz, 1H), 7.39-7.48 (m, 3H), 4.39 (q, J=7.1 Hz, 2H), 3.41 (s, 3H), 2.94 (s, 3H), 2.65 (s, 3H), 1.74 (s, 9H), 1.40 (t, J=7.1 Hz, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-(N-methylmethylsulfonamido)phenyl)-1H-indole-5-carboxamide hydrochloride (Compound 39) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.20 (d, J=1.5 Hz, 1H), 7.80 (dd, J=8.6, 1.6 Hz, 1H), 7.67 (d, J=8.7 Hz, 1H), 7.59 (d, J=7.7 Hz, 1H), 7.49-7.40 (m, 3H), 5.23 (d, J=12.6 Hz, 2H), 5.06 (dt, J=36.2, 7.2 Hz, 1H), 3.49 (d, J=7.2 Hz, 2H), 3.32 (d, J=2.5 Hz, 6H), 3.00 (s, 3H), 2.53 (s, 3H). Example 26 The following compound was prepared according to procedures G, H, I, J, Y, K, L, and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(3-(N-methylmethylsulfonamido)phenyl)-1H-indole-5-carboxylic acid hydrochloride (Compound 38) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.20 (d, J=1.5 Hz, 1H), 7.80 (dd, J=8.6, 1.6 Hz, 1H), 7.67 (d, J=8.7 Hz, 1H), 7.59 (dd, J=7.7 Hz, 1H), 7.50-7.40 (m, 3H), 5.23 (d, J=12.6 Hz, 2H), 5.06 (dt, J=36.0, 7.2 Hz, 1H), 3.49 (d, J=7.1 Hz, 2H), 3.32 (s, 5H), 3.00 (s, 3H), 2.53 (s, 1H). Example 27 The following compounds were prepared according to procedures Z, G, H, I, J, K, L and O. Ethyl (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(N,N-dimethylsulfamoyl)-2-methyl-1H-indol-3-yl)benzoate hydrochloride (Compound 33) Procedure Z: Preparation of 3-fluoro-N,N-dimethyl-4-nitrobenzenesulfonamide To a stirring solution of dimethylamine hydrochloride (340 mg, 4.17 mmol) in dichloromethane at 0° C. was added triethylamine (1.28 mL, 9.18 mmol). After stirring for 2 mins, 3-fluoro-4-nitrobenzenesulfonyl chloride (1.00 g, 4.17 mmol) was added in one portion. The resulting mixture was stirred at 0° C. for a further 20 mins. The reaction mixture was partitioned between dichloromethane (30 mL) and water (10 mL) and the organic layer was washed with sat. aq. NaCl, dried over MgSO4 and concentrated in vacuo to afford 3-fluoro-N,N-dimethyl-4-nitrobenzenesulfonamide (1.02 g, 98%) as a yellow solid. 1H NMR (300 MHz, CDCl3) δ ppm: 8.23 (dd, J=8.7, 6.8 Hz, 1H), 7.77-7.69 (m, 2H), 2.83 (s, 6H), 1.57 (s, 3H). Ethyl (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(N,N-dimethylsulfamoyl)-2-methyl-1H-indol-3-yl)benzoate hydrochloride (Compound 33) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.04 (d, J=1.8 Hz, 1H), 7.98 (dt, J=7.4, 1.6 Hz, 1H), 7.95 (s, 3H), 7.87 (d, J=8.7 Hz, 1H), 7.84 (d, J=1.7 Hz, 1H), 7.77 (dt, J=7.7, 1.7 Hz, 1H), 7.72 (d, J=7.5 Hz, 1H), 7.57 (dd, J=8.6, 1.8 Hz, 1H), 5.30 (d, J=13.0 Hz, 2H), 5.13 (dt, J=36.0, 7.3 Hz, 1H), 4.35 (q, J=7.1 Hz, 2H), 3.50 (d, J=8.6 Hz, 2H), 2.59 (s, 6H), 2.55 (s, 3H), 1.33 (t, J=7.1 Hz, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(pyridin-4-yl)-1H-indole-5-sulfonamide dihydrochloride (Compound 81) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.93 (d, J=6.8 Hz, 2H), 8.18 (s, 3H), 8.11 (d, J=6.8 Hz, 1H), 8.05 (d, J=1.7 Hz, 1H), 7.98 (d, J=8.7 Hz, 1H), 7.65 (dd, J=8.7, 1.7 Hz, 1H), 5.37 (d, J=1.9 Hz, 2H), 5.31 (dt, J=35.2, 7.6 Hz, 1H), 3.53-3.42 (m, 2H), 2.71 (s, 3H), 2.62 (s, 6H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-phenyl-1H-indole-5-sulfonamide (Compound 86) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.95 (d, J=1.5 Hz, 1H), 7.70 (d, J=8.7 Hz, 1H), 7.61 (dd, J=8.6, 1.8 Hz, 1H), 7.57-7.50 (m, 2H), 7.50-7.44 (m, 2H), 7.43-7.36 (m, 1H), 5.21 (d, J=9.9 Hz, 1H), 4.91 (dt, J=35.3, 7.5 Hz, 1H), 3.64 (d, J=7.4 Hz, 2H), 2.65 (s, 6H), 2.57 (s, 3H). Example 28 The following compound was prepared according to procedures E, F, Z, G, H, I, J, K, L and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-N,N,2-trimethyl-1-indole-5-sulfonamide hydrochloride (Compound 58) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.99 (d, J=1.7 Hz, 1H), 7.89 (s, 1H), 7.83-7.79 (m, 3H), 7.74 (d, J=8.7 Hz, 1H), 7.65 (dd, J=8.7, 1.7 Hz, 1H), 5.24 (d, J=9.7 Hz, 2H), 4.94 (dt, J=34.4, 7.3 Hz, 1H), 3.65 (d, J=7.4 Hz, 2H), 2.80 (s, 6H), 2.67 (s, 6H), 2.62 (s, 3H). Example 29 The following compound was prepared according to procedures Z, G, H, I, J, K, L, AA and U. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(N,N-dimethylsulfamoyl)-2-methyl-1H-indol-3-yl)benzoic acid hydrochloride (Compound 34) Procedure AA: Preparation of (Z)-3-(1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-5-(N,N-dimethylsulfamoyl)-2-methyl-1H-indol-3-yl)benzoic acid In a 25 mL round bottom, ethyl (Z)-3-(1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-5-(N,N-dimethylsulfamoyl)-2-methyl-1H-indol-3-yl)benzoate (120 mg, 0.21 mmol) was added, followed by MeOH (2 mL), THF (2 mL) and aqueous KOH (10 w %, 2 mL). The resulting mixture was stirred at 60° C. for 2 h. The reaction mixture was then concentrated in vacuo. To the residue was added water (10 mL), and the aqueous mixture was acidified to pH=4.5 by addition of 2M aq. HCl. The resulting white solid was collected by filtration, and the solid “cake” was washed with water (2 mL×3). The solid was re-dissolved in ethyl acetate, and organics were dried over Na2SO4, and concentrated in vacuo to give (Z)-3-(1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-5-(N,N-dimethylsulfamoyl)-2-methyl-1H-indol-3-yl)benzoic acid (110 mg, 96%) as a pale yellow foam. 1H NMR (300 MHz, CDCl3) δ ppm: 8.19 (t, J=1.8 Hz, 1H), 8.12 (dt, J=7.8, 1.5 Hz, 1H), 8.04 (d, J=1.7 Hz, 1H), 7.73 (dt, J=7.7, 1.5 Hz, 1H), 7.67-7.58 (m, 2H), 7.44 (d, J=8.7 Hz, 1H), 4.88 (d, J=10.5 Hz, 2H), 3.83 (s, 2H), 2.71 (s, 6H), 2.54 (s, 3H), 1.43 (s, 9H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(N,N-dimethylsulfamoyl)-2-methyl-1H-indol-3-yl)benzoic acid hydrochloride (Compound 34) 1H NMR (300 MHz, DMSO-d6) δ ppm: 13.08 (s, 1H), 8.02 (d, J=1.8 Hz, 1H), 7.96 (dt, J=7.3, 1.7 Hz, 1H), 7.93 (s, 3H), 7.87 (d, J=8.9 Hz, 1H), 7.84 (d, J=1.8 Hz, 1H), 7.74 (dt, J=7.7, 1.7 Hz, 1H), 7.70 (d, J=7.5 Hz, 1H), 7.56 (dd, J=8.6, 1.8 Hz, 1H), 5.30 (d, J=12.8 Hz, 2H), 5.12 (dt, J=35.9, 7.3 Hz, 1H), 3.49 (s, 2H), 2.58 (s, 6H), 2.55 (s, 3H). Example 30 The following compound was prepared according to procedures Z, G, H, I, J, K, L, AB and AC. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-hydroxy-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzene-sulfonamide hydrochloride (Compound 37) Procedure AB: Preparation of 2-methyl-1H-indol-5-yl 4-nitrobenzoate HATU (1.36 g, 3.60 mmol) was added to a solution of 4-nitrobenzoic acid (552 mg, 3.30 mmol), 2-methyl-1H-indol-5-ol (442 mg, 3.00 mmol), triethylamine (1.46 mL, 10.5 mmol) in DMF (6 mL). The mixture was stirred at rt for 2 hours and then left overnight at ambient temperature. Water (60 mL) was added to the reaction mixture, and the suspension was stirred at rt for 10 min. The yellow solid was filtered and washed with water (25 mL). The solid was dried in oven at 60° C. for 1 h to afford 2-methyl-1H-indol-5-yl 4-nitrobenzoate (900 mg, 100%) as a yellow solid. 1H NMR (300 MHz, CDCl3) δ ppm: 8.43 (d, J=9.1 Hz, 2H), 8.37 (d, J=9.1 Hz, 2H), 7.98 (s, 1H), 7.36 (d, J=2.4 Hz, 1H), 7.33 (dt, J=8.7, 0.7 Hz, 1H), 6.97 (dd, J=8.6, 2.3 Hz, 1H), 6.26 (dt, J=2.2, 1.0 Hz, 1H), 2.49 (d, J=1.0 Hz, 2H). Procedure AC: Preparation of (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-hydroxy-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride To a stirring solution of (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-5-yl 4-nitrobenzoate (50.0 mg, 0.08 mmol) in methanol (1 mL) at rt was added aqueous sodium hydroxide (2 M, 75 uL, 0.15 rmmol). The resulting mixture was stirred at rt for 1 h. Ethereal HCl (2.0 M, 4.00 mL, 8.00 mmol) was added and stirring was continued for 2 h. The reaction mixture was concentrated under vacuum. Methanol (2 mL) was then added and the precipitated inorganics were filtered off. The filtrate was concentrated again under vacuum and to the residue was added ethyl acetate (3 mL). The residue was triturated and the supernatant was decanted off. This was repeated two more times to ensure complete removal of the 4-nitrobenzoic acid. The solid was isolated and then dried in an oven at 60° C. for 2 h to give (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-hydroxy-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (21.0 mg, 62%) as an off-white solid. 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.90 (s, 1H), 8.00 (s, 3H), 7.79-7.64 (m, 3H), 7.38 (d, J=8.7 Hz, 1H), 6.89 (d, J=2.3 Hz, 1H), 6.70 (dd, J=8.7, 2.3 Hz, 1H), 5.09 (d, J=11.7 Hz, 2H), 5.01 (dt, J=37.1, 7.2 Hz, 1H), 3.47 (s, 2H), 3.32 (s, 6H), 2.70 (s, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-hydroxy-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzene-sulfonamide hydrochloride (Compound 37) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.90 (s, 1H), 8.00 (s, 3H), 7.80-7.63 (m, 4H), 7.38 (d, J=8.7 Hz, 1H), 6.89 (d, J=2.3 Hz, 1H), 6.70 (dd, J=8.7, 2.3 Hz, 1H), 5.09 (d, J=11.7 Hz, 2H), 5.01 (dt, J=34.5, 7.1 Hz, 1H), 3.47 (s, 2H), 2.70 (s, 6H), 2.47 (s, 3H). Example 31 The following compound was prepared according to procedures AD, AE, G, H, I, J, K, L, M and AF (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)pyridin-3-yl)-2-methyl-1H-indole-5-carboxylic acid dihydrochloride (Compound 40) Procedure AD: Preparation of N,N-dimethylpyridine-3-sulfonamide To a stirring suspension of pyridine-3-sulfonyl chloride hydrochloride (8.00 g, 37.4 mmol) in THF (80 mL) at 0° C. was added dimethylamine solution (40 w % in water; 25.0 mL, 187 mmol) drop-wise over 5 min. The resulting homogeneous mixture was left to stir at 0° C. for 30 min and then rt for a further 1 h. The reaction mixture was partitioned between water (100 mL) and ethyl acetate (70 mL) and the aqueous layer was extracted with further ethyl acetate (50 mL). The combined organics were washed with sat. aq. NaCl (50 mL); dried over Na2SO4, and concentrated in vacuo to give N,N-dimethylpyridine-3-sulfonamide (6.01 g, 86%) as a white solid. 1H NMR (300 MHz, CDCl3) δ ppm: 9.02 (dd, J=2.3, 0.9 Hz, 1H), 8.85 (dd, J=4.9, 1.7 Hz, 1H), 8.09 (ddd, J=8.0, 2.3, 1.7 Hz, 1H), 7.52 (ddd, J=8.0, 4.9, 0.9 Hz, 1H), 2.78 (s, 6H). Procedure AE: Preparation of 4-bromo-N,N-dimethylpyridine-2-sulfonamide To a stirring suspension of N,N-dimethylpyridine-2-sulfonamide (920 mg, 4.94 mmol) and sodium acetate (1.22 g, 14.8 mmol) in AcOH (10 mL) at rt was added molecular bromine (506 uL, 9.88 mmol). The resulting mixture was heated to 60° C., and stirring was continued overnight. The reaction mixture was poured into water (100 mL) and then solid Na2CO3 was added until a neutral pH was attained. The aqueous mixture was extracted with ethyl acetate (20 mL×3) and the combined organics were dried over Na2SO4, and then concentrated in vacuo. The crude material was purified over silica gel eluting with 50% ethyl acetate in hexane, followed by ethyl acetate to give 4-bromo-N,N-dimethylpyridine-2-sulfonamide (520 mg, 37%) as a light yellow solid. 1H NMR (300 MHz, CDCl3) δ 8.91 (dd, J=5.5, 2.1 Hz, 1H), 8.22 (dd, J=2.1 Hz, 1H), 7.28 (s, 1H), 2.82 (s, 6H). Procedure AF: Preparation of (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)pyridin-3-yl)-2-methyl-1H-indole-5-carboxylic acid dihydrochloride To a stirring solution of (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)pyridin-3-yl)-2-methyl-1H-indole-5-carboxylic acid (30 mg, 0.05 mmol) in dichloromethane (2 mL) was added trifluoroacetic acid (500 uL, 0.05 mmol). The resulting mixture was stirred at rt for 1 h. The reaction mixture was concentrated in vacuo, and co-evaporated with dichloromethane (5 mL×2) to remove traces of trifluoroacetic acid. To the residue was added THF (10 mL), and to this was added ethereal HCl (2.00 mL). The resulting mixture was left to stir at rt for 15 mins. The reaction mixture was again concentrated in vacuo. To the residue was added ethyl acetate (5 mL) at which time an off-white solid precipitated. The solid was isolated and dried under high vacuum to afford (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)pyridin-3-yl)-2-methyl-1H-indole-5-carboxylic acid dihydrochloride (24.0 mg, 90%) as an off-white solid. 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.11 (s, 1H), 9.06 (s, 1H), 8.51 (s, 1H), 8.35 (d, J=1.5 Hz, 1H), 7.99 (dd, J=8.7, 1.6 Hz, 1H), 7.64 (d, J=8.7 Hz, 1H), 5.24 (d, J=10.0 Hz, 2H), 5.01 (dt, J=34.0, 7.4 Hz, 1H), 3.65 (d, J=7.3 Hz, 2H), 2.92 (s, 6H), 2.65 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)pyridin-3-yl)-2-methyl-1H-indole-5-carboxylic acid dihydrochloride (Compound 40) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.11 (s, 1H), 9.06 (s, 1H), 8.51 (s, 1H), 8.35 (d, J=1.5 Hz, 1H), 7.99 (dd, J=8.7, 1.6 Hz, 1H), 7.64 (d, J=8.7 Hz, 1H), 5.24 (d, J=10.0 Hz, 2H), 5.01 (dt, J=34.0, 7.4 Hz, 1H), 3.65 (d, J=7.3 Hz, 2H), 2.92 (s, 6H), 2.65 (s, 3H). Example 32 The following compound was prepared according to procedures AD, AE, G, H, I, J, K, L, M, N and O. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(5-(N,N-dimethylsulfamoyl)pyridin-3-yl)-N,N,2-trimethyl-1H-indole-5-carboxamide dihydrochloride (Compound 41) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.22 (s, 2H), 8.60 (s, 1H), 7.73 (s, 1H), 7.65 (d, J=8.4 Hz, 1H), 7.39 (d, J=8.3 Hz, 1H), 5.22 (d, J=10.4 Hz, 2H), 5.06 (dt, J=34.3, 7.4 Hz, 1H), 3.64 (d, J=6.6 Hz, 2H), 3.10 (s, 6H), 2.90 (s, 6H), 2.64 (s, 3H). Example 33 The following compounds were prepared according to procedures AD, AE, J, K, L, and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzene-sulfonamide hydrochloride (Compound 62) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.06 (s, 3H), 7.86-7.76 (m, 2H), 7.75-7.70 (m, 2H), 7.67 (d, J=8.7 Hz, 1H), 7.48 (d, J=2.0 Hz, 1H), 7.23 (dd, J=8.7, 2.0 Hz, 1H), 5.22 (d, J=12.7 Hz, 2H), 5.09 (dt, J=36.0, 7.3 Hz, 1H), 3.47 (d, J=7.2 Hz, 2H), 2.70 (s, 6H), 2.52 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 63) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.08 (s, 1H), 9.02 (s, 1H), 8.48 (dd, J=2.0 Hz, 1H), 7.62 (dd, J=7.8, 1.2 Hz, 1H), 7.56 (d, J=8.1 Hz, 1H), 7.31 (ddd, J=8.3, 7.1, 1.2 Hz, 1H), 7.22 (ddd, J=8.1, 7.1, 1.1 Hz, 1H), 5.18 (d, J=9.2 Hz, 2H), 4.92 (dt, J=35.2, 7.4 Hz, 1H), 3.63 (d, J=7.5 Hz, 2H), 2.89 (s, 6H), 2.62 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 64) 1H NMR (300 MHz, DMSO-d6) δ ppm: 9.02 (d, J=2.1 Hz, 1H), 8.89 (d, J=2.2 Hz, 1H), 8.19 (s, 3H), 8.10 (dd, J=2.1 Hz, 1H), 7.69 (d, J=8.7 Hz, 1H), 7.51 (d, J=2.0 Hz, 1H), 7.25 (dd, J=8.7, 2.0 Hz, 1H), 5.24 (d, J=12.9 Hz, 2H), 5.14 (dt, J=35.4, 7.6 Hz, 1H), 3.46 (t, J=6.4 Hz, 2H), 2.76 (s, 6H), 2.53 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 66) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.27 (s, 1H), 8.99 (s, 1H), 8.66 (dd, J=2.0 Hz, 1H), 8.09 (s, 1H), 7.93 (dd, J=2.0, 0.6 Hz, 1H), 7.65 (d, J=8.8 Hz, 1H), 7.37 (dd, J=8.8, 2.0 Hz, 1H), 5.22 (dt, J=35.2, 7.5 Hz, 1H), 5.21 (d, J=13.2 Hz, 2H), 3.66 (d, J=7.4 Hz, 2H), 2.90 (s, 6H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-6-chloro-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 67) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.18 (s, 1H), 9.14 (s, 1H), 8.68 (d, J=1.8 Hz, 1H), 7.66 (d, J=1.8 Hz, 1H), 7.61 (d, J=8.5 Hz, 1H), 7.22 (dd, J=8.5, 1.8 Hz, 1H), 5.19 (d, J=10.0 Hz, 2H), 5.04 (dt, J=34.1, 7.4 Hz, 1H), 3.65 (dd, J=7.1, 2.6 Hz, 2H), 2.92 (s, 6H), 2.63 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-fluoro-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 71) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.16 (s, 1H), 9.12 (s, 1H), 8.65 (dd, J=1.9 Hz, 1H), 7.58 (dd, J=9.0, 4.3 Hz, 1H), 7.35 (dd, J=9.5, 2.4 Hz, 1H), 7.09 (dt, J=9.1, 2.5 Hz, 1H), 5.20 (d, J=10.7 Hz, 2H), 5.04 (dt, J=34.2, 7.4 Hz, 1H), 3.64 (d, J=7.5 Hz, 2H), 2.93 (s, 6H), 2.63 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-6-chloro-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylpyridine-3-sulfonamide trihydrochloride (Compound 72) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.36 (s, 1H), 9.29 (s, 1H), 8.93 (s, 1H), 8.91 (s, 1H), 8.73 (s, 1H), 5.45 (d, J=11.2 Hz, 2H), 5.41 (dt, J=33.9, 7.2 Hz, 1H), 3.69 (d, J=6.6 Hz, 2H), 2.93 (s, 6H), 2.74 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-pyrrolo[2,3-b]pyridin-3-yl)-N,N-dimethylpyridine-3-sulfonamide trihydrochloride (Compound 73) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.14 (d, J=2.0 Hz, 1H), 9.10 (d, J=2.0 Hz, 1H), 8.55 (dd, J=1.8 Hz, 1H), 8.32 (d, J=2.2 Hz, 1H), 8.07 (d, J=2.2 Hz, 1H), 5.29 (d, J=10.7 Hz, 2H), 5.06 (dt, J=34.0, 7.4 Hz, 1H), 3.64 (d, J=7.4 Hz, 2H), 2.90 (s, 6H), 2.67 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-7-chloro-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 74) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.96 (dd, J=21.2, 2.1 Hz, 1H), 8.10 (dd, J=2.1 Hz, 1H), 8.08 (s, 1H), 7.48 (dd, J=7.9, 1.1 Hz, 1H), 7.27 (dd, J=7.7, 1.1 Hz, 1H), 7.14 (dd, J=7.8 Hz, 1H), 5.51 (d, J=7.5 Hz, 1H), 4.83 (dt, J=36.2, 7.3 Hz, 1H), 3.48 (t, J=6.3 Hz, 2H), 2.76 (s, 6H), 2.51 (s, 3H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-4-chloro-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 75) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.91 (s, 1H), 8.89 (d, J=2.0 Hz, 1H), 8.06 (dd, J=2.1 Hz, 1H), 7.66 (dd, J=8.1, 1.0 Hz, 1H), 7.20 (dd, J=7.9 Hz, 1H), 7.13 (dd, J=7.7, 1.0 Hz, 1H), 5.25 (d, J=12.2 Hz, 2H), 5.07 (dt, J=36.0, 7.2 Hz, 1H), 3.47 (t, J=6.3 Hz, 2H), 2.73 (s, 6H), 2.36 (s, 3H). Example 34 The following compound was prepared according to procedures AG, J, K, L, M and O (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-methoxy-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzene-sulfonamide hydrochloride (Compound 49) Procedure AG: Preparation of 5-methoxy-2-methyl-1H-indole To a suspension of 5-hydroxy-2-methylindole (442 mg, 3.00 mmol), and potassium carbonate (517 mg, 3.74 mmol) in DMF (2.5 mL) at rt was added iodomethane (0.70 mL, 11.2 mmol). The resulting mixture was stirred at rt overnight. Water (25 mL) and aqueous NaOH (2 M, 5 mL) was added, and the mixture was stirred for a further 5 min. The product was extracted with ethyl acetate (25 mL×3) and the combined organics were washed with water (20 mL×2) and brine (25 mL), dried over Na2SO4 and concentrated in vacuo to afford 5-methoxy-2-methyl-1H-indole (517 mg, 100%) as a brown oil. 1H NMR (300 MHz, CDCl3) δ ppm: 7.77 (s, 1H), 7.19 (dt, J=8.7, 0.7 Hz, 1H), 7.02 (d, J=2.5 Hz, 1H), 6.78 (dd, J=8.7, 2.5 Hz, 1H), 6.17 (dt, J=2.2, 1.0 Hz, 1H), 3.86 (s, 3H), 2.44 (d, J=0.9 Hz, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-methoxy-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzene-sulfonamide hydrochloride (Compound 49) 1H NMR (300 MHz, DMSO-d6) δ ppm: 7.96 (s, 3H), 7.82 (ddd, J=7.6, 1.7, 1.7, 1H), 7.79 (d, J=7.6 Hz, 1H), 7.75 (d, J=2.2 Hz, 1H), 7.69 (dt, J=7.2, 1.8 Hz, 1H), 7.51 (d, J=8.9 Hz, 1H), 7.00 (d, J=2.4 Hz, 1H), 6.85 (dd, J=8.9, 2.4 Hz, 1H), 5.14 (d, J=11.9 Hz, 2H), 5.00 (dt, J=35.9, 7.3 Hz, 1H), 3.73 (s, 3H), 3.47 (d, J=7.2 Hz, 2H), 3.32 (s, 3H), 2.71 (s, 6H). Example 35 The following compound was prepared according to procedures AD, AE, J, K, AH, L and O (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-chloro-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 96) Procedure AH: Preparation of 5-(2-chloro-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide To a stirring solution of 5-(1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide (141 mg, 0.47 mmol) in DMF (5 mL) at 0° C. was added N-chlorosuccinimide (68.7 mg, 0.51 mmol). Stirring at 0° C. for 30 mins and then rt for 2 h. The reaction mixture was partitioned between ethyl acetate and water. The organic layer was washed with further water and brine, then dried over Na2SO4, and concentrated in vacuo. Purification was performed using a 12 g RediSep cartridge, eluting over a gradient of 30-80% ethyl acetate in hexane to afford the title compound 5-(2-chloro-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide (62.0 mg, 39%) as a white solid. 1H NMR (300 MHz, CDCl3) δ ppm: 9.16 (d, J=2.1 Hz, 1H), 8.97 (d, J=2.2 Hz, 1H), 8.86 (s, 1H), 8.37 (dd, J=2.1 Hz, 1H), 7.67 (ddd, J=7.8, 1.5, 0.7 Hz, 1H), 7.43 (ddd, J=8.1, 1.3, 0.8 Hz, 1H), 7.32 (dd, J=8.3, 1.2 Hz, 1H), 7.25 (ddd, J=7.8, 7.1, 1.3 Hz, 1H), 2.86 (s, 6H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-chloro-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 96) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.26 (s, 1H), 9.09 (s, 1H), 8.70 (dd, J=1.8 Hz, 1H), 7.75 (d, J=8.1 Hz, 1H), 7.66 (d, J=8.2 Hz, 1H), 7.42 (ddd, J=8.3, 7.2, 1.1 Hz, 1H), 7.33 (ddd, J=8.1, 7.2, 1.0 Hz, 1H), 5.29 (d, J=11.1 Hz, 2H), 5.13 (dt, J=33.9, 7.4 Hz, 1H), 3.71-3.61 (m, 2H), 2.90 (s, 6H). Example 36 The following compound was prepared according to procedures E, F, J, K, AH, L and O (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-chloro-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzene-sulfonamide dihydrochloride (Compound 99) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.88 (d, J=8.5 Hz, 1H), 8.64 (dd, J=5.8, 1.0 Hz, 1H), 8.09-8.05 (m, 1H), 8.03-7.95 (m, 2H), 7.93-7.84 (m, 2H), 5.53 (d, J=14.2 Hz, 2H), 5.49 (dt, J=35.2, 7.4 Hz, 1H), 3.69 (d, J=7.3 Hz, 2H), 2.78 (s, 6H). Example 37 The following compound was prepared according to procedures J, K, AI, L and O. (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-indol-3-yl)-N-methylpyridine-3-sulfonamide dihydrochloride (Compound 70) Procedure AI: Preparation of tert-butyl ((5-(5-chloro-2-methyl-1H-indol-3-yl)pyridin-3-yl)sulfonyl)(methyl)carbamate Trifluoroacetic acid (3.00 mL, 0.39 mmol) was added to a stirring solution of tert-butyl 5-chloro-2-methyl-3-(5-(N-methylsulfamoyl)pyridin-3-yl)-1H-indole-1-carboxylate (172 mg, 0.39 mmol) in dichloromethane (3 mL) at rt. The mixture was stirred at rt for 45 min. All volatiles were then removed in vacuo. To the residue was added sat. aq. NaHCO3 (5 mL) and the product was extracted with ethyl acetate (15 mL×3). The combined organics were dried over Na2SO4 and concentrated in vacuo. The crude material was taken up in DMF (1.5 mL), and to this was added di-tert-butyl dicarbonate (172 mg, 0.79 mmol) and potassium carbonate (109 mg, 0.79 mmol). The resulting suspension was stirred at rt for 30 min. Tlc after this time showed approximately 20-30% conversion. Triethylamine (0.11 mL, 0.79 mmol) was added and stirring was continued overnight at rt. Water (10 mL) was added and the product was extracted with ethyl acetate (10 mL×3). The combined organics were dried over Na2SO4 and concentrated in vacuo. The crude material was purified over silica gel eluting with 20-50% ethyl acetate in hexane gave impure tert-butyl ((5-(5-chloro-2-methyl-1H-indol-3-yl)pyridin-3-yl)sulfonyl)(methyl)carbamate (80.0 mg, 47%). This material was progressed to the next step without further purification. (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-indol-3-yl)-N-methylpyridine-3-sulfonamide dihydrochloride (Compound 70) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.04 (s, 2H), 8.54 (s, 1H), 7.61 (d, J=2.0 Hz, 1H), 7.55 (d, J=8.7 Hz, 1H), 7.27 (dd, J=8.8, 2.0 Hz, 1H), 5.18 (d, J=9.8 Hz, 2H), 4.96 (dt, J=34.4, 7.6 Hz, 1H), 3.64 (d, J=7.4 Hz, 2H), 2.72 (s, 3H), 2.61 (s, 3H). Example 38 The following compound was prepared according to procedures AJ, F, G, H, I, J, K, L, M, N and AK. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-sulfamoylphenyl)-1H-indole-5-carboxamide hydrochloride (Compound 54) Procedure AJ: Preparation of 3-bromo-N,N-bis(4-methoxybenzyl)benzenesulfonamide To a stirring solution of bis(4-methoxybenzyl)amine (771 mg, 3.00 mmol) and triethylamine (0.72 mL, 3.00 mmol) in THF (10 mL) at 0° C. was added 3-bromobenzenesulfonyl chloride (766 mg, 3.00 mmol) was added portion-wise. The mixture was stirred at rt for 30 min. The reaction mixture was diluted with water (30 mL) and then acidified to pH 2 using aqueous 2 M HCl. The product was extracted in ethyl acetate (20 mL×3). The combined organics were dried over Na2SO4 and concentrated in vacuo to afford 3-bromo-N,N-bis(4-methoxybenzyl)benzenesulfonamide (1.24 g, 87%) as a white solid. 1H NMR (300 MHz, CDCl3) δ ppm: 7.86 (dd, J=1.8 Hz, 1H), 7.74 (ddd, J=7.9, 1.8, 1.0 Hz, 1H), 7.69 (ddd, J=8.0, 1.9, 1.0 Hz, 1H), 7.36 (dd, J=7.9 Hz, 1H), 7.03 (d, J=8.6 Hz, 4H), 6.80 (d, J=8.6 Hz, 4H), 3.81 (s, 6H). Procedure AK: Preparation of (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-sulfamoylphenyl)-1H-indole-5-carboxamide hydrochloride (Compound 54) To a stirring solution of tert-butyl (Z)-(4-(3-(3-(N,N-bis(4-methoxybenzyl)sulfamoyl)phenyl)-5-(dimethylcarbamoyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (309 mg, 0.39 mmol) in dichloromethane (5 mL) at rt was added TFA (5 mL). The resulting mixture was stirred for 3 h. The reaction mixture was concentrated under vacuum, and then ethyl acetate (5 mL) was added to dissolve the residue. Ethereal HCl (2 M, 5 mL) was added and the mixture was stirred at rt for 5 min. The reaction mixture was again concentrated under vacuum, and then ethyl acetate (10 mL) was added. The solid was triturated, and then isolated by, firstly, spinning it down in a centrifuge, thus forming a solid “cake” and then decanting off the solvent. The solid was dried in oven at 60° C. for 3 h. The solid was purified by reverse-phase chromatography (gradient elution: 10% Acetonitrile then 10-30% acetonitrile over 20 min). The combined fractions containing the desired product were concentrated to a volume of approximately 5 mL. The aqueous solution of the product was transferred to a 7 mL vial and lyophilized to afford (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-N,N,2-trimethyl-3-(3-sulfamoylphenyl)-1H-indole-5-carboxamide hydrochloride (115 mg, 60%) as an off-white powder. 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.03 (s, 3H), 7.91 (d, J=2.0 Hz, 1H), 7.80 (dt, J=6.9, 2.0 Hz, 1H), 7.72 (d, J=7.7 Hz, 1H), 7.68 (s, 1H), 7.65 (d, J=8.5 Hz, 1H), 7.56 (d, J=1.4 Hz, 1H), 7.46 (s, 2H), 7.26 (dd, J=8.4, 1.5 Hz, 1H), 5.23 (d, J=12.3 Hz, 2H), 5.08 (dt, J=35.9, 7.2 Hz, 1H), 3.48 (dt, J=6.3 Hz, 3H), 2.97 (s, 6H), 2.53 (s, 3H). Example 39 The following compound was prepared according to procedures AJ, F, J, K, and AK. (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-indol-3-yl)pyridine-3-sulfonamide dihydrochloride (Compound 83) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.94 (s, 2H), 8.24 (s, 1H), 8.04 (s, 3H), 7.74 (s, 2H), 7.69 (d, J=8.7 Hz, 1H), 7.55 (d, J=2.0 Hz, 1H), 7.25 (dd, J=8.7, 2.0 Hz, 1H), 5.24 (d, J=12.5 Hz, 2H), 5.08 (dt, J=36.0, 7.3 Hz, 11H), 3.47 (s, 2H), 2.53 (s, 3H). Example 40 The following compound was prepared according to procedures AL, F, J, K, L and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-7-fluoro-2-methyl-1H-indol-3-yl)-N,N,4-trimethylbenzenesulfonamide dihydrochloride (Compound 84) Procedure AL: Preparation of 3-bromo-N,N,4-trimethylbenzenesulfonamide A stirring mixture of N,N,4-trimethylbenzenesulfonamide (1.00 g, 5.02 mmol) in concentrated sulfuric acid (4.50 mL, 84.4 mmol) at rt was added 1-bromopyrrolidine-2,5-dione (983 mg, 5.52 mmol). The resulting solution was left to stir at rt for 3 h. The reaction mixture was poured into cold water and the resulting off-white precipitate was filtered and washed with further water. The solid was left to air dry, affording 3-bromo-N,N,4-trimethylbenzenesulfonamide (1.36 g, 97%). 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.93 (d, J=1.9 Hz, 1H), 7.67 (dd, J=8.0, 1.9 Hz, 1H), 7.56 (d, J=8.1 Hz, 1H), 2.70 (s, 6H), 2.50 (s, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-7-fluoro-2-methyl-1H-indol-3-yl)-N,N,4-trimethyl-benzenesulfonamide hydrochloride (Compound 84) 1H NMR (300 MHz, Methanol-d4) δ 7.76 (dd, J=8.0, 2.0 Hz, 1H), 7.66 (ddd, J=8.1, 0.6 Hz, 1H), 7.57 (d, J=2.0 Hz, 1H), 7.00 (dd, J=12.3, 1.8 Hz, 1H), 6.89 (d, J=1.8 Hz, 1H), 5.21 (dd, J=9.8, 2.7 Hz, 2H), 4.92 (dt, J=35.4, 7.5 Hz, 1H) 3.65 (dd, J=7.4, 1.6 Hz, 2H), 2.73 (s, 6H), 2.33 (s, 3H), 2.23 (s, 3H). Example 41 The following compound was prepared according to procedures E, F, AM, AN, J, K, L and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-cyano-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzene-sulfonamide hydrochloride (Compound 51) Procedure AM: Preparation of tert-butyl 5-bromo-2-methyl-1H-indole-1-carboxylate To a stirring solution of 5-bromo-2-methyl-1H-indole (1.00 g, 4.76 mmol) and di-tert-butyl dicarbonate (2.08 g, 9.52 mmol) in DMF (5 mL) at rt was added 4-(dimethylamino)pyridine (0.58 g, 4.76 mmol) in three portions over 10 mins. Then the resulting mixture was stirred at rt for 30 mins. Water (50 mL) was added slowly to the mixture and the product was extracted with ethyl acetate (20 mL×3). The combined organic layers were washed with sat. aq. NH4Cl (20 mL) and brine (20 mL), dried over Na2SO4 and concentrated in vacuo to give tert-butyl 5-bromo-2-methyl-1H-indole-1-carboxylate (1.46 g, 99%) as a yellow solid. 1H NMR (300 MHz, CDCl3) δ ppm: 7.99 (dt, J=8.9, 0.7 Hz, 1H), 7.57 (d, J=2.0 Hz, 1H), 7.32 (dd, J=8.9, 2.0 Hz, 1H), 6.27 (s, 1H), 2.60 (d, J=1.2 Hz, 3H), 1.70 (s, 9H). Procedure AN: Preparation of tert-butyl 5-cyano-2-methyl-1H-indole-1-carboxylate A stirring mixture of tert-butyl 5-bromo-2-methyl-1H-indole-1-carboxylate (250 mg, 0.81 mmol) and copper cyanide (361 mg, 4.03 mmol) in DMF (2.0 mL) under N2 was heated at 150° C. for 4 h. The reaction mixture was poured into ethyl acetate (30 mL) slowly and then water (20 mL) was added. The mixture was sonicated for 2 mins and then filtered through Celite™. The filtrate was transferred to a separatory funnel and the aqueous layer was extracted with ethyl acetate (20 mL×2). The combined organic layers were washed with sat. aq. NH4Cl (20 mL×2), and brine (20 mL), dried over Na2SO4 and concentrated in vacuo to afford tert-butyl 5-cyano-2-methyl-1H-indole-1-carboxylate (146 mg, 0.93 mmol, 100%) as a brown solid. 1H NMR (300 MHz, CDCl3) δ ppm: 8.44 (s, 1H), 7.85 (s, 1H), 7.35 (s, 2H), 6.31 (s, 1H), 2.49 (d, J=1.0 Hz, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-cyano-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzene-sulfonamide hydrochloride (Compound 51) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.87 (d, J=1.5 Hz, 1H), 7.80 (dq, J=3.2, 2.0, 1.4 Hz, 4H), 7.70 (d, J=8.5 Hz, 1H), 7.52 (dd, J=8.5, 1.5 Hz, 1H), 5.21 (d, J=10.3 Hz, 2H), 5.01 (dt, J=34.1, 7.4 Hz, 1H), 3.70-3.60 (m, 2H), 2.78 (s, 6H), 2.59 (s, 3H). Example 42 The following compound was prepared according to procedures E, F, AM, AN, J, K, AO, AP, L and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(1,2,4-oxadiazol-3-yl)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 55) Procedure AO: Preparation of 3-(3-(N,N-dimethylsulfamoyl)phenyl)-N-hydroxy-2-methyl-1H-indole-5-carboximidamide To a stirring mixture of 3-(5-cyano-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide (55.0 mg, 0.16 mmol) in ethanol (2 mL) and THF (2 mL) at rt was added hydroxylamine (45 uL, 0.81 mmol). The resulting mixture was stirred at this temperature over the weekend. Tlc analysis showed approximately 50% conversion. Additional hydroxylamine (45 uL, 0.81 mmol) was added and the mixture was heated to 45° C. for 2 days. The reaction mixture was concentrated in vacuo to afford 3-(3-(N,N-dimethylsulfamoyl)phenyl)-N-hydroxy-2-methyl-1H-indole-5-carboximidamide (55.0 mg, 91%) as a yellow solid. This material was progressed to the next step without further purification. Procedure AP: Preparation of N,N-dimethyl-3-(2-methyl-5-(1,2,4-oxadiazol-3-yl)-1H-indol-3-yl)benzenesulfonamide To a stirring mixture of 3-(3-(N,N-dimethylsulfamoyl)phenyl)-N-hydroxy-2-methyl-1H-indole-5-carboximidamide (55.0 mg, 0.15 mmol) and diethoxymethoxyethane (37 uL, 0.22 mmol) in THF (1 mL) and acetonitrile (1 mL) at 45° C. was added trifluoroacetic acid (0.6 uL, 7.4 h mol). The resulting mixture was stirred at 110° C. overnight. The mixture was concentrated in vacuo and dried under high vacuum to give N,N-dimethyl-3-(2-methyl-5-(1,2,4-oxadiazol-3-yl)-1H-indol-3-yl)benzenesulfonamide (39.0 mg, 69%) as a yellow solid. This material was progressed to the next step without further purification. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(1,2,4-oxadiazol-3-yl)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 55) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.21 (s, 1H), 8.36 (d, J=1.6 Hz, 1H), 8.00 (dd, J=8.6, 1.6 Hz, 1H), 7.93-7.88 (m, 1H), 7.87-7.76 (m, 3H), 7.66 (d, J=8.6 Hz, 1H), 5.20 (d, J=8.7 Hz, 2H), 4.80 (m, 1H), 3.64 (dd, J=7.5, 1.6 Hz, 2H), 2.83 (s, 6H), 2.60 (s, 3H). Example 43 The following compound was prepared according to procedures E, F, G, H, I, J, K, L, AQ, AR, AS and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(difluoromethyl)-2-methyl-1H-indol-3-yl)-N,N-dimethyl-benzenesulfonamide hydrochloride (Compound 59) Procedure AQ: Preparation of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(hydroxymethyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate To a stirring solution of ethyl (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate (500 mg, 0.88 mmol) in dry THF (3 mL) at 0° C. was added diisobutylaluminum hydride (1.10 mL, 1.10 mmol). The mixture was stirred at 0° C. for 5 min and then at ambient temperature for 1 h. The reaction was quenched by addition of ethyl acetate (1 mL) followed by stirring for 10 min. Aqueous NaOH (2 M, 20 mL) was added and stirring was continued for a further 2 min. The product was then extracted with ethyl acetate (20 mL×4). The combined organics were washed with brine (10 mL), dried over Na2SO4 and concentrated in vacuo to afford crude tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(hydroxymethyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (300 mg) as a viscous oil. This material was progressed to the next step without purification. 1H NMR (300 MHz, CDCl3) δ ppm: 7.87 (dt, J=1.8, 0.6 Hz, 1H), 7.76-7.70 (m, 2H), 7.65 (d, J=7.3 Hz, 1H), 7.60 (dd, J=1.6, 0.8 Hz, 1H), 7.32 (d, J=8.2 Hz, 1H), 7.25 (dd, J=8.4, 1.6 Hz, 1H), 4.82 (d, J=9.5 Hz, 2H), 4.75 (s, 2H), 4.68-4.86 (m, 1H), 4.64 (s, 1H), 3.78 (s, 2H), 2.78 (s, 6H), 2.49 (s, 3H), 1.41 (s, 9H). Procedure AR: Preparation of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-formyl-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate To a stirring solution crude of crude tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(hydroxymethyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (300 mg) in dichloromethane (3 mL) was added Dess-Martin periodinane (230 mg, 0.54 mmol) in one lot. The mixture was stirred at ambient temperature for 45 min. The reaction was quenched by addition of IPA (0.3 mL) followed by stirring for 5 min. The reaction mixture was adsorbed directly onto silica gel. Purification was performed over silica gel, eluting with 50% ethyl acetate in hexane to afford tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-formyl-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (188 mg, 81%) as a glassy foam. 1H NMR (300 MHz, CDCl3) δ 10.03 (s, 1H), 8.13 (d, J=1.3 Hz, 1H), 7.89 (dd, J=1.9 Hz, 1H), 7.74-7.84 (m, 3H), 7.71 (d, J=7.3 Hz, 1H), 7.45 (d, J=8.5 Hz, 1H), 4.88 (d, J=10.4 Hz, 2H), 4.79-4.95 (m, 1H), 4.60 (s, 1H), 3.83 (s, 2H), 2.82 (s, 6H), 2.54 (s, 3H), 1.43 (s, 9H). Procedure AS: Preparation of tert-butyl (Z)-(4-(5-(difluoromethyl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate To a stirring solution of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-formyl-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (90 mg, 0.17 mmol) in CDCl3 (the reaction progress was monitored by 1H-NMR) at rt was added diethylaminosulfur trifluoride (0.20 mL, 1.51 mmol). The reaction was stirred at rt for 30 h. 1H-NMR analysis after this time showed about 60% conversion. The reaction was quenched by the addition of water (5 mL) and the product was extracted with ethyl acetate (10 mL×3). The combined organic layer was dried over Na2SO4 and concentrated under vacuum. Purification was performed using reverse-phase chromatography eluting with 20% acetonitrile/water followed by 50-70% acetonitrile/water over 25 min to afford tert-butyl (Z)-(4-(5-(difluoromethyl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (36.0 mg, 38%). 1H NMR (300 MHz, CDCl3) δ ppm: 7.87 (d, J=1.8 Hz, 1H), 7.73-7.80 (m, 3H), 7.69 (d, J=7.8 Hz, 1H), 7.41 (s, 2H), 6.74 (t, J=56.9 Hz, 1H), 4.86 (d, J=10.2 Hz, 2H), 4.73-4.90 (m, 1H), 4.59 (s, 1H), 3.81 (s, 2H), 2.81 (s, 6H), 2.52 (s, 3H), 1.42 (s, 9H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(difluoromethyl)-2-methyl-1H-indol-3-yl)-N,N-dimethyl-benzene-sulfonamide hydrochloride (Compound 59) 1H NMR (300 MHz, DMSO-d6) δ ppm: 7.99 (s, 3H), 7.88-7.70 (m, 6H), 7.41 (d, J=9.1 Hz, 1H), 7.08 (t, J=56.3 Hz, 1H), 5.26 (d, J=12.3 Hz, 21-), 5.07 (dt, J=35.9, 7.2 Hz, 1H), 3.47 (d, J=7.1 Hz, 2H), 2.70 (s, 6H), 2.54 (s, 3H). Example 44 The following compound was prepared according to procedures AT, F, J, K, L and O. (Z)-6-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-2-sulfonamide dihydrochloride (Compound 78) Procedure AT: Preparation of 6-bromo-N,N-dimethylpyridine-2-sulfonamide To a stirring mixture of 2,6-dibromopyridine (2.00 g, 8.44 mmol) in THF (5 mL) at 0° C. under N2 was added isopropylmagnesium chloride (5.07 mL, 10.1 mol). The resulting mixture was stirred at rt for 1 h and then cooled to 0° C. To this was added a solution of sulfuryl chloride (1.30 mL, 16.0 mmol) in hexane (60 mL). The resulting mixture was warmed to rt and stirring was continued for a further 1 h. The reaction mixture was then concentrated in vacuo. After co-evaporated with hexane (50 mL), the reaction mixture was dried under high vacuum. The material thus obtained was redissolved in THF (5 mL), and then added dropwise to a mixture of dimethylamine (5.34 mL, 105 mmol) in THF (25 mL) at 0° C. The resulting mixture was stirred at this temperature for 30 mins. The reaction mixture was concentrated in vacuo, and the yellow residue was partitioned between ethyl acetate (100 mL) and water (30 mL). Then the organic layer was dried over Na2SO4 and then concentrated in vacuo. The crude material was purified over silica gel, eluting with 20% ethyl acetate in hexane to afford 6-bromo-N,N-dimethyl-pyridine-2-sulfonamide (1.10 g, 46%) as a yellow solid. 1H NMR (300 MHz, CDCl3) δ ppm: 7.91 (dd, J=7.5, 1.0 Hz, 1H), 7.77 (dd, J=8.0, 7.5 Hz, 1H), 7.67 (dd, J=7.9, 1.0 Hz, 1H), 3.00 (s, 6H). (Z)-6-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-chloro-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-2-sulfonamide dihydrochloride (Compound 78) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.12 (dd, J=7.9 Hz, 1H), 8.06 (d, J=2.0 Hz, 1H), 7.86 (dd, J=7.9, 0.9 Hz, 1H), 7.82 (dd, J=7.6, 0.9 Hz, 1H), 7.49 (d, J=8.7 Hz, 1H), 7.23 (dd, J=8.7, 2.1 Hz, 1H), 5.16 (d, J=8.7 Hz, 2H), 4.85 (dt, J=35.3, 7.5 Hz, 1H), 3.62 (d, J=7.3 Hz, 2H), 2.97 (s, 6H), 2.76 (s, 3H). Example 45 The following compound was prepared according to procedures AD, AE, AU, AV, AW, J, K, L and O. (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-cyclopropyl-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 79) Procedure AU: Preparation of tert-butyl 5-bromo-2-methyl-1H-indole-1-carboxylate To a stirring solution of 5-bromo-2-methyl-1H-indole (1.00 g, 4.76 mmol) and 4-(dimethylamino)pyridine (0.58 g, 4.76 mmol) in CH2Cl2 (20 mL) at rt under Ar was added di-tert-butyl dicarbonate (1.56 g, 7.14 mmol) as a solution in CH2Cl2 (5 mL). The resulting mixture was left to stir at rt for 2 h. The reaction mixture was partitioned between aqueous HCl (2 M, 50 mL) and CH2Cl2 (30 mL), and the organic layer was washed with sat. aq. NaCl (30 mL). After drying over Na2SO4, the organics were concentrated in vacuo to give tert-butyl 5-bromo-2-methyl-1H-indole-1-carboxylate (1.59 g, 100%) as a straw colored solid. This material was progressed to the next step without further purification. 1H NMR (300 MHz, CDCl3) δ ppm: 7.99 (dt, J=8.9, 0.6 Hz, 1H), 7.56 (d, J=2.0 Hz, 1H), 7.32 (dd, J=8.9, 2.0 Hz, 1H), 6.27 (s, 1H), 2.60 (d, J=1.1 Hz, 3H), 1.70 (s, 9H). Procedure AV: Preparation of tert-butyl 5-cyclopropyl-2-methyl-1H-indole-1-carboxylate To a stirring suspension of tert-butyl 5-bromo-2-methyl-1H-indole-1-carboxylate (620 mg, 2.00 mmol), cyclopropylboronic acid (214 mg, 2.50 mmol), tricyclohexylphosphine (56.1 mg, 0.20 mmol) and potassium phosphate tribasic (1.61 g, 7.00 mmol) in toluene (8 mL) and water (0.4 mL) was added palladium (II) acetate (44.9 mg, 0.20 mmol). The resulting mixture was heated at 100° C. for 3 h. After cooling to rt, the reaction mixture was filtered through Celite™, rinsing with ethyl acetate. The filtrate was then dried over Na2SO4 and concentrated in vacuo to give tert-butyl 5-cyclopropyl-2-methyl-1H-indole-1-carboxylate (563 mg, 100%) as a yellow/orange oil. This material was progressed to the next step without purification. 1H NMR (300 MHz, CDCl3) δ ppm: 7.98 (dt, J=8.6, 0.8 Hz, 1H), 7.16 (d, J=1.9 Hz, 1H), 6.99 (dd, J=8.6, 1.9 Hz, 1H), 6.26 (s, 1H), 2.60 (d, J=1.2 Hz, 3H), 2.05-1.94 (m, 1H), 1.70 (s, 9H), 1.01-0.90 (m, 2H), 0.77-0.67 (m, 2H). Procedure AW: Preparation of 5-cyclopropyl-2-methyl-1H-indole To a stirring solution of tert-butyl 5-cyclopropyl-2-methyl-1H-indole-1-carboxylate (543 mg, 2.00 mmol) in CH2Cl2 (5 mL) at rt was added trifluoroacetic acid (5.0 mL, 67.3 mmol). The resulting brown coloured mixture was left to stir at rt for 1 h. All volatiles were removed in vacuo, and the residue was partitioned between ethyl acetate (40 mL) and sat. aq. NaHCO3 (40 mL). The organic layer was dried over Na2SO4 and concentrated in vacuo to give 5-cyclopropyl-2-methyl-1H-indole (343 mg, 100%) as a brown oil. This material was progressed to the next step, and purification was performed subsequently. 1H NMR (300 MHz, CDCl3) δ ppm: 7.78 (s, 1H), 7.29 (dd, J=1.7, 0.8 Hz, 1H), 7.18 (dt, J=8.3, 0.9 Hz, 1H), 6.94 (dd, J=8.3, 1.7 Hz, 1H), 6.18 (dq, J=2.0, 1.0 Hz, 1H), 2.43 (d, J=1.0 Hz, 3H), 2.09-1.98 (m, 1H), 1.01-0.92 (m, 2H), 0.79-0.69 (m, 2H). (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-cyclopropyl-2-methyl-1H-indol-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 79) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.05 (s, 1H), 9.01 (s, 1H), 8.45 (dd, J=1.9 Hz, 1H), 7.43 (d, J=8.5 Hz, 1H), 7.33 (d, J=1.6 Hz, 1H), 7.06 (dd, J=8.5, 1.6 Hz, 1H), 5.13 (d, J=8.8 Hz, 2H), 4.86 (dt, J=36.0, 7.6, Hz, 1H), 3.62 (d, J=7.4 IHz, 2H), 2.90 (s, 6H), 2.59 (s, 3H), 2.07-1.96 (m, 1H), 1.00-0.91 (m, 2H), 0.70-0.61 (m, 2H). Example 46 The following compounds were prepared according to procedures AX, G, H, I, J, K, L and T. Procedure AX: Preparation of 3-fluoro-N,N-bis(4-methoxybenzyl)-4-nitrobenzenesulfonamide To a stirring solution of bis(4-methoxybenzyl)amine (1.07 g, 4.17 mmol) and triethylamine (1.28 mL, 9.18 mmol) in THF at 0° C. was added 3-fluoro-4-nitrobenzenesulfonyl chloride (1.00 g, 4.17 mmol) in one lot. The thick, bright yellow suspension was stirred at 0° C. for a further 30 min. The reaction mixture was concentrated in vacuo. To the residue was added aq. HCl (2 M, 10 mL) followed by water (100 mL). The resulting suspension was stirred at rt for 10 min, and the solid, thus formed, was filtered and washed with water. The solid was then dried in an oven at 60° C. for 2 h to afford 3-fluoro-N,N-bis(4-methoxybenzyl)-4-nitrobenzenesulfonamide (1.50 g, 78%) as a pale yellow solid. 1H NMR (300 MHz, CDCl3) 3 ppm: 8.09 (dd, J=8.6, 6.9 Hz, 1H), 7.63 (dt, J=8.5, 1.4 Hz, 1H), 7.56 (dd, J=9.9, 1.9 Hz, 1H), 7.06 (d, J=8.6 Hz, 4H), 6.82 (d, J=8.6 Hz, 4H), 4.34 (s, 4H), 3.81 (s, 6H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(pyridin-4-yl)-1H-indole-5-sulfonamide dihydrochloride (Compound 84) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.86 (d, J=7.0 Hz, 2H), 8.41-8.36 (m, 1H), 8.25 (d, J=7.0 Hz, 2H), 7.90 (dd, J=8.7, 1.7 Hz, 1H), 7.80 (d, J=8.7 Hz, 1H), 5.32 (d, J=11.4 Hz, 2H), 5.17 (dt, J=34.1, 7.4 Hz, 1H), 3.66 (d, J=7.6 Hz, 2H), 2.79 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(4-fluorophenyl)-2-methyl-1H-indole-5-sulfonamide hydrochloride (Compound 95) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.01 (s, 3H), 7.97 (d, J=1.8 Hz, 1H), 7.75 (d, J=8.7 Hz, 1H), 7.63 (dd, J=8.7, 1.8 Hz, 1H), 7.49 (dd, J=8.6, 5.7 IHz, 2H), 7.38 (dd, J=8.9 Hz, 2H), 7.16 (s, 2H), 5.25 (d, J=12.2 Hz, 2H), 5.05 (dt, J=35.9, 7.2 Hz, 1H), 3.47 (s, 2H), 3.34 (s, 3H). Example 47 The following compound was prepared according to procedures AY, E, F, G, H, I, J, K, AH, L and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-chloro-5-(methylsulfonyl)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 100) Procedure AY: Preparation of 2-methyl-5-(methylsulfonyl)-1H-indole To a stirring solution of 5-bromo-1H-indole (1.00 g, 5.10 mmol), sodium pyrrolidine-2-carboxylate (140 mg, 1.02 mmol) in DMSO (5 mL) under Ar was added cuprous iodide (97.2 mg, 0.51 mmol). The resulting mixture was heated at 100° C. for 22 h. The reaction mixture was cooled to rt and diluted with ethyl acetate (50 mL) and brine/water (1:1, 40 mL). After filtering the biphasic mixture through Celite™, the organic layer was separated, washed with water and brine; dried over MgSO4 and then concentrated in vacuo. The crude material was purified using a 40 g RediSep cartridge, eluting over a gradient of 10-80% ethyl acetate in hexane to afford the title compound 5-(methylsulfonyl)-1H-indole (483 mg, 49%) as a white solid. 1H NMR (300 MHz, CDCl3) δ ppm: 8.62 (s, 1H), 8.32 (dt, J=1.7, 0.7 Hz, 1H), 7.76 (dd, J=8.7, 1.8 Hz, 1H), 7.55 (dt, J=8.6, 0.8 Hz, 1H), 7.40 (dd, J=3.3, 2.4 Hz, 1H), 6.73 (ddd, J=3.1, 2.0, 1.0 Hz, 1H), 3.11 (s, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-chloro-5-(methylsulfonyl)-1H-indol-3-yl)-N,N-dimethyl-benzenesulfonamide hydrochloride (Compound 100) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.16 (d, J=1.7 Hz, 1H), 8.06-7.80 (m, 9H), 5.40 (d, J=13.7 Hz, 2H), 5.27 (dt, J=35.9, 7.3 Hz, 1H), 3.49 (s, 2H), 3.23 (s, 3H), 2.71 (s, 6H). Example 48 The following compound was prepared according to procedures E, F, J, K, L, AZ, AAA and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(methoxymethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 103) Procedure AZ: Preparation of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(hydroxymethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate Diisobutylaluminium hydride (1 M in CH2Cl2, 2.00 mL) was added to a solution of ethyl (Z)-1-(4-((tert-butoxycarbonyl)amino)-2-fluorobut-2-en-1-yl)-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxylate (400 mg, 0.70 mmol) in dichloromethane (5 mL) at 0° C. The ice bath was then removed and the mixture was allowed to stir at ambient temperature for 30 min. TLC analysis after this time showed approximately 40-50% conversion. Additional diisobutylaluminium hydride (1 M in CH2Cl2, 2.00 mL) was added at rt, and the reaction stirred for a further 30 min. TLC analysis after this time showed approximately 80-90% conversion. An additional, final amount, of diisobutylaluminium hydride (1 M in CH2Cl2, 1.00 mL) was added, and stirring was continued at rt for a further for 1 h. Methanol (2 mL) was added and then the reaction mixture was poured on a mixture of aq. NaOH solution (2 M, 20 mL) and dichloromethane (20 mL). The aqueous layer was extracted with dichloromethane (20 mL×2). The combined organics were washed with aq. NaOH (1 M, 25 mL), brine, dried over Na2SO4 and concentrated in vacuo to afford tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(hydroxymethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate (300 mg, 81%). This material was progressed to the next step without purification. Procedure AAA: Preparation of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(methoxymethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate Sodium hydride (15.0 mg, 0.31 mmol) was added in one lot to a solution of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(hydroxymethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate (133 mg, 0.25 mmol) in DMF (1.5 mL) under nitrogen at 0° C. The mixture was stirred for 10 min, and then iodomethane (19 uL, 0.31 mmol) was added in one lot. The mixture was stirred at ambient temperature for 1 h. The reaction mixture was diluted with water (20 mL) and the product was extracted with ethyl acetate (15 mL×3). The combined organics were washed with water, dried over Na2SO4 and concentrated under vacuum. The crude material was purified using combiflash to afford tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-(methoxymethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate (41.0 mg, 28%). 1H NMR (300 MHz, CDCl3) δ ppm: 8.16 (dt, J=1.8, 0.9 Hz, 1H), 7.99 (dt, J=7.6, 1.5 Hz, 1H), 7.72 (ddd, J=7.8, 1.9, 1.3 Hz, 1H), 7.65 (d, J=7.7 Hz, 1H), 7.63 (d, J=7.7 Hz, 1H), 7.32 (d, J=8.4 Hz, 1H), 4.83 (d, J=9.9 Hz, 2H), 4.77-4.52 (m, 4H), 3.80 (s, 2H), 3.48 (s, 3H), 2.83 (s, 6H), 2.61 (s, 3H), 1.42 (s, 9H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(methoxymethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 103) 1H NMR (300 MHz, Methanol-d4) δ 8.74 (d, J=8.4 Hz, 1H), 8.00-7.82 (m, 4H), 7.76 (d, J=8.5 Hz, 1H), 5.43 (d, J=13.2 Hz, 3H), 5.39 (dt, J=35.2, 7.3 Hz, 1H), 4.81 (s, 2H), 3.68 (d, J=7.3 Hz, 2H), 3.51 (s, 3H), 2.78 (s, 6H), 2.64 (s, 3H). Example 49 The following compound was prepared according to procedures E, F, AAB, AAC, J, K, L and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(isopropylsulfonyl)-2-methyl-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 106) Procedure AAB: Preparation of 5-(isopropylthio)-2-methyl-1H-indole A stirring solution of 5-bromo-2-methyl-1H-indole (1.05 g, 5.00 mmol), sodium 2-propanethiolate (589 mg, 6.00 mmol), sodium t-butoxide (961 mg, 10.0 mmol) and cyclopentyl(diphenyl)phosphane; iron (339 mg, 0.60 mmol) in 1,4-dioxane was degassed by passing through it a stream of N2 gas for 15 min. Diacetoxypalladium (112 mg, 0.50 mmol) was then added and the reaction mixture was heated at 90° C. overnight. After cooling to rt, the reaction mixture was diluted with ethyl acetate, and then filtered through Celite™. The filtrate washed with water and brine, dried over Na2SO4 and concentrated in vacuo. The crude material was adsorbed onto silica gel, and purification was performed using a 40 g Redisep cartridge eluting with a gradient of 0-20% ethyl acetate in hexane to afford crude 5-(isopropylthio)-2-methyl-1H-indole (1.09 g, 71%). This material was progressed to the next step without further purification. Procedure AAC: Preparation of tert-butyl 3-bromo-5-(isopropylsulfonyl)-2-methyl-1H-indole-1-carboxylate To a stirred solution of 5-(isopropylthio)-2-methyl-1H-indole (300 mg, 0.39 mmol) in THF:MeOH (3 mL: 3 mL) at 0° C. was added a solution of Oxone™ (0.96 g, 1.56 mmol) in water (5 mL). The resulting mixture stirred at 0° C. for 1 h, then at rt for 2 h. The reaction mixture was poured into a mixture of water (20 mL) and ethyl acetate (30 mL). The organic layer was washed with brine, dried over MgSO4, and concentrated in vacuo. Purification was performed using a 12 g RediSep cartridge, eluting over a gradient of 0-30% ethyl acetate in hexane to afford the title compound, tert-butyl 3-bromo-5-(isopropylsulfonyl)-2-methyl-1H-indole-1-carboxylate (68.0 mg, 42%) as a white solid. 1H NMR (300 MHz, CDCl3) δ ppm: 8.31 (dd, J=8.8, 0.6 Hz, 1H), 8.03 (dd, J=1.9, 0.6 Hz, 1H), 7.80 (dd, J=8.8, 1.9 Hz, 1H), 3.25 (p, J=6.9 Hz, 1H), 2.69 (s, 3H), 1.72 (s, 9H), 1.32 (d, J=6.9 Hz, 6H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(isopropylsulfonyl)-2-methyl-1H-indol-3-yl)-N,N-dimethyl-benzenesulfonamide hydrochloride (Compound 106) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.07 (dd, J=1.7, 0.6 Hz, 1H), 7.89-7.85 (m, 1H), 7.81 (t, J=1.3 Hz, 3H), 7.77 (d, J=8.7 Hz, 1H), 7.71 (dd, J=8.7, 1.7 Hz, 1H), 5.25 (d, J=9.9 Hz, 2H), 4.98 (dt, J=34.1, 7.5 Hz, 1H), 3.65 (dd, J=7.3, 1.5 Hz, 2H), 3.33-3.26 (m, 1H), 2.80 (s, 6H), 2.62 (s, 3H), 1.25 (d, J=6.8 Hz, 6H). Example 50 The following compound was prepared according to procedures E, F, J, K, L, AAD, AAE and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(methylsulfonamido)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 104) Procedure AAD: Preparation of tert-butyl (Z)-(4-(5-amino-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate To a vigorously stirring suspension of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-5-nitro-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (270 mg, 0.49 mmol) and zinc (powder) (484 mg, 7.41 mmol) in THF (3 mL) at rt was added methanol (3 mL) followed by ammonium chloride (396 mg, 7.41 mmol). The resulting mixture was left to stir at rt for 2 h. The reaction mixture was diluted with ethyl acetate (20 mL) and then filtered through a pad of Celite™ to remove inorganics. The filtrate was concentrated in vacuo to give tert-butyl (Z)-(4-(5-amino-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (255 mg, 100%) as a red colored oil. This material was progressed to the next step and purification was performed subsequently. Procedure AAE: Preparation of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-5-(methylsulfonamido)-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate To a stirring solution of tert-butyl (Z)-(4-(5-amino-3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (255 mg, 0.49 mmol) in CH2Cl2 (4 mL) at 0° C. was added pyridine (0.06 mL, 0.74 mmol) followed by methanesulfonyl chloride (0.04 mL, 0.54 mmol). The resulting solution was warmed to rt, and stirring was continued for 2 h. The reaction mixture was partitioned between aq. HCl (1 M; 30 mL) and CH2Cl2 (30 mL). The organic layer was washed with sat. aq. NaCl (20 mL), dried over Na2SO4, and then concentrated in vacuo to give a red/brown oil. The crude material was purified over silica gel eluting with 60% ethyl acetate in hexane to afford tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-2-methyl-5-(methylsulfonamido)-1H-indol-1-yl)-3-fluorobut-2-en-1-yl)carbamate (150 mg, 51%) as an orange solid. 1H NMR (300 MHz, CDCl3) δ ppm: 7.87 (ddd, J=1.8, 0.9 Hz, 1H), 7.74 (ddd, J=7.3, 1.8, 1.8 Hz, 1H), 7.69 (ddd, J=7.4, 1.7, 1.7 Hz, 1H), 7.66 (d, J=7.7 Hz, 1H), 7.53 (d, J=2.1 Hz, 1H), 7.31 (d, J=8.7 Hz, 1H), 7.14 (dd, J=8.6, 2.1 Hz, 1H), 6.76 (s, 1H), 4.82 (d, J=10.2 Hz, 2H), 4.64 (s, 1H), 3.81 (s, 2H), 2.95 (s, 3H), 2.80 (s, 6H), 2.50 (s, 31-), 1.42 (s, 9H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(methylsulfonamido)-1H-indol-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 104) 1H NMR (300 MHz, Methanol-d4) δ ppm: 7.85 (s, 1H), 7.81-7.73 (m, 3H), 7.52 (d, J=2.1 Hz, 1H), 7.50 (d, J=8.8 Hz, 1H), 7.16 (dd, J=8.7, 2.1 Hz, 1H), 5.13 (d, J=8.7 Hz, 2H), 4.91 (dt, J=35.4, 7.6 Hz, 1H), 3.63 (d, J=7.5 Hz, 2H), 2.89 (s, 3H), 2.79 (s, 6H), 2.55 (s, 3H). Example 51 The following compound was prepared according to procedures J, K, L, AAB, AAC and O. (Z)—N-(1-(4-amino-2-fluorobut-2-en-1-yl)-3-(2,6-dimethylpyridin-4-yl)-2-methyl-1H-indol-5-yl)methanesulfonamide dihydrochloride (Compound 102) 1H NMR (300 MHz, DMSO-d6) δ ppm: 9.53 (s, 1H), 8.16 (s, 3H), 7.75 (s, 2H), 7.72-7.63 (m, 2H), 7.19 (dd, J=8.7, 2.0 Hz, 1H), 5.33-5.11 (m, 3H), 2.92 (s, 3H), 2.76 (s, 6H), 2.65 (s, 3H). Example 52 The following compound was prepared according to procedures AD, AE, AAF, Q, J, K, L, and O. (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(trifluoromethoxy)-1H-indol-3-yl)-N,N-dimethyl-pyridine-3-sulfonamide dihydrochloride (Compound 85) Procedure AAF: Preparation of 2-methyl-5-(trifluoromethoxy)-1H-indole To a stirring suspension of 4-(trifluoromethoxy)phenylhydrazine hydrochloride (1.00 g, 4.37 mmol) in tert-butanol (20 mL) at rt was added (phenylthio)propanone (727 mg, 4.37 mmol). The resulting mixture was heated at reflux for 1 h. After cooling to rt, the reaction mixture was diluted with water (70 mL) and then transferred to a separatory funnel. The aqueous layer was extracted with ethyl acetate (50 mL×2), and the combined organics were washed with sat. aq. NaCl (50 mL); dried over Na2SO4 and concentrated in vacuo to give a dark red residue. To this residue was taken up in trifluoroacetic acid (20 mL), and to this was added 2-sulfanylbenzoic acid (1.35 g, 8.75 mmol) followed by (phenylthio)propanone (727 mg, 4.37 mmol). The resulting mixture was left to stir at rt for 30 h. The reaction mixture was then poured into water (100 mL) and then transferred en masse to a seperatory funnel. The aqueous mixture was extracted with ethyl acetate (50 mL×2), and the combined organics were washed with aqueous NaOH (1 M, 70 mL) and sat. aq. NaCl (50 mL); dried over Na2SO4 and concentrated in vacuo to give a dark red residue. The crude material was purified over silica gel eluting with 10% ethyl acetate in hexane to give only crude 2-methyl-5-(trifluoromethoxy)-1H-indole. This material was progressed to the next step, and purification was performed subsequently. (Z)-5-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-5-(trifluoromethoxy)-1H-indo-3-yl)-N,N-dimethylpyridine-3-sulfonamide dihydrochloride (Compound 85) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.08 (d, J=6.3 Hz, 2H), 8.51 (dd, J=2.0 Hz, 1H), 7.66 (d, J=8.9 Hz, 1H), 7.50 (d, J=2.2 Hz, 1H), 7.22 (d, J=8.8 Hz, 1H), 5.22 (d, J=9.9 Hz, 2H), 5.01 (dt, J=34.1, 7.4 Hz, 1H), 3.65 (d, J=7.4 Hz, 2H), 2.90 (s, 6H), 2.63 (s, 3H). Example 53 The following compound was prepared according to procedures P, AAG, AAH, Q, J, AAI, K, L, and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(1,1-difluoroethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 111) Procedure AAG: Preparation of 2-methyl-3-(methylthio)-1H-indole-5-carbonitrile A stirring mixture of 5-chloro-2-methyl-3-(methylthio)-1H-indole (1.00 g, 4.70 mmol), Zn(CN)2 (0.84 g, 7.10 mmol), Pd(PPh3)4 (543 mg, 0.47 mmol) and NMP (10 mL) was heated at 100° C. for 1 h under MW. The reaction mixture was diluted with water, extracted with ethyl acetate (50 ml×3), washed with brine, dried over Na2SO4 and concentrated in vacuo to afford 2-methyl-3-(methylthio)-1H-indole-5-carbonitrile (0.70 g), which was used directly in next step without further purification. Procedure AAH: Preparation of 1-(2-methyl-3-(methylthio)-1H-indol-5-yl)ethan-1-one To a stirring solution of 2-methyl-3-(methylthio)-1H-indole-5-carbonitrile (2.8 g, 13.8 mmol) in dry THF (50 mL) under nitrogen was added methylmagnesium bromide (3 M in diethylether, 13.8 mL, 41.4 mmol) drop-wise at 0° C. The resulting mixture was stirred at rt overnight. The reaction mixture was poured into aqueous NH4Cl, and stirring was continued for 30 min. The aqueous phase was extracted with ethyl acetate (100 mL×3), and the combined organic phases were dried over Na2SO4, concentrated in vacuo. The crude material was purified over silica gel ethyl acetate/hexane (5:1) to afford 1-(2-methyl-3-(methylthio)-1H-indol-5-yl)ethan-1-one (2.10 g, 69%) as a white solid. 1H-NMR (300 MHz, CDCl3): δ ppm: 8.92 (s, 1H), 7.94-7.91 (m, 1H), 7.59-7.57 (m, 1H), 2.85 (s, 3H), 2.58 (s, 3H), 2.50 (s, 3H). Procedure AAI: Preparation of tert-butyl 3-bromo-5-(1,1-difluoroethyl)-2-methyl-1H-indole-1-carboxylate To tert-butyl 5-acetyl-3-bromo-2-methyl-1H-indole-1-carboxylate (1.30 g, 3.68 mmol) was added neat DAST (30 mL) and the mixture were heated at 50° C. overnight. After cooling to rt, the reaction mixture was quenched with cold sat.NaHCO3, and the pH was adjusted to >8. The aqueous mixture was extracted with dichloromethane (50 mL×2), and the combined organics were dried over Na2SO4, and evaporated in vacuo. The crude material was purified over silica gel eluting with ethyl acetate/hexane (20:1) followed by ethyl acetate/hexane (10:1) to afford tert-butyl 3-bromo-5-(1,1-difluoroethyl)-2-methyl-1H-indole-1-carboxylate (0.90 g, 65% yield) as an off-white solid. 1H-NMR (300 MHz, CDCl3): δ ppm: 8.42-8.39 (m, 1H), 7.62-7.59 (m, 1H), 2.73 (s, 3H), 2.19-2.06 (m, 3H), 1.70 (s, 9H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(1,1-difluoroethyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 111) 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.25 (dd, J=1.8 Hz, 1H), 8.23 (s, 3H), 8.20 (d, J=8.6 Hz, 1H), 8.00 (dt, J=7.8, 1.5 Hz, 1H), 7.77 (dd, J=7.7 Hz, 1H), 7.68 (dt, J=7.9, 1.4 Hz, 1H), 7.55 (d, J=8.6 Hz, 1H), 5.32 (d, J=12.7 Hz, 2H), 5.14 (dt, J=36.1, 7.2 Hz, 1H), 3.45 (t, J=6.4 Hz, 2H), 2.70 (s, 6H), 2.69 (s, 3H), 2.04 (t, J=18.8 Hz, 3H). Example 54 The following compound was prepared according to procedures AAJ, AAK, AAL, AAM, AAN and AAO. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-hydroxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide hydrochloride (Compound 60) Procedure AAJ: Preparation of di-tert-butyl 1-(6-methoxypyridin-3-yl)hydrazine-1,2-dicarboxylate To a stirring solution of 5-bromo-2-methoxy-pyridine (564 mg, 3.00 mmol) in THF (4 mL) at −40° C. under nitrogen was added n-butyllithium (2.06 mL, 3.30 mmol) dropwise. The resulting mixture was stirred for 10 mins at this temperature before addition of a solution of tert-butyl (NE)-N-tert-butoxycarbonyliminocarbamate (760 mg, 3.30 mmol) in THF (4 mL) dropwise. The reaction mixture was then allowed to warm slowly to rt and then poured onto ice water. The product was extracted with ethyl acetate (20 mL×2). The combined organic layers were washed with brine, dried over Na2SO4 and concentrated in vacuo. Purification was performed using a 40 g RediSep cartridge, eluting over a gradient of 10-30% ethyl acetate in hexane to afford the title compound di-tert-butyl 1-(6-methoxypyridin-3-yl)hydrazine-1,2-dicarboxylate (490 mg, 43%) as a yellow oil. 1H NMR (300 MHz, DMSO-d6) δ ppm: 9.65 (s, 1H), 8.09 (d, J=2.7 Hz, 1H), 7.62 (d, J=8.9 Hz, 1H), 6.81 (dd, J=8.9, 0.7 Hz, 1H), 3.84 (d, J=2.2 Hz, 3H), 1.41 (s, 18H). Procedure AAK: Preparation of 3-(2-hydroxypropyl)-N,N-dimethylbenzenesulfonamide To a stirring solution of 3-bromo-N,N-dimethylbenzenesulfonamide (500 mg, 1.89 mmol) in THF (9 mL), at −78° C. was added n-butyllithium (1.04 mL, 2.08 mmol) dropwise. The mixture was stirred at this temperature for 15 mins. 2-Methyloxirane (332 uL, 4.73 mmol) was added, followed by boron trifluoride diethyl etherate (234 uL, 1.89 mmol). The resulting mixture was stirred at −78° C. for a further 20 mins and then warmed slowly to rt. Saturated aqueous NH4Cl (20 mL) was added and the mixture was stirred at rt for 5 mins. The product was extracted with ethyl acetate and the organic layer was dried over Na2SO4 and concentrated in vacuo. The crude material was purified by reverse-phase chromatography using a 40 g C18 column, eluting with 40-60% acetonitrile/water over 30 mins to afford crude 3-(2-hydroxypropyl)-N,N-dimethylbenzenesulfonamide (200 mg, 29%) as a yellow oil. This material was progressed to the next step without further purification. Procedure AAL: Preparation of N,N-dimethyl-3-(2-oxopropyl)benzenesulfonamide To a stirring solution of 3-(2-hydroxypropyl)-N,N-dimethyl-benzenesulfonamide (967 mg, 3.97 mmol) in dichloromethane (40 mL) under nitrogen at 0° C. was added Dess-Martin periodinane (2.02 g, 4.77 mmol) in three portions. The resulting mixture was stirred at this temperature for 1.5 h. The reaction mixture was poured into a mixture of 10% sat. aq. sodium thiosulphate (60 mL) and sat. aq. sodium bicarbonate (1:1) and the mixture was stirred for 5 mins at rt. The product was extracted with dichloromethane, and combined organics were dried over Na2SO4, and concentrated in vacuo to give N,N-dimethyl-3-(2-oxopropyl)benzenesulfonamide (790 mg, 82%) as a white solid. This material was progressed to the next step without further purification. 1H NMR (300 MHz, CDCl3) δ ppm: 7.71 (dt, J=7.7, 1.6 Hz, 1H), 7.63 (dt, J=1.9, 0.9 Hz, 1H), 7.53 (dd, J=7.7 Hz, 1H), 7.44 (d, J=8.2 Hz, 1H), 3.84 (s, 2H), 2.74 (s, 6H), 2.25 (s, 3H). Procedure AAM: Preparation of 3-(5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide A stirring suspension of di-tert-butyl 1-(6-methoxypyridin-3-yl)hydrazine-1,2-dicarboxylate (307 mg, 0.90 mmol) and N,N-dimethyl-3-(2-oxopropyl)benzenesulfonamide (240 mg, 1.00 mmol) in 4% aqueous sulfuric acid (2 mL) was heated at a gentle reflux for 3 h. The reaction mixture was cooled to rt, and water (15 mL) and aq. HCl (1 M, 10 mL) were added. All unreacted ketone was extracted with diethyl ether (25 mL×3) and set aside. The aqueous layer was then neutralized by the addition of sat. aq. NaHCO3. The desired product was extracted with ethyl acetate (25 mL×2) and the combined organics were washed with water and brine. After drying over Na2SO4, the solvent was removed in vacuo to afford 3-(5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide (173 mg, 50%) as an orange oil. 1H NMR (300 MHz, CDCl3) δ ppm: 8.43 (dt, J=1.9, 0.9 Hz, 1H), 8.23 (s, 1H), 8.06 (dt, J=7.4, 1.6 Hz, 1H), 7.67 (dt, J=7.8, 1.6 Hz, 1H), 7.62 (dd, J=7.5, 0.6 Hz, 1H), 7.53 (d, J=8.7 Hz, 1H), 6.60 (d, J=8.7 Hz, 1H), 3.99 (s, 3H), 2.80 (s, 6H), 2.63 (s, 3H). Procedure AAN: Preparation of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate To a stirring solution of 3-(5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide (50 mg, 0.14 mmol) and tert-butyl (Z)-(4-bromo-3-fluorobut-2-en-1-yl)carbamate (58.2 mg, 0.22 mmol) in DMSO (2.0 mL) at rt was added potassium hydroxide (16.2 mg, 0.23 mmol). The resulting mixture was stirred at rt for 2 h. HPLC analysis after this time showed approximately 50% conversion. A further amount of tert-butyl N—[(Z)-4-bromo-3-fluoro-but-2-enyl]carbamate (58.2 mg, 0.22 mmol) and potassium hydroxide (16.2 mg, 0.23 mmol) was added and stirring was continued for a further 1 h. The reaction mixture was poured onto a mixture of brine and water, and the product was extracted with ethyl acetate (30 mL). The organic layer was washed with further water and brine, dried over Na2SO4 and concentrated in vacuo. Purification was performed using a 12 g C-18 column, eluting over a gradient of 20-70% MeCN in water (+0.1% HCl) to afford tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate (55 mg, 71%) as a brown foam. 1H NMR (300 MHz, CDCl3) δ ppm: 8.30 (dt, J=1.8, 0.6 Hz, 1H), 7.98 (dt, J=7.5, 1.6 Hz, 1H), 7.70 (dt, J=7.9, 1.4 Hz, 1H), 7.64 (ddd, J=7.6, 7.6, 0.5 Hz, 1H), 7.54 (d, J=8.8 Hz, 1H), 6.65 (d, J=8.8 Hz, 1H), 4.80 (d, J=9.2 Hz, 3H), 4.66-4.83 (m, 1H), 4.57 (s, 1H), 3.97 (s, 3H), 3.81 (s, 2H), 2.80 (s, 6H), 2.60 (s, 3H), 1.43 (s, 9H). Procedure AAO: Preparation of (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 60) To a stirring solution of tert-butyl (Z)-(4-(3-(3-(N,N-dimethylsulfamoyl)phenyl)-5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-yl)carbamate (55.0 mg, 0.10 mmol) in dichloromethane (4 mL) under nitrogen at −10 OC (ice-salt bath) was added boron tribromide (39 uL, 0.41 mmol). The resulting mixture was stirred at 0° C. for 1 h and then rt overnight. The reaction mixture was then poured onto ice in sat. NaHCO3 (20 mL). The product was extracted with dichloromethane (30 mL), and the organic layer was washed with brine, dried over Na2SO4, and concentrated in vacuo. Purification was performed using a 12 g C-18 column, eluting over a gradient of 30-65% MeCN in water (+0.1% HCl) to afford the title compound (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (3.9 mg, 9%) as a yellow film. 1H NMR (300 MHz, DMSO-d6) δ ppm: 8.19-8.03 (m, 5H), 7.88-7.79 (m, 1H), 7.78-7.67 (m, 2H), 6.58 (d, J=9.0 Hz, 1H), 5.20 (d, J=13.3 Hz, 2H), 5.05-5.26 (m, 1H), 3.53-3.41 (m, 1H), 2.68 (s, 6H), 2.44 (s, 3H). Example 55 The following compounds were prepared according to procedures AAJ, AAK, AAL, AAM, AAN and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-methoxy-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 61) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.45 (d, J=9.0 Hz, 1H), 7.99 (s, 1H), 7.89-7.83 (m, 2H), 7.79 (dd, J=9.0, 6.0 Hz, 1H), 7.09 (d, J=8.9 Hz, 1H), 5.29 (d, J=12.0 Hz, 2H), 5.19 (dt, J=34.2, 7.4 Hz, 1H), 4.13 (s, 3H), 3.67 (d, J=7.2 Hz, 2H), 2.77 (s, 6H), 2.60 (s, 3H). (Z)-3-fluoro-4-(5-methoxy-2-methyl-3-(3-(methylthio)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1-amine dihydrochloride (Compound 68) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.73 (d, J=9.1 Hz, 1H), 7.50 (ddd, J=8.0, 7.4, 0.5 Hz, 1H), 7.39 (ddd, J=7.9, 1.9, 1.1 Hz, 1H), 7.34 (dq, J=2.3, 1.2 Hz, 1H), 7.25 (d, J=9.2 Hz, 1H), 7.23 (ddd, J=8.1, 1.6, 1.2 Hz, 1H), 7.21 (dd, J=1.6, 1.2 Hz, 1H), 5.39-5.32 (m, 2H), 5.35 (dt, J=34.9, 7.4 Hz, 1H), 4.22 (s, 3H), 3.73-3.64 (m, 2H), 3.36 (s, 3H), 2.58 (s, 3H). (Z)-3-fluoro-4-(5-methoxy-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1-amine dihydrochloride (Compound 69) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.68 (d, J=9.0 Hz, 1H), 8.14-8.04 (m, 2H), 7.90-7.80 (m, 2H), 7.25 (d, J=9.0 Hz, 1H), 5.36 (d, J=12.5 Hz, 2H), 5.31 (dt, J=35.4, 7.5 Hz, 1H), 4.21 (s, 3H), 3.72-3.64 (m, 2H), 3.23 (s, 3H), 2.59 (s, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-5-(dimethylamino)-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 105) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.34 (d, J=9.4 Hz, 1H), 7.92-7.78 (m, 4H), 6.96 (d, J=9.4 Hz, 1H), 5.27 (dt, J=35.2, 7.4 Hz, 1H), 3.68 (d, J=7.0 Hz, 2H), 3.32 (s, 6H), 2.78 (s, 6H), 2.54 (s, 3H). Example 56 The following compound was prepared according to procedures E, F, AAP, AAQ, J, K, L, and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2,5-dimethyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 107) Procedure AAP: Preparation of N-(2,6-dimethylpyridin-3-yl)acetamide To a stirring solution of 2,6-dimethylpyridin-3-amine (25.0 g, 205 mmol) in dichloromethane (200 mL) was added Ac2O (27.0 mL, 258 mmol) followed by triethylamine (35.1 mL, 226 mmol) and the mixture was stirred at rt for 2 h. The reaction mixture was then concentrated in vacuo. To the residue was added aqueous sodium carbonate, and the aqueous mixture was then extracted with dichloromethane (200 mL×6), dried over Na2SO4 and concentrated in vacuo to afford N-(2,6-dimethylpyridin-3-yl)acetamide (20.0 g, 60% yield), which was used directly in next step without further purification. Procedure AAQ: Preparation of 2,5-dimethyl-1H-pyrrolo[3,2-b]pyridine A stirring mixture of neat N-(2,6-dimethylpyridin-3-yl)acetamide (2.5 g, 15 mmol) and sodium ethoxide (2.50 g, 37.0 mmol) was heated to 320° C. under N2 for 15 min. After cooling to rt, water (20 mL) was added, and the aqueous mixture was extracted with dichloromethane (25 mL×6), dried over Na2SO4 and concentrated in vacuo. A total of 15 batches of crude material were purified over silica gel eluting with ethyl acetate/hexane (1:5) followed by ethyl acetate (1:2) to afford 2,5-dimethyl-1H-pyrrolo[3,2-b]pyridine (10.0 g, 30% yield) as white solid. 1H-NMR (300 MHz, CDCl3): δ ppm: 9.24 (bs, 1H), 7.44-7.42 (m, 1H), 6.89-6.86 (m, 1H), 6.32 (s, 1H), 2.62 (s, 3H), 2.44 (s, 3H). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2,5-dimethyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 107) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.66 (d, J=8.4 Hz, 1H), 7.99-7.93 (m, 1H), 7.93-7.83 (m, 3H), 7.58 (d, J=8.4 Hz, 1H), 5.38 (dt, J=35.3, 7.3 Hz, 1H), 3.68 (d, J=7.2 Hz, 2H), 2.81 (s, 3H), 2.78 (s, 6H), 2.62 (s, 3H). Example 57 The following compound was prepared according to procedures E, F, AAR, AAS, AAT, J, K, L, and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 25) Procedure AAR: Preparation of ethyl (2-chloropyridin-3-yl)carbamate To a stirring solution of 2-chloropyridin-3-amine (5.00 g, 39.0 mmol) in 1,4-dioxane (50 mL) at 10° C. was added an aqueous solution of sodium hydroxide (1 M, 78.0 mL, 78.0 mmol). To this reaction mixture was added ethyl chloroformate (6.50 mL, 67.5 mmol), and the reaction was warmed to rt. Stirring was continued overnight. The reaction mixture was diluted in water (100 mL), extracted with ethyl acetate (100 mL×3), washed with brine (50 mL), dried over Na2SO4, filtered and concentrated in vacuo to afford a yellow oil. The crude material was purified over silica gel eluting with ethyl acetate in hexane (1:10) to afford ethyl (2-chloropyridin-3-yl)carbamate (4.42 g, 71%) as a white solid. Procedure AAS: Preparation of ethyl (2-(prop-1-yn-1-yl)pyridin-3-yl)carbamate To a stirring suspension of lithium chloride (2.04 g, 48.30 mmol) in 1,4-dioxane (100 mL) was added ethyl (2-chloropyridin-3-yl)carbamate (3.96 g, 19.7 mmol), tributyl(prop-1-ynyl)stannane (19.7 mL, 19.7 mmol) and PdCl2(dppf) (288 mg, 0.40 mmol). The mixture was the heated at reflux overnight. After cooling to rt, the reaction mixture was diluted with water, extracted with ethyl acetate (100 mL×3), washed with sat. aq. NaHCO3 (50 mL×3), followed by brine (50 mL×3), dried over Na2SO4, filtered and concentrated in vacuo. Purification over silica gel, eluting with 10-60% ethyl acetate in hexane afforded ethyl (2-(prop-1-yn-1-yl)pyridin-3-yl)carbamate (2.52 g, 63%) as a brown oil. Procedure AAT: Preparation of 2-methyl-1H-pyrrolo[3,2-b]pyridine To a stirring solution of ethyl (2-(prop-1-yn-1-yl)pyridin-3-yl)carbamate (2.40 g, 11.76 mmol) in absolute ethanol (5 mL) was added solid sodium hydroxide (2.40 g, 35.3 mmol). The reaction was then heated at 80° C. for 1.5 h. The reaction mixture was cooled, diluted with water, extracted with dichloromethane (50 mL×3), dried over Na2SO4, filtered and concentrated in vacuo. The crude material was purified over silica gel, eluting with dichloromethane/MeOH=20/1) to afford of 2-methyl-1H-pyrrolo[3,2-b]pyridine (1.09 g, 70%) as a brown solid. Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-3-yl)-N,N-dimethyl-benzenesulfonamide dihydrochloride (Compound 25) 1H NMR (300 MHz, Methanol-d4) δ ppm 8.22 (d, J=1.6 Hz, 1H), 7.90 (dd, J=8.7, 1.7 Hz, 1H), 7.53 (d, J=8.7 Hz, 1H), 7.48 (dd, J=8.8, 5.4 Hz, 2H), 7.26 (dd, J=8.8 Hz, 2H), 5.20-5.09 (m, 2H), 4.85 (dt, J=34.1, 7.5 Hz, 1H), 4.36 (q, J=7.1 Hz, 2H), 3.67-3.57 (m, 2H), 2.52 (s, 3H), 1.39 (t, J=7.1 Hz, 3H). Example 58 The following compound was prepared according to procedures E, F, AAR, AAU, AAT, J, K, L, and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-pyrrolo[3,2-c]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 26) Procedure AAU: Preparation of ethyl (3-(prop-1-yn-1-yl)pyridin-4-yl)carbamate To a stirring solution of ethyl (3-iodopyridin-4-yl)carbamate (7.98 g, 24.9 mmol), propyne in hexanes (3%, 150 g, 112.5 mmol), triethylamine (60 mL, 430 mmol), PdCl2(PPh3)2 (877 mg, 1.25 mmol), in DMF (15 mL), in a sealable tube was added CuI (472 mg, 2.49 mmol). The tube was sealed and stirred at room temperature overnight. Ethyl acetate (200 mL) and sat. aq. NH4Cl (100 mL) were added, the phases were separated and the aqueous layer was extracted with ethyl acetate (100 mL×3). The combined organic layers were dried over Na2SO4, filtered, and concentrated in vacuo. The residue was purified over silica gel eluting with ethyl acetate/hexane (1:10) to afford ethyl (3-(prop-1-yn-1-yl)pyridin-4-yl)carbamate (3.01 g, 59%) as a brown solid. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-pyrrolo[3,2-c]pyridin-3-yl)-N,N-dimethyl-benzenesulfonamide dihydrochloride (Compound 26) 1H NMR (300 MHz, DMSO-d6) δ ppm: 9.07 (s, 1H), 8.60 (d, J=6.7 Hz, 1H), 8.30 (d, J=6.7 Hz, 1H), 8.15 (s, 3H), 8.00-7.93 (m, 1H), 7.91-7.79 (m, 3H), 5.51 (d, J=15.4 Hz, 2H), 5.39 (dt, J=36.0, 7.4 Hz, 1H), 3.55-3.44 (m, 2H), 2.71 (s, 6H), 2.64 (s, 3H). Example 59 The following compound was prepared according to procedures E, F, AAV, AAW, AAX, AAR, AAU, AAT, J, K, L, and O. (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-pyrrolo[2,3-c]pyridin-3-yl)-N,N-dimethylbenzenesulfonamide dihydrochloride (Compound 32) Procedure AAV: Preparation of N-(pyridin-3-yl)pivalamide To a stirring solution of pyridin-3-amine (20.0 g, 212 mmol) in THF (100 mL) at was added, slowly, a solution of pivaloyl chloride (26.0 mL, 212 mmol) in THF (50 mL), followed by Et3N (44.0 mL, 319 mmol). The resulting mixture was left to stir at 0° C. for 1 h. The reaction mixture was filtered, and the filtrate was evaporated in vacuo to yield the title N-(pyridin-3-yl)pivalamide (32.0 g, 85%) as white solid. Procedure AAW: Preparation of N-(4-iodopyridin-3-yl)pivalamide A stirring solution of N-(pyridin-3-yl)pivalamide (20 g, 112 mmol) in THF/Et2O (200 mL: 500 mL) was cooled to −78° C. TMEDA (42.0 mL, 280 mmol) and t-butyl lithium (1.6 M in hexane, 176 mL, 280 mmol) were then added dropwise. The mixture was stirred for 15 minutes and then warmed to −10 OC. Stirring was continued at this temperature for a further 2 h. The reaction mixture was again cooled to −78° C., and a solution of iodine (71.2 g, 280 mmol) in THF (200 mL) was added dropwise. The resulting slurry was stirred at −78° C. for 2 h. The mixture was warmed to 0° C., and was quenched with saturated aqueous sodium thiosulfate solution (1 L). The phases were separated and the aqueous phase was extracted with dichloromethane (500 mL×3). The combined organic phase was dried over Na2SO4 and concentrated in vacuo. The crude material was purified over silica gel, eluting with ethyl acetate/hexane (1:10) to afford N-(4-iodopyridin-3-yl)pivalamide (13.1 g, 38%) as a yellow solid. Procedure AAX: Preparation of 4-iodopyridin-3-amine A stirring mixture of N-(4-iodopyridin-3-yl)pivalamide (13.1 g, 44.0 mmol) and 24% w/w sulfuric acid in water (400 mL) was heated to 100° C. for 4 hours. The mixture was allowed to cool to rt, and then carefully adjusted to pH 7-8 with 4 N NaOH. Saturated sodium bicarbonate was added to the mixture and the product extracted into dichloromethane (200 mL×3). The organic layers were combined, dried over Na2SO4 and concentrated to give 4-iodopyridin-3-amine (8.80 g, 92%). (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-1H-pyrrolo[2,3-c]pyridin-3-yl)-N,N-dimethyl-benzenesulfonamide dihydrochloride (Compound 32) 1H NMR (300 MHz, Methanol-d4) δ ppm: 9.37 (s, 1H), 8.34 (d, J=6.4 Hz, 1H), 8.02 (d, J=6.4 Hz, 1H), 7.96-7.82 (m, 4H), 5.50 (d, J=13.6 Hz, 2H), 5.39 (dt, J=35.4, 7.3 Hz, 1H), 3.69 (d, J=7.3 Hz, 2H), 2.79 (s, 6H), 2.76 (s, 3H). Example 60 The following compound was prepared according to procedures AAY, F, G, H, I, J, K, L, M and U. (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(dimethylcarbamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 16) Procedure AAY: Preparation of 3-bromo-N,N-dimethylbenzamide To a stirring mixture of dimethylamine hydrochloride (612 mg, 7.50 mmol) in DMF (10 mL) at rt was added and triethylamine (3.48 mL, 25.0 mmol). After Stirring for 10 mins, 3-bromobenzoic acid (1.00 g, 5.00 mmol) was added, followed by HATU (2.28 g, 6.00 mmol). The resulting mixture was stirred at rt for 2 h. The reaction mixture was poured onto water (100 mL), and the resulting slurry was stirred for 5 mins. The aqueous mixture was extracted with ethyl acetate (60 mL). The organics were then washed with aq. HCl (1 M, 30 mL), sat. aq. NH4Cl (30 mL), and brine (30 mL), dried over MgSO4, and then concentrated in vacuo to afford the title compound 3-bromo-N,N-dimethylbenzamide (960 mg, 84%) as an orange oil. 1H NMR (300 MHz, CDCl3) δ ppm: 7.36 (ddd, J=7.6, 1.4 Hz, 1H), 7.53-7.59 (m, 2H), 7.30 (ddd, J=7.6, 7.6, 0.7 Hz, 1H), 3.12 (s, 3H), 3.00 (s, 3H). (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(dimethylcarbamoyl)phenyl)-2-methyl-1H-indole-5-carboxylic acid hydrochloride (Compound 16) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.29 (d, J=1.6 Hz, 1H), 7.92 (dd, J=8.6, 1.6 Hz, 1H), 7.67-7.57 (m, 2H), 7.57-7.49 (m, 2H), 7.44 (ddd, J=6.5, 2.4, 1.7 Hz, 1H), 5.16 (d, J=8.6 Hz, 2H), 4.84 (dt, J=35.4, 7.5 Hz, 1H), 3.63 (dd, J=7.7, 1.5 Hz, 2H), 3.15 (d, J=5.4 Hz, 6H), 2.56 (s, 3H). Example 61 The following compound was prepared according to procedures AAY, F, G, H, I, J, K, L, and O. (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(dimethylcarbamoyl)phenyl)-2-methyl-1H-indole-5-carboxylate hydrochloride (Compound 15) 1H NMR (300 MHz, Methanol-d4) δ ppm: 8.26 (dd, J=1.6, 0.6 Hz, 1H), 7.92 (dd, J=8.7, 1.6 Hz, 1H), 7.67-7.48 (m, 4H), 7.45 (dt, J=7.0, 1.8 Hz, 1H), 5.22-5.12 (m, 2H), 4.87 (dt, J=35.2, 7.5 Hz, 1H), 4.36 (q, J=7.1 Hz, 2H), 3.68-3.58 (m, 2H), 3.15 (d, J=3.9 Hz, 6H), 2.56 (s, 3H), 1.39 (t, J=7.1 Hz, 3H). Example 62 The following compounds were made according to procedures AAZ, AAAA, F, K, L and O. Procedure AAZ: Preparation of 6-methyl-2-(prop-1-yn-1-yl)pyridin-3-amine Into a 500 mL 3-necked round-bottom flask purged and maintained with an inert atmosphere of nitrogen, was placed 2-bromo-6-methylpyridin-3-amine (25.0 g, 134 mmol), acetonitrile (100 mL), triethylamine (100 mL), copper (I) iodide (1.30 g, 6.83 mmol), Pd(PPh3)2Cl2 (1.40 g, 1.99 mmol). The resulting solution was stirred for 3 h at 80° C. with continued bubbling of propyne gas. The solids were filtered, and the filtrate was concentrated under vacuum. The residue was purified over silica gel, eluting with ethyl acetate/petroleum ether (1:3) to afford 6-methyl-2-(prop-1-yn-1-yl)pyridin-3-amine (18.0 g, 92%) as a yellow solid. (300 MHz, DMSO-d6) δ ppm: 6.96 (d, J=8.4 Hz, 1H), 6.88 (d, J=8.4 Hz, 1H), 5.16 (brs, 2H), 2.24 (s, 3H), 2.08 (s, 3H). Procedure AAAA: Preparation of 2,5-dimethyl-1H-pyrrolo[3,2-b]pyridine Into a 500 mL round-bottom flask, was placed a solution of 6-methyl-2-(prop-1-yn-1-yl)pyridin-3-amine (18.0 g, 123 mmol) in DMF (300 mL). To this was added KOtBu (28.0 g, 250 mmol), in portions at 0° C. The resulting solution was then stirred at rt for 3 h. The reaction was then quenched by the addition of water/ice (1.0 L). The resulting solution was extracted with of ethyl acetate (200 mL×6), and the combined were washed with of brine (1.0 L×2). The organics were dried over anhydrous sodium sulfate and concentrated under vacuum to afford 2,5-dimethyl-1H-pyrrolo[3,2-b]pyridine (16.0 g, 89%) as a yellow solid. (300 MHz, DMSO-d6) δ ppm: 10.96 (brs, 1H), 7.50-7.42 (m, 1H), 6.84 (d, J=8.4 Hz, 1H), 6.14 (s, 1H), 2.51 (s, 3H), 2.40 (s, 3H). (Z)-4-(2,5-dimethyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 112) 1H-NMR (300 MHz, Methanol-d4) δ ppm: 8.69 (s, 1H), 8.13 (d, J=7.1 Hz, 2H), 7.90 (s, 2H), 7.58 (s, 1H), 5.42 (d, J=11.8 Hz, 2H), 5.36-5.27 (m, 1H), 3.75-3.60 (m, 2H), 3.25 (s, 3H), 2.83 (s, 3H), 2.63 (s, 3H). (Z)-4-(3-(3-(ethylsulfonyl)phenyl)-2-isopropyl-5-methyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 113) 1H-NMR (300 MHz, Methanol-d4) δ ppm: 8.79 (d, J=8.2 Hz, 1H), 8.47 (d, J=5.6 Hz, 1H), 8.23-8.10 (m, 1H), 8.04 (s, 1H), 7.90 (d, J=4.4 Hz, 2H), 7.77 (dd, J=8.3, 5.9 Hz, 1H), 5.52 (d, J=11.7 Hz, 2H), 5.33 (dt, J=34.0, 7.4 Hz, 1H), 3.69 (d, J=7.2 Hz, 2H), 3.57 (p, J=14.5, 7.2 Hz, 1H), 3.33 (q, J=9.0 Hz, 2H), 1.35-1.23 (m, 9H). (Z)-4-(3-(3-(ethylsulfonyl)phenyl)-2,5-dimethyl-1H-pyrrolo[3,2-b]pyridin-1-yl)-3-fluorobut-2-en-1-amine dihydrochloride (Compound 114) 1H-NMR (300 MHz, Methanol-d4) δ ppm: 8.67 (d, J=8.5 Hz, 1H), 8.18-7.99 (m, 2H), 7.97-7.83 (m, 2H), 7.58 (d, J=8.5 Hz, 1H), 5.49-5.22 (m, 3H), 3.68 (d, J=7.3 Hz, 2H), 3.35 (q, J=6.7 Hz, 2H), 2.82 (s, 3H), 2.62 (s, 3H), 1.32 (t, J=7.4 Hz, 3H). Example 63 The following compounds were prepared according to procedures AAAB, F, K, L and O. Procedure AAAB: Preparation of 2-(2-methyl-1H-pyrrolo[3,2-b]pyridin-5-yl)propan-2-ol To a stirring solution of ethyl 2-methyl-1H-pyrrolo[3,2-b]pyridine-5-carboxylate (1.23 g, 6.00 mmol) in THF (20 mL) at rt was added methylmagnesium bromide (3 M in THF, 10.0 mL, 30.0 mmol) over 5 min. The mixture was stirred at rt for 30 min. Additional methylmagnesium bromide (3 M in THF, 6.00 mL, 18.0 mmol) was added and stirring was continued for 30 min at rt, and then at reflux for 1 h. The reaction mixture was quenched by addition of sat. aq. NH4Cl (45 mL). The product was extracted with ethyl acetate (40 mL×3). The combined organic layer was dried over Na2SO4 and concentrated in vacuo. The crude material was purified over silica gel employing a Revelaris chromatography system to afford 2-(2-methyl-1H-pyrrolo[3,2-b]pyridin-5-yl)propan-2-ol (730 mg, 64%) as a pale yellow solid. 1H NMR (300 MHz, CDCl3) δ ppm: 7.99 (s, 1H), 7.58 (dd, J=8.4, 0.9 Hz, 1H), 7.10 (d, J=8.4 Hz, 1H), 6.42 (dq, J=2.2, 1.1 Hz, 1H), 5.68 (s, 1H), 2.53 (d, J=0.9 Hz, 3H), 1.59 (d, J=2.2 Hz, 6H). (Z)-2-(1-(4-amino-2-fluorobut-2-en-1-yl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-5-yl)propan-2-ol dihydrochloride (Compound 116) 1H-NMR (300 MHz, Methanol-d4) δ 8.78 (d, J=8.6 Hz, 1H), 8.18-8.07 (m, 2H), 7.94 (dt, J=7.7, 1.7 Hz, 1H), 7.92-7.86 (m, 1H), 7.82 (d, J=8.6 Hz, 1H), 5.45 (d, J=13.2 Hz, 2H), 5.36 (dt, J=34.3, 7.0 Hz, 1H), 3.69 (d, J=8.0 Hz, 2H), 3.25 (s, 3H), 2.69 (s, 3H), 1.72 (s, 6H). (Z)-2-(1-(4-amino-2-fluorobut-2-en-1-yl)-3-(3-(isopropylsulfonyl)phenyl)-2-methyl-1H-pyrrolo[3,2-b]pyridin-5-yl)propan-2-ol dihydrochloride (Compound 117) 1H-NMR (300 MHz, Methanol-d4) δ ppm: 8.74 (d, J=8.6 Hz, 1H), 8.09-8.02 (m, 2H), 7.97-7.87 (m, 2H), 7.81 (d, J=8.6 Hz, 1H), 5.57-5.22 (m, 3H), 3.68 (d, J=7.3 Hz, 2H), 3.46 (p, J=6.8 Hz, 1H), 2.69 (s, 3H), 1.72 (s, 6H), 1.36 (d, J=6.8 Hz, 6H). Example 64 The following compound was prepared according to procedures AAZ, AAAA, F, K, AQ, AAAC, L and O. (Z)-3-fluoro-4-(5-(fluoromethyl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1-amine dihydrochloride (Compound 115) Procedure AAAC: Preparation of tert-butyl (Z)-(3-fluoro-4-(5-(fluoromethyl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1-yl)carbamate A solution of tert-butyl (Z)-(3-fluoro-4-(5-(hydroxymethyl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1-yl)carbamate (160 mg, 0.32 mmol) in CH2Cl2 (4 mL) was cooled to −10° C. under an argon atmosphere. Diethylaminosulfur trifluoride (0.05 mL, 0.36 mmol) was added in one lot. The reaction mixture was allowed to warm to rt and stirring was continued overnight. Water (10 mL) was added and the mixture was stirred at rt for 5 min. The organic layer was separated. The aqueous layer was extracted with CH2Cl2 (5 mL×3). The combined organics were dried over Na2SO4 and concentrated in vacuo. Purification over silica gel using CombiFlash™ afforded tert-butyl (Z)-(3-fluoro-4-(5-(fluoromethyl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1-yl)carbamate (35 mg, 22%) as a white foam. 1H NMR (300 MHz, CDCl3) δ ppm: 8.23 (t, J=1.8 Hz, 1H), 8.04 (dt, J=7.9, 1.3 Hz, 1H), 7.84 (ddd, J=7.9, 1.9, 1.1 Hz, 1H), 7.6-7.60 (m, 2H), 7.30 (d, J=8.4 Hz, 1H), 5.27 (dd, J=29.9, 12.1 Hz, 2H), 4.84 (d, J=10.8 Hz, 2H), 4.70-4.92 (m, 3H), 3.80 (t, J=5.1 Hz, 2H), 3.09 (s, 3H), 2.60 (s, 3H), 1.42 (s, 9H). tert-butyl (Z)-(3-fluoro-4-(5-(fluoromethyl)-2-methyl-3-(3-(methylsulfonyl)phenyl)-1H-pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1-yl)carbamate (Compound 115) 1H-NMR (300 MHz, Methanol-d4) δ 8.73 (s, 1H), 8.20-8.07 (m, 2H), 7.95-7.84 (m, 2H), 7.82 (d, J=8.7 Hz, 1H), 5.74 (d, J=46.8 Hz, 2H), 5.57-5.17 (m, 3H), 3.69 (d, J=7.4 Hz, 2H), 3.24 (s, 3H), 2.67 (s, 3H). Example 65 Method to Determine the Ability of Compounds of the Invention to Inhibit LOX and LOXL1-4 from Different Sources Lysyl oxidase (LOX) is an extracellular copper dependent enzyme which oxidizes peptidyl lysine and hydroxylysine residues in collagen and lysine residues in elastin to produce peptidyl alpha-aminoadipic-delta-semialdehydes. This catalytic reaction can be irreversibly inhibited by β-aminopropionitrile (BAPN) that binds to the active site of LOX (Tang S. S., Trackman P. C. and Kagan H. M., Reaction of aortic lysyl oxidase with beta-aminoproprionitrile. J Biol Chem 1983; 258: 4331-4338). There are five LOX family members; these are LOX, LOXL1, LOXL2, LOXL3 and LOXL4. LOX and LOXL family members can be acquired as recombinant active proteins from commercial sources, or extracted from animal tissues like bovine aorta, tendons, pig skin; or prepared from cell cultures. The inhibitory effects of the compounds of the present invention were tested against the given LOX-LOXL preparation using a high-throughput coupled colorimetric method (Holt A. and Palcic M., A peroxidase-coupled continuous absorbance plate-reader assay for flavin monoamine oxidases, copper-containing amine oxidases and related enzymes. Nat. Protoc. 2006; 1: 2498-2505). The assay was developed using either 384 or 96 well format. Briefly, in a standard 384 well plate assay 25 μL of a dilution of any of the isoenzymes and orthologues in 1.2 M urea, 50 mM sodium borate buffer (pH 8.2) were added into each well in the presence of 1 μM mofegiline and 0.5 mM pargyline (to inhibit SSAO and MAO-B and MAO-A, respectively). Test compounds were dissolved in DMSO and tested in a Concentration Response Curve (CRC) with 11 data points, typically in the micromolar or nanomolar range after incubation with the enzyme for 30 min at 37° C. Twenty five L of a reaction mixture containing twice the KM concentration of putrescine (Sigma Aldrich, e.g. 20 mM for LOX, or 10 mM for LOXL2 and LOXL3), 120 μM Amplex Red (Sigma Aldrich) and 1.5 U/mL horseradish peroxidase (Sigma Aldrich) prepared in 1.2 M urea, 50 mM sodium borate buffer (pH 8.2) were then added to the corresponding wells. The above volumes were doubled in the case of 96 wells plate. The fluorescence (RFU) was read every 2.5 min for 30 min at a range of temperatures from 37° to 45° C., excitation 565 nm and emission 590 (Optima; BMG labtech). The slope of the kinetics for each well was calculated using MARS data analysis software (BMG labtech) and this value was used to deduce the IC50 value (Dotmatics). The ability of the inventive compounds to inhibit the amine oxidase activity LOX and other family members is shown in Table 2. TABLE 2 LOX and LOXL2 inhibitory activities of examples of compounds of the invention Bovine LOX Human LOXL2 Activity IC50 Activity IC50 Compound (nanomolar) (nanomolar) BAPN >1000 <1000 1 >300 <300 2 >300 <300 3 >300 <300 4 >300 <300 5 >300 <300 6 >300 <300 7 >300 <300 8 >300 <300 9 >300 <300 10 >300 <300 11 >300 <300 12 >300 <300 13 >300 <300 14 >300 <300 15 >300 <300 16 >300 <300 17 >300 <300 18 >300 <300 19 >300 <300 20 >300 <300 21 >300 <300 22 >300 <300 23 >300 <300 24 >300 <300 25 >300 <300 26 >300 <300 27 >300 <300 28 >300 <300 29 >300 <300 30 >300 <300 31 >300 <300 32 >300 <300 33 >300 <300 34 >300 <300 35 >300 <300 36 >300 <300 37 >300 <300 38 >300 <300 39 >300 <300 40 >300 <300 41 >300 <300 42 >300 <300 43 >300 <300 44 >300 <300 45 >300 <300 46 >300 <300 47 >300 <300 48 >300 <300 49 >300 <300 50 >300 <300 51 >300 <300 52 >300 <300 53 >300 <300 54 >300 <300 55 >300 <300 56 >300 <300 57 >300 <300 58 >300 <300 59 >300 <300 60 >300 <300 61 >300 <300 62 >300 <300 63 >300 <300 64 >300 <300 65 >300 <300 66 >300 <300 67 >300 <300 68 >300 <300 69 >300 <300 70 >300 <300 71 >300 <300 72 >300 <300 73 >300 <300 74 >300 <300 75 >300 <300 76 >300 <300 77 >300 <300 78 >300 <300 79 >300 <300 80 >300 <300 81 >300 <300 82 >300 <300 83 >300 <300 84 >300 <300 85 >300 <300 86 >300 <300 87 >300 <300 88 >300 <300 89 >300 <300 90 >300 <300 91 >300 <300 92 >300 <300 93 >300 <300 94 >300 <300 95 >300 <300 96 >300 <300 97 >300 <300 98 >300 <300 99 >300 <300 100 >300 <300 101 >300 <300 102 >300 <300 103 >300 <300 104 >300 <300 105 >300 <300 106 >300 <300 107 >300 <300 108 >300 <300 109 >300 <300 110 >300 <300 111 >300 <300 112 >300 <300 113 >300 <300 114 >300 <300 115 >300 <300 116 >300 <300 117 >300 <300 Example 66 Method to Determine the Ability of Compounds of Formula I to Inhibit Human Recombinant SSAO/VAP-1 Human recombinant SSAO/VAP-1 amine oxidase activity was determined using the coupled colorimetric method as described for monoamine oxidase, copper-containing amine oxidases and related enzymes (Holt A. and Palcic M., A peroxidase-coupled continuous absorbance plate-reader assay for flavin monoamine oxidases, copper-containing amine oxidases and related enzymes. Nat Protoc 2006; 1: 2498-2505). Briefly, a cloned cDNA template corresponding to residues 34-763 of human SSAO/VAP-1, and incorporating a mouse Ig kappa (κ) signal sequence, N-terminal flag epitope tag and tobacco etch virus (TEV) cleavage site, was assembled in a mammalian expression vector (pLO-CMV) by Geneart AG. This vector containing human SSAO/VAP-1 residues was transfected into CHO-K1 glycosylation mutant cell line, Lec 8. A clone stably expressing human SSAO/VAP-1 was isolated and cultured in large scale. Active human SSAO/VAP-1 was purified and recovered using immunoaffinity chromatography. This was used as the source for SSAO/VAP-1 activity. A high-throughput colorimetric assay was developed using either 96 or 384 well format. Briefly, in a standard 96 well plate assay 50 μL of purified human SSAO/VAP-1 (0.25 μg/mL) in 0.1 M sodium phosphate buffer (pH 7.4) was added into each well. Test compounds were dissolved in DMSO and tested in a Concentration Response Curve (CRC) with 4-11 data points, typically in the micromolar or nanomolar range after incubation with human SSAO/VAP-1 for 30 min at 37° C. After 30 min incubation, 50 μL of the reaction mixture containing 600 μM benzylamine (Sigma Aldrich), 120 μM Amplex Red (Sigma Aldrich) and 1.5 U/mL horseradish peroxidase (Sigma Aldrich) prepared in 0.1 M sodium phosphate buffer (pH 7.4) were added to the corresponding well. The fluorescence unit (RFU) was read every 2.5 min for 30 min at 37° C. excitation 565 nm and emission 590 (Optima; BMG labtech). The slope of the kinetics for each well was calculated using MARS data analysis software (BMG labtech) and this value was used to deduce the IC50 value (Dotmatics). The ability of the compounds of Formula I to inhibit SSAO/VAP-1 is shown in Table 3. Example 67 Method to Determine the Ability of Compounds of Formula I to Inhibit Human Recombinant MAO-B The specificity of the compounds of this invention was tested by determining their ability to inhibit MAO-B activities in vitro. Recombinant human MAO-B (0.06 mg/mL; Sigma Aldrich) was used as source of MAO-B enzyme activities. The assay was performed in a similar way as for human SSAO/VAP-1 (Example 66) except, the substrate benzylamine was used at 100 μM. The ability of compounds of Formula I to inhibit MAO-B is shown in Table 3. TABLE 3 Selectivity of Compounds of Formula I for LOX and LOXL2 compared to SSAO/VAP-1 and MAO-B SSAO/VAP-1 MAO-B Activity Activity IC50 IC50 Compound (micromolar) (micromolar) BAPN >3 >3 1 >3 >3 2 >3 >3 3 >3 >3 4 >3 >3 5 >3 >3 6 >3 >3 7 >3 >3 8 >3 >3 9 >3 >3 10 >3 >3 11 >3 >3 12 >3 >3 13 >3 >3 14 >3 >3 15 >3 >3 16 >3 >3 17 >3 >3 18 >3 >3 19 >3 >3 20 >3 >3 21 >3 >3 22 >3 >3 23 >3 >3 24 >3 >3 25 >3 >3 26 >3 >3 27 >3 >3 28 >3 >3 29 >3 >3 30 >3 >3 31 >3 >3 32 >3 >3 33 >3 >3 34 >3 >3 35 >3 >3 36 >3 >3 37 >3 >3 38 >3 >3 39 >3 >3 40 >3 >3 41 >3 >3 42 >3 >3 43 >3 >3 44 >3 >3 45 >3 >3 46 >3 >3 47 >3 >3 48 >3 >3 49 >3 >3 50 >3 >3 51 >3 >3 52 >3 >3 53 >3 >3 54 >3 >3 55 >3 >3 56 >3 >3 57 >3 >3 58 >3 >3 59 >3 >3 60 >3 >3 61 >3 >3 62 >3 >3 63 >3 >3 64 >3 >3 65 >3 >3 66 >3 >3 67 >3 >3 68 >3 >3 69 >3 >3 70 >3 >3 71 >3 >3 72 >3 >3 73 >3 >3 74 >3 >3 75 >3 >3 76 >3 >3 77 >3 >3 78 >3 >3 79 >3 >3 80 >3 >3 81 >3 >3 82 >3 >3 83 >3 >3 84 >3 >3 85 >3 >3 86 >3 >3 87 >3 >3 88 >3 >3 89 >3 >3 90 >3 >3 91 >3 >3 92 >3 >3 93 >3 >3 94 >3 >3 95 >3 >3 96 >3 >3 97 >3 >3 98 >3 >3 99 >3 >3 100 >3 >3 101 >3 >3 102 >3 >3 103 >3 >3 104 >3 >3 105 >3 >3 106 >3 >3 107 >3 >3 108 >3 >3 109 >3 >3 110 >3 >3 111 >3 >3 112 >3 >3 113 nt nt 114 nt nt 115 nt nt 116 nt nt 117 nt nt LOX and LOXL1-4 enzymes are members of a large family of flavin-dependent and copper-dependent amine oxidases, which includes SSAO/VAP-1 and monoamine oxidase-B (MAO-B). Compounds of the present invention selectively inhibit members of the LOX family of enzymes with respect to SSAO/VAP-1, MAO-B and other family member amine oxidases. Examples of the magnitude of selectivity can be seen in Table 3. Example 68 Inhibition of CCl4 Induced Liver Fibrosis An analysis of the use of LOXL2 inhibitors to treat inflammatory/fibrotic diseases is performed through the use of a CCl4 induced liver fibrosis model. Liver injury is frequently followed by complete parenchymal regeneration due to regenerative potency of hepatocytes. Continuous liver injury due to the administration of CCl4 leads to extracellular matrix accumulation, accompanied by recurrent hepatocyte necrosis, inflammation, and regenerative processes, causing liver fibrosis and consequently liver cirrhosis (see Natsume, M., et al., Attenuated liver fibrosis and depressed serum albumin levels in carbon tetrachloride-treated IL-6-deficient mice. J. Leukoc. Biol., 1999, 66, 601-608 also See Yao, Q, Y., et al. Inhibition by curcumin of multiple sites of the transforming growth factor-beta1 signalling pathway ameliorates the progression of liver fibrosis induced by carbon tetrachloride in rats. BMC Complement Altern Med. 2012 Sep. 16; 12(1):156.) Rats are administered orally with CCl4 at a concentration of 0.25 μL/g in olive oil, 3 times per week for 6 weeks. Compound 25 is given 0.1-100 mg/Kg throughout the period of the experimental procedure or only 3 weeks after CCl4 administration and then throughout the entire study. Compared with the vehicle-treated group that show increases in fibrosis in the liver, Compound 25 administration shows up to 50% reduction as demonstrated by liver sirius red staining with quantification (See FIG. 1). In addition, Compound 25 treated mice results in a statistically significant reduction in the liver collagen with inhibition of >30% of collagen by hydroxyproline analysis. Example 69 Inhibition of Bleomycin Induced Lung Fibrosis Bleomycin induced lung fibrosis in rodents is a widely accepted experimental model to determine the anti-fibrotic activity of therapeutic agents. Fibrosis is induced by intranasal administered of bleomycin sulphate at a dose of 0.05 U/mouse in a total volume of 50 uL PBS (see Corbel, M., et al Inhibition of bleomycin-induced pulmonary fibrosis in mice by the matrix metalloproteinase inhibitor batimastat J Pathol. 2001 April; 193(4):538-45.) Compound 12 is given 0.1-100 mg/Kg throughout the period of the experimental procedure or 7 days after bleomycin administration and then throughout the entire study. Formalin fixed lungs sections stained with haematoxylin and eosin are assessed for fibrosis as per the scale outlined by Ashcroft et al (Simple method of estimating severity of pulmonary fibrosis on a numerical scale J Clin Pathol 1988; 41:467-470). Bleomycin administration increases the Ashcroft score, while 15 mg/kg of Compound 12 significantly reduced this score in the lungs (See FIG. 2). Example 70 Inhibition of Streptozotocin Induced Diabetic Nephropathy Streptozotocin (STZ)-induced diabetic nephropathy is commonly used for creating rodent models of type 1 diabetes which develop renal injury, due to pancreatic cell damage with similarities to human diabetic nephropathy. This model can be established for investigating anti-fibrotic effects of compounds in the development of kidney fibrosis. Diabetes is induced in eNOS knockout mice on C57BL/6 background by intraperitoneal STZ injection (55 mg/kg in 0.1 M citrate buffer) in mice of 6-9 weeks of age (see Huang C et al, Blockade of KCa3.1 ameliorates renal fibrosis through a TGF-bl/Smad pathway in diabetic mice. Diabetes, 2013 62(8):2923-2934). Blood sugar level (BSL) is determined by tail vein blood. Mice with BSL>16 mmol/L two weeks post STZ injection are considered diabetic. Treatment with Compound 12 is carried out for 24 weeks from diagnosis of diabetes at a dose of 0.1-100 mg/Kg. Compared with the vehicle-treated group that show increases in fibrosis and decline in kidney function, Compound 12 administration shows up to 50% reduction of fibrosis (by Masson's Trichrome staining showing collagen expression and glomerular damage) (See FIG. 3A-3C) and a significant improvement in kidney function as demonstrated by albumin/creatinine ratio quantification (see FIG. 4). Example 71 Inhibition of Myocardial Infarction Induced Fibrosis Carotic ligation is a widely accepted experimental model to induce cardiac fibrosis and to determine the anti-fibrotic activity of therapeutic agents. In mice, the chest is opened via a left thoracotomy. The left coronary artery is identified visually using a stereo microscope, and a 7-0 suture is placed around the artery 1-2 mm below the left auricle. Permanent occlusion of the left coronary artery resulted from its ligation with the suture. Myocardial ischemia was confirmed by pallor in heart color and ST-segment elevation. (see Parajuli et al. Phosphatase PTEN is critically involved in post-myocardial infarction remodeling through the Akt/interleukin-10 signaling pathway Basic Res Cardiol (2012) 107:248). Mice were subjected to sham or carotic ligation surgery. At 24 hrs post-surgery, echocardiography was performed on the mice. Mice were treated with compound 25 0.1-100 mg/Kg once a day for 21 (7 days after carotic ligation) or 28 days or saline as vehicle controls by oral gavage. At the end of the experiment, echocardiography was repeated to assess left ventricular function and remodeling. Then mice were euthanized for heart collection. Each heart was photographed and fixed with 10% formalin. Hearts were sectioned for Masson's trichrome stain to measure fibrosis (See FIG. 5). Example 72 Streptozotocin and High Fat Diet Induced Liver Fibrosis High fat/carbohydrate diet induced liver fibrosis is the most common reason for liver dysfunction and ultimately liver failure. NASH is induced in male mice by a single subcutaneous injection of 200 sg streptozotocin solution 2 days after birth and feeding with high fat diet after 4 weeks of age (STAM™ model). The STAM™ model demonstrates NASH progression that resembles the disease in humans: STAM™ mice manifest NASH at 8 weeks, which progresses to fibrosis at 12 weeks (K. Saito et al. Characterization of hepatic lipid profiles in a mouse model with nonalcoholic steatohepatitis and subsequent fibrosis Sci Rep. 2015 Aug. 20; 5:12466). LOXL2 inhibitor compound 112 was administered by daily oral gavage at doses between 10-30 mg/kg 8 weeks after streptozotocin application. Mice were sacrificed after NASH had been established and whole blood samples were taken via cardiac puncture. Liver samples were collected and washed with cold saline. Liver weight was measured. The left lateral, right and caudate lobes of livers were snap frozen in liquid nitrogen and stored at −80° C. For HE staining, sections were cut from paraffin blocks of liver tissue prefixed in Bouin's solution and stained with Lillie-Mayer's Hematoxylin and eosin solution. NAFLD Activity score (NAS) was calculated according to the criteria of Kleiner (Kleiner D E. et al., Design and validation of a histological scoring system for nonalcoholic fatty liver disease. Hepatology, 2005; 41:1313). To visualize collagen deposition, Bouin's fixed liver sections were stained using picro-Sirius red solution and the area of fibrosis was quantified (See FIG. 6). Example 73 Reduction of Collagen Cross-Link Formation in an In Vitro Fibroblastic Foci Model of IPF The lung tissue of patients with idiopathic pulmonary fibrosis (IPF) is characterised by dense collections of myofibroblasts and extracellular matrix (ECM) termed ‘fibroblastic foci’. Using a novel in vitro model of fibroblastic foci (Jones et al., AJRCCM 191; 2015:A4912) the formation of lysyl oxidase (LOX) mediated collagen cross-links and the effects of the nonselective LOX inhibitor β-aminopropionitrile (BAPN) as well lysyl oxidase like-2 (LOXL2)-selective inhibitors were investigated. Cultures of primary fibroblasts were grown out from clinical diagnostic biopsies of fibrotic lung and stored in liquid nitrogen. Fibroblasts from confirmed cases of IPF were subsequently expanded and seeded onto transwell membranes under optimised conditions for mature collagen matrix deposition in the presence of BAPN or a LOXL2-selective inhibitor (Compound 112). Following stimulation with transforming growth factor β1 (TGF-β1) multicellular foci formed which were histochemically similar in organisation to fibroblastic foci in vivo. The foci were cultured for a further six weeks in the presence of TGF-β1 and the inhibitors. Cultures were then harvested and snap frozen in liquid nitrogen. To quantify collagen cross-links (Robins Biochem Soc Trans 2007; 35(5): 849-852; Saito et al Anal. Biochem. 1997; 253: 26-32; Sims, Avery & Bailey Methods in Molecular Biology 2000; vol 139: 11-26), cultures were treated with potassium borohydride to stabilise the reducible immature cross-links, and hydrolysed in 6N HCl at 100° C. for 16 hr. Total collagen content was assessed by hydroxyproline assay. Immature cross-links were assessed by LC/MS/MS and mature pyridinoline cross-links by ELISA. Cross-link data is expressed as moles of cross-link per mole collagen. The number of immature and mature LOX family-mediated collagen crosslinks increased over the 6 week duration of the model. Both BAPN and the LOXL2-selective inhibitor (Compound 112) reduced cross-link formation in a concentration dependent manner (see FIGS. 7a and 7b ). 1. A compound of Formula I: or a stereoisomer, pharmaceutically acceptable salt, polymorphic form, solvate, tautomeric form or prodrug thereof; wherein: a is N or CR3; b is N or CR4; c is N or CR5; d is N or CR6; and from 0 to 2 of a, b, c and d are N; R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O-Cl3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. 2. A compound according to claim 1, of Formula Ia: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6 alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—Cl3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. 3. A compound according to claim 1, of Formula Ib: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4 and R5 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. 4. A compound according to claim 1, of Formula Ic: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R4 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. 5. A compound according to claim 1, of Formula Id: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. 6. A compound according to claim 1, of Formula Ie: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R4, R5 and R6 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3. 7. A compound according to claim 1, of Formula If: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6 alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3 and R4 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH,—CF3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3 alkyl, —CF3, —CH2CF3, and —O—CF3. 8. A compound according to claim 1, of Formula Ig: or a pharmaceutically acceptable salt, solvate or prodrug thereof; wherein: R1 is selected from the group consisting of hydrogen, halogen, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10 and —NR9C(O)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R2 is aryl or heteroaryl; wherein each R2 is optionally substituted by one or more R12; R3 and R5 are each independently selected from the group consisting of hydrogen, halogen, hydroxyl, C1-6alkyl, C3-7cycloalkyl, —O—C1-6alkyl, —O—C3-7cycloalkyl, —CN, —NO2, —NR9R10, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, —S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11, —S(O2)R11, tetrazole and oxadiazole; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R8 is selected from the group consisting of hydrogen, C1-6alkyl, and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; R9 and R10 are independently selected from the group consisting of hydrogen, C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; or R9 and R10 when attached to the same nitrogen atom are combined to form a 3- to 7-membered ring having from 0 to 2 additional heteroatoms as ring members; R11 is selected from the group consisting of C1-6alkyl and C3-7cycloalkyl; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —SH, —C1-3alkyl, —O—C1-3alkyl, —CF3, —CH2CF3, and —O—CF3; and R12 is selected from the group consisting of halogen, C1-6alkyl, —O—C1-6alkyl, —S—C1-6alkyl, C3-7cycloalkyl, —O—C3-7cycloalkyl, —C(O)OR8, —C(O)NR9R10, —NR9C(O)R11, S(O2)NR9R10, —NR9S(O2)R11, —S(O)R11 and —S(O2)R11; wherein each C1-6alkyl is a straight or branched chain alkyl; and wherein each C1-6alkyl and C3-7cycloalkyl is optionally substituted by one or more substituents selected from the group consisting of halogen, —OH, —C1-3alkyl, —O—C1-3 alkyl, —CF3, —CH2CF3, and —O—CF3. 9. A compound according to any one of claims 1 to 8, wherein R2 is selected from the group consisting of phenyl 1,3-benzodioxolyl 2-pyridinyl 3-pyrindinyl 4-pyridinyl and 5-pyrimidinyl wherein each R2 is optionally substituted by one or more R12. 10. A compound according to any one of claims 1 to 9, wherein R1 is selected from the group consisting of hydrogen, methyl, ethyl, isopropyl, 1-hydroxyethyl, 2-hydroxyisopropyl, chloro and —C(O)N(CH3)2. 11. A compound according to claim 1, selected from the group consisting of: 1 (Z)-3-fluoro-4-(3-(4-fluorophenyl)-1H- indol-1-yl)but-2-en-1-amine 2 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 3 (Z)-4-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 4 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-1H-pyrrolo[2,3-b]pyridin-3-yl)- N,N-dimethylbenzenesulfonamide 5 (Z)-methyl 1-(4-amino-2-fluorobut-2-en- 1-yl)-3-(3-(N,N- dimethylsulfamoyl)phenyl)-2-methyl-1H- indole-5-carboxylate 6 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-5- carboxamide 7 (Z)-methyl 1-(4-amino-2-fluorobut-2-en- 1-yl)-3-(3-(N,N- dimethylsulfamoyl)phenyl)-2-methyl-1H- indole-6-carboxylate 8 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-indole-5-carboxylic acid 9 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-indole-6-carboxylic acid 10 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-6- carboxamide 11 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-2- methyl-1H-indole-6-carboxamide 12 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(N,N- dimethylsulfamoyl)phenyl)-2-methyl-1H- indole-5-carboxylate 13 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)-2- methylphenyl)-2-methyl-1H-indole-5- carboxylic acid 14 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2- methyl-3-(3-(methylsulfonyl)phenyl)-1H- indole-5-carboxylic acid 15 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(dimethylcarbamoyl)phenyl)-2- methyl-1H-indole-5-carboxylate 16 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(dimethylcarbamoyl)phenyl)-2- methyl-1H-indole-5-carboxylic acid 17 (Z)-ethyl 1-(4-amino-2-flluorobut-2-en-1- yl)-2-methyl-3-(3- (methylsulfonyl)phenyl)-1H-indole-5- carboxylate 18 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-2- methyl-3-(3-(N- methylsulfamoyl)phenyl)-1H-indole-5- carboxylic acid 19 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(5-(N,N-dimethylsulfamoyl)-2- methylphenyl)-2-methyl-1H-indole-5- carboxylate 20 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (5-(N,N-dimethylsulfamoyl)-2- methylphenyl)-2-methyl-1H-indole-5- carboxylic acid 21 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (3-(N,N-dimethylsulfamoyl)phenyl)-6- fluoro-2-methyl-1H-indole-5-carboxylic acid 22 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(N,N- dimethylsulfamoyl)phenyl)-6-fluoro-2- methyl-1H-indole-5-carboxylate 23 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)-3- (4-fluorophenyl)-2-methyl-1H-indole-5- carboxylic acid 24 ethyl (Z)-1-(4-amino-2-fluorobut-2-en-1- yl)-3-(4-fluorophenyl)-2-methyl-1H- indole-5-carboxylate 25 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 26 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-1H-pyrrolo[3,2- c]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 27 ethyl (Z)-1-(4-amino-2-fluorobut-2-en- 1-yl)-3-(3-chlorophenyl)-2-methyl-1H- indole-5-carboxylate 28 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-chlorophenyl)-2-methyl-1H- indole-5-carboxylic acid 29 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-5-(2H-tetrazol-5-yl)-1H- indol-3-yl)-N,N- dimethylbenzenesulfonamide 30 ethyl (Z)-1-(4-amino-2-fluorobut-2-en- 1-yl)-3-(3-(tert-butyl)phenyl)-2- methyl-1H-indole-5-carboxylate 31 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(tert-butyl)phenyl)-2-methyl-1H- indole-5-carboxylic acid 32 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-1H-pyrrolo[2,3- c]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 33 ethyl (Z)-3-(1-(4-amino-2-fluorobut-2- en-1-yl)-5-(N,N-dimethylsulfamoyl)-2- methyl-1H-indol-3-yl)benzoate 34 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-(N,N-dimethylsulfamoyl)-2- methyl-1H-indol-3-yl)benzoic acid 35 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N-isopropyl-2-methyl-1H-indole-5- carboxamide 36 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N-isopropyl-N,2-dimethyl-1H-indole- 5-carboxamide 37 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-hydroxy-2-methyl-1H-indol-3- yl)-N,N-dimethylbenzenesulfonamide 38 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-3-(3-(N- methylmethylsulfonamido)phenyl)- 1H-indole-5-carboxylic acid 39 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3-(N- methylmethylsulfonamide)phenyl)- 1H-indole-5-carboxamide 40 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(5-(N,N-dimethylsulfamoyl)pyridin- 3-yl)-2-methyl-1H-indole-5-carboxylic acid 41 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(5-(N,N-dimethylsulfamoyl)pyridin- 3-yl)-N,N,2-trimethyl-1H-indole-5- carboxamide 42 (Z)-ethyl 1-(4-amino-2-fluorobut-2-en- 1-yl)-3-(3-(N,N- dimethylsulfamoyl)phenyl)-2-methyl- 1H-pyrrolo[3,2-b]pyridine-5- carboxylate 43 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- 2-methyl-1H-pyrrolo[3,2-b]pyridine-5- carboxylic acid 44 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-pyrrolo[3,2- b]pyridine-5-carboxylate 45 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N-isopropyl-2-methyl-1H-pyrrolo[3,2- b]pyridine-5-carboxamide 46 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N,2-dimethyl-1H-pyrrolo[3,2- b]pyridine-5-carboxamide 47 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-7- carboxamide 48 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- 2-methyl-1H-indole-7-carboxylic acid 49 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-methoxy-2-methyl-1H-indol-3- yl)-N,N-dimethylbenzenesulfonamide 50 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3- (methylsulfonyl)phenyl)-1H-indole-5- carboxamide 51 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-cyano-2-methyl-1H-indol-3-yl)- N,N-dimethylbenzenesulfonamide 52 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-5- carboxamide 53 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-pyrrolo[3,2- b]pyridine-5-carboxamide 54 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3- sulfamoylphenyl)-1H-indole-5- carboxamide 55 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-5-(1,2,4-oxadiazol-3-yl)- 1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 56 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3- (trifluoromethyl)phenyl)-1H-indole-5- carboxamide 57 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(3- ((trifluoromethyl)sulfonyl)phenyl)-1H- indole-5-carboxamide 58 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(3-(N,N-dimethylsulfamoyl)phenyl)- N,N,2-trimethyl-1H-indole-5- sulfonamide 59 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-(difluoromethyl)-2-methyl-1H- indol-3-yl)-N,N-dimethylbenzene- sufonamide 60 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-hydroxy-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzene-sulfonamide 61 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-methoxy-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzene-sulfonamide 62 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-2-methyl-1H-indol-3-yl)- N,N-dimethylbenzenesulfonamide 63 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 64 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-2-methyl-1H-indol-3-yl)- N,N-dimethylpyridine-3-sulfonamide 65 (Z)-4-(5-chloro-2-methyl-3-(5- (methylsulfonyl)pyridin-3-yl)-1H- indol-1-yl)-3-fluorobut-2-en-1-amine 66 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 67 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-6-chloro-2-methyl-1H-indol-3-yl)- N,N-dimethylpyridine-3-sulfonamide 68 (Z)-3-fluoro-4-(5-methoxy-2-methyl- 3-(3-(methylthio)phenyl)-1H- pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1- amine 69 (Z)-3-fluoro-4-(5-methoxy-2-methyl- 3-(3-(methylsulfonyl)phenyl)-1H- pyrrolo[3,2-b]pyridin-1-yl)but-2-en-1- amine 70 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-2-methyl-1H-indol-3-yl)- N-methylpyridine-3-sulfonamide 71 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-fluoro-2-methyl-1H-indol-3-yl)- N,N-dimethylpyridine-3-sulfonamide 72 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-6-chloro-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N-dimethylpyridine- 3-sulfonamide 73 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-2-methyl-1H-pyrrolo[2,3- b]pyridin-3-yl)-N,N-dimethylpyridine- 3-sulfonamide 74 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-7-chloro-2-methyl-1H-indol-3-yl)- N,N-dimethylpyridine-3-sulfonamide 75 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-4-chloro-2-methyl-1H-indol-3-yl)- N,N-dimethylpyridine-3-sulfonamide 76 (Z)-4-(5-chloro-2-methyl-3-(pyridin-4- yl)-1H-indol-1-yl)-3-fluorobut-2-en-1- amine 77 (Z)-4-(5-chloro-2-methyl-3-(pyridin-3- yl)-1H-indol-1-yl)-3-fluorobut-2-en-1- amine 78 (Z)-6-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-2-methyl-1H-indol-3-yl)- N,N-dimethylpyridine-2-sulfonamide 79 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-cyclopropyl-2-methyl-1H-indol- 3-yl)-N,N-dimethylpyridine-3- sulfonamide 80 (Z)-4-(5-chloro-2-methyl-3- (pyrimidin-5-yl)-1H-indol-1-yl)-3- fluorobut-2-en-1-amine 81 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-(pyridin-4-yl)-1H- indole-5-sulfonamide 82 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-7-fluoro-2-methyl-1H- indol-3-yl)-N,N,4- trimethylbenzenesulfonamide 83 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-chloro-2-methyl-1H-indol-3- yl)pyridine-3-sulfonamide 84 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 2-methyl-3-(pyridin-4-yl)-1H-indole- 5-sulfonamide 85 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-5-(trifluoromethoxy)-1H- indol-3-yl)-N,N-dimethylpyridine-3- sulfonamide 86 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N,N,2-trimethyl-3-phenyl-1H-indole- 5-sulfonamide 87 (Z)-3-fluoro-4-(2-methyl-5- (methylsulfonyl)-3-phenyl-1H-indol-1- yl)but-2-en-1-amine 88 (Z)-3-fluoro-4-(2-methyl-5- (methylsulfonyl)-3-(pyridin-4-yl)-1H- indol-1-yl)but-2-en-1-amine 89 (Z)-4-(3-(2,6-dimethylpyridin-4-yl)-2- methyl-5-(methylsulfonyl)-1H-indol- 1-yl)-3-fluorobut-2-en-1-amine 90 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(2,6-dimethylpyridin-4-yl)-N,N,2- trimethyl-1H-indole-5-carboxamide 91 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- N-(tert-butyl)-2-methyl-3-(pyridin-4- yl)-1H-indole-5-carboxamide 92 (Z)-4-(3-(benzo[d][1,3]dioxol-5-yl)-2- methyl-5-(methylsulfonyl)-1H-indol- 1-yl)-3-fluorobut-2-en-1-amine 93 (Z)-3-fluoro-4-(3-(4-fluorophenyl)-2- methyl-5-(methylsulfonyl)-1H-indol- 1-yl)but-2-en-1-amine 94 (Z)-3-fluoro-4-(2-methyl-3-(2- methylpyridin-4-yl)-5- (methylsulfonyl)-1H-indol-1-yl)but-2- en-1-amine 95 (Z)-1-(4-amino-2-fluorobut-2-en-1-yl)- 3-(4-fluorophenyl)-2-methyl-1H- indole-5-sulfonamide 96 (Z)-5-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-chloro-1H-indol-3-yl)-N,N- dimethylpyridine-3-sulfonamide 97 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-5-(methylsulfonyl)-1H- indol-3-yl)-N,N- dimethylbenzenesulfonamide 98 (Z)-3-fluoro-4-(3-(2-methoxypyridin- 4-yl)-2-methyl-5-(methylsulfonyl)-1H- indol-1-yl)but-2-en-1-amine 99 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-chloro-1H-pyrrolo[3,2-b]pyridin- 3-yl)-N,N- dimethylbenzenesulfonamide 100 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-chloro-5-(methylsulfonyl)-1H- indol-3-yl)-N,N- dimethylbenzenesulfonamide 101 (Z)-4-(3-(2,6-dimethylpyridin-4-yl)-2- methyl-5-nitro-1H-indol-1-yl)-3- fluorobut-2-en-1-amine 102 (Z)-N-(1-(4-amino-2-fluorobut-2-en-1- yl)-3-(2,6-dimethylpyridin-4-yl)-2- methyl-1H-indol-5- yl)methanesulfonamide 103 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-(methoxymethyl)-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 104 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-5-(methylsulfonamido)- 1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 105 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-(dimethylamino)-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 106 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-(isopropylsulfonyl)-2-methyl- 1H-indol-3-yl)-N,N- dimethylbenzenesulfonamide 107 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2,5-dimethyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 108 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-6-fluoro-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 109 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-fluoro-2-methyl-1H-pyrrolo[3,2- b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 110 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-5-(trifluorometthyl)-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 111 (Z)-3-(1-(4-amino-2-fluorobut-2-en-1- yl)-5-(1,1-difluoroethyl-2-methyl-1H- pyrrolo[3,2-b]pyridin-3-yl)-N,N- dimethylbenzenesulfonamide 112 (Z)-4-(2,5-dimethyl-3-(3- (methylsulfonyl)phenyl)-1H- pyrrolo[3,2-b]pyridin-1-yl)-3- fluorobut-2-en-1-amine 113 (Z)-4-(3-(3-(ethylsulfonyl)phenyl)-2- isopropyl-5-methyl-1H-pyrrolo[3,2- b]pyridin-1-yl)-3-fluorobut-2-en-1- amine 114 (Z)-4-(3-(3-(ethylsulfonyl)phenyl)-2,5- dimethyl-1H-pyrrolo[3,2-b]pyridin-1- yl)-3-fluorobut-2-en-1-amine 115 (Z)-3-fluoro-4-(5-(fluoromethyl)-2- methyl-3-(3-(methylsulfonyl)phenyl)- 1H-pyrrolo[3,2-b]pyridin-1-yl)but-2- en-1-amine 116 (Z)-2-(1-(4-amino-2-fluorobut-2-en-1- yl)-2-methyl-3-(3- (methylsulfonyl)phenyl)-1H- pyrrolo[3,2-b]pyridin-5-yl)propan-2-ol 117 (Z)-2-(1-(4-amino-2-fluorobut-2-en-1- yl)-3-(3-(isopropylsulfonyl)phenyl)-2- methyl-1H-pyrrolo[3,2-b]pyridin-5- yl)propan-2-ol or a pharmaceutically acceptable salt, solvate or prodrug thereof. 12. A pharmaceutical composition comprising a compound according to any one of claims 1 to 11, or a pharmaceutically acceptable salt, solvate or prodrug thereof, and at least one pharmaceutically acceptable excipient, carrier or diluent. 13. A method of inhibiting the amine oxidase activity of LOX, LOXL1, LOXL2, LOXL3 and LOXL4 in a subject in need thereof, comprising administering to the subject an effective amount of a compound according to any one of the claims 1 to 11, or a pharmaceutically acceptable salt, solvate or prodrug thereof, or a pharmaceutical composition according to claim 12. 14. A method of treating a condition associated with LOX, LOXL1, LOXL2, LOXL3 and LOXL4 protein, comprising administering to a subject in need thereof a therapeutically effective amount of compound according to any one of claims 1 to 11, or a pharmaceutically acceptable salt, solvate or prodrug thereof, or a pharmaceutical composition according to claim 12. 15. The method of claim 14, wherein the condition is a liver disorder. 16. The method of claim 15, wherein the liver disorder is selected from the group consisting of biliary atresia, cholestatic liver disease, chronic liver disease, nonalcoholic steatohepatitis (NASH), non-alcoholic fatty liver disease (NAFLD), fatty liver disease associated with disorders such as hepatitis or metabolic syndrome; hepatitis C infection, alcoholic liver disease, primary biliary cirrhosis (PBC), primary schlerosing cholangitis (PSC), liver damage due to progressive fibrosis, liver fibrosis and liver cirrhosis. 17. The method of claim 14, wherein the condition is a kidney disorder. 18. The method of claim 17, wherein the kidney disorder is selected from the group consisting of kidney fibrosis, renal fibrosis, acute kidney injury, chronic kidney disease, diabetic nephropathy, glomerulosclerosis, vesicoureteral reflux, tubulointerstitial renal fibrosis and glomerulonephritis. 19. The method of claim 14, wherein the condition is a cardiovascular disease. 20. The method of claim 19, wherein the cardiovascular disease is selected from the group consisting of atherosclerosis, arteriosclerosis, hypercholesteremia, and hyperlipidemia. 21. The method of claim 14, wherein the condition is fibrosis. 22. The method of claim 21, wherein the fibrosis is selected from the group consisting of liver fibrosis, lung fibrosis, kidney fibrosis, cardiac fibrosis, cystic fibrosis, idiopathic pulmonary fibrosis, radiation-induced fibrosis, ocular fibrosis, Peyronie's disease and scleroderma or is associated with respiratory disease, abnormal wound healing and repair, post-surgical operations, cardiac arrest and all conditions where excess or aberrant deposition of fibrous material is associated with disease, including Crohn's disease and inflammatory bowel disease. 23. The method of claim 14, wherein the condition is cancer. 24. The method of claim 23, wherein the cancer is selected from the group consisting of lung cancer; breast cancer; colorectal cancer; anal cancer; pancreatic cancer; prostate cancer; ovarian carcinoma; liver and bile duct carcinoma; esophageal carcinoma; non-Hodgkin's lymphoma; bladder carcinoma; carcinoma of the uterus; glioma, glioblastoma, medullablastoma, and other tumors of the brain; myelofibrosis, kidney cancer; cancer of the head and neck; cancer of the stomach; multiple myeloma; testicular cancer; germ cell tumor; neuroendocrine tumor; cervical cancer; oral cancer, carcinoids of the gastrointestinal tract, breast, and other organs; signet ring cell carcinoma; mesenchymal tumors including sarcomas, fibrosarcomas, haemangioma, angiomatosis, haemangiopericytoma, pseudoangiomatous stromal hyperplasia, myofibroblastoma, fibromatosis, inflammatory myofibroblastic tumour, lipoma, angiolipoma, granular cell tumour, neurofibroma, schwannoma, angiosarcoma, liposarcoma, rhabdomyosarcoma, osteosarcoma, leiomyoma or a leiomysarcoma. 25. The method of claim 14, wherein the condition is angiogenesis. 26. The method according to any one of claims 14 to 25 further comprising administering a second therapeutic agent. 27. The method according to claim 26, wherein the second therapeutic agent is selected from the group consisting of an anti-cancer agent, anti-inflammatory agent, anti-hypertensive agent, an anti-fibrotic agent, an anti-angiogenic agent and an immunosuppressive agent. 28. Use of a compound according to any one of claims 1 to 11, or a pharmaceutically acceptable salt or solvate thereof, for the manufacture of a medicament for treating a condition associated with LOX, LOXL1, LOXL2, LOXL3 and LOXL4 protein.

2017-02-10

en

2019-02-07

US-201916422182-A

Method for measuring behind the iris after locating the scleral spur ABSTRACT A method is disclosed for using a precision ultrasound scanning device to image the anterior segment of the human eye, automatically locate the scleral spur, and, using the scleral spur as a fiduciary, to automatically make measurements in front of and behind the iris. The scleral spur can be used as a fiduciary to make measurements that characterize the normal and abnormal shapes of components within this region of the anterior segment of the eye. One or more of the measurements of the iridocorneal angle and the anterior chamber depth can be related to other measurements behind the iris including the iris lens contact distance, the iris zonule distance and the trabecular ciliary process distance. Over a period of time, these measurements can change and can indicate a change, or be a precursor for a change, of intraocular pressure (IOP), and therefore can determine an earlier onset of glaucoma. CROSS-REFERENCE TO RELATED APPLICATIONS This application claims the benefits, under 35 U.S.C. § 119(e), of U.S. Provisional Application Ser. No. 62/676,175 entitled “A Method for Locating the Scleral Spur in an Eye Using an Ultrasound Scanning Device” filed May 24, 2018 which is incorporated herein by reference. FIELD OF INVENTION The present invention relates to a method, using a precision ultrasound scanning device, for imaging the anterior segment of the eye, for automatically locating the scleral spur in a human eye and, using the scleral spur as a fiduciary, automatically making measurements in front of and behind the iris. BACKGROUND OF THE INVENTION To improve upon the subjectivity of gonioscopy, there has been an effort to better diagnose the onset and progression of glaucoma by imaging the anterior segment of the eye using optical and ultrasound instruments. Both of these technologies utilize the scleral spur as a distinct landmark or fiduciary from which to make measurements of one of more of the iridocorneal angle, the anterior chamber depth, the iris/lens contact distance, the iris/zonule distance and the trabecular ciliary process distance. Optical Coherence Tomography (OCT) is a light-based imaging technology that can image most of the cornea. OCT cannot see clearly behind the scleral wall or at all behind the iris and is therefore of reduced use in screening for the early onset of glaucoma. OCT does well for imaging the central retina although only to the lateral extent allowed by a dilated pupil. These OCT images have a resolution of about 18 microns (“The Effect of Scleral Spur Identification Methods on Structural Measurements by Anterior Segment Optical Coherence Tomography”, Seager, Wang, Arora, Quigley, Journal of Glaucoma, Vol. 23, No 1, January 2014, which is incorporated herein by reference.) Ultrasound Bio Microscopy is currently the most common means of ultrasound imaging. This is applied by a hand-held device commonly known as a UBM. A UBM can capture anterior segment images using a transducer to emit very high frequency acoustic pulses ranging from about 20 to about 80 MHz. The device is normally used with an open scleral shell filled with saline which is placed on an anesthetized eye and the UBM probe is held in the saline. Alternately, a Prager cup can be used. The procedure using a UBM is somewhat uncomfortable for the patient and the pressure of the UBM on the cornea can distort the cornea and eyeball. The UBM method is capable of making qualitative ultrasound images of the anterior segment of the eye but cannot make accurate, precision, comprehensive, measurable images of the cornea, lens or other components of the eye required for glaucoma screening, keratoconus evaluation or lens sizing. This is because of two reasons. First, the UBM is a hand-held device and relies on the steadiness of the operator's hand to maintain a fixed position relative to the eye being scanned for several seconds. Second, the UBM is pressed firmly onto the patient's eye to make contact with the patient's cornea to obtain good acoustic coupling. This gives rise to some distortion of the cornea and the eyeball. Between these two limitations, the resolution is limited to the range of about 40 to 60 microns and the reproducibility can be no better than 20 microns (“Ultrasound Biomicroscopy in Plateau Iris Syndrome”, Pavlin, Ritch and Foster, American Journal of Ophthalmology 113:390-395, April 1992 which is incorporated herein by reference). Ultrasonic imaging using an arc scanner has found use in accurate measurement of structures of the eye, such as, for example, the cornea and lens capsule. Such measurements provide an ophthalmic surgeon valuable information that can be used to guide various surgical procedures for correcting refractive errors in LASIK and lens replacement procedures. They also provide diagnostic information after surgery to assess the geometrical location of corneal features such as the LASIK scar and lens features such as the lens connection to the ciliary muscle, lens position and lens orientation Except for on-axis measurements, dimensions and locations of eye components behind the iris cannot be readily determined by optical means. Precision ultrasound imaging with an arc scanner in the frequency range of about 5 MHz to about 80 MHz can be applied to make accurate and precise measurements of structures of the eye, such as the cornea, lens capsule, ciliary muscle and the like. Precision ultrasound imaging using an arc scanning device (for example as described in U.S. Pat. No. 8,317,702, which is incorporated herein by reference) has a resolution of about 20 microns and a reproducibility of about 2 microns. Ultrasonic imaging can be used to provide the required accurate images in the corner of the eye in the region around the junction of the cornea, the sclera and the iris (in the region of the suprachoroidal space to the scleral spur) which is well off-axis and essentially inaccessible to optical imaging. Other new procedures such as implantation of stents in or near the suprachoroid may provide part or all of a treatment for glaucoma The region of the eye where the cornea, iris, sclera and ciliary muscle are all in close proximity is shown in FIGS. 1 and 2 which illustrate the iridocorneal angle, scleral spur, trabecular mesh and ciliary process for example. The arc scanning ultrasound system is capable of accurately moving an ultrasound transducer with respect to a known reference point on a patient's head. Further improvements allow for tracking of unintended eye motions during scanning as disclosed in U.S. Pat. No. 9,597,059 entitled “Tracking Unintended Eye Movements in an Ultrasonic Scan of the Eye”, which is incorporated herein by reference. Precision ultrasonic imaging requires a liquid medium to be interposed between the object being imaged and the transducer, which requires in turn that the eye, the transducer, and the path between them be at all times be immersed in a liquid medium. An eyepiece serves to complete a continuous acoustic path for ultrasonic scanning, that path extending from the transducer to the surface of the patient's eye. The eyepiece also separates the water in which the patient's eye is immersed from the water in the chamber in which the ultrasound transducer and guide track assembly are contained. Finally, the eyepiece provides a steady rest for the patient and helps the patient to remain steady during a scan. To be practical, the eyepiece should be free from frequent leakage problems, should be comfortable to the patient and its manufacturing cost should be low since it should be replaced for every new patient. The approach of the precision ultrasound scanning device of the present disclosure is to detect the onset of glaucoma by imaging structural changes in the anterior segment before any retinal damage occurs so that the disease can be identified and successfully treated with drugs and/or stent implants. There remains, therefore, a need for a precision ultrasound scanning device to provide a means for automatically locating the scleral spur in an eye by imaging through the scleral wall and through the iris so that accurate and repeatable measurements can be automatically made referencing from the position of the scleral spur. These measurements may improve the detection of changes in the eye that can precede elevation of intraocular pressure (IOP) that characterizes the onset of glaucoma. SUMMARY OF THE INVENTION These and other needs are addressed by the present disclosure. The various embodiments and configurations of the present disclosure are directed generally to ultrasonic imaging of biological materials such as the cornea, sclera, iris, lens, ciliary process etcetera in the anterior segment of an eye and in particular directed to a method for automatically locating the scleral spur in an eye using a form of segmentation analysis, and, using the scleral spur as a fiduciary, automatically making measurements in front of and behind the iris. One of the applications of a precision ultrasound scanning device or instrument is to image the region of the eye where the cornea, iris, sclera and ciliary muscle are all in close proximity (see FIGS. 1 and 2). By using a knowledge of the structure of the eye in this region and employing unique binary filtering techniques, the position of the scleral spur can be automatically determined. Once the position of the scleral spur is determined, it can be used as a fiduciary to automatically make a number of measurements that characterize the normal and abnormal shapes of components within this region of the anterior segment of the eye. Over a period of time, these measurements can change and can indicate a change, or be a precursor for a change, of intraocular pressure (IOP). IOP is the pressure in the eye created by the balance between continual renewal of fluids within the eye and drainage of fluids from the eye. The intraocular pressure is normally stable (fluid generated equals fluid drained) but can increase when Schlemm's canal and trabecular mesh through which the fluid normally drains becomes progressively blocked. Increasing IOP is a sign of the onset of glaucoma and, if left untreated, elevated IOP causes damage to the retinal cones leading to progressive loss of sight. This process beginning with blocked drainage and ending in damage to the retina and blindness is known as glaucoma. IOP can be measured with a goniometer (another purpose of gonioscopy is to visualize the iridocorneal angle (or simply “angle”). However, changes in the measurements that can be made as disclosed herein can be precursors to a measurable change in IOP and therefore can allow the ophthalmologist to take preventative measures to prevent the progression of glaucoma. The method disclosed herein comprises the following principal steps which are performed automatically: 1. Acquire B-Scans 2. Binarize B-Scans 3. Determine the iris/lens contact distance (ILCD) and anterior chamber depth (ACD) 4. Locate Root of the Iris 5. Locate Root of the Ciliary Sulcus 6. Isolate the Sclera 6. Locate the Scleral Spur 7. Using the scleral spur as a fiduciary, make measurements including, at least, the trabecular/iris angle (TIA), the iris lens contact distance, the iris zonule distance (IZD) and the trabecular ciliary process distance (TCPD). 8. Prepare an Automated based on a B-Scan with all measurements displayed. One or more of the measurements of the angle and the anterior chamber depth may be related to one or more of the measurements behind the iris of the iris lens contact distance, the iris zonule distance and the trabecular ciliary process distance. If so, these measurements can then serve as an early indicators of increasing IOP and therefore can determine an earlier onset of glaucoma as compared to the conventional measurement of IOP using a goniometer. A method is disclosed for detecting a scleral spur in an eye of a patient. The method comprises providing an ultrasound device having a scan head with an arcuate guide track and a carriage movable along the arcuate guide track; an eyepiece configured to maintain the eye of the patient in a fixed location with respect to the arcuate guide track; and a transducer connected to the carriage. The method includes emitting, from the transducer, ultrasound pulses as the carriage moves along the arcuate guide track; storing the received ultrasound pulses on a non-transitory computer readable medium; forming, by at least one electronic device, a B-Scan of the eye of the patient based on the received ultrasound pulses; binarizing, by the at least one electronic device, the B-Scan from a grayscale color palette to a black/white color palette; determining, by the at least one electronic device, an average surface of a sclera of the eye; and locating, by the at least one electronic device, a bump of the average surface of the sclera that corresponds to the scleral spur. A system is disclosed for detecting a scleral spur in an eye of a patient, comprising an ultrasound device, having a scan head having an arcuate guide track and a carriage movable along the arcuate guide track; an eyepiece configured to maintain the eye of the patient in a fixed location with respect to the arcuate guide track; a transducer connected to the carriage, wherein ultrasound pulses are emitted into the eye of the patient and the received ultrasound pulses are stored on a non-transitory computer readable medium; wherein at least one electronic device has non-transitory readable medium and has instructions that, when executed, cause the at least one electronic device to form a B-Scan of the eye of the patient based on the received ultrasound pulses; binarize the B-Scan from a grayscale color palette to a black/white color palette; determine an average surface of a sclera of the eye; and locate a bump of the average surface of the sclera that corresponds to the scleral spur. Another system is disclosed for binarizing a B-Scan of an eye of a patient, comprising an ultrasound device, having a scan head having an arcuate guide track and a carriage movable along the arcuate guide track; an eyepiece configured to maintain the eye of the patient in a fixed location with respect to the arcuate guide track; a transducer connected to the carriage, wherein ultrasound pulses are emitted into the eye of the patient, and wherein the received ultrasound pulses are stored on a non-transitory computer readable medium and wherein at least one electronic device having the non-transitory readable medium and having instructions that, when executed, cause the at least one electronic device to form a B-Scan of the eye of the patient based on the received ultrasound pulses; to determine an average intensity of a grayscale color palette of the B-Scan of the eye; to binarize the B-Scan of the eye from the grayscale color palette to a black/white color palette, wherein discrete areas of the B-Scan above a predetermined intensity are binarized to white and discrete areas of the B-Scan below the predetermined intensity are binarized to black, and the predetermined intensity depends on the average intensity. The following definitions are used herein: The phrases at least one, one or more, and and/or are open-ended expressions that are both conjunctive and disjunctive in operation. For example, each of the expressions “at least one of A, B and C”, “at least one of A, B, or C”, “one or more of A, B, and C”, “one or more of A, B, or C” and “A, B, and/or C” means A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B and C together. An acoustically reflective surface or interface is a surface or interface that has sufficient acoustic impedance difference across the interface to cause a measurable reflected acoustic signal. A specular surface is typically a very strong acoustically reflective surface. Anterior means situated at the front part of a structure; anterior is the opposite of posterior. An A-scan is a representation of a rectified, filtered reflected acoustic signal as a function of time, received by an ultrasonic transducer from acoustic pulses originally emitted by the ultrasonic transducer from a known fixed position relative to an eye component. Accuracy as used herein means substantially free from measurement error. The angle as referred to herein is the angle between the iris, which makes up the colored part of the eye, and the cornea, which is the clear-window front part of the eye. The angle is short for the iridocorneal angle. When the angle is open, most, if not all, of the eye's drainage system can be seen by using a special mirrored lens. When the angle is narrow, only portions of the drainage angle are visible, and in acute angle-closure glaucoma, none of it is visible. The angle is the location where the fluid that is produced inside the eye, the aqueous humor, drains out of the eye into the body's circulatory system. The function of the aqueous humor is to provide nutrition to the eye and to maintain the eye in a pressurized state. Aqueous humor should not be confused with tears, since aqueous humor is inside the eye. The angle of opening, called the trabecular-iris angle (TIA), is defined as an angle measured with the apex in the iris recess and the arms of the angle passing through a point on the trabecular meshwork 500 μm from the scleral spur and the point on the iris perpendicularly. The TIA is a specific way to measure the angle or iridocorneal angle. The anterior segment comprises the region of the eye from the cornea to the back of the lens. Automatic refers to any process or operation done without material human input when the process or operation is performed. However, a process or operation can be automatic, even though performance of the process or operation uses material or immaterial human input, if the input is received before performance of the process or operation. Human input is deemed to be material if such input influences how the process or operation will be performed. Human input that consents to the performance of the process or operation is not deemed to be “material.” In this disclosure, binarize means to convert grayscale pixels to black or white depending on which side of a selected grayscale threshold the pixel is on, where grayscale pixels range in values from 0 (black) to 255 (white). Binary filtering or binary thresholding is used to transform an image into a binary image by changing the pixel values according to a selection rule. The user defines two thresholds and two intensity values. For each pixel in the input image, the value of the pixel is compared with the two thresholds. If the pixel value is inside the range defined by the two thresholds, the output pixel is assigned as an inside value. Otherwise the output pixels are assigned to an outside value. A B-scan is a processed representation of A-scan data by either or both of converting it from a time to a distance using acoustic velocities and by using grayscales, which correspond to A-scan amplitudes, to highlight the features along the A-scan time history trace (the latter also referred to as an A-scan vector). The bump as referred to herein is the protruding structure located at the intersection of the interface curve and the curve formed by the posterior of the cornea. Centration means substantially aligning the center of curvature of the arc scanning transducer in all three dimensions of space with the center of curvature of the eye component of interest (such as the cornea, pupil, lens, retina, etcetera) such that rays from the transducer pass through both centers of curvature. A special case is when both centers of curvature are coincident. The ciliary body is the circumferential tissue inside the eye composed of the ciliary muscle and ciliary processes. There are three sets of ciliary muscles in the eye, the longitudinal, radial, and circular muscles. They are near the front of the eye, above and below the lens. They are attached to the lens by connective tissue called the zonule of Zinn, and are responsible for shaping the lens to focus light on the retina. When the ciliary muscle relaxes, it flattens the lens, generally improving the focus for farther objects. When it contracts, the lens becomes more convex, generally improving the focus for closer objects. Fiducial means a reference, marker or datum, such as a point or line, in the field of view of an imaging device used as a fixed standard of reference for a fixed basis of comparison or measurement. Glaucoma is a group of eye conditions that damage the optic nerve, the health of which is vital for good vision. This damage is often caused by an abnormally high pressure in the eye. Glaucoma is one of the leading causes of blindness for older people. Glaucoma is often linked to a buildup of pressure inside the eye. In this disclosure, grayscale means an image in which the value of each pixel is a single sample representing only intensity information. Images of this sort are composed exclusively of shades of gray, varying from black at the weakest intensity to white at the strongest intensity. Grayscale images are commonly stored with 8 bits per sampled pixel. This pixel depth allows 256 different intensities (shades of gray) to be recorded where grayscale pixels range in values from 0 (black) to 255 (white). The home position of the imaging ultrasound transducer is its position during the registration process. Intraocular pressure (IOP) is the pressure in the eye created by the continual renewal and drainage of fluids within the eye. The intraocular pressure is normally stable but can increase because the canal and trabecular mesh through which the fluid normally drains becomes progressively blocked. Increasing IOP is a sign of the onset of glaucoma and, if left untreated, causes damage to the retinal cones leading to progressive loss of sight which is known as glaucoma. The iridocorneal angle is referred to herein as the angle between the iris, which makes up the colored part of the eye, and the cornea, which is the clear-window front part of the eye. The iridocorneal angle is often referred to as the angle. The iris dilator muscle is a smooth muscle of the eye, running radially in the iris which serves as a dilator. When the sphincter pupillae contract, the iris decreases or constricts the size of the pupil. The iris is a pigmented disk with a variable aperture which controls the size of the pupil and the amount of light reaching the retina. The iris comprises the anterior limiting layer, the stroma, the dilator muscle layer, and the posterior pigmented epithelium. In this disclosure, isolating as applied to a binarized image means to isolate the scleral material containing the scleral spur from iris, cornea and ciliary material. In this disclosure, a moving average (also referred to as a rolling average or running average) is a way of analyzing data points by creating a series of averages of different subsets of adjacent data points in the full data set. The natural lens (also known as the crystalline lens) is a transparent, biconvex structure in the eye that, along with the cornea, helps to refract light to be focused on the retina. The lens, by changing shape, functions to change the focal distance of the eye so that it can focus on objects at various distances, thus allowing a sharp real image of the object of interest to be formed on the retina. This adjustment of the lens is known as accommodation. The lens is located in the anterior segment of the eye behind the iris. The lens is suspended in place by the zonular fibers, which attach to the lens near its equatorial line and connect the lens to the ciliary body. The lens has an ellipsoid, biconvex shape whose size and shape can change due to accommodation and due to growth during aging. The lens is comprised of three main parts: namely the lens capsule, the lens epithelium, and the lens fibers. The lens capsule forms the outermost layer of the lens and the lens fibers form the bulk of the interior of the lens. The cells of the lens epithelium, located between the lens capsule and the outermost layer of lens fibers, are generally found only on the anterior side of the lens. Optical as used herein refers to processes that use light rays. The optical axis of the eye is a straight line through the centers of curvature of the refracting surfaces of an eye (the anterior and posterior surfaces of the cornea and lens). Positioner means the mechanism that positions a scan head relative to a selected part of an eye. In the present disclosure, the positioner can move back and forth along the x, y or z axes and rotate in the β direction about the z-axis. Normally the positioner does not move during a scan, only the scan head moves. In certain operations, such as measuring the thickness of a region, the positioner may move during a scan. Posterior means situated at the back part of a structure; posterior is the opposite of anterior. The posterior segment comprises the region of the eye from the back of the lens to the rear of the eye comprising the retina and optical nerve. Precise as used herein means sharply defined and repeatable. Precision means how close in value successive measurements fall when attempting to repeat the same measurement between two detectable features in the image field. In a normal distribution precision is characterized by the standard deviation of the set of repeated measurements. Precision is very similar to the definition of repeatability. The pulse transit time across a region of the eye is the time it takes a sound pulse to traverse the region. Refractive means anything pertaining to the focusing of light rays by the various components of the eye, principally the cornea and lens. Registration as used herein means aligning. ROI means Region of Interest. Scan head means the mechanism that comprises the ultrasound transducer, the transducer holder and carriage as well as any guide tracks that allow the transducer to be moved relative to the positioner. Guide tracks may be linear, arcuate or any other appropriate geometry. The guide tracks may be rigid or flexible. Normally, only the scan head is moved during a scan. The scleral spur in the human eye is an annular structure composed of collagen in the anterior chamber. The scleral spur is a fibrous ring that, on meridional section, appears as a wedge projecting from the inner aspect of the anterior sclera. The spur is attached anteriorly to the trabecular meshwork and posteriorly to the sclera and the longitudinal portion of the ciliary muscle. Sector scanner is an ultrasonic scanner that sweeps a sector like a radar. The swept area is pie-shaped with its central point typically located near the face of the ultrasound transducer. Segmentation analysis as used in this disclosure means manipulation of an ultrasound image to determine the boundary or location of an anatomical feature of the eye. In this disclosure, smoothing as applied to a selected surface of a binarized image means to prepare the surface to be characterized by a straight line by removing protrusions above a first selected threshold and recesses below a second selected threshold. This is a special case of segmentation analysis. The ciliary sulcus is the groove between the iris and ciliary body. The scleral sulcus is a slight groove at the junction of the sclera and cornea. In the human eye, the scleral spur is an annular structure composed of collagen. It is a protrusion of the sclera into the anterior chamber. The scleral spur is the most anterior projection of the sclera internally. It is a circular ridge of sclera on the internal aspect of the corneoscleral junction. On cross-section, it appears as a hooklike process deep to the scleral venous sinus; relatively rigid, it provides attachment for the meridional fibers of the ciliary body. Schlemm's canal is a circular lymphatic-like vessel in the eye that collects aqueous humor from the anterior chamber and delivers it into the episcleral blood vessels via aqueous veins. Schlemm's canal is a unique vascular structure that functions to maintain fluid homeostasis by draining aqueous humor from the eye into the systemic. The Schwalbe line is the line formed by the posterior surface of the cornea, and delineates the outer limit of the corneal endothelium layer. Sessile means normally immobile. The suprachoroid lies between the choroid and the sclera and is composed of closely packed layers of long pigmented processes derived from each tissue. The suprachoroidal space is a potential space providing a pathway for uveoscleral outflow and becomes an actual space in choroidal detachment. The hydrostatic pressure in the suprachoroidal space is an important parameter for understanding intraocular fluid dynamics and the mechanism of choroidal detachment. The trabecular meshwork is an area of tissue in the eye located around the base of the cornea, near the ciliary body, and is responsible for draining the aqueous humor from the eye via the anterior chamber (the chamber on the front of the eye covered by the cornea). The trabecular meshwork, plays a very important role in the drainage of aqueous humor. The majority of fluid draining out of the eye is via the trabecular meshwork, then through a structure called Schlemm's canal, into collector channels, then to veins, and eventually back into body's circulatory system. In this disclosure, thresholding means to select a threshold and divide objects into those above the threshold and those below the threshold. Ultrasonic means sound that is above the human ear's upper frequency limit. When used for imaging an object like the eye, the sound passes through a liquid medium, and its frequency is many orders of magnitude greater than can be detected by the human ear. For high-resolution acoustic imaging in the eye, the frequency is typically in the approximate range of about 5 to about 80 MHz. An ultrasonic arc scanner is an ultrasound scanning device utilizing a transducer that both sends and receives pulses as it moves along 1) an arcuate guide track, which guide track has a center of curvature whose position can be moved to scan different curved surfaces; 2) a linear guide track; and 3) a combination of linear and arcuate guide tracks which can create a range of centers of curvature whose position can be moved to scan different curved surfaces. The visual axis of the eye is a straight line that passes through both the center of the pupil and the center of the fovea. Zonules are tension-able ligaments extending from near the outer diameter of the crystalline lens. The zonules attach the lens to the ciliary body which allows the lens to accommodate in response to the action of the ciliary muscle. BRIEF DESCRIPTION OF THE DRAWINGS The present invention may take form in various components and arrangements of components, and in various steps and arrangements of steps. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. In the drawings, like reference numerals may refer to like or analogous components throughout the several views. FIG. 1 shows the anatomy of the eye in the region near the scleral spur. FIG. 2 shows an alternate diagram of the anatomy of the eye in the region near the scleral spur. FIG. 3A is a B-scan of the anterior segment of a human eye. FIG. 3B is a diagram of the anatomy of the eye. FIG. 4 is a binarized image of the B-scan of the anterior segment. FIG. 5A is a binarized image of the B-scan of a part of the anterior segment. FIG. 5B is a diagram of the anatomy of the eye. FIG. 6A is a binarized image of the region of interest containing the scleral spur. FIG. 6B is a diagram of the anatomy of the eye. FIG. 7A is a further isolated and smoothed binarized image of the region of interest containing the scleral spur. FIG. 7B is a diagram of the anatomy of the eye. FIG. 8 is a binarized image of a close-up of a further smoothed and shortened image of the isolated sclera, including the scleral spur. FIG. 9 is an inverted binarized image of the root of the iris. FIG. 10A is a B-scan of the anterior segment showing ACD and ILCD measurements. FIG. 10B is a diagram of the anatomy of the eye. FIG. 11 shows the ILCD (the iris lens contact distance) region of interest of the B-Scan for one side of the eye. FIG. 12A is a B-scan of half of the anterior segment showing the location of features to be measured. FIG. 12B is a diagram of the anatomy of the eye. FIG. 13 is a B-scan of the whole anterior segment showing the location of features to be measured. FIG. 14 shows a binarized smoothed image of the scleral region of interest with cross hatching to indicate the TISA areas. FIG. 15A shows the inverted binarized TISA area object used for measuring the TISA area. FIG. 15B is a diagram of the anatomy of the eye. FIG. 16 shows the binarized region of interest for isolating the root of the iris. FIG. 17 shows the binarized image of the isolated iris. FIG. 18A shows the point of intersection of the iris root and sclera, along with potential points of the scleral spur detected with shortened isolated sclera object. FIG. 18B is a diagram of the anatomy of the eye. FIG. 19A shows the point of intersection of the iris root and sclera, along with potential points of the scleral spur detected with a longer isolated sclera. FIG. 19B is a diagram of the anatomy of the eye. FIG. 20 is a B-scan of the anterior segment showing the location of measured features of the left and right eye along with the tables of actual measurements. FIG. 21 illustrates another measurement of the iris zonule distance IZD. This measurement is also made through the iris. FIG. 22 illustrates geometric structures used in detecting the scleral spur. FIG. 23 is a close-up of geometric structures used in detecting the scleral spur. FIG. 24A illustrates the interface line between the sclera and ciliary muscles. FIG. 24B is a diagram of the anatomy of the eye. FIG. 25A illustrates various measurements that can be made using ultrasound technology. FIG. 25B illustrates various measurements that can be made using ultrasound technology. DETAILED DESCRIPTION OF THE DRAWINGS One of the applications of a precision ultrasound scanning device or instrument is to image the region of the eye around the confluence of the cornea, iris, sclera and ciliary muscle. By using a knowledge of the structure of the eye in this region along with binary filtering techniques, the position of the scleral spur can be determined with respect to a known point (the visual axis intersection with the anterior or posterior cornea, for example). Once the position of the scleral spur is determined, a number of measurements that characterize the normal and abnormal shapes of components within the anterior segment of the eye can be made. Over a period of time, these measurements can change and can indicate a change or be a precursor to a change of intra ocular pressure (IOP). IOP is the pressure in the eye created by the continual renewal of fluids within the eye and drainage of fluids from the eye. The intraocular pressure is normally stable (fluid generated equals fluid drained) but can increase when the canal and trabecular mesh through which the fluid normally drains becomes progressively blocked. Increasing IOP is a sign of the onset of glaucoma and, if left untreated, causes damage to the retinal cones leading to progressive loss of sight which is known as glaucoma. IOP can be measured with a goniometer. However, changes in the measurements that can be made as disclosed herein can be precursors to a measurable change in IOP and therefore can allow the ophthalmologist to take preventative measures to prevent the progression of glaucoma before permanent damage to the retina occurs. The following measurements as denoted by their abbreviations are referenced in this disclosure: ACD which is the anterior chamber depth AOD which is the angle opening distance 500 (500 microns from the scleral spur) ID which is the iris thickness (must measure through the iris) ILCD which is the iris lens contact distance (must measure through the iris) IZD which is the iris zonule distance (must measure through the iris) ROI which is the Region of Interest. TCPD which is the trabecular ciliary process distance (must measure through the iris) TIA is the trabecular iris space area These measurements are illustrated in FIGS. 25A and 25B and are discussed in “Anterior Segment Imaging: Ultrasound Biomicroscopy”, Hiroshi Ishikawa, MD* and Joel S. Schuman, MD, Ophthalmol Clin North Am. 7-20, March 2004 which is incorporated herein by reference. In all the figures, left and right are referenced to the page. Left and right directions are illustrated in FIG. 1. FIG. 1 shows the anatomy of the eye in the region near the scleral spur. This figure illustrates the geometry of the region of interest in which the scleral spur can be found. The iris, ciliary process, cornea and sclera all come together in this region. As in all subsequent figures, left and right, as shown in this figure, are referenced to the page. FIG. 2 shows an alternate diagram of the anatomy of the eye in the region near the scleral spur. The iridocorneal angle is the angle between the iris and the cornea. The iridocorneal angle is also known as simply the angle. The following steps are performed to determine noted points of interest (including the scleral spur as a fiduciary) and the measurements dependent on those points, including points/measurements both in front of and behind the iris: Acquire and Binarize B-Scans 1. Using an ultrasound arc scanning device, form a B-scan image of the anterior segment (anterior cornea to approximately mid lens, wide angle sclera to sclera) including the left and right sides of the scleral/iris region. FIG. 3A is a B-scan of the anterior segment of a human eye and a line drawing of the region of the eye shown in the B-scan. This image was obtained by a precision ultrasound arc scanning device. 2. Select a threshold value from 1 to 255 for pixel intensity and form a corresponding binary image wherein pixels that are greater than or equal to the specified threshold are converted to 1 (white) and pixels that are less than the specified threshold are converted to 0 (black). Starting threshold depends on the average background pixel intensity. Threshold is then increased iteratively to identify objects of interest. 3. Eliminate extraneous objects such as the anterior lens surface, cornea, electronic noise, reflections, cataracts, etcetera. As the image is further thresholded, the region of the cornea nearest the sclera disappears, leaving the sclera and iris isolated. The same process removes the ciliary muscle at the bottom of the sclera. Part of the thresholding process comprises deleting the pixels less than the threshold value, then filling in any holes in the objects, then deleting any remaining small objects whose area, defined by the number of pixels they contain, are less than a specified area. 4. Binarize the whole anterior segment image—from 0 to 255 grades of grayscale to black and white. FIG. 4 is a binarized image of a B-scan of the anterior segment and is similar to the B-scan image shown in FIG. 3A. Determine ILCD and ACD 5. Create left and right halves of the binarized image. FIG. 5A is a binarized image of the B-scan of the region of interest in the anterior segment for detecting the scleral spur. FIG. 5a is the B-scan image and FIG. 5b is a line drawing of the region of the eye shown in the B-scan. FIG. 6A is a binarized image of the region of interest of the local region containing the scleral spur. FIG. 6a is the B-scan image and FIG. 6b is a line drawing of the region of the eye shown in the B-scan. 6. From the binarized B-scan, create a left and right binarized region of interest around the intersection of the lens/iris (see FIGS. 5 and 6). FIG. 7A is a further isolated and smoothed binarized image of the region of interest containing the scleral spur. FIG. 7a is the B-scan image and FIG. 7b is a line drawing of the region of the eye shown in the B-scan. The line drawing illustrates the interface curve formed by the interface between the sclera and ciliary muscle and the Schwalbe line which is the line formed by the posterior surface of the cornea. FIG. 8 is a binarized image of a close-up of a further smoothed and shortened image of the isolated sclera, including the scleral spur. This image is a further processed version of the image shown in FIG. 7A. 7. From each iris/lens ROI, determine the iris/lens contact distance (ILCD) on right and left sides. a. Using the binarized ROI, locate the center of the lens, then move outward along the top surface of the lens until detecting the iris. b. Keep moving outward along the lens until a gap is detected between the bottom of the iris and the lens, then determine the actual intersection of the bottom of the iris and the lens (the contact point between the iris and the lens furthest from the center of the anterior segment.) c. Repeat for the right side d. The iris-lens contact distance (“ILCD”) is the distance between the first iris lens contact point and the second iris lens contact point. FIG. 11 is a B-scan of half of the anterior segment showing the location of the right and left ILCD. e. Determine the minimum distance from the anterior lens surface to the posterior cornea surface (“ACD”). This is illustrated in FIG. 10A which is a B-scan of the anterior segment illustrating the ACD and ILCD measurements. Locate the Root of the Iris 8. Now look for the left iris root (a first region of interest) a. On the left, create a region of interest near where the sclera and iris meet. This binarized ROI is illustrated in FIG. 6A. b. Start at the right side of the region of interest and move to the left until black pixels are encountered c. Invert the polarity of the image (black vs. white). This image is illustrated in FIG. 9 which shows the inverted binarized image of the root of the iris. d. Find the leftmost white point shown in FIG. 9 which is the root of the iris. e. Repeat step 8 for iris root on the right side. Locate the Root of the Ciliary Sulcus 9. Now look for the left and right ciliary sulcus roots (a second region of interest). This is the same procedure as finding the left and right roots of the iris a. On the left, create a region of interest near the iris root b. Start at the right side of the region of interest and move to the left until black pixels are encountered c. Invert the polarity of the image (black vs. white) d. Find the leftmost white point which is the root of the ciliary sulcus e. Repeat step 9 for ciliary sulcus root on the right side Isolate the Sclera A limbus-parallel ring of fibers forms the inner surface of the sclera at the junction of the scleral and corneal curvatures and projects inward to inter digitate with the tendon fibers of the meridional ciliary muscle. The sessile group of limbus-parallel fibers of the sclera is called the scleral roll and the inward-projecting group of limbus-parallel fibers is the scleral spur. The scleral roll thus forms the posterior wall of the canal of Schlemm and the roll and spur together form the posterior wall of the internal scleral sulcus. The spur extends inward from the inner sclera toward the axis of the eye for about 0.09 mm. The scleral roll lies at the junction of the scleral curvature with the corneal curvature and the scleral spur lies between the meridional portion of the ciliary muscle and the trabecular mesh. 10. From the left and right side binarized images, create a binarized region of interest near the iris root. This binarized ROI is illustrated in FIG. 6A. 11. For left and right sides, further isolate the sclera from the cornea, ciliary process and iris by increasing the threshold until the sclera is separated from the other objects 12. For left and right, completely isolate sclera by deleting all objects except the sclera 13. Smooth the boundary of the isolated sclera. The isolating and smoothing steps are illustrated in FIGS. 7A and 8. Locate the Scleral Spur The curve formed by the interface between the lighter sclera and darker ciliary muscle is referred to herein as the “interface curve”. A line projected from a point on the interface curve at the local slope is referred to herein as a “scleral slope line”. The protruding structure located at the intersection of the interface curve and the curve formed by the posterior of the cornea is referred to herein as “the bump”. These features are illustrated in FIGS. 22, 23, and 24A. FIG. 22 illustrates geometric structures used in detecting the scleral spur. The cornea 2201, the iris 2202, the lens 2203, the sclera 2204 and the ciliary body 2205 are the main components shown. The ciliary body 2205 includes the ciliary muscle 2209. The ciliary sulcus 2211 is shown between the iris 2202 and the ciliary body 2205. Schlemm's canal 2207 is also shown for reference. The interface curve 2210 is formed by the interface between the sclera 2204 and the ciliary muscle 2209. Interface curve 2210 intersects Schwalbe line 2212 and this intersection is called the bump 2208. FIG. 23 is a close-up of geometric structures used in detecting the scleral spur. This figure includes the sclera 2304 and the ciliary body 2305, the ciliary muscle 2309 (shaded). The ciliary sulcus 2311 is shown below the iris. Schlemm's canal 2311 is also shown for reference. The interface curve 2310 is formed by the interface between the sclera 2304 and the ciliary muscle 2309. Interface curve 2310 intersects Schwalbe line 2312 and this intersection is called the bump 2308. FIG. 24A further illustrates the interface line between the sclera and ciliary muscles. FIG. 24a is a B-scan of the region and FIG. 24b is a line drawing showing the various features of interest. The interface line as shown in FIG. 24a is shown as a boundary between the lighter sclera and the darker ciliary muscle. The methods of locating the scleral spur used herein include: 1. Method 1 referred to as the Ciliary Muscle method (CM method) 2. Method 2 referred to as the first variation of the Bump method (BM1 method) 3. Method 3 referred to as the second variation of the Bump method (BM2 method) 4. Method 4 referred to as the third variation of the Bump method (BM3 method) There is also another method known as the Schwalbe Line Method but it is not used in this disclosure. A general description of these methods can be found in “The Effect of Scleral Spur Identification Methods on Structural Measurements by Anterior Segment Optical Coherence Tomography” Seager, Wang, Arora, Quigley, Journal of Glaucoma, Vol. 23, No 1, January 2014, which is incorporated herein by reference. 14. Now look for the scleral spur on the binarized isolated sclera object Method 1: the Ciliary Muscle method comprises projecting the curve formed by the interface between the sclera and ciliary muscle (referred to herein as the interface curve—see FIG. 24A) to where it intersects the curve formed by the posterior of the cornea (also known as the Schwalbe Line). The scleral spur is at the intersection of these two curves. To find this intersection point, determine the local slope (computed as a moving average) along the interface curve between the lighter sclera and the darker ciliary muscle and, while moving toward the iris (left to right as shown in FIG. 1), find the minimum slope or apex of the bump (the inflection point where the slope changes from decreasing to increasing). Identify this point as a possible first scleral spur. The local slope is computed as a moving average because of the unevenness of the interface curve on the scale of the resolution of a precision arc scanning device (about 25 microns range resolution and about 40 microns lateral resolution). Method 2: starting at a point on the interface curve about 1 mm to the left of the first scleral spur found by Method 1, form a line from this point to a point on the Schwalbe curve about 1 mm to the right of the scleral spur found by Method 1. Call this the first “scleral slope line”. Slide a perpendicular to this scleral slope line along the scleral slope line. For each perpendicular, measure the distance from the first scleral slope line to the interface curve. The maximum distance recorded will be the apex of the bump. Identify this point as a possible second scleral spur. Method 3: determine a second scleral slope line by starting at a point on the interface curve about 2 mm to the left of the first scleral spur found by Method 1, form a line from this point to the rightmost point used in Method 1. Call this the second “scleral slope line”. Slide a perpendicular to this second scleral slope line along the second scleral slope line. For each perpendicular, measure the distance from the second scleral slope line to the interface curve. The maximum distance recorded will be the apex of the bump. Identify this point as a possible third scleral spur. Method 4: starting with a horizontal line anchored at the leftmost point used in Method 3, rotate this horizontal line about this left most point in a counterclockwise direction until it intersects the posterior side of the interface curve between the sclera and ciliary muscle and identify that point as a possible fourth scleral spur. Schwalbe's line is formed by the posterior surface of the eye's cornea. The Schwalbe Line Method was not used in the method described in this disclosure. 15. Determine the best prediction of the scleral spur location by comparing the locations of the potential spurs determined using the four methods above, considering proximity to each other, and proximity to the iris root. Calculate a score or confidence factor based on those factors. 16. Repeat steps 17-23 using a shortened ROI. Compare the confidence factors of spurs found by both the shortened sclera and the longer one and use the point with the best confidence factor. The results of locating the potential scleral spurs are illustrated in FIGS. 19A and 20. Examples of a final determination of the location of the spurs can be seen in FIGS. 12A, 13, and 18A. Determine Measurements Referenced to the Scleral Spur and or Sulcus Points FIG. 12A is a B-scan of half of the anterior segment showing the location of features to be measured. FIG. 13 is a B-scan of the whole anterior segment showing the location of features to be measured. FIG. 14 shows a binarized smoothed image of the scleral region of interest with cross hatching to indicate the TISA areas. FIG. 15A shows the inverted binarized TISA area object used for measuring the TISA area. FIG. 16 shows the binarized region of interest for isolating the root of the iris. FIG. 17 shows the binarized image of the isolated iris. FIG. 18A shows the point of intersection of the iris root and sclera, along with potential points of the scleral spur detected with shortened isolated sclera object. FIG. 19A shows the point of intersection of the iris root and sclera, along with potential points of the scleral spur detected with a longer isolated sclera. FIG. 25A illustrates various measurements that can be made using ultrasound technology. FIG. 25a illustrates the iridocorneal angle or simply “angle”. FIG. 25b shows the other measurements which are made with reference to the location of the scleral spur. The measurements of ICPD, IZD, ILCD, ID1, ID2 and ID3 all require ultrasound technology to be imaged and require precision ultrasound technology to be measured with accuracy and reproducibility. FIG. 21 illustrates another measurement of the iris zonule distance IZD. 17. Once the scleral spur has been located, then the other measurements can be made. These are: a. Scleral Thickness (ST) is the thickness from the scleral spur to the anterior surface of the sclera, along a line perpendicular to anterior surface of the sclera. b. Angle-opening distance AODn μm is the distance from cornea to iris at nμm from the scleral spur, along the scleral wall (n typically=250, 500 and 750) c. Trabecular-iris contact length TICL μm is the linear distance of contact between iris and cornea/sclera beginning at scleral spur d. Angle-recess area ARAn μm2 is the area of triangle between angle recess and iris and cornea nμm from scleral spur (n typically 250, 500 and 750) e. Trabecular-iris space TISA μm2 is the area of trapezoid between iris and cornea from sclera to nμm (n typically 250, 500 and 750). Images showing the TISA are illustrated in FIGS. 14 and 15A. f. Trabecular-iris angle TIA Degrees is the angle formed from angle recess to points 500 μm from scleral spur on trabecular meshwork and perpendicular on surface of iris g. Trabecular-ciliary process distance TCPD μm is measured from point on endothelium 500 μm from scleral spur through iris to ciliary process (not implemented yet, but on our radar) h. Iris-zonular distance IZD μm is the distance from posterior iris surface to first visible zonule at point closest to ciliary body (not implemented yet, but on our radar) i. Iris Thickness (IT) is the thickness of the iris. The IT500 thickness is measured along a line perpendicular to the iris axis that intersects the AOD500 point along the sclera. The IT2 mm thickness is measured with a line parallel to the IT500 line, 2 mm from the iris root, and the IT3 thickness is measured with lines parallel to the IT500 line at the thickest point of the iris. The iris thickness is determined by creating a binarized region of interest including the iris (illustrated in FIGS. 12A and 20), isolating the iris object by increasing the threshold (illustrated in FIG. 17), and making the measurements based on the previously found scleral spur and AOD500 point. j. Scleral spur-iris insertion distance SS-IR is the linear distance from scleral spur to iris insertion k. Iris radius of curvature IRC mm is the radius of posterior iris surface using an arc transecting three points: iris root, pupil margin and point of maximal iris displacement l. Iris convexity IC mm is the maximum distance from the posterior surface of the iris to the line from posterior iris at pupillary margin to the iris root m. Iris-lens contact distance ILCD mm is the length of contact between surfaces of lens and iris n. Anterior-posterior chamber depth ACD/PCD is the ratio of anterior chamber to posterior chamber depth measured 1 mm from the scleral spur. Prepare an Automated Report 18. Some of the measurements described above are shown in FIGS. 13, 14, and 22 on a typical output report format with the original B-scan as a background is shown in FIG. 20. Based on the paper “Ultrasound Biomicroscopy in Plateau Iris Syndrome” by Pavlin, Ritch and Foster, which is incorporated herein by reference, another measurement called the iris to zonule distance (IZD) may also be made by the methods described in the present disclosure. The IZD measurement is illustrated in FIG. 21. FIG. 22 illustrates geometric structures used in detecting the scleral spur. The curve 2210 formed by the interface between the lighter sclera 2204 and darker ciliary muscle 2209 is referred to herein as the “interface curve”. The protruding structure 2208 located at the intersection of the interface curve 2210 and the curve formed by the posterior of the cornea 2201 is referred to herein as “the bump”. FIG. 22 also shows the natural lens 2203 and the zonules 2206 that attach lens 2203 to the ciliary body 2205. Also shown is Schlemm's canal 2207 and the ciliary sulcus 2211 formed at the junction of the ciliary body 2205 and the iris 2202. FIG. 23 is a close-up of geometric structures used in detecting the scleral spur. The curve 2310 formed by the interface between the lighter sclera 2304 and darker ciliary muscle 2309 is interface curve. The protruding structure 2308 located at the intersection of the interface curve 2210 and the curve formed by the posterior of the cornea 2301 is referred to herein as “the bump”. FIG. 23 also shows the zonules 2306 that attach lens to the ciliary body 2305. Also shown is Schlemm's canal 2307 and the ciliary sulcus 2311 formed at the junction of the ciliary body 2305 and the iris. A number of variations and modifications of the inventions can be used. As will be appreciated, it would be possible to provide for some features of the inventions without providing others. The present disclosure, in various embodiments, includes components, methods, processes, systems and/or apparatus substantially as depicted and described herein, including various embodiments, sub-combinations, and subsets thereof. Those of skill in the art will understand how to make and use the present disclosure after understanding the present disclosure. The present disclosure, in various embodiments, includes providing devices and processes in the absence of items not depicted and/or described herein or in various embodiments hereof, including in the absence of such items as may have been used in previous devices or processes, for example for improving performance, achieving ease and\or reducing cost of implementation. The foregoing discussion of the disclosure has been presented for purposes of illustration and description. The foregoing is not intended to limit the disclosure to the form or forms disclosed herein. In the foregoing Detailed Description for example, various features of the disclosure are grouped together in one or more embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed disclosure requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the following claims are hereby incorporated into this Detailed Description, with each claim standing on its own as a separate preferred embodiment of the disclosure. Moreover though the description of the disclosure has included description of one or more embodiments and certain variations and modifications, other variations and modifications are within the scope of the disclosure, e.g., as may be within the skill and knowledge of those in the art, after understanding the present disclosure. It is intended to obtain rights which include alternative embodiments to the extent permitted, including alternate, interchangeable and/or equivalent structures, functions, ranges or steps to those claimed, whether or not such alternate, interchangeable and/or equivalent structures, functions, ranges or steps are disclosed herein, and without intending to publicly dedicate any patentable subject matter. What is claimed: 1. A method for detecting a scleral spur in an eye of a patient, comprising: providing an ultrasound device having (i) a scan head with an arcuate guide track and a carriage movable along the arcuate guide track; (ii) an eyepiece configured to maintain the eye of the patient in a fixed location with respect to the arcuate guide track; and (iii) a transducer connected to the carriage; emitting, from the transducer, ultrasound pulses as the carriage moves along the arcuate guide track; storing received ultrasound pulses on a non-transitory computer readable medium; forming, by at least one electronic device, a B-Scan of the eye of the patient based on the received ultrasound pulses; binarizing, by the at least one electronic device, the B-Scan from a grayscale color palette to a black/white color palette; determining, by the at least one electronic device, an average surface of a sclera of the eye; and locating, by the at least one electronic device, a bump of the average surface of the sclera that corresponds to the scleral spur. 2. The method of claim 1, further comprising: smoothing, by the at least one electronic device, the average surface of the sclera by deleting discrete areas on both sides of the average surface. 3. The method of claim 2, further comprising: locating, by the at least one electronic device, the bump of the average surface of the sclera by identifying an inflection point of a slope of a posterior side of a pigment epithelium of a pupil dilator muscle. 4. The method of claim 1, further comprising: determining, by the at least one electronic device, an angle-opening distance from a cornea to an iris of the eye at a predetermined distance from the scleral spur. 5. The method of claim 1, further comprising: beginning on a left side of a region of interest and moving right until a black discrete area; inverting, by the at least one electronic device, the black/white color palate; and locating, by the at least one electronic device, the leftmost white discrete area, which corresponds to a point of interest. 6. The method of claim 5, wherein the point of interest is at least one of a root of an iris of the eye or a root of a ciliary sulcus of the eye. 7. The method of claim 1, further comprising: determining, by the at least one electronic device, an iris-lens contact distance between a surface of an iris of the eye and a surface of a lens of the eye. 8. A system for detecting a scleral spur in an eye of a patient, comprising: an ultrasound device, having: a scan head having an arcuate guide track and a carriage movable along the arcuate guide track; an eyepiece configured to maintain the eye of the patient in a fixed location with respect to the arcuate guide track; a transducer connected to the carriage, wherein ultrasound pulses are emitted into the eye of the patient, and received ultrasound pulses are stored on a non-transitory computer readable medium; at least one electronic device having the non-transitory readable medium and having instructions that, when executed, cause the at least one electronic device to: form a B-Scan of the eye of the patient based on the received ultrasound pulses; binarize the B-Scan from a grayscale color palette to a black/white color palette; determine an average surface of a sclera of the eye; and locate a bump of the average surface of the sclera that corresponds to the scleral spur. 9. The system of claim 8, further comprising: instructions that, when executed, cause the at least one electronic device to: smooth the average surface of the sclera by deleting discrete areas on both sides of the average surface. 10. The system of claim 9, further comprising: instructions that, when executed, cause the at least one electronic device to: locate the bump of the average surface of the sclera by identifying an inflection point of a slope of a posterior side of a pigment epithelium of a pupil dilator muscle. 11. The system of claim 8, further comprising: instructions that, when executed, cause the at least one electronic device to: determine an angle-opening distance from a cornea to an iris of the eye at a predetermined distance from the scleral spur. 12. The system of claim 8, further comprising: instructions that, when executed, cause the at least one electronic device to: begin on a left side of a region of interest and move right until a black discrete area; invert the black/white color palate; and locate the leftmost white discrete area, which corresponds to a point of interest. 13. The system of claim 12, wherein the point of interest is at least one of a root of an iris of the eye or a root of a ciliary sulcus of the eye. 14. The system of claim 12, further comprising: instructions that, when executed, cause the at least one electronic device to: determine an iris-lens contact distance between a surface of an iris of the eye and a surface of a lens of the eye. 15. A system for binarizing a B-Scan of an eye of a patient, comprising: an ultrasound device, having: a scan head having an arcuate guide track and a carriage movable along the arcuate guide track; an eyepiece configured to maintain the eye of the patient in a fixed location with respect to the arcuate guide track; a transducer connected to the carriage, wherein ultrasound pulses are emitted into the eye of the patient, and received ultrasound pulses are stored on a non-transitory computer readable medium; at least one electronic device having the non-transitory readable medium and having instructions that, when executed, cause the at least one electronic device to: form a B-Scan of the eye of the patient based on the received ultrasound pulses; determine an average intensity of a grayscale color palette of the B-Scan of the eye; binarize the B-Scan of the eye from the grayscale color palette to a black/white color palette, wherein discrete areas of the B-Scan above a predetermined intensity are binarized to white and discrete areas of the B-Scan below the predetermined intensity are binarized to black, and the predetermined intensity depends on the average intensity. 16. The system of claim 15, wherein the predetermined intensity is greater than the average intensity. 17. The system of claim 15, further comprising: instructions that, when executed, cause the at least one electronic device to: determine an average surface of a sclera of the eye; and locate a bump of the average surface of the sclera that corresponds to the scleral spur. 18. The system of claim 15, where a discrete area is a pixel and the B-Scan is a rasterized image. 19. The system of claim 17, further comprising: instructions that, when executed, cause the at least one electronic device to: smooth the average surface of the sclera by deleting discrete areas on both sides of the average surface. 20. The system of claim 19, further comprising: instructions that, when executed, cause the at least one electronic device to: locate the bump of the average surface of the sclera by identifying an inflection point of a slope of a posterior side of a pigment epithelium of a pupil dilator muscle.

2019-05-24

en

2020-01-16

US-48576002-A

Process for the production of an immunosuppressant ABSTRACT In one aspect, the present invention provides a process for producing a sodium salt of an immunosupressant of Formula I PRIORITY CLAIM The present application claims the benefit under 35 U.S.C. § 371 of International Application No.: PCT/IN02/00178, filed Aug. 28, 2002, the entire contents of this application is hereby incorporated herein by reference. FIELD OF THE INVENTION In one aspect, the present invention provides a method for producing a sodium salt of a compound of Formula I BACKGROUND OF THE INVENTION Mycophenolic acid is an immunosuppressive agent that inhibits de novo purine nucleotide synthesis via inhibition of IMP dehydrogenase and prevents the formation of XMP and GMP. Mycophenolic acid sodium salt or ERL 080 has been widely discussed in available patent and non-patent literature, for its use in treatment of diseases and in transplantation. The use of Mycophenolalic acid sodium salt in the treatment of hyperuricaemia has been reported in U.S. Pat. No. 3,705,946. U.S. Pat. No. 6,025,391 describes an enteric coating composition, containing HPMC phthalate and triacetin prepared for capsules containing monosodium mycophenolate, and adapted to release mycophenolate in the upper part of the intestinal tract. The tolerability profile of sodium mycophenolate and mycophenolate mofetil with and without cyclosporin has been discussed in Toxicology 157(2001) 207-215. The Journal Acta Crystallographica, Section C: Crystal Structure Communications (2000), C56(4), 432-433, discusses a crystal stucture of sodium mycophenolate. SUMMARY OF THE INVENTION In one aspect, the present invention discloses a process for the manufacture of the sodium salt of a compound of Formula I comprising reacting the compound of Formula I with an aqueous solution of sodium hydroxide, sodium carbonate or sodium bicarbonate, or a C2 to C10 carboxylic acid sodium salt. In one embodiment, the compound of Formula I is reacted with sodium acetate, sodium 2-ethyl hexanoate or sodium caprylate. In another aspect, the present invention provides a process for the manufacture of a sodium salt of a compound of Formula I comprising converting the compound of Formula I to its ammonium or dibenzamide form and reacting it with an aqueous solution of sodium hydroxide or a C2 to C10 carboxylic acid sodium salt. In one embodiment, the C2-C10 carboxylic acid sodium salt is sodium acetate, sodium 2-ethyl hexanoate or sodium caprylate. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION In one aspect, the present invention describes a process of manufacturing a sodium salt of a compound of Formula I by reacting the compound of Formula I with an aqueous solution of sodium hydroxide, sodium hydroxide derivatives, or a C2 to C10 carboxylic acid sodium salt. In another aspect, the compound of Formula I may be converted to an ammonium salt or a dibenzyl amide salt before it is converted to the corresponding sodium salt. In one embodiment, the compound of Formula I is converted to its ammonium salt by treatment with ammonia. In another embodiment, a dibenzyl amide form of the compound of Formula I is obtained by reaction with dibenzyl amine. In other embodiments, the C2 to C10 carboxylic acid sodium salt is selected from the group consisting of sodium acetate, sodium 2-ethyl hexanoate and sodium caprylate. In certain other embodiments, the sodium hydroxide derivatives are selected from the group consisting of Na2CO3 and NaHCO3. In certain embodiments, the invention provides a process for the manufacture of the sodium salt of a compound of Formula I: comprising reacting the compound of formula I with an aqueous solution of sodium hydroxide, sodium carbonate or sodium bicarbonate, or a C2 to C10 carboxylic acid sodium salt. Exemplary C2-C10 carboxylic acid sodium salts include sodium acetate, sodium 2-ethyl hexanoate and sodium caprylate. In a further aspect, a compound of Formula I may be converted to its ammonium salt by reacting it with ammonia. The resulting ammonium salt may be reacted with an aqueous solution of sodium hydroxide, sodium acetate, sodium 2-ethyl hexanoate or sodium caprylate to form the corresponding sodium salt. Alternatively, the compound of Formula I may be converted to its dibenzamide form by reaction with dibenzylamine. Subsequent reaction with an aqueous solution of sodium hydroxide, sodium acetate, sodium 2-ethyl hexanoate or sodium caprylate leads to the formation of the sodium salt of the I corresponding sodium salt. The following Examples further illustrate the invention, with the understanding that the invention is not intended to be limited by the details disclosed therein. EXAMPLE 1 13.5 g of sodium hydroxide is dissolved in 75 ml of methanol. 100 g of micophenolic acid was added, and the resulting solution was stirred for half an hour at room temperature (RT). The reaction mixture was chilled to 10° C. and the solid was filtered. The solid was washed with 50 ml acetone and dried under vacuum at 40 to 50° C. A final yield 90% (95 g) was observed. EXAMPLE 2 To a solution of 10 g of sodium acetate in 55 ml of methanol, 74 g of micophenolic acid was added and the resulting solution was stirred for half an hour at RT. The reaction mixture was chilled to 10° C. and the solid was filtered. The solid was washed with 50 ml acetone and dried under vacuum at 40 to 50° C. A final yield 90% (95 g) was observed. EXAMPLE 3 Dicyclohexyl amine was added to a slurry of mycophenolic acid (25 g) in methanol, and the resulting mixture was stirred at RT. The precipitated solid was treated with aqueous sodium hydroxide solution under stirring at RT. The reaction mixture was cooled to −10° C. and the precipitated solid was filtered and dried. 1. A process of manufacturing a sodium salt of a the compound of Formula comprising reacting the compound of Formula I with a C2 to C10 carboxilic carboxylic acid sodium salt. 2. The process of claim 1, wherein the compound of Formula is converted to an ammonium salt or a dibenzyl amide salt before converting it is converted to the sodium salt. 3. The process of claim 2, wherein the compound of Formula I is converted to its ammonium salt by treatment with ammonia. 4. The process of claim 2, wherein the compound of Formula I is converted to its dibenzyl amide form by reaction with dibenzyl amine. 5. The process of claim 1, wherein the of C2 to C10 carboxylic acid sodium salt is selected from the group consisting of sodium acetate, sodium 2-ethyl hexanoate and sodium caprylate.

2002-08-29

en

2005-07-28

US-201013055170-A

Self-timed rs-trigger with the enhanced noise immunity ABSTRACT The invention describes self-timed RS-trigger with the enhanced noise immunity. Declared effect is achieved due to that circuit containing storage unit ( 1 ), indication unit ( 2 ), paraphase data input ( 3, 4 ), paraphase data output ( 5, 6 ), and indication output ( 7 ), is modified by adding two inverters ( 8, 9 ) and preindication unit ( 10 ). Inverters increase output capability of the trigger&#39;s paraphase data output and provide an electric isolation of the outputs of the storage unit from an external environment that leads to increasing immunity of the data stored in the trigger to influence of noises at signal wires. The preindication unit provides the trigger&#39;s indicatability. Self-timed RS-trigger with the enhanced noise immunity relates to pulse and computational technique and may be used for designing self-timed trigger, register and computational units, as well as in digital signal processing systems. BACKGROUND OF THE INVENTION There is known trigger [1] comprising two elements OR—NO. Detriment of this trigger is an absence of means of transition termination indication. The closest to the proposed solution by technical nature and accepted as a prior art prototype is the self-timed trigger [2] comprising storage unit, indication element, paraphase data input, write enable input (request input), reset input, first and second components of paraphase data output and indication output. Detriment of the prior art prototype is its low noise immunity is due to its data output is formed directly by bistable cell storing trigger's state, is characterized by low output capability and is influenced by noise in signal lines of trigger's environment, which may lead to an unauthorized change of bistable cell's state. SUMMARY OF THE INVENTION A problem to be solved by the invention consists in enhancing noise immunity of the trigger. This effect is achieved due to that self-timed RS-trigger comprising storage unit, indication unit, first and second components of paraphase data input, first and second components of paraphase data output and indication output, and first and second components of the paraphase data input are connected to first and second inputs of the storage unit accordingly, first component of the trigger's paraphase data output is connected to first input of the indication unit, second component of the trigger's paraphase data output is connected to second input of the indication unit, the trigger's indication output is connected to an output of the indication unit, two inverters and a preindication unit are added, first and second inputs of the preindication unit are connected to first and second components of the paraphase data input accordingly, an input of first inverter is connected to first output of the storage unit, an output of first inverter is connected to first component of the trigger's paraphase data output and to third input of the preindication unit, an input of second inverter is connected to second output of the storage unit, an output of second inverter is connected to second component of the trigger's paraphase data output and to fourth input of the preindication unit, first and second outputs of the preindication unit are connected to third and fourth inputs of the indication unit accordingly, a paraphase input with spacer (dual-rail signal) is used as the data input. The proposed device satisfies the inventive step patentability condition. Although usage of inverters in synchronous triggers is known, however, using them in the self-timed RS-trigger together with the preindication unit, with taking into account the work specificity of the self-timed circuits and to preservation of the trigger's indicatability (observability), has provided obtaining a result expressed by the effect of invention. Essential difference of the proposed realization of the RS-trigger from similar prior art solutions in self-timed circuitry consists in the decision of a problem of preservation of the trigger's indicatability (the guaranteed tracing of the moments of the termination of all transients at switching trigger from one state into another one) after adding inverters at its paraphase data output. With added inverters RS-trigger remains to belong to class of circuits which behavior is insensitive to gate delays. Exact technical implementations of the proposed solution are described below. So far as added construction connections do not known in analogous technical solutions, this trigger may be considered as having the inventive step. Term “paraphase” as used therein is defined as follows. Paraphase signal is that presented by two components, namely, by a pair of variables which in a static state have inter inverted states. As a result, in a static state such signal [X, XB] can have one of two working states: [X=0, XB=1] or [X=1, XB=0]. Transition of a paraphase signal from one static working state into an opposite one can be carried out by two ways. First way assumes using of a paraphase signal with spacer: when transition into next static working state is necessarily preceded by transition through third static state—spacer (a non-working state or passive state). If the state [1,1] is used as a spacer, then a paraphase signal is said to be the paraphase signal with unit spacer, and if a state [0,0] is used as a spacer, then a paraphase signal is said to be the paraphase signal with zero spacer. Spacer state is the static state that should be controlled in self-timed circuitry by the indicator of transient process termination, in this case—the termination of the transient into spacer state. Second way assumes using of a paraphase signal without spacer (or simply a paraphase signal). Thus transition from one static working state into another one is carried out through a dynamic (temporary) state: [1,1] or [0,0],—named a transit state. In this invention, a paraphase signal with spacer is used as an data input signal of the RS-trigger in variants without write enable input and a paraphase signal without spacer is used in variants where there is write enable input, and the data output of the RS-trigger is a paraphase signal without spacer. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 presents a circuit of the self-timed RS-latch with the enhanced noise immunity. FIG. 2 demonstrates a circuit of the self-timed RS-flip-flop with the enhanced noise immunity. FIG. 3 presents a circuit of the indication unit for all types of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer, and for all types of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer. FIG. 4 demonstrates a circuit of the indication unit for all types of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer, and for all types of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer. FIG. 5 shows a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer. FIG. 6 presents a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer. FIG. 7 demonstrates a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer. FIG. 8 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer. FIG. 9 demonstrates a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer. FIG. 10 shows a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer. FIG. 11 presents a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer. FIG. 12 demonstrates a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer. FIG. 13 presents a circuit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input and self-timed preset input (reset or set terminal). FIG. 14 demonstrates a circuit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input and self-timed preset input (reset or set terminal). FIG. 15 shows a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer and preset input. FIG. 16 presents a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer and preset input. FIG. 17 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer and synchronous preset input. FIG. 18 demonstrates a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer and synchronous preset input. FIG. 19 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer and self-timed preset input. FIG. 20 demonstrates a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer and self-timed preset input. FIG. 21 shows a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer and self-timed preset input. FIG. 22 presents a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer and self-timed preset input. FIG. 23 shows a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer and self-timed preset input. FIG. 24 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer and self-timed preset input. FIG. 25 shows a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer. FIG. 26 presents a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer. FIG. 27 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer. FIG. 28 presents a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer. FIG. 29 shows a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer. FIG. 30 presents a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer. FIG. 31 shows a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer. FIG. 32 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer. FIG. 33 presents a circuit of the self-timed RS-latch with the enhanced noise immunity having write enable input and self-timed preset input (reset or set terminal). FIG. 34 shows a circuit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input and self-timed preset input (reset or set terminal). FIG. 35 presents a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer and preset input. FIG. 36 presents a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer and preset input. FIG. 37 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer and synchronous preset input. FIG. 38 presents a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and synchronous preset input. FIG. 39 shows a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer and self-timed preset input. FIG. 40 presents a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input. FIG. 41 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer and self-timed preset input. FIG. 42 presents a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input. FIG. 43 shows a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input. FIG. 44 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer and self-timed preset input. FIG. 45 demonstrates a realization of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer corresponding to the circuit in FIG. 1. FIG. 46 shows a realization of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input corresponding to the circuit in FIG. 34. FIG. 47 presents a circuit for analysis of self-timing ability of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer. FIG. 48 demonstrates a signal graph of operation for the self-timed RS-flip-flop in FIG. 47. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT A circuit of the self-timed RS-latch with the enhanced noise immunity is shown in FIG. 1. The circuit consists of storage unit 1, indication unit 2, first 3 and second 4 components of paraphase data input, first 5 and second 6 components of paraphase data output, indication output 7, first 8 and second 9 inverters, preindication unit 10, first component 3 of the paraphase data input is connected to first input I1 of the storage unit 1 and to first input X1 of the preindication unit 10, second component 4 of the paraphase data input is connected to second input I2 of the storage unit 1 and to second input X2 of the preindication unit 10, first output Q1 of the storage unit 1 is connected to an input of first inverter 8 whose output is connected to third input X3 of the preindication unit 10, to first input K1 of the indication unit 2 and to first component 5 of the paraphase data output of the trigger, second output Q2 of the storage unit 1 is connected to an input of second inverter 9 whose output is connected to fourth input X4 of the preindication unit 10, to second input K2 of the indication unit 2 and to second component 6 of the paraphase data output of the trigger, first Y1 and second Y2 outputs of the preindication unit 10 are connected to third K3 and to fourth K4 inputs of the indication unit 2 accordingly, output O of the indication unit 2 is connected to the indication output 7 of the trigger. Circuit operates as follows. Applying the working state at data input leads to writing new state into the storage unit 1 which through inverters 8 and 9 is propagated to first 5 and second 6 components of the paraphase data output of the trigger. The termination of writing new state into the trigger or its transition into a storage phase is controlled by the units of preindication 10 and indication 2. They analyze an accordance of states at the output of inverters 8-9 and paraphase input I1-I2 of the storage unit 1, to the corresponding value of the indication output 7 of the trigger. An explicit spacer value (00 or 11) of the data input 3-4 definitely corresponds to basis of realization of the trigger. The peculiarities of this circuit comparing to prior art prototype are the following. Trigger has inverters forming components of the paraphase data output. They increase output capability of the trigger's paraphase data output and provide an electric isolation of outputs of the storage unit from an external environment that leads to increasing immunity of the data stored in the trigger to an influence of noises at signal wires of a total circuit. Thus, proposed trigger provides enhanced both output capability and noise immunity. The effect of invention is achieved. The particular technical realization of the proposed self-timed RS-latch and its internal units depends on type of spacer state of the paraphase input: high or low level at both components of the paraphase data input provides keeping trigger's state. It influences the basis of realization of the storage and indication units and determines the specification of first and second component of the paraphase data input with spacer as well as the specification of first and second component of the paraphase data output of the trigger as it is described below. FIG. 2 demonstrates a circuit of the self-timed RS-flip-flop with the enhanced noise immunity. It differs from the circuit in FIG. 1 by that the storage unit 1 has two additional outputs U1, U2, being the outputs of first bistable cell of the storage unit 1, which are connected to fifth X5 and sixth X6 inputs of the preindication unit 10 accordingly. The circuit of the self-timed RS-flip-flop operates as follows. Applying the working state at data input leads to writing new state into first bistable cell of the storage unit 1 with outputs U1, U2. Thus the state of outputs [Q1, Q2] of the storage unit 1 and accordingly the trigger's paraphase output 5, 6 do not change. The termination of transitions of the trigger's elements is reflected by an output of the indication unit 2. After applying spacer state at the input 3, 4 the state of first bistable cell of the storage unit 1 is transferred into its second bistable cell and through inverters 8 and 9 is propagated to the trigger's paraphase output 5, 6. Upon termination of transition of all trigger's elements the indication unit 2 and accordingly the indication output 7 of the trigger are switched to an opposite state (inverse with respect to the original state, corresponding to a storage phase in first bistable cell of the storage unit 1). FIG. 3 presents a circuit of the indication unit for all types of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer, and for all types of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer. It consists of OR-AND-NO element 11, whose first and second inputs of first OR input group are connected to first K1 and third K3 inputs of the indication unit accordingly, first and second inputs of second OR input group of OR-AND-NO element are connected to second K2 and fourth K4 inputs of the indication unit accordingly, an output of OR-AND-NO element is connected to the output O of the indication unit. FIG. 4 demonstrates a circuit of the indication unit for all types of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer, and for all types of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer. It consists of AND-OR—NO element 12, whose first and second inputs of first AND input group are connected to first K1 and third K3 inputs of the indication unit respectively, first and second inputs of second AND input group are connected to second K2 and fourth K4 inputs of the indication unit respectively, an output of AND-OR—NO element 12 is connected to the output O of the indication unit. FIG. 5 shows a circuit of the preindication unit 10 of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer. It consists of two AND-NO elements 13-14, first and second inputs of first AND-NO element 13 are connected to first X1 and third X3 inputs of the preindication unit 10 respectively, first and second inputs of second AND-NO element 14 are connected to second X2 and fourth X4 inputs of the preindication unit 10 respectively, outputs of second 14 and first 13 AND-NO elements are connected to first Y1 and second Y2 outputs of the preindication unit 10 accordingly. FIG. 6 presents a circuit of the preindication unit 10 of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer. It consists of two OR—NO elements 15-16, first and second inputs of first OR—NO element 15 are connected to first X1 and third X3 inputs of the preindication unit 10 respectively, first and second inputs of second OR—NO element 16 are connected to second X2 and fourth X4 inputs of the preindication unit 10 respectively, outputs of second 16 and first 15 OR—NO elements are connected to first Y1 and second Y2 outputs of the preindication unit 10 accordingly. FIG. 7 demonstrates a circuit of the preindication unit 10 of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer. It consists of two OR—NO elements 17-18, first, second and third inputs of first OR—NO element 17 are connected to first X1, third X3 and fifth X5 inputs of the preindication unit 10 respectively, first, second and third inputs of second OR—NO element 18 are connected to second X2, fourth X4 and sixth X6 inputs of the preindication unit 10 respectively, outputs of second 18 and first 17 OR—NO elements are connected to first Y1 and second Y2 outputs of the preindication unit 10 accordingly. FIG. 8 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer. It consists of two AND-NO elements 19-20, first, second and third inputs of first AND-NO element 19 are connected to first X1, third X3 and fifth X5 inputs of the preindication unit 10 respectively, first, second and third inputs of second AND-NO element 20 are connected to second X2, fourth X4 and sixth X6 inputs of the preindication unit 10 respectively, outputs of second 20 and first 19 AND-NO elements are connected to first Y1 and second Y2 outputs of the preindication unit 10 accordingly. Traditionally a storage unit of the self-timed RS-latches is realized by one bistable cell, whose outputs are the outputs both of the storage unit and the trigger. Examples of realization of the storage unit of the RS-latch with a paraphase data input with unit and zero spacer are shown in FIGS. 9 and 10 accordingly. They are identical to the RS-trigger circuits in FIG. 2.2( a) and FIG. 2.2 (6) in [3]. The circuit of the storage unit 1 of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer (FIG. 9) consists of two AND-NO elements 21-22, first and second inputs of first AND-NO element 21 are connected to first input I1 and second output Q2 of the storage unit respectively, first and second inputs of second AND-NO element 22 are connected to first output Q1 and second input I2 of the storage unit respectively, outputs of first 21 and second 22 AND-NO elements are connected to first Q1 and second Q2 outputs of the storage unit accordingly. The circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer (FIG. 10) consists of two OR—NO elements 23-24, first and second inputs of first OR—NO element 23 are connected to first input I1 and second output Q2 of the storage unit respectively, first and second inputs of second OR—NO element 24 are connected to first output Q1 and second input I2 of the storage unit respectively, outputs of first 23 and second 24 OR—NO elements are connected to first Q1 and to second Q2 outputs of the storage unit accordingly. The storage unit 1 of the self-timed RS-flip-flop traditionally consists of two bistable cells in-series. The circuits of the storage unit of the self-timed RS-flip-flop for the paraphase data input with zero and unit spacers are shown in FIGS. 11 and 12 accordingly. The circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer (FIG. 11) consists of two OR—NO elements 25-26 and two OR-AND-NO elements 27-28, first input of first OR—NO element 25 is connected to first input I1 of the storage unit and to first input of first OR input group of first OR-AND-NO element 27, an output of first OR—NO element 25 is connected to first input of second OR—NO element 26, to second input of first OR input group of first OR-AND-NO element 27 and to third output of the storage unit U1, second input of second OR—NO element 26 is connected to second input I2 of the storage unit and to second input of first OR input group of second OR-AND-NO element 28, an output of second OR—NO element 26 is connected to second input of first OR—NO element 25, first input of first OR input group of second OR-AND-NO element 28 and to fourth output U2 of the storage unit, an output of first OR-AND-NO element 27 is connected to an input of second OR input group of second OR-AND-NO element 28 and to first output of the storage unit Q1, an output of second OR-AND-NO element 28 is connected to an input of second OR input group of first OR-AND-NO element 27 and to second output of the storage unit Q2. The circuit of the storage unit 1 of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer (FIG. 12) consists of two AND-NO elements 29-30 and two AND-OR—NO elements 31-32, first input of first AND-NO element 29 is connected to first input I1 of the storage unit and to first input of first AND input group of first AND-OR—NO element 31, an output of first AND-NO element 29 is connected to first input of second AND-NO element 30, to second input of first AND input group of first AND-OR—NO element 31 and to third output of the storage unit U1, second input of second AND-NO element 30 is connected to second input I2 of the storage unit and to second input of first AND input group of second AND-OR—NO element 32, an output of second AND-NO element 30 is connected to second input of first AND-NO element 29, to first input of first AND input group of second AND-OR—NO element 32 and to fourth output U2 of the storage unit, an output of first AND-OR—NO element 31 is connected to an input of second AND input group of second AND-OR—NO element 32 and to first output of the storage unit Q1, an output of second AND-OR—NO element 32 is connected to an input of second AND input group of first AND-OR—NO element 31 and to second output of the storage unit Q2. The storage unit can have additional synchronous reset and set inputs (preset terminals) which do not require indication. They do not influence realization of the preindication and indication units. However in practice it is often required to control a preset termination of both trigger and whole circuit. In this case it is necessary to use self-timed reset or set. FIG. 13 presents a circuit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input and self-timed preset input (reset or set terminal). It differs from the circuit in FIG. 1 by presence of preset input 33 connected to third input I3 of the storage unit 1 and to fifth input X5 of the preindication unit 10. FIG. 14 demonstrates a circuit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input and self-timed preset input (reset or set terminal). It differs from the circuit in FIG. 2 by presence of preset input 33 connected to third input I3 of the storage unit 1 and to seventh input X7 of the preindication unit 10. The preset is carried out at spacer state at the paraphase data input by applying to preset input a level that is an opposite to spacer state of the paraphase input. The storage unit of the self-timed RS-latch is realized identically for synchronous and self-timed presets. FIG. 15 shows a circuit of the storage unit 1 of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer and preset input. It differs from the circuit in FIG. 10 by that third input of the storage unit I3, being the preset input, and third input of second OR—NO element 24 are added being connected to each other. Let the paraphase input I1, I2 of the storage unit be in spacer (I1=I2=0) and bistable cell on base of elements 23 and 24 stores state [Q1=0, Q2=1]. Applying high level, which is opposite to the input spacer, to preset input, I3=1, sets bistable cell into state [Q1=1, Q2=0], that is opposite to an initial one. FIG. 16 presents a circuit of the storage unit 1 of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer and preset input. It differs from the circuit in FIG. 9 by that third input of the storage unit I3, being a preset input, and third input of second AND-NO element 22 are added being connected to each other. Let the paraphase input I1, I2 of the storage unit be in spacer (I1=I2=1) and bistable cell on base of elements 21 and 22 stores state [Q1=1, Q2=0]. Applying low level, which is opposite to the input spacer, to preset input, I3=0, sets bistable cell into state [Q1=0, Q2=1], that is opposite to an initial one. In self-timed RS-flip-flop, storage unit with synchronous and self-timed preset is realized by various circuits. FIG. 17 shows a circuit of the storage unit 1 of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer and synchronous preset input. It differs from the circuit in FIG. 11 by that third input I3 of the storage unit, being the trigger's synchronous preset input, and third input of second OR—NO element 26 are added being connected to each other. FIG. 18 demonstrates a circuit of the storage unit 1 of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer and synchronous preset input. It differs from the circuit in FIG. 12 by that third input I3 of the storage unit, being the trigger's synchronous preset input, and third input of second AND-NO element 30 are added being connected with each other. FIG. 19 shows a circuit of the storage unit 1 of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer and self-timed preset input. It differs from the circuit in FIG. 17 by that third input is added into first OR input group of second OR-AND-NO element 28 being connected to third input I3 of the storage unit. FIG. 20 demonstrates a circuit of the storage unit 1 of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer and self-timed preset input. It differs from the circuit in FIG. 18 by that third input is added into first AND input group of second AND-OR—NO element 32 being connected to third input I3 of the storage unit. For the self-timed RS-triggers with the enhanced noise immunity with synchronous preset, preindication and indication units are used the same, as for the self-timed RS-trigger without preset. In the RS-triggers with self-timed preset, the preindication unit becomes complicated. FIG. 21 shows a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer and self-timed preset input. The circuit consists of AND-NO element 34 and OR-AND-NO element 35, first and second inputs of AND-NO element 34 are connected to first X1 and third X3 inputs of the preindication unit respectively, an output of AND-NO element 34 is connected to second output Y2 of the preindication unit, first and second inputs of first OR input group of OR-AND-NO element 35 are connected to second X2 and fifth X5 inputs of the preindication unit respectively, an input of second OR input group of OR-AND-NO element 35 is connected to fourth input X4 of the preindication unit, an output of OR-AND-NO element 35 is connected to first output Y1 of the preindication unit. FIG. 22 presents a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with unit spacer and self-timed preset input. The circuit consists of OR—NO element 36 and AND-OR—NO element 37, first and second inputs of OR—NO element 36 are connected to first X1 and third X3 inputs of the preindication unit respectively, an output of OR—NO element 36 is connected to second output Y2 of the preindication unit, first and second inputs of first AND input group of AND-OR—NO element 37 are connected to second X2 and fifth X5 inputs of the preindication unit respectively, an input of second AND input group of AND-OR—NO element 37 is connected to fourth input X4 of the preindication unit, the output of AND-OR—NO element 37 is connected to first output Y1 of the preindication unit. FIG. 23 shows a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer and self-timed preset input. The circuit differs from the circuit in FIG. 7 by that seventh input X7 is added to the preindication unit, and fourth input is added to second OR—NO element 18 being connected to seventh input X7 of the preindication unit. FIG. 24 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having paraphase data input with unit spacer and self-timed preset input. The circuit differs from the circuit in FIG. 8 by that seventh input X7 is added to the preindication unit, and fourth input is added to second AND-NO element 20 being connected to seventh input X7 of the preindication unit. Described above block-diagrams and circuits of storage unit, preindication unit and indication one cover various variants of realization of the self-timed RS-trigger with the enhanced noise immunity having the paraphase data input with spacer depending on the trigger's input specification. Table 1 represents the combinations of units of the self-timed RS-trigger with the paraphase data input with spacer, and specifications of the input and output terminals, forming exact realizations of the trigger. The considered variants of the self-timed RS-trigger realization are characterized by that data input has spacer that allows for organizing control of the trigger, i.e. transferring it into a phase of updating of data output state or into a phase of keeping this state only by means of changing state of the data input. In practice, however, the paraphase signal without spacer is often used as the trigger's data input. It has only two statically steady states where two components of this signal have complementary values. In this case, an additional signal named a control signal or a write enable signal is required for successful controlling trigger. It is the single-rail signal having spacer and work (active) state. Spacer value of this input causes storing current state of the paraphase data output of the self-timed RS-latch, while the self-timed RS-flip-flop copies a state from input bistable cell to an output one, updating a state of its paraphase data output. The circuit of the self-timed RS-latch with the enhanced noise immunity having write enable input is identical to the circuit in FIG. 13. A difference between them consists only in that the input 33 operates as write enable input, instead of self-timed preset input. The circuit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input is identical to the circuit in FIG. 14. A difference between them consists only in that the input 33 operates as write enable input, instead of self-timed preset input. TABLE 1 Variants of self-timed RS-trigger with the paraphase data input with spacer No No Input Input Storage Preindication Indication Output Output pp. Type of self-timed RS-trigger 3 4 unit unit unit 5 6 1 Latch with zero input spacer R S FIG. 10 FIG. 5 FIG. 3 QB Q 2 Latch with unit input spacer R S FIG. 9 FIG. 6 FIG. 4 Q QB 3 Latch with zero input spacer S R FIG. 15 FIG. 5 FIG. 3 Q QB having synchronous reset input 4 Latch with zero input spacer R S FIG. 15 FIG. 5 FIG. 3 QB Q having synchronous set input 5 Latch with unit input spacer S R FIG. 16 FIG. 6 FIG. 4 QB Q having synchronous reset input 6 Latch with unit input spacer R S FIG. 16 FIG. 6 FIG. 4 Q QB having synchronous set input 7 Latch with zero input spacer S R FIG. 15 FIG. 21 FIG. 3 Q QB having self-timed reset input 8 Latch with zero input spacer R S FIG. 15 FIG. 21 FIG. 3 QB Q having self-timed set input 9 Latch with unit input spacer S R FIG. 16 FIG. 22 FIG. 4 QB Q having self-timed reset input 10 Latch with unit input spacer R S FIG. 16 FIG. 22 FIG. 4 Q QB having self-timed set input 11 Flip-flop with zero input spacer R S FIG. 11 FIG. 7 FIG. 4 Q QB 12 Flip-flop with zero input spacer R S FIG. 12 FIG. 8 FIG. 3 QB Q 13 Flip-flop with zero input spacer S R FIG. 17 FIG. 7 FIG. 4 QB Q having synchronous reset input 14 Flip-flop with zero input spacer R S FIG. 17 FIG. 7 FIG. 4 Q QB having synchronous set input 15 Flip-flop with unit input spacer S R FIG. 18 FIG. 8 FIG. 3 Q QB having synchronous reset input 16 Flip-flop with unit input spacer R S FIG. 18 FIG. 8 FIG. 3 QB Q having synchronous set input 17 Flip-flop with zero input spacer S R FIG. 19 FIG. 23 FIG. 4 QB Q having self-timed reset input 18 Flip-flop with zero input spacer R S FIG. 19 FIG. 23 FIG. 4 Q QB having self-timed set input 19 Flip-flop with unit input spacer S R FIG. 20 FIG. 24 FIG. 3 Q QB having self-timed reset input 20 Flip-flop with unit input spacer R S FIG. 20 FIG. 24 FIG. 3 QB Q having self-timed set input The circuit of the indication unit in the circuits of the self-timed RS-latch and RS-flip-flop with the enhanced noise immunity having the write enable input is identical to the circuit of the indication unit of analogous RS-triggers having paraphase data input with spacer whose type of spacer is the same as the type of spacer of the write enable input. It is presented in FIGS. 3 and 4. FIG. 25 shows a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer. The circuit consists of two AND-OR—NO elements 38-39, first inputs of first AND input groups of first 38 and second 39 AND-OR—NO elements are connected to first I1 and to second I2 inputs of the storage unit accordingly, second inputs of first AND input groups of first 38 and second 39 AND-OR—NO elements are connected to third I3 input of the storage unit, an output of first AND-OR—NO element 38 is connected to first output Q1 of the storage unit and to an input of second AND input group of second AND-OR—NO element 39 whose output is connected to second output Q2 of the storage unit and to an input of second AND input group of first AND-OR—NO element 38. The circuit in FIG. 25 operates as follows. High level at input I3 enables writing a state of data inputs I1 and I2 into the storage unit. Low level (spacer) at input I3 enables keeping current state of outputs Q1 and Q2 of the storage unit. FIG. 26 presents a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer. The circuit consists of two OR-AND-NO elements 40-41, first inputs of first OR input groups of first 40 and second 41 OR-AND-NO elements are connected to first I1 and to second I2 inputs of the storage unit accordingly, second inputs of first OR input groups of first 40 and second 41 OR-AND-NO elements are connected to third I3 input of the storage unit, an output of first OR-AND-NO element 40 is connected to first output Q1 of the storage unit and to an input of second OR input group of second OR-AND-NO element 41 whose output is connected to second output Q2 of the storage unit and to an input of second OR input group of first OR-AND-NO element 40. The circuit in FIG. 26 operates as follows. Low level at input I3 enables writing a state of data inputs I1 and I2 into the storage unit. High level (spacer) at input I3 enables keeping current state of outputs Q1 and Q2 of the storage unit. FIG. 27 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer. The circuit consists of two AND-OR—NO elements 42-43 and two OR-AND-NO elements 44-45, first inputs of first AND input groups of first 42 and second 43 AND-OR—NO elements are connected to first I1 and to second I2 inputs of the storage unit accordingly, second inputs of first AND input groups of first 42 and second 43 AND-OR—NO elements are connected to third I3 input of the storage unit and to second inputs of first OR input groups of first 44 and second 45 OR-AND-NO elements, an output of first AND-OR—NO element 42 is connected to first input of first OR input group of first OR-AND-NO element 44, to an input of second AND input group of second AND-OR—NO element 43 and to third output of the storage unit U1, an output of second AND-OR—NO element 43 is connected to first input of first OR input group of second OR-AND-NO element 45, to an input of second AND input group of first AND-OR—NO element 42 and to fourth output of the storage unit U2, an output of first OR-AND-NO element 44 is connected to first output Q1 of the storage unit and to an input of second OR input group of second OR-AND-NO element 45 whose output is connected to second output Q2 of the storage unit and to an input of second OR input group of first OR-AND-NO element 44. The circuit in FIG. 27 operates as follows. High level at input I3 of the storage unit enables writing down the data from inputs I1 and I2 into first bistable cell on base of elements 42 and 43. Low level (spacer) at input I3 of the storage unit enables keeping state of first bistable cell and copying it to second bistable cell on base of elements 44 and 45. FIG. 28 presents a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer. The circuit consists of two OR-AND-NO elements 46-47 and two AND-OR—NO elements 48-49, first inputs of first OR input groups of first 46 and second 47 OR-AND-NO elements are connected to first I1 and to second I2 inputs of the storage unit accordingly, second inputs of first OR input groups of first 46 and second 47 OR-AND-NO elements are connected to third I3 input of the storage unit and to second inputs of first AND input groups of first 48 and second 49 elements AND-OR—NO, an output of first OR-AND-NO element 46 is connected to first input of first AND input group of first AND-OR—NO element 48, to an input of second OR input group of second OR-AND-NO element 47 and to third output of the storage unit U1, an output of second OR-AND-NO element 47 is connected to first input of first AND input group of second AND-OR—NO element 49, to an input of second OR input group of first OR-AND-NO element 46 and to fourth output of the storage unit U2, an output of first AND-OR—NO element 48 is connected to first output Q1 of the storage unit and to an input of second AND input group of second AND-OR—NO element 49 whose output is connected to second output Q2 of the storage unit and to an input of second AND input group of first AND-OR—NO element 48. The circuit in FIG. 28 operates as follows. Low level at input I3 of the storage unit enables writing down the data from inputs I, and I2 into first bistable cell on base of elements 46 and 47. High level (spacer) at input I3 of the storage unit enables keeping state of first bistable cell and copying it to second bistable cell on base of elements 48 and 49. FIG. 29 shows a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer. The circuit consists of two AND-NO elements 50-51, first inputs of first 50 and second 51 AND-NO elements are connected to first X1 and second X2 inputs of the preindication unit accordingly, second inputs of first 50 and second 51 AND-NO elements are connected to third X3 and fourth X4 inputs of the preindication unit accordingly, third inputs of first 50 and second 51 AND-NO elements are connected to fifth input X5 of the preindication unit, outputs of first 50 and second 51 AND-NO elements are connected to second Y2 and first Y1 outputs of the preindication unit accordingly. FIG. 30 presents a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer. The circuit consists of two OR—NO elements 52-53, first inputs of first 52 and second 53 OR—NO elements are connected to first X1 and second X2 inputs of the preindication unit accordingly, second inputs of first 52 and second 53 OR—NO elements are connected to third X3 and fourth X4 inputs of the preindication unit accordingly, third inputs of first 52 and second 53 OR—NO elements are connected to fifth input X5 of the preindication unit, outputs of first 52 and second 53 OR—NO elements are connected to second Y2 and first Y1 outputs of the preindication unit accordingly. FIG. 31 shows a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer. The circuit consists of two OR-AND-NO elements 54-55, first inputs of first OR input groups of first 54 and second 55 OR-AND-NO elements are connected to first X1 and second X2 inputs of the preindication unit accordingly, second inputs of first OR input groups of first 54 and second 55 OR-AND-NO elements are connected to seventh input of the preindication unit X7, inputs of second OR input groups of first 54 and second 55 OR-AND-NO elements are connected to fifth X5 and sixth X6 inputs of the preindication unit accordingly, inputs of third OR input groups of first 54 and second 55 OR-AND-NO elements are connected to third X3 and fourth X4 inputs of the preindication unit accordingly, outputs of first 54 and second 55 OR-AND-NO elements are connected to second Y2 and first Y1 outputs of the preindication unit accordingly. FIG. 32 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer. The circuit consists of two AND-OR—NO elements 56-57, first inputs of first AND input groups of first 56 and second 57 AND-OR—NO elements are connected to first X1 and second X2 inputs of the preindication unit accordingly, second inputs of first AND input groups of first 56 and second 57 AND-OR—NO elements are connected to seventh input of the preindication unit X7, inputs of second AND input groups of first 56 and second 57 AND-OR—NO elements are connected to fifth X5 and sixth X6 inputs of the preindication unit accordingly, inputs of third AND input groups of first 56 and second 57 AND-OR—NO elements are connected to third X3 and fourth X4 inputs of the preindication unit accordingly, outputs of first 56 and second 57 AND-OR—NO elements are connected to second Y2 and first Y1 outputs of the preindication unit accordingly. The storage unit of the self-timed RS-trigger with the enhanced noise immunity having write enable input can have additional inputs for synchronous resetting and setting which do not require indication. They do not influence a realization of the preindication and indication units. However, in practice it is often required to control the termination of presetting both trigger and whole circuit. In this case one needs to use self-timed reset and set inputs. FIG. 33 presents a circuit of the self-timed RS-latch with the enhanced noise immunity having write enable input and self-timed preset input (reset or set terminal). It differs from the circuit in FIG. 1 by that there are a write enable input 33 connected to third input I3 of the storage unit 1 and to fifth input X5 of the preindication unit 10, and preset input 58 connected to fourth input I4 of the storage unit 1 and to sixth input X6 of the preindication unit 10. FIG. 34 shows a circuit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input and self-timed preset input (reset or set terminal). It differs from the circuit in FIG. 2 by that there are a write enable input 33 connected to third input I3 of the storage unit 1 and to seventh input X7 of the preindication unit 10, and preset input 58 connected to fourth input I4 of the storage unit 1 and to eighth input X8 of the preindication unit 10. FIG. 35 presents a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer and preset input. The circuit differs from the circuit in FIG. 25 by that fourth input I4 is added into the storage unit, and third AND input group is added into second AND-OR—NO element 39, and an input of this AND input group is connected to fourth input I4 of the storage unit. The preset is carried out at low level (spacer) at write enable input I3 of the storage unit by applying high level to the preset input I4. FIG. 36 presents a circuit of the storage unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer and preset input. The circuit differs from the circuit on FIG. 26 by that fourth input I4 is added into the storage unit, and third OR input group is added into second OR-AND-NO element 41, and an input of this OR input group is connected to fourth input I4 of the storage unit. The preset is carried out at high level (spacer) at write enable input I3 of the storage unit by applying low level to the preset input I4. In the self-timed RS-latch with the enhanced noise immunity having the write enable input, the storage unit 1 is realized by the same circuit in cases of synchronous and self-timed preset. In the self-timed RS-flip-flop with the enhanced noise immunity having the write enable input, the storage unit 1 is realized by different circuits in cases of synchronous and self-timed preset. In the latter case an indication of the preset termination is required that results in some complication of the circuit of the storage unit. FIG. 37 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer and synchronous preset input. The circuit differs from the circuit in FIG. 27 by that fourth input I4 is added to the storage unit, and third AND input group is added to second AND-OR—NO element 43, and an input of this group is connected to fourth input I4 of the storage unit. The preset is carried out at low level (spacer) at write enable input I3 of the storage unit by applying high level to the preset input I4. FIG. 38 presents a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and synchronous preset input. The circuit differs from the circuit in FIG. 28 by that fourth input I4 is added to the storage unit, and third OR input group is added to second OR-AND-NO element 47, and an input of this group is connected to fourth input I4 of the storage unit. The preset is carried out at high level (spacer) at write enable input I3 of the storage unit by applying low level to the preset input I4. FIG. 39 shows a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with zero spacer and self-timed preset input. It differs from the circuit in FIG. 29 by that second AND-NO element 51 is replaced by AND-OR—NO element 59, first, second and third inputs of first AND input group of AND-OR—NO element 59 are connected to second X2, fourth X4 and fifth X5 inputs of the preindication unit respectively, first and second inputs of second AND input group of AND-OR—NO element 59 are connected to fourth X4 and sixth X6 inputs of the preindication unit respectively, and an output of the AND-OR—NO element 59 is connected to first output Y1 of the preindication unit. FIG. 40 presents a circuit of the preindication unit of the self-timed RS-latch with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input. It differs from the circuit in FIG. 30 by that second OR—NO element 53 is replaced by OR-AND-NO element 60, first, second and third inputs of first OR input group of OR-AND-NO element 60 are connected to second X2, fourth X4 and fifth X5 inputs of the preindication unit respectively, first and second inputs of second OR input group of OR-AND-NO element 60 are connected to fourth X4 and sixth X6 inputs of the preindication unit respectively, and the output of OR-AND-NO element 60 is connected to first output Y1 of the preindication unit. FIG. 41 shows a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer and self-timed preset input. It differs from the circuit in FIG. 37 by that third input is added to first OR input group of second OR-AND-NO element 45 being connected to fourth input of the storage unit I4. FIG. 42 presents a circuit of the storage unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input. It differs from the circuit in FIG. 38 by that third input is added to first AND input group of second AND-OR—NO element 49 being connected to fourth input of the storage unit I4. FIG. 43 shows a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input. It differs from the circuit in FIG. 31 by that fourth OR input group is added to second OR-AND-NO element 55, and its input is connected to eighth X8 input of the preindication unit. FIG. 44 presents a circuit of the preindication unit of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with zero spacer and self-timed preset input. It differs from the circuit in FIG. 32 by that fourth AND input group is added to second AND-OR—NO element 57, and its input is connected to eighth X8 input of the preindication unit. Thus, described above circuit realizations of the storage, preindication and indication units together with the inverters connected as it is shown in FIGS. 13, 14, 33 and 34, allow for constructing various variants of the self-timed RS-trigger with the enhanced noise immunity having the write enable input depending on the specification of the trigger's inputs. Table 2 represents the combinations of internal units of the self-timed RS-trigger with the enhanced noise immunity having the write enable input and specifications of the input and output terminals, forming exact realizations of the trigger. TABLE 2 Variants of self-timed RS-trigger with write enable input No No Type of self-timed Input Input Storage Preindication Indication Output Output pp. RS-trigger 3 4 unit unit unit 5 6 1 Latch with zero spacer R S FIG. 25 FIG. 29 FIG. 3 QB Q of write enable input 2 Latch with unit spacer R S FIG. 26 FIG. 30 FIG. 4 Q QB of write enable input 3 Latch with zero spacer S R FIG. 35 FIG. 29 FIG. 3 Q QB of write enable input and synchronous reset input 4 Latch with zero spacer R S FIG. 35 FIG. 29 FIG. 3 QB Q of write enable input and synchronous set input 5 Latch with unit spacer S R FIG. 36 FIG. 30 FIG. 4 QB Q of write enable input and synchronous reset input 6 Latch with unit spacer R S FIG. 36 FIG. 30 FIG. 4 Q QB of write enable input and synchronous set input 7 Latch with zero spacer S R FIG. 35 FIG. 39 FIG. 3 Q QB of write enable input and self-timed reset input 8 Latch with zero spacer R S FIG. 35 FIG. 39 FIG. 3 QB Q of write enable input and self-timed set input 9 Latch with unit spacer S R FIG. 36 FIG. 40 FIG. 4 QB Q of write enable input and self-timed reset input 10 Latch with unit spacer R S FIG. 36 FIG. 40 FIG. 4 Q QB of write enable input and self-timed set input 11 Flip-flop with zero spacer R S FIG. 27 FIG. 32 FIG. 4 Q QB of write enable input 12 Flip-flop with unit spacer R S FIG. 28 FIG. 31 FIG. 3 QB Q of write enable input 13 Flip-flop with zero spacer S R FIG. 37 FIG. 32 FIG. 4 QB Q of write enable input and synchronous reset input 14 Flip-flop with zero spacer R S FIG. 37 FIG. 32 FIG. 4 Q QB of write enable input and synchronous set input 15 Flip-flop with unit spacer S R FIG. 18 FIG. 8 FIG. 3 Q QB of write enable input and synchronous reset input 16 Flip-flop with unit spacer R S FIG. 18 FIG. 8 FIG. 3 QB Q of write enable input and synchronous set input 17 Flip-flop with zero spacer S R FIG. 19 FIG. 23 FIG. 4 QB Q of write enable input and self-timed reset input 18 Flip-flop with zero spacer R S FIG. 19 FIG. 23 FIG. 4 Q QB of write enable input and self-timed set input 19 Flip-flop with unit spacer S R FIG. 20 FIG. 24 FIG. 3 Q QB of write enable input and self-timed reset input 20 Flip-flop with unit spacer R S FIG. 20 FIG. 24 FIG. 3 QB Q of write enable input and self-timed set input FIG. 45 demonstrates a realization of the self-timed RS-latch with the enhanced noise immunity having paraphase data input with zero spacer (a line 1 in Table 1) corresponding to the circuit in FIG. 1. It is composed from the circuits of storage unit (FIG. 10), preindication unit (FIG. 5) and indication unit (FIG. 3). The circuit operates as follows. At input spacer [R=S=0] the storage unit on base of elements 23 and 24 keeps the state, for example, [Q1=0, Q2=1], which is propagated through inverters 8 and 9 to paraphase data output [Q=0, QB=1]. Simultaneously input spacer causes the outputs of elements 13 and 14 to be in logic 1 state. This leads to forming low level (logic 0) at output of an element 11 and at trigger's indication output I. At applying the working state to the trigger's input [R=0, S=1] trigger's elements are switched into state [Q2=0, Q1=1, Q=1, QB=0, Y1=0, Y2=1], that forces an element 11, and accordingly the trigger's indication output I, to be switched into logic 1 state. Thus, the indication output of the self-timed RS-latch with the enhanced noise immunity having the paraphase data input with zero spacer traces a sequence of transition of the trigger from one phase of work into opposite, providing its self-timing. FIG. 46 shows a realization of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input (a line 19 in Table 2) corresponding to the circuit in FIG. 34. It is composed from the circuits of storage unit (FIG. 42), preindication unit (FIG. 43) and indication unit (FIG. 3). Self-timed reset is performed as follows. Let an initial state of the paraphase data input to be [R=1, S=0]. At passive value of reset input (Reset=1) a high level (spacer) is applied to the write enable input E (E=1). After termination of the trigger's transition into a phase of updating state of the paraphase data output [Q=1, QB=0], the indication output I is switched into logic 1 (I=1), allowing for beginning self-timed preset. Then low level is applied to reset input (Reset=0). As a result, outputs of the elements 46 and 47 are consistently switched into the following states (hereinafter names of outputs of the elements which have been not connected to external outputs, are composed from the letter “D” and element's circuit number): D47=1→D46=0. State of the trigger's data output does not change, as inputs of element D49 are locked by low level at reset input, and the indication output I will pass into state I=0 at termination of transition of elements 46, 54 and 55, thus proving the termination of first stage of self-timed reset. Then a passive level is again applied to the reset input (Reset=1), resolving transition of elements 49, 48, 8, 9, 55 and 11: D49=0→D48=1→[D8=0, D9=1]→D55=0→D11=1. Occurrence of high level at the trigger's indication output (I=1) confirms the termination of the trigger's preset. Thus, the indication output of the self-timed RS-flip-flop with the enhanced noise immunity having write enable input with unit spacer and self-timed preset input traces the sequence of resetting trigger, providing self-timed character of this procedure. At designing self-timed circuits, an important aspect is providing correct “request-acknowledge” interaction between circuit elements and units. An example of organization of such interaction of proposed self-timed RS-flip-flop with the enhanced noise immunity having the paraphase data input with zero spacer with an external environment is described below. An event model lies in basis of the self-timed circuit operation, so an adequate mean described its work is a signal graph (SG). SG simultaneously is a formal mean for designed device specification, an evident mean for functional description and visual mean proving self-timed character of the device. FIG. 47 presents a circuit for self-timing analysis of proposed RS-flip-flop with the enhanced noise immunity having paraphase data input with zero spacer, corresponding to the circuit in FIG. 2 (a line 11 of Table 1). FIG. 48 demonstrates SG of its operation, proving self-timing of this RS-trigger. Signals in FIG. 48 have the names derivative of numbering corresponding inputs and outputs of the RS-flip-flop and its internal units in FIG. 2. Names of external inputs begin with “IN”, while names of external outputs begin with “O”. A sign “+” before a signal name designates its transition into high level state, and a sign “−” designates signal's transition into low level state. A self-timed counting trigger “TT” together with a circuit of zero spacer generation on base of OR—NO elements is used for obtaining paraphase data input with spacer for the RS-flip-flop. The indication unit of the RS-flip-flop forms clock input for counting trigger, while counting trigger forms both paraphase data input for the RS-flip-flop and own indication signal CII controlling the termination of switch processes of counting trigger's elements. At the same time it plays a role of a control signal of a phase of the data input of the RS-flip-flop. Such environment provides continuous alternation of phases of work of the RS-flip-flop: just after work phase termination (low level at indication output O7), transition into a spacer phase (a mode of keeping state at data output O5, O6) of the RS-flip-flop is initiated, and vice-versa. Initial state at the RS-flip-flop's inputs and outputs: [IN3=0, IN4=0, O5=1, O6=0, O7=0]. Signals CY, CYB, CTO, and CI are the internal signals of counting TT trigger. The work beginning is initiated by switching paraphase data input (+IN3, 1) into a working state [IN3=1, IN4=0]. As seen in FIG. 48, it causes change of the states of an input bistable cell (signals U1, U2), preindication and indication units of the RS-flip-flop, and state of indication output (+O7, 1). The data output O5, O6 of the trigger changes only after switching paraphase data input of the trigger into zero spacer (−IN3, 1). Finally, it leads to switching elements of the output bistable cell of the storage unit with outputs Q1, Q2, as well as inverters (−O5, 1; +O6, 1). Note, that no constraints are imposed for the delay of any element. An initiation of each next event (node of SG) is possible only after occurrence of previous parent event. Transition of the output of the indication unit (−O7, 1) reflects the termination of switching trigger into a new output state: [O5=0, O6=1],—and initiates a new cycle of transition during which the trigger's output state becomes as [O5=1, O6=0], coinciding with the initial. Operation of the self-timed RS-flip-flop in a mode of the simple short circuit shown in FIG. 47 is cyclic. In FIG. 48, a cyclic part of the SG is shown by dash-and-dot line. Thus, the presented SG illustrating a work of the self-timed RS-flip-flop with the enhanced noise immunity and paraphase data input with zero spacer proves self-timing of the proposed decision. Similar SG one can also obtain for other variants of realization of the self-timed RS-trigger with the enhanced noise immunity. INDUSTRIAL APPLICABILITY Self-timed RS-trigger with the enhanced noise immunity relates to pulse and computational technique and may be used for designing self-timed triggers, register and computational units, as well as in digital signal processing systems. REFERENCES [1] o BΠoπypH Ie πΦpoB Ie M κpocxeM I: CπpaBo H κ. 2-e -e Hcκ: MeTaypΓ e Hcκoe ot1989.-pc.1.54a. [2] A. Bystrov, D. Shang, F. Xia and A. Yakovlev Self-timed and speed independent latch circuits//In Proc. 6th U.K. Timed Forum, Univ. Manchester, 1999, pp. 1-11. [3] AcTaxaHoBcκA.Γ., BapaBcκB.MapaxoBcκB. p. Aπepoecκe aBToMaT I. //ΠopeB.Bapπ BcκoΓo. -M.: Hayκa, 1976, 424 c. 1. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and comprising a storage unit, an indication unit, the first and second components of the paraphase data input, first and second components of a paraphase data output and an indication output, wherein first and second components of the paraphase data input are connected to first and second inputs of the storage unit accordingly, first component of the trigger's paraphase data output is connected to first input of the indication unit, second component of the trigger's paraphase data output is connected to second input of the indication unit, the trigger's indication output is connected to an output of the indication unit, characterized by that two inverters and a preindication unit are added, wherein first and second inputs of the preindication unit are connected to first and second components of the paraphase data input respectively, an input of first inverter is connected to first output of the storage unit, an output of first inverter is connected to first component of the trigger's paraphase data output and to third input of the preindication unit, an input of second inverter is connected to second output of the storage unit, an output of second inverter is connected to second component of the trigger's paraphase data output and to fourth input of the preindication unit, first and second outputs of the preindication unit are connected to third and fourth inputs of the indication unit accordingly, a paraphase input with spacer is used as the trigger's data input, and the self-timed RS-trigger is RS-latch. 2. Self-timed RS-trigger with the enhanced noise immunity according to claim 1, characterized by that trigger's preset input, third input of the storage unit and fifth input of the preindication unit are added being connected together, wherein preset is self-timed, the preset type (set or reset) is determined by both a functional characteristic of components of the trigger's paraphase data input and a type of paraphase data input spacer. 3. Self-timed RS-trigger with the enhanced noise immunity according to claim 1, characterized by that the storage unit consists of two OR—NO elements, first and second inputs of first OR—NO element are connected to first input and second output of the storage unit accordingly, first and second inputs of second OR—NO element are connected to first output and second input of the storage unit accordingly, outputs of first and second OR—NO elements are connected to first and second outputs of the storage unit accordingly, the preindication unit consists of two AND-NO elements, wherein first and second inputs of first AND-NO element are connected to first and third inputs of the preindication unit accordingly, first and second inputs of second AND-NO element are connected to second and fourth inputs of the preindication unit accordingly, outputs of first and second AND-NO elements are connected to second and first outputs of the preindication unit accordingly, and the trigger's paraphase data input has zero spacer. 4. Self-timed RS-trigger with the enhanced noise immunity according to claim 1, characterized by that the storage unit consists of two AND-NO elements, wherein first and second inputs of first AND-NO element are connected to first input and second output of the storage unit accordingly, first and second inputs of second AND-NO element are connected to first output and second input of the storage unit accordingly, outputs of first and second AND-NO elements are connected to first and second outputs of the storage unit accordingly, the preindication unit consists of two OR—NO elements, first and second inputs of first OR—NO element are connected to first and third inputs of the preindication unit accordingly, first and second inputs of second OR—NO element are connected to second and fourth inputs of the preindication unit accordingly, outputs of first and second OR—NO elements are connected to second and first outputs of the preindication unit accordingly, and the trigger's paraphase data input has unit spacer. 5. Self-timed RS-trigger with the enhanced noise immunity according to claim 1, characterized by that the storage unit has third and fourth outputs, wherein fifth and sixth inputs are added to the preindication unit being connected to third and fourth outputs of the storage unit accordingly, and the self-timed RS-trigger is RS-flip-flop. 6. Self-timed RS-trigger with the enhanced noise immunity according to claim 2, characterized by that the storage unit consists of two OR—NO elements, wherein first and second inputs of first OR—NO element are connected to first input and second output of the storage unit accordingly, first and second inputs of second OR—NO element are connected to first output and second input of the storage unit accordingly, outputs of first and second OR—NO elements are connected to first and second outputs of the storage unit accordingly, third input of second OR—NO element is connected to third input of the storage unit, the preindication unit consists of AND-NO element and OR-AND-NO element, first and second inputs of AND-NO element are connected to first and third inputs of the preindication unit accordingly, an output of AND-NO element is connected to second output of the preindication unit, first and second inputs of first OR input group of OR-AND-NO element are connected to second and fifth inputs of the preindication unit accordingly, an input of second OR input group of OR-AND-NO element is connected to fourth input of the preindication unit, an output of OR-AND-NO element is connected to first output of the preindication unit, and the paraphase data input has zero spacer. 7. Self-timed RS-trigger with the enhanced noise immunity according to claim 2, characterized by that the storage unit consists of two AND-NO elements, wherein first and second inputs of first AND-NO element are connected to first input and second output of the storage unit accordingly, first and second inputs of second AND-NO element are connected to first output and second input of the storage unit accordingly, outputs of first and second AND-NO elements are connected to first and second outputs of the storage unit accordingly, third input of second AND-NO element is connected to third input of the storage unit, the preindication unit consists of OR—NO element and AND-OR—NO element, wherein first and second inputs of OR—NO element are connected to first and third inputs of the preindication unit accordingly, an output of OR—NO element is connected to second output of the preindication unit, first and second inputs of first AND input group of AND-OR—NO element are connected to second and fifth inputs of the preindication unit accordingly, an input of second AND input group of AND-OR—NO element is connected to fourth input of the preindication unit, an output of AND-OR—NO element is connected to first output of the preindication unit, and the paraphase data input has unit spacer. 8. Self-timed RS-trigger with the enhanced noise immunity according to claim 5, characterized by that trigger's preset input, third input of the storage unit and seventh input of the preindication unit are added being connected together, wherein preset is self-timed, the preset type (set or reset) is determined by both a functional characteristic of components of the trigger's paraphase data input and a type of its spacer. 9. Self-timed RS-trigger with the enhanced noise immunity according to claim 5, characterized by that the storage unit consists the first and second OR—NO elements and two OR-AND-NO elements, wherein first input of first OR—NO element is connected to first input of the storage unit and to first input of first OR input group of first OR-AND-NO element, an output of first OR—NO element is connected to first input of second OR—NO element, to second input of first OR input group of first OR-AND-NO element and to third output of the storage unit, second input of second OR—NO element is connected to second input of the storage unit and to second input of first OR input group of second OR-AND-NO element, an output of second OR—NO element is connected to second input of first OR—NO element, to first input of first OR input group of second OR-AND-NO element and to fourth output of the storage unit, an output of first OR-AND-NO element is connected to an input of second OR input group of second OR-AND-NO element and to first output of the storage unit, an output of second OR-AND-NO element is connected to an input of second OR input group of first OR-AND-NO element and to second output of the storage unit, the preindication unit consists of third and fourth OR—NO elements, wherein first, second and third inputs of third OR—NO element are connected to first, third and fifth inputs of the preindication unit accordingly, first, second and third inputs of fourth OR—NO element are connected to second, fourth and sixth inputs of the preindication unit accordingly, outputs of fourth and third OR—NO elements are connected to first and second outputs of the preindication unit accordingly, and the paraphase data input has zero spacer. 10. Self-timed RS-trigger with the enhanced noise immunity according to claim 9, characterized by that trigger's preset input and third input of second OR—NO element of the storage unit are added being connected together, wherein preset is synchronous. 11. Self-timed RS-trigger with the enhanced noise immunity according to claim 10, characterized by that third input is added into first OR input group of second element OR-AND-NO, and fourth input is added into fourth OR—NO element, both added inputs are connected to the trigger's preset input, wherein the preset is self-timed. 12. Self-timed RS-trigger with the enhanced noise immunity according to claim 5, characterized by that the storage unit consists first and second AND-NO elements and two AND-OR—NO elements, first input of first AND-NO element is connected to first input of the storage unit and to first input of first AND input group of first AND-OR—NO element, an output of first AND-NO element is connected to first input of second AND-NO element, to second input of first AND input group of first AND-OR—NO element and to third output of the storage unit, second input of second AND-NO element is connected to second input of the storage unit and to second input of first AND input group of second AND-OR—NO element, an output of second AND-NO element is connected to second input of first AND-NO element, to first input of first AND input group of second AND-OR—NO element and to fourth output of the storage unit, an output of first AND-NO element is connected to an input of second AND input group of second AND-OR—NO element and to first output of the storage unit, an output of second AND-OR—NO element is connected to an input of second AND input group of first AND-OR—NO element and to second output of the storage unit, the preindication unit consists of third and fourth AND-NO elements, wherein first, second and third inputs of third AND-NO element are connected to first, third and fifth inputs of the preindication unit accordingly, first, second and third inputs of fourth AND-NO element are connected to second, fourth and sixth inputs of the preindication unit accordingly, outputs of fourth and third AND-NO elements are connected to first and second outputs of the preindication unit accordingly, and the paraphase data input has unit spacer. 13. Self-timed RS-trigger with the enhanced noise immunity according to claim 12, characterized by that trigger's preset input and third input of second AND-NO element of the storage unit are added being connected together, wherein preset is synchronous. 14. Self-timed RS-trigger with the enhanced noise immunity according to claim 13, characterized by that third input is added into first AND input group of second element AND-OR—NO, and fourth input is added into fourth AND-NO element, both added inputs are connected to the preset input, wherein the preset is self-timed. 15. Self-timed RS-trigger with the enhanced noise immunity according to any one of claim 3, 6, 12, 13, or 14, characterized by that the indication unit consists of OR-AND-NO element, wherein first and second inputs of first OR input group of OR-AND-NO element are connected to first and third inputs of the indication unit accordingly, first and second inputs of second OR input group of OR-AND-NO element are connected to second and fourth inputs of the indication unit accordingly, an output of OR-AND-NO element is connected to the output of the indication unit. 16. Self-timed RS-trigger with the enhanced noise immunity according to any one of claim 4, 7, 9, 10, or 11, characterized by that the indication unit consists of AND-OR—NO element, wherein first and second inputs of first AND input group of AND-OR—NO element are connected to first and third inputs of the indication unit accordingly, first and second inputs of second AND input group of AND-OR—NO element are connected to second and fourth inputs of the indication unit accordingly, an output of AND-OR—NO element is connected to the output of the indication unit. 17. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input, comprising a storage unit, an indication unit, first and second components of the paraphase data input, first and second components of a paraphase data output and an indication output, wherein first and second components of the paraphase data input are connected to first and second inputs of the storage unit respectively, the write enable input is connected to third input of the storage unit, first component of the trigger's paraphase data output is connected to first input of the indication unit, second component of the trigger's paraphase data output is connected to second input of the indication unit, the trigger's indication output is connected to the output of the indication unit, characterized by that two inverters and preindication unit are added, wherein first and second inputs of the preindication unit are connected to first and second components of the paraphase data input accordingly, an input of first inverter is connected to first output of the storage unit, an output of first inverter is connected to first component of the trigger's paraphase data output and to third input of the preindication unit, an input of second inverter is connected to second output of the storage unit, an output of second inverter is connected to second component of the trigger's paraphase data output and to fourth input of the preindication unit, fifth input of the preindication unit is connected to the write enable input, first and second outputs of the preindication unit are connected to third and fourth inputs of the indication unit, and the self-timed RS-trigger is RS-latch. 18. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 17, characterized by that a preset input of the trigger, fourth input of the storage unit and sixth input of the preindication unit are added being connected together, preset is self-timed, wherein the preset type (set or reset) is determined by both a functional characteristic of components of the trigger's paraphase data input and a type of spacer of the write enable input. 19. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 17, characterized by that the storage unit consists of two AND-OR—NO elements, first inputs of first AND input groups of first and second AND-OR—NO elements are connected to first and second inputs of the storage unit accordingly, second inputs of first AND input groups of first and second AND-OR—NO elements are connected to third input of the storage unit, an output of first AND-OR—NO element is connected to first output of the storage unit and to an input of second AND input group of second AND-OR—NO element whose output is connected to second output of the storage unit and to an input of second AND input group of first AND-OR—NO element, wherein the preindication unit consists of two AND-NO elements, first inputs of first and second AND-NO elements are connected to first and second inputs of the preindication unit accordingly, second inputs of first and second AND-NO elements are connected to third and fourth inputs of the preindication unit accordingly, third inputs of first and second AND-NO elements are connected to fifth input of the preindication unit, outputs of first and second AND-NO elements are connected to second and first outputs of the preindication unit accordingly, and the write enable input has zero spacer. 20. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 17, characterized by that the storage unit consists of two OR-AND-NO elements, wherein first inputs of first OR input groups of first and second OR-AND-NO elements are connected to first and second inputs of the storage unit accordingly, second inputs of first OR input groups of first and second OR-AND-NO elements are connected to third input of the storage unit, an output of first OR-AND-NO element is connected to first output of the storage unit and to an input of second OR input group of second OR-AND-NO element whose output is connected to second output of the storage unit and to an input of second OR input group of first OR-AND-NO element, wherein the preindication unit consists of two OR—NO elements, first inputs of first and second OR—NO elements are connected to first and second inputs of the preindication unit accordingly, second inputs of first and second OR—NO elements are connected to third and fourth inputs of the preindication unit accordingly, third inputs of first and second OR—NO elements are connected to fifth input of the preindication unit, outputs of first and second OR—NO elements are connected to second and first outputs of the preindication unit accordingly, and the write enable input has unit spacer. 21. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 18, characterized by that the storage unit consists of first and second AND-OR—NO elements, wherein first inputs of first AND input groups of first and second AND-OR—NO elements are connected to first and second inputs of the storage unit accordingly, second inputs of first AND input groups of first and second AND-OR—NO elements are connected to third input of the storage unit, an output of first AND-OR—NO element is connected to first output of the storage unit and to an input of second AND input group of second AND-OR—NO element whose output is connected to second output of the storage unit and to an input of second AND input group of first AND-OR—NO element, an input of third AND input group of second AND-OR—NO element is connected to fourth input of the storage unit, the preindication unit consists of AND-NO element and third AND-OR—NO element, wherein first, second and third inputs of AND-NO element are connected to first, third and fifth inputs of the preindication unit accordingly, first, second and third inputs of first AND input group of third AND-OR—NO element are connected to second, fourth and fifth inputs of the preindication unit accordingly, first and second inputs of second AND input group of third AND-OR—NO element are connected to fourth and sixth inputs of the preindication unit accordingly, an output of AND-NO element is connected to second output of the preindication unit, an output of third AND-OR—NO element is connected to first output of the preindication unit, and the write enable input has zero spacer. 22. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 18, characterized by that the storage unit consists of first and second OR-AND-NO elements, wherein first inputs of first OR input groups of first and second OR-AND-NO elements are connected to first and second inputs of the storage unit accordingly, second inputs of first OR input groups of first and second OR-AND-NO elements are connected to third input of the storage unit, an output of first OR-AND-NO element is connected to first output of the storage unit and to an input of second OR input group of second OR-AND-NO element whose output is connected to second output of the storage unit and to an input of second OR input group of first OR-AND-NO element, an input of third OR input group of second OR-AND-NO element is connected to fourth input of the storage unit, the preindication unit consists of OR—NO element and third OR-AND-NO element, wherein first, second and third inputs of OR—NO element are connected to first, third and fifth inputs of the preindication unit accordingly, first, second and third inputs of first OR input group of third OR-AND-NO element are connected to second, fourth and fifth inputs of the preindication unit accordingly, first and second inputs of second OR input group of third OR-AND-NO element are connected to fourth and sixth inputs of the preindication unit accordingly, an output of OR—NO element is connected to second output of the preindication unit, an output of third OR-AND-NO element is connected to first output of the preindication unit, and the write enable input has unit spacer. 23. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 17, characterized by that third and fourth outputs are added to the storage unit, and sixth and seventh inputs are added to the preindication unit being connected to third and fourth outputs of the storage unit accordingly, and the self-timed RS-trigger is RS-flip-flop. 24. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 23, characterized by that preset input of the trigger, fourth input of the storage unit and eighth input of the preindication unit are added being connected together, wherein preset is self-timed, the preset type (set or reset) is determined by both a functional characteristic of components of the trigger's paraphase data input and a type of spacer of the write enable input. 25. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 23, characterized by that the storage unit consists of first and second AND-OR—NO elements and two OR-AND-NO elements, wherein first inputs of first AND input groups of first and second AND-OR—NO elements are connected to first and second inputs of the storage unit accordingly, second inputs of first AND input groups of first and second AND-OR—NO elements are connected to third input of the storage unit and to second inputs of first OR input groups of first and second OR-AND-NO elements, an output of first AND-OR—NO element is connected to first input of first OR input group of first OR-AND-NO element, to an input of second AND input group of second AND-OR—NO element and to third output of the storage unit, an output of second AND-OR—NO element is connected to first input of first OR input group of OR input groups of second OR-AND-NO element, to an input of second AND input group of first AND-OR—NO element and to fourth output of the storage unit, an output of first OR-AND-NO element is connected to first output of the storage unit and to an input of second OR input group of second OR-AND-NO element, whose output is connected to second output of the storage unit and to an input of second OR input group of first OR-AND-NO element, the preindication unit consists of third and fourth AND-OR—NO elements, wherein first and second inputs of first AND input group of third AND-OR—NO element are connected to first and fifth inputs of the preindication unit accordingly, inputs of second and third AND input groups of third AND-OR—NO element are connected to sixth and third inputs of the preindication unit accordingly, first and second inputs of first AND input group of fourth AND-OR—NO element are connected to second and fifth inputs of the preindication unit accordingly, inputs of second and third AND input group of fourth AND-OR—NO element are connected to seventh and fourth inputs of the preindication unit accordingly, the outputs of third and fourth AND-OR—NO elements are connected to second and first outputs of the preindication unit accordingly, and the write enable input has zero spacer. 26. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 25, characterized by that preset input of the trigger, fourth input of the storage unit and eighth input of the preindication unit are added being connected together, third AND input group, whose input is connected to fourth input of the storage unit, is added to second AND-OR—NO element of the storage unit, third input is added to first OR input group of second OR-AND-NO element of the storage unit being connected to fourth input of the storage unit, fourth AND input group, whose input is connected to eighth input of the preindication unit, is added to fourth AND-OR—NO element. 27. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 23, characterized by that the storage unit consists of first and second OR-AND-NO elements and two AND-OR—NO elements, first inputs of first OR input groups of first and second OR-AND-NO elements are connected to first and second inputs of the storage unit accordingly, second inputs of first OR input groups of first and second OR-AND-NO elements are connected to third input of the storage unit and to second inputs of first AND input groups of first and second AND-OR—NO elements, an output of first OR-AND-NO element is connected to first input of first AND input group of first AND-OR—NO element, to an input of second OR input group of second OR-AND-NO element and to third output of the storage unit, an output of second OR-AND-NO element is connected to first input of first AND input group of second AND-OR—NO element, to an input of second OR input group of first OR-AND-NO element and to fourth output of the storage unit, an output of first AND-OR—NO element is connected to first output of the storage unit and to an input of second AND input group of second AND-OR—NO element, whose output is connected to second output of the storage unit and to an input of second AND input group of first AND-OR—NO element, the preindication unit consists of third and fourth OR-AND-NO elements, wherein first and second inputs of first OR input group of third OR-AND-NO element are connected to first and fifth inputs of the preindication unit accordingly, inputs of second and third OR input groups of third OR-AND-NO element are connected to sixth and third inputs of the preindication unit accordingly, first and second inputs of first OR input group of fourth OR-AND-NO element are connected to second and fifth inputs of the preindication unit accordingly, inputs of second and third OR input group of fourth OR-AND-NO element are connected to seventh and fourth inputs of the preindication unit accordingly, the outputs of third and fourth OR-AND-NO elements are connected to second and first outputs of the preindication unit accordingly, and the write enable input has unit spacer. 28. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to claim 27, characterized by that preset input of the trigger, fourth input of the storage unit and eighth input of the preindication unit are added being connected together, third OR input group, whose input is connected to fourth input of the storage unit, is added to second OR-AND-NO element of the storage unit, third input is added to first AND input group of second AND-OR—NO element of the storage unit being connected to fourth input of the storage unit, fourth OR input group, whose input is connected to eighth input of the preindication unit, is added to fourth OR-AND-NO element. 29. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to any one of claim 19, 21, 27, or 28, characterized by that the indication unit consists of OR-AND-NO element, whose first and second inputs of first OR input group are connected to first and third inputs of the indication unit accordingly, first and second inputs of second OR input group of OR-AND-NO element are connected to second and fourth inputs of the indication unit accordingly, an output of OR-AND-NO element is connected to the output of the indication unit. 30. Self-timed RS-trigger with the enhanced noise immunity having paraphase data input and write enable input according to any one of claim 20, 22, 25, or 26, characterized by that the indication unit consists of AND-OR—NO element, whose first and second inputs of first AND input group are connected to first and third inputs of the indication unit accordingly, first and second inputs of second AND input group of AND-OR—NO element are connected to second and fourth inputs of the indication unit accordingly, an output of AND-OR—NO element is connected to the output of the indication unit.

2010-05-28

en

2011-05-26

US-96970101-A

Face to face chip ABSTRACT An integrated circuit device includes first and second arrays of semiconductor dice. Each array of dice is arranged in face-to-face relation to the other array of dice, thus forming a lower layer of dice and an upper layer of dice. The layers are aligned so that each upper layer die straddles two or more of the lower layer dice, thus defining overlap regions. In the overlap regions, signal pads of one layer are aligned with corresponding signal pads of the other layer. The two layers are spaced apart, thus creating a capacitance-based communication path between the upper and lower layers via the signal paths. BACKGROUND OF THE INVENTION [0001] This invention relates generally to the field of semiconductor integrated circuits, and more specifically to communication among a collection of integrated circuits. [0002] Integrated circuit chips ordinarily communicate with one another through external wiring. Typically, this wiring lies on a printed circuit board. In order to adapt the tiny dimensions of the integrated circuit to the larger dimensions of the wires on the printed circuit board, the integrated circuit is mounted in a “package” made of plastic or ceramic. The package is large enough for people to handle easily and also provides mechanical protection for the chip. [0003] Integral to the package are a collection of metal conductors, one for each connection required on the integrated circuit. At one end, these conductors are large and physically strong enough to attach to the printed circuit board. At the other end, these conductors are of a scale similar to that of the integrated circuit. The actual connection between the integrated circuit and these package conductors is generally a gold or aluminum “bonding wire” that is welded to a pad on the integrated circuit at one end and to the small end of a package conductor at the other. [0004] Thus, there are a series of conductors of varying size between one integrated circuit and the next. First, on the integrated circuit itself, a typical conductor leading from a circuit to the periphery of the integrated circuit is about one micron in width or less. Second, still on the integrated circuit, relatively large transistors drive a bonding pad on the periphery of the integrated circuit. Such bonding pads are about 100 microns square, a very large area when compared with other parts of the integrated circuit. Third, there is the bonding wire connected to the integrated circuit at the bonding pad. The bonding wire is typically 25 microns in diameter and 400 microns in length and provides the external connection to the bonding pad. Fourth, there is the conductor in the package that connects the bonding wire to the outside of the integrated circuit package. At its small end, it is slightly larger than the bonding pad. At its large end it is of a suitable scale for mounting the integrated circuit to a printed circuit board, typically about 500 microns in size, and on a center-to-center spacing of 1250 microns. Fifth, there is the wire on the printed circuit board. It is about 500 microns wide and typically on the order of a few centimeters in length. At the next chip, there is a similar set of conductors in reverse. [0005] This elaborate arrangement of connectors from one chip to another has two drawbacks. First, it is costly. There are many parts involved and many assembly steps to put them together. The steps include making the packages, installing the integrated circuit chips in them, bonding the pads of the integrated circuit to the conductors in the package, and fastening the packages to the printed circuit board. Although each of these steps is highly automated, nevertheless they remain a major cost factor in many system designs. [0006] Second, it is electrically undesirable. The wires on the printed circuit board are about 1000 times as large as the wires on the integrated circuit. Therefore, to send a signal from one integrated circuit to another requires a large amplifier on the sending integrated circuit. Moreover, the conductors involved have a good deal of electrical capacitance and electrical inductance, both of which limit the speed at which communication can take place. Perhaps worst of all, much energy is required to send a signal through such large conductors, which causes the driving integrated circuit to dissipate considerable power. The cooling mechanisms required to get rid of the resulting head add cost and complexity to the system. [0007] Several methods have evolved to improve chip to chip interconnect. One way is to avoid several packages for the separate integrated circuits. Instead of a package for each circuit, several chips are mounted in a “multi-chip module,” a kind of communal package for the chips. The multi-chip module (MCM) contains wiring that carries some of the chip-to-chip communication circuits. The size of the wires in the MCM is smaller than the wires on a printed circuit, but not yet so small as the wiring on the chips themselves. Electrical capacitance and inductance in the wires between chips remains a problem even in MCMs. [0008] An advancement made in the field of MCM fabrication is described in U.S. Pat. No. 5,767,009, illustrating in FIG. 18 of the patent stacked plural IC devices 91, 96. FIGS. 19A-19F of the ′009 patent illustrate the fabrication steps. First, as shown in FIG. 19A, a barrier metal layer 93 of titanium, palladium, or gold is formed by the electron beam evaporation method or the like. Then, the surface is covered with a photoresist 101 using photolithographic techniques, excluding an area of a first electrode pad 92, as shown in FIG. 19B. Then, in FIG. 19C, lead- or tin-based solder which is to become bump 95 is formed on barrier metal layer 93 above electrode pad 92 by means of electroplating or the like. After removing photoresist 101, barrier metal layer 93 is etched off with aqua regia, fluoric acid, or the like, leaving an area above the electrode pad in FIG. 19D. Barrier metal 98 is formed also on second semiconductor chip 96 by the same process. Next, as shown in FIG. 19E, bump 95 of first semiconductor chip 91 is aligned to barrier metal 93 of second semiconductor chip 96, and then the two are coupled together by heating or by pressing. Then, as shown in FIG. 19F, insulation resin 100 is provided between first semiconductor chip 91 and second semiconductor chip 96, and cured; thus the mounting of first semiconductor chip 91 on second semiconductor chip 96 is completed. [0009] As can be seen, the fabrication of such multi-chip devices is not any less complicated than providing separately packaged IC devices and assembling the individual devices on a printed circuit board. The additional steps of laying down a metal layer and the various photolithographic steps increase the cost of manufacture and are a source of process problems which can lower production yields further adding to the overall cost. SUMMARY OF THE INVENTION [0010] An integrated circuit comprises first and second semiconductor dice. The first and second dice arranged so that their respective signal pads thereof are placed in face-to-face manner, forming lower and upper layers of semiconductor dice. Some of the signal pads of one die are in alignment with some of the signal pads of the other die. The first and second dice are spaced apart by air an gap, in one embodiment of the invention, and by a dielectric layer, in another embodiment of the invention. This arrangement creates capacitances between the aligned signal pad. Changing the electrical potential at a signal pad of the first die results in a corresponding electrical change at the opposing signal pad by virtue of the capacitive coupling. Signaling between the signal pads therefore is effectuated by detecting the changing electrical potential. [0011] The semiconductor dice can be of a variety of shapes. The dice are arranged in planar fashion and in a regular pattern. In one embodiment of the invention, the upper and lower layer dice are rectangular in shape. In another embodiment of the invention, the dice have an octagonal shape. [0012] A dielectric material is used to separate the first and second dice. In another variation, the signal pads are spaced apart by raised areas on the surface in which the signal pads are disposed. In yet another variation, the signal pads are spaced apart by recessing the signal pads below the surface of the semiconductor dice. BRIEF DESCRIPTION OF THE DRAWINGS [0013]FIG. 1 is a simplified diagram of overlapping integrated devices in accordance with one embodiment of the present invention. [0014]FIG. 2 shows a simplified diagram of an alternative embodiment of overlapping integrated device in accordance with the present invention. [0015]FIG. 3 illustrates an array of signaling paths provided by the present invention. [0016]FIG. 4 is a simplified cross-sectional illustration of the signaling path provided by the present invention. [0017] FIGS. 5A-5B illustrate the general shapes that IC dice can take on in accordance with the present invention. [0018] FIGS. 6A-6C illustrate alternative methods of providing separation of the IC dice. DESCRIPTION OF THE SPECIFIC EMBODIMENTS [0019]FIG. 1 shows, in schematic fashion, a top view of integrated circuit (IC) device 100 in accordance with the present invention. IC device 100 comprises first and second sets of IC semiconductor dice 110, 120. Each die is understood to contain a variety of logic and support circuitry typically found on semiconductor dice. As will be explained in connection with the embodiment illustrated in FIG. 1, dice 110, 120 are largely square in shape with corner portions removed to form octagonal elements. However, as will be discussed later, this is not a requirement for practicing the invention. [0020] The first set of dice 110 are shown oriented face-up, exposing the active side 116. As can be seen in FIG. 1, the active side has form therein a plurality of signal pads 112, also exposed to the viewer. Signal pads 112 are of the type commonly used for bonding wires to provide a signal path to the pins of an IC package. Signal pads 112 are also referred to as wire bond pads. The a real dimensions for the signal pads can be the same dimensions used for conventional wire bond pads. However, for the purposes of the present invention the particular dimensions are not critical. Signal pads 112 can be made smaller; or even larger, if a particular application calls for larger pad sizes. The signal pads do not have to be square-shaped as shown in FIG. 1, but rather can be of any shape that is convenient for a given application of the present invention, or even of varying shapes and sizes within the same die. [0021] The second set of dice 120 are shown with their active surfaces facing downward. In the embodiment shown in FIG. 1, dice 120 have substantially the same square-shaped dimensions as dice 110. Each of dice 120 includes associated signal pads 122, which are shown in phantom lines since the dice are shown face-down. As with signal pads 112 of dice 110, signal pads 122 of dice 120 can be conventional wire bond pads, or can be of different sizes and shapes. However, for reasons to be discussed below, some of the signal pads on dice 110 and some of the signal pads on dice 120 should have corresponding positions. [0022] Dice 110 are arranged so that the active sides lie substantially on a common plane forming a lower layer of semiconductor dice. Dice 110 are further arranged in an alternating and repeating pattern that resembles a checkerboard pattern of “dark squares” (namely, dice 110) and “light squares” (namely, spaces between dice 110). Similarly, dice 120 are arranged in the same checkerboard pattern to form an upper layer of semiconductor dice. Dice 120 are further arranged so as to be displaced relative to the position of dice 110 such that dice 120 are not directly positioned above dice 110. Rather, dice 120 are positioned above the “light squares” (spaces) of the checkerboard pattern formed by the lower layer of dice. [0023] Upon closer observation, it can be seen that the checkerboard pattern of the lower layer dice 110 comprises unequally sized “squares.” More specifically, the separation distance, S, between one die and its nearest neighbor on the lower layer, for example, is smaller than the width W of each die. Thus the “light squares” of the checkerboard pattern are smaller than the “dark squares.” Upper layer dice 120 are arranged in similar fashion. This arrangement is made possible by removing the corner portions 114 of dice 110 and the corner portions 124 of dice 120, thereby forming octagonal-shaped dice. This permits the dice in each layer to be cater-cornered closer to each other than would be possible had corner portions 114, 124 not been removed. The octagonal-shaped dice can thus be arranged with a resulting inter-die spacing S that is less than the die width W. [0024] This spacing arrangement results in the dice in the upper layer overlapping the dice in the lower layer to define areas of overlap 130. These areas of overlay create an opportunity for the formation of signal paths between lower layer dice 110 and upper layer dice 120. Signal pads 112 of dice 110 and signal pads 122 of dice 120 are aligned with each other in the overlap areas. Since the pads are not in physical contact with each other, there is a capacitance between signal pads 112 of the lower layer dice 110 and correspondingly aligned signal pads 122 of the upper layer dice 120. It is this capacitive coupling that provides a signal path between the lower and upper layer dice. Changes in the electrical potential of the surface metal of a signal pad cause corresponding changes in the electrical potential of the metal comprising the corresponding signal pad. Suitable drivers and sensing circuits in the respective dice make communication through this small capacitance possible. A variety of such driver circuits and sensing amplifiers are well known to those of ordinary skill in the art. [0025] It is noted that the preferred embodiment of the invention calls for proximate positioning of the lower and upper layers of chips rather than physically contacting the two layers. While the latter is contemplated, maintaining a separated layers permits subsequent replacement of a chip. [0026] The main problem of communicating between the dice in this manner is that the useful capacitance between a pair of aligned signal pads is very small. Referring to FIG. 4, a simplified schematic shows a cross-sectional representation of a pair of aligned signal pads 412 and 422 of dice 410 and 420 respectively. Dice 410 and 420 are separated by an air gap 402, thus creating a capacitance 404 between signal pads 412 and 422. Device dimensions including the vertical scale are exaggerated for illustrative purposes. As shown, pad 422 is formed in metal layer A of die 420. Pad 412 is formed in metal layer B of die 410. Die 410 also includes a conductive terminal 430 formed in another metal layer C. The dielectric material between pad 412 and terminal 430 creates another capacitance 406 between the pad and terminal. In addition, there is a capacitance 408 between pad 412 and chip substrate 416 of die 410. Assuming that the electrical potential of pad 422 is changing (as would be the case during the transmission of a signal from pad 422 to pad 412), corresponding changes to the potential at pad 412 tend to be hindered by its capacitance 408 to substrate 416. By actively driving the potential of terminal 430 so as to reduce the effective capacitance 408, the changing electrical potential of pad 422 can be detected. These capacitive shielding techniques are known and an artisan of ordinary skill in the relevant arts would realize that a variety of circuits and techniques can be used to detect the variations in electrical potential. [0027]FIG. 2 shows another embodiment of the present invention. There, a simplified illustration of an array 200 of semiconductor dice 210 and 220 is shown arranged in a lower layer of dice 210 and an upper layer of dice 220. The dice are rectangular in shape, with the dice comprising the lower layer being arranged in a brickwork pattern. Likewise, the dice in the upper layer are also arranged in a brickwork pattern. The upper layer pattern is rotated 90° relative to the lower layer dice 210. The upper layer dice 220 are aligned relative to the lower layer dice 210 so that each upper die 220 can overlap four of the lower dice. Comparing to FIG. 1, each upper layer die 120 also is shown overlapping four lower dice 110. However, the overlap areas 130 in FIG. 1 encompass only those signal pads located along the periphery of the dice. In contrast, the overlap areas 230 of the arrangement shown in FIG. 2 encompass larger areal portions of each die. [0028] With reference to FIG. 3, the larger overlap area creates an opportunity to use ball grid array (BGA) type pinouts. The simplified illustration of FIG. 3 shows a die 300 having an array of signal pads formed on one of its major surfaces, such as might be found with conventional BGA-type devices. As can be seen, most of the signal pads 302 are located within the overlap areas 230. The increased size of overlap areas 230 contains more signal pads 302 than the overlap areas 130 shown in FIG. 1. This provides more signal paths between the upper and lower layers than is possible for similarly-sized dice using the configuration illustrated in FIG. 1. [0029] Some signal pads 350, however, lie outside of the overlap areas in gaps 240 (FIG. 2) formed between the dice in the lower (or upper) layer. The gaps leave room for conductors that bring power to a die and provide a ground path for the die, and in general signal-carrying conductors. Wires are bonded to signal pads 350 using conventional wire bonding techniques. [0030] The brickwork pattern shown in FIG. 2 illustrates that side-by-side placement of the dice in each of the lower and upper layers increases the relative area of overlap. This in turn increases the number of signal pads for communication between the lower and upper layers. Although dice 210, 220 are rectangular as shown in FIG. 2, that need not be the case. As can be seen in the simplified illustrations of FIGS. 5A and 5B, the dice can take on any shape. In FIG. 5A, for example, a lower layer of dice comprises square-shaped dice 510 arranged in a first regular pattern. The upper layer dice comprise rectangular-shaped dice 520 arranged in a second regular pattern. The second pattern, however, is not the same brickwork pattern as shown in FIG. 2. The upper dice 520 are aligned relative to the lower dice 510 so that each of the upper dice straddle at least two of the lower dice. While the arrangements shown are regular patterns, irregular patterns could also be used. [0031]FIG. 5B shows an arrangement of lower dice 510 and upper dice 520 layers using square-shaped dice for both layers. Here, each layer is arranged in a matrix pattern. The upper layer dice 520 are offset so that each upper layer die overlaps four lower layer die. Various other shapes are contemplated. For example, the dice can take on a hexagonal shape. Furthermore, the dice comprising a layer need not all be the same. The layer may comprise a combination of dice of different shapes. Conventional techniques produce square- and rectangular-shaped dice. The selection of a particular shape will be driven by the particular use of the invention and the available processing technology. The invention contemplates the use of other shapes that might become available as fabrication techniques continue to evolve. [0032] With reference to FIG. 6A, a simplified cross-sectional illustration of two dice, lower layer die 610 and upper layer die 620, arranged in accordance with the invention is shown. The cross-sectional view of lower layer die 610 shows an uppermost insulation layer 632, such as silicon dioxide. Insulation layer 632 defines a first major surface 616. A metal layer 636 includes devices and traces comprising the circuitry of the semiconductor chip. The additional layers of insulation and metal which comprise the remainder of die 610 are shown in generalized manner as region 634. Vias 638 are formed through insulation layer 632 to the underlying metal layers to provide electrical access to those underlying metal layers. Signal pads 612 disposed in insulation layer 632 provide a contact surface for vias 638. [0033] The cross-sectional view of upper layer die 620 shows similar structure. There is an insulation layer 652. Below that is a metal layer 656 containing various active devices and traces. Signal pads 622 disposed in insulation layer 622 provide electrical paths to the underlying metal layer by way of vias 658. The remaining layers which constitute the rest of semiconductor die 620 are shown collectively as region 654. Disposed atop insulation layer 652 is a dielectric layer 660. [0034] The position of signal pads 612 and 622 are selected to create alignment between the pads when their respective dice are arranged in the manner disclosed above. As shown in FIG. 6A, dielectric layer 660 is formed on the surface of die 620 to provide both a dielectric medium and the spacing between signal pads to establish a capacitance-based communication path. Any appropriate conventional dielectric material is contemplated. Depending on the particular use, a high dielectric constant oil can be disposed between chip layers. [0035] Although FIG. 6A shows dielectric layer 660 being formed only on the surface of die 620, this is not necessary. It may be desirous from a processing point of view to deposit a dielectric film over both dice 610, 620. This may facilitate manufacturing by providing a uniform set of processing steps. A dielectric film would also serve to increase device reliability by providing protection for its circuits. [0036]FIG. 6B shows an alternate embodiment of the invention which does not require the formation of the dielectric layer 660 shown in FIG. 6A. In this embodiment, insulation layer 652 features raised areas 662 which provide a space 670 between the dice 610, 620. The raised portions are formed on those areas on the insulation layer which do not have signal pads. In a variation of this embodiment, both lower layer die 610 and upper layer die 620 are provided with the raised portions. This may facilitate manufacturing by providing a single mask for etching the insulation layer, instead of having two different masks, one with the raised areas and one without the raised areas. [0037]FIG. 6C shows yet another alternate embodiment of the invention which obviates the steps for forming dielectric layer 660 (FIG. 6A) and for creating raised areas 662 (FIG. 6B). In the embodiment of FIG. 6C, recesses 664 are formed in insulation layer 652 and 632 of respective dice 620 and 610. The vias 658 and 638 are brought up to the bottom of the recesses. Signal pads 622 and 612 are formed in the bottom of the recesses but are not brought to the surfaces 626 and 616 of the respective insulation layers 652 and 632. The formed signal pads are therefore recessed relative to the surfaces. When the two dice 610 and 620 are brought into face-to-face contact, a space 680 remains between signal pads 622, 612 by virtue of the pads being recessed beneath their respective surfaces 626, 616. In one variation of this embodiment, the signal pads of die 610 are flush with surface 616, while the signal pads of die 620 are recessed relative to surface 626. This may simplify manufacturing in that only one set of dice need the additional processing to produce recessed signal pads. [0038] The above embodiments can be intermixed to separate the upper and lower layer dice. For example, one set of dice may feature recessed signal pads while the other set of dice features insulation layers having raised portions. These and other variations are possible while maintaining the spirit of the invention and staying within the scope of the invention as recited in the following claims. What is claimed is: 1. An integrated circuit device comprising: a first semiconductor die having first signal pads formed on a major surface thereof; a second semiconductor die having second signal pads formed on a major surface thereof; and said first die arranged in face-to-face manner with said second die so that at least some of said first signal pads are capacitively coupled to at least some of said second signal pads. 2. The integrated circuit device of claim 1 further including a non-conductive dielectric material disposed between said first and second dice. 3. The integrated circuit device of claim 1 wherein said major surface of said first die includes a non-conductive dielectric material disposed thereupon. 4. The integrated circuit device of claim 1 wherein said major surfaces of said first and second dice have raised areas, a raised area on one die contacting an area on the other die that is absent signal pads so that said dice are spaced apart from each other. 5. The integrated circuit device of claim 1 wherein said first die includes recesses disposed in said major surface, said at least some of said first signal pads being disposed in said recesses. 6. The integrated circuit device of claim 1 further including a third semiconductor die having third signal pads formed on a major surface thereof; said first die arranged in face-to-face manner with and spaced apart from said third die; said first die overlapping both said second and third dice; said first die aligned relative to said second and third dice so that said first signal pads are aligned with some of said second and third signal pads. 7. The integrated circuit device of claim 6 wherein said signal pads of said first, second, and third dice are arranged along peripheries of the respective major surfaces thereof. 8. The integrated circuit device of claim 6 wherein said first, second, and third dice have a rectangular shape. 9. The integrated circuit device of claim 1 wherein said first and second dice have an octagonal shape. 10. An integrated circuit device comprising: a first plurality of dice arranged in a first planar array; a first set of signal pads disposed on surfaces of the first plurality of dice; a second plurality of dice arranged in a second planar array; a second set of signal pads disposed on surfaces of the second plurality of dice; wherein the first plurality of dice and the second plurality of dice are positioned within the integrated circuit device such that each die of the first plurality of dice partially overlie at least two dice of the second plurality of dice, thereby defining areas of overlap; and wherein the first plurality of dice and the second plurality of dice are positioned within the integrated circuit device such that at least some of the first set of signal pads are capacitively coupled to corresponding signal pads of the second set of signal pads. 11. The integrated circuit device of claim 10 wherein said first plurality of dice are spaced apart from said second plurality of dice by an amount sufficient to provide capacitance between some signal pads of said first plurality of dice and some signal pads of said second plurality of dice in said areas of overlap. 12. The integrated circuit device of claim 11 wherein each of said first plurality of dice is spaced apart from said second plurality of dice by a dielectric material. 13. The integrated circuit device of claim 11 wherein said first plurality of dice and said second plurality of dice have major surfaces upon which are disposed said signal pads, some portions of said major surfaces being raised relative to other portions of said major surfaces, thereby spacing apart said first plurality of dice from said second plurality of dice. 14. The integrated circuit device of claim 11 wherein said first plurality of dice and said second plurality of dice have major surfaces upon which are disposed said signal pads, some of said signal pads being recessed relative to their respective major surfaces so signal pads on said first plurality of dice are spaced apart from signal pads on said second plurality of dice. 15. The integrated circuit device of claim 10 wherein said first plurality of dice have a square shape. 16. The integrated circuit device of claim 15 wherein said second plurality of dice have a square shape, said first plurality of dice and said second plurality of dice being arranged in a repeating pattern. 17. The integrated circuit device of claim 15 wherein said second plurality of dice have a rectangular shape, said first plurality of dice and second dice being arranged in a repeating pattern. 18. The integrated circuit device of claim 10 wherein said first plurality of dice and second plurality of dice have a rectangular shape, said first plurality of dice and said second plurality of dice being arranged in a repeating pattern. 19. A method of fabricating an integrated circuit device, comprising: providing a plurality of first dice, said dice each having a first polygonal shape and having signal pads formed on a surface thereof; providing a plurality of second dice, said dice each having a second polygonal shape and having signal pads formed on a surface thereof; arranging said first dice to form a first repeating pattern; arranging said second dice to form a second repeating pattern; further arranging said first dice so that signal pads thereof are in face-to-face relation with signal pads of said second dice; aligning said first dice so that each first die overlaps at least two of said second dice, thereby defining overlap areas; further aligning said first dice so that signal pads thereof located in said overlap areas coincide with some signal pads of said second dice; capacitively coupling some signal pads of said first dice to some signal pads of said second dice in said overlap areas, thereby providing a signal path between said plurality of first and second dice. 20. The method of claim 19 wherein said steps of providing first dice and second dice include a step of forming a dielectric layer on some of said first dice and second dice, so that signal pads in said overlap areas are spaced apart. 21. The method of claim 19 wherein said first polygonal shape is a rectangle. 22. The method of claim 21 wherein said second polygonal shape is a rectangle. 23. The method of claim 21 wherein said second polygonal shape is a square. 24. The method of claim 19 wherein said first and second polygonal shapes each is an octagon.

2001-10-02

en

2002-02-07

US-202217941722-A

Solution for generating at least one installation operation for at least one ongoing installation process at an installation site ABSTRACT A method for generating at least one installation operation for at least one on-going installation process of at an installation site includes obtaining site information of the at least one ongoing installation process at the installation site from a site control unit arranged at the installation site, obtaining site information gathered from one or more previous installation processes at one or more other installation sites from one or more external databases, defining at least one installation operation for the at least one ongoing installation process based on the site information of the at least one ongoing installation process and the site information gathered from the one or more previous installation processes, and generating at least one signal including an instruction to perform the at least one installation operation for the at least one ongoing installation process to the site control unit. A computing unit, an installation support system, and a computer program performing at least partly the method are disclosed. TECHNICAL FIELD The invention concerns in general the technical field of installation operations. Especially the invention concerns installation operations of people conveyor systems or access control systems. BACKGROUND Typically, during and/or after an installation of a people conveyor system, such as an elevator system or an escalator system, or an access control system, such as an automatic door system or a gate system, one or more issues, which may require one or more installation operations to be performed, may be detected. The detected issues may be minor issues, which do not prevent the use of the system, but the issues may also be major issues preventing the use of the system. Typically, during the first year after the installation of the system substantially great amount of issues are detected increasing first year call out rates. Thus, there is need to develop further solutions in order to prevent and identify possible issues appearing during an installation process of a people conveyor system or an access control system. SUMMARY The following presents a simplified summary in order to provide basic understanding of some aspects of various invention embodiments. The summary is not an extensive overview of the invention. It is neither intended to identify key or critical elements of the invention nor to delineate the scope of the invention. The following summary merely presents some concepts of the invention in a simplified form as a prelude to a more detailed description of exemplifying embodiments of the invention. An objective of the invention is to present a method, a computing unit, an installation support system, and a computer program for generating at least one installation operation for at least one ongoing installation process at an installation site. Another objective of the invention is that the method, the computing unit, the installation support system, and the computer program for generating at least one installation operation for at least one ongoing installation process at an installation site improves identifying possible issues appearing during an installation process of a people conveyor system or an access control system. The objectives of the invention are reached by a method, a computing unit, an installation support system, and a computer program as defined by the respective independent claims. According to a first aspect, a method for generating at least one installation operation for at least one ongoing installation process of at an installation site is provided, wherein the method comprises: obtaining site information of the at least one ongoing installation process at the installation site from a site control unit arranged at the installation site, obtaining site information gathered from one or more previous installation processes at one or more other installation sites from one or more external databases, defining at least one installation operation for the at least one ongoing installation process based on the site information of the at least one ongoing installation process and the site information gathered from the one or more previous installation processes, and generating at least one signal comprising an instruction to perform the at least one installation operation for the at least one ongoing installation process to the site control unit. The installation site may be located in a people conveyor system or in an access control system. The defining step may comprise: detecting at least one issue in the site information of the at least one ongoing installation process, and defining the at least one installation operation by applying a machine learning module, wherein the machine learning module may receive the detected at least one issue in the site information of the at least one ongoing installation process as its input data and generate the at least one installation operation as the output data of the machine learning module by applying one or more machine learning techniques, and wherein the site information gathered from one or more previous installation processes at one or more other installation sites may be used as a training data to train the machine learning module. Alternatively, the defining step may comprise: detecting at least one issue in the site information of the at least one ongoing installation process, detecting a corresponding at least one issue in the site information gathered from one or more corresponding previous installation processes, detecting at least one installation operation performed in the one or more corresponding previous installation processes in response to the detected at least one issue in the site information gathered from one or more corresponding previous installation processes, and using the detected at least one installation operation performed in the one or more corresponding previous installation processes as the defined at least one installation operation for the at least one ongoing installation process. The at least one installation operation may comprise: updating site configuration, updating one or more software versions, updating one or more operation parameters, activation of one or more features, and/or performing troubleshooting. The method may further comprise generating a remote support request to a remote monitoring center based on the obtained site information of the at least one ongoing installation process and/or the defined at least one installation operation. Alternatively or in addition, the method may further comprise providing the site information of the at least one ongoing installation process and/or the defined at least one installation operation to the one or more databases for one or more coming installation processes at one or more other installation sites. The site information of the at least one ongoing installation process may be obtained, by the site control unit, from one or more installed site devices, one or more not yet installed site devices, one or more external devices or systems, and/or back reporting of one or more tools. The site information may comprise configuration information, software information, installation status information, statistical information, installation personnel information, and/or material flow information, of the respective installation process. The site information gathered from the one or more previous installation processes may further comprise: identified issues information, corrective installation operations, and/or preventive installation operations. According to a second aspect, a computing unit for generating at least one installation operation for at least one ongoing installation process at an installation site is provided, wherein the computing unit comprises a processing unit being configured to cause the computing unit at least to perform: obtain site information of the at least one ongoing installation process at the installation site from a site control unit arranged at the installation site, obtain site information gathered from one or more previous installation processes at one or more other installation sites from one or more external databases, define at least one installation operation for the at least one ongoing installation process based on the site information of the ongoing installation process and the site information gathered from the one or more previous installation processes, and generate at least one signal comprising an instruction to perform the at least one installation operation for the at least one ongoing installation process to the site control unit. The installation site may be located in a people conveyor system or in an access control system. The definition of the at least one installation operation for the at least one on-going installation process may comprise: detect at least one issue in the site information of the at least one ongoing installation process, and define the at least one installation operation by applying a machine learning module, wherein the machine learning module may be configured to receive the detected at least one issue in the site information of the at least one ongoing installation process as its input data and to generate the at least one installation operation as the output data of the machine learning module by applying one or more machine learning techniques, and wherein the site information gathered from one or more previous installation processes at one or more other installation sites may be used as a training data to train the machine learning module. Alternatively, the definition of the at least one installation operation for the at least one ongoing installation process may comprise: detect at least one issue in the site information of the at least one ongoing installation process, detect a corresponding at least one issue in the site information gathered from one or more corresponding previous installation processes, detect at least one installation operation performed in the one or more corresponding previous installation processes in response to the detected at least one issue in the site information gathered from one or more corresponding previous installation processes, and use the detected at least one installation operation performed in the one or more corresponding previous installation processes as the defined at least one installation operation for the at least one ongoing installation process. The at least one installation operation may comprise: updating site configuration, updating one or more software versions, updating one or more operation parameters, activation of one or more features, and/or performing troubleshooting. The computing unit may further be configured to generate a remote support request to a remote monitoring center based on the obtained site information of the at least one ongoing installation process and/or the defined at least one installation operation. Alternatively or in addition the computing unit may further be configured to provide the site information of the at least one ongoing installation process and/or the defined at least one installation operation to the one or more databases for one or more coming installation processes at one or more other installation sites. The site information may comprise configuration information, software information, installation status information, statistical information, installation personnel information, and/or material flow information, of the respective installation process. The site information gathered from the one or more previous installation processes may further comprise: identified issues information, corrective installation operations, and/or preventive installation operations. According to a third aspect, an installation support system for generating at least one installation operation for at least one ongoing installation process of at an installation site is provided, wherein the installation support system comprises: a site control unit arranged at the installation site, one or more external databases storing at least site information gathered from one or more previous installation processes at one or more other installation sites, and the computing unit as described above. According to a fourth aspect, a computer program is provided, wherein the computer program comprises instructions which, when executed by a processing unit of a computing unit, cause the computing unit as described above to perform the method as described above. Various exemplifying and non-limiting embodiments of the invention both as to constructions and to methods of operation, together with additional objects and advantages thereof, will be best understood from the following description of specific exemplifying and non-limiting embodiments when read in connection with the accompanying drawings. The verbs “to comprise” and “to include” are used in this document as open limitations that neither exclude nor require the existence of unrecited features. The features recited in dependent claims are mutually freely combinable unless otherwise explicitly stated. Furthermore, it is to be understood that the use of “a” or “an”, i.e. a singular form, throughout this document does not exclude a plurality. BRIEF DESCRIPTION OF FIGURES The embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings. FIG. 1 illustrates schematically an example of an installation support system according to the invention. FIG. 2 illustrates schematically an example of a method according to the invention. FIG. 3 illustrates schematically another example of an installation support system according to the invention. FIG. 4 schematically illustrates an example of components of a computing unit according to the invention. DESCRIPTION OF THE EXEMPLIFYING EMBODIMENTS FIG. 1 illustrates schematically an example of an installation support system 100 according to the invention for generating at least one installation operation for at least one ongoing installation process at an installation site. The installation support system 100 comprises a site control unit 102, one or more external databases 106 a-106 n, and a computing unit 108. The site control unit 102 is arranged at the installation site 104. The installation site 104 may be located in a people conveyor system, wherein the ongoing installation process may be an installation process of the people conveyor system or an installation process of at least part of the people conveyor system. The people conveyor system may be e.g. an elevator system, an escalator system, or a moving walkaway system. Alternatively, the installation site 104 may be located in an access control system, wherein the ongoing installation process may be an installation process of the access control system or an installation process of at least part of the access control system. The access control system may be e.g. an automatic door system or a gate system. The gate system may comprise one or more gate device, e.g. security gates. The automatic door system may comprise one or more automatic doors, e.g. elevator doors or building doors. The access control system is configured to allow access only for authorized users. The access control may be based on using keycards; tags; identification codes, such as personal identity number (PIN) code, ID number; and/or biometric technologies, such as fingerprint, facial recognition, iris recognition, retinal scan, voice recognition, etc. The computing unit 108 is communicatively coupled to the site control unit 102, the one or more external databases 106 a-106 n, and any other entities of the installation support system 100. The communication between the computing unit 108 and the other entities of the installation support system 100 may be based on one or more known communication technologies, either wired or wireless. The implementation of the computing unit 108 may be done as a stand-alone computing entity or as a distributed computing environment between a plurality of stand-alone computing entities, such as a plurality of servers providing distributed computing resource. Next an example of the method according to the invention is described by referring to FIG. 2 . FIG. 2 schematically illustrates the invention as a flow chart. At a step 202, the computing unit 108 obtains site information of at least one ongoing installation process at the installation site 104 from the site control unit 102. The site control unit 102 may obtain the site information of the at least one ongoing installation process from one or more installed site devices 302 a-302 c, one or more not yet installed site devices 304, one or more external devices or system 306 a, 306 b, and/or back reporting of one or more tools 308. The site control unit 102 provides the obtained site information to the computing unit 108. The site devices 302-302 a, 304 may comprise any devices directly connectable to the people conveyor system or to the access control system. For example, the site devices 302 a-302 a, 304 may comprise, but are not limited to, a destination operation panel (DOP), a destination guide (DG), an elevator guide (EG), an access control system card reader unit, media screen solution display unit, indoor positioning system and/or any other devices installed or to be installed to the installation site 104. Each of site device 302 a-302 a may need to be installed, i.e. at least somehow commissioned to belong as a part of site solution. This means that a technician may enter some site-specific information to the site device 302 a-302 a, e.g. manually through the device user interface (UI), showing configuration QR code to a camera unit of the site device 302 a-302 a, via an external memory device, e.g. SD card or similar, and/or via a wireless technology like NFC. The site control unit 102 may obtain site information from the one or more installed site devices 302 a-302 c as described above. Alternatively or in addition, the site control unit 102 may also perform a site inventory to obtain the site information from the site devices 302 which have not yet been commissioned. The site control unit 102 may be aware that there may be a plurality of site devices 302-302 a, 304, but a location or even role of each connected site device 302-302 a, 304 may not be currently fully known. The external devices or systems, e.g. external sensor devices, 306 a, 306 b, may comprise third-party devices or systems on the installation site 104 connected using e.g. an application programming interface (API) integration interface or some other integration interface, to the system, i.e. the people conveyor system or an access control system. For example, the installation site 104 may comprise one or more external devices or systems 306 a, 306 b, such as a video surveillance system and/or Building Management System (BMS), which may provide site information to the site control unit 102 via the integration interfaces. The one or more tools 308 may comprise e.g. one or more installation tools 308 used in the at least one ongoing installation process at the installation site 104. At a step 204, the computing unit 108 obtains site information gathered from one or more previous installation processes at one or more other installation sites from the one or more external databases 106 a-106 n. The site information gathered from the one or more previous installation processes at one or more other installation sites may be stored to the one or more external databases 106 a-106 n. The obtained site information of the at least one ongoing installation process at the installation site 104 and/or the site information gathered from one or more previous installation processes at one or more other installation sites may comprise configuration information, software information, installation status information, statistical information, installation personnel information, and/or material flow information, of the respective installation process. The site information gathered from the one or more previous installation processes may further comprise: identified issues information, corrective installation operations, and/or preventive installation operations, of the respective installation process. At a step 206, the computing unit 108 defines at least one installation operation for the at least one ongoing installation process at the installation site 104 based on the site information of the at least one ongoing installation process at the installation site 104 and the site information gathered from the one or more previous installation processes. The use of information already available from the one or more previous installation processes enables a prevention and/or an identification of issues appearing during the installation process at the installation site 104. Moreover, it eases and/or expedites a definition of the at least one installation operation suitable for the at least one ongoing installation process at the installation site 104. The at least one installation operation may be a preventive installation operation or a corrective installation operation. Alternatively or in addition, the identification of the issues appearing during the installation process at the installation site 104 may be improved and expedited. The one or more issues may be minor issues, which do not prevent the use of the system, but the one or more issues may also be major issues preventing the use of the system. The one or more issues may comprise for example, but is not limited to, faults, defects, deficiencies, outdated software versions, and/or outdated operation parameters. Moreover, the handover quality may be improved and the first year call out rates may be reduced, which in turn help maintaining installation schedule, quality and cost targets. The defining of the at least one installation operation at the step 206 may comprise detecting at least one issue in the site information of the at least one ongoing installation process and defining the at least one installation operation by applying a machine learning module 450, i.e. a machine learning model. The machine learning module 450 may receive the detected at least one issue in the site information of the at least one ongoing installation process at the installation site 104 as its input data and generate the at least one installation operation as the output data of the machine learning module 450 by applying one or more machine learning techniques. For example, the following known one or more machine learning techniques may be applied: decision trees, support vector machines, neural networks, or any suitable data-driven method. The computing unit 108 is able to infer by using the machine learning module 450 from the input data, i.e. the detected at least one issue in the site information of the at least one ongoing installation process, the typical output data of the machine learning model, i.e. what is the assumed at least one installation operation. In other words, the machine learning module 450 processes the input data, i.e. the detected at least one issue in the site information of the at least one ongoing installation process, and provides the output data, i.e. the at least one installation operation. The site information gathered from one or more previous installation processes at one or more other installation sites may be used as a training data to train the machine learning module 450. When the machine learning module 450 is trained properly, the accuracy of the generated at least one installation operation may be increased. In order to improve the training of the machine learning module 450, versatile training data may preferably be used. The accuracy of the generated at least one installation operation may also depend on the initial training data used for training of the machine learning module 450. This enables providing a continuously learning method for generating the at least one installation operation for the at least one ongoing installation process of at the installation site 104. Alternatively, the defining of the at least one installation operation at the step 206 may comprise detecting at least one issue in the site information of the at least one ongoing installation process at the installation site 104, detecting a corresponding at least one issue in the site information gathered from one or more corresponding previous installation processes, detecting at least one installation operation performed in the one or more corresponding previous installation processes in response to the detected at least one issue in the site information gathered from one or more corresponding previous installation processes, and using the detected at least one installation operation performed in the one or more corresponding previous installation processes as the defined at least one installation operation for the at least one ongoing installation process at the installation site 104. This enables providing a straight-forward and simple method for generating the at least one installation operation for the at least one ongoing installation process of at the installation site 104. At a step 208, the computing unit 108 generates at least one signal comprising an instruction to perform the at least one installation operation for the at least one ongoing installation process to the site control unit 104 in response to defining the at least one installation operation. This enables easy and fast correction of the detected issues appeared during the installation process at the installation site 104 with the at least one installation operation. The at least one installation operation may comprise updating site configuration, updating one or more software versions of the one or more installed site devices 302 a-302 c, updating one or more operation parameters, activation of one or more features, and/or performing troubleshooting. The at least one installation operation may be a preventive installation operation or a corrective installation operation. The one or more features may be customized for the installation site 104 or according to customer specific need. According to a non-limiting example the one or more features may comprise a fire, an invasion or an evacuation mode where the people conveyor system or an access control system can be used for specific situations. In this kind of mode, the people conveyor system or an access control system may be behaving a different way than in the normal operation mode. According to another non-limiting example the one or more features may comprise a cleaning mode. According to yet another non-limiting example the one or more features may comprise e.g. a VIP operation mode. The method may further comprise generating by the computing unit 108 a remote support request to a centralized remote monitoring center 310 based on the obtained site information of the at least one ongoing installation process at the installation site 104 and/or the defined at least one installation operation for the at least one ongoing installation process at the installation site 104. This enables a possibility to utilize the centralized remote monitoring center 310 to perform the defined at least one installation operation and/or at least one further installation operation in order to correct the detected issues appeared during the installation process at the installation site 104. In response to receiving the remote support request, the centralized remote monitoring center 310 may perform remotely the defined at least one installation operation and/or at least one further installation and/or support operation. Alternatively or in addition, in response to receiving the remote support request, the centralized remote monitoring center 310 may provide guidance and/or instructions for site personnel, e.g. a site engineer, at the installation site 104. Alternatively or in addition, the centralized remote monitoring center 310 may request some more details from the installation site 104 automatically or manually and/or search for similar issues from the one or more corresponding previous installation processes at the one or more other installation sites from the one or more external databases 106 a-106 n. Alternatively or in addition, the method may further comprise providing by the computing unit 108 the obtained site information of the at least one ongoing installation process at the installation site 104 and/or the defined at least one installation operation for the at least one ongoing installation process at the installation site 104 to the one or more databases 106 a-106 n for one or more coming installation processes at one or more other installation sites. This enables that the site information gathered from the at least one ongoing installation process at the installation site 104 and/or the at least one installation operation defined for the at least one ongoing installation process at the installation site 104 may be utilized in one or more coming installation processes at one or more other installation sites. Alternatively or in addition, the method may further comprise obtaining by the computing unit 108 process information of the at least one ongoing installation process at the installation site 104 and/or process information gathered from the one or more corresponding previous installation processes from one or more external databases 106 a-106 n and using by the computing unit 108 the obtained process information in the definition of the at least one installation operation for the at least one ongoing installation process at the step 206. The process information may comprise for example, but is not limited to, Building Information Mode (BIM) information; Bill of Material (BOM) information, i.e. information about what kind of material is delivered to the site; drawings; photos; testing reports; and/or manuals. This may improve further the prevention and/or identification of the issues appearing during the installation process at the installation site 104. Alternatively or in addition, this may improve further the definition of the at least one installation operation suitable for the at least one ongoing installation process at the installation site 104. Above the invention is defined referring to the method according to the invention. Next the invention will be described referring to operations of the entities of the installation support system 100 according to the invention. The computing unit 108 is configured to obtain site information of at least one ongoing installation process at the installation site 104 from the site control unit 102. The site control unit 102 may obtain the site information of the at least one ongoing installation process from one or more installed site devices 302 a-302 c, one or more not yet installed site devices 304, one or more external devices or systems 306 a, 306 b, and/or back reporting of one or more tools 308. The site control unit 102 is configured to provide the obtained site information to the computing unit 108. The site control unit 102 may be communicatively coupled to the one or more installed site devices 302 a-302 c, the one or more not yet installed site devices 304, the one or more external devices or systems 306 a, 306 b, the one or more tools 308, and any other entities at the installation site 104. The communication between the site control unit 102 and the other entities at the installation site 104 may be based on one or more known communication technologies, either wired or wireless. FIG. 3 illustrates schematically an example of an installation support system 100, wherein the installation site 104 comprises three installed site devices 302 a-302 n; one site device 304 that exists on the installation site 104, but is not yet installed; two external devices or systems 306 a, 306 b; and one tool 308 providing back reporting. However, the invention is not limited to that and the installation site 104 may comprise any other number of entities. Moreover, the installation site 104 does not need to comprise all entities illustrated in the example of FIG. 3 . Alternatively or in addition, the number of different entities at the installation site 104 may vary during the at least one installation process at the installation site 104. The computing unit 108 is further configured to obtain site information gathered from one or more previous installation processes at one or more other installation sites from the one or more external databases 106 a-106 n. The site information gathered from the one or more previous installation processes at one or more other installation sites may be stored to the one or more external databases 106 a-106 n. The obtained site information of the at least one ongoing installation process at the installation site 104 and/or the site information gathered from one or more previous installation processes at one or more other installation sites may comprise configuration information, software information, installation status information, statistical information, installation personnel information, and/or material flow information, of the respective installation process. The site information gathered from the one or more previous installation processes may further comprise: identified issues information, corrective installation operations, and/or preventive installation operations, of the respective installation process. The computing unit 108 is further configured to define at least one installation operation for the at least one ongoing installation process at the installation site 104 based on the site information of the at least one ongoing installation process at the installation site 104 and the site information gathered from the one or more previous installation processes. The use of information already available from the one or more previous installation processes enables a prevention and/or an identification of issues appearing during the installation process at the installation site 104. Moreover, it eases and/or expedites a definition of the at least one installation operation suitable for the at least one ongoing installation process at the installation site 104. The at least one installation operation may be a preventive installation operation or a corrective installation operation. Alternatively or in addition, the identification of the issues appearing during the installation process at the installation site 104 may be improved and expedited. The one or more issues may be minor issues, which do not prevent the use of the system, but the one or more issues may also be major issues preventing the use of the system. The one or more issues may comprise for example, but is not limited to, faults, defects, deficiencies, outdated software versions, and/or outdated operation parameters. Moreover, the handover quality may be improved and the first year call out rates may be reduced, which in turn help maintaining installation schedule, quality and cost targets. The definition of the at least one installation operation may comprise detecting by the computing unit 108 at least one issue in the site information of the at least one ongoing installation process and defining by the computing unit 108 the at least one installation operation by applying a machine learning module 450, i.e. a machine learning model. The machine learning module 450 may be configured to receive the detected at least one issue in the site information of the at least one ongoing installation process at the installation site 104 as its input data and to generate the at least one installation operation as the output data of the machine learning module 450 by applying one or more machine learning techniques. For example, the following known one or more machine learning techniques may be applied: decision trees, support vector machines, neural networks, or any suitable data-driven method. The computing unit 108 is able to infer by using the machine learning module 450 from the input data, i.e. the detected at least one issue in the site information of the at least one ongoing installation process, the typical output data of the machine learning model, i.e. what is the assumed at least one installation operation. In other words, the machine learning module 450 is configured to process the input data, i.e. the detected at least one issue in the site information of the at least one ongoing installation process, and to provide the output data, i.e. the at least one installation operation. The site information gathered from one or more previous installation processes at one or more other installation sites may be used as a training data to train the machine learning module 450. When the machine learning module 450 is trained properly, the accuracy of the generated at least one installation operation may be increased. In order to improve the training of the machine learning module 450, versatile training data may preferably be used. The accuracy of the generated at least one installation operation may also depend on the initial training data used for training of the machine learning module 450. This enables providing a continuously learning method for generating the at least one installation operation for the at least one ongoing installation process of at the installation site 104. Alternatively, the definition of the at least one installation operation may comprise the following operations by the computing unit 108. The computing unit 108 may be configured to detect at least one issue in the site information of the at least one ongoing installation process at the installation site 104. The computing unit 108 may further be configured to detect a corresponding at least one issue in the site information gathered from one or more corresponding previous installation processes and to detect at least one installation operation performed in the one or more corresponding previous installation processes in response to the detected at least one issue in the site information gathered from one or more corresponding previous installation processes. The computing unit 108 may further be configured to use the detected at least one installation operation performed in the one or more corresponding previous installation processes as the defined at least one installation operation for the at least one ongoing installation process at the installation site 104. This enables providing a straightforward and simple method for generating the at least one installation operation for the at least one ongoing installation process of at the installation site 104. The computing unit 108 is configured to generate at least one signal comprising an instruction to perform the at least one installation operation for the at least one ongoing installation process to the site control unit 104 in response to defining the at least one installation operation. This enables easy and fast correction of the detected issues appeared during the installation process at the installation site 104 with the at least one installation operation. The at least one installation operation may comprise updating site configuration, updating one or more software versions of the one or more installed site devices 302 a-302 c, updating one or more operation parameters, activation of one or more features, and/or performing troubleshooting. The at least one installation operation may be a preventive installation operation or a corrective installation operation. The one or more features may be customized for the installation site 104 or according to customer specific need. The computing unit 108 may further be configured to generate a remote support request to a centralized remote monitoring center 310 based on the obtained site information of the at least one ongoing installation process at the installation site 104 and/or the defined at least one installation operation for the at least one ongoing installation process at the installation site 104. This enables a possibility to utilize the centralized remote monitoring center to perform the defined at least one installation operation and/or at least one further installation operation in order to correct the detected issues appeared during the installation process at the installation site 104. The remote monitoring center 310 is illustrated as an optional entity of the installation support system 100 according to the invention in the example of FIG. 3 . In response to receiving the remote support request, the centralized remote monitoring center 310 may be configured to perform remotely the defined at least one installation operation and/or at least one further installation and/or support operation. Alternatively or in addition, in response to receiving the remote support request, the centralized remote monitoring center 310 may be configured to provide guidance and/or instructions for site personnel, e.g. a site engineer, at the installation site 104. Alternatively or in addition, the centralized remote monitoring center 310 may be configured to request some more details from the installation site 104 automatically or manually and/or search for similar issues from the one or more corresponding previous installation processes at the one or more other installation sites from the one or more external databases 106 a-106 n. Alternatively or in addition, the computing unit 108 may further be configured to provide the obtained site information of the at least one ongoing installation process at the installation site 104 and/or the defined at least one installation operation for the at least one ongoing installation process at the installation site 104 to the one or more databases 106 a-106 n for one or more coming installation processes at one or more other installation sites. This enables that the site information gathered from the at least one ongoing installation process at the installation site 104 and/or the at least one installation operation defined for the at least one ongoing installation process at the installation site 104 may be utilized in one or more coming installation processes at one or more other installation sites. Alternatively or in addition, the computing unit 108 may further be configured to obtain process information of the at least one ongoing installation process at the installation site 104 and/or process information gathered from the one or more corresponding previous installation processes from one or more external databases 106 a-106 n and to use the obtained process information in the definition of the at least one installation operation for the at least one ongoing installation process at the installation site 104. The process information may comprise for example, but is not limited to, Building Information Mode (BIM) information; Bill of Material (BOM) information, i.e. information about what kind of material is delivered to the site; drawings; photos; testing reports; and/or manuals. This may improve further the prevention and/or identification of the issues appearing during the installation process at the installation site 104. Alternatively or in addition, this may improve further the definition of the at least one installation operation suitable for the at least one ongoing installation process at the installation site 104. As discussed above the one or more external databases 106 a-106 n may be configured to store information. The information stored by the one or more external databases 106 a-106 n may comprise for example, but is not limited to, site information gathered from one or more previous installation processes at one or more other installation sites than the installation site 104 where the installation process is going on, the obtained site information of the at least one ongoing installation process at the installation site 104, the defined at least one installation operation for the at least one ongoing installation process at the installation site 104, process information of the at least one ongoing installation process at the installation site 104, process information gathered from the one or more corresponding previous installation processes at one or more other installation sites than the installation site 104 where the installation process is going on, and/or any other information. The external entity herein means an entity that locates separate from the installation site 104 and the computing unit 108. In the examples of FIGS. 1 and 3 the installation support system 100 comprises three external databases 106 a-106 n. However, the invention is not limited to that and the installation support system 100 may comprise any other number of external databases 106 a-106 n. Each external database 106 a-106 n may be configured to store information from at least one installation process at one or more installation sites. Alternatively or in addition, each external database 106 a-106 n may be configured to store at least one type of information. In other words, the stored information may be distributed between the one or more external databases 106 a-106 n based on the installation site from which the stored information is gathered or obtained and/or based on the type of the stored information. FIG. 4 schematically illustrates an example of components of the computing unit 108 according to the invention. The computing unit 108 may comprise a processing unit 410 comprising at least one processor, a memory unit 420 comprising at least one memory, a communication unit 430 comprising one or more communication devices, and possibly a user interface (UI) unit 440. The memory unit 420 may store portions of computer program code 425, the machine learning module, i.e. machine learning model, 450, and any other data, and the processing unit 410 may cause the computing unit 108 to implement the method steps as described by executing at least some portions of the computer program code 425 stored in the memory unit 420. For sake of clarity, the processor herein refers to any unit suitable for processing information and control the operation of the computing unit 108, among other tasks. The operations may also be implemented with a microcontroller solution with embedded software. Similarly, the memory is not limited to a certain type of memory only, but any memory type suitable for storing the described pieces of information may be applied in the context of the present invention. The communication unit 430 may be based on at least one known communication technologies, either wired or wireless, in order to exchange pieces of information as described earlier. The communication unit 430 provides an interface for communication with any external unit, such as the site control unit 102, the one or more external databases 106 a-106 n, the remote monitoring center 310, and/or any external systems. The communication unit 430 may comprise one or more communication devices, e.g. radio transceiver, antenna, etc. The user interface 440 may comprise I/O devices, such as buttons, keyboard, touch screen, microphone, loudspeaker, display and so on, for receiving input and outputting information. The computer program 425 may be stored in a non-statutory tangible computer readable medium, e.g. an USB stick or a CD-ROM disc. Some non-limiting examples of the computing unit 108 may e.g. be a server, cloud server, personal computer, laptop computer, computing circuit, or a network of computing devices. The specific examples provided in the description given above should not be construed as limiting the applicability and/or the interpretation of the appended claims. Lists and groups of examples provided in the description given above are not exhaustive unless otherwise explicitly stated. 1. A method for generating at least one installation operation for at least one ongoing installation process of at an installation site, the method comprising: obtaining site information of the at least one ongoing installation process at the installation site from a site control unit arranged at the installation site; obtaining site information gathered from one or more previous installation processes at one or more other installation sites from one or more external databases; defining at least one installation operation for the at least one ongoing installation process based on the site information of the at least one ongoing installation process and the site information gathered from the one or more previous installation processes; and generating at least one signal comprising an instruction to perform the at least one installation operation for the at least one ongoing installation process to the site control unit. 2. The method according to claim 1, wherein the installation site is located in a people conveyor system, or in an access control system. 3. The method according to claim 1, wherein the defining step comprises: detecting at least one issue in the site information of the at least one ongoing installation process; and defining the at least one installation operation by applying a machine learning module; wherein the machine learning module receives the detected at least one issue in the site information of the at least one ongoing installation process as its input data and generates the at least one installation operation as the output data of the machine learning module by applying one or more machine learning techniques, and wherein the site information gathered from one or more previous installation processes at one or more other installation sites is used as a training data to train the machine learning module. 4. The method according to claim 1, wherein the defining step comprises: detecting at least one issue in the site information of the at least one ongoing installation process; detecting a corresponding at least one issue in the site information gathered from one or more corresponding previous installation processes; detecting at least one installation operation performed in the one or more corresponding previous installation processes in response to the detected at least one issue in the site information gathered from one or more corresponding previous installation processes; and using the detected at least one installation operation performed in the one or more corresponding previous installation processes as the defined at least one installation operation for the at least one ongoing installation process. 5. The method according to claim 1, wherein the at least one installation operation comprises: updating site configuration, updating one or more software versions, updating one or more operation parameters, activation of one or more features, and/or performing troubleshooting. 6. The method according to claim 1, further comprising generating a remote support request to a remote monitoring center based on the obtained site information of the at least one ongoing installation process and/or the defined at least one installation operation. 7. The method according to claim 1, further comprising providing the site information of the at least one ongoing installation process and/or the defined at least one installation operation to the one or more databases for one or more coming installation processes at one or more other installation sites. 8. The method according to claim 1, wherein the site information of the at least one ongoing installation process is obtained, by the site control unit, from one or more installed site devices, one or more not yet installed site devices, one or more external devices or systems, and/or back reporting of one or more tools. 9. The method according to claim 1, wherein the site information comprises configuration information, software information, installation status information, statistical information, installation personnel information, and/or material flow information, of the respective installation process. 10. The method according to claim 9, wherein the site information gathered from the one or more previous installation processes further comprises: identified issues information, corrective installation operations, and/or preventive installation operations. 11. A computing unit for generating at least one installation operation for at least one ongoing installation process at an installation site, wherein the computing unit comprises a processing unit being configured to cause the computing unit at least to perform: obtain site information of the at least one ongoing installation process at the installation site from a site control unit arranged at the installation site; obtain site information gathered from one or more previous installation processes at one or more other installation sites from one or more external databases; define at least one installation operation for the at least one ongoing installation process based on the site information of the ongoing installation process and the site information gathered from the one or more previous installation processes; and generate at least one signal comprising an instruction to perform the at least one installation operation for the at least one ongoing installation process to the site control unit. 12. The computing unit according to claim 11, wherein the installation site is located in a people conveyor system or in an access control system. 13. The computing unit according to claim 11, wherein the definition of the at least one installation operation for the at least one ongoing installation process comprises: detect at least one issue in the site information of the at least one ongoing installation process; and define the at least one installation operation by applying a machine learning module, wherein the machine learning module is configured to receive the detected at least one issue in the site information of the at least one ongoing installation process as its input data and to generate the at least one installation operation as the output data of the machine learning module by applying one or more machine learning techniques, and wherein the site information gathered from one or more previous installation processes at one or more other installation sites is used as a training data to train the machine learning module. 14. The computing unit according to claim 11, wherein the definition of the at least one installation operation for the at least one ongoing installation process comprises: detect at least one issue in the site information of the at least one ongoing installation process; detect a corresponding at least one issue in the site information gathered from one or more corresponding previous installation processes; detect at least one installation operation performed in the one or more corresponding previous installation processes in response to the detected at least one issue in the site information gathered from one or more corresponding previous installation processes; and use the detected at least one installation operation performed in the one or more corresponding previous installation processes as the defined at least one installation operation for the at least one ongoing installation process. 15. The computing unit according to claim 11, wherein the at least one installation operation comprises: updating site configuration, updating one or more software versions, updating one or more operation parameters, activation of one or more features, and/or performing troubleshooting. 16. The computing unit according to claim 11, further configured to generate a remote support request to a remote monitoring center based on the obtained site information of the at least one ongoing installation process and/or the defined at least one installation operation. 17. The computing unit according to claim 11, further configured to provide the site information of the at least one ongoing installation process and/or the defined at least one installation operation to the one or more databases for one or more coming installation processes at one or more other installation sites. 18. The computing unit according to claim 11, wherein the site information comprises configuration information, software information, installation status information, statistical information, installation personnel information, and/or material flow information, of the respective installation process. 19. The computing unit according to claim 18, wherein the site information gathered from the one or more previous installation processes further comprises: identified issues information, corrective installation operations, and/or preventive installation operations. 20. An installation support system for generating at least one installation operation for at least one ongoing installation process of at an installation site, the installation support system comprising: a site control unit arranged at the installation site; one or more external databases storing at least site information gathered from one or more previous installation processes at one or more other installation sites; and the computing unit according to claim 11. 21. A computer program embodied on a non-transitory computer readable medium and comprising instructions which, when executed by a processing unit of a computing unit, cause the computing unit to perform the method according to claim 1.

2022-09-09

en

2023-01-05

US-201817270435-A

Light irradiation device ABSTRACT A light irradiation device includes a light source, an optical member and a sensor. The light source emits light. The optical member is supported so as to rotate around a rotation axis and includes a prism part that emits detection light based on the light. The sensor receives the detection light and detects a light amount of the detection light. The light amount of the detection light received by the sensor changes depending on a position of the optical member in a rotation direction when the optical member rotates. TECHNICAL FIELD The present invention relates to a light irradiation device that emits light. BACKGROUND ART For example, Patent Reference 1 describes a light distribution control system that controls light distribution of a head lamp illumination device corresponding to a steering angle of a steering wheel of a vehicle. In this light distribution control system, the steering angle of the steering wheel is detected by a steering sensor as a detection unit. The steering sensor includes a rotary plate having slits and rotating in conjunction with the steering of the steering wheel and a plurality of photointerrupters for detecting a rotation direction and a rotation amount (rotation angle) of the rotary plate. PRIOR ART REFERENCE Patent Reference Patent Reference 1: Japanese Patent Application Publication No. 2003-81006 (see paragraphs 0010 to 0015, FIG. 1 and FIG. 2, for example) SUMMARY OF THE INVENTION Problem to be Solved by the Invention However, each photointerrupter includes a light-emitting element and a photoreceptor element. The light-emitting element and the photoreceptor element are arranged to face each other via the rotary plate having the slits. Accordingly, there is a problem in that the configuration of the detection unit of the light distribution control system is complicated. The present invention has been made to resolve the above-described problem with the conventional technology. An object of the present invention is to provide a light irradiation device capable of detecting the position of an optical member in the rotation direction with a simple configuration. Means for Solving the Problem A light irradiation device according to the present invention includes a light source that emits light, an optical member that is supported so as to rotate around a rotation axis and includes a first prism part that emits first detection light based on the light, and a sensor that receives the first detection light and detects a light amount of the first detection light. The light amount of the first detection light received by the sensor changes depending on a position of the optical member in a rotation direction when the optical member rotates. Effect of the Invention According to the present invention, the position of the rotatably supported optical member in the rotation direction can be detected with a simple configuration. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagram schematically showing a configuration of a light irradiation device according to a first embodiment of the present invention. FIG. 2A, FIG. 2B and FIG. 2C are a front view, a side view and a top view schematically showing an optical member of the light irradiation device according to the first embodiment. FIG. 3A, FIG. 3B and FIG. 3C are diagrams showing the positional relationship between a light guide part of the optical member and an optical sensor in the light irradiation device according to the first embodiment. FIG. 4 is a diagram showing the relationship between positions of the optical member of the light irradiation device according to the first embodiment in a rotation direction and the light amount of detection light received by the optical sensor. FIG. 5A and FIG. 5B are a front view and a side view schematically showing an optical member of a light irradiation device according to a first modification of the first embodiment. FIG. 6 is a front view schematically showing a light guide part of the optical member shown in FIG. 5A. FIGS. 7A and 7B are diagrams showing a positional relationship between the light guide part of the optical member and the optical sensor shown in FIG. 5A, and FIGS. 7C and 7D are diagrams showing another positional relationship between the light guide part of the optical member and the optical sensor shown in FIG. 5A. FIG. 8A and FIG. 8B are a front view and a side view schematically showing an optical member of a light irradiation device according to a second modification of the first embodiment. FIG. 9A is a front view schematically showing a light guide part of the optical member shown in FIG. 8A, and FIG. 9B is a top view of light emission end parts of the light guide part. FIG. 10A to FIG. 10C are diagrams showing a positional relationship between the light guide part of the optical member and the optical sensor shown in FIG. 8A. FIG. 11 is a diagram schematically showing a configuration of a light irradiation device according to a second embodiment of the present invention. FIG. 12A and FIG. 12B are a front view and a side view schematically showing an optical member of the light irradiation device according to the second embodiment. FIG. 13 is a diagram schematically showing a configuration of a light irradiation device according to a third embodiment of the present invention. FIG. 14A and FIG. 14B are a front view and a side view schematically showing an optical member of the light irradiation device according to the third embodiment. MODE FOR CARRYING OUT THE INVENTION Light irradiation devices according to embodiments of the present invention will be described below with reference to drawings. The following embodiments are just examples and a variety of modifications are possible within the scope of the present invention. For easy understanding of the relationship among the drawings, coordinate axes of an xyz orthogonal coordinate system are shown as needed in each drawing. A z-axis is a coordinate axis parallel to a rotation axis of an optical member. For example, the z-axis is a coordinate axis parallel to an optical axis AP of a light source. Here, the light source is, for example, a light source 11 in FIG. 1 which will be explained later. A+z-axis direction is, for example, a direction in which light is emitted from the light source 11. An x-axis is a coordinate axis orthogonal to the z-axis. The x-axis is, for example, a coordinate axis extending in a radial direction centering at the rotation axis of the optical member. The x-axis is parallel to a width direction of the light irradiation device, for example. A y-axis is a coordinate axis orthogonal to the z-axis and the x-axis. The y-axis is, for example, a coordinate axis extending in a radial direction centering at the rotation axis of the optical member. The y-axis is parallel to a height direction of the light irradiation device, for example. In the following embodiments, the optical member rotates in order to change light distribution of irradiation light. There has been known a light irradiation device that casts light emitted from a light source, forward via two wedge prisms. When each wedge prism is rotated around a rotation axis, the light emitted from the wedge prism changes the direction of the emission. The light emitted from the wedge prisms irradiates a region in a circular region on an irradiation surface. For example, an illumination device can employ such a configuration of the light irradiation device. The illumination device changes its irradiation direction by scanning a light flux having a large diameter. The illumination device is, for example, a spotlight in a case where the target of irradiation moves. The light source of the illumination device is an LED or the like, for example. For example, a display device can employ such a configuration of the light irradiation device. The display device performs image formation or information display by scanning a light beam having a small diameter such as a laser beam. For example, a projection device can employ such a configuration of the light irradiation device. The projection device includes an image display device on its optical path. The image display device corresponds to an image formation unit which will be described later. The projection device projects an image or the like displayed by the image display device. The image display device is, for example, a liquid crystal panel, a light blocking plate in a shape of something such as a symbol, or the like. With such a configuration of the light irradiation device, the projection device is capable of moving a projection image of a symbol, an image or the like. The projection device projects image information onto a road surface, a passage, a wall or the like. Then, the projection device is capable of drawing attention, guiding a passerby, and so forth. When the projection device is employed for a vehicle, the projection device is capable of projecting an image onto a road surface or the like. Further, the projection device is capable of moving the projected image on the road surface or the like. Accordingly, the projection device is capable of, for example, proving a pedestrian with information suitable for the situation. For example, by projecting an arrow or the like onto the road surface, the projection device is capable of guiding the pedestrian to a position suitable for walking. For example, a vehicle light fixture can employ such a configuration of the light irradiation device. The vehicle light fixture is, for example, a high beam headlight of an automobile or the like. The high beam is a headlight that is used when the vehicle travels. A lighting distance of the high beam is 100 m, for example. The high beam headlight moves the position of irradiation according to a pedestrian in order to illuminate the pedestrian in front of the traveling vehicle, for example. The light irradiation device is usable as a vehicle light fixture as a low beam of an automobile or the like. The low beam is a headlight that is used when the vehicle passes by an oncoming vehicle. The lighting distance of the low beam is 30 m, for example. The light irradiation device implements light distribution required of the low beam by scanning the irradiation position at high speed, for example. Further, the light irradiation device is usable as a vehicle light fixture as a light distribution variable headlight system of an automobile or the like. The light distribution variable headlight system is an ADB (Adaptive Driving Beam) or the like, for example. The ADB extinguishes the light only in a region of dazzling the driver of a vehicle in front so as not to dazzle the driver of the vehicle in front with the high beam at the time of traveling. Further, the ADB irradiates other regions with the high beam and thereby secures visibility and promotes safety. However, when a mechanism for changing the light irradiation direction is used for a long time, an error can occur to an origin position of the rotating optical member in the rotation direction. Therefore, a light irradiation device having a function of detecting the position of the optical member in the rotation direction is necessary. Further, there is also a request for avoiding complication of the structure of the light irradiation device. Therefore, in the following embodiments, the description will be given of light irradiation devices capable of detecting the position of the optical member which rotates around a rotation axis in order to change the light distribution of the irradiation light in the rotation direction with a simple configuration. The following description will be given while regarding a stop position of the optical member as the origin position of the optical member, for example, to facilitate the explanation. However, the position where the optical member is stopped is not limited to the origin position. The origin position is an example of a predetermined stop position of the optical member. (1) First Embodiment (1-1) Configuration of First Embodiment FIG. 1 is a diagram schematically showing a configuration of a light irradiation device 1 according to a first embodiment of the present invention. FIG. 2A, FIG. 2B and FIG. 2C are a front view, a side view and a partial top view schematically showing an optical member 20 of the light irradiation device 1 according to the first embodiment. As shown in FIG. 1, the light irradiation device 1 includes the light source 11, the optical member 20 and a sensor 30. The light irradiation device 1 may include a light source control unit 11 b, a lens part 12, a radiator 13, a body tube 14, a gear 31, a gear 32, a motor 33, a motor control unit 34, a body tube 35, a wedge prism 41, a body tube 44 or an image formation unit 90. Further, a drive unit 37 includes the gear 31, the gear 32, the motor 33 and the motor control unit 34, for example. The light irradiation device 1 is, for example, a device suitable as a headlight as an illumination device of a vehicle. The light irradiation device 1 can be used as an illumination device other than the headlight that changes the light distribution, for example. Incidentally, a structure supporting the light irradiation device 1 is not shown in the drawings. (1-1-1) Light Source 11 The light source 11 emits light L0. The optical axis AP is the optical axis of the light source 11. The optical axis AP of the light source 11 is an axis extending from a center of a light emission surface 11 a of the light source 11 and orthogonal to the light emission surface 11 a, for example. Alternatively, the optical axis AP of the light source 11 is a main optical axis, for example. The main optical axis is an optical central axis of the light emitted by the light source, and is generally in a radiation direction of maximum luminosity. The light source 11 shown in FIG. 1 includes a light-emitting element. The light-emitting element is an LED (Light-Emitting Diode), a laser or the like, for example. The laser includes a semiconductor laser (LD: laser diode). The light source 11 can include a plurality of light-emitting elements. The light irradiation device 1 can include a drive circuit for driving the light source 11. The light source control unit 11 b includes the drive circuit for driving the light source 11, for example. The light source control unit 11 b makes adjustment of a light amount of the light source 11. The adjustment of the light amount includes lighting and extinguishing of the light source 11. (1-1-2) Optical Member 20 The optical member 20 is supported so as to rotate around a rotation axis AR. The rotation axis AR is parallel to the z-axis, for example. The optical member 20 is installed in the body tube 35. The body tube 35 is supported so as to rotate with respect to the body tube 14, for example. Each body tube is a body in a tube-like shape that supports a lens or a prism, blocks external light, and so forth. Light L1 based on the light L0 emitted from the light source 11 is incident upon the optical member 20. Incidentally, the light L1 is the light L0 when the lens part 12 is not used. Parallel light L1 is incident upon the optical member 20, for example. Light L1 parallel to the z-axis is incident upon the optical member 20, for example. Parallel light is incident upon the optical member 20, for example. The optical member 20 deflects the incident light L1. The deflected light includes irradiation light L2 and detection light L4. The optical member 20 emits the irradiation light L2. The optical member 20 emits the detection light L4. The optical axis AP and the rotation axis AR are the same axis, for example. The optical member 20 includes a prism part 21 and a prism part 22. The prism part 21 is a part that changes an emission direction of the irradiation light L2. The emission direction of the irradiation light L2 is changed by rotation of the optical member 20 in the rotation direction E. The rotation direction E is a circumferential direction of the optical member 20 around the rotation axis AR. As shown in FIG. 2A and FIG. 2B, the prism part 21 is a wedge prism, for example. The prism part 21 has a surface 21 a and a surface 21 b. The surface 21 a and the surface 21 b are arranged to face each other. The surface 21 a is formed on a light incidence surface's side of the optical member 20. The surface 21 a is formed on a light incidence surface of the optical member 20, for example. The surface 21 a is formed on the light source 11's side of the optical member 20. The surface 21 a is a flat surface, for example. The surface 21 a has an intersection point with the rotation axis AR. The surface 21 b is formed on a light emission surface's side of the optical member 20. The surface 21 b is formed on a light emission surface of the optical member 20, for example. The surface 21 b is a flat surface, for example. The surface 21 b has an intersection point with the rotation axis AR. The wedge prism is a prism on which the light emission surface is inclined with respect to the light incidence surface. The wedge prism has an inclined optical surface. One surface of the wedge prism is inclined with respect to another surface by a small angle. The inclination angle of the one surface of the wedge prism with respect to the other surface is referred to as a wedge angle or an apical angle. The light entering the wedge prism is refracted at an angle corresponding to the inclination angle of the wedge prism and is emitted. The light entering the wedge prism is refracted toward a direction in which the thickness of the prism increases. The light entering the wedge prism is deflected toward the direction in which the thickness of the prism increases. The angle of the light emitted from the wedge prism with respect to the light entering the wedge prism is referred to as a deflection angle. Incidentally, in the following embodiments, one surface of the wedge prism is assumed to be a surface orthogonal to the rotation axis. However, it is permissible even if the two surfaces of the wedge prism are surfaces inclined with respect to the rotation axis. Namely, the light incidence surface and the light emission surface of the wedge prism may be surfaces inclined with respect to the rotation axis. The surface 21 a and the surface 21 b are surfaces inclined with respect to each other. The surface 21 a is inclined with respect to the surface 21 b. The surface 21 a is inclined with respect to the rotation axis AR. In FIG. 1 and FIG. 2B, the surface 21 a is parallel to the x-axis and inclined with respect to the y-axis. The surface 21 b is a surface orthogonal to the rotation axis AR, for example. The surface 21 b is parallel to both of the x-axis and the y-axis. The thickness of the prism part 21 is greater on the −y-axis side than on the +y-axis side. Therefore, the light entering the prism part 21 is deflected towards the −y-axis side. The light L1 is incident upon the surface 21 a. The light L1 incident upon the surface 21 a is light parallel to the z-axis, for example. The light L1 incident upon the surface 21 a is light parallel to the rotation axis AR, for example. The light L1 is refracted at the surface 21 a. The light L1 refracted at the surface 21 a is refracted at the surface 21 b. The light L1 refracted at the surface 21 b is emitted from the surface 21 b as the irradiation light L2. The irradiation light L2 is light inclined with respect to the rotation axis AR. The irradiation light L2 is light inclined with respect to the z-axis. A traveling direction of the irradiation light L2 changes depending on the position of the optical member 20 in the rotation direction E. In other words, the light distribution of the irradiation light L2 changes depending on the position of the optical member 20 in the rotation direction E. However, it is permissible even if the surface 21 a is a surface orthogonal to the rotation axis AR and the surface 21 b is a surface inclined with respect to the rotation axis AR. In other words, it is permissible even if the surface 21 a is a surface parallel to both of the x-axis and the y-axis and the surface 21 b is a surface parallel to the x-axis and inclined with respect to the y-axis. In this case, the light L1 parallel to the z-axis is perpendicularly incident upon the surface 21 a. The light L1 parallel to the rotation axis AR is perpendicularly incident upon the surface 21 a. After entering the prism part 21 through the surface 21 a, the light L1 is refracted at the surface 21 b. The light L1 refracted at the surface 21 b is emitted from the surface 21 b as the irradiation light L2. The irradiation light L2 is light inclined with respect to the rotation axis AR. The irradiation light L2 is light inclined with respect to the z-axis. The prism part 22 extracts the detection light L4 from the light L1 that entered the optical member 20. The prism part 22 is a prism for the detection light. The prism part 22 is formed on an outer circumferential side of the optical member 20 around the rotation axis AR. The prism part 22 is formed in an outer circumferential part of the optical member 20 around the rotation axis AR. The prism part 22 is famed on a part of the prism part 21 having a small thickness, for example. The prism part 22 is formed on a part of the prism part 21 having a thickness smaller than an average wall thickness of the prism part 21, for example. The prism part 22 is formed on a part of the prism part 21 having the smallest thickness, for example. As shown in FIG. 2A and FIG. 2B, the prism part 22 has a surface 22 a and a surface 22 b. The surface 22 a and the surface 22 b are arranged to face each other. The surface 22 a is formed on the light incidence surface's side of the optical member 20. The surface 22 a is formed on the light incidence surface of the optical member 20, for example. The surface 22 a is formed on the light source 11's side of the optical member 20. The surface 22 a is a flat surface, for example. The surface 22 b is formed on the light emission surface's side of the optical member 20. The surface 22 b is formed on the light emission surface of the optical member 20, for example. The surface 22 b is on the same surface as the surface 21 b, for example. As shown in FIG. 2B, the surface 22 b forms the same surface with the surface 21 b. The surface 22 b is a flat surface, for example. The surface 22 a and the surface 22 b are surfaces inclined with respect to each other. The surface 22 a is inclined with respect to the surface 22 b. The surface 22 a is inclined with respect to the rotation axis AR. In FIG. 1 and FIG. 2B, the surface 22 a is parallel to the x-axis and inclined with respect to the y-axis. As shown in FIG. 2B, the surface 22 a is inclined in an opposite direction compared to the surface 21 a. The surface 22 b is a surface orthogonal to the rotation axis AR, for example. The surface 22 b is parallel to both of the x-axis and the y-axis. In the direction of the rotation axis AR, an outer circumferential side of the surface 22 a around the rotation axis AR is situated on the light source 11's side compared to an inner circumferential side of the surface 22 a. In the direction of the rotation axis AR, the outer circumferential side of the surface 22 a around the rotation axis AR projects towards the side from which the light L1 is incident compared to the inner circumferential side of the surface 22 a. The side from which the light L1 is incident is the −z-axis direction side. In other words, in the direction of the rotation axis AR, the outer circumferential side of the surface 22 a around the rotation axis AR projects towards an upstream side in the traveling direction of the light L1 (the −z-axis direction side) compared to the inner circumferential side of the surface 22 a. The outer circumferential side of the surface 22 a around the rotation axis AR projects in a direction (−z-axis direction) opposite to the incidence direction of the light L1 (+z-axis direction) compared to the inner circumferential side of the surface 22 a. As shown in FIG. 1, the light L1 is light parallel to the z-axis, for example. The light L1 is light parallel to the rotation axis AR, for example. The light L1 is incident upon the surface 22 a. The light L1 is refracted at the surface 22 a. The light L1 is refracted at the surface 22 a of the prism part 22. The light L1 is refracted towards the outer circumferential side of the optical member 20 around the rotation axis AR. The light L1 refracted at the surface 22 a is reflected by the surface 22 b. The light L1 refracted at the surface 22 a undergoes total reflection by the surface 22 b, for example. The light L1 refracted at the surface 22 a is reflected towards the outer circumferential side of the optical member 20 around the rotation axis AR. The light L1 reflected by the surface 22 b travels towards the outer circumferential side of the optical member 20. The light L1 is reflected by the surface 22 b and travels towards a light guide part 23. The light L1 reflected by the surface 22 b enters the light guide part 23 as the detection light L4. The light L1 passes through the light guide part 23 and is emitted. The light L1 is emitted as the detection light L4. The light L1 passes through the light guide part 23 and is emitted from a light emission end part 24 and a light emission end part 25 as the detection light L4. However, the prism part 22 may also be configured to have a surface 22 a parallel to both of the x-axis and the y-axis and a surface 22 b parallel to the x-axis and inclined with respect to the y-axis. In this case, the light L1 parallel to the z-axis enters the prism part 22 through the surface 22 a. Thereafter, the light L1 is reflected by the surface 22 b and travels towards the light guide part 23. The light L1 passes through the light guide part 23 and is emitted. The light L1 is emitted as the detection light L4. The light L1 passes through the light guide part 23 and is emitted from the light emission end part 24 and the light emission end part 25 as the detection light L4. Further, by narrowing the area of the prism part 22, ill effect on the light distribution of irradiation light L3 can be reduced. Further, by limiting the region of the prism part 22 to the outer circumferential side of the optical member 20 around the rotation axis AR, the ill effect on the light distribution of the irradiation light L3 can be reduced. Here, the ill effect is, for example, disappearance of a part of the light distribution of the irradiation light L2 or the like. The prism part 21, the prism part 22 and the light guide part 23 are formed integrally, for example. The material of the prism part 21, the prism part 22 and the light guide part 23 is transparent material. The transparent material is, glass or plastic, for example. The material of the prism part 21, the prism part 22 and the light guide part 23 is material that lets light through, for example. The light guide part 23 guides the detection light L4 deflected by the prism part 22. The detection light L4 exiting from the prism part 22 enters the light guide part 23. The light guide part 23 guides the detection light L4 exiting from the prism part 22. The light guide part 23 is provided outside the prism part 22 in the radial direction centering at the rotation axis AR. The light guide part 23 guides the detection light L4 deflected by the prism part 22 outward in the radial direction centering at the rotation axis AR. To “guide light” means to guide and transmit the light. The light guide part 23 is in a rod-like shape, for example. A cross section of the light guide part 23 is, for example, in a circular shape, a rectangular shape or the like. The detection light L4 entering the light guide part 23 is reflected by a side face of the light guide part 23. The detection light L4 entering the light guide part 23 is guided by being reflected by the side face of the light guide part 23. The reflection at the side face of the light guide part 23 is total reflection, for example. The light guide part 23 is arranged to penetrate an opening 36, for example. As shown in FIG. 2A to FIG. 2C, the light guide part 23 can include the light emission end part 24 and the light emission end part 25. The light emission end part 24 and the light emission end part 25 are arranged side by side in the rotation direction E of the optical member 20. The light emission end part 24 and the light emission end part 25 are arranged side by side in the circumferential direction of the optical member 20. The light emission end part 24 and the light emission end part 25 are arranged side by side in the circumferential direction of the optical member 20 around the rotation axis AR. The light emission end part 24 and the light emission end part 25 face outward in the radial direction of the optical member 20 centering at the rotation axis AR. Incidentally, the light guide part 23 may also be configured to have only one light emission end part. The detection light L4 deflected by the prism part 22 travels in the light guide part 23. The detection light L4 that traveled in the light guide part 23 diverges into the light emission end part 24 and the light emission end part 25. The detection light L4 that entered the light guide part 23 enters the light emission end parts 24 and 25 through light incidence parts 24 b and 25 b. The detection light L4 that entered the light emission end parts 24 and 25 respectively travels in the light emission end parts 24 and 25. The detection light L4 that traveled in the light emission end parts 24 and 25 is emitted from light emission surfaces 24 a and 25 a. The detection light L4 includes detection light L41 and detection light L42. The detection light L4 after being split is emitted from the light emission end part 24 as the detection light L41. The detection light L41 is emitted from the light emission end part 24. The detection light L4 after being split is emitted from the light emission end part 25 as the detection light L42. The detection light L42 is emitted from the light emission end part 25. As shown in FIG. 2A and FIG. 2C, a gap is formed between the light emission end part 24 and the light emission end part 25. The gap is formed with a notch or the like, for example. The gap is a notch part, for example. In the example of FIG. 2A to FIG. 2C, a notch in the shape of a V-shaped groove is formed between the light emission end part 24 and the light emission end part 25. Further, in the example of FIG. 2A to FIG. 2C, the light guide part 23 is famed so that the light amount of the detection light L41 emitted from the light emission end part 24 and the light amount of the detection light L42 emitted from the light emission end part 25 are equal to each other. In short, the light amount of the detection light L41 and the light amount of the detection light L42 are equal. In the circumferential direction of the optical member 20, a dimension from an outer end of the light emission surface 24 a of the light emission end part 24 to an outer end of the light emission surface 25 a of the light emission end part 25 is defined as a length W1. A dimension of the light emission surface 24 a, 25 a of the light emission end part 24, 25 in the z-axis direction is defined as a width D1. The dimension of the light emission surface 24 a, 25 a in the z-axis direction is a dimension in a thickness direction of the optical member 20. In the example of FIG. 2A to FIG. 2C, the length W1 and the width D1 of the light emission end parts of the light guide part 23 are equal to a length and a width of a photoreception part 30 b of the sensor 30. The length W1 and the width D1 of the light emission end parts of the light guide part 23 may also be set smaller than the dimensions of the photoreception part 30 b of the sensor 30. In other words, the length W1 and the width D1 of the light emission end parts of the light guide part 23 may be designed so that the light emission end parts fit in the range of a photoreception region of the sensor 30. Incidentally, in cases like guiding the detection light L4 to the sensor 30 by using an optical fiber or the like, for example, the photoreception part 30 b of the sensor 30 is a part of the optical fiber or the like through which the detection light L4 enters the optical fiber or the like. The optical member 20 can include the light guide part 23. However, the optical member 20 can also be configured to include no light guide part 23. Examples of such an optical member including no light guide part 23 will be described later in a second embodiment (FIG. 11) and a third embodiment (FIG. 13). As shown in FIG. 1, the light guide part 23 is arranged to penetrate the opening 36. The opening 36 is famed through a side face of the body tube 35. (1-1-3) Sensor 30 The sensor 30 receives the detection light L4. The sensor 30 detects the light amount of the detection light L4. The detection of the light amount of the detection light L4 includes detection of whether the detection light L4 is received by the sensor 30 or not. The detection of the light amount of the detection light L4 includes detection of a change in a light reception amount of the detection light L4 received by the sensor 30. The sensor 30 receives the detection light L4 deflected by the prism part 22. The light reception amount of the detection light L4 received by the sensor 30 changes depending on the position of the optical member 20 in the rotation direction E. The light amount of light received by the sensor 30 changes depending on the position of the optical member 20 in the rotation direction E. The light amount of the detection light L4 received by the sensor 30 changes depending on the position of the light guide part 23 in the rotation direction E. The sensor 30 detects the position of the optical member 20 in the rotation direction E by receiving the deflected detection light L4. The sensor 30 is capable of detecting the origin position of the optical member 20 in the rotation direction E, for example. The origin position is determined based on the light reception amount of the sensor 30, for example. The sensor 30 is an optical sensor, for example. The sensor 30 is, for example, a photodiode, a phototransistor or the like. The sensor 30 transduces light into an electric signal. In general, the sensor 30 has electrical performance capable of detecting illuminance in a range of approximately 0.1 lx to 1000 lx. (1-1-4) Lens Part 12 The lens part 12 transforms the light L0 to the light L1. The light L0 is the light emitted from the light source 11. The light L0 travels in the +z-axis direction. The light L1 travels in the +z-axis direction. The light L1 is the light entering the optical member 20. The lens part 12 condenses light, for example. The lens part 12 is a condensing lens, for example. A divergence angle of the light L1 emitted from the lens part 12 is smaller than a divergence angle of the light L0 incident upon the lens part 12. The light L1 is parallel light, for example. To “condense light” means to collect a light beam to one position or one direction. In cases where an image is projected by using the image formation unit 90 or the like, the lens part 12 is a projection lens. Here, the image includes a light distribution pattern. The focal point of the lens part 12 is situated on an image surface formed by the image formation unit 90, for example. The lens part 12 is a lens or a lens set. The lens set includes a plurality of lenses. An optical axis AC is the optical axis of the lens part 12. The optical axis AC and the rotation axis AR are the same axis, for example. The optical axis AC and the optical axis AP are the same axis, for example. (1-1-5) Drive Unit 37 The drive unit 37 includes the motor 33, the motor control unit 34, the gear 32 and the gear 31. The drive unit 37 rotates the optical member 20. The motor 33 is a stepping motor, a DC (direct current) motor or the like, for example. For example, the gear 32 is attached to a shaft of the motor 33. When the shaft of the motor 33 rotates, the gear 32 rotates. The motor 33 rotates the gear 32. The motor control unit 34 controls the rotation, stoppage, rotation direction, rotation speed, etc. of the motor 33. The motor control unit 34 includes a circuit that drives the motor 33, for example. The gear 32 transmits turning force of the motor 33 to the gear 31. The gear 32 is attached to the shaft of the motor 33, for example. The gear 32 is engaged with the gear 31. The gear 31 is provided on the body tube 35, for example. The gear 31 is provided on an outer circumferential part of the body tube 35. The gear 31 is provided on an outer circumference of the body tube 35. The body tube 35 is rotated by the turning force transmitted from the gear 32 to the gear 31. The optical member 20 is rotated by the rotation of the body tube 35. It is also possible to provide the gear 31 on an outer circumferential part of the optical member 20, for example. The optical member 20 is rotated by the turning force transmitted from the gear 32 to the gear 31. (1-1-6) Wedge Prism 41 As shown in FIG. 1, the light irradiation device 1 may include the wedge prism 41. The irradiation light L2 is incident upon the wedge prism 41. The wedge prism 41 is an optical member upon which the irradiation light L2 is incident. The irradiation light L2 is the light emitted from the optical member 20. The wedge prism 41 has a light incidence surface 42 and a light emission surface 43. The light incidence surface 42 and the light emission surface 43 are arranged to face each other. The light incidence surface 42 is formed on the optical member 20's side. The light incidence surface 42 is a flat surface, for example. The light emission surface 43 is a flat surface, for example. The light incidence surface 42 and the light emission surface 43 are surfaces inclined with respect to each other. The light incidence surface 42 is orthogonal to the optical axis AP, for example. The light incidence surface 42 is parallel to both of the x-axis and the y-axis. The light emission surface 43 is inclined with respect to the light incidence surface 42. The light emission surface 43 is inclined with respect to the optical axis AP, for example. In FIG. 1, the light emission surface 43 is parallel to the x-axis and inclined with respect to the y-axis. The optical axis AP is the optical axis of the light source 11. The thickness of the wedge prism 41 is greater on the +y-axis side than on the −y-axis side. Therefore, the light entering the wedge prism 41 is deflected towards the +y-axis side. The irradiation light L2 is refracted at the light incidence surface 42. The irradiation light L2 refracted at the light incidence surface 42 is refracted at the light emission surface 43. The irradiation light L2 refracted at the light emission surface 43 is emitted from the light emission surface 43 as the irradiation light L3. The irradiation light L3 is light inclined with respect to the z-axis. The irradiation light L3 is light inclined with respect to the optical axis AP, for example. The irradiation light L3 is light inclined with respect to the optical axis AC, for example. The irradiation light L3 is light inclined with respect to the rotation axis AR, for example. The wedge prism 41 changes the traveling direction of the irradiation light L2 and thereby emits the irradiation light L3. Specifically, the traveling direction of the irradiation light L3 is determined by the positional relationship between the prism part 21 of the optical member 20 and the wedge prism 41. The traveling direction of the irradiation light L3 is determined by a deflection direction of the prism part 21 of the optical member 20 and a deflection direction of the wedge prism 41. The light distribution of the irradiation light L3 includes the traveling direction of the irradiation light L3. Incidentally, it is permissible even if the light incidence surface 42 is a surface parallel to both of the x-axis and the y-axis and the light emission surface 43 is a surface parallel to the x-axis and inclined with respect to the y-axis. In other words, it is permissible even if the light incidence surface 42 of the wedge prism 41 is inclined with respect to the optical axis AP and the light emission surface 43 of the wedge prism 41 is orthogonal to the optical axis AP. Further, the wedge prism 41 can be rotated similarly to the optical member 20. A rotation axis of the wedge prism 41 and the rotation axis AR are the same axis, for example. The rotation axis of the wedge prism 41 and the optical axis AP are the same axis, for example. The rotation axis of the wedge prism 41 and the optical axis AC are the same axis, for example. The shapes, the number and the positions of other optical members for changing the light distribution of the irradiation light L2 are not limited to the illustrated example of the wedge prism 41. (1-1-7) Radiator 13 and Body Tubes 14, 35 and 44 The radiator 13 holds the light source 11, for example. The radiator 13 radiates heat generated in the light source 11. The body tube 14 is a body tube that does not rotate. The body tube 14 is attached to the radiator 13, for example. The body tube 14 holds the lens part 12, for example. The body tube 35 holds the optical member 20. The body tube 35 rotates around the rotation axis AR. The body tube 35 is held so as to rotate around the rotation axis AR. The body tube 35 is supported so as to rotate with respect to the body tube 14, for example. The body tube 35 is supported so as to rotate with respect to the body tube 44, for example. The body tube 35 is supported so as to rotate with respect to the light source 11, for example. The optical member 20 is rotated by the rotation of the body tube 35. The optical member 20 rotates around the rotation axis AR. The body tube 35 has the opening 36. The body tube 35 has the opening 36 in its side face. Incidentally, it is also possible to form the opening 36 with a light transmissive member. The light transmissive member is a material that lets light through. In this case, the light guide part 23 is not arranged to penetrate the opening 36. The light emission end parts 24 and 25 of the light guide part 23 are arranged to face an inner surface of the opening 36. The light emission surfaces 24 a and 25 a of the light emission end parts 24 and 25 are arranged to face the inner surface of the opening 36. The body tube 44 holds the wedge prism 41. The body tube 44 is held by the body tube 14, for example. The body tube 44 is fixed to the body tube 14, for example. The body tube 44 is held by the radiator 13, for example. The body tube 44 is fixed to the radiator 13, for example. The body tube 44 is a body tube that does not rotate. However, the body tube 44 may also be a body tube that rotates. In this case, the body tube 44 may be held by the body tube 35, for example. The body tube 44 has an opening 45. The body tube 44 has the opening 45 in its side face. The position of the opening 45 in the z-axis direction is the same as the position of the opening 36 in the z-axis direction. The position of the opening 45 in the direction of the rotation axis AR is the same as the position of the opening 36 in the direction of the rotation axis AR. The body tube 35 is rotated with respect to the body tube 44. Then, the position of the opening 45 in the circumferential direction and the position of the opening 36 in the circumferential direction are made to coincide with each other. The opening 45 is situated at a position facing the opening 36. The position where the opening 45 and the opening 36 face each other is the origin position, for example. In this case, the detection light L4 emitted from the light guide part 23 passes through the opening 45 and reaches the sensor 30. Namely, the detection light L4 emitted from the light emission end part 24 and the light emission end part 25 passes through the opening 45 and enters the photoreception part 30 b of the sensor 30. Here, the detection light L4 is the light deflected by the prism part 22 and emitted from the light guide part 23. Further, it is also possible to form the opening 45 with a light transmissive member. In this case, the light emission end parts 24 and 25 of the light guide part 23 are arranged to face an inner surface of the opening 45. The light emission surfaces 24 a and 25 a of the light emission end parts 24 and 25 are arranged to face the inner surface of the opening 45. In this case, the detection light L4 emitted from the light guide part 23 passes through the opening 36 and the opening 45 and reaches the sensor 30. Namely, the detection light L4 emitted from the light emission end part 24 and the light emission end part 25 passes through the opening 36 and the opening 45 and enters the photoreception part 30 b of the sensor 30. The detection light L4 deflected by the prism part 22 passes through the opening 36 and enters the photoreception part 30 b of the sensor 30. The detection light L4 deflected by the prism part 22 passes through the opening 45 and enters the photoreception part 30 b of the sensor 30. (1-1-8) Image Formation Unit 90 The light irradiation device 1 can be a projection device that projects an image. In this case, the lens part 12 projects an image. The lens part 12 may project an image while magnifying the image, for example. Namely, the lens part 12 is a projection lens. The image to be projected is an image formed based on the light emission surface 11 a of the light source 11, for example. The image formed based on the light emission surface 11 a of the light source 11 can include an image in which the shape and luminance distribution of the light emission surface have been changed. Further, the image to be projected is a light distribution pattern famed by the light emitted from the light source 11, for example. This light distribution pattern can include a pattern in which the light distribution of the light emitted from the light source 11 has been changed. The image formation unit 90 forms the image to be projected. For example, the lens part 12 projects the image famed by the image formation unit 90. The image formation unit 90 is arranged between the light source 11 and the lens part 12. The image formation unit 90 is arranged at the focal position of the lens part 12, for example. The lens part 12 projects the image famed by the image formation unit 90. The image is the shape of an object that is seen by an eye. The image is a reflection or the like, for example. The reflection is an image formed by refraction, reflection or the like of rays of light. The reflection can include motion video and a still image. The image can include a light distribution pattern. The image formation unit 90 is a light blocking plate, for example. The light blocking plate has a hole in the shape of an arrow or the like, for example. The arrow shape famed by the light blocking plate is projected by the lens part 12. The image formation unit 90 is a liquid crystal panel, for example. In this case, motion video or the like famed by the image formation unit 90 is projected by the lens part 12. (1-2) Operation of First Embodiment (1-2-1) Origin Position Detection Operation FIG. 3A to FIG. 3C are diagrams showing the positional relationship between the light guide part 23 of the optical member 20 and the sensor 30 in the light irradiation device 1 according to the first embodiment. FIG. 3A to FIG. 3C show positions P1, P2 and P3 when the optical member 20 rotates around the rotation axis AR. The positions P1, P2 and P3 are positions of the light emission end part 24 and the light emission end part 25 in the rotation direction E with respect to the sensor 30. The rotation direction E is the rotation direction of the optical member 20 around the rotation axis AR. FIG. 3A shows the position P1 in the rotation direction E. FIG. 3B shows the position P2 in the rotation direction E. FIG. 3C shows the position P3 in the rotation direction E. FIG. 4 is a diagram showing the relationship between the positions P1, P2 and P3 and the light amount of the detection light L4 received by the sensor 30. FIG. 4 is a diagram showing the light reception amount of the sensor 30 at the positions P1, P2 and P3. The detection light L4 includes the detection light L41 and the detection light L42. Incidentally, the light reception amount of the sensor 30 shown in FIG. 4 is the light reception amount of the light emitted from the light guide part 23. At the position P1, neither the light emission end part 24 nor the light emission end part 25 faces the sensor 30. Therefore, neither the detection light L41 emitted from the light emission end part 24 nor the detection light L42 emitted from the light emission end part 25 reaches the sensor 30. In this case, the level of a signal representing the light reception amount of the sensor 30 is zero. At the position P2, the light emission end part 24 faces the sensor 30 and the light emission end part 25 does not face the sensor 30. Therefore, the detection light L41 emitted from the light emission end part 24 reaches the sensor 30. However, the detection light L42 emitted from the light emission end part 25 does not reach the sensor 30. In this case, the level of the signal representing the light reception amount of the sensor 30 is R. R equals the level of a signal representing the light amount of the detection light L41 emitted from the light emission end part 24. In FIG. 3A to FIG. 3C, the light amount of the detection light L41 emitted from the light emission end part 24 and the light amount of the detection light L42 emitted from the light emission end part 25 are equal to each other. Therefore, even when the optical member 20 rotates in the opposite direction, the level of the signal representing the light reception amount of the sensor 30 is R in a state corresponding to the position P2. Here, the “state corresponding to the position P2” means a state in which the light emission end part 25 faces the sensor 30 and the light emission end part 24 does not face the sensor 30. At the position P3, both of the light emission end part 24 and the light emission end part 25 face the sensor 30. Therefore, both of the detection light L41 emitted from the light emission end part 24 and the detection light L42 emitted from the light emission end part 25 reach the sensor 30. In this case, the level of the signal representing the light reception amount of the sensor 30 is 2R. 2R is twice R. For example, the case where the level of the signal representing the light reception amount of the sensor 30 is 2R is considered to correspond to the origin position of the optical member 20. The light irradiation device 1 is capable of obtaining the signal level R before obtaining the signal level 2R at the origin position. Therefore, even when the optical member 20 is rotated at high speed, it is possible to reduce the rotation speed of the optical member 20 and stop the optical member 20 after obtaining the signal level R. For example, the operation of detecting the origin position and stopping the optical member 20 is an example of a positioning operation of the optical member 20. (1-2-2) Light Amount Control when Detecting Origin Position In the light irradiation device 1, the light L1 entering the prism part 22 is guided to the sensor 30. The light L1 entering the prism part 22 is, for example, light entering a peripheral part of the optical member 20. The peripheral part of the optical member 20 is situated at a periphery of the optical member 20 around the rotation axis AR. By actively guiding the light L1 entering the optical member 20 to the sensor 30 as above, the detection of the position of the optical member 20 in the rotation direction E is facilitated even when the luminance of the light source 11 is lowered, for example. In other words, it becomes easy to detect the position of the optical member 20 in the rotation direction E while lowering the light amount of the light source 11. For example, the light reception amount of the sensor 30 can be increased compared to systems in which stray light in the body tube 35 is guided to the sensor 30. The stray light in the body tube 35 leaks to the outside of the body tube 35 through the opening 36. The stray light leaking to the outside of the body tube 35 is received by the sensor 30. The light irradiation device 1 is capable of lowering the light amount at the time of returning the optical member 20 to the origin position in comparison with the light amount at the time of irradiating an irradiation object with light. For example, if the operation of returning the optical member 20 to the origin position is performed with the light amount at the time of irradiating the irradiation object with light, the irradiation light L3 shows an unexpected movement on the irradiation surface. This unexpected movement of the irradiation light L3 can lead to occurrence of an accident or the like. For example, the light irradiation device 1 erroneously guides a passerby. For example, the light irradiation device 1 dazzles the driver of a vehicle in front. The light irradiation device 1 is capable of performing the operation of returning the optical member 20 to the origin position with a small light amount. Accordingly, the light irradiation device 1 is capable of reducing the light amount of the irradiation light L3 at the time of returning the optical member 20 to the origin position. The light irradiation device 1 reduces the light amount of the light L0 emitted from the light source 11 at the time of the positioning operation of the optical member 20. The light irradiation device 1 reduces the light amount of the irradiation light L3 at the time of the positioning operation of the optical member 20. Then, the light irradiation device 1 is capable of reducing the influence of the unexpected movement of the irradiation light L3 on the irradiation surface. Here, the positioning of the optical member 20 is positioning of the optical member 20 to the position as the reference of the rotating operation of the optical member 20. (1-3) Effect of First Embodiment First, the light irradiation device 1 is capable of detecting the position of the optical member 20 in the rotation direction E by using the light L0 emitted by the light source 11. Therefore, the light irradiation device 1 does not need a light-emitting element for the detection of the position of the optical member 20 in the rotation direction E. As above, the light irradiation device 1 is capable of detecting the position of the optical member 20 in the rotation direction E with a simple configuration. The position of the optical member 20 in the rotation direction E is, for example, the stop position of the optical member 20. The position of the optical member 20 in the rotation direction E is the stop position of stopping the optical member 20 at the position as the reference. Second, the light irradiation device 1 is capable of rotating the optical member 20 at high speed until the level of the signal outputted from the sensor 30 reaches R. Accordingly, the light irradiation device 1 is capable of shortening the detection time of the origin position of the optical member 20 in the rotation direction E. Third, the light irradiation device 1 rotates the optical member 20 at low speed after the level of the signal outputted from the sensor 30 reaches R. Accordingly, the light irradiation device 1 is capable of increasing the accuracy of the stop position of the optical member 20 in the rotation direction E. Namely, the light irradiation device 1 is capable of increasing the accuracy of the origin position of the optical member 20. The origin position is the position as the reference. For example, in cases where the motor 33 is a stepping motor, the high speed rotation until the signal level reaches R is performed in the slew range of the stepping motor. Then, the low speed rotation after the signal level reaches R is performed in the self-start range of the stepping motor. The slew range is a range in which a synchronous operation is possible when the stepping motor is driven at high speed. The driving in the slew range uses slow-up slow-down control in which the stepping motor is first started in the self-start range and the pulse speed is gradually raised. The self-start range is a region in which control of starting, normal rotation or reverse rotation is possible in sync with a pulse signal inputted from the outside. Fourth, in the light irradiation device 1, the prism part 22 is provided on the light incidence surface's side of the optical member 20. Namely, it is unnecessary to provide a projection part on the light emission surface's side of the optical member 20. Therefore, the clearance between the optical member 20 and the wedge prism 41 can be narrowed. With this configuration, unnecessary light can be reduced. Further, utilization efficiency of the light emitted as the irradiation light L3 can be increased. Here, the unnecessary light means light emitted from the optical member 20 and not entering the wedge prism 41. Fifth, the light irradiation device 1 employs the optical member 20 including the light guide part 23. With this configuration, an emission region for the detection light L4 emitted from the prism part 22 can be made small. Here, the emission region for the detection light L4 is the light emission surface(s) of the light guide part 23. In the first embodiment, the light emission surfaces 24 a and 25 a of the light emission end parts 24 and 25 are shown as an example. However, it is unnecessary to provide the light guide part 23 with separate light emission end parts. In other words, it is permissible even if the light guide part 23 has only one light emission end part. Accordingly, the sizes of the opening 36 and the opening 45 can be made small. With this configuration, in the detection light L4 emitted from the prism part 22, light not entering the sensor 30 can be reduced. In other words, photoreception efficiency of the sensor 30 can be increased. Further, detection accuracy of the position of the optical member 20 in the rotation direction E can be increased. Namely, detection accuracy of the origin position of the optical member 20 can be increased. Sixth, by including the prism part 22, the light irradiation device 1 is capable of performing the operation of returning the optical member 20 to the origin position with a small light amount. Further, the light irradiation device 1 is capable of reducing the influence of the unexpected movement of the irradiation light L3 on the irradiation surface. (1-4) First Modification of First Embodiment FIG. 5A and FIG. 5B are a front view and a side view schematically showing an optical member 50 of a light irradiation device according to a first modification of the first embodiment. FIG. 6 is a front view schematically showing a light guide part 53 of the optical member 50 shown in FIG. 5A. The light irradiation device according to the first modification differs from the light irradiation device 1 shown in FIG. 1 to FIG. 4 in shapes of light emission end parts of the light guide part 53 of the optical member 50. Except for these features, the light irradiation device according to the first modification of the first embodiment is the same as the light irradiation device 1 shown in FIG. 1 to FIG. 4. Each component identical to a component of the light irradiation device 1 is assigned the same reference character as in the light irradiation device 1 and descriptions of these components are omitted. Components 51, 51 a and 51 b respectively correspond to the components 21, 21 a and 21 b. Components 52, 52 a and 52 b respectively correspond to the components 22, 22 a and 22 b. In regard to these components, the description of the light irradiation device 1 is substituted for description of the first modification. The light guide part 53 corresponds to the light guide part 23. The structure of light emission end parts 54, 55 and 56 of the light guide part 53 differs from the structure of the light emission end parts 24 and 25 of the light guide part 23. In regard to other features of the light guide part 53, the description of the light guide part 23 is substituted for description of the light guide part 53. As shown in FIG. 5A and FIG. 6, the light guide part 53 includes the light emission end part 54, the light emission end part 55 and the light emission end part 56. The light emission end part 54 emits detection light L41 a. The light emission end part 55 emits detection light L42 a. The light emission end part 56 emits detection light L43 a. A light emission surface 54 a of the light emission end part 54, a light emission surface 55 a of the light emission end part 55 and a light emission surface 56 a of the light emission end part 56 differ from each other in the area. The area of the light emission surface 54 a, 55 a, 56 a is the area of a region emitting the detection light L41 a, L42 a, L43 a. The light amounts of the detection light L41 a, the detection light L42 a and the detection light L43 a emitted from the light emission end part 54, the light emission end part 55 and the light emission end part 56 differ from each other. In FIG. 5A and FIG. 6, the light guide part 53 is formed so that the ratio among the light amounts of the detection light L41 a, the detection light L42 a and the detection light L43 a emitted from the light emission end part 54, the light emission end part 55 and the light emission end part 56 is 1:3:2, for example. The light amount of the detection light L43 a is twice the light amount of the detection light L41 a, for example. The light amount of the detection light L42 a is three times the light amount of the detection light L41 a, for example. FIG. 7A and FIG. 7C are diagrams showing a positional relationship between the light guide part 53 of the optical member 50 and the sensor 30 shown in FIG. 5A. FIG. 7B and FIG. 7D are diagrams showing the shape of the photoreception part 30 b of the sensor 30 shown in FIG. 5A. FIG. 7A shows a case of a position P4. At the position P4, the light emission end part 54 and the light emission end part 55 face the photoreception part 30 b of the sensor 30. FIG. 7C shows a case of a position P5. At the position P5, the light emission end part 55 and the light emission end part 56 face the photoreception part 30 b of the sensor 30. For example, a range of a light emission surface of a light emission end part, as the light emission surface 54 a of the light emission end part 54 and the light emission surface 55 a of the light emission end part 55 combined together, is a range in a rectangular shape having a length W2 in the circumferential direction of the optical member 50 and a length D2 in the z-axis direction. The length D2 is a length in the thickness direction of the optical member 50. Similarly, a range of a light emission surface of a light emission end part, as the light emission surface 55 a of the light emission end part 55 and the light emission surface 56 a of the light emission end part 56 combined together, is a range in a rectangular shape having the length W2 in the circumferential direction of the optical member 50 and the length D2 in the z-axis direction. Further, the range in the rectangular shape coincides with the range of the photoreception part 30 b of the sensor 30, for example. The range of the photoreception part 30 b of the sensor 30 is a range in a rectangular shape having the length W2 in a direction corresponding to the circumferential direction of the optical member 50 and the length D2 in the z-axis direction. The length in the direction corresponding to the circumferential direction of the optical member 50 is the length in the x-axis direction in the diagrams. When the light emission end part 54 and the light emission end part 55 face the photoreception part 30 b of the sensor 30 as shown in FIG. 7A and FIG. 7B, a light amount I1 is received. The light amount I1 is the sum of the light amount of the detection light L41 a emitted from the light emission end part 54 and the light amount of the detection light L42 a emitted from the light emission end part 55. When the light emission end part 55 and the light emission end part 56 face the photoreception part 30 b of the sensor 30 as shown in FIG. 7C and FIG. 7D, a light amount 12 is received. The light amount 12 is the sum of the light amount of the detection light L42 a emitted from the light emission end part 55 and the light amount of the detection light L43 a emitted from the light emission end part 56. In the case where the ratio among the light amounts of the detection light L41 a, the detection light L42 a and the detection light L43 a is 1:3:2, I1:I2=4:5 holds. Namely, the light amount 12 is 1.25 times the light amount I1. The light irradiation device according to the first modification sets the value of the light amount I1 and the value of the light amount 12 at different values. Therefore, the light irradiation device is capable of distinguishing between the position P4 of detecting the light amount I1 and the position P5 of detecting the light amount 12. Accordingly, when fine adjustment of the origin position of the optical member 50 in the rotation direction E is necessary, one of the plurality of positions P4 and P5 can be set as the origin position. (1-5) Second Modification of First Embodiment FIG. 8A and FIG. 8B are a front view and a side view schematically showing an optical member 60 of a light irradiation device according to a second modification of the first embodiment. FIG. 9A is a front view schematically showing a light guide part 63 of the optical member 60 shown in FIG. 8A. FIG. 9B is a top view of light emission end parts of the light guide part 63. The light irradiation device according to the second modification of the first embodiment differs from the light irradiation device 1 shown in FIG. 1 to FIG. 4 in the shape of the light guide part 63 of the optical member 60 and the size of the photoreception part 30 b of a sensor 30 a. Except for these features, the light irradiation device according to the second modification of the first embodiment is the same as the light irradiation device 1 shown in FIG. 1 to FIG. 4. Each component identical to a component of the light irradiation device 1 is assigned the same reference character as in the light irradiation device 1 and descriptions of these components are omitted. Components 61, 61 a and 61 b respectively correspond to the components 21, 21 a and 21 b. Components 62, 62 a and 62 b respectively correspond to the components 22, 22 a and 22 b. In regard to these components, the description of the light irradiation device 1 is substituted for description of the second modification. The light guide part 63 corresponds to the light guide part 23. The structure of light emission end parts 64, 65 and 66 of the light guide part 63 differs from the structure of the light emission end parts 24 and 25 of the light guide part 23. In regard to other features of the light guide part 63, the description given of the light guide part 23 is substituted for description of the light guide part 63. As shown in FIG. 8A, FIG. 9A and FIG. 9B, the light guide part 63 includes the light emission end part 64, the light emission end part 65 and the light emission end part 66. A light emission surface 64 a of the light emission end part 64, a light emission surface 65 a of the light emission end part 65 and a light emission surface 66 a of the light emission end part 66 are equal to each other in the area. The area of the light emission surface 64 a, 65 a, 66 a is the area of a region emitting detection light L41 b, L42 b, L43 b. The light amounts of the detection light L41 b, the detection light L42 b and the detection light L43 b emitted from the light emission end part 64, the light emission end part 65 and the light emission end part 66 differ from each other. In the circumferential direction of the optical member 60, an interval between the center of the light emission surface 64 a of the light emission end part 64 and the center of the light emission surface 65 a of the light emission end part 65 is a distance F1. Further, an interval between the center of the light emission surface 65 a of the light emission end part 65 and the center of the light emission surface 66 a of the light emission end part 66 is also the distance F1. Namely, the interval between the center of the light emission surface 64 a of the light emission end part 64 and the center of the light emission surface 65 a of the light emission end part 65 is equal to the interval between the center of the light emission surface 65 a of the light emission end part 65 and the center of the light emission surface 66 a of the light emission end part 66. Further, the light emission end part 64, the light emission end part 65 and the light emission end part 66 are formed by providing the light guide part 63 with two notch parts each in the shape of a V-shaped groove. A notch in the shape of a V-shaped groove is formed between the light emission end part 64 and the light emission end part 65. A notch in the shape of a V-shaped groove is formed between the light emission end part 65 and the light emission end part 66. As shown in FIG. 9A, at the position of bottoms of the two notch parts of the light guide part 63, the lengths of the three divided parts in the circumferential direction are W4, W5 and W6. The length of a light incidence part 64 b of the light emission end part 64 in the circumferential direction is W4. The length of a light incidence part 65 b of the light emission end part 65 in the circumferential direction is W5. The length of a light incidence part 66 b of the light emission end part 66 in the circumferential direction is W6. In FIG. 9A and FIG. 9B, the circumferential direction is the x-axis direction. At the position of the bottoms of the two notch parts of the light guide part 63, the ratio among the lengths of the three divided parts in the circumferential direction is W4:W5:W6. Each notch part is in the shape of a V-shaped groove. The three divided parts are a part including the light emission end part 64, a part including the light emission end part 65 and a part including the light emission end part 66. Incidentally, the dimensions of the light emission end parts 64, 65 and 66 in the thickness direction are the same as each other. In FIG. 9A and FIG. 9B, the thickness direction is the y-axis direction. Therefore, at the position of the bottoms of the two notch parts of the light guide part 63, the ratio among the cross-sectional areas of the three divided parts is also W4:W5:W6. The light incidence part 64 b is situated at the position of the bottoms of the notch parts in the light emission end part 64. The light incidence part 65 b is situated at the position of the bottoms of the notch parts in the light emission end part 65. The light incidence part 66 b is situated at the position of the bottoms of the notch parts in the light emission end part 66. Thus, the ratio among the areas of the light incidence part 64 b, the light incidence part 65 b and the light incidence part 66 b is W4:W5:W6. In this case, the ratio among the light amounts of the detection light L41 b, the detection light L42 b and the detection light L43 b emitted from the light emission end part 64, the light emission end part 65 and the light emission end part 66 is W4:W5:W6. The areas of the light emission surfaces 64 a, 65 a and 66 a of the light guide part 63 are the same as each other. The areas of the light incidence parts 64 b, 65 b and 66 b of the light guide part 63 are different from each other. The light amount of the detection light L41 b, L42 b, L43 b is proportional to the area of the light incidence part 64 b, 65 b, 66 b. Incidentally, distribution of the amount of light entering the light guide part 63 is considered to be uniform. FIG. 10A to FIG. 10C are diagrams showing the positional relationship between the light guide part 63 of the optical member 60 and the sensor 30 a shown in FIG. 8A. FIG. 10A to FIG. 10C show positions P6, P7 and P8. The positions P6, P7 and P8 are positions of the light emission end parts 64, 65 and 66 with respect to the sensor 30 when the optical member 60 rotates around the rotation axis AR. FIG. 10A shows a case where the position of the optical member 60 in the rotation direction E is the position P6. FIG. 10B shows a case where the position of the optical member 60 in the rotation direction E is the position P7. FIG. 10C shows a case where the position of the optical member 60 in the rotation direction E is the position P8. The shape of the photoreception part 30 b of the sensor 30 a is the same as the shape of the light emission surface 64 a of the light emission end part 64, the shape of the light emission surface 65 a of the light emission end part 65 and the shape of the light emission surface 66 a of the light emission end part 66. When the area of the photoreception part 30 b of the sensor 30 a is an area S, for example, the area of the light emission surface 64 a of the light emission end part 64, the area of the light emission surface 65 a of the light emission end part 65 and the area of the light emission surface 66 a of the light emission end part 66 can also be set at the area S. It is also possible to set the area S of the photoreception part 30 b of the sensor 30 a to be larger than the area of the light emission surface 64 a of the light emission end part 64, the area of the light emission surface 65 a of the light emission end part 65 and the area of the light emission surface 66 a of the light emission end part 66. However, the area S of the photoreception part 30 b of the sensor 30 a is desired to be an area with which the photoreception part 30 b cannot simultaneously receive detection light from a plurality of light emission end parts among the light emission end part 64, the light emission end part 65 and the light emission end part 66. Specifically, the photoreception part 30 b of the sensor 30 a is desired to be in a size with which the photoreception part 30 b cannot simultaneously receive the detection light L41 b emitted from the light emission end part 64 and the detection light L42 b emitted from the light emission end part 65, for example. At the position P6, the light emission end part 64 faces the sensor 30 a. The light emission end part 65 and the light emission end part 66 do not face the sensor 30 a. The detection light L41 b emitted from the light emission end part 64 reaches the sensor 30 a. The detection light L42 b emitted from the light emission end part 65 and the detection light L43 b emitted from the light emission end part 66 do not reach the sensor 30 a. Thus, the light reception amount of the sensor 30 a equals the light amount of the detection light L41 b emitted from the light emission end part 64. At the position P7, the light emission end part 64 does not face the sensor 30 a. The light emission end part 65 faces the sensor 30 a. The light emission end part 66 does not face the sensor 30 a. The detection light L41 b emitted from the light emission end part 64 does not reach the sensor 30 a. The detection light L42 b emitted from the light emission end part 65 reaches the sensor 30 a. The detection light L43 b emitted from the light emission end part 66 does not reach the sensor 30 a. Thus, the light reception amount of the sensor 30 a equals the light amount of the detection light L42 b emitted from the light emission end part 65. At the position P8, the light emission end part 64 and the light emission end part 65 do not face the sensor 30 a. The light emission end part 66 faces the sensor 30 a. The detection light L41 b emitted from the light emission end part 64 and the detection light L42 b emitted from the light emission end part 65 do not reach the sensor 30 a. The detection light L43 b emitted from the light emission end part 66 reaches the sensor 30 a. Thus, the light reception amount of the sensor 30 a equals the light amount of the detection light L43 b emitted from the light emission end part 66. In the light irradiation device according to the second modification, the light amounts of the detection light L41 b, the detection light L42 b and the detection light L43 b emitted from the light emission end part 64, the light emission end part 65 and the light emission end part 66 are different from each other. Accordingly, when fine adjustment of the origin position of the optical member 60 in the rotation direction E is necessary, one of the plurality of positions P6, P7 and P8 can be set as the origin position. (2) Second Embodiment FIG. 11 is a diagram schematically showing a configuration of a light irradiation device 2 according to a second embodiment of the present invention. In FIG. 11, each component identical or corresponding to a component shown in FIG. 1 (first embodiment) is assigned the same reference character as in FIG. 1. Therefore, descriptions of these components are omitted. FIG. 12A and FIG. 12B are a front view and a side view schematically showing an optical member 70 of the light irradiation device 2 according to the second embodiment. The light irradiation device 2 according to the second embodiment differs from the light irradiation device 1 according to the first embodiment in the structure of the optical member 70. Except for this feature, the light irradiation device 2 according to the second embodiment is the same as the light irradiation device 1 according to the first embodiment. Components 71, 71 a and 71 b respectively correspond to the components 21, 21 a and 21 b. In regard to these components, the description of the light irradiation device 1 is substituted for description of the light irradiation device 2. Components 72, 72 a and 72 b respectively correspond to the components 22, 22 a and 22 b. The structure of a prism part 72 differs from the structure of the prism part 22. As shown in FIG. 11, FIG. 12A and FIG. 12B, parallel light is incident upon the optical member 70, for example. The optical member 70 includes a prism part 71 and the prism part 72. The prism part 71 emits the irradiation light L2. The light distribution of the irradiation light L2 changes depending on the position of the optical member 70 in the rotation direction E. The prism part 72 emits detection light L5. The detection light L5 is emitted in an emission direction corresponding to the position of the optical member 70 in the rotation direction E. The optical member 70 deflects the incident light L1 and emits the irradiation light L2 and the detection light L5. The optical member 70 transforms the incident light L1 to the irradiation light L2 and the detection light L5. As shown in FIG. 12A and FIG. 12B, the prism part 71 is a wedge prism. The prism part 71 has a surface 71 a and a surface 71 b. The surface 71 a and the surface 71 b are arranged to face each other. The surface 71 a is formed on a light incidence surface's side of the optical member 70. The surface 71 a is formed on a light incidence surface of the optical member 70, for example. The surface 71 a is formed on the light source 11's side. The surface 71 a is a flat surface, for example. The surface 71 a has an intersection point with the rotation axis AR. The surface 71 b is formed on a light emission surface's side of the optical member 70. The surface 71 b is formed on a light emission surface of the optical member 70, for example. The surface 71 b is a flat surface, for example. The surface 71 b has an intersection point with the rotation axis AR. The surface 71 a and the surface 71 b are surfaces inclined with respect to each other. The surface 71 a is inclined with respect to the rotation axis AR. In FIG. 11 and FIG. 12B, the surface 71 a is parallel to the x-axis and inclined with respect to the y-axis. The surface 71 b is a surface orthogonal to the rotation axis AR. The surface 71 b is parallel to both of the x-axis and the y-axis. The thickness of the prism part 71 is greater on the −y-axis side than on the +y-axis side. Therefore, the light entering the prism part 71 is deflected towards the −y-axis side. The light L1 is incident upon the surface 71 a. The light L1 incident upon the surface 71 a is light parallel to the z-axis, for example. The rotation axis AR is parallel to the z-axis. The light L1 is refracted at the surface 71 a. The light L1 refracted at the surface 71 a is refracted at the surface 71 b. The light L1 refracted at the surface 71 b is emitted from the surface 71 b as the irradiation light L2. The irradiation light L2 is light inclined with respect to the rotation axis AR. The irradiation light L2 is light inclined with respect to the z-axis. The traveling direction of the irradiation light L2 changes depending on the position of the optical member 70 in the rotation direction E. In other words, the light distribution of the irradiation light L2 changes depending on the position of the optical member 70 in the rotation direction E. However, it is permissible even if the surface 71 a is a surface orthogonal to the rotation axis AR and the surface 71 b is a surface inclined with respect to the rotation axis AR. In other words, it is permissible even if the surface 71 a is a surface parallel to both of the x-axis and the y-axis and the surface 71 b is a surface parallel to the x-axis and inclined with respect to the y-axis. In this case, the light L1 parallel to the z-axis is perpendicularly incident upon the surface 71 a. After entering the prism part 71 through the surface 71 a, the light L1 is refracted at the surface 71 b. The light L1 refracted at the surface 71 b is emitted from the surface 71 b as the irradiation light L2. The irradiation light L2 is light inclined with respect to the rotation axis AR. The irradiation light L2 is light inclined with respect to the z-axis. The prism part 72 extracts the detection light L5 from the entered light L1. The prism part 72 is a prism for the detection light. The prism part 72 is famed on an outer circumferential side of the optical member 70 around the rotation axis AR. The prism part 72 is formed in an outer circumferential part of the optical member 70 around the rotation axis AR. The prism part 72 is famed on a part of the prism part 71 having a large thickness, for example. The prism part 72 is formed on a part of the prism part 71 having a thickness larger than an average wall thickness of the prism part 71, for example. The prism part 72 is formed on a part of the prism part 71 having the largest thickness, for example. As shown in FIG. 12A and FIG. 12B, the prism part 72 has a surface 72 a and a surface 72 b. The surface 72 a and the surface 72 b are arranged to face each other. The surface 72 a is formed on the light incidence surface's side of the optical member 20. The surface 72 a is formed on the light incidence surface of the optical member 20, for example. The surface 72 a is formed on the light source 11's side. The surface 72 a may be on the same surface as the surface 71 a, for example. As shown in FIG. 12B, the surface 72 a may form the same surface with the surface 71 a, for example. The surface 72 a is a flat surface, for example. The surface 72 b is formed on the light emission surface's side of the optical member 20. The surface 72 b is formed on the light emission surface of the optical member 20, for example. The surface 22 b is a flat surface, for example. The surface 72 a and the surface 72 b are surfaces inclined with respect to each other. The surface 72 b is inclined with respect to the surface 71 b. The surface 72 a is inclined with respect to the rotation axis AR. In FIG. 11 and FIG. 12B, the surface 72 a is parallel to the x-axis and inclined with respect to the y-axis. The surface 72 b is a surface inclined with respect to the rotation axis AR. The surface 72 b is parallel to the x-axis and inclined with respect to the y-axis. In the direction of the rotation axis AR, an outer circumferential side of the surface 72 a around the rotation axis AR is situated on the light source 11's side compared to an inner circumferential side of the surface 72 a. The light source 11's side is the −z-axis side. In the direction of the rotation axis AR, the outer circumferential side of the surface 72 a around the rotation axis AR projects in the direction (−z-axis direction) opposite to the incidence direction of the light L1 (+z-axis direction) compared to the inner circumferential side of the surface 72 a. In other words, in the direction of the rotation axis AR, the outer circumferential side of the surface 72 a around the rotation axis AR projects towards the upstream side in the traveling direction of the light L1 compared to the inner circumferential side of the surface 72 a. In the direction of the rotation axis AR, the outer circumferential side of the surface 72 b around the rotation axis AR projects towards an emission direction's side of the light L2 compared to the inner circumferential side of the surface 72 b. The emission direction's side is the +z-axis direction side. As shown in FIG. 11, the light L1 is light parallel to the z-axis, for example. The light L1 is light parallel to the rotation axis AR, for example. The light L1 is incident upon the surface 72 a. The light L1 is refracted at the surface 72 a. The light L1 is refracted at the surface 72 a of the prism part 72. The light L1 is refracted towards the outer circumferential side of the optical member 70 around the rotation axis AR. The light L1 refracted at the surface 72 a is reflected by the surface 72 b. The light L1 refracted at the surface 72 a undergoes total reflection by the surface 72 b, for example. The light L1 refracted at the surface 72 a is reflected towards the outer circumferential side of the optical member 70 around the rotation axis AR. The light L1 reflected by the surface 72 b travels towards the outer circumferential side of the optical member 70. The light L1 reflected by the surface 72 b is emitted from a side face 74 of the prism part 72 as the detection light L5. The light L1 reflected by the surface 72 b is emitted from a side face of the optical member 70 as the detection light L5. The side face 74 is a surface on the outer circumferential side around the rotation axis AR. Incidentally, no light guide part is provided on the outside of the prism part 72 in the radial direction centering at the rotation axis AR. However, it is also possible to provide the light guide part similarly to the first embodiment. The body tube 35 holds the optical member 70. The body tube 44 holds the wedge prism 41. The body tube 35 has the opening 36. The body tube 44 has the opening 45. The position of the opening 45 in the z-axis direction is the same as the position of the opening 36 in the z-axis direction. The body tube 35 is rotated with respect to the body tube 44. Then, the position of the opening 45 in the circumferential direction and the position of the opening 36 in the circumferential direction are made to coincide with each other. The opening 45 is situated at a position facing the opening 36. The position where the opening 45 and the opening 36 face each other is the origin position, for example. In this case, the detection light L5 emitted from the side face 74 of the prism part 72 passes through the opening 36 and reaches the opening 45. The detection light L5 emitted from the side face 74 of the prism part 72 passes through the opening 45 and reaches the sensor 30. Namely, the detection light L5 emitted from the side face 74 of the prism part 72 passes through the opening 45 and enters the photoreception part 30 b of the sensor 30. Here, the detection light L4 is the light deflected by the prism part 72 and emitted from the side face 74 of the prism part 72. Incidentally, in the optical member 70, the side face 74 of the prism part 72 is the side face of the optical member 70. The sensor 30 receives the detection light L5. The sensor 30 receives the detection light L5 at a light amount depending on the position of the optical member 70 in the rotation direction E. The sensor 30 receives the detection light L5 deflected by the prism part 72. The sensor 30 detects the position of the optical member 70 in the rotation direction E by receiving the deflected detection light L5. The sensor 30 is capable of detecting the origin position of the optical member 70 in the rotation direction E, for example. As described above, the light irradiation device 2 is capable of detecting the position of the optical member 70 in the rotation direction E by using the light L0 emitted by the light source 11. As above, the light irradiation device 2 is capable of detecting the position of the optical member 70 in the rotation direction E with a simple configuration. The position of the optical member 70 in the rotation direction E is the origin position, for example. Further, since the light irradiation device 2 includes no light guide part, the configuration can be simplified further. (3) Third Embodiment FIG. 13 is a diagram schematically showing a configuration of a light irradiation device 3 according to a third embodiment of the present invention. In FIG. 13, each component identical or corresponding to a component shown in FIG. 1 (first embodiment) is assigned the same reference character as in FIG. 1. Therefore, descriptions of these components are omitted. FIG. 14A and FIG. 14B are a front view and a side view schematically showing an optical member 80 of the light irradiation device 3 according to the third embodiment. The light irradiation device 3 according to the third embodiment differs from the light irradiation device 1 according to the first embodiment in the structure of the optical member 80. In other words, the light irradiation device 3 according to the third embodiment differs from the light irradiation device 1 according to the first embodiment in that the optical member 80 includes no light guide part. Except for this feature, the light irradiation device 3 according to the third embodiment is the same as the light irradiation device 1 according to the first embodiment. In regard to features other than including no light guide part, the description of the light irradiation device 1 is substituted for description of the light irradiation device 3. As shown in FIG. 13, FIG. 14A and FIG. 14B, parallel light is incident upon the optical member 80, for example. The optical member 80 includes a prism part 81 and a prism part 82. The optical member 80 deflects the incident light L1 and emits the irradiation light L2 and detection light L6. The optical member 80 transforms the incident light L1 to the irradiation light L2 and the detection light L6. The prism part 81 is a part that changes the emission direction of the irradiation light L2. The prism part 81 emits the irradiation light L2. The light distribution of the irradiation light L2 changes depending on the position of the optical member 80 in the rotation direction E. The emission direction of the irradiation light L2 is changed by the rotation of the optical member 80 in the rotation direction E. The prism part 82 extracts the detection light L6 from the entered light L1. The prism part 82 is a prism for the detection light. The prism part 82 emits the detection light L6 in an emission direction corresponding to the position of the optical member 80 in the rotation direction E. The prism part 81 corresponds to the prism part 21. A surface 81 a corresponds to the surface 21 a. A surface 81 b corresponds to the surface 21 b. The prism part 82 corresponds to the prism part 22. A surface 82 a corresponds to the surface 22 a. A surface 82 b corresponds to the surface 22 b. In regard to these components, the description of the light irradiation device 1 is substituted for description of the light irradiation device 3. As shown in FIG. 14A and FIG. 14B, the prism part 81 is a wedge prism. The prism part 81 has the surface 81 a and the surface 81 b. The surface 81 a and the surface 81 b are arranged to face each other. The surface 81 a and the surface 81 b are surfaces inclined with respect to each other. The surface 81 a is inclined with respect to the surface 81 b. The surface 81 a is inclined with respect to the rotation axis AR. In FIG. 13 and FIG. 14B, the surface 81 a is parallel to the x-axis and inclined with respect to the y-axis. The surface 81 b is a surface orthogonal to the rotation axis AR, for example. The surface 81 b is parallel to both of the x-axis and the y-axis. The thickness of the prism part 81 is greater on the −y-axis side than on the +y-axis side. Therefore, the light entering the prism part 81 is deflected towards the −y-axis side. The light L1 is incident upon the surface 81 a. The light L1 incident upon the surface 81 a is light parallel to the z-axis, for example. The light L1 is refracted at the surface 81 a. The light L1 refracted at the surface 81 a is refracted at the surface 81 b. The light L1 refracted at the surface 81 b is emitted from the surface 81 b as the irradiation light L2. The irradiation light L2 is light inclined with respect to the rotation axis AR. The irradiation light L2 is light inclined with respect to the z-axis. The traveling direction of the irradiation light L2 changes depending on the position of the optical member 80 in the rotation direction E. In other words, the light distribution of the irradiation light L2 changes depending on the position of the optical member 80 in the rotation direction E. However, it is permissible even if the surface 81 a is a surface orthogonal to the rotation axis AR and the surface 81 b is a surface inclined with respect to the rotation axis AR. In other words, it is permissible even if the surface 81 a is a surface parallel to both of the x-axis and the y-axis and the surface 81 b is a surface parallel to the x-axis and inclined with respect to the y-axis. In this case, the light L1 parallel to the z-axis is perpendicularly incident upon the surface 81 a. After entering the prism part 81 through the surface 81 a, the light L1 is refracted at the surface 81 b. The light L1 refracted at the surface 81 b is emitted from the surface 81 b as the irradiation light L2. The irradiation light L2 is light inclined with respect to the rotation axis AR. The irradiation light L2 is light inclined with respect to the z-axis. The prism part 82 extracts the detection light L6 from the entered light. The prism part 82 is a prism for the detection light. The prism part 82 is famed on an outer circumferential side of the optical member 80 around the rotation axis AR. The prism part 82 is formed in an outer circumferential part of the optical member 80 around the rotation axis AR. The prism part 82 is famed on a part of the prism part 81 having a small thickness, for example. The prism part 82 is formed on a part of the prism part 81 having a thickness smaller than an average wall thickness of the prism part 81, for example. The prism part 82 is formed on a part of the prism part 81 having the smallest thickness, for example. As shown in FIG. 14A and FIG. 14B, the prism part 82 has the surface 82 a and the surface 82 b. The surface 82 a and the surface 82 b are arranged to face each other. The surface 82 a and the surface 82 b are surfaces inclined with respect to each other. The surface 82 b is inclined with respect to the surface 81 b. The surface 82 a is a surface inclined with respect to the rotation axis AR. In FIG. 13 and FIG. 14B, the surface 82 a is parallel to the x-axis and inclined with respect to the y-axis. As shown in FIG. 14B, the surface 82 a is inclined in an opposite direction compared to the surface 81 a. The surface 82 b is a surface orthogonal to the rotation axis AR, for example. The surface 82 b is parallel to both of the x-axis and the y-axis. In the direction of the rotation axis AR, an outer circumferential side of the surface 82 a around the rotation axis AR is situated on the light source 11's side compared to an inner circumferential side of the surface 82 a. In the direction of the rotation axis AR, the outer circumferential side of the surface 82 a around the rotation axis AR projects towards the side from which the light L1 is incident compared to the inner circumferential side of the surface 82 a. The side from which the light L1 is incident is the −z-axis direction side. The outer circumferential side of the surface 82 a around the rotation axis AR projects in a direction (−z-axis direction) opposite to the incidence direction of the light L1 (+z-axis direction) compared to the inner circumferential side of the surface 82 a. In other words, in the direction of the rotation axis AR, the outer circumferential side of the surface 82 a around the rotation axis AR projects towards the upstream side in the traveling direction of the light L1 compared to the inner circumferential side of the surface 82 a. As shown in FIG. 13, the light L1 is light parallel to the z-axis, for example. The light L1 is light parallel to the rotation axis AR, for example. The light L1 is incident upon the surface 82 a. The light L1 is refracted at the surface 82 a. The light L1 is refracted at the surface 82 a of the prism part 82. The light L1 is refracted towards the outer circumferential side of the optical member 80 around the rotation axis AR. The light L1 refracted at the surface 82 a is reflected by the surface 82 b. The light L1 refracted at the surface 82 a undergoes total reflection by the surface 82 b, for example. The light L1 refracted at the surface 82 a is reflected towards the outer circumferential side of the optical member 80 around the rotation axis AR. The light L1 reflected by the surface 82 b travels towards the outer circumferential side of the optical member 80. The light L1 reflected by the surface 82 b is emitted from a side face 84 of the prism part 82 as the detection light L6. The side face 84 is a surface on the outer circumferential side around the rotation axis AR. The side face 84 of the prism part 82 is a side face of the optical member 80, for example. However, the prism part 82 may also be configured to have a surface 82 a parallel to both of the x-axis and the y-axis and a surface 82 b parallel to the x-axis and inclined with respect to the y-axis. In the direction of the rotation axis AR, the outer circumferential side of the surface 82 b around the rotation axis AR projects towards the emission direction side of the light L2 compared to the inner circumferential side of the surface 82 b. The emission direction side is the +z-axis direction side. In this case, the light L1 parallel to the z-axis enters the prism part 82 through the surface 82 a. Thereafter, the light L1 is reflected by the surface 82 b and emitted from the side face 84 of the prism part 82 as the detection light L6. The body tube 35 holds the optical member 80. The body tube 44 holds the wedge prism 41. The body tube 35 has the opening 36. The body tube 44 has the opening 45. The position of the opening 45 in the z-axis direction is the same as the position of the opening 36 in the z-axis direction. The position of the opening 45 in the direction of the rotation axis AR is the same as the position of the opening 36 in the direction of the rotation axis AR. The body tube 35 is rotated with respect to the body tube 44. Then, the position of the opening 45 in the circumferential direction and the position of the opening 36 in the circumferential direction are made to coincide with each other. The opening 45 is situated at a position facing the opening 36. The position where the opening 45 and the opening 36 face each other is the origin position, for example. In this case, the detection light L6 emitted from the side face 84 of the prism part 82 passes through the opening 36 and reaches the opening 45. The detection light L6 emitted from the side face 84 of the prism part 82 passes through the opening 45 and reaches the sensor 30. Namely, the detection light L6 emitted from the side face 84 of the prism part 82 passes through the opening 45 and enters the photoreception part 30 b of the sensor 30. Here, the detection light L6 is the light deflected by the prism part 82 and emitted from the side face 84 of the prism part 82. In the optical member 80, the side face 84 of the prism part 82 is the side face of the optical member 80, for example. The sensor 30 receives the detection light L6 at a light amount depending on the position of the optical member 80 in the rotation direction E. The sensor 30 receives the detection light L6 deflected by the prism part 82. The sensor 30 detects the position of the optical member 80 in the rotation direction E by receiving the deflected detection light L6. The sensor 30 is capable of detecting the origin position of the optical member 80 in the rotation direction E, for example. As described above, the light irradiation device 3 is capable of detecting the position of the optical member 80 in the rotation direction E by using the light L0 emitted by the light source 11. As above, the light irradiation device 3 is capable of detecting the position of the optical member 80 in the rotation direction E with a simple configuration. The position of the optical member 80 in the rotation direction E is the origin position, for example. Further, since the light irradiation device 3 includes no light guide part, the configuration can be simplified further. Incidentally, terms indicating positional relationship between components or the shape of a component, such as “parallel”, “orthogonal” or “center”, may have been used in the above embodiments. Ranges indicated by these terms are ranges allowing for tolerances in the manufacture, variations in the assembly, or the like. Therefore, when a description indicating positional relationship between components or the shape of a component is included in the claims, such a description is intended to include a range allowing for tolerances in the manufacture, variations in the assembly, or the like. Further, while embodiments of the present invention have been described as above, the present invention is not limited to these embodiments. Based on the above embodiments, the contents of the present invention will be described below as appendix (1), appendix (2) and appendix (3). Reference characters are assigned to the appendix (1), the appendix (2) and the appendix (3) independently of each other. Thus, “appendix 1” exists in each of the appendix (1), the appendix (2) and the appendix (3), for example. Further, features of the appendix (1), features of the appendix (2) and features of the appendix (3) can be combined with each other. (4) Appendix (1) Appendix 1 A light irradiation device comprising: a first light source that emits light; a wedge prism that allows the light emitted from the first light source to enter, deflects the entered light, emits the deflected light, and is supported to be rotatable around a rotation axis; and a sensor that detects a position of the wedge prism in a rotation direction, wherein the wedge prism includes a prism in an outer circumferential part of the wedge prism around the rotation axis, the prism deflects the light emitted from the first light source and entered the prism, in a direction towards an outer circumference of the wedge prism, and the sensor receives the light deflected by the prism. Appendix 2 The light irradiation device according to appendix 1, wherein the wedge prism includes a light guide part that is provided on an outer circumferential side of the prism and guides the light deflected by the prism to the sensor. Appendix 3 The light irradiation device according to appendix 2, wherein the light guide part includes a plurality of light emission end parts arranged side by side in the rotation direction of the wedge prism, and the sensor successively receives light emitted from the light emission end parts according to the rotation of the wedge prism. Appendix 4 The light irradiation device according to appendix 3, wherein a light amount of the light emitted from each of the plurality of light emission end parts is equal to each other. Appendix 5 The light irradiation device according to appendix 3, wherein a light amount of the light emitted from each of the plurality of light emission end parts is different from each other. (5) Appendix (2) Appendix 1 A light irradiation device comprising: a light source that emits light; an optical member that is supported to be rotatable around a rotation axis and emits irradiation light based on the light and detection light based on the light; and a sensor, wherein the optical member includes: a first prism part that emits the irradiation light whose light distribution changes depending on a position of the optical member in a rotation direction; and a second prism part that guides the detection light in an emission direction corresponding to the position in the rotation direction, wherein the sensor receives the detection light at a light amount depending on the position in the rotation direction. Appendix 2 The light irradiation device according to appendix 1, wherein the first prism part is a wedge prism. Appendix 3 The light irradiation device according to appendix 1 or 2, wherein the second prism part is arranged on an outer circumferential side of the optical member. Appendix 4 The light irradiation device according to any one of appendixes 1 to 3, wherein the second prism part emits the detection light outward in a radial direction of the optical member. Appendix 5 The light irradiation device according to any one of appendixes 1 to 4, wherein the optical member includes a light guide part that guides the detection light outward in a radial direction of the optical member. Appendix 6 The light irradiation device according to appendix 5, wherein the light guide part includes a first light emission end part and a second light emission end part arranged side by side in the rotation direction of the optical member, and the sensor receives first detection light as the detection light emitted from the first light emission end part, second detection light as the detection light emitted from the second light emission end part, or both of the first detection light and the second detection light depending on the position in the rotation direction. Appendix 7 The light irradiation device according to appendix 6, wherein the light amount of the first detection light and the light amount of the second detection light are equal to each other. Appendix 8 The light irradiation device according to appendix 6, wherein the light amount of the first detection light and the light amount of the second detection light are different from each other. Appendix 9 The light irradiation device according to appendix 5, wherein the light guide part includes a first light emission end part, a second light emission end part and a third light emission end part arranged side by side in the rotation direction, and the sensor receives first detection light as the detection light emitted from the first light emission end part, second detection light as the detection light emitted from the second light emission end part, or third detection light as the detection light emitted from the third light emission end part depending on the position in the rotation direction. Appendix 10 The light irradiation device according to appendix 9, wherein areas of the first light emission end part, the second light emission end part and the third light emission end part are different from each other, and the light amount of the first detection light, the light amount of the second detection light and the light amount of the third detection light are different from each other. Appendix 11 The light irradiation device according to appendix 9, wherein areas of the first light emission end part, the second light emission end part and the third light emission end part are equal to each other, and the light amount of the first detection light, the light amount of the second detection light and the light amount of the third detection light are different from each other. (6) Appendix (3) Appendix 1 A light irradiation device comprising: a light source that emits light; an optical member that is supported so as to rotate around a rotation axis and includes a first prism part that emits first detection light based on the light; and a sensor that receives the first detection light and detects a light amount of the first detection light, wherein the light amount of the first detection light received by the sensor changes depending on a position of the optical member in a rotation direction when the optical member rotates. Appendix 2 The light irradiation device according to appendix 1, wherein the first prism part is arranged in an outer circumferential part of the optical member around the rotation axis. Appendix 3 The light irradiation device according to appendix 1 or 2, wherein the light is incident upon the optical member along the rotation axis. Appendix 4 The light irradiation device according to any one of appendixes 1 to 3, wherein the first prism part deflects the light entering the first prism part and emits the deflected light as the first detection light. Appendix 5 The light irradiation device according to any one of appendixes 1 to 4, wherein the first prism part emits the first detection light outward in a radial direction centering at the rotation axis of the optical member. Appendix 6 The light irradiation device according to any one of appendixes 1 to 5, wherein the first prism part has a first surface that allows the light to enter and a second surface that is arranged to face the first surface, and the second surface reflects the entered light outward in a radial direction centering at the rotation axis of the optical member. Appendix 7 The light irradiation device according to appendix 6, wherein the second surface is a surface inclined with respect to the rotation axis. Appendix 8 The light irradiation device according to appendix 6 or 7, wherein the first surface refracts the entering light outward in the radial direction centering at the rotation axis of the optical member. Appendix 9 The light irradiation device according to any one of appendixes 6 to 8, wherein the first surface is a surface inclined with respect to the rotation axis. Appendix 10 The light irradiation device according to any one of appendixes 6 to 9, wherein the first surface is formed on a side of a surface where the optical member allows the light to enter. Appendix 11 The light irradiation device according to any one of appendixes 1 to 10, wherein a photoreception part of the sensor is arranged at a position facing a surface from which the first prism part emits the first detection light. Appendix 12 The light irradiation device according to any one of appendixes 1 to 10, wherein the optical member includes a light guide part that guides the first detection light to a photoreception part of the sensor. Appendix 13 The light irradiation device according to appendix 12, wherein the light guide part guides the first detection light outward in a radial direction centering at the rotation axis of the optical member. Appendix 14 The light irradiation device according to appendix 12 or 13, wherein the light guide part includes a first light emission end part and a second light emission end part arranged side by side in the rotation direction of the optical member, the first detection light includes second detection light and third detection light, the first light emission end part emits the second detection light, the second light emission end part emits the third detection light, and the sensor detects the light amount of the first detection light based on whether the first detection light is received or not and reception of at least the second detection light or the third detection light. Appendix 15 The light irradiation device according to appendix 14, wherein the light amount of the second detection light and the light amount of the third detection light are equal to each other. Appendix 16 The light irradiation device according to appendix 14, wherein the light amount of the second detection light and the light amount of the third detection light are different from each other. Appendix 17 The light irradiation device according to any one of appendixes 14 to 16, wherein area of a first light emission surface of the first light emission end part that emits the second detection light is equal to area of a second light emission surface of the second light emission end part that emits the third detection light. Appendix 18 The light irradiation device according to any one of appendixes 14 to 16, wherein area of a first light emission surface of the first light emission end part that emits the second detection light is different from area of a second light emission surface of the second light emission end part that emits the third detection light. Appendix 19 The light irradiation device according to any one of appendixes 14 to 18, wherein area of a first light incidence surface where the second detection light enters the first light emission end part is equal to area of a second light incidence surface where the third detection light enters the second light emission end part. Appendix 20 The light irradiation device according to any one of appendixes 14 to 18, wherein area of a first light incidence surface where the second detection light enters the first light emission end part is different from area of a second light incidence surface where the third detection light enters the second light emission end part. Appendix 21 The light irradiation device according to any one of appendixes 12 to 20, wherein the photoreception part of the sensor is arranged at a position facing a surface from which the light guide part emits the first detection light. Appendix 22 The light irradiation device according to any one of appendixes 1 to 21, wherein the optical member includes a second prism part that emits irradiation light based on the light, and the second prism part changes light distribution of the irradiation light depending on the position of the optical member in the rotation direction when the optical member rotates. Appendix 23 The light irradiation device according to appendix 22, wherein the second prism part deflects the light entering the second prism part and emits the deflected light as the irradiation light. Appendix 24 The light irradiation device according to appendix 22 or 23, wherein the second prism part emits the irradiation light in a direction opposite to a direction from which the light is incident upon the second prism part. Appendix 25 The light irradiation device according to appendix 22 or 23, wherein the second prism part has a third surface having an intersection point with the rotation axis and allowing the light to enter and a fourth surface having an intersection point with the rotation axis and arranged to face the third surface, and the entered light is emitted from the fourth surface. Appendix 26 The light irradiation device according to any one of appendixes 22 to 25, wherein the second prism part is a wedge prism. DESCRIPTION OF REFERENCE CHARACTERS 1, 2, 3: light irradiation device, 11: light source, 11 a: light emission surface, 12: lens part, 13: radiator, 14: body tube, 20, 50, 60, 70, 80: optical member, 21, 51, 61, 71, 81: prism part (wedge prism), 21 a, 51 a, 61 a, 71 a, 81 a: surface, 21 b, 51 b, 61 b, 71 b, 81 b: surface, 22, 52, 62, 72, 82: prism part (prism for detection light), 22 a, 52 a, 62 a, 72 a, 82 a: surface, 22 b, 52 b, 62 b, 72 b, 82 b: surface, 23, 53, 63: light guide part, 24, 25: light emission end part, 24 a, 25 a: light emission surface, 24 b, 25 b: light incidence part, 30, 30 a: sensor, 30 b: photoreception part, 31: gear, 32: gear, 33: motor, 34: motor control unit, 35: body tube, 36: opening, 41: wedge prism, 42: light incidence surface, 43: light emission surface, 44: body tube, 45: opening, 54, 55, 56, 64, 65, 66: light emission end part, 54 a, 55 a, 56 a, 64 a, 65 a, 66 a: light emission surface, 54 b, 55 b, 56 b, 64 b, 65 b, 66 b: light incidence surface, 74, 84: side face, 90: image formation unit, AP, AC: optical axis, AR: rotation axis, E: rotation direction of optical member, L0, L1: light, L2, L3: irradiation light, L4, L5, L6: detection light, L41, L41 a, L41 b: detection light, L42, L42 a, L42 b: detection light, L43 a, L43 b: detection light 1. A light irradiation device comprising: a light source that emits light; an optical member that is supported so as to rotate around a rotation axis and includes a first prism part that emits first detection light based on the light; and a sensor that receives the first detection light and detects a light amount of the first detection light, wherein the first prism part is arranged in an outer circumferential part of the optical member around the rotation axis, and the light amount of the first detection light received by the sensor changes depending on a position of the optical member in a rotation direction when the optical member rotates. 2. (canceled) 3. The light irradiation device according to claim 1, wherein the first prism part deflects the light entering the first prism part and emits the deflected light as the first detection light. 4. The light irradiation device according to claim 1, wherein the first prism part emits the first detection light outward in a radial direction centering at the rotation axis of the optical member. 5. The light irradiation device according to claim 1, wherein the first prism part has a first surface that allows the light to enter and a second surface that is arranged to face the first surface, and the second surface reflects the entered light outward in a radial direction centering at the rotation axis of the optical member. 6. The light irradiation device according to claim 1, wherein the optical member includes a light guide part that guides the first detection light to a photoreception part of the sensor. 7. The light irradiation device according to claim 6, wherein the light guide part includes a first light emission end part and a second light emission end part arranged side by side in the rotation direction of the optical member, the first detection light includes second detection light and third detection light, the first light emission end part emits the second detection light, the second light emission end part emits the third detection light, and the sensor detects the light amount of the first detection light based on whether the first detection light is received or not and reception of at least the second detection light or the third detection light. 8. The light irradiation device according to claim 7, wherein the light amount of the second detection light and the light amount of the third detection light are equal to each other. 9. The light irradiation device according to claim 7, wherein the light amount of the second detection light and the light amount of the third detection light are different from each other. 10. The light irradiation device according to claim 1, wherein the optical member includes a second prism part that emits irradiation light based on the light, and the second prism part changes light distribution of the irradiation light depending on the position of the optical member in the rotation direction when the optical member rotates.

2018-08-28

en

2021-08-19

US-74583800-A

Dual internal voltage generating apparatus ABSTRACT To accomplish low power consumption of a semiconductor memory device, an internal voltage generating apparatus of the present invention applies an internal power voltage having the lower potential level as an operation voltage of a chip. By differentiating the internal power voltage for each of a peripheral circuit and a core circuit within a DRAM to use them as an operational voltage of the cell, i.e., by supplying the lowered internal power voltage to the core circuit unit, the reliability of the cell and noise characteristic is improved. BACKGROUND [0001] 1. Field of Invention [0002] The inventions described and claimed relate in general to powering semiconductor devices. More specifically, they relate to internal voltage generating arrangements. [0003] 2. General Background and Related Art [0004] Generally, it is desirable to operate portable electronic devices at as low a power consumption level as possible. In fact, power consumption level is probably one of the most competitive issues among manufacturers of portable electronic devices, semiconductor memory devices, etc. To minimize power consumption, it is helpful to operate semiconductor devices as voltages lower than those of externally supplied voltages. Therefore, an internal power voltage, lower than an externally supplied power voltage, is generated and used to operate semiconductor devices. [0005] Because the power consumption of a CMOS circuit is proportional to square of voltage, power consumption can be reduced significantly, if the internal power voltage can be lowered. It is particularly helpful when the internal voltage source can be set and maintained to a static voltage. When this can be accomplished the operation of the chip is stable because the operational voltage is stable even when the external power voltage has some variation. [0006] The semiconductor chip should operate normally (e.g., has constant access time) even when the external power voltage varies by 10%. This requirement can lead to circuit complexity. If a stable power source could be provided by an internal voltage generating apparatus, circuit design can be made simpler, which has many design advantages. For this reason, the concept of using an internal voltage generating apparatus was introduced. [0007]FIG. 1 (Prior Art) is a circuit diagram of a conventional internal voltage generating apparatus. It includes a reference potential generating unit 100 for generating a reference voltage VREF1 having a predetermined potential level. A potential amplifying unit 200 amplifies the reference voltage VREF1. A reference potential converting unit 300 converts the potential of the reference voltage VREF1 by comparing a bias voltage VBIAS generated at a power voltage detector 10 with an output voltage VREF1_AMF from the potential amplifying unit 200. A driver unit 400 supplies a second reference voltage VREF2 converted at the reference potential converting unit 300 to a DRAM internal circuit 500 as an operational voltage in each of a standby mode and an active mode. The reference potential generating unit 100 is typically implemented by a Widlar Current Mirror which is well known in the art and its detailed description is omitted. [0008] The potential amplifying unit 200 includes a comparator 1 receiving the reference voltage VREF1 at one of its two inputs. A PMOS transistor MP1 is coupled between a power voltage input Vcc and an output N1. Transistor MP1 has a gate coupled to the output of comparator 1. Two resistors R1 and R2 are serially coupled between the output N1 and ground for providing a feedback potential signal VA, resulting from voltage division based on the ratio of resistors R1 and R2, to the other one of the two inputs of the comparator 1. [0009] The reference potential converting unit 300 includes a comparator 3 receiving the output potential VREF1_AMF from the potential amplifying unit 200 at one of its two inputs and a current sink ground voltage at the other one of its two inputs. A comparator 5 receives the bias voltage from the power voltage detector 10 at one of its two inputs. The other input of comparator 5 is coupled to a current sink ground voltage. Two PMOS transistors MP2 and MP3 are coupled in parallel to each other between the power voltage input Vcc and the current sink output N2. A gate of PMOS transistor MP2 is coupled to the output of the comparator 3 and a gate of PMOS transistor MP3 is coupled to the output of the comparator 5. [0010] Driver unit 400 includes a standby driver 20 and an active driver 30. Drivers 20 and 30 are voltage followers that supply an operational voltage corresponding to the second reference voltage VREF2 in for standby mode and active mode, respectively. Drivers 20 and 30 include comparators 7 and 9, respectively, each receiving the second reference voltage VREF2 at ones of their two inputs and the current sink ground voltage at their other inputs, respectively. Two PMOS transistors MP4 and MP5 are coupled respectively between the power voltage input Vcc and the current sink output N2. A gate of PMOS transistor MP4 is coupled to the output of comparator 7 and a gate of PMOS transistor MP5 is coupled to the output of the comparator 9. The internal power voltage VINT1 is applied to the DRAM internal circuit 500 through a common drain of the two PMOS transistors MP4 and MP5. [0011] The DRAM internal circuit 500 can be divided roughly into the core circuit block, i.e., a memory cell block, and the peripheral circuit block. In order to improve reliability of the memory cell, it is required that the operational voltage of the core circuit block is set to be low by supplying the core circuit block with a power voltage lower than the power voltage of the peripheral circuit block. [0012] However, as will be appreciated referring to an output waveform of the internal voltage shown in FIG. 2 (Prior Art), the conventional internal voltage generating apparatus generates a single internal voltage VINT 1 by using a single voltage drop circuit, which leads some operational difficulties. [0013] Firstly, due to the internal power voltage being a single potential level, operational current value To determined by (Cp×VINT1+Cc×VINT1)×freq and subsequently memory core current increased. Accordingly, over-current flows through a cell capacitor and a swing voltage and a gate voltage of the cell increase. This voltage increase is bad for power consumption as well as in the cell reliability. [0014] Furthermore, a noise characteristic of a circuit so powered deteriorates due to mutual noise interference of the core circuit block and the peripheral circuit block. SUMMARY [0015] With this background in mind, the claimed inventions feature, at least in part a dual internal voltage generating arrangement. The voltage generating arrangements presented herein generate internal power voltages used respectively as operational voltages for 1) a peripheral circuit block and 2) a core circuit block of a memory chip. This allows for the operational voltage of the cell used for core to be a lower and stable level. [0016] One exemplary embodiment of the inventions includes a dual internal voltage generating apparatus. A reference potential generating unit generates a reference voltage VREF1 of a predetermined potential level. First and second potential amplifying units, parallel to each other, amplify the reference voltage VREF1. A first reference potential converting unit converts the reference voltage to a first potential level by comparing a first bias voltage generated at a corresponding power voltage detector with the output voltage from the first potential amplifying unit. A second reference potential converting unit converts the reference voltage to a second potential level by comparing a second bias voltage generated at a corresponding power voltage detector with the output voltage from the second potential amplifying unit. A first driver unit receives the reference voltage generated at the first reference potential converting unit for generating a first internal voltage to be supplied to a peripheral circuit unit within a DRAM. A second driver unit receives the reference voltage generated at the second reference potential converting unit for generating a second internal voltage to be supplied to a core circuit unit within the DRAM. BRIEF DESCRIPTION OF THE DRAWINGS [0017] Exemplary embodiments of the claimed inventions will be described in detail with reference to the accompanying drawings, in which: [0018]FIG. 1 (Prior Art) is a circuit diagram of a conventional internal voltage generating apparatus; [0019]FIG. 2 (Prior Art) shows an output waveform of the internal voltage generated in FIG. 1 (Prior Art); [0020]FIG. 3 is a circuit diagram of an exemplary embodiment of a dual internal voltage generating apparatus in accordance with the present invention; and [0021]FIG. 4 is a graphical representation of voltages generated by the dual voltage generating apparatus shown in FIG. 3. DETAILED DESCRIPTION [0022]FIG. 3 is a circuit diagram of an exemplary embodiment of a dual internal voltage generating apparatus in accordance with the present invention. A reference potential generating unit 120 generates a reference voltage VREF1 of a predetermined potential level. First and a second potential amplifying units 220 and 240, parallel to each other, amplify the reference voltage VREF1. A first reference potential converting unit 320 converts the reference voltage VREF1 to a potential level VREF1_PERI by comparing a first bias voltage VBIAS 1 generated at a power voltage detector 12 with the output voltage VREF1_AMF_PERI from the first potential amplifying unit 220. A second reference potential converting unit 340 converts the reference voltage VREF1 to a potential level VREF2_CORE by comparing a second bias voltage VBIAS2 generated at a power voltage detector 14 with the output voltage VREF1_AMF_CORE from the second potential amplifying unit 240. A first driver unit 420 receives the reference voltage VREF2_PERI generated at the first reference potential converting unit 320 and generates a first internal voltage VINT1 to be supplied to a peripheral circuit unit 520, internal of a DRAM. A second driver unit 440 receives the reference voltage VREF2_CORE generated at the second reference potential converting unit 340 and generates a second internal voltage VINT2 to be supplied to a core circuit unit 540, internal of a DRAM. [0023] The reference potential generating unit 120 includes a reference potential generator 2 and a voltage follower 36 adjusting current driving capability of a reference voltage VREF0 generated at the reference potential generator 2. [0024] The reference potential generator 2 can be implemented as a “Widlar current Mirror” which is well known in the art and its detail description is omitted for the sake of simplicity. Of course, other implementations are possible. [0025] The voltage follower 36 includes a comparator 11 having an input to which the reference voltage VREF0 is applied from the reference potential generator 2. A PMOS transistor MP6 has a gate coupled to the output of comparator 11, a source coupled to input potential Vcc and a drain coupled to a current source sinked to ground. The drain provides feedback to a second input of comparator 11. The reference voltage VREF1 generated as described above is transferred to one input of each of the first and the second potential amplifying units 220 and 240. [0026] The potential amplifying units 220, 240 can be configured so as to be identical to potential amplifying unit 100 in its general circuit configuration and operation. However, they are constructed and arranged to have serially coupled resistors R1, R2 and R3, R4, respectively for voltage distribution to differentiate the outputted reference potentials VREF1_AMF_PERI, VREF1_AMF_CORE. [0027] Because the reference potential VREF1_AMF_CORE from the second potential amplifying unit 240 controls a supply voltage provided to the core circuit unit 540 of the internal of the DRAM, the resistance ratios of the resistors R1 to R4 are selected so that the potential VREF1_AMF_CORE from unit 240 will be lower than the reference potential VREF1_AMF_PERI from potential amplifying unit 220. [0028] Potential levels of the reference potential signals VREF1_AMF_PERI, VREF1_AMF_CORE, from the first and the second potential amplifying units 220, 240, respectively are determined in accordance with the voltage distribution law as follows: VREF1— AMF — PERI=(R1+R2)×VREF1/R2  Eq.(1) VREF1— AMF — CORE=(R3+R4)×VREF1/R4  Eq.(2) [0029] Accordingly, by properly selecting the values of resistance of resistors R1, R2, R3 and R4, the reference potentials VREF1_AMF_PERI, VREF1_AMF_CORE, from the first and the second potential amplifying units 220, 240, can be controlled. [0030] For example, assuming that VREF1=0.7 V, R1=2.57×R2, and R3=2.14×R4, the output potential of the first potential amplifying unit 220 adjusted to have 2.5 V and the output potential of the second potential amplifying unit 240 adjusted to have 2.2 V are applied to the reference potential converting units 320 and 340, respectively. [0031] Reference potential converting unit 320 includes a comparator 3 receiving the output potential VREF1_AMF_PERI from the first potential amplifying unit 220 at one of its two inputs and a current sink ground voltage at the other one of its two inputs. A comparator 5 receives the first bias voltage from power voltage detector 12 at one of its two inputs and a current sink ground voltage at the other one of its two inputs. Two PMOS transistors MP2, MP3 are coupled in parallel to each other between the power voltage input and a current sink output N2. A gate of transistor MP2 is coupled to the output of comparator 3. A gate of transistor MP3 is coupled to the output of the comparator 5. [0032] Its operation will be described as follows: VREF2— PERI=VREF1— AMF — PERI (where VCC<Vy)  Eq.(3) [0033]VREF2— PERI=VCC−nVt (where VCC>Vy)  Eq.(4) [0034] The second reference potential converting unit 340 is as similar to the first reference potential converting unit 320 and its detail description will be omitted for the sake of simplicity. [0035] Its operation will be described as follows: [0036]VREF2— CORE=VREF1— AMF — CORE (where VCC<Vy)  Eq. (5) [0037]VREF2— CORE=VCC−nVt (where VCC>Vy)  Eq.(6) [0038] Reference potentials VREF2_PERI, VREF2_CORE converted as above are applied to the drivers 420 and 440, respectively, as their reference voltages. The driver unit 420 includes voltage followers 22 and 32, each supplying the operational voltage corresponding to the reference voltage VREF2_PERI in the standby mode and the active mode, respectively, to the peripheral circuit unit 520. Driver unit 440 includes voltage followers 24 and 34, each for supplying the operational voltage corresponding to the reference voltage VREF2_CORE in the standby mode and the active mode, respectively, to the core circuit unit 540. For the voltage followers 32 and 34 for the active mode, control clocks ACT_PERI, ACT_CORE for the active mode are applied as control signals of the comparators of the voltage followers 32 and 34, respectively, to supply the operational voltage only in the active mode. [0039] Thus, the internal power voltages VINT2, VINT1, respectively, supplied to the core circuit unit 540 and the peripheral circuit unit 520 included within the DRAM can be differentiated. More particularly, the internal power voltage VINT2 supplied to the core circuit unit 540 can be made lower than the internal power voltage VINT1. [0040]FIG. 4 is a graphical representation of voltages generated by the circuit arrangement shown in FIG. 3. Internal power voltages VINT1 and VINT2 are differentiated. By applying the internal power voltage having the lower potential level (herein, VINT2) to the core circuit unit 540 within the DRAM, the operational voltage of the cell used in the core can be adjusted to a stable level. [0041] As described above, the dual internal voltage generating apparatus of the present invention accomplishes low power consumption by lowering the operational voltage of the cell by supplying the lowered internal power voltage to the core circuit unit. Furthermore, the reliability of the cell is improved by the decreased swing voltage and gate voltage of the cell and the noise characteristic is improved by minimizing noise interference between the core circuit unit and the peripheral circuit unit by using the differentiated internal voltages. [0042] While the present invention has been shown and described with respect to the particular embodiments, it will be apparent to those skilled in the art that many changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims. What is claimed is: 1. A dual internal voltage generating apparatus comprising; a reference potential generating means for generating a reference voltage having a predetermined potential level; a first and a second potential amplifying means, parallel to each other, for amplifying the reference voltage; a first reference potential converting means for converting the reference voltage to a first potential level by comparing a first bias voltage generated at a corresponding power voltage detector with the output voltage from the first potential amplifying means; a second reference potential converting means for converting the reference voltage to a second potential level by comparing a second bias voltage generated at a corresponding power voltage detector with the output voltage from the second potential amplifying means; a first driver means receiving the reference voltage generated at the first reference potential converting means for generating a first internal voltage to be supplied to a peripheral circuit means within a DRAM; and a second driver means receiving the reference voltage generated at the second reference potential converting means for generating a second internal voltage to be supplied to a core circuit means within the DRAM. 2. An apparatus according to claim 1 , wherein each of the first and the second potential amplifying means includes: a comparator receiving the reference voltage at a first input thereof; a PMOS transistor MP1 coupled between a power voltage input and an output and having a gate coupled to an output of the comparator; and first and a second resistors coupled serially between the output and a ground for providing a feedback potential signal based on the ratio of resistance of the first and second resistors to a second input of the comparator. 3. An apparatus according to claim 2 , wherein the ratio of the resistance of the first and the second resistors of the first potential amplifying means is determined to be higher than the ratio of the resistance of the first and the second resistors of the second potential amplifying means. 4. An e apparatus according to claim 1 , wherein the first reference potential converting means includes: a first comparator receiving the output potential from the first potential amplifying means at a first input thereof and a current sink ground voltage at a second input thereof; a second comparator receiving the first bias voltage from a first power voltage detector at a first input thereof and a current sink ground voltage at a second inputs thereof; and first and a second PMOS transistors coupled parallel to each other between the power voltage input and a current sink output, a gate of the first PMOS transistor being coupled to the output of the first comparator and a gate of the second PMOS transistor being coupled to the output of the second comparator. 5. An apparatus according to claim 4 , wherein the second reference potential converting means includes: a third comparator receiving the output potential from the second potential amplifying means at a first input thereof and a current sink ground voltage at a second input thereof, a fourth comparator receiving the second bias voltage from a second power voltage detector a first input thereof and a current sink ground voltage at a second inputs thereof; and a third and a fourth PMOS transistors couple parallel to each other between the power voltage input and a current sink output, a gate of the third PMOS transistor being coupled to the output of the third comparator and a gate of the fourth PMOS transistor being coupled to the output of the fourth comparator. 6. An apparatus according to claim 1 , wherein the first driver means includes a standby driver and an active driver for supplying the operational voltage corresponding to the output voltage of the first reference potential converting means in a standby mode and an active mode, respectively, and second driver means includes a standby driver and an active driver for supplying the operational voltage corresponding to the output voltage of the second reference potential converting means in the standby mode and the active mode, respectively. 7. An apparatus as recited in claim 6 , wherein each of the standby drivers and the active drivers is a voltage follower. 8. A dual internal voltage generator, comprising; a reference potential generator constructed and arranged to generate a reference voltage having a predetermined potential level; first and a second potential amplifiers, constructed and arranged in parallel with each other, to amplifying the reference voltage; a first reference potential converter constructed and arranged to convert the reference voltage to a first potential level by comparing a first bias voltage generated at a corresponding power voltage detector with the output voltage from the first potential amplifier; a second reference potential converter constructed and arranged to convert the reference voltage to a second potential level by comparing a second bias voltage generated at a corresponding power voltage detector with the output voltage from the second potential amplifier; a first driver constructed and arranged to receive the reference voltage generated at the first reference potential converter and generate a first internal voltage to be supplied to a peripheral circuit within a DRAM; and a second driver constructed and arranged to receive the reference voltage generated at the second reference potential converter and generate a second internal voltage to be supplied to a core circuit within the DRAM. 9. An apparatus according to claim 8 , wherein each of the first and the second potential amplifiers includes: a comparator receiving the reference voltage at a first input thereof; a PMOS transistor MP1 coupled between a power voltage input and an output and having a gate coupled to an output of the comparator; and first and a second resistors coupled serially between the output and a ground for providing a feedback potential signal based on the ratio of resistance of the first and second resistors to a second input of the comparator. 10. An apparatus according to claim 9 , wherein the ratio of the resistance of the first and the second resistors of the first potential amplifier is determined to be higher than the ratio of the resistance of the first and the second resistors of the second potential amplifier. 11. An apparatus according to claim 8 , wherein the first reference potential converter includes: a first comparator receiving the output potential from the first potential amplifying means at a first input thereof and a current sink ground voltage at a second input thereof; a second comparator receiving the first bias voltage from a first power voltage detector at a first input thereof and a current sink ground voltage at a second inputs thereof; and first and a second PMOS transistors coupled parallel to each other between the power voltage input and a current sink output, a gate of the first PMOS transistor being coupled to the output of the first comparator and a gate of the second PMOS transistor being coupled to the output of the second comparator. 12. An apparatus according to claim 11 , wherein the second reference potential converter includes: a third comparator receiving the output potential from the second potential amplifying means at a first input thereof and a current sink ground voltage at a second input thereof; a fourth comparator receiving the second bias voltage from a second power voltage detector a first input thereof and a current sink ground voltage at a second inputs thereof; and a third and a fourth PMOS transistors couple parallel to each other between the power voltage input and a current sink output, a gate of the third PMOS transistor being coupled to the output of the third comparator and a gate of the fourth PMOS transistor being coupled to the output of the fourth comparator. 13. An apparatus according to claim 8 , wherein the first driver includes a standby driver and an active driver for supplying the operational voltage corresponding to the output voltage of the first reference potential converter in a standby mode and an active mode, respectively, and the second driver includes a standby driver and an active driver for supplying the operational voltage corresponding to the output voltage of the second reference potential converter in the standby mode and the active mode, respectively. 14. An apparatus as recited in claim 13 , wherein each of the standby drivers and the active drivers is a voltage follower.

2000-12-26

en

2001-10-25

US-81198409-A

Optimized probes and primers and method of using same for the detection of herpes simplex virus ABSTRACT Described herein are primers and probes useful for detecting and typing variant HSV strains, and methods of using the described primers and probes. FIELD OF THE INVENTION The present invention relates to nucleic acid probes and primers for detecting viral genetic material from Herpes simplex virus (HSV) (Type 1 and Type 2). BACKGROUND OF THE INVENTION HSV causes a variety of clinical manifestations at diverse anatomical sites in both normal and immunocompromised patients. Generalized or disseminated HSV infection can cause severe morbidity and mortality in immunologically compromised individuals or through neonatal infection. One such infection causes herpes simplex encephalitis (HSE) is one of the most devastating infections of the central nervous system, and often involves children and adolescents. Almost all HSE cases in adults and children are due to HSV Type 1 (HSV-1) infections, whilst HSV Type 2 (HSV-2) infections are typically associated with neonatal HSE and infections of immunocompromised individuals. Early detection and subsequent antiviral therapy can have a significant impact on improved patient outcome. Several methods are currently available for detecting HSV, including cell culture and nucleic acid testing, e.g., real-time PCR, but such methods do not adequately address the broad genetic diversity of target HSV and HSE pathogens. SUMMARY In one embodiment, the present invention is directed to an isolated polynucleotide, comprising a nucleotide sequence that comprises any one of SEQ ID NOs: 1-87. In another embodiment, the present invention is directed to an isolated polynucleotide, comprising any of the nucleotide sequences depicted in Table 3 or any of the nucleotide sequences depicted in Table 4. In another embodiment, the present invention is directed to a primer pair for amplifying herpes simplex virus DNA, comprising a forward and reverse primer selected from the group consisting of the sequences listed in groups 1-54 of Table 3. In another embodiment, the present invention is directed to a primer pair for amplifying herpes simplex virus DNA, comprising the forward and reverse primer pairs depicted in Table 4. In another embodiment, the present invention is directed to a primer pair for amplifying herpes simplex virus DNA selected from the group consisting of (1) SEQ ID NOs: 4 and 10; (2) SEQ ID NOs: 20 and 52; (3) SEQ ID NOs: 70 and 72; (4) SEQ ID NOs: 73 and 75; (5) SEQ ID NOs: 76 and 78; (6) SEQ ID NOs: 79 and 81; (7) SEQ ID NOs: 82 and 78; (8) SEQ ID NOs: 79 and 81; (9) SEQ ID NOs: 83 and 85; and (10) SEQ ID NOs: 79 and 87. In a particular embodiment, the present invention is directed to a polynucleotide probe that binds to a product amplified by one or more of the primer sets described herein, wherein (1) the probe comprising the sequence of SEQ ID NO: 69 hybridizes to the PCR product amplified by SEQ ID NOs: 4 and 10; (2) the probe comprising the sequence of SEQ ID NO: 21 hybridizes to the PCR product amplified by SEQ ID NOs: 20 and 52; (3) the probe comprising the sequence of SEQ ID NO: 71 hybridizes to the PCR product amplified by SEQ ID NOs: 70 and 72; (4) the probe comprising the sequence of SEQ ID NO: 74 hybridizes to the PCR product amplified by SEQ ID NOs: 73 and 75; (5) the probe comprising the sequence of SEQ ID NO: 77 hybridizes to the PCR product amplified by (i) SEQ ID NOs: 76 and 78, and (ii) SEQ ID NOs: 82 and 78; (6) the probe comprising the sequence of SEQ ID NO: 80 hybridizes to the PCR product amplified by SEQ ID NOs: 79 and 81; (7) the probe comprising the sequence of SEQ ID NO: 84 hybridizes to the PCR product amplified by SEQ ID NOs: 83 and 85; (8) the probe comprising the sequence of SEQ ID NO: 84 hybridizes to the PCR product amplified by SEQ ID NOs: 83 and 85; and (9) the probe comprising the sequence of SEQ ID NO: 86 hybridizes to the PCR product amplified by SEQ ID NOs: 79 and 87. In a particular embodiment, the probe is labeled, e.g., the probe comprises a fluorescent label, a chemiluminescent label, a radioactive label, biotin, or gold. In another embodiment, the present invention is directed to a method for detecting an HSV virus in a sample, comprising (1) adding together at least once group of forward and reverse primers depicted in Tables 3 or 4 to a sample, (2) conducting a polymerase chain reaction on the sample, and (3) detecting the generation of a PCR product, wherein the generation of an amplified PCR product indicates the presence of an HSV variant in the sample. In a particular embodiment, the forward and reverse primers comprise at least one sequence from the group consisting of: (1) SEQ ID NOs: 4 and 10; (2) SEQ ID NOs: 20 and 52; (3) SEQ ID NOs: 70 and 72; (4) SEQ ID NOs: 73 and 75; (5) SEQ ID NOs: 76 and 78; (6) SEQ ID NOs: 79 and 81; (7) SEQ ID NOs: 82 and 78; (8) SEQ ID NOs: 79 and 81; (9) SEQ ID NOs: 83 and 85; and (10) SEQ ID NOs: 79 and 87, respectively. In a particular embodiment, the method further comprises the steps of (1) adding a labeled probe to the sample, wherein the probe comprises the sequence that corresponds to the forward and reverse primer pair group depicted in Tables 3 or 4, and (2) detecting the binding of the probe to an amplified PCR product after exposing the PCR product and probe(s) to conditions that promote hybridization. In a particular embodiment, the sequence of the probe or probes is selected from the group consisting of SEQ ID NOs: 21, 69, 71, 74, 77, 80, 84, and 86. in a particular embodiment, the probe is fluorescently labeled and the step of detecting the binding of the probe to the amplified PCR product entails measuring the fluorescence of the sample. In a particular embodiment, the sample is blood, serum, plasma, sputum, urine, stool, skin, cerebrospinal fluid, saliva, gastric secretions, tears, oropharyngeal swabs, nasopharyngeal swabs, throat swabs, nasal aspirates, nasal wash, and fluids collected from the ear, eye, mouth, respiratory airways, spinal tissue or fluid, cerebral fluid, trigeminal ganglion sample, or a sacral ganglion sample. DETAILED DESCRIPTION The present invention provides nucleic acid primers and probes for detecting and typing viral genetic material, especially HSV viruses, including either or both of Types 1 and 2, and methods for designing and optimizing the respective primer and probe sequences that are useful for detecting and/or typing those HSV viruses. The present invention also therefore provides a method for designing primer and probe sequences that specifically detect the presence of any or specific HSV virus(es) in a given sample. Of particular interest in this regard is the ability of the disclosed primers and probes—as well as those that can be designed according to the disclosed methods—to specifically detect strains and variants of the HSV viruses regardless of Type 1 or 2 variant-specific genomic mutations. The optimized primers and probes of the invention are useful, therefore, for identifying and diagnosing the causative or contributing agents of HSV infection whereupon an appropriate treatment can then be administered to the individual and steps taken to eradicate the virus. The present invention provides a robust bioinformatic analytical system that is useful for performing a comprehensive analysis of all known target sequences to design primers and probes with the best possible sensitivity and specificity. That is, the primers and probes of the present invention are useful for detecting both types of HSV, HSV-1 and HSV-2, in a singleplex, “non-typing” format that does not necessarily distinguish between HSV-1 and HSV-2; or for detecting and identify both types of HSV in a multiplex, “typing” format. According to the present invention all HSV Type 1 and Type 2 nucleotide sequences available in GenBank were aligned and regions of conservation were identified based on comparison to various input target genes. The input target that detects both types without discriminating between Type 1 and Type 2 is the HSV Glycoprotein B gene, where analysis of over 60 sequences confirmed the conservation in sequence between both viral types. See Table 1 below. The input targets that detect one of the two types and can discriminate between the two were the HSV-1 Glycoprotein D genes (210 sequences analyzed) and the HSV-2 Glycoprotein G genes (69 sequences analyzed). TABLE 1 To detect . . . then design primers and probes to . . . HSV-1 and HSV-2 the HSV Glycoprotein B gene HSV-1 alone the HSV-1 Glycoprotein D gene HSV-2 alone the HSV-2 Glycoprotein G gene These targets were chosen because they are well conserved between the two HSV types, but have enough variability to allow specificity between them, and have substantial sequence information publicly available from multiple HSV strains and geographic regions. Thus the present invention provides one or more pairs of PCR primers that can anneal to HSV variants and thereby amplify a PCR product from a biological sample. Hence, the present invention provides a first PCR primer and a second PCR primer, each of which comprises a nucleotide sequence designed according to the inventive principles disclosed herein, which are used together to positively identify the presence of HSV in a sample regardless of the actual nucleotide composition of the infecting HSV variant(s). The generation of an amplified PCR product or products from a sample using the primer pairs disclosed herein is diagnostically indicative of an HSV infection or at least indicative of the presence of an HSV variant in the sample. Of note, each of the primer sequences can be used as probes to detect viral variants. Also provided by the present invention are probes that hybridize to amplified PCR products or unamplified sample sequences. A probe can be labeled, for example, such that when it binds to an internal PCR product target sequence, or after it has been cleaved after binding, a fluorescent signal is emitted that is detectable under various spectroscopy and light-measurement apparatuses. The use of a labeled probe, therefore, can enhance the specificity of the PCR-based amplification of variant HSV DNA because it permits the detection of virus DNA at low template concentrations that might not be conducive to visual detection as a gel-stained PCR product. Primers and probes of the invention are sequences that anneal to a viral genomie sequence, e.g., HSV (the “target”). The target sequence can be, for example, a viral genome or a subset, “region”, of a viral genome. In one embodiment, the entire genomic sequence can be “scanned” for optimized primers and probes useful for detecting viral variants. In other embodiments, particular regions of the viral genome can be scanned, e.g., regions that are documented in the literature as being useful for detecting multiple variants, regions that are conserved, or regions where sufficient information is available in, for example, a public database, with respect to viral variants. Sets of primers and probes are generated based on the target to be detected. The set of all possible primers and probes can include, for example, sequences that include the variability at every site based on the known viral variants, or the primers and probes can be generated based on a consensus sequence of the target. The primers and probes are generated such that the primers and probes are able to anneal to a particular variant or a consensus sequence under high stringency conditions. For example, one of skill in the art recognizes that for any particular sequence, it is possible to provide more than one oligonucleotide sequence that will anneal to the particular target sequence, even under high stringency conditions. The set of primers and probes to be sampled for the purposes of the present invention includes, for example, all such oligonucleotides for all viral variant sequence. Alternatively, the primers and probes includes all such oligonucleotides for a given consensus sequence for a target. Typically, stringent hybridization and washing conditions are used for nucleic acid molecules over about 500 bp. Stringent hybridization conditions include a solution comprising about 1 M Na+ at 25° C. to 30° C. below the Tm; e.g., 5×SSPE, 0.5% SDS, at 65° C.; see, Ausubel, et al., Current Protocols in Molecular Biology, Greene Publishing, 1995; Sambrook et al., Molecular Cloning: A Laboratory Manual, Cold Spring Harbor Press, 1989). Tm is dependent on both the G+C content and the concentration of Na+. A formula to calculate the Tm of nucleic acid molecules greater than about 500 by is Tm=81.5+0.41(%(G+C)) log10[Na+]. Washing conditions are generally performed at least at equivalent stringency conditions as the hybridization. If the background levels are high, washing can be performed at higher stringency, such as around 15° C. below the Tm. The set of primers and probes, once determined as described above, are optimized for hybridizing to a plurality of viral variants by employing scoring and/or ranking steps that provide a positive or negative preference or “weight” to certain nucleotides in a target nucleic acid variant sequence. For example, if a consensus sequence is used to generate the full set of primers and probes, then a particular primer sequence is scored for its ability to anneal to the corresponding sequence of every known native variant sequence. Even if a probe was originally generated based on a consensus, therefore, the validation of the probe is in its ability to specifically anneal and detect every or a large majority of variant viral sequences. The particular scoring or ranking steps performed depend upon the intended use for the primer and/or probe, the particular target nucleic acid sequence, and the number of variants of that target nucleic acid sequence. The methods of the invention provide optimal primer and probe sequences because they hybridize to all or a subset of HSV variants. Once optimized oligonucleotides are identified that can anneal to viral variants, the sequences can then further be optimized for use, for example, in conjunction with another optimized sequence as a “primer pair” or for use as a probe. Primer or probe sequences can be ranked according to specific hybridization parameters or metrics that assign a score value indicating their ability to anneal to viral variants under highly stringent conditions. Where a primer pair is being scored, a “first” or “forward” primer is scored and the “second” or “reverse”-oriented primer sequences can be optimized similarly, followed by an optional evaluation for cross-reactivity, for example, between the forward and reverse primers. The scoring or ranking steps that are used in the methods of the invention include, for example, the following parameters: a target sequence score for the target nucleic acid sequence(s), e.g., the PriMD® score; a mean conservation score for the target nucleic acid sequence(s); a mean coverage score for the target nucleic acid sequence(s); 100% conservation score of a portion (e.g., 5′ end, center, 3′ end) of the target nucleic acid sequence(s); a species score; a strain score; a subtype score; a serotype score; an associated disease score; a year score; a country of origin score; a duplicate score; a patent score; and a minimum qualifying score. Other parameters that are used include, for example, the number of mismatches, the number of critical mismatches (e.g., mismatches that result in the predicted failure of the sequence to anneal to a target sequence), the number of native variant sequences that contain critical mismatches, and predicted Tm values. The term “Tm” means the temperature at which a population of double-stranded nucleic acid molecules becomes half-dissociated into single strands. Methods for calculating the Tm of nucleic acids are well known in the art (Berger and Kimmel (1987) Meth, Enzymol., Vol. 152: Guide To Molecular Cloning Techniques, San Diego: Academic Press, Inc. and Sambrook et al. (1989) Molecular Cloning: A Laboratory Manual, (2nd ed.) Vols. 1-3, Cold Spring Harbor Laboratory). The resultant scores represent steps in determining nucleotide or whole target nucleic acid sequence preference, while tailoring the primer and/or probe sequences so that they hybridize to a plurality of target nucleic acid variants. The methods of the invention also can comprise the step of allowing for one or more nucleotide changes when determining identity between the candidate primer and probe sequences and the target nucleic acid variant sequences, or their complements. In another embodiment, the methods of the invention comprise the steps of comparing the candidate primer and probe nucleic acid sequences to “exclusion nucleic acid sequences” and then rejecting those candidate nucleic acid sequences that share identity with the exclusion nucleic acid sequences. In another embodiment, the methods of the invention comprise the steps of comparing the candidate primer and probe nucleic acid sequences to “inclusion nucleic acid sequences” and then rejecting those candidate nucleic acid sequences that do not share identity with the inclusion nucleic acid sequences. A target nucleotide sequence of the present invention from which the primers and probes are designed, can be the entire HSV genome, a region thereof, or any HSV gene. In one aspect of the present invention the target gene is an HSV glycoprotein gene, such as glycoprotein B, D, or G. Accordingly, the present invention provides primers and probes that, for example, can amplify or detect all or glycoprotein B, D, or G protein variant sequences. The set of primers and probes described herein were generated based on a consensus matrix sequence, and then optimized against all known viral variants. In an embodiment of the methods of the invention, optimizing primers and probes comprises using a polymerase chain reaction (PCR) penalty score formula comprising at least one of a weighted sum of: primer Tm—optimal Tm; difference between primer Tms; amplicon length—minimum amplicon length; and distance between the primer and a TaqMan® probe. The optimizing step also can comprise determining the ability of the candidate sequence to hybridize with the most target nucleic acid variant sequences (e.g., the most target organisms or genes). In another embodiment, the selecting or optimizing step comprises determining which sequences have mean conservation scores closest to 1, wherein a standard of deviation on the mean conservation scores is also compared. In other embodiments, the methods further comprise the step of evaluating which target nucleic acid variant sequences are hybridized by an optimal forward primer and an optimal reverse primer, for example, by determining the number of base differences between target nucleic acid variant sequences in a database. For example, the evaluating step can comprise performing an in silico polymerase chain reaction, involving (1) rejecting the forward primer and/or reverse primer if it does not meet inclusion or exclusion criteria; (2) rejecting the forward primer and/or reverse primer if it does not amplify a medically valuable nucleic acid; (3) conducting a BLAST analysis to identify forward primer sequences and/or reverse primer sequences that overlap with a published and/or patented sequence; (4) and/or determining the secondary structure of the forward primer, reverse primer, and/or target. In an embodiment, the evaluating step includes evaluating whether the forward primer sequence, reverse primer sequence, and/or probe sequence hybridizes to sequences in the database other than the nucleic acid sequences that are representative of the target variants. The present invention provides polynucleotides that have preferred primer and probe qualities. These qualities are specific to the sequences of the optimized probes, however, one of skill in the art would recognize that other molecules with similar sequences could also be used. The oligonucleotides provided herein comprise a sequence that shares at least about 60-70% identity with a sequence described in Table 2. In addition, the sequences can be incorporated into longer sequences, provided they function to specifically anneal to and identify viral variants. In another embodiment, the invention provides a nucleic acid comprising a sequence that shares at least about 71%, about 72%, about 73%, about 74%, about 75%, about 76%, about 77%, about 78%, about 79%, about 80%, about 81%, about 82%, about 83%, about 84%, about 85%, about 86%, about 87%, about 88%, about 89%, about 90%, about 91%, about 92%, about 93%, about 94%, about 95%, about 96%, about 97%, about 98%, about 99%, or about 100% identity with the sequences disclosed herein or complement thereof. The terms “homology” or “identity” or “similarity” refer to sequence relationships between two nucleic acid molecules and can be determined by comparing a nucleotide position in each sequence when aligned for purposes of comparison. The term “homology” refers to the relatedness of two nucleic acid or protein sequences. The term “identity” refers to the degree to which nucleic acids are the same between two sequences. The term “similarity” refers to the degree to which nucleic acids are the same, but includes neutral degenerate nucleotides that can be substituted within a codon without changing the amino acid identity of the codon, as is well known in the art. The probe and/or primer nucleic acid sequences of the invention are optimal for identifying numerous variants of a target nucleic acid, e.g., from an HSV pathogen. In an embodiment, the nucleic acids of the invention are primers for the synthesis (e.g., amplification) of target nucleic acid variants and/or probes for identification, isolation, detection, or analysis of target nucleic acid variants, e.g., an amplified target nucleic acid variant that is amplified using the primers of the invention. The present polynucleotides hybridize with more than one viral variants (variants as determined by differences in their genomic sequence). The probes and primers provided herein can, for example, allow for the detection of all known viral variants or a subset thereof. In addition, the primers and probes of the present invention, depending on the variant sequence(s), can allow for the detection of previously unknown viral variants. The methods of the invention provide for optimal primers and probes, and sets thereof, and combinations of sets thereof, which can hybridize with a larger number of target variants than available primers and probes. In other aspects, the invention also provides vectors (e.g., plasmid, phage, expression), cell lines (e.g., mammalian, insect, yeast, bacterial), and kits comprising any of the sequences of the invention described herein. The invention further provides target nucleic acid variant sequences that are identified, for example, using the methods of the invention. In an embodiment, the target nucleic acid variant sequence is an amplification product. In another embodiment, the target nucleic acid variant sequence is a native or synthetic nucleic acid. The primers, probes, and target nucleic acid variant sequences, vectors, cell lines, and kits can have any number of uses, such as diagnostic, investigative, confirmatory, monitoring, predictive or prognostic. A diagnostic kit is provided by the present invention that comprises one or more of the polynucleotides described herein, which are useful for detecting and/or typing HSV infection in an individual. An individual can be a human male, human female, human adult, human child, or human fetus. An individual can also be any mammal, reptile, avian, fish, or amphibian. Hence, an individual can be a mouse, rat, sheep, dog, simian, horse, cattle, chicken, porcine, lamb, bird or fish. A probe of the present invention can comprise a label, such as a fluorescent label, a chemiluminescent label, a radioactive label, biotin, gold, dendrimers, aptamer, enzymes, proteins, and molecular motors. In an embodiment, the probe is a hydrolysis probe, such as, for example, a TaqMan® probe. In other embodiments, the probes of the invention are molecular beacons, SYBR Green® primers, or fluorescence energy transfer (FRET) probes. Polynucleotides of the present invention do not only include primers that are useful for conducting the aforementioned PCR amplification reactions, but also include polynucleotides that are attached to a solid support, such as, for example, a microarray, multiwell plate, column, bead, glass slide, polymeric membrane, glass microfiber, plastic tubes, cellulose, and carbon nanostructures. Hence, detection of HSV variants can be performed by exposing such a polynucleotide-covered surface to a sample such that the binding of a complementary variant DNA sequence to a surface-attached polynucleotide elicits a detectable signal or reaction. One embodiment of the invention uses solid support-based oligonucleotide hybridization methods to detect gene expression. Solid support-based methods suitable for practicing the present invention are widely known and are described (PCT application WO 95/11755; Huber et al., Anal. Biochem., 299:24, 2001; Meiyanto et al., Biotechniques, 31:406, 2001; Relogio et al., Nucleic Acids Res., 30:e51, 2002; the contents of which are incorporated herein by reference in their entirety). Any solid surface to which oligonucleotides can be bound, covalently or non-covalently, can be used. Such solid supports include, but are not limited to, filters, polyvinyl chloride dishes, silicon or glass based chips. In certain embodiments, the nucleic acid molecule can be directly bound to the solid support or bound through a linker arm, which is typically positioned between the nucleic acid sequence and the solid support. A linker arm that increases the distance between the nucleic acid molecule and the substrate can increase hybridization efficiency. There are a number of ways to position a linker arm. In one common approach, the solid support is coated with a polymeric layer that provides linker arms with a plurality of reactive ends/sites. A common example of this type is glass slides coated with polylysine (U.S. Pat. No. 5,667,976, the contents of which are incorporated herein by reference in its entirety), which are commercially available. Alternatively, the linker arm can be synthesized as part of or conjugated to the nucleic acid molecule, and then this complex is bonded to the solid support. One approach, for example, takes advantage of the extremely high affinity biotin-streptavidin interaction. The streptavidin-biotinylated reaction is stable enough to withstand stringent washing conditions and is sufficiently stable that it is not cleaved by laser pulses used in some detection systems, such as matrix-assisted laser desorption/ionization time of flight (MALDI-TOF) mass spectrometry. Therefore, streptavidin can be covalently attached to a solid support, and a biotinylated the nucleic acid molecule will bind to the streptavidin-coated surface. In one version of this method, an amino-coated silicon wafer is reacted with the n-hydroxysuccinimido-ester of biotin and complexed with streptavidin. Biotinylated oligonucleotides are bound to the surface at a concentration of about 20 fmol DNA per mm2. Alternatively, one can directly bind DNA to the support using carbodiimides, for example. In one such method, the support is coated with hydrazide groups, then treated with carbodiimide. Carboxy-modified nucleic acid molecules are then coupled to the treated support. Epoxide-based chemistries are also being employed with amine modified oligonucleotides. Other chemistries for coupling nucleic acid molecules to solid substrates are known to those of skill in the art. The nucleic acid molecules, e.g., the primers and probes of the present invention, must be delivered to the substrate material, which is suspected of containing or is being tested for the presence of HSV. Because of the miniaturization of the arrays, delivery techniques must be capable of positioning very small amounts of liquids in very small regions, very close to one another and amenable to automation. Several techniques and devices are available to achieve such delivery. Among these are mechanical mechanisms (e.g., arrayers from QeneticMicroSystems, MA, USA) and ink-jet technology. Very fine pipets can also be used. Other formats are also suitable within the context of this invention. For example, a 96-well format with fixation of the nucleic acids to a nitrocellulose or nylon membrane may also be employed. After the nucleic acid molecules have been bound to the solid support, it is often useful to block reactive sites on the solid support that are not consumed in binding to the nucleic acid molecule. In the absence of the blocking step, the probes can, to some extent, bind directly to the solid support itself, giving rise to non-specific binding. Non-specific binding can sometimes hinder the ability to detect low levels of specific binding. A variety of effective blocking agents (e.g., milk powder, serum albumin or other proteins with free amine groups, polyvinylpyrrolidine) can be used and others are known to those skilled in the art (U.S. Pat. No. 5,994,065, the contents of which are incorporated herein by reference in their entirety). The choice depends at least in part upon the binding chemistry. One embodiment uses oligonucleotide arrays, e.g., microarrays, that can be used to simultaneously observe the expression of a number of HSV variant genes, such as the matrix protein gene. Oligonucleotide arrays comprise two or more oligonucleotide probes provided on a solid support, wherein each probe occupies a unique location on the support. The location of each probe may be predetermined, such that detection of a detectable signal at a given location is indicative of hybridization to an oligonucleotide probe of a known identity. Each predetermined location can contain more than one molecule of a probe, but each molecule within the predetermined location has an identical sequence. Such predetermined locations are termed features. There can be, for example, from 2, 10, 100, 1,000, 2,000 or 5,000 or more of such features on a single solid support. In one embodiment, each oligonucleotide is located at a unique position on an array at least 2, at least 3, at least 4, at least 5, at least 6, or at least 10 times. Oligonucleotide probe arrays for detecting gene expression can be made and used according to conventional techniques described (Lockhart et al., Nat. Biotech., 14:1675-1680, 1996; McGall et al., Proc. Natl. Acad. Sci. USA, 93:13555, 1996; Hughes et al., Nat. Biotechnol., 19:342, 2001). A variety of oligonucleotide array designs is suitable for the practice of this invention. Generally, a detectable molecule, also referred to herein as a label, can be incorporated or added to an array's probe nucleic acid sequences. Many types of molecules can be used within the context of this invention. Such molecules include, but are not limited to, fluorochromes, chemiluminescent molecules, chromogenic molecules, radioactive molecules, mass spectrometry tags, proteins, and the like. Other labels will be readily apparent to one skilled in the art. Oligonucleotide probes used in the methods of the present invention, including microarray techniques, can be generated using PCR. PCR primers used in generating the probes are chosen, for example, based on the sequences of Example 4. In one embodiment, oligonucleotide control probes also are used. Exemplary control probes can fall into at least one of three categories referred to herein as (1) normalization controls, (2) expression level controls and (3) negative controls. In microarray methods, one or more of these control probes can be provided on the array with the inventive cell cycle gene-related oligonucleotides. Normalization controls correct for dye biases, tissue biases, dust, slide irregularities, malformed slide spots, etc. Normalization controls are oligonucleotide or other nucleic acid probes that are complementary to labeled reference oligonucleotides or other nucleic acid sequences that are added to the nucleic acid sample to be screened. The signals obtained from the normalization controls, after hybridization, provide a control for variations in hybridization conditions, label intensity, reading efficiency and other factors that can cause the signal of a perfect hybridization to vary between arrays. In one embodiment, signals (e.g., fluorescence intensity or radioactivity) read from all other probes used in the method are divided by the signal from the control probes, thereby normalizing the measurements. Virtually any probe can serve as a normalization control. Hybridization efficiency varies, however, with base composition and probe length. Preferred normalization probes are selected to reflect the average length of the other probes being used, but they also can be selected to cover a range of lengths. Further, the normalization control(s) can be selected to reflect the average base composition of the other probe(s) being used. In one embodiment, only one or a few normalization probes are used, and they are selected such that they hybridize well (i.e., without forming secondary structures) and do not match any test probes. In one embodiment, the normalization controls are mammalian genes. “Negative control” probes are not complementary to any of the test oligonucleotides (i.e., the inventive cell cycle gene-related oligonucleotides), normalization controls, or expression controls. In one embodiment, the negative control is a mammalian gene which is not complementary to any other sequence in the sample. The terms “background” and “background signal intensity” refer to hybridization signals resulting from non-specific binding or other interactions between the labeled target nucleic acids (e.g., mRNA present in the biological sample) and components of the oligonucleotide array. Background signals also can be produced by intrinsic fluorescence of the array components themselves. A single background signal can be calculated for the entire array, or a different background signal can be calculated for each target nucleic acid. In a one embodiment, background is calculated as the average hybridization signal intensity for the lowest 5 to 10 percent of the oligonucleotide probes being used, or, where a different background signal is calculated for each target gene, for the lowest 5 to 10 percent of the probes for each gene. Where the oligonucleotide probes corresponding to a particular HSV target hybridize well and, hence, appear to bind specifically to a target sequence, they should not be used in a background signal calculation. Alternatively, background can be calculated as the average hybridization signal intensity produced by hybridization to probes that are not complementary to any sequence found in the sample (e.g., probes directed to nucleic acids of the opposite sense or to genes not found in the sample). In microarray methods, background can be calculated as the average signal intensity produced by regions of the array that lack any oligonucleotides probes at all. In an alternative embodiment, the nucleic acid molecules are directly or indirectly coupled to an enzyme. Following hybridization, a chromogenic substrate is applied and the colored product is detected by a camera, such as a charge-coupled camera. Examples of such enzymes include alkaline phosphatase, horseradish peroxidase and the like. The invention also provides methods of labeling nucleic acid molecules with cleavable mass spectrometry tags (CMST; U.S. Pat. No. 60/279,890). After an assay is complete, and the uniquely CMST-labeled probes are distributed across the array, a laser beam is sequentially directed to each member of the array. The light from the laser beam both cleaves the unique tag from the tag-nucleic acid molecule conjugate and volatilizes it. The volatilized tag is directed into a mass spectrometer. Based on the mass spectrum of the tag and knowledge of how the tagged nucleotides were prepared, one can unambiguously identify the nucleic acid molecules to which the tag was attached (WO 9905319). The nucleic acids, primers and probes of the present invention can be labeled readily by any of a variety of techniques. When the diversity panel is generated by amplification, the nucleic acids can be labeled during the reaction by incorporation of a labeled dNTP or use of labeled amplification primer. If the amplification primers include a promoter for an RNA polymerase, a post-reaction labeling can be achieved by synthesizing RNA in the presence of labeled NTPs. Amplified fragments that were unlabeled during amplification or unamplified nucleic acid molecules can be labeled by one of a number of end labeling techniques or by a transcription method, such as nick-translation, random-primed DNA synthesis. Details of these methods are known to one of skill in the art and are set out in methodology books. Other types of labeling reactions are performed by denaturation of the nucleic acid molecules in the presence of a DNA-binding molecule, such as RecA, and subsequent hybridization under conditions that favor the formation of a stable RecA-incorporated DNA complex. In another embodiment, PCR-based methods are used to detect gene expression. These methods include reverse-transcriptase-mediated polymerase chain reaction (RT-PCR) including real-time and endpoint quantitative reverse-transcriptase-mediated polymerase chain reaction (Q-RTPCR). These methods are well known in the art. For example, methods of quantitative PCR can be carried out using kits and methods that are commercially available from, for example, Applied BioSystems and Stratagene®. See also Kochanowski, Quantitative PCR Protocols (Humana Press, 1999); Innis et al., supra.; Vandesompele et al., Genome Biol., 3:RESEARCH0034, 2002; Stein, Cell Mol. Life Sci. 59:1235, 2002. The forward and reverse amplification primers and internal hybridization probe is designed to hybridize specifically and uniquely with one nucleotide derived from the transcript of a target gene. In one embodiment, the selection criteria for primer and probe sequences incorporates constraints regarding nucleotide content and size to accommodate TaqMan® requirements. SYBR Green® can be used as a probe-less Q-RTPCR alternative to the TaqMan®-type assay, discussed above (ABI Prism® 7900 Sequence Detection System User Guide Applied Biosystems, chap. 1-8, App. A-F. (2002)). A device measures changes in fluorescence emission intensity during PCR amplification. The measurement is done in “real time,” that is, as the amplification product accumulates in the reaction. Other methods can be used to measure changes in fluorescence resulting from probe digestion. For example, fluorescence polarization can distinguish between large and small molecules based on molecular tumbling (U.S. Pat. No. 5,593,867). The primers and probes of the present invention may anneal to or hybridize to various HSV genetic material or genetic material derived therefrom, such as RNA, DNA, cDNA, or a PCR product. A “sample” that is tested for the presence of an HSV variant includes, but is not limited to a tissue sample, such as, for example, blood, serum, plasma, sputum, urine, stool, skin, cerebrospinal fluid, saliva, gastric secretions, hair, and tear fluid. A sample can be obtained by an oropharyngeal swab, nasopharyngeal swab, throat swab, nasal aspirate, nasal wash, or fluid collected from the ear, eye, mouth, or respiratory airway. The tissue sample may be fresh, fixed, preserved, or frozen. A sample also includes any item, surface, material, or clothing, or environment in which it may be desirable to test for the presence of HSV variant(s). Thus, for instance, the present invention includes testing door handles, faucets, table surfaces, elevator buttons, chairs, toilet seats, sinks, kitchen surfaces, children's cribs, bed linen, pillows, keyboards, and so on, for the presence of HSV variants. The target nucleic acid variant that is amplified may be RNA or DNA or a modification thereof. Thus, the amplifying step man comprise isothermal or non-isothermal reaction such as polymerase chain reaction, Scorpion® primers, molecular beacons, SimpleProbes®, HyBeacons®, cycling probe technology, Invader Assay, self-sustained sequence replication, nucleic acid sequence-based amplification, ramification amplifying method, hybridization signal amplification method, rolling circle amplification, multiple displacement amplification, thermophilic strand displacement amplification, transcription-mediated amplification, ligase chain reaction, signal mediated amplification of RNA, split promoter amplification, Q-Beta replicase, isothermal chain reaction, one cut event amplification, loop-mediated isotheiuial amplification, molecular inversion probes, ampliprobe, headloop DNA amplification, and ligation activated transcription. The amplifying step can be conducted on a solid support, such as a multiwell plate, array, column, bead, glass slide, polymeric membrane, glass microfiber, plastic tubes, cellulose, and carbon nanostructures. The amplifying step also comprises in situ hybridization. The detecting step can comprise gel electrophoresis, fluorescence resonant energy transfer, or hybridization to a labeled probe, such as a probe labeled with biotin, at least one fluorescent moiety, an antigen, a molecular weight tag, and a modifier of probe Tm. The detecting step comprises measuring fluorescence, mass, charge, and/or chemiluminescence. Hybridization may be detected in a variety of ways and with a variety of equipment. In general, the methods can be categorized as those that rely upon detectable molecules incorporated into the diversity panels and those that rely upon measurable properties of double-stranded nucleic acids (e.g., hybridized nucleic acids) that distinguish them from single-stranded nucleic acids (e.g., unhybridized nucleic acids). The latter category of methods includes intercalation of dyes, such as, for example, ethidium bromide, into double-stranded nucleic acids, differential absorbance properties of double and single stranded nucleic acids, binding of proteins that preferentially bind double-stranded nucleic acids, and the like. EXEMPLIFICATION Example 1 Scoring a Set of Predicted Annealing Oligonucleotides Each of the sets of primers and probes selected can be ranked by a combination of methods as individual primers and probes and as a primer/probe set. This will involve one or more method of ranking (e.g., joint ranking, hierarchical ranking, and serial ranking) where sets of primers and probes are eliminated or included based on any combination of the following criteria, and a weighted ranking again based on any combination of the following criteria, for example: (A) Percentage Identity to Target Variants; (B) Conservation Score; (C) Coverage Score; (D) Strain/Subtype/Serotype Score; (E) Associated Disease Score; (F) Duplicates Sequences Score; (G) Year and Country of Origin Score; (H) patent Score, and (I) Epidemiology Score. (A) Percentage Identity A percentage identity score is based upon the number of target nucleic acid variant (e.g., native) sequences that can hybridize with perfect conservation (the sequences are perfectly complimentary) to each primer or probe of a primer pair and probe set. If the score is less than 100%, the program ranks additional primer pair and probe sets that are not perfectly conserved. This is a hierarchical scale for percent identity starting with perfect complimentarily, then one base degeneracy through to the number of degenerate bases that would provide the score closest to 100%. The position of these degenerate bases would then be ranked. The methods for calculating the conservation is described under section B. (i) Individual Base Conservation Score A set of conservation scores is generated for each nucleotide base in the consensus sequence and these scores represent how many of the target nucleic acid variants sequences have a particular base at this position. For example, a score of 0.95 for a nucleotide with an adenosine, and 0.05 for a nucleotide with a cytidine means that 95% of the native sequences have an A at that position and 5% have a C at that position. A perfectly conserved base position is one where all the target nucleic acid variant sequences have the same base (either an A, C, G, or T/U) at that position. If there is an equal number of bases (e.g., 50% A & 50% T) at a position, it is identified with an N. (ii) Candidate Primer/Probe Sequence Conservation An overall conservation score is generated for each candidate primer or probe sequence that represents how many of the target nucleic acid variant sequences will hybridize to the primers or probes. A candidate sequence that is perfectly complimentary to all the target nucleic acid variant sequences will have a score of 1.0 and rank the highest. For example, illustrated below in Table 2 are three different 10-base candidate probe sequences that are targeted to different regions of a consensus target nucleic acid variant sequence. Each candidate probe sequence is compared to a total of 10 native sequences. TABLE 2 #1. A A A C A C G T G C 0.7 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0 →Number of target nucleic acid variant sequences that are perfectly complimentary - 7. Three out of the ten sequences do not have an A at position 1. #2. C C T T G T T C C A 1.0 0.9 1.0 0.9 0.9 1.0 1.0 1.0 1.0 1.0 →Number of target nucleic acid variant sequences that are perfectly complimentary - 7, 8, or 9. At least one target nucleic acid variant does not have a C at position 2, T at position 4, or G at position 5. These differences may all be on one target nucleic acid variant molecule or may be on two or three separate molecules. #3. C A G G G A C G A T 1.0 1.0 1.0 1.0 1.0 0.9 0.8 1.0 1.0 1.0 →Number of target nucleic acid variant sequences that are perfectly complimentary - 7 or 8. At least one target nucleic acid variant does not have an A at position 6 and at least two target nucleic acid variant do not have a C at position 7. These differences may all be on one target nucleic acid variant molecule or may be on two separate molecules. A simple arithmetic mean for each candidate sequence would generate the same value of 0.985. However, the number of target nucleic acid variant sequences identified by each candidate probe sequence can be very different. Sequence #1 can only identify 7 native sequences because of the 0.7 (out of 1.0) score by the first base—A. Sequence #2 has three bases each with a score of 0.9; each of these could represent a different or shared target nucleic acid variant sequence. Consequently, Sequence #2 can identify 7, 8 or 9 target nucleic acid variant sequences. Similarly, Sequence #3 can identify 7 or 8 of the target nucleic acid variant sequences. Therefore, Sequence #2 would be the best choice if all the three bases with a score of 0.9 represented the same 9 target nucleic acid variant sequences. (iii) Overall Conservation Score of the Primer and Probe Set—Percent Identity The same method described in (ii) when applied to the complete primer pair and probe set will generate the percent identity for the set (see A above). For example, using the same sequences illustrated above, if Sequences #1 and #2 are primers and Sequence #3 is a probe, then the percent identity for the target can be calculated from how many of the target nucleic acid variant sequences are identified with perfect complimentarity by all three primer/probe sequences. The percent identity could be no better than 0.7 (7 out of 10 target nucleic acid variant sequences) but as little as 0.1 if each of the degenerate bases reflects a different target nucleic acid variant sequence. Again, an arithmetic mean of these three sequences would be 0.985. As none of the above examples were able to capture all the target nucleic acid variant sequences because of the degeneracy (scores of less than 1.0), the ranking system takes into account that a certain amount of degeneracy can be tolerated under normal hybridization conditions, for example, during a polymerase chain reaction. The ranking of these degeneracies is described in (iv) below. An in silico evaluation determines how many native sequences (e.g., original sequences submitted to public databases) are identified by a given candidate primer/probe set. The ideal candidate primer/probe set is one that can perform PCR and the sequences are perfectly complimentary to all the known native sequences that were used to generate the consensus sequence. If there is no such candidate, then the sets are ranked according to how many degenerate bases can be accepted and still hybridize to just the target sequence during the PCR and yet identify all the native sequences. The hybridization conditions, for TaqMan® as an example are: 10-50 mM Tris-HCl pH 8.3, 50 mM KCl, 0.1-0.2% Triton® X-100 or 0.1% Tween®, 1-5 mM MgCl2. The hybridization is performed at 58-60° C. for the primers and 68-70° C. for the probe. The in silico PCR identifies native sequences that are not amplifiable using the candidate primers and probe set. The rules can be as simple as counting the number of degenerate bases to more sophisticated approaches based on exploiting the PCR criteria used by the PriMD® software. Each target nucleic acid variant sequence has a value or weight (see Score assignment above). If the failed target nucleic acid variant sequence is medically valuable, the primer/probe set is rejected. This in silico analysis provides a degree of confidence for a given genotype and is important when new sequences are added to the databases. New target nucleic acid variant sequences are automatically entered into both the “include” and “exclude” categories, For example, a new HSV sequence is tested against an HSV primer/probe set of the invention in the include category but will be added to the exclude category when it is tested against other primer/probe sets, such as HSV. Published primer and probes will also be ranked by the PriMD software. (iv) Position (5′ to 3′) of the Base Conservation Score In an embodiment, primers do not have bases in the terminal five positions at the 3′ end with a score less than 1. This is one of the last parameters to be relaxed if the method fails to select any candidate sequences. The next best candidate having a perfectly conserved primer would be one where the poorer conserved positions are limited to the terminal bases at the 5′ end. The closer the poorer conserved position is to the 5′ end, the better the score. For probes, the position criteria is different. For example, with a TaqMan® probe, the most destabilizing effect occurs in the center of the probe. The 5′ end of the probe is also important as this contains the reporter molecule that must be cleaved, following hybridization to the target, by the polymerase to generate a sequence-specific signal. The 3′ end is less critical. Therefore, a sequence with a perfectly conserved middle region will have the higher score. The remaining ends of the probe are ranked in a similar fashion to the 5′ end of the primer. Thus, the next best candidate to a perfectly conserved TaqMan® probe would be one where the poorer conserved positions are limited to the terminal bases at either the 5′ or 3′ ends. The hierarchical scoring will select primers with only one degeneracy first, then primers with two degeneracies next and so on. The relative position of each degeneracy will then be ranked favoring those that are closest to the 5′ end of the primers and those closest to the 3′ end of the TaqMan® probe. If there are two or more degenerate bases in a primer and probe set the ranking will initially select the sets where the degeneracies occur on different sequences. B. Coverage Score The total number of aligned sequences is considered under coverage score. A value is assigned to each position based on how many times that position has been reported or sequenced. Alternatively, coverage can be defined as how representative the sequences are of the known strains, subtypes etc., or their relevance to a certain diseases. For example, the target nucleic acid variant sequences for a particular gene may be very well conserved and show complete coverage but certain strains are not represented in those sequences. A sequence is included if it aligns with any part of the consensus sequence, which is usually a whole gene or a functional unit, or has been described as being a representative of this gene. Even though a base position is perfectly conserved it may only represent a fraction of the total number of sequences (for example, if there are very few sequences). For example, region A of a gene shows a 100% conservation from 20 sequence entries while region B in the same gene shows a 98% conservation but from 200 sequence entries. There is a relationship between conservation and coverage if the sequence shows some persistent variability. As more sequences are aligned, the conservation score falls, but this effect is lessened as the number of sequences gets larger. Unless the number of sequences is very small (e.g., under 10) the value of the coverage score is small compared to that of the conservation score. To obtain the best consensus sequence, artificial spaces are allowed to be introduced. Such spaces are not considered in the coverage score. D. Strain/Subtype/Serotype Score A value is assigned to each strain or subtype or serotype based upon its relevance to a disease. For example, strains of INF-A that are linked to pandemics will have a higher score than strains that are generally regarded as benign or included in the current vaccine. The score is based upon sufficient evidence to automatically associate a particular strain with a disease. For example, certain strains of adenovirus are not associated with diseases of the upper respiratory system. Accordingly, there will be sequences included in the consensus sequence that are not associated with diseases of the upper respiratory system. E. Associated Disease Score The associated disease score pertains to strains that are not known to be associated with a particular disease (to differentiate from D above). Here, a value is assigned only if the submitted sequence is directly linked to the disease and that disease is pertinent to the assay. F. Duplicate Sequences Score If a particular sequence has been sequenced more than once it will have an effect on representation, for example, a strain that is represented by 12 entries in GenBank of which six are identical and the other six are unique. Unless the identical sequences can be assigned to different strains/subtypes (usually by sequencing other gene or by immunology methods) they will be excluded from the scoring. G. Year and Country of Origin Score The year and country of origin scores are important in terms of the age of the human population and the need to provide a product for a global market. For example, strains identified or collected many years ago may not be relevant today. Furthermore, it is probably difficult to obtain samples that contain these older strains. In addition, some strains may have the potential for creating an epidemic if most of the present population does not have immunity. Certain divergent strains from more obscure countries or sources may also be less relevant to the locations that will likely perform clinical tests, or may be more important for certain countries (e.g., North America, Europe, or Asia). H. Patent Score Candidate target variant sequences published in patents are searched electronically and annotated such that patented regions are excluded. Alternatively, candidate sequences are checked against a patented sequence database. I. Minimum Qualifying Score The minimum qualifying score is determined by expanding the number of allowed mismatches in each set of candidate primers and probes until all possible native sequences are represented (e.g., has a qualifying hit). J. Other A score is given to based on other parameters, such as relevance to certain patients (e.g., pediatrics, immunocompromised) or certain therapies (e.g., target those strains that respond to treatment) or epidemiology. The prevalence of an organism/strain and the number of times it has been tested for in the community can add value to the selection of the candidate sequences. If a particular strain is more commonly tested then selection of it would be more likely. Strain identification can be used to selection better vaccines. Example 2 Primer/Probe Evaluation Once the candidate primers and probes have received their scores and have been ranked, they are evaluated using any of a number of methods of the invention, such as BLAST analysis and secondary structure analysis. A. BLAST Analysis The candidate primer/probe sets are submitted to BLAST analysis to check for possible overlap with any published sequences that might be missed by the Include/Exclude function. It also provides a useful summary. B. Secondary Structure The methods of the present invention include analysis of nucleic acid secondary structure. This includes the structures of the primers and/or probes as well as their intended target variant sequences. The methods and software of the invention predict the optimal temperatures for the annealing but assumes that the target (e.g., RNA or DNA) does not have any significant secondary structure. For example, if the starting material is RNA, the first stage is the creation of a complimentary strand of DNA (cDNA) using a specific primer. This is usually performed at temperatures where the RNA template can have significant secondary structure thereby preventing the annealing of the primer. Similarly, after denaturation of a double stranded DNA target (for example, an amplicon after PCR), the binding of the probe is dependent on there being no major secondary structure in amplicon. The methods of the invention can either use this information as a criteria for selecting primers and probes or evaluate any secondary structure of a selected sequence, for example, by cutting and pasting candidate primer or probe sequences into a commercial internet link that uses software dedicated to analyzing secondary structure, such as, for example, MFOLD (Zuker et al. (1999) Algorithms and Thermodynamics for RNA Secondary Structure Prediction: A Practical Guide in RNA Biochemistry and Biotechnology, J. Barciszewski and B. F. C. Clark, eds., NATO ASI Series, Kluwer Academic Publishers). C. Evaluating the Primer and Probe Sequences The methods and software of the invention may also analyze any nucleic acid sequence to determine its suitability in a nucleic acid amplification-based assay. For example, it can accept a competitor's primer set and determine the following information: (1) How it compares to the primers of the invention (e.g., overall rank, PCR and conservation ranking, etc.); (2) How it aligns to the exclude libraries (e.g., assessing cross-hybridization)—also used to compare primer and probe sets to newly published sequences; and (3) If the sequence has been previously published. This step requires keeping a database of sequences published in scientific journals, posters, and other presentations. Example 3 Multiplexing The Exclude/Include capability is ideally suited for designing multiplex reactions. The parameters for designing multiple primer and probe sets adhere to a more stringent set of parameters than those used for the initial Exclude/Include function. Each set of primers and probe, together with the resulting amplicon is screened against the other sets that constitute the multiplex reaction. As new targets are accepted their sequences are automatically added to the Exclude category. The database is designed to interrogate the online databases to determine and acquire, if necessary, any new sequences relevant to the targets. These sequences are evaluated against the optimal primer/probe set. If they represented a new genotype or strain then a multiple sequence alignment may be required. Example 4 Sequences Identified for Detecting HSV A set of primers and probes useful for detecting and typing HSV variants was generated. The set of primers and probes were then scored according to the methods described herein to identify the optimized primers and probes of Tables 3 and 4. It should be noted that the primers, as they are sequences that anneal to a plurality or all known or unknown HSV variants, can also be used as probes either in the presence or absence of amplification of a sample. TABLE 3 Group no. Forward Primer Probe Reverse Primer  1 CTGGGCGAGAACAACGA ACTCCTCGAAGTACACGTAGCCCCCG GATGTTCAGGTCGATGAAGGT (SEQ ID NO: 1) (SEQ ID NO: 2) (SEQ ID NO: 3)  2 GCCACGGTGGTGCAGTT CCTTGAAGACCACCGCGATGCC TGTACGGGGCGATGTTCT (SEQ ID NO: 4) (SEQ ID NO: 5) (SEQ ID NO: 6)  3 GCCACGGTGGTGCAGTT AAGACCACCGCGATGCCCTCC TGTACGGGGCGATGTTCT (SEQ ID NO: 4) (SEQ ID NO: 7) (SEQ ID NO: 6)  4 GCCACGGTGGTGCAGTT ACCGCGATGCCCTCCGTGTAGTTCTG TGTACGGGGCGATGTTCT (SEQ ID NO: 4) (SEQ ID NO: 8) (SEQ ID NO: 6)  5 GCCACGGTGGTGCAGTT TCCTTGAAGACCACCGCGATGCC TTGTACGGGGCGATGTTC (SEQ ID NO: 4) (SEQ ID NO: 9) (SEQ ID NO: 10)  6 GCCACGGTGGTGCAGTT AAGACCACCGCGATGCCCTCCG TTTGTAGTACATGGTGGCCTTGAA (SEQ ID NO: 4) (SEQ ID NO: 11) (SEQ ID NO: 12)  7 GCCACGGTGGTGCAGTT CCTTGAAGACCACCGCGATGCC TTGTACGGGGCGATGTTCT (SEQ ID NO: 4) (SEQ ID NO: 5) (SEQ ID NO: 13)  8 GCCACGGTGGTGCAGTT AAGACCACCGCGATGCCCTCCG CTTTGTAGTACATGGTGGCCTTGA (SEQ ID NO: 4) (SEQ ID NO: 11) (SEQ ID NO: 14)  9 GCCACGGTGGTGCAGTT TCTTCAAGGAGAACATCGCCCCGT TTTGTAGTACATGGTGGCCTTGAA (SEQ ID NO: 4) (SEQ ID NO: 15) (SEQ ID NO: 12) 10 GCATCGCGGTGGTCTTC CAGGTGTGGTTCGGCCACCGCTACT AAAACGGGGACATGTACACAA (SEQ ID NO: 16) (SEQ ID NO: 17) (SEQ ID NO: 19) 11 TCAAGGCCACCATGTACTACAAA CAGGTGTGGTTCGGCCACCGCTAC GTAAAACGGGGACATGTACACAA (SEQ ID NO: 20) (SEQ ID NO: 21) (SEQ ID NO: 22) 12 TCAAGGCCACCATGTACTACAAA AGGTGTGGTTCGGCCACCGCTACTC GTAAAACGGGGACATGTACACAA (SEQ ID NO: 20) (SEQ ID NO: 23) (SEQ ID NO: 22) 13 CAAGGCCACCATGTACTACAAAGA CAGGTGTGGTTCGGCCACCGCTAC GTAAAACGGGGACATGTACACAAA (SEQ ID NO: 24) (SEQ ID NO: 21) (SEQ ID NO: 68) 14 GAACATCGCCCCGTACAA CAGGTGTGGTTCGGCCACCGCTACT TGTCGATCACCTCCTCGAA (SEQ ID NO: 25) (SEQ ID NO: 17) (SEQ ID NO: 18) 15 GAACATCGCCCCGTACAA AGGTGTGGTTCGGCCACCGCTACTC TGTCGATCACCTCCTCGAA (SEQ ID NO: 25) (SEQ ID NO: 23) (SEQ ID NO: 18) 16 GAACATCGCCCCGTACAA TGTGGTTCGGCCACCGCTACTCC TGTCGATCACCTCCTCGAA (SEQ ID NO: 25) (SEQ ID NO: 26) (SEQ ID NO: 18) 17 GAACATCGCCCCGTACAA TGGTTCGGCCACCGCTACTCCCA TGTCGATCACCTCCTCGAA (SEQ ID NO: 25) (SEQ ID NO: 27) (SEQ ID NO: 18) 18 GAACATCGCCCCGTACAA TTCGGCCACCGCTACTCCCAGTTTATG TGTCGATCACCTCCTCGAA (SEQ ID NO: 25) (SEQ ID NO: 28) (SEQ ID NO: 18) 19 GAACATCGCCCCGTACAA CGGCCACCGCTACTCCCAGTTTATGG TGTCGATCACCTCCTCGAA (SEQ ID NO: 25) (SEQ ID NO: 29) (SEQ ID NO: 18) 20 CAAGGCCACCATGTACTACAAAGAC CAGGTGTGGTTCGGCCACCGCTAC CCCGCGAGGGGTTGTACT (SEQ ID NO: 65) (SEQ ID NO: 21) (SEQ ID NO: 30) 21 CAAGGCCACCATGTACTACAAAGAC AGGTGTGGTTCGGCCACCGCTACTC CCCGCGAGGGGTTGTACT (SEQ ID NO: 65) (SEQ ID NO: 23) (SEQ ID NO: 30) 22 GCCACGGTGGTGCAGTT TGGTCTTCAAGGAGAACATCGCCCCGTA TGTCGATCACCTCCTCGAA (SEQ ID NO: 4) (SEQ ID NO: 31) (SEQ ID NO: 18) 23 GCCACGGTGGTGCAGTT TCTTCAAGGAGAACATCGCCCCGTACAA TGTCGATCACCTCCTCGAA (SEQ ID NO: 4) (SEQ ID NO: 32) (SEQ ID NO: 18) 24 TCGAGGAGGTGATCGACAA TGGAGACCACCGCGTTTCACCG ACGGGGACATGTACACAAAGT (SEQ ID NO: 33) (SEQ ID NO: 34) (SEQ ID NO: 35) 25 ACTTTGTGTACATGTCCCCGTTTTA TACGCCGCCGACCGCTTCAA GGAAGGAGCCGCCGTACTC (SEQ ID NO: 36) (SEQ ID NO: 37) (SEQ ID NO: 38) 26 ACTTTGTGTACATGTCCCCGTTTTA CTTCTACGCGCGCGACCTCACCAC GGAAGGAGCCGCCGTACTC (SEQ ID NO: 36) (SEQ ID NO: 67) (SEQ ID NO: 38) 27 TTTGTGTACATGTCCCCGTTTTAC TACGCCGCCGACCGCTTCAA GAAGGAGCCGCCGTACTC (SEQ ID NO: 42) (SEQ ID NO: 37) (SEQ ID NO: 39) 28 ACTTTGTGTACATGTCCCCGTTTTAC TACGCCGCCGACCGCTTCAA TCCTGCCACTTGGTCATGGT (SEQ ID NO: 66) (SEQ ID NO: 37) (SEQ ID NO: 40) 29 TCGAGGAGGTGATCGACAA TGGAGACCACCGCGTTTCACCG CGCGAGGGGTTGTACTTG (SEQ ID NO: 33) (SEQ ID NO: 34) (SEQ ID NO: 41) 30 CAAGGCCACCATGTACTACAAA CAGGTGTGGTTCGGCCACCGCTAC TGTCGATCACCTCCTCGAA (SEQ ID NO: 34) (SEQ ID NO: 21) (SEQ ID NO: 18) 31 CAAGGCCACCATGTACTACAAA AGGTGTGGTTCGGCCACCGCTACTC TGTCGATCACCTCCTCGAA (SEQ ID NO: 34) (SEQ ID NO: 23) (SEQ ID NO: 18) 32 CTTCGAGGAGGTGATCGACAAGA TGGAGACCACCGCGTTTCACCG CCGCGAGGGGTTGTACTTGA (SEQ ID NO: 35) (SEQ ID NO: 34) (SEQ ID NO: 36) 33 GAGACCACCGCGTTTCAC TGGCACACCACCGACCTCAAGTACAACC AAAACGGGGACATGTACACAA (SEQ ID NO: 38) (SEQ ID NO: 39) (SEQ ID NO: 19) 34 GAGACCACCGCGTTTCAC CACACCACCGACCTCAAGTACAACCCCTC AAAACGGGGACATGTACACAA (SEQ ID NO: 38) (SEQ ID NO: 40) (SEQ ID NO: 19) 35 GAGACCACCGCGTTTCAC CCACCGACCTCAAGTACAACCCCTCG AAAACGGGGACATGTACACAA (SEQ ID NO: 38) (SEQ ID NO: 41) (SEQ ID NO: 19) 36 GAGACCACCGCGTTTCAC TGGCACACCACCGACCTCAAGTACAACC AAACGGGGACATGTACACAAA (SEQ ID NO: 38) (SEQ ID NO: 39) (SEQ ID NO: 42) 37 CGAGGAGGTGATCGACAAGA TGGAGACCACCGCGTTTCACCG CCGCGAGGGGTTGTACT (SEQ ID NO: 43) (SEQ ID NO: 34) (SEQ ID  NO: 44) 38 GGAGACCACCGCGTTTC TGGCACACCACCGACCTCAAGTACAACC AGCCGTAAAACGGGGACAT (SEQ ID NO: 45) (SEQ ID NO: 39) (SEQ ID NO: 47) 39 GGAGACCACCGCGTTTC CACCACCGACCTCAAGTACAACCCCTCG AGCCGTAAAACGGGGACAT (SEQ ID NO: 45) (SEQ ID NO: 46) (SEQ ID NO: 47) 40 CCACGAGACCGACATGGA TGGCACACCACCGACCTCAAGTACAACC TAAAACGGGGACATGTACACAA (SEQ ID NO: 37) (SEQ ID NO: 39) (SEQ ID NO: 48) 41 CTTCGAGGAGGTGATCGACAAGA TGGAGACCACCGCGTTTCACCG ACCCGCGAGGGGTTGTACT (SEQ ID NO: 35) (SEQ ID NO: 34) (SEQ ID NO: 49) 42 TCAAGGCCACCATGTACTACAAAGA AGGTGTGGTTCGGCCACCGCTACTC CTTGTCGATCACCTCCTCGAA (SEQ ID NO: 50) (SEQ ID NO: 23) (SEQ ID NO: 52) 43 CAAGGCCACCATGTACTACAAAGA CAGGTGTGGTTCGGCCACCGCTAC TCTTGTCGATCACCTCCTCGAA (SEQ ID NO: 24) (SEQ ID NO: 21) (SEQ ID NO: 53) 44 CAAGGCCACCATGTACTACAAAGA AGGTGTGGTTCGGCCACCGCTACTC TCTTGTCGATCACCTCCTCGAA (SEQ ID NO: 24) (SEQ ID NO: 23) (SEQ ID NO: 53) 45 CAAGGCCACCATGTACTACAAAGA TTCGGCCACCGCTACTCCCAGTTTATG TCTTGTCGATCACCTCCTCGAA (SEQ ID NO: 24) (SEQ ID NO: 28) (SEQ ID NO: 53) 46 TTCGAGGAGGTGATCGACAAGAT TGGAGACCACCGCGTTTCACCG CCGCGAGGGGTTGTACTTGA (SEQ ID NO: 58) (SEQ ID NO: 34) (SEQ ID NO: 36) 47 CCACGAGACCGACATGGA CACCACCGACCTCAAGTACAACCCCTCG GTAAAACGGGGACATGTACACAA (SEQ ID NO: 37) (SEQ ID NO: 46) (SEQ ID NO: 22) 48 CCACGAGACCGACATGGA TGGCACACCACCGACCTCAAGTACAACC ACGGGGACATGTACACAAAGT (SEQ ID NO: 37) (SEQ ID NO: 39) (SEQ ID NO: 35) 49 AGCGGCCTGCTGGACTAC AGGTCCAGCGCCGCAACCAG GGATGACCGTGTCGATGTC (SEQ ID NO: 54) (SEQ ID NO: 55) (SEQ ID NO: 56) 50 CCACGAGACCGACATGGA TGGCACACCACCGACCTCAAGTACAACC AACGGGGACATGTACACAAAGT (SEQ ID NO: 37) (SEQ ID NO: 39) (SEQ ID NO: 57) 51 TTCGAGGAGGTGATCGACAAGAT TGGAGACCACCGCGTTTCACCG ACCCGCGAGGGGTTGTACTT (SEQ ID NO: 58) (SEQ ID NO: 34) (SEQ ID NO: 61) 52 TGGAGACCACCGCGTTT CACACCACCGACCTCAAGTACAACCCCTC CCTCCCGGTAGCCGTAAA (SEQ ID NO: 59) (SEQ ID NO: 40) (SEQ ID NO: 62) 53 TGGAGACCACCGCGTTT CACCGACCTCAAGTACAACCCCTCGC CCTCCCGGTAGCCGTAAA (SEQ ID NO: 59) (SEQ ID NO: 60) (SEQ ID NO: 62) 54 AGCGGCCTGCTGGACTA CCGCAACCAGCTGCACGACCT GGATGACCGTGTCGATGTC (SEQ ID NO: 64) (SEQ ID NO: 63) (SEQ ID NO: 56) TABLE 4 Typing Multiplex sets No. run Forward Primer Probe Reverse Primer 1 61 CATTTTACGAGGAGGAGGGGTATAA AAGCTTCAGCGCGAACGACCAACT AATCACGGCCCCCAACCT 62 AAGACGCCCCTCCCTGTGT TCAGTCGACCCAAGCGCGGAA CATCTCGTCGGGGGGAGTAG 2 61 TACGAGGAGGAGGGGTATAACAA AAGCTTCAGCGCGAACGACCAACT ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 TACTCCCCCCGACGAGATG CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 3 61 GGGGGAGGGGCCATTT CGGTCATAAGCTTCAGCGCGAACGA ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 ACTCCCCCCGACGAGATG CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 4 61 GGGGGAGGGGCCATTT TCATAAGCTTCAGCGCGAACGACCAA ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 ACTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 5 61 GGGAGGGGCCATTTTACG ATAAGCTTCAGCGCGAACGACCAACTAC TCACGGCCCCCAACCT 62 CCCCCGCAACCACTACTC CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 6 61 GGGAGGGGCCATTTTACG CATAAGCTTCAGCGCGAACGACCAACTA TCACGGCCCCCAACCT 62 CTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 7 61 CATTTTACGAGGAGGAGGGGTATAA AAGCTTCAGCGCGAACGACCAACT AATCACGGCCCCCAACCT 62 AAGACGCCCCTCCCTGTGT TCAGTCGACCCAAGCGCGGAA TCTCGTCGGGGGGAGTAGTG (SEQ ID NO: 75) 8 61 GGGAGGGGCCATTTTACG AAGCTTCAGCGCGAACGACCAACTAC TCACGGCCCCCAACCT 62 TACTCCCCCCGACGAGATG CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 9 61 GGGGGAGGGGCCATTT TCATAAGCTTCAGCGCGAACGACCAACTA ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 ACTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 10 61 GGGGAGGGGCCATTTTAC AAGCTTCAGCGCGAACGACCAACTA ATCACGGCCCCCAACCT (SEQ ID NO: 71) (SEQ ID NO: 72) 62 ACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 11 61 ACGAGGAGGAGGGGTATAACAAA AAGCTTCAGCGCGAACGACCAAC ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 AAGACGCCCCTCCCTGTGT TCAGTCGACCCAAGCGCGGAAC CATCTCGTCGGGGGGAGTA (SEQ ID NO: 74) 12 61 GGGGGAGGGGCCATTT AAGCTTCAGCGCGAACGACCAACT TCACGGCCCCCAACCT 62 CCCCCGCAACCACTACTC CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 13 61 GGGAGGGGCCATTTTACG CATAAGCTTCAGCGCGAACGACCAAC TCACGGCCCCCAACCT 62 ACTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 14 61 GGGAGGGGCCATTTTACG CATAAGCTTCAGCGCGAACGACCAACT TCACGGCCCCCAACCT 62 CCCCCGCAACCACTACTC CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 15 61 GGGAGGGGCCATTTTACG CATAAGCTTCAGCGCGAACGACCAACT TCACGGCCCCCAACCT 62 ACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 16 61 CGAGGAGGAGGGGTATAACAAA AGCTTCAGCGCGAACGACCAACT ATCACGGCCCCCAACCT (SEQ ID NO: 70) (SEQ ID NO: 72) 62 AGACGCCCCTCCCTGTGT CAGTCGACCCAAGCGCGGAA TCGTCGGGGGGAGTAGTG (SEQ ID NO: 73) 17 61 CGAGGAGGAGGGGTATAACAAA AGCTTCAGCGCGAACGACCAACT ATCACGGCCCCCAACCT (SEQ ID NO: 70) (SEQ ID NO: 72) 62 AGACGCCCCTCCCTGTGT TCAGTCGACCCAAGCGCGGAA CATCTCGTCGGGGGGAGTA (SEQ ID NO: 73) 18 61 ACGAGGAGGAGGGGTATAACAAA AAGCTTCAGCGCGAACGACCAAC ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 AAGACGCCCCTCCCTGTGT CTCAGTCGACCCAAGCGCGGA ATCTCGTCGGGGGGAGTAGT 19 61 ACGAGGAGGAGGGGTATAACAAA AAGCTTCAGCGCGAACGACCAACT ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 ACTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 20 61 CGAGGAGGAGGGGTATAACAAAG AAGCTTCAGCGCGAACGACCAACT ATCACGGCCCCCAACCT (SEQ ID NO: 72) 62 TACTCCCCCCGACGAGATG CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 21 61 CGAGGAGGAGGGGTATAACAAA AAGCTTCAGCGCGAACGACCAAC ATCACGGCCCCCAACCT (SEQ ID NO: 70) (SEQ ID NO: 72) 62 AGACGCCCCTCCCTGTGT CAGTCGACCCAAGCGCGGAAC TCTCGTCGGGGGGAGTAGT (SEQ ID NO: 73) 22 61 ACCTGCGGCTCGTGAAGA AAACGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 23 61 AAACGACTGGACGGAGATTACAC AGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 24 61 AAGATAAACGACTGGACGGAGATT ACACAGTTTATCCTGGAGCACCGAGCC CGTCACCCCCTGCTGGTA 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 25 61 ATAAACGACTGGACGGAGATTACAC AGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 26 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGA GTGCCGGCGGTCTCAA 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 27 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGA GTGTAATCTCCGTCCAGTCGTTTA 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 28 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGA CCGGCGGTCTCAAACG 62 GCCGTCAGCCCATCCT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 80) (SEQ ID NO: 81) 29 61 CGAAGACGTCCGGAAACAAC ACAGTTGCCTCCCATCCGAAACCAAG ATGACCGTGATGGGGATAGC 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 30 61 CCGGAAACAACCCTACAACCT ACAGTTGCCTCCCATCCGAAACCAAG ATGACCGTGATGGGGATAGC (SEQ ID NO: 82) 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 31 61 CGAAGACGTCCGGAAACAA ACAGTTGCCTCCCATCCGAAACCAAG ATGACCGTGATGGGGATAGC 62 GCCGTCAGCCCATCCT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 80) (SEQ ID NO: 81) 32 61 GAGGCCCCCCAGATTGTC ACAGTTGCCTCCCATCCGAAACCAAG ATGACCGTGATGGGGATAGC 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 33 61 TCCGAAGACGTCCGGAAA ACAGTTGCCTCCCATCCGAAACCAAG ATGACCGTGATGGGGATAGC 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 34 61 CCTCCCGATCACGGTTTAC CCTGCCGCAGCGTGCTCCTA CCCCGCGGACAATCTG 62 CGTCAGCCCATCCTCCTT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 79) (SEQ ID NO: 80) (SEQ ID NO: 81) 35 61 CCTCCCGATCACGGTTTAC CCTGCCGCAGCGTGCTCCTA CCCCGCGGACAATCTG 62 GCCGTCAGCCCATCCT CCGTCCCCAAAGACGTGCGG CAGCAGGGAAGCATTTACGA (SEQ ID NO: 80) (SEQ ID NO: 81) 36 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 37 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 CTCCCCTGCTCTAGATATCCTCTTT ATCATCAGCACCACCATCCACACGG AAGGCGACCAGACAAACGAA 38 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 CTCCCCTGCTCTAGATATCCTCTTTAT CATCAGCACCACCATCCACACGGC AAGGCGACCAGACAAACGAA 39 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 TCCCCTGCTCTAGATATCCTCTTTATC ATCAGCACCACCATCCACACGGC AAGGCGACCAGACAAACGAA 40 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 CCCTGCTCTAGATATCCTCTTTATCATC AGCACCACCATCCACACGGCGG AAGGCGACCAGACAAACGAA 41 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC CAAGGCGACCAGACAAACG 42 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 CACATCCCCCTGTTCTGGTT CCTAACGGCCTCCCCTGCTCTAGATATCCTC GGATGGTGGTGCTGATGATAAA 43 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 CCCAACACATCCCCCTGTT CTGGTTCCTAACGGCCTCCCCTGCTCTA GGATGGTGGTGCTGATGATAAA 44 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 ACACATCCCCCTGTTCTGGTT CCTAACGGCCTCCCCTGCTCTAGATATCCTCT TGGATGGTGGTGCTGATGATAA 45 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 GGCGGCGTTCGTTTGTC TGGTCGCCTTGGCAGCACAACTTT TCGGGTGCGCGTATCG 46 61 AGCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG ATCTTCACGAGCCGCAGGTA 62 CCCAACACATCCCCCTGTT CTGGTTCCTAACGGCCTCCCCTGCTCTA GGTGGTGCTGATGATAAAGAGGATA 47 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TCTTCACGAGCCGCAGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC TCTTCACGAGCCGCAGGTA 48 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TCTTCACGAGCCGCAGGTA 62 CTCCCCTGCTCTAGATATCCTCTTT ATCATCAGCACCACCATCCACACGG AAGGCGACCAGACAAACGAA 49 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TCTTCACGAGCCGCAGGTA 62 CCCTGCTCTAGATATCCTCTTTATCATC AGCACCACCATCCACACGGCGG AAGGCGACCAGACAAACGAA 50 61 AGCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TATCTTCACGAGCCGCAGGTA 62 ACACATCCCCCTGTTCTGGTT CCTAACGGCCTCCCCTGCTCTAGATATCCTCTT CCGCCGTGTGGATGGT TAT 51 61 ACCTGCGGCTCGTGAAGA AAACAGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 ACACATCCCCCTGTTCTGGTT CTAACGGCCTCCCCTGCTCTAGATATCCTCT GTGGATGGTGGTGCTGATGA 52 61 ACCTGCGGCTCGTGAAGA AAACGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCAC AAGGCGACCAGACAAACGAA 53 61 ACCTGCGGCTCGTGAAGA AAACGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 CTCCCCTGCTCTAGATATCCTCTTTAT CATCAGCACCACCATCCACACGG AAGGCGACCAGACAAACGAA 54 61 ACCTGCGGCTCGTGAAGA AAACGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCAC CAAGGCGACCAGACAAACG 55 61 CCTGCGGCTCGTGAAGAT AAACGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 ACACATCCCCCTGTTCTGGTT CTAACGGCCTCCCCTGCTCTAGATATCCTCT GTGGATGGTGGTGCTGATGA 56 61 CCTGCGGCTCGTGAAGAT AAACGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 CCCCACACCCCAACACAT CCCCCTGTTCTGGTTCCTAACGGC GTGGATGGTGGTGCTGATGA 57 61 CCTGCGGCTCGTGAAGAT AAACGACTGGACGGAGATTACACAGTTTATCC CGTCACCCCCTGCTGGTA 62 GCCCCACACCCCAACA CATCCCCCTGTTCTGGTTCCTAACGG CCGCCGTGTGGATGGT 58 61 AAACGACTGGACGGAGATTACAC AGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCAC AAGGCGACCAGACAAACGAA 59 61 AAACGACTGGACGGAGATTACAC AGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 CTCCCCTGCTCTAGATATCCTCTTTAT ATCAGCACCACCATCCACACGGC AAGGCGACCAGACAAACGAA 60 61 GAAGATAAACGACTGGACGGAGAT ACACAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACA AAGGCGACCAGACAAACGAA 61 61 GAAGATAAACGACTGGACGGAGAT ACACAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACACATCCCCCTGTTCTGGTT CCTAACGGCCTCCCCTGCTCTAGATATCCTCTT TGTGGATGGTGGTGCTGATG TAT 62 61 GAAGATAAACGACTGGACGGAGAT TACACAGTTTATCCTGGAGCACCGAGCCAA CGTCACCCCCTGCTGGTA 62 CACATCCCCCTGTTCTGGTT CCTAACGGCCTCCCCTGCTCTAGATATCCTCTT CCGCCGTGTGGATGGT TAT 63 61 AAGATAAACGACTGGACGGAGATT ACACAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 64 61 TAAACGACTGGACGGAGATTACAC AGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCAC AAGGCGACCAGACAAACGAA 65 61 TAAACGACTGGACGGAGATTACAC AGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 TCCCCTGCTCTAGATATCCTCTTTATC ATCAGCACCACCATCCACACGGC AAGGCGACCAGACAAACGAA 66 61 GATAAACGACTGGACGGAGATTACA CAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 67 61 GATAAACGACTGGACGGAGATTACA CAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 CCCCACACCCCAACACAT CCCCCTGTTCTGGTTCCTAACGGCCT CCGCCGTGTGGATGGT 68 61 ATAAACGACTGGACGGAGATTACAC AGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCAC AAGGCGACCAGACAAACGAA 69 61 AAGATAAACGACTGGACGGAGATTA CACAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 70 61 GAAGATAAACGACTGGACGGAGATT ACACAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 71 61 AAGATAAACGACTGGACGGAGATTAC CAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 72 61 AAGATAAACGACTGGACGGAGATTAC ACAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 73 61 GAAGATAAACGACTGGACGGAGATTA CACAGTTTATCCTGGAGCACCGAGCCAAG CGTCACCCCCTGCTGGTA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC AAGGCGACCAGACAAACGAA 74 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TCCGTCCAGTCGTTTATCTTCA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC GCCAAGGCGACCAGACAA 75 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TCCGTCCAGTCGTTTATCTTCA 62 CTCCCCTGCTCTAGATATCCTCTTT ATCATCAGCACCACCATCCACACGG GCCAAGGCGACCAGACAA 76 61 GCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TCCGTCCAGTCGTTTATCTTCA 62 ACACATCCCCCTGTTCTGGTT CCTAACGGCCTCCCCTGCTCTAGATATCCTCT CCGCCGTGTGGATGGT TTAT 77 61 AGCCCCGCTGGAACTACTATG ACAGCTTCAGCGCCGTCAGCGAG TCCGTCCAGTCGTTTATCTTCA 62 ACGGCCTCCCCTGCTCTA ATATCCTCTTTATCATCAGCACCACCATCCACAC GCCAAGGCGACCAGACAA 78 61 AGCCCCGCTGGAACTACTATG CAGCTTCAGCGCCGTCAGCGAG TCCGTCCAGTCGTTTATCTTCAC 62 CCTGCTCTAGATATCCTCTTTATCATCAG ACCACCATCCACACGGCGGC GCCAAGGCGACCAGACAA 79 61 GCGCGTGTACCACATCCA CCCCAGCCTCCCGATCACGGTTTAC CCGACGGTGCGTTTAGGA 62 ACTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 80 61 GCCTCCCGATCACGGTTTA CGCAGCGTGCTCCTAAACGCACC CCCCGCGGACAATCTG 62 ACTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 81 61 GCCTCCCGATCACGGTTTA CCTGCCGCAGCGTGCTCCTAA CCCCGCGGACAATCTG 62 CCCCCGCAACCACTACTC CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT 82 61 CCTCCCGATCACGGTTTAC CGCAGCGTGCTCCTAAACGCACC CCCCGCGGACAATCTG 62 ACTACTCCCCCCGACGAGAT CCACACAAGCCGCAACGGTCG GGAGGCGACTGCCGTTT The following combinations are used for testing multiplexed sets for HSV typing. Non-typing set A Target = glycoprotein B gene Forward Primer GCCACGGTGGTGCAGTT (SEQ ID NO: 4) Probe CCGCGATGCCCTCCGTGTAGTTC (SEQ ID NO: 69) Reverse Primer TTGTACGGGGCGATGTTC (SEQ ID NO: 10) Non-typing set B Target = glycoprotein B gene Forward Primer TCAAGGCCACCATGTACTACAAA (SEQ ID NO: 20) Probe CAGGTGTGGTTCGGCCACCGCTAC (SEQ ID NO: 21) Reverse Primer CTTGTCGATCACCTCCTCGAA (SEQ ID NO: 52) Typing set A HSV-1 target = glycoprotein D Forward Primer CGAGGAGGAGGGGTATAACAAA (SEQ ID NO: 70) Probe AAGCTTCAGCGCGAACGACCAACTA (SEQ ID NO: 71) Reverse Primer ATCACGGCCCCCAACCT (SEQ ID NO: 72) HSV-2 target = glycoprotein G gene Forward Primer AGACGCCCCTCCCTGTGT (SEQ ID NO: 73) Probe TCAGTCGACCCAAGCGCGGAAC (SEQ ID NO: 74) Reverse Primer CTCGTCGGGGGGAGTAGTG (SEQ ID NO: 75) Typing set B HSV-1 target = glycoprotein D gene Forward Primer TCCGAAGACGTCCGGAAA (SEQ ID NO: 76) Probe CCTCCCATCCGAAACCAAGCGATG (SEQ ID NO: 77) Reverse Primer CGTGATGGGGATAGCACAGTT (SEQ ID NO: 78) HSV-2 target = glycoprotein G gene Forward Primer CGTCAGCCCATCCTCCTT (SEQ ID NO: 79) Probe CCGTCCCCAAAGACGTGCGG (SEQ ID NO: 80) Reverse Primer CAGCAGGGAAGCATTTACGA (SEQ ID NO: 81) Typing set C HSV-1 target = glycoprotein D gene Forward Primer CCGGAAACAACCCTACAACCT (SEQ ID NO: 82) Probe CCTCCCATCCGAAACCAAGCGATG (SEQ ID NO: 77) Reverse Primer CGTGATGGGGATAGCACAGTT (SEQ ID NO: 78) HSV-2 target = glycoprotein G gene Forward Primer CGTCAGCCCATCCTCCTT (SEQ ID NO: 79) Probe CCGTCCCCAAAGACGTGCGG (SEQ ID NO: 80) Reverse Primer CAGCAGGGAAGCATTTACGA (SEQ ID NO: 81) Typing set D HSV-1 target = glycoprotein G gene Forward Primer GTGCCGTTGTTCCCATTATC (SEQ ID NO: 83) Probe CCATTCCTTTTGGTTCTTGTCGGTGTATCG (SEQ ID NO: 84) Reverse Primer GGGTGGTGGAGGAGACGTT (SEQ ID NO: 85) HSV-2 target = glycoprotein G gene Forward Primer CGTCAGCCCATCCTCCTT (SEQ ID NO: 79) Probe CCGTCCCCAAAGACGTGCGG (SEQ ID NO: 80) Reverse Primer CAGCAGGGAAGCATTTACGA (SEQ ID NO: 81) Typing set E HSV-1 target = glycoprotein G gene Forward Primer GTGCCGTTGTTCCCATTATC (SEQ ID NO: 83) Probe CCATTCCTTTTGGTTCTTGTCGGTGTATCG (SEQ ID NO: 84) Reverse Primer GGGTGGTGGAGGAGACGTT (SEQ ID NO: 85) HSV-2 target = glycoprotein G gene Forward Primer CGTCAGCCCATCCTCCTT (SEQ ID NO: 79) Probe CGACCCGGTACGCTCTCGTAAATGCTTC (SEQ ID NO: 86) Reverse Primer CGCCGAGTTCGATCTGGTA (SEQ ID NO: 87) Typing set F HSV-1 target = glycoprotein D gene Forward Primer CCGGAAACAACCCTACAACCT (SEQ ID NO: 82) Probe CCTCCCATCCGAAACCAAGCGATG (SEQ ID NO: 77) Reverse Primer CGTGATGGGGATAGCACAGTT (SEQ ID NO: 78) HSV-2 target = glycoprotein G gene Forward Primer AGACGCCCCTCCCTGTGT (SEQ ID NO: 73) Probe TCAGTCGACCCAAGCGCGGAAC (SEQ ID NO: 74) Reverse Primer CTCGTCGGGGGGAGTAGTG (SEQ ID NO: 75) Other Embodiments Other embodiments will be evident to those of skill in the art. It should be understood that the foregoing detailed description is provided for clarity only and is merely exemplary. The spirit and scope of the present invention are not limited to the above examples, but are encompassed by the following claims. 1. An isolated polynucleotide, comprising a nucleotide sequence that comprises any one of SEQ ID NOs: 1-87. 2. An isolated polynucleotide, comprising any of the nucleotide sequences depicted in Table 3 or any of the nucleotide sequences depicted in Table 4. 3. A primer pair for amplifying herpes simplex virus DNA, comprising a forward and reverse primer selected from the group consisting of the sequences listed in groups 1-54 of Table 3. 4. A primer pair for amplifying herpes simplex virus DNA, comprising the forward and reverse primer pairs depicted in Table 4. 5. A primer pair for amplifying herpes simplex virus DNA selected from the group consisting of (1) SEQ ID NOs: 4 and 10; (2) SEQ ID NOs: 20 and 52; (3) SEQ ID NOs: 70 and 72; (4) SEQ ID NOs: 73 and 75; (5) SEQ ID NOs: 76 and 78; (6) SEQ ID NOs: 79 and 81; (7) SEQ ID NOs: 82 and 78; (8) SEQ ID NOs: 79 and 81; (9) SEQ ID NOs: 83 and 85; and (10) SEQ ID NOs: 79 and 87. 6. A polynucleotide probe that binds to a PCR product created by the primer pair of claim 5, wherein (1) the probe comprising the sequence of SEQ ID NO: 69 hybridizes to the PCR product amplified by SEQ ID NOs: 4 and 10; (2) the probe comprising the sequence of SEQ ID NO: 21 hybridizes to the PCR product amplified by SEQ ID NOs: 20 and 52; (3) the probe comprising the sequence of SEQ ID NO: 71 hybridizes to the PCR product amplified by SEQ ID NOs: 70 and 72; (4) the probe comprising the sequence of SEQ ID NO: 74 hybridizes to the PCR product amplified by SEQ ID NOs: 73 and 75; (5) the probe comprising the sequence of SEQ ID NO: 77 hybridizes to the PCR product amplified by (i) SEQ ID NOs: 76 and 78, and (ii) SEQ ID NOs: 82 and 78; (6) the probe comprising the sequence of SEQ ID NO: 80 hybridizes to the PCR product amplified by SEQ ID NOs: 79 and 81; (7) the probe comprising the sequence of SEQ ID NO: 84 hybridizes to the PCR product amplified by SEQ ID NOs: 83 and 85; (8) the probe comprising the sequence of SEQ ID NO: 84 hybridizes to the PCR product amplified by SEQ ID NOs: 83 and 85; and (9) the probe comprising the sequence of SEQ ID NO: 86 hybridizes to the PCR product amplified by SEQ ID NOs: 79 and 87. 7. The polynucleotide probe of claim 6, wherein the probe is labeled. 8. The polynucleotide probe of claim 7, wherein the probe comprises a fluorescent label, a chemiluminescent label, a radioactive label, biotin, or gold. 9. A method for detecting an HSV virus in a sample, comprising (1) adding together at least once group of forward and reverse primers depicted in Tables 3 or 4 to a sample, (2) conducting a polymerase chain reaction on the sample, and (3) detecting the generation of a PCR product, wherein the generation of an amplified PCR product indicates the presence of an HSV variant in the sample. 10. The method of claim 9, wherein the forward and reverse primers comprise at least one sequence from the group consisting of: (1) SEQ ID NOs: 4 and 10; (2) SEQ ID NOs: 20 and 52; (3) SEQ ID NOs: 70 and 72; (4) SEQ ID NOs: 73 and 75; (5) SEQ ID NOs: 76 and 78; (6) SEQ ID NOs: 79 and 81; (7) SEQ ID NOs: 82 and 78; (8) SEQ ID NOs: 79 and 81; (9) SEQ ID NOs: 83 and 85; and (10) SEQ ID NOs: 79 and 87, respectively. 11. The method of claim 10, further comprising the steps of (1) adding a labeled probe to the sample, wherein the probe comprises the sequence that corresponds to the forward and reverse primer pair group depicted in Tables 3 or 4, and (2) detecting the binding of the probe to an amplified PCR product after exposing the PCR product and probe(s) to conditions that promote hybridization. 12. The method of claim 10, wherein the sequence of the probe or probes is selected from the group consisting of SEQ ID NOs: 21, 69, 71, 74, 77, 80, 84, and 86. 13. The method of claim 9, wherein the probe is fluorescently labeled and the step of detecting the binding of the probe to the amplified PCR product entails measuring the fluorescence of the sample. 14. The method of claim 9, wherein the sample is blood, serum, plasma, sputum, urine, stool, skin, cerebrospinal fluid, saliva, gastric secretions, tears, oropharyngeal swabs, nasopharyngeal swabs, throat swabs, nasal aspirates, nasal wash, and fluids collected from the ear, eye, mouth, respiratory airways, spinal tissue or fluid, cerebral fluid, trigeminal ganglion sample or a sacral ganglion sample.

2009-01-07

en

2011-01-20

US-201715680520-A

Electric pencil sharpener ABSTRACT An electric pencil sharpener includes a power device. The power device is connected to two rotatable rubber wheels by a transmission mechanism. The two rubber wheels are located on two sides of the pencil to be sharpened, are rotated in opposite directions and closely fit a side wall of the pencil to be sharpened, to push upwards or downwards the pencil to be sharpened to move. A gap between the two rubber wheels is adjustable. The electric pencil sharpener further includes a rotatable cutter carrier assembly located below the rubber wheels configured to sharpen the pencil to be sharpened. The electric pencil sharpener can sharpen the pencil of different diameters, and has a sharpening process requiring no human participation, has a wide application and saves manual operation. CROSS REFERENCE OF RELATED APPLICATION The present application claims the priority to Chinese Patent Application No. 201710312006.6, titled “ELECTRIC PENCIL SHARPENER”, filed on May 5, 2017 with the State Intellectual Property Office of the People's Republic of China, the content of which application is incorporated herein by reference in its entirety. FIELD This application relates to the technical field of sharpeners, and particularly to an electric pencil sharpener. BACKGROUND A pencil sharpener, also referred to as a sharpener, generally includes a main body, a pencil clamping mechanism, a pencil sharpening mechanism and a scrap box. A groove accommodating a pencil cutter is generally provided at the bottom of the scrap box, and the pencil cutter is inserted in the groove to be positioned. The user can choose a main pencil cutter of the sharpener to sharpen a pencil, or take out the scrap box and use the pencil cutter in the scrap box to sharpen the pencil. If the main pencil cutter of the sharpener is a planar cutter, after becoming blunt, the main pencil cutter of the sharpener can be replaced with the pencil cutter taken out of the scrap box, thus forming a sharpener with a sharp sharpening edge. However, the sharpener can only sharpen the pencils with a constant outer diameter. Therefore, a technical issue to be addressed presently by those skilled in the art is to provide an electric pencil sharpener which can address the issue that only pencils with a constant outer diameter can be sharpened. SUMMARY It is an object of the present application to provide an electric pencil sharpener which can address the issue that only pencils with a constant outer diameter can be sharpened. In order to achieve the above object, an electric pencil sharpener is provided according to the present application, which includes a power device. The power device is connected to two rotatable rubber wheels via a transmission mechanism, the two rubber wheels are located on two sides of a pencil to be sharpened, are rotated in opposite directions and closely fit a side wall of the pencil to be sharpened, to push upwards or downwards the pencil to be sharpened to move, a gap between the two rubber wheels is adjustable, the electric pencil sharpener further includes a rotatable cutter carrier assembly which is located below the rubber wheels and configured to sharpen the pencil to be sharpened. Preferably, the transmission mechanism includes: a cutter carrier gear connected to the power device and located below the rubber wheels, a rotation axis of the cutter carrier gear is perpendicular to a rotation axis of each of the rubber wheels; an end face gear engaged with the cutter carrier gear, a rotation axis of the end face gear is in parallel with the rotation axis of each of the rubber wheels; a transition gear located at an outer side of the end face gear and engaged with the end face gear, a rotation axis of the transition gear is in parallel with the rotation axis of the end face gear and is located below the rotation axis of the end face gear; and a pencil introducing gear located at an upper side of the transition gear and engaged with the transition gear, a pencil introducing gear shaft of the pencil introducing gear is moved coaxially with a rubber wheel shaft sleeve of the rubber wheel, and the pencil introducing gear shafts are both arranged onto a pencil introducing mechanism holder having a fixed relative position, two sides of the pencil introducing mechanism holder have respectively arc-shaped retaining grooves configured to restrict movement loci of the pencil introducing gear shafts; the arcs of the two arc-shaped retaining grooves are coincident with the movement loci of the pencil introducing gears with respect to the transition gear respectively, to adjust the gap between the two rubber wheels. Preferably, the pencil introducing mechanism holder is provided with racks drivingly connected to the two pencil introducing gear shafts respectively, the two racks are each engaged with a return gear hinged to the pencil introducing mechanism holder, and the two racks are located at an upper side and a lower side of the return gear respectively, to allow the two rubber wheels to synchronously clamp or release the pencil to be sharpened. Preferably, both of the racks are each also connected to a rack restoring spring, to allow the gap between the two rubber wheels to be restored to an initial state when the pencil to be sharpened is withdrawn from the gap between the two rubber wheels, and also to provide a clamping force of the two rubber wheels with respect to the pencil. Preferably, the cutter carrier assembly has a preset angle with respect to the pencil to be sharpened, and the cutter carrier assembly is connected to the power device to achieve rotary sharpening of the cutter carrier assembly. Preferably, the electric pencil sharpener further includes an internal gear configured to support the cutter carrier assembly and drive the cutter carrier assembly to rotate, and the internal gear is located at an outer side of the cutter carrier assembly and is connected to the power device. Preferably, the electric pencil sharpener includes a MCU, a first switch, a second switch, a first driving circuit, and a second driving circuit, the first switch is arranged below the pencil to be sharpened, and a tip touch block is provided between the first switch and a tip of the pencil to be sharpened, when the pencil to be sharpened is transferred to the cutter carrier assembly by the rubber wheels and is sharpened by the cutter carrier assembly, the tip touches the tip touch block, and the first switch is turned on by a transmission rod; the second switch is located at an entrance position of the pencil to be sharpened, and when the pencil to be sharpened is inserted between the two rubber wheels, a pencil introducing switch pressing block located at a movement locus of the pencil to be sharpened is pressed to an outer side of the pencil to be sharpened to turn on the second switch; the first switch and the second switch are respectively connected to two input pins of the MCU; a first terminal of the first driving circuit and a first terminal of the second driving circuit are respectively connected to two output pins of the MCU, and a second terminal of the first driving circuit is connected to a first end of the power device, a second terminal of the second driving circuit is connected to a second end of the power device, the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit; a first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit; and when the first switch and the second switch are both turned off, the power device does not work; when the first switch is turned off and the second switch is turned on, the power device rotates toward a direction of transferring the pencil to be sharpened to the cutter carrier assembly; and when the first switch and the second switch are both turned on, the power device rotates toward a direction of moving the pencil to be sharpened away from the cutter carrier assembly. Preferably, the first driving circuit includes a first NPN-type triode, a first PMOS transistor and a first NMOS transistor; a base of the first NPN-type triode is connected to the MCU, an emitter of the first NPN-type triode is connected to the first ground electrode, and a collector of the first NPN-type triode is connected to the first voltage electrode; a gate electrode of the first PMOS transistor and a gate electrode of the first NMOS transistor are each connected between the collector of the first NPN-type triode and the first voltage electrode; a source electrode of the first PMOS transistor and a drain electrode of the first NMOS transistor are each connected to the first end of the power device; the second driving circuit includes a second NPN-type triode, a second PMOS transistor, and a second NMOS transistor; a base of the second NPN-type triode is connected to the MCU, an emitter of the second NPN-type triode is connected to the second ground electrode, and a collector of the second NPN-type triode is connected to the second voltage electrode; a gate electrode of the second PMOS transistor and a gate electrode of the second NMOS transistor are each connected between the collector of the second NPN-type triode and the second voltage electrode; a source electrode of the second PMOS transistor and a drain electrode of the second NMOS transistor are each connected to the second end of the power device; and the source electrode of the first PMOS transistor is connected to the source electrode of the second PMOS transistor and is grounded; the source electrode of the first PMOS transistor is connected to the source electrode of the second PMOS transistor; the drain electrode of the first PMOS transistor is connected to the drain electrode of the second PMOS transistor and is connected to the first ground electrode. Preferably, the first switch and the second switch are connected in parallel, and then are connected to a grounding output pin of the MCU and are then grounded. Preferably, the MCU, the first driving circuit and the second driving circuit are integrated on a printed circuit board, and the printed circuit board is located below the first switch. Compared with the above background technology, the electrical sharpener according to the present application realizes the rotation of the two rubber wheels by using the power device; the two rubber wheels are located respectively on two sides of the pencil to be sharpened, and the rotation directions of the two rubber wheels are opposite; the pencil to be sharpened between the two rubber wheels can be moved upwards or downwards with the rotation of the two rubber wheels; the cutter carrier assembly is provided below the rubber wheels to sharpen the pencil to be sharpened. The specific working process is as follows: in an initial state, a gap between the two rubber wheels is small, and when the pencil to be sharpened is inserted between the two rubber wheels, the gap between the two rubber wheels is gradually increased; and the two rubber wheels rotate in the opposite directions and are rotating toward an inner side, that is, toward the side of the pencil to be sharpened, to enable the pencil to be sharpened to move downwards, when the pencil to be sharpened is in the working area of the cutter carrier assembly, the sharpening work may just be performed; after the sharpening finishes, the two rubber wheels respectively rotate toward an outer side of the pencil to achieve the upward moving of the pencil, to further bring the pencil away from the working area of the cutter carrier assembly. When the pencil exits from the gap between the two rubber wheels, the gap between the two rubber wheels is restored to an original state. Arranged as such, the electric pencil sharpener can sharpen the pencils of different diameters, and has a sharpening process requiring no human participation, has a wide application, and saves manual operation. BRIEF DESCRIPTION OF THE DRAWINGS For more clearly illustrating embodiments of the present application or the technical solutions in the conventional technology, drawings referred to describe the embodiments or the conventional technology will be briefly described hereinafter. Apparently, the drawings in the following description are only some examples of the present application, and for those skilled in the art, other drawings may be obtained based on the provided drawings without any creative effort. FIG. 1 is a schematic view showing the structure of an electric pencil sharpener according to an embodiment of the present application; FIG. 2 is a side view of FIG. 1; FIG. 3 is a schematic view of FIG. 2 with a rack clamping plate and rack restoring springs being hidden; FIG. 4 is a schematic view of FIG. 2 with racks, the rack clamping plate and the rack restoring springs being hidden; FIG. 5 is a schematic view of the electric pencil sharpener according to the embodiment of the present application in a state of just starting to operate; FIG. 6 is a schematic view of the electric pencil sharpener according to the embodiment of the present application when a pencil is sharpened; FIG. 7 is a diagram showing the movement principle of a pencil introducing gear in FIG. 1; and FIG. 8 is a schematic circuit diagram of the electric pencil sharpener according to the embodiment of the present application. DETAILED DESCRIPTION The technical solutions in the embodiments of the present application will be described clearly and completely hereinafter in conjunction with the drawings in the embodiments of the present application. Apparently, the described embodiments are only a part of the embodiments of the present application, rather than all embodiments. Based on the embodiments in the present application, all of other embodiments, obtained by those skilled in the art without any creative efforts, fall into the scope of the present application. For making those skilled in the art to better understand the technical solutions of the present application, the present application is further described in detail hereinafter with reference to the drawings and specific embodiments thereof. Reference is made to FIGS. 1 to 8, FIG. 1 is a schematic view showing the structure of an electric pencil sharpener according to an embodiment of the present application; FIG. 2 is a side view of FIG. 1; FIG. 3 is a schematic view of FIG. 2 with a rack clamping plate and rack restoring springs being hidden; FIG. 4 is a schematic view of FIG. 2 with racks, the rack clamping plate and the rack restoring springs being hidden; FIG. 5 is a schematic view of the electric pencil sharpener according to the embodiment of the present application in a state of just starting to operate; FIG. 6 is a schematic view of the electric pencil sharpener according to the embodiment of the present application when a pencil is sharpened; FIG. 7 is a diagram showing the movement principle of a pencil introducing gear in FIG. 1; and FIG. 8 is a schematic circuit diagram of the electric pencil sharpener according to the embodiment of the present application. An electric pencil sharpener according to the present application includes a sharpener body. A power device 4 is provided inside the sharpener body, and the power device 4 may be a power element such as a motor. The power device 4 is connected to two rubber wheels 25 by a transmission mechanism. The rubber wheels 25 are rotatable relative to the sharpener body, and the two rubber wheels 25 rotate in opposite directions. There is a certain preset gap between the two rubber wheels 25. When the pencil to be sharpened is inserted between the two rubber wheels 25, a side wall of the pencil to be sharpened can push the two rubber wheels 25 to move outwards to increase the gap between the two rubber wheels 25. That is, the two rubber wheels 25 are hinged to the sharpener body and hinge shafts of the rubber wheels 25 are slidable relative to the sharpener body to adjust the gap between the two rubber wheels 25. The rotational directions of the two rubber wheels 25 are opposite under the action of the transmission mechanism. When the pencil to be sharpened is inserted into the gap between the two rubber wheels 25, and the pencil to be sharpened closely fits the two rubber wheels 25, the pencil to be sharpened can be moved upwards or downwards under the act of the rotation of the two rubber wheels 25. Taking FIG. 5 of the specification as an example, the rubber wheel 25 on a left side of the pencil 9 moves in a clockwise direction, the rubber wheel 25 on a right side of the pencil 9 moves in a counterclockwise direction, and the pencil 9 closely fits the two rubber wheels 25, thus the pencil 9 is moved downwards. And if the rubber wheel 25 on the left side of the pencil 9 moves in the counterclockwise direction, and the rubber wheel 25 on the right side of the pencil 9 moves in the clockwise direction, the pencil 9 is moved upwards. A cutter carrier assembly 5 located inside the sharpener body is arranged below the rubber wheels 25, as shown in FIG. 1 of the specification. When the pencil 9 is moved downwards to a working area of the cutter carrier assembly 5, the pencil 9 is sharpened. After sharpening of the pencil 9 finishes, the pencil 9 is driven by the two rubber wheels 25 to move upwards and is brought away from the working area of the cutter carrier assembly 5. The cutter carrier assembly 5 should rotate during sharpening so as to sharpen the pencil 9. The cutter carrier assembly 5 may be rotated by the power source of the power device 4. In view of the above embodiment in which the two rubber wheels 25 are rotated in the opposite directions by the power device 4 and the two rubber wheels 25 slide outwards with respect to the sharpener body, the following embodiments are provided according to the present application. Of course, for those skilled in the art, other different arrangements should fall into the scope of the present application. The transmission mechanism mainly includes a cutter carrier gear 51, an end face gear 21, a transition gear 22, a pencil introducing gear 23, a pencil introducing gear shaft 24 and a rubber wheel shaft sleeve 26, as shown in FIGS. 1, 5 and 6. The cutter carrier gear 51 is located below the rubber wheels 25, and the rotation axis of the cutter carrier gear 51 is perpendicular to the rotation axis of the rubber wheel 25, that is, the rotation axis of the rubber wheel 25 is horizontal and the rotation axis of the cutter carrier gear 51 is perpendicular to the ground. The cutter carrier gear 51 is connected to the power device 4, an output shaft of the power device 4 is arranged to be perpendicular to the ground, and the power device 4 is located on a side below the cutter carrier assembly 5, thus the cutter carrier gear 51 is revolved about the rotation axis perpendicular to the ground. The end face gear 21 is engaged with the cutter carrier gear 51 to achieve a transmission connection, the rotation axis of the end face gear 21 is perpendicular to the rotation axis of the cutter carrier gear 51, to convert a rotation in a direction perpendicular to the ground into a horizontal rotation, that is, the rotation axis of the end face gear 21 is in parallel with the rotation axis of the rubber wheel 25. The transition gear 22 is located on an outer side of the end face gear 21, and the end face gear 21 has teeth on its outer side, which are not shown in the drawings. The rotating shaft of the transition gear 22 is driven by the teeth of the end face gear 21 to rotate, and the rotation axis of the transition gear 22 is in parallel with the rotation axis of the end face gear 21, and the rotation axis of the transition gear 22 is located below the rotation axis of the end face gear 21. The pencil introducing gear 23 is arranged at an upper side of the end face gear 21 and is drivingly connected to the transition gear 22 and engaged with the transition gear 22. The pencil introducing gear shaft 24 of the pencil introducing gear 23 is coaxially moved with the rubber wheel shaft sleeve 26 of the rubber wheel 25. That is, the pencil introducing gear shaft 24 and the rubber wheel shaft sleeve 26 are located in the same horizontal line and the pencil introducing gear shaft 24 is located at an inner side of the rubber wheel shaft sleeve 26, and the rubber wheel shaft sleeve 26 is sleeved on the pencil introducing gear shaft 24 to achieve synchronous rotation of the both. The pencil introducing gear 23 is synchronously rotated with the pencil introducing gear shaft 24, and the rubber wheel 25 is synchronously rotated with the rubber wheel shaft sleeve 26 to further ensure that the pencil introducing gear 23, the pencil introducing gear shaft 24, the rubber wheel 25, and the rubber wheel shaft sleeve 26 are rotated synchronously. Each of the rubber wheels 25 is provided with one pencil introducing gear shaft 24 and one rubber wheel shaft sleeve 26, and each of the pencil introducing gear shafts 24 is provided with one pencil introducing gear 23. So there are two rubber wheels 25, two pencil introducing gears 23, two pencil introducing gear shafts 24 and two rubber wheel shaft sleeves 26 in the present application. The sharpener body described above includes a pencil introducing mechanism holder 20 which is located on an upper position of the sharpener body, and the sharpener body and the pencil introducing mechanism holder 20 are relatively fixed in position. The pencil introducing gear shaft 24 is arranged on the pencil introducing mechanism holder 20 and is rotatable relative to the pencil introducing mechanism holder 20. The pencil introducing mechanism holder 20 has arc-shaped retaining grooves on both sides, the pencil introducing gear shaft 24 is slidably located in the arc-shaped retaining grooves to adjust the gap between the two pencil introducing gear shafts 24, i.e., the gap between the two pencil introducing gears 23 and between the two rubber wheels 25, as shown in FIG. 4. The arc of each of the two arc-shaped retaining grooves is coincident with a movement locus of the respective pencil introducing gear 23 with respect to the respective transition gear 22, to adjust the gap between the two rubber wheels 25. That is, the center position of the pencil introducing gear 23 is arranged on a circular arc with a radius equal to the result of dividing the sum of reference diameters of the transition gear 22 and the pencil introducing gear 23 by 2, as shown in FIG. 7. The pencil introducing mechanism holder 20 is provided with an arc-shaped retaining groove for movement of the pencil introducing gear shaft 24, as shown in FIG. 4. The spatial shape of the arc-shaped retaining groove is arranged along the movement locus of the pencil introducing gear 23, as shown in FIG. 7, to ensure that the pencil introducing gear 23 can be always normally engaged with the transition gear 22 while moving along the locus. The principle of the engagement of the pencil introducing gear 23 and the transition gear 22 is as shown in FIG. 7. When a pencil 9 with a different diameter is inserted, the pencil 9 may push the pencil introducing gear 23 to move in the direction of the movement locus, and the pencil introducing gear 23 then pushes the rubber wheel 25 to move in the same movement locus by the rubber wheel shaft sleeve 26 and the pencil introducing gear shaft 24 which is fixedly connect to the pencil introducing gear 23, so as to achieve the purpose of adjusting the distance between the two rubber wheels 25 (i.e., the diameter of the pencil 9). In FIG. 7 of the specification, d1 is a reference circle diameter of the transition gear 22, and d2 is a reference circle diameter of the pencil introducing gear 23. The movement radius R of the pencil introducing gear 23 satisfies relationship: R=(d1+d2)/2. The distance L2 between the pencil introducing gear 23 and the transition gear 22 satisfies relationship: L2=R, and the distance between the two rubber wheels 25 (i.e., the diameter of the pencil 9) is L1. In the present application, in order to ensure the symmetry of the movements of the two rubber wheels and thus ensure that the pencil can always move along the axis of the cutter carrier assembly without being eccentric during sharpening, the pencil introducing mechanism holder 20 is provided with a rack 27 and a return gear 28. Each of the pencil introducing gear shafts 24 is connected to one rack 27, and two racks 27 are located on an upper side and a lower side of the return gear 28 respectively, so that the two racks 27 are both engaged with the return gear 28, and the return gear 28 is hinged to the pencil introducing mechanism holder 20. That is, a lateral side of the pencil introducing mechanism holder 20 is provided with one return gear 28 and two racks 27 which are symmetrically distributed with respect to the axis of the return gear 28, as shown in FIGS. 2 to 4. The rack 27 is connected to the pencil introducing gear shaft 24 to drive the rubber wheel 25 to move. Its working principle is as follows: two racks 27 are arranged symmetrically with respect to the axis of the return gear 28 and are in engaged with the return gear 28; thus when one rack 27 moves, the other rack 27 may be moved in an opposite direction at the same time by the rotation of the return gear 28, thus may ensure that the two rubber wheels 25 are simultaneously in a state of clamping or releasing the pencil, and the opposite positions of the two rubber wheels 25 are always in symmetrical positions with respect to the rotation axis of the cutter carrier assembly 5, thereby ensuring that the pencil 9 always moves along the rotation axis of the cutter carrier assembly 5 and may not be eccentrically sharpened. In addition, both of the racks 27 are also connected to rack restoring springs 29 respectively, as shown in FIG. 2 of the specification, thus allowing the gap between the two rubber wheels 25 to be restored to an initial state when the pencil is withdrawn from the gap between the two rubber wheels 25, and to provide a clamping force of the two rubber wheels with respect to the pencil. That is, a rack clamping plate 270 and rack restoring springs 29 are further designed on the surfaces of the racks 27 and the return gear 28. Two ends of the rack restoring spring 29 are connected to the two racks 27 respectively to ensure that the two racks 27 always move towards each other, and when pencils 9 of different diameters are placed between the rubber wheels 25, the two rubber wheels 25 may always apply a certain pressure and frictional force to the pencils 9. The rack clamping plate 270 can ensure the smoothness of movement of the two racks 27. In the present application, the cutter carrier assembly 5 has a preset angle with respect to the pencil 9 to be sharpened, and the cutter carrier assembly 5 is connected to the power device 4 to realize a rotary sharpening of the cutter carrier assembly 5, as shown in FIGS. 5 and 6. An internal gear 50 is connected to the power device 4 so as to rotate about a vertical axis, and the internal gear 50 supports the cutter carrier assembly 5. While rotating, the internal gear 50 may drive the cutter carrier assembly 5 to revolve about the pencil 9 to complete the sharpening. The internal gear 50 is located at an outer side of the cutter carrier assembly 5 and is connected to the power device 4, as shown in FIGS. 1, 5 and 6 of the specification. In the present application, in order to realize the rotation of the power device 4, an MCU, a first switch 100, a second switch 200, a first driving circuit and a second driving circuit are further provided, as shown in FIG. 8 of the specification. The first switch 100 is arranged below the pencil 9 to be sharpened, and a tip touch block 6 is provided between the first switch 100 and the tip of the pencil 9 to be sharpened. When the pencil 9 to be sharpened is transferred to the cutter carrier assembly 5 by the rubber wheels 25 and is sharpened by the cutter carrier assembly 5, the tip touches the tip touch block 6, to drive the tip touch block 6 to move to turn on the first switch 100 by a transmission rod 7. The second switch 200 is located at an entrance position of the pencil 9 to be sharpened, and when the pencil 9 to be sharpened is inserted between the two rubber wheels 25, a pencil introducing switch pressing block 2 on the movement locus of the pencil 9 to be sharpened is pressed to an outer side of the pencil to be sharpened, to turn on the second switch 200. The first switch 100 and the second switch 200 are respectively connected to two input pins of the MCU. A first terminal of the first driving circuit and a first terminal of the second driving circuit are respectively connected to two output pins of the MCU; and a second terminal of the first driving circuit is connected to a first end of the power device 4, a second terminal of the second driving circuit is connected to a second end of the power device 4, and the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit. A first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit. When the first switch and the second switch are both turned off, the power device 4 does not work. When the first switch is turned off and the second switch is turned on, the power device 4 rotates toward the direction of transferring the pencil to be sharpened to the cutter carrier assembly 5; and when the first switch is turned on and the second switch is turned on, the power device 4 rotates toward the direction of moving the pencil to be sharpened away from the cutter carrier assembly 5. Specifically, the power device 4 is just the component M in FIG. 8 of the specification. The power device 4 rotating toward the direction of transferring the pencil to be sharpened to the cutter carrier assembly 5 refers to that, taking the case in FIG. 5 as an example, the rubber wheel 25 on the left side of the pencil 9 is moved in the clockwise direction and the rubber wheel 25 on the right side of the pencil 9 is moved in the counterclockwise direction, to achieve the downward moving of the pencil 9. The power device 4 rotating toward the direction of moving the pencil to be sharpened away from the cutter carrier assembly 5 refers to that, taking the case in FIG. 5 as an example, the rubber wheel 25 on the left side of the pencil 9 moves in the counterclockwise direction and the rubber wheel 25 on the right side of the pencil 9 moves in the clockwise direction, thus the pencil 9 moves upwards. More specifically in the present application, the first driving circuit comprises a first NPN-type triode Q3, a first PMOS transistor Q1A and a first NMOS transistor Q1B. The reference numerals of the respective electronic elements are the same as those of FIG. 8, which are not described hereinafter. A base of the first NPN-type triode Q3 is connected to the MCU and a resistor R9 may be connected in series therebetween. An emitter of the first NPN-type triode Q3 is connected to the first ground electrode, and a collector of the first NPN-type triode Q3 is connected to the first voltage electrode VCC; the first voltage electrode VCC is at an upper right position in FIG. 8, and the resistor R10 may further be connected in series between the collector of the first NPN-type triode Q3 and the first voltage electrode VCC. A gate electrode of the first PMOS transistor Q1A and a gate electrode of the first NMOS transistor Q1B are each connected between the collector of the first NPN-type triode Q3 and the first voltage electrode VCC. A source electrode of the first PMOS transistor Q1A and a drain electrode of the first NMOS transistor Q1B are connected to the first end of the motor M. The second driving circuit includes a second NPN-type triode Q4, a second PMOS transistor Q2A, and a second NMOS transistor Q2B. A base of the second NPN-type triode Q4 is connected to the MCU, and a resistor R11 may be connected in series therebetween, an emitter of the second NPN-type triode Q4 is connected to the second ground electrode, a collector of the second NPN-type triode Q4 is connected to a second voltage electrode VCC, and a resistor R12 may be connected in series between the collector of the second NPN-type triode Q4 and the second voltage electrode VCC. A gate electrode of the second PMOS transistor Q2A and a gate electrode of the second NMOS transistor Q2B are connected between the collector of the second NPN-type triode Q4 and the second voltage electrode VCC. A source electrode of the second PMOS transistor Q2A and a drain electrode of the second NMOS transistor Q2B are connected to the second end of the motor M. The source electrode of the first NMOS transistor Q1B is connected to the source electrode of the second NMOS transistor and is grounded; the source electrode of the first PMOS transistor Q1A is connected to the source electrode of the second PMOS transistor; the drain electrode of the first PMOS transistor Q1A is connected to the drain electrode of the second PMOS transistor and is connected to the first ground electrode. The first switch 100 (i.e., SW1 in FIG. 8 of the specification) and the second switch 200 (i.e., SW2 in FIG. 8 of the specification) are connected in parallel, and are then connected to a grounding output pin (i.e., an eighth pin) of the MCU and are then grounded. The specific way of connection is shown in FIG. 8 of the specification. The working principle of the electric pencil sharpener of the present application is as follows. First, after an external power supply is connected into the circuit via a DC socket 400, normally, both the first switch 100 and the second switch 200 are turned off, both a fourth pin and a sixth pin of the MCU output a high level, and two ends of the motor M (i.e., the power device 4) are in a high level, the motor M does not rotate, the voltage between two ends of the power device 4 is zero, the power device 4 does not rotate, and the sharpener does not work. When the pencil 9 is inserted between the two rubber wheels 25, the pencil 9 may push the pencil introducing switch touch block 1 to move toward a micro switch SW2 (i.e., the second switch 200) and then push the pencil introducing switch pressing block 2 by contacting the spring 3 to turn on the micro switch SW2. After this signal is detected by the MCU, the fourth pin of the MCU outputs a low level, the sixth pin of the MCU outputs a high level, the low level and the high level are then loaded to the motor M (i.e., the power device 4), thus the power device 4 starts to rotate in a forward direction. The power device 4 rotates forwards to drive the driving mechanism, and the drive mechanism further drives the two rubber wheels 25 to rotate in the direction of transferring the pencil 9 to the cutter carrier assembly 5. When rotates, the rubber wheels 25 drive the pencil 9 to move downwards, and when the pencil 9 comes to contact with the cutter carrier assembly 5, the sharpening operation starts. When the pencil 9 continues to move downwards till a pencil lead is sharpened, the pencil lead may push the tip touch block 6 to move downwards, and the tip touch block 6 then pushes the transmission rod 7 to press the micro switch SW1 (i.e., the first switch 100), to turn on the micro switch SW1. After this signal is detected by the MCU, the fourth pin of the MCU outputs a high level, the sixth pin of the MCU outputs a low level, the high level and the low level are then loaded to the motor M (i.e., the power device 4) by the driving circuit, and the power device 4 starts to rotate reversely. A transmission tube 70 is provided on an outer side of the transmission rod 7 to restrict a movement position of the transmission rod 7. A cable 300 connected to the micro switch SW2 (i.e., the second switch 200) may be led out from the upper portion of the sharpener body. The motor rotates reversely to drive, by the driving mechanism, the rubber wheels 25 to rotate in the direction of moving the pencil 9 away from the cutter carrier assembly 5, so that the pencil 9 is moved upwards, and the micro switch SW1 (i.e., the first switch 100) is turned off. After the pencil 9 is completely withdrawn, the SW2 (i.e., the second switch 200) is turned off, the whole sharpening process is completed, and the pencil sharpener returns to the initial state. To sharpen pencils 9 of different diameters, the distance between the two symmetrically distributed rubber wheels 25 tightly pressing the surface of the pencil may be automatically adjusted with the diameter of the pencil 9, thus always ensuring that the rubber wheels 25 apply sufficient pressures and frictional forces to the pencil to perform the whole sharpening. In the present application, the MCU, the first driving circuit and the second driving circuit are integrated on a printed circuit board (PCB) 8, and the PCB board 8 is located below the first switch 100 and is located within the sharpener body, as shown in FIGS. 1, 5 and 6. With such an arrangement, the internal space of the sharpener body can be effectively used, and the PCB board 8 is located at the lowermost of the sharpener body, and the bottom of the sharpener body may further be provided with an opening to facilitate the maintenance and installation of the PCB board 8. It is to be noted that, in the present specification, relational terms such as “first” and “second” are merely used to distinguish an entity from several other entities without necessarily requiring or implying that any such actual relationship or order exists among these entities. The electric pencil sharpener according to the present application is described in detail. The principle and the embodiments of the present application are illustrated herein by specific examples. The above description of examples is only intended to help the understanding of the method and concept of the present application. It should be noted that, for those skilled in the art, a few of improvements and modifications may be made to the present application without departing from the principle of the present application, and these modifications and improvements are also deemed to fall into the scope of protection of the present application defined by the claims. 1. An electric pencil sharpener, comprising: a power device connected to two rotatable rubber wheels via a transmission mechanism; the two rubber wheels, which are located on two sides of a pencil to be sharpened, have opposite rotational directions and closely fit a side wall of the pencil to be sharpened to push the pencil upwards or downwards to be sharpened to move, a gap between the two rubber wheels being adjustable; and a rotatable cutter carrier assembly which is located below the rubber wheels and configured to sharpen the pencil to be sharpened. 2. The electric pencil sharpener according to claim 1, wherein the transmission mechanism comprises: a cutter carrier gear connected to the power device and located below the rubber wheels, a rotation axis of the cutter carrier gear being perpendicular to a rotation axis of each of the rubber wheels; an end face gear engaged with the cutter carrier gear, a rotation axis of the end face gear being in parallel with the rotation axis of each of the rubber wheels; a transition gear located at an outer side of the end face gear and engaged with the end face gear, a rotation axis of the transition gear being in parallel with the rotation axis of the end face gear and located below the rotation axis of the end face gear; and a pencil introducing gear located at an upper side of the transition gear and engaged with the transition gear, wherein a pencil introducing gear shaft of the pencil introducing gear is moved coaxially with a rubber wheel shaft sleeve of the rubber wheel, and the pencil introducing gear shafts are both arranged onto a pencil introducing mechanism holder having a fixed relative position, two sides of the pencil introducing mechanism holder have arc-shaped retaining grooves configured to restrict movement loci of the respective pencil introducing gear shafts, the arcs of the two arc-shaped retaining grooves are coincident with the movement loci of the pencil introducing gears with respect to the transition gear respectively to adjust the gap between the two rubber wheels. 3. The electric pencil sharpener according to claim 2, wherein the pencil introducing mechanism holder is provided with two racks connected to the pencil introducing gear shafts respectively, the two racks are each engaged with a return gear hinged to the pencil introducing mechanism holder, and the two racks are located at an upper side and a lower side of the return gear respectively to allow the two rubber wheels to synchronously clamp or release the pencil to be sharpened. 4. The electric pencil sharpener according to claim 3, wherein each of the two racks is also connected to a rack restoring spring, to allow the gap between the two rubber wheels to be restored to an initial state when the pencil to be sharpened is withdrawn from the gap between the two rubber wheels, and also to provide a clamping force of the two rubber wheels with respect to the pencil. 5. The electric pencil sharpener according to claim 4, wherein the cutter carrier assembly has a preset angle with respect to the pencil to be sharpened, and the cutter carrier assembly is connected to the power device to achieve rotary sharpening of the cutter carrier assembly. 6. The electric pencil sharpener according to claim 5, further comprising an internal gear configured to support the cutter carrier assembly and drive the cutter carrier assembly to rotate, wherein the internal gear is located at an outer side of the cutter carrier assembly and is connected to the power device. 7. The electric pencil sharpener according to claim 2, comprising a MCU, a first switch, a second switch, a first driving circuit and a second driving circuit, wherein the first switch is arranged below the pencil to be sharpened, a tip touch block is provided between the first switch and a tip of the pencil to be sharpened, and when the pencil to be sharpened is delivered to the cutter carrier assembly by the rubber wheels and is sharpened by the cutter carrier assembly, the tip touches the tip touch block, and the first switch is turn on by a transmission rod; the second switch is located at an entrance position of the pencil to be sharpened, and when the pencil to be sharpened is inserted between the two rubber wheels, a pencil introducing switch pressing block located at a movement locus of the pencil to be sharpened is pressed to an outer side of the pencil to be sharpened, to turn on the second switch; the first switch and the second switch are respectively connected to two input pins of the MCU; a first terminal of the first driving circuit and a first terminal of the second driving circuit are connected to two output pins of the MCU respectively, and a second terminal of the first driving circuit is connected to a first end of the power device, a second terminal of the second driving circuit is connected to a second end of the power device, the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit; a first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit; and when the first switch and the second switch are both turned off, the power device does not work, when the first switch is turned off and the second switch is turned on, the power device rotates toward a direction of transferring the pencil to be sharpened to the cutter carrier assembly, and when the first switch and the second switch are both turned on, the power device rotates toward a direction of moving the pencil to be sharpened away from the cutter carrier assembly. 8. The electric pencil sharpener according to claim 7, wherein the first driving circuit comprises a first NPN-type triode, a first PMOS transistor and a first NMOS transistor; a base of the first NPN-type triode is connected to the MCU, an emitter of the first NPN-type triode is connected to the first ground electrode, and a collector of the first NPN-type triode is connected to the first voltage electrode; a gate electrode of the first PMOS transistor and a gate electrode of the first NMOS transistor are each connected between the collector of the first NPN-type triode and the first voltage electrode; a source electrode of the first PMOS transistor and a drain electrode of the first NMOS transistor are each connected to the first end of the power device; and wherein the second driving circuit comprises a second NPN-type triode, a second PMOS transistor, and a second NMOS transistor; a base of the second NPN-type triode is connected to the MCU, an emitter of the second NPN-type triode is connected to the second ground electrode, and a collector of the second NPN-type triode is connected to the second voltage electrode; a gate electrode of the second PMOS transistor and a gate electrode of the second NMOS transistor are each connected between the collector of the second NPN-type triode and the second voltage electrode; a source electrode of the second PMOS transistor and a drain electrode of the second NMOS transistor are each connected to the second end of the power device; and the source electrode of the first PMOS transistor is connected to the source electrode of the second PMOS transistor and is grounded; the source electrode of the first PMOS transistor is connected to the source electrode of the second PMOS transistor, and the drain electrode of the first PMOS transistor is connected to the drain electrode of the second PMOS transistor and is connected to the first ground electrode. 9. The electric pencil sharpener according to claim 8, wherein the first switch and the second switch are connected in parallel, and then are connected to a grounding output pin of the MCU and are then grounded. 10. The electric pencil sharpener according to claim 9, wherein the MCU, the first driving circuit and the second driving circuit are integrated on a printed circuit board, and the printed circuit board is located below the first switch. 11. The electric pencil sharpener according to claim 3, comprising a MCU, a first switch, a second switch, a first driving circuit and a second driving circuit, wherein the first switch is arranged below the pencil to be sharpened, a tip touch block is provided between the first switch and a tip of the pencil to be sharpened, and when the pencil to be sharpened is delivered to the cutter carrier assembly by the rubber wheels and is sharpened by the cutter carrier assembly, the tip touches the tip touch block, and the first switch is turn on by a transmission rod; the second switch is located at an entrance position of the pencil to be sharpened, and when the pencil to be sharpened is inserted between the two rubber wheels, a pencil introducing switch pressing block located at a movement locus of the pencil to be sharpened is pressed to an outer side of the pencil to be sharpened, to turn on the second switch; the first switch and the second switch are respectively connected to two input pins of the MCU; a first terminal of the first driving circuit and a first terminal of the second driving circuit are connected to two output pins of the MCU respectively, and a second terminal of the first driving circuit is connected to a first end of the power device, a second terminal of the second driving circuit is connected to a second end of the power device, the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit; a first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit; and when the first switch and the second switch are both turned off, the power device does not work, when the first switch is turned off and the second switch is turned on, the power device rotates toward a direction of transferring the pencil to be sharpened to the cutter carrier assembly, and when the first switch and the second switch are both turned on, the power device rotates toward a direction of moving the pencil to be sharpened away from the cutter carrier assembly. 12. The electric pencil sharpener according to claim 4, comprising a MCU, a first switch, a second switch, a first driving circuit and a second driving circuit, wherein the first switch is arranged below the pencil to be sharpened, a tip touch block is provided between the first switch and a tip of the pencil to be sharpened, and when the pencil to be sharpened is delivered to the cutter carrier assembly by the rubber wheels and is sharpened by the cutter carrier assembly, the tip touches the tip touch block, and the first switch is turn on by a transmission rod; the second switch is located at an entrance position of the pencil to be sharpened, and when the pencil to be sharpened is inserted between the two rubber wheels, a pencil introducing switch pressing block located at a movement locus of the pencil to be sharpened is pressed to an outer side of the pencil to be sharpened, to turn on the second switch; the first switch and the second switch are respectively connected to two input pins of the MCU; a first terminal of the first driving circuit and a first terminal of the second driving circuit are connected to two output pins of the MCU respectively, and a second terminal of the first driving circuit is connected to a first end of the power device, a second terminal of the second driving circuit is connected to a second end of the power device, the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit; a first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit; and when the first switch and the second switch are both turned off, the power device does not work, when the first switch is turned off and the second switch is turned on, the power device rotates toward a direction of transferring the pencil to be sharpened to the cutter carrier assembly, and when the first switch and the second switch are both turned on, the power device rotates toward a direction of moving the pencil to be sharpened away from the cutter carrier assembly. 13. The electric pencil sharpener according to claim 5, comprising a MCU, a first switch, a second switch, a first driving circuit and a second driving circuit, wherein the first switch is arranged below the pencil to be sharpened, a tip touch block is provided between the first switch and a tip of the pencil to be sharpened, and when the pencil to be sharpened is delivered to the cutter carrier assembly by the rubber wheels and is sharpened by the cutter carrier assembly, the tip touches the tip touch block, and the first switch is turn on by a transmission rod; the second switch is located at an entrance position of the pencil to be sharpened, and when the pencil to be sharpened is inserted between the two rubber wheels, a pencil introducing switch pressing block located at a movement locus of the pencil to be sharpened is pressed to an outer side of the pencil to be sharpened, to turn on the second switch; the first switch and the second switch are respectively connected to two input pins of the MCU; a first terminal of the first driving circuit and a first terminal of the second driving circuit are connected to two output pins of the MCU respectively, and a second terminal of the first driving circuit is connected to a first end of the power device, a second terminal of the second driving circuit is connected to a second end of the power device, the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit; a first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit; and when the first switch and the second switch are both turned off, the power device does not work, when the first switch is turned off and the second switch is turned on, the power device rotates toward a direction of transferring the pencil to be sharpened to the cutter carrier assembly, and when the first switch and the second switch are both turned on, the power device rotates toward a direction of moving the pencil to be sharpened away from the cutter carrier assembly. 14. The electric pencil sharpener according to claim 5, comprising a MCU, a first switch, a second switch, a first driving circuit and a second driving circuit, wherein the first switch is arranged below the pencil to be sharpened, a tip touch block is provided between the first switch and a tip of the pencil to be sharpened, and when the pencil to be sharpened is delivered to the cutter carrier assembly by the rubber wheels and is sharpened by the cutter carrier assembly, the tip touches the tip touch block, and the first switch is turn on by a transmission rod; the second switch is located at an entrance position of the pencil to be sharpened, and when the pencil to be sharpened is inserted between the two rubber wheels, a pencil introducing switch pressing block located at a movement locus of the pencil to be sharpened is pressed to an outer side of the pencil to be sharpened, to turn on the second switch; the first switch and the second switch are respectively connected to two input pins of the MCU; a first terminal of the first driving circuit and a first terminal of the second driving circuit are connected to two output pins of the MCU respectively, and a second terminal of the first driving circuit is connected to a first end of the power device, a second terminal of the second driving circuit is connected to a second end of the power device, the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit; a first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit; and when the first switch and the second switch are both turned off, the power device does not work, when the first switch is turned off and the second switch is turned on, the power device rotates toward a direction of transferring the pencil to be sharpened to the cutter carrier assembly, and when the first switch and the second switch are both turned on, the power device rotates toward a direction of moving the pencil to be sharpened away from the cutter carrier assembly. 15. The electric pencil sharpener according to claim 6, comprising a MCU, a first switch, a second switch, a first driving circuit and a second driving circuit, wherein the first switch is arranged below the pencil to be sharpened, a tip touch block is provided between the first switch and a tip of the pencil to be sharpened, and when the pencil to be sharpened is delivered to the cutter carrier assembly by the rubber wheels and is sharpened by the cutter carrier assembly, the tip touches the tip touch block, and the first switch is turn on by a transmission rod; the second switch is located at an entrance position of the pencil to be sharpened, and when the pencil to be sharpened is inserted between the two rubber wheels, a pencil introducing switch pressing block located at a movement locus of the pencil to be sharpened is pressed to an outer side of the pencil to be sharpened, to turn on the second switch; the first switch and the second switch are respectively connected to two input pins of the MCU; a first terminal of the first driving circuit and a first terminal of the second driving circuit are connected to two output pins of the MCU respectively, and a second terminal of the first driving circuit is connected to a first end of the power device, a second terminal of the second driving circuit is connected to a second end of the power device, the second terminal of the first driving circuit is connected to the second terminal of the second driving circuit; a first ground electrode and a first voltage electrode are also connected between the first terminal of the first driving circuit and the second terminal of the first driving circuit, and a second ground electrode and a second voltage electrode are also connected between the first terminal of the second driving circuit and the second terminal of the second driving circuit; and when the first switch and the second switch are both turned off, the power device does not work, when the first switch is turned off and the second switch is turned on, the power device rotates toward a direction of transferring the pencil to be sharpened to the cutter carrier assembly, and when the first switch and the second switch are both turned on, the power device rotates toward a direction of moving the pencil to be sharpened away from the cutter carrier assembly.

2017-08-18

en

2018-11-08

US-201514717847-A

Design-first distributed real-time rfid tracking system ABSTRACT A radio frequency identification (RFID) tag design-first, computer-assisted drawn configuration, visualization and monitoring system for monitoring the movement of tagged assets in a given space. The system provides tag information data, and makes all calculations necessary for visually displaying the movements of tags on any imported two dimensional (2D) or three dimensional (3D) floor plan graphic file (e.g., .gif, .png, .jpg or similar formats) in real-time through web-based systems. This application claims benefit of and priority to U.S. Provisional Application No. 62/000,694, filed May 20, 2014, and U.S. Provisional No. 62/164,060, filed May 20, 2015, by Curtis Lee Shull, and is entitled to those filing dates for priority. The specifications, figures, appendices, and complete disclosures of U.S. Provisional Application Nos. 62/000,694 and 62/164,060 are incorporated herein in their entireties by specific reference for all purposes. FIELD OF INVENTION This invention relates to a system and method for real-time tracking of assets in a space or area, indoors or outdoors. More specifically, this invention relates to a system and method for computer-based design and implementation of a monitoring system for assets in real-time using radio frequency identification (RFID) tags. BACKGROUND OF THE INVENTION Governmental entities, businesses and other owners of assets (such as, but not limited to, files, books, folders, furniture, desks, electronic devices, industrial equipment, and the like) have a need to keep and maintain a proper inventory and tracking system for those assets, particularly critical assets. Tracking of movement of mobile assets helps prevent the loss of those assets, assists in the accurate inventorying of those components, and prevents delays in missions or activities where those assets are needed. Current asset tracking systems known in the art provide limited solutions, but generally are limited to tracking devices offered by specific hardware vendors, which constrain project performance and represent a risk based on changes in business models or strategic business goals that have requirements outside the specific paradigm of a particular system. Such systems also do not provide the flexibility to provide real-time tracking and display of assets being moved around dynamic real estate (indoors or outdoors). Accordingly, what is needed is an asset tracking system with flexibility in the design and definition of protected or tracked areas, and able to provide real-time graphic tracking of tracked assets. SUMMARY OF THE INVENTION In various exemplary embodiments, the present invention comprises a radio frequency identification (RFID) tag design-first, computer-assisted drawn configuration, visualization and monitoring system for monitoring the movement of tagged assets in a given space. The system provides tag information data, and makes all calculations necessary for visually displaying the movements of tags on any two dimensional (2D) or three dimensional (3D) imported floor plan graphic file (e.g., .gif, .png, .jpg or similar formats) in real-time through web-based systems. In particular, the system allows any end-user to import any valid graphic floor plan file and draw computer assisted zone overlays that allow the assignment of an RFID antenna that creates an associative reference enabling real-time asset tracking on a web-based distributed system or website (i.e., real-time in the context of a distributed system). The system associates specific RFID reader events, objects and tag streams with corresponding floor plan zones. The system also autonomously interpolates the tag associations from graphic computer-assisted generated zones to display and store each movement (e.g., a tag moved from “Office 1” to “Office 2” at “Date/Time” and was last seen at “Date/Time”) in a database. The system further provides visual trend analysis and historical information about all movements that are drawn graphically on the floor plan element. The system provides a user-friendly interface allowing a user (e.g., asset manager) to efficiently create a tracking and monitoring area by drawing zones using the computer floor plan graphic file, and configuring the zones quickly for business models and strategic goals for tracking and monitoring assets. The system then immediately provides autonomous real-time visual information of asset movements. The user can ascertain asset movement and location quickly through visual displays that augment any grid reporting of tag/asset movement and data, thereby providing an animated, RFID-tag tracking system providing a visual bird-eye animated view of current movements of assets, first/last seen dates of assets, and a powerful image-based movement/path event-based scheme from a computer-assisted graphical drawing and design functionality. In several embodiments, the present invention comprises a web-based distributed application system, which may operate through one or more computer or service devices. The system imports graphic files (e.g. floor plans), and provides computer-assisted drawing of overlays and adding of objects and text. The design configuration is then saved in an appropriate file format (e.g., XML). The association of the RFID-reader object, events and streams with the computer-assisted importing and drawing of the RFID-reader object on floor plans allows the graphical display of the tracked asset to occur very quickly. The graphical display may include, but is not limited to, information about antennae, zones, monitoring zones, objects, containers of objects, center points of objects, or polygonal points of objects and zones. The present invention can incorporate any RFID reader (or similar device, regardless of frequency or specification. The tracking software can run on any computing device, including, but not limited to, portable computing devices, tablets, mobile computing device, PDAs, cell phones, and the line. RFID readers may be connected by LAN, WAN, or by directed wired connection to the computing device. In one embodiment, the present invention comprises at least one RFID reader, such as a long range 900 Mhz Radio Frequency RFID Reader, and a plurality of polarized antennae. The RFID readers are connected wireless or by wired connections (e.g., TCIP, serial port, or the like). The computing device is a desktop-based computer, with software loaded thereon for importing graphical floor plans and files to provide a visual representation that corresponds to an entire tracking area responsibility. The invention provides the end-user the ability to create digital illustration of overlays, circle squares, color fill or images superimposed over any portion of an imported floor plan under the direct manipulation of a tablet or a mouse, and computer-aided design with precise shape-building tools. The invention provides graphical icon toolset call containers that will act as either trigger mechanisms for the RFID reader or storage of associated tag lists. Containers are objects that either creates a trigger that starts the RFID reader event or storage of associated RFID tag lists. When a tool icon from the toolset is dragged onto the imported floor plan image, an associated dialogue appears to capture important information about the tool. If an antenna or reader tool icon is dragged on to the floor plan image, then a dialog will appear with a scaled down floor plan image and any zone overlays that have been drawn on the image. Any antenna can be assigned to any drawn zone creating the zone/antenna relationship. In one embodiment, the invention comprises a desktop application that utilizes Microsoft's SignalR framework to send messages, alerts and signals to the web server in real-time. Accordingly, in several embodiments, the present invention (b 1) provides a desktop application connected to one or more RFID reader devices, (2) provides a list of available antennas autonomously, (3) provides an import of floor plan images and the ability to superimpose/draw overlays over imported images, (4) provides for the assignment of available RFID antennas to previously drawn zones/overlays; (5) sends the saved image and data to an XML file (which may be sent via TCIP or HTTP to an IIS web server as XML file, where web server redraws the image from the XML), (6) provides real time updates, through a web-based software system, of tag movement through autonomous creation and drawings of lines and squares; (7) allows the user to click on any real-time object revealing the exact asset that moved and the time it moved; (8) provide grid views that allow any row of grid data, once selected, to depict the visual path representing movement of the tagged asset between zones. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 shows a view of a system in accordance with an embodiment of the present invention. FIG. 2 shows an exemplary user login and connection configuration screen. FIG. 3 shows an exemplary connection screen. FIG. 4 shows an exemplary file dialog window. FIG. 5 shows an exemplary graphical area map import screen. FIG. 6 shows a representative tool set. FIGS. 7A-B show an example of the square selection tool. FIG. 8 shows an exemplary zone dialog box. FIG. 9 shows an exemplary RFID device assignment information dialog box. FIG. 10 shows an exemplary zone assignment dialog box. FIGS. 11-15 show examples examples of the zone selection process. FIGS. 16A-17B show examples of the antenna assignment process. FIG. 18 shows an exemplary save tracking area template box. FIGS. 19-21 show examples of tag programming and zone assignment screens. FIGS. 22-29 show examples of real-time monitoring and tracking screens. FIGS. 30-36 show examples of tag history and trend analysis screens. FIGS. 37-38 shows diagrams of the methodology of the present invention. DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS In various exemplary embodiments, the present invention comprises a radio frequency identification (RFID) tag design-first, computer-assisted drawn configuration, visualization and monitoring system for monitoring the movement of tagged assets in a given space. The system provides tag information data, and makes all calculations necessary for visually displaying the movements of tags on any two dimensional (2D) or three dimensional (3D) imported floor plan graphic file (e.g., .gif, .png, .jpg or similar formats) in real-time through web-based systems, as shown in FIG. 1. As seen in FIG. 1, one embodiment of the system comprises an RFID reader/writer 10 in electronic communications with a plurality of RFID antennas 12, and with an application server 20 (through a serial port connection, a CAT 5 LAN connection, or similar connection), which in turn is in electronic communication with a database server 30 and a web server 40. A user, through a browser or application 50 on a personal computer or other computing device, accesses the system through the web server. In particular, the system allows any end-user to import any valid graphic floor plan file and draw computer assisted zone overlays that allow the assignment of an RFID antenna (or a plurality of antennas) that creates an associative reference enabling real-time asset tracking on a web-based distributed system or website (i.e., real-time in the context of a distributed system). The system associates specific RFID reader events, objects and tag streams with corresponding floor plan zones. The system also autonomously interpolates the tag associations from graphic computer-assisted generated zones to display and store each movement (e.g., a tag moved from “Office 1” to “Office 2” at “Date/Time” and was last seen at “Date/Time”) in a database. The system further provides visual trend analysis and historical information about all movements that are drawn graphically on the floor plan element. The system provides a user-friendly interface allowing a user (e.g., asset manager) to efficiently create a tracking and monitoring area by drawing zones using the computer floor plan graphic file, and configuring the zones quickly for business models and strategic goals for tracking and monitoring assets. The system then immediately provides autonomous real-time visual information of asset movements. The user can ascertain asset movement and location quickly through visual displays that augment any grid reporting of tag/asset movement and data, thereby providing an animated, RFID-tag tracking system providing a visual bird-eye animated view of current movements of assets, first/last seen dates of assets, and a powerful image-based movement/path event-based scheme from a computer-assisted graphical drawing and design functionality. In several embodiments, the present invention comprises a web-based distributed application system, which may operate through one or more computer or service devices. the system imports graphic files (e.g. floor plans), and provides computer-assisted drawing of overlays and adding of objects and text. The design configuration is then saved in an appropriate file format (e.g., XML). The association of the RFID-reader object, events and streams with the computer-assisted importing and drawing of the RFID-reader object on floor plans allows the graphical display of the tracked asset to occur very quickly. The graphical display may include, but is not limited to, information about antennae, zones, monitoring zones, objects, containers of objects, center points of objects, or polygonal points of objects and zones. The present invention can incorporate any RFID reader (or similar device, regardless of frequency or specification. The tracking software can run on any computing device, including, but not limited to, portable computing devices, tablets, mobile computing device, PDAs, cell phones, and the line. RFID readers may be connected by LAN, WAN, or by directed wired connection to the computing device. In one exemplary embodiment, the present invention comprises at least one RFID reader, such as a long range 900 Mhz Radio Frequency RFID Reader, and a plurality of polarized antennae. The RFID readers are connected wireless or by wired connections (e.g., TCIP, serial port, or the like). The computing device is a desktop-based computer, with software loaded thereon for importing graphical floor plans and files to provide a visual representation that corresponds to an entire tracking area responsibility. The invention provides the end-user the ability to create digital illustration of overlays, circle squares, color fill or images superimposed over any portion of an imported floor plan under the direct manipulation of a tablet or a mouse, and computer-aided design with precise shape-building tools. The invention provides graphical icon toolset call containers that will act as either trigger mechanisms for the RFID reader or storage of associated tag lists. Containers are objects that either creates a trigger that starts the RFID reader event or storage of associated RFID tag lists. When a tool icon from the toolset is dragged onto the imported floor plan image, an associated dialogue appears to capture important information about the tool. If an antenna or reader tool icon is dragged on to the floor plan image, then a dialog will appear with a scaled down floor plan image and any zone overlays that have been drawn on the image. Any antenna can be assigned to any drawn zone creating the zone/antenna relationship. In one embodiment, the invention comprises a desktop application that utilizes Microsoft's SignalR framework to send messages, alerts and signals to the web server in real-time. FIGS. 2-19 show various examples of user interface screens for an embodiment of an application of the present invention. FIG. 2 shows an example of a user login and connection configuration interface screen. The user can login with a user name 102 and password 104, although alternative means of secure access (e.g., biometrics) may be used. From this screen the user can also specify connection type 106, network information 108, and com port information 110. A status window 112 can provide messages or details about event and connection status. Once connected, the user is presented a connection screen as seen in FIG. 3. This is similar to FIG. 2, with the addition of a number of tool icons 120, as well as an active menu bar 122. From here, the user can identify and load a new tracking area by creating a new file using the new file option in the menu. This opens the file dialog window shown in FIG. 4. This allows the user to specify an image file, either directly or by browsing and selecting a file in a folder or library. Clicking on an image provides information about the file. Opening the selected file causes the graphical floor plan image 125 to open in the graphical area map import screen, as seen in FIG. 5. In the graphical area map import screen, the tool set 120 located on the left panel contains multiple graphical icons that represent drawing tools. The drawing tools can be selected and dragged onto the background image to represent different objects that interact programmatically with the RFID reader/writer. FIG. 6 shows a representative tool set with index. When the arrow tool is selected from the toolset panel the mouse cursor is represented by the arrow icon. The arrow tool is used for selecting any component, control, panel, window or dialog. When the square selection tool 142 is selected it sets the functionality of the mouse cursor to draw square overlays over the graphical image in the primary panel. While dragging the square selection tool over the graphical image the square will be purple in color until the drag motion is complete and which point the square overlay will be transparent except for a dotted-line border 144 representing the square selection. This tool is a precursor for the zone tool and must be used prior to using the zone tool. An example of the square selection tool being used (for both 2-D and 3-D graphical images) is seen in FIG. 11. When the lasso selection tool 143 is selected it sets the functionality of the mouse cursor to draw polygon overlays over the graphical image in the primary panel. While dragging the lasso selection tool over the graphical image, the polygon angles will be purple in color until the drag motion is complete and which point the lasso overlay image will be transparent except for a dotted line border 144 representing the square that was just drawn This is useful when the user has unconventional tracking areas that are not quadrilateral. This tool is a precursor for the zone tool and must be used prior to using the zone tool. An example of the lasso selection tool being used is seen in FIGS. 7A-B and 12. The zone tool 135 represents a drawn area called a zone and simply fills the area drawn by the square selection tool or the lasso selection tool. When selecting the zone tool, the mouse cursor will change to represent the blue zone icon which was selected. This tool is then dragged with the mouse anywhere inside a previously drawn square or lasso area 144. Once within the pre-drawn areas, the user can click the left mouse button and the system fills the pre-drawn area with a blue opaque color, as seen in FIG. 15. Once the zone tool has been clicked onto the graphical image, it will open a file dialog that requires basic information about the zone just created or indicated, as seen in FIGS. 8 and 13. The RFID device tool is used to draw a representation of an RFID device to be displayed in the tracking area. This tool is useful if the user wants a visual representation of the RFID device. When selecting the RFID device tool, the mouse cursor will change to represent the RFID device icon which was selected. Once the RFID device tool has been clicked onto the graphical image, it will open a file dialog that requires basic RFID device assignment information 130, as seen in FIG. 9. The Environment option from the top menu strip contains many additional “container” tools that allow the user to draw a physical object on the graphical image and assign a “container” 131 to hold and track tags, as seen in FIG. 10. The antenna tool 152 is used to draw a representation of an antenna tool to be displayed in the tracking area, This tool is the most important tool for real time tracking and location as it can be assigned to any pre-drawn zone 144. When selecting the antenna tool, the mouse cursor will change to represent the antenna icon which was selected. Once the antenna tool has been clicked onto the graphical image, it will open a file dialog that requires zone assignment, as seen in FIGS. 11 and 14. The zoom tool allows the user to zoom in/out on the graphical image in the main window. After selecting the tool and placing the mouse cursor on the graphic image, left/right clicking the mouse zooms the image in/out respectively. From the tool icon panel, the user selects the square or lasso tool. FIG. 11 shows an example a square tool selection, FIG. 12 shows a Lasso tool selection. Both can be used to indicate the desired tracking area (by dragging the square indicator to cover the “office” area, or “3d room” in respective examples). The user then selects the zone tool, and clicks the left mouse button when the tool cursor is located inside the dotted line drawn by the lasso tool, as seen in FIG. 12. The user then enters zone information in the zone dialog box (as seen in FIG. 14). FIG. 15 shows an example of a floorplan where multiple three dimensional rooms have been indicated as zones. The user can then choose the antenna tool, move the tool to the desired zone, and click to set the antenna in place, as indicated in FIGS. 16A, B. The user then enters antenna information in the antenna dialog box (similar to the zone dialog box). FIGS. 17A, B show an example of a floorplan where antennas 150 have been placed in the indicated zones. The user here can select individual antennas from the antenna list 160. After the tracking area design is complete, the user then saves the tracking area template file. An example of a save tracking area template box 170 is shown in FIG. 18. FIG. 19 shows an example of a Optimization screen with tabs Antenna Power Management 170 and Tag Data Management 175. The Antenna Power Management tab is simply an interface that allows the user to display the pre-designed graphical representation and analyze distance measuring through manipulation of RSSI (reader signal strength indicator) and (optional robotics) elevation, rotation and sweep angle alignment functionality to maximize efficiency of the tracking environment. The user selects a floor plan 180 from available tracking area graphic files (designed and saved as described above). This results in the screen shown in FIG. 20. Selecting an antenna from the dropdown list 182 or checking a zone check box 184 will render a yellow, red and blue RF field strength animation 186 that animates, grows and positions according to the RF power slide 190 settings and antenna rotation 192 settings. Every time these two settings are manipulated, a new RF field strength will be drawn (animated) automatically. The RF field strength displays different colors denoting the following: Red—the tag is at the maximum/minimum writing distance (could damage tag at minimums); Yellow—caution range max/min; Blue—optimum range. The application allows the user to select RF power (percentage) 190 to adjust programming antenna strength, rotation to rotate the antenna 192 as it is physically oriented in the actual tracking environment, as well as configure remote robotic 194 controlled antenna parameters. Once the tracking area design is completed, once saved, the tracking area solution is immediately available in the web server and distributed environment, and can provide instance location metrics, surveillance and monitoring in real time. Examples of real-time monitoring and tracking screens showing the movement of a tracked asset (e.g., a pallet of boxes) are seen in FIGS. 19-32. The inventory page on the web-based system consist of a data grid 207 which is pushed data in real-time from RFID antenna interrogations. The user selects inventory from the web based system which is now the Live Site Survey graphical representation of your RFID infrastructure. The user can search using the date/time filter which indicates when the tag was first discovered 210 by the reader. The user can enter tag data in the main search input box 200 which will perform a search across the real-time inventory and display the results in the respective graphical zone. The user can elect and click the “Missing Tag List” button 206 to invoke a real-time inventory event on the entire site and the grid data that locates missing tags from your site's inventory. Missing tags will be highlighted in red with a total count 250 of missing tags indicated at the bottom of the grid data. The inventory page is fully interactive and user searchable 200. When the user moves the cursor over a graphical zone “Click to Inventory” 300 will be displayed over that zone allowing you to invoke a real-time inventory specifically for that zone as indicated in FIG. 23. When the user clicks a zone 300 two-way communication is imitated back from the web system to the actual RFID hardware device and configures the device for specific inventory interrogation. This can occur from cloud services or local area network. The data grid in the inventory page consists of magnifying glasses in the last column under the title “Find”. When the magnifying glass icon is clicked the system automatically navigates to the real-time “Visual Locator” 400 page. The “Visual Locator” page indicates the “Current Location” 410 with the zone name (AdminProc) and “Tracking/Monitoring” 430 shows the current selected tag EPC/Tag ID which indicates the tag that is being monitored for visual animated display in real-time. The label “duration” 420 indicates the time span of tag monitoring in days: hours: min: seconds. By selecting the tag icon 440 in the tree list the floorplan will reveal the real-time current location of that tag. Real-time monitoring of all tags is still occurring; however, when selecting a tag the user will only get a visual animated indication of all transit moves from the tag selected from the Inventory Page's data grid magnifying glass icon. All other transits and interrogation as they occur are being saved to the database which can be selected as single select or multiple select to view all historical transits and movement of tags. Anytime a user views the Visual Locator page the current monitored tag will be monitored in real-time and any movement of the monitored tag will be indicated by an animated line 470 as indicated in FIG. 27. When a user clicks on the animated line 480 a blue pop-up dialog 490 will appear indicated details about the tag transition as indicated in FIGS. 27 & 28. The EPC/Tag ID and Tag icon will all traverse the tree view list 485 in real-time to indicate the corresponding zone location at the time the tag moves between zones. A user can select the History page where a grid data 500 will show historical data only in 18 row increments at a time. Scrolling down with the scrollbar 510 located at the right side of the grid view will load more events as needed. This feature is called “Load on Demand” and ensures efficient data retrieval and manipulation of the data in the grid view. the user can enter specific EPC entered into the data grid's EPC filter box 505 in the data grid header indicated a desire to “play back” all historical transitions and events associated with that particular EPC. As shown in FIG. 31 a user can select a single or multiple rows 530 and all selected items are highlighted in yellow. When the user clicks the View Assets button 520 an animated historical “play-back” tag transition will occur. In FIG. 32, one of the “play-back” track routes 570 are visible in green indicating a historical movement from the AdminProc zone to the Paint Shop zone. When selecting multiple tags the system will animate the transition path history of each selected row at a predetermined interval until the all selected rows have been animated and displayed. Notice that the “Current Location” 550 indicates the history's origin and destination locations and a “play-back” list window 580 pops-up showing movement detail as it occurred in history. The Historical “play-back” list can be printed as needed 590. The user can select the system Health Monitoring page to monitor the accuracy, efficiency or strength of the RFID infrastructure signals. The health monitor, presents real-time current signal strength status of each reader connected to the selected reader. The System Health and Monitoring page shows four small gauges 610 that represent zones and two large gauges, one Signal Coverage 620 and one Back Scatter 630, that represent the entire site as shown in FIG. 33. Each small (Zone) gauge 610 represents the current, live real-time RSSI strength of the antenna associated with that zone. The maximum value is set by the “Set Max Power” option from the from the Optimization and Layout Management feature in the designer tool. The large Back Scatter gauge 630 represents the current, live real-time measurement of the modulated scattered electromagnetic wave incident from the reader. This is device specific. The large Signal Coverage gauge 620 represents the current, live real-time measurement of read success demonstrated over the entire site area. The RSSI value for indicated by the small gauge (in this example the AdminProc gauge 640) zone when the user places the cursor over the gauge. The user can click on the zone overlay image 650 (the example in this case is the small Admin Proc zone highlighted in the yellow dotted line 650). When the zone is clicked the page will change to show a larger RSSI gauge 660, Signal Coverage gauge 680, Backscatter Gauge 690, Real-Time RSSI performance gauge 670 and tag list box 700 for the selected zone. All gauges are animated with real-time live data pushed from the RFID reader hardware device. FIG. 35 shows an example of an intelligent dashboard data grid 750. It is used to show real-time metrics of tag data that are currently being monitored. User-selectable objects and interactive buttons display key performance indicators and total tracking performance figures 770 of a previous CAD design. The dashboard pie chart 780 shows metrics from individual zones, including total inventors invoked against specific zones. The pie chart legend 790 shows real-time color association and labels for various graphs and embedded charts. The vertical axis 800 shows total Electronic Product Code (EPC) reads. FIG. 37 is a diagram 900 of the methodology to develop RFID systems through repeated cycles, and in incremental sections per cycle. This promotes indoctrination during the early stages of RFID development when building parts or versions of the system. The goal is to initiate key indicators in the RFID development, leveraging a subset of the RFID asset tracking requirements, and iteratively improve and optimize the evolving versions until the full system is implemented. FIG. 38 is another diagram of the three-step process 1000 underlying the present invention. This process allows the user to iteratively or recursively keep the tracking environment current at all times, regardless of constantly changing business requirements. Accordingly, in several embodiments, the present invention (1) provides a desktop application connected to one or more RFID reader devices, (2) provides a list of available antennas autonomously, (3) provides an import of floor plan images and the ability to superimpose/draw overlays over imported images, (4) provides for the assignment of available RFID antennas to previously drawn zones/overlays; (5) sends the saved image and data to an XML file (which may be sent via TCIP or HTTP to an IIS web server as XML file, where web server redraws the image from the XML), (6) provides real time updates, through a web-based software system, of tag movement through autonomous creation and drawings of lines and squares; (7) allows the user to click on any real-time object revealing the exact asset that moved and the time it moved; (8) provide grid views that allow any row of grid data, once selected, to depict the visual path representing movement of the tagged asset between zones. In order to provide a context for the various aspects of the invention, the following discussion provides a brief, general description of a suitable computing environment in which the various aspects of the present invention may be implemented. A computing system environment is one example of a suitable computing environment, but is not intended to suggest any limitation as to the scope of use or functionality of the invention. A computing environment may contain any one or combination of components discussed below, and may contain additional components, or some of the illustrated components may be absent. Various embodiments of the invention are operational with numerous general purpose or special purpose computing systems, environments or configurations. Examples of computing systems, environments, or configurations that may be suitable for use with various embodiments of the invention include, but are not limited to, personal computers, laptop computers, computer servers, computer notebooks, hand-held devices, microprocessor-based systems, multiprocessor systems, TV set-top boxes and devices, programmable consumer electronics, cell phones, personal digital assistants (PDAs), tablets, smart phones, touch screen devices, smart TV, internet enabled appliances, internet enabled security systems, internet enabled gaming systems, internet enabled watches; internet enabled cars (or transportation), network PCs, minicomputers, mainframe computers, embedded systems, virtual systems, distributed computing environments, streaming environments, volatile environments, and the like. Embodiments of the invention may be implemented in the form of computer-executable instructions, such as program code or program modules, being executed by a computer, virtual computer, or computing device. Program code or modules may include programs, objections, components, data elements and structures, routines, subroutines, functions and the like. These are used to perform or implement particular tasks or functions. Embodiments of the invention also may be implemented in distributed computing environments. In such environments, tasks are performed by remote processing devices linked via a communications network or other data transmission medium, and data and program code or modules may be located in both local and remote computer storage media including memory storage devices such as, but not limited to, hard drives, solid state drives (SSD), flash drives, USB drives, optical drives, and internet-based storage (e.g., “cloud” storage). In one embodiment, a computer system comprises multiple client devices in communication with one or more server devices through or over a network, although in some cases no server device is used. In various embodiments, the network may comprise the Internet, an intranet, Wide Area Network (WAN), or Local Area Network (LAN). It should be noted that many of the methods of the present invention are operable within a single computing device. A client device may be any type of processor-based platform that is connected to a network and that interacts with one or more application programs. The client devices each comprise a computer-readable medium in the form of volatile and/or nonvolatile memory such as read only memory (ROM) and random access memory (RAM) in communication with a processor. The processor executes computer-executable program instructions stored in memory. Examples of such processors include, but are not limited to, microprocessors, ASICs, and the like. Client devices may further comprise computer-readable media in communication with the processor, said media storing program code, modules and instructions that, when executed by the processor, cause the processor to execute the program and perform the steps described herein. Computer readable media can be any available media that can be accessed by computer or computing device and includes both volatile and nonvolatile media, and removable and non-removable media. Computer-readable media may further comprise computer storage media and communication media. Computer storage media comprises media for storage of information, such as computer readable instructions, data, data structures, or program code or modules. Examples of computer-readable media include, but are not limited to, any electronic, optical, magnetic, or other storage or transmission device, a floppy disk, hard disk drive, CD-ROM, DVD, magnetic disk, memory chip, ROM, RAM, EEPROM, flash memory or other memory technology, an ASIC, a configured processor, CDROM, DVD or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium from which a computer processor can read instructions or that can store desired information. Communication media comprises media that may transmit or carry instructions to a computer, including, but not limited to, a router, private or public network, wired network, direct wired connection, wireless network, other wireless media (such as acoustic, RF, infrared, or the like) or other transmission device or channel. This may include computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism. Said transmission may be wired, wireless, or both. Combinations of any of the above should also be included within the scope of computer readable media. The instructions may comprise code from any computer-programming language, including, for example, C, C++, C#, Visual Basic, Java, and the like. Components of a general purpose client or computing device may further include a system bus that connects various system components, including the memory and processor. A system bus may be any of several types of bus structures, including, but not limited to, a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. Such architectures include, but are not limited to, Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus. Computing and client devices also may include a basic input/output system (BIOS), which contains the basic routines that help to transfer information between elements within a computer, such as during start-up. BIOS typically is stored in ROM. In contrast, RAM typically contains data or program code or modules that are accessible to or presently being operated on by processor, such as, but not limited to, the operating system, application program, and data. Client devices also may comprise a variety of other internal or external components, such as a monitor or display, a keyboard, a mouse, a trackball, a pointing device, touch pad, microphone, joystick, satellite dish, scanner, a disk drive, a CD-ROM or DVD drive, or other input or output devices. These and other devices are typically connected to the processor through a user input interface coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, serial port, game port or a universal serial bus (USB). A monitor or other type of display device is typically connected to the system bus via a video interface. In addition to the monitor, client devices may also include other peripheral output devices such as speakers and printer, which may be connected through an output peripheral interface. Client devices may operate on any operating system capable of supporting an application of the type disclosed herein. Client devices also may support a browser or browser-enabled application. Examples of client devices include, but are not limited to, personal computers, laptop computers, personal digital assistants, computer notebooks, hand-held devices, cellular phones, mobile phones, smart phones, pagers, digital tablets, Internet appliances, and other processor-based devices. Users may communicate with each other, and with other systems, networks, and devices, over the network through the respective client devices. Thus, it should be understood that the embodiments and examples described herein have been chosen and described in order to best illustrate the principles of the invention and its practical applications to thereby enable one of ordinary skill in the art to best utilize the invention in various embodiments and with various modifications as are suited for particular uses contemplated. Even though specific embodiments of this invention have been described, they are not to be taken as exhaustive. There are several variations that will be apparent to those skilled in the art. What is claimed is: 1. A method for designing an asset tracking plan, comprising the steps of: receiving, using a processor or microprocessor in a computing device, a graphical file representing the floor plan of a space containing assets to be tracked, said assets marked or affixed with RFID tags; defining one or more contiguous areas within said space as zones; placing one or more antenna icons within one or more of said zones; and setting RF field strength and rotation for each of said one or more antenna icons. 2. The method of claim 1, wherein the floor plan with zone and antenna information is saved as a computer file on a non-transitory computer-readable storage medium. 3. The method of claim 1, wherein the floor plan represents an office space. 4. The method of claim 1, wherein the assets to be tracked are moved within the space. 5. A system for designing an asset tracking plan, comprising: a computing device with a processor or microprocessor coupled to a computer memory, wherein the processor or microprocessor is programmed to receive, using a processor or microprocessor in a computing device, a graphical file representing the floor plan of a space containing assets to be tracked, said assets marked or affixed with RFID tags; define one or more contiguous areas within said space as zones; place one or more antenna icons within one or more of said zones; and set RF field strength and rotation for each of said one or more antenna icons. 6. The system of claim 5, wherein the floor plan with zone and antenna information is saved as a computer file on a non-transitory computer-readable storage medium. 7. The system of claim 5, wherein the floor plan represents an office space. 8. The system of claim 5, wherein the assets to be tracked are moved within the space. 9. A system for tracking assets with attached RFID tags, comprising: one or more RFID readers in a space; a plurality of polarized antennae in said space; and at least one computing device in communication, wired or wireless, with said one or more RFID readers, said computing device comprising a microprocessor or processor adapted to import and display a graphical floor plan representative of the space with locations of the RFID readers or antennas, or both, indicated thereon. 10. The system of claim 9, further wherein said microprocessor or processor is adapted to receive RFID tag location information from said one or more RFID readers. 11. The system of claim 10, further wherein said microprocessor or processor is adapted to display in real time the movement of assets and associated RFID tags within the space. 12. The system of claim 9, wherein the floor plan represents an office space. 13. The system of claim 10, further wherein said microprocessor processor is adapted to store historical movement information of assets and associated RFID tags within the space. 14. The system of claim 13, further wherein said microprocessor or processor is adapted to display the historical movement of assets and associated RFID tags within the space.

2015-05-20

en

2015-11-26

US-54955706-A

Methods and apparatuses for modifying a search term utilized to identify an electronic mail message ABSTRACT In one embodiment, the methods and apparatuses detect a message; detect an original search term; search for a match between the original search term and a term within the message; and selectively modify the original search term based on a number of matches. FIELD OF INVENTION The present invention relates generally to recognizing terms and, more particularly, to modifying a search term utilized to identify an electronic mail message. BACKGROUND Electronic mail applications such as Outlook® and Tiger Mail® allow users to search for specific electronic mail messages by searching for a term or key word. The user can search for the term or key word in the body of the message, the subject line of the message, the sender, and/or the recipient. Further, the user can search for messages by date sent. SUMMARY In one embodiment, the methods and apparatuses detect a message; detect an original search term; search for a match between the original search term and a term within the message; and selectively modify the original search term based on a number of matches. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate and explain one embodiment of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. In the drawings, FIG. 1 is a diagram illustrating an environment within which the methods and apparatuses for modifying a search term utilized to identify an electronic mail message are implemented; FIG. 2 is a simplified block diagram illustrating one embodiment in which the methods and apparatuses for modifying a search term utilized to identify an electronic mail message are implemented; FIG. 3 is a simplified block diagram illustrating a system, consistent with one embodiment of the methods and apparatuses selectively controlling a remote device; FIG. 4 is an exemplary record for use with the methods and apparatuses for modifying a search term utilized to identify an electronic mail message; and FIG. 5 is a flow diagram consistent with one embodiment of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. DETAILED DESCRIPTION The following detailed description of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message refers to the accompanying drawings. The detailed description is not intended to limit the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. Instead, the scope of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message is defined by the appended claims and equivalents. Those skilled in the art will recognize that many other implementations are possible, consistent with the present invention. References to a device include a desktop computer, a portable computer, a personal digital assistant, a video phone, a landline telephone, a cellular telephone, and a device capable of receiving/transmitting an electronic signal. FIG. 1 is a diagram illustrating an environment within which the methods and apparatuses for modifying a search term utilized to identify an electronic mail message are implemented. The environment includes an electronic device 110 (e.g., a computing platform configured to act as a client device, such as a computer, a personal digital assistant, and the like), a user interface 115, a network 120 (e.g., a local area network, a home network, the Internet), and a server 130 (e.g., a computing platform configured to act as a server). In one embodiment, one or more user interface 115 components are made integral with the electronic device 110 (e.g., keypad and video display screen input and output interfaces in the same housing such as a personal digital assistant. In other embodiments, one or more user interface 115 components (e.g., a keyboard, a pointing device such as a mouse, a trackball, etc.), a microphone, a speaker, a display, a camera are physically separate from, and are conventionally coupled to, electronic device 110. In one embodiment, the user utilizes interface 115 to access and control content and applications stored in electronic device 110, server 130, or a remote storage device (not shown) coupled via network 120. In accordance with the invention, embodiments of dynamically enforcing privileges during a data collaboration session below are executed by an electronic processor in electronic device 110, in server 130, or by processors in electronic device 110 and in server 130 acting together. Server 130 is illustrated in FIG. 1 as being a single computing platform, but in other instances are two or more interconnected computing platforms that act as a server. FIG. 2 is a simplified diagram illustrating an exemplary architecture in which the methods and apparatuses for modifying a search term utilized to identify an electronic mail message are implemented. The exemplary architecture includes a plurality of electronic devices 202, a server device 210, and a network 201 connecting electronic devices 202 to server 210 and each electronic device 202 to each other. The plurality of electronic devices 202 are each configured to include a computer-readable medium 209, such as random access memory, coupled to an electronic processor 208. Processor 208 executes program instructions stored in the computer-readable medium 209. In one embodiment, a unique user operates each electronic device 202 via an interface 115 as described with reference to FIG. 1. The server device 130 includes a processor 211 coupled to a computer-readable medium 212. In one embodiment, the server device 130 is coupled to one or more additional external or internal devices, such as, without limitation, a secondary data storage element, such as database 240. In one instance, processors 208 and 211 are manufactured by Intel Corporation, of Santa Clara, Calif. In other instances, other microprocessors are used. In one embodiment, the plurality of client devices 202 and the server 210 include instructions for a customized application for modifying a search term utilized to identify an electronic mail message. In one embodiment, the plurality of computer-readable media 209 and 212 contain, in part, the customized application. Additionally, the plurality of client devices 202 and the server 210 are configured to receive and transmit electronic messages for use with the customized application. Similarly, the network 210 is configured to transmit electronic messages for use with the customized application. One or more user applications are stored in media 209, in media 212, or a single user application is stored in part in one media 209 and in part in media 212. In one instance, a stored user application, regardless of storage location, is made customizable based on dynamically enforcing privileges during a data collaboration sessions determined using embodiments described below. FIG. 3 illustrates one embodiment of a system 300. In one embodiment, the system 300 is embodied within the server 130. In another embodiment, the system 300 is embodied within the electronic device 110. In yet another embodiment, the system 300 is embodied within both the electronic device 110 and the server 130. In one embodiment, the system 300 includes a profile manager module 310, a message detection module 320, a storage module 330, an interface module 340, a control module 350, a term detection module 360, a search module 370, and a suggestion module 380. In one embodiment, the control module 350 communicates with the profile manager module 310, the message detection module 320, the storage module 330, the interface module 340, the term detection module 360, the search module 370, and the suggestion module 380. In one embodiment, the control module 350 coordinates tasks, requests, and communications between the profile manager module 310, the message detection module 320, the storage module 330, the interface module 340, the term detection module 360, the search module 370, and the suggestion module 380. In one embodiment, the profile manager module 310 organizes and tracks the profiles. In one embodiment, each profile corresponds to a specific user account associated with a particular electronic message account. In another embodiment, each profile corresponds to a plurality of electronic message accounts. For example, the plurality of electronic message accounts may belong to a single company. In another embodiment, the plurality of electronic message accounts may belong to multiple companies. In one embodiment, the message detection module 320 detects and identifies the electronic mail message. In one embodiment, the message detection module 320 detects electronic messages that are transmitted through the network 120. In one embodiment, the message detection module 320 is capable of detecting electronic messages that are sent or received by any of the user accounts associated with the profile. In one embodiment, the storage module 330 stores a record including a profile associated with the each device, user, electronic mail account, or group of electronic mail accounts. An exemplary profile is shown in a record 400 within FIG. 4. In one embodiment, the storage module 330 stores electronic mail messages. Further, the storage module 330 is configured to store various terms and descriptions corresponding to a search term. In one embodiment, a description of the search term includes synonyms and equivalents of the search term. In one embodiment, the storage module 330 is configured to store an equivalent search term that corresponds to the search term. In one embodiment, the interface module 340 detects electronic messages transmitted between accounts and user interaction from a device through the network 120. In one embodiment, the interface module 340 displays suggested alternatives to the terms being searched within an electronic message. In another embodiment, the interface module 340 allows definitions to be applied to new terms associated with the content from an electronic message. In one embodiment, the term detection module 360 is configured to detect a search term that is utilized to find the same term within the electronic mail message. In one embodiment, the search module 370 is configured to find a term within the electronic mail message that matches the search term. In one embodiment, the suggestion module 380 is configured to suggest equivalent terms associated with the search term. In one embodiment, the equivalent terms are utilized if there are not a sufficient number of matches to the search term. The equivalent terms expand the scope of the original search term. In one embodiment, the equivalent terms include synonyms of the search term. In another embodiment, the equivalent terms include phonetically similar sounding terms corresponding with the search term. In yet another embodiment, the equivalent terms include misspellings of the search term. In yet another embodiment, the equivalent terms include abbreviations of the search term. In this instance, the equivalent terms are used in conjunction with the original search term to broaden the original search term. For example, for a match to occur, the original search term or the equivalent search terms are found within the same message. In another embodiment, the equivalent terms are utilized if there are too many matches to the search term. The equivalent terms reduce the scope of the original search term. In one embodiment, the equivalent terms include synonyms of the search term that further provide context of the original search term. In this instance, the equivalent terms are used in conjunction with the original search term to further limit the original search term. For example, for a match to occur, the original search term and the equivalent search terms are found within the same message. The system 300 in FIG. 3 is shown for exemplary purposes and is merely one embodiment of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. Additional modules may be added to the system 300 without departing from the scope of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. Similarly, modules may be combined or deleted without departing from the scope of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. FIG. 4 illustrates an exemplary record 400 for use with the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. In one embodiment, the record 400 illustrates an exemplary record associated with managing terms within messages and tracking the definitions of these terms. In one embodiment, there are multiple records such that each record 400 is associated with a particular user, device, or group of users. Further, each device or user may correspond with multiple records wherein each record 400 is associated with a particular profile associated with the device. In one embodiment, the record 400 includes a user name field 410, a search terms field 420, and a description of terms field 430. In one embodiment, the record 400 resides within the client 110. In another embodiment, the record 400 resides within the server 130. In one embodiment, the user name field 410 includes information related to a user, a device, or group. For example, the user name field 410 may include a company name that includes the group of accounts, a department associated with multiple accounts, and a single account associated with a user. In one embodiment, the search terms field 420 includes terms that are searched for within an electronic mail message associated with the individual or group identified within the user name field 410. The search terms may include references to information within a sender field, a recipient field, a carbon copy field, a subject line, a date sent field, a date received field, and a body area. Further, the search terms may also be indexed and stored within the search terms field 420. In one embodiment, the description of terms field 430 includes descriptions associated with the particular search terms referenced in the search terms field 420. In one embodiment, the description includes synonyms of the search term. In another embodiment, the description includes words sounding the same or similar to the search term. In yet another embodiment, the description includes words that describe the search term. The flow diagram as depicted in FIG. 5 is one embodiment of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. The blocks within the flow diagram can be performed in a different sequence without departing from the spirit of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. Further, blocks can be deleted, added, or combined without departing from the spirit of the methods and apparatuses for modifying a search term utilized to identify an electronic mail message. The flow diagram in FIG. 5 illustrates finding a search term within a message according to one embodiment of the invention. In Block 510, a message is detected. In one embodiment, the message is an electronic mail message. In another embodiment, multiple messages are detected. In one embodiment, the messaged detected correspond to a single user. In another embodiment, the messages detected correspond to multiple users within an organization. In Block 520, a search term is identified for identifying within the detected message. In one embodiment, the search term is a single word. In another embodiment, the search term is a group of words. In Block 530, the search term is matched with a corresponding term within the detected message. In one embodiment, the search term is matched with a corresponding term within the sender field, the recipient field, the subject field, and/or the body. In Block 540, if the number of messages matching the search term falls within the predetermined limits, then the matched messages are displayed in Block 545. In one embodiment, the predetermined limits include both an upper limit and a lower limit. For instance, the lower limit may be no matched messages, and the upper limit may be 20 matched messages. However, the lower limit and the upper limit may be set to a variety of values. In another embodiment, the predetermined limits may include only an upper limit or a lower limit. After the matched messages are displayed according to the Block 545, additional search terms are detected according to the Block 520. If the number of messages matching the search term falls outside the predetermined limits, then a modified search term is suggested in Block 550. In one embodiment, when the number of messages matching the search term exceeds the upper predetermined limit, then an additional term is suggested to be added to the original search term to form the modified search term. The additional term is an additional limitation that narrows the modified search term. By adding the additional term, the number of messages matching the modified search term may be reduced. In this example, each of the terms within the modified search term is matched within a given message for the message to be considered a match. In one instance, if the original search term was “apple” and the number of matched messages exceeded the upper limit, then an additional term “computer” can be added to the modified search term to further define that the term Apple® refers to the computer rather than a fruit. In one embodiment, when the number of messages matching the search term falls below the lower predetermined limit, then an additional term is suggested to be added to the original search term to form the modified search term. In this case, the additional term broadens the modified search term. By adding the additional term, the number of messages matching the modified search term may be increased in this embodiment. In this example, any of the terms within the modified search term are matched within a given message for the message to be considered a match. In one instance, if the original search term included “data” and the number of matched messages fell below the lower limit, then an additional term “audio” can be added to the modified search term to further expand the term “data” and also include references to the term “audio”. In embodiment, the additional terms can be synonyms of the original term, words that sound similar to the original term, and the like. The foregoing descriptions of specific embodiments of the invention have been presented for purposes of illustration and description. The invention may be applied to a variety of other applications. They are not intended to be exhaustive or to limit the invention to the precise embodiments disclosed, and naturally many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to explain the principles of the invention and its practical application, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the Claims appended hereto and their equivalents. 1. A method comprising: detecting a message; detecting an original search term; searching for a match between the original search term and a term within the message; and selectively modifying the original search term based on a number of matches. 2. The method according to claim 1 further comprising displaying the match between the original search term and the term within the message. 3. The method according to claim 1 further comprising detecting an upper threshold limit wherein modifying the original search term occurs when the number of matches exceeds the upper limit threshold. 4. The method according to claim 1 further comprising detecting a lower threshold limit wherein modifying the original search term occurs when the number of matches falls below the lower limit threshold. 5. The method according to claim 1 wherein selectively modifying the original search term Comprises narrowing the search term and forming a narrowed search term. 6. The method according to claim 5 further comprising adding an additional term to limit the original search term. 7. The method according to claim 1 wherein selectively modifying the original search term comprises broadening the original search term and forming a broadened search term. 8. The method according to claim 7 further comprising providing an alternative search term in addition to the original search term for forming the broadened search term. 9. The method according to claim 8 wherein the alternative search term is a synonym of the original search term. 10. The method according to claim 8 wherein the alternative search term is pronounced like of the original search term with a different spelling. 11. The method according to claim 8 wherein the alternative search term is a misspelling of the original search term. 12. The method according to claim 8 wherein the alternative search term is an abbreviation of the original search term. 13. The method according to claim 8 wherein the alternative search term is an equivalent of the original search term. 14. The method according to claim 1 wherein the message is a textual representation. 15. The method according to claim 1 wherein the message is a graphical representation. 16. A method comprising: detecting a message; detecting an original search term; searching for a match between the original search term and a term within the message; and selectively adding an alternative search term to the original search term based on a number of matches; 17. The method according to claim 16 wherein the alternative search term is a synonym of the original search term. 18. The method according to claim 16 wherein the alternative search term is pronounced like of the original search term with a different spelling. 19. The method according to claim 16 wherein the alternative search term is a misspelling of the original search term. 20. The method according to claim 16 wherein the alternative search term is an abbreviation of the original search term. 21. The method according to claim 16 wherein the alternative search term is an equivalent of the original search term. 22. A system, comprising: a message detection module configured to detect a message; a search function module configured to detect an original search term within the message; and a suggestion module configured to suggest an alternative search term based on the original search term wherein the alternative search term is utilized within a modified search term. 23. The system according to claim 22 further comprising a storage module configured to store the original search term and the alternative search term. 24. The system according to claim 22 wherein the modified search term is broader than the original search term. 25. The system according to claim 22 wherein the modified search term is narrower than the original search term.

2006-10-13

en

2008-04-17

US-201314426489-A

Method and apparatus for separating air by cryogenic distillation ABSTRACT In a method for producing a first pressurized gas and a second gas on a one-off basis by cryogenic distillation of air, according to a first step, no fluid heats up or cools down in a second heat exchanger, and according to a second step, a flow of pressurized liquid from the double column heats up and vaporizes in the second exchanger to form a gas required on a one-off basis, a flow of air at the second pressure cools in the second exchanger. CROSS REFERENCE TO RELATED APPLICATIONS This application is a §371 of International PCT Application PCT/FR2013/051985, filed Aug. 28, 2013, which claims the benefit of FR1258549, filed Sep. 12, 2012, both of which are herein incorporated by reference in their entireties. TECHNICAL FIELD OF THE INVENTION The present invention relates to a process and to apparatus for separating air by cryogenic distillation. SUMMARY OF THE INVENTION According to one subject of the invention, a process is provided for producing a first pressurized gas and also occasionally a second gas by cryogenic distillation of air in a double column comprising a first column and a second column, the second column operating at lower pressure than the first column, wherein: i) according to a first regime, air is cooled at a first pressure, which is substantially the operating pressure of the first column, in a first heat exchanger and is sent to the first column, two nitrogen-rich gas flows originating from the first and second column are heated in the first exchanger, no fluid is heated or cooled in a second heat exchanger, at least one air flow at a second pressure above the first pressure is cooled in a third heat exchanger, a pressurized liquid is vaporized in the third exchanger and a nitrogen-rich gas flow originating from the second column is heated in the third exchanger, and ii) according to a second regime, air is cooled at the first pressure in the first exchanger and is sent to the first column, a nitrogen-rich gas flow originating from the second column is heated in the first exchanger, a pressurized liquid flow originating from the double column is heated and vaporized in the second exchanger in order to form an occasionally required gas, an air flow at the second pressure is cooled and optionally condensed in the second exchanger, this air flow and the pressurized liquid flow being the only fluids exchanging heat in the second exchanger, an air flow at the second pressure is cooled in the third exchanger, optionally another air flow at a pressure above the first pressure, or even above the second pressure, is cooled in the third exchanger, a pressurized liquid is vaporized in the third exchanger and a nitrogen-rich gas flow originating from the second column is heated in the third exchanger. According to other optional features: during the second regime, a single nitrogen-rich gas flow originating from the second column is heated in the first exchanger; one of the air flows at the pressure above the operating pressure of the first column is partially cooled in the third exchanger in the first and second regimes, is expanded in a turbine and sent to the first or second column; the flow sent to the turbine originates from a first booster compressor, the other one of the air flows at the pressure above the operating pressure of the first column originates from a second booster compressor driven by the turbine; an amount of liquid is produced as final product according to the first regime and no liquid is produced as final product according to the second regime; an amount of liquid is produced as final product according to the first regime and an amount of liquid smaller than that produced in the first regime is produced as final product according to the second regime; the pressurized liquid flow is rich in nitrogen. According to another subject of the invention, a facility is provided for separating air by cryogenic distillation comprising a double column comprising a first column and a second column, the second column operating at lower pressure than the first column, a first heat exchanger, a second heat exchanger capable of, and connected to feed ducts for, enabling an indirect heat exchange between only two fluids, a third heat exchanger, means for sending an air flow at a first pressure substantially equal to the operating pressure of the first column to the first exchanger and from the first exchanger to the first column, means for dividing air at a second pressure above the first pressure into first and second fractions, means for sending the first fraction at the second pressure to the second exchanger through a first one of the feed ducts, a valve for preventing the first fraction from being sent to the second exchanger, means for sending the second fraction at the second pressure to the third exchanger, optionally other means for sending an air flow at a pressure above the first pressure to the third exchanger, means for sending a pressurized liquid from the double column to be vaporized in the third exchanger, means for sending an occasionally required liquid from the double column to be vaporized in the second exchanger through a second one of the feed ducts, a valve for preventing occasionally required liquid from being sent from the double column to the second exchanger, means for sending a nitrogen-rich gas from the first column to be heated in the first exchanger, a valve for preventing nitrogen-rich gas from being sent from the first column to the first exchanger, means for sending a nitrogen-enriched gas from the double column to the first exchanger and means for sending a nitrogen-enriched gas from the double column to the third exchanger. Optionally, at least the first and third heat exchangers are brazed aluminum plate-fin exchangers. BRIEF DESCRIPTION OF THE DRAWINGS These and other features, aspects, and advantages of the present invention will become better understood with regard to the following description, claims, and accompanying drawings. It is to be noted, however, that the drawings illustrate only several embodiments of the invention and are therefore not to be considered limiting of the invention's scope as it can admit to other equally effective embodiments. The FIGURE provides an embodiment of the present invention. DETAILED DESCRIPTION The invention proposes in particular a method and describes apparatus for transient production of a gas using apparatus that produces, in normal regime, gaseous oxygen and nitrogen and liquid oxygen and nitrogen. The apparatus comprises a double column having a first column that operates at a first pressure referred to as medium pressure (MP) and a second column that operates at a second pressure referred to as low pressure (LP), lower than the first pressure. This gas, produced in transient mode, may for example be pressurized pure nitrogen used during inerting phases of petrochemical processes that continuously need large amounts of nitrogen over several days before needing the gaseous requirements of the normal regime. Since this transient nitrogen may not be supplied completely by the store(s) of liquid nitrogen, the present invention proposes an arrangement of heat exchangers as dedicated bodies making it possible to specifically produce the gaseous requirement during the transient phase, and also to produce the requirement of the other gas or gases (e.g. oxygen); the productions of liquid nitrogen and oxygen may be reduced or even zero during the transient phase. The arrangement of the exchange bodies then makes it possible to produce, in normal regime, the gas and liquid requirements. The flexibility demanded of the main exchanger of the separation equipment is even greater since the productions demanded (in terms of pressure and flow rate) between various regime modes are far apart. The sizing of the resulting exchanger for the various operating regimes is thus far from a technical and economic optimum for a given regime. Recourse to one or more exchange lines dedicated to one or more transient regime cases makes it possible to achieve the flexibility required by these regime cases, while ensuring the technical and economic optimum of the regimes in question. For example, air separation apparatus that produces industrial gases for a petrochemical complex will be led to produce very different amounts, at different pressures, depending on the specific operations of the consumer units. Customarily, stores of liquids (nitrogen, oxygen, argon) make it possible to improve the flexibility of the production flow sheet of the air separation apparatus. Recourse to stores of liquids is however limited by the storage capacity. When non-standard regimes of the consumer units require large volumes over several days, it may be preferable to produce directly using the air separation apparatus rather than sizing the storage for this transient regime. The production flexibility of the air separation apparatus required by this regime may then be provided by the present invention, without however degrading the efficiency of normal regimes. One alternative solution is the production of medium-pressure gaseous nitrogen from a medium-pressure (MP) column and compression by a compressor. If the gaseous withdrawal from the MP column is insufficient, the vaporization of stored liquid nitrogen will then be necessary. In order to produce more gaseous nitrogen than that which may be withdrawn at the MP column, without recourse to vaporization of the stored liquid, nitrogen may be produced by the upper stages of a low-pressure column then also compressed by a compressor. In both cases, a nitrogen compressor is needed, or even also a section having reduced diameter at the top of the low-pressure column. The present invention proposes an arrangement of exchangers as dedicated bodies comprising a dedicated transient exchange line making it possible to specifically produce the gaseous requirement during the transient phase. The transient gas considered in this example is nitrogen, but the invention also applies to other gases produced by the air separation apparatus. During this transient phase, the production of gaseous oxygen is maintained but the productions of liquid nitrogen and oxygen may be reduced or even zero. The transient nitrogen is pumped from the first column (MP column) and vaporized through a dedicated exchanger line (here referred to as transient exchange line) against high-pressure (HP) air coming from the discharge of a booster compressor optionally driven by a turbine; simultaneously, the pumped oxygen is vaporized through another dedicated exchanger line against HP air coming from the discharge of the same booster compressor or from a second booster compressor. The production of gaseous nitrogen, which is normally produced from the MP column and heated against MP air coming from the air purification unit in a third dedicated exchange line, is stopped. During the normal phase, the production of transient nitrogen is stopped while the normal production of gaseous nitrogen from the MP column is established. The production of gaseous oxygen is maintained, and the liquid productions are adjusted to their normal setpoints. The exchange line dedicated to the transient production of gaseous nitrogen here only involves fluids that will change state on passing therethrough: liquid nitrogen (LIN) is vaporized to high-pressure nitrogen (HP GAN) against HP air that is liquefied. The absence of a third fluid, customarily residual nitrogen that makes it possible to reduce the difference at the hot end in order to gain in energy efficiency of the air separation apparatus, here makes it possible to greatly improve the compactness of the transient exchanger for an identical amount of exchanged heat (or “charge”); this also makes it possible to use denser corrugations. In the case of the present invention, the expected gain in compactness is substantial since, for an identical exchanged “charge”, the exchange volume may be less than half the volume customarily needed in the presence of a third fluid without a change of state. Namely, (volume/charge)transient exchanger<0.5×(volume/charge)conventional exchanger. This solution also makes it possible to specifically produce the nitrogen needed according to the regime demanded by the client by a redistribution of the flows over the exchange bodies concerned by the production. During the transient phase, only transient nitrogen is produced and the passage of the exchange body used for normal nitrogen is shut down. During the normal phase, only normal nitrogen is produced and the transient exchange body is shut down. The invention will be described in greater detail by referring to the FIGURE which illustrates a process according to the invention. The apparatus used comprises three heat exchangers 1, 2 and 3 which may be brazed aluminum plate-fin exchangers. It also comprises a system of distillation columns 25, comprising at least one double distillation column. The double column comprises a first column operating at a first pressure and a second column operating at a second pressure lower than the first pressure. The apparatus comprises three air compressors, a main compressor, a first booster compressor for boosting a portion 13 of the air originating from the main compressor, a portion of the air from the first booster compressor feeding a turbine and a second booster compressor for boosting a portion 7 of the air originating from the first booster compressor, the second booster compressor being driven by the turbine. An air flow 5 at the first pressure is sent from the main compressor to the first column without having been boosted. The portion 7 of the air is at least partially condensed before being sent to the system of columns. The apparatus has at least two operating regimes. According to a first one of these regimes, which is the normal regime of the process, the air flow 5 at the first pressure is cooled in the exchanger 1 and sent to the first column where it is separated. A gaseous nitrogen flow 23 from the first column and a residual nitrogen flow 21 from the second column are heated in this first exchanger 1: the heat exchanger 1 allows exchange between three fluids. According to this regime, the second exchanger 2 does not receive any fluid to be cooled or to be heated. On the other hand, the third exchanger 3 cools air 7, 11 originating from the second booster compressor driven by the turbine. The partially condensed air 11 is sent to the system of columns 25. Also in this exchanger 3, air 13 from the first booster compressor is cooled and is sent at an intermediate temperature thereof to the turbine and then to the first or second column. The third exchanger heats residual nitrogen 17 originating from the second column and liquid oxygen 15 originating from the second column, after a pressurization step. The liquid oxygen 15 may be replaced by gaseous oxygen originating from the second column. During this regime, there is also production of cryogenic liquid as final product 27 which may be liquid nitrogen and/or liquid oxygen. During a second regime, referred to as a transient regime, the air flow 5 at the first pressure is cooled in the exchanger 1 and sent to the first column where it is separated. A residual nitrogen flow 21 from the second column is heated in this first exchanger 1: the heat exchanger 1 carries out exchange between two fluids only, the flow 23 no longer being sent to the exchanger 1, since the valve V1 is closed. According to this regime, the second exchanger 2 receives air 9, through a valve V2, originating from the second booster compressor and liquid nitrogen 19 pressurized by pump originating from the first column through the valve V3. On the other hand, the third exchanger 3 cools air 7, 11 originating from the second booster compressor driven by the turbine. The partially condensed air 11 is sent to the system of columns 25. Also in this exchanger 3, air 13 from the first booster compressor is cooled and is sent at an intermediate temperature thereof to the turbine, thus driving the second booster compressor, and then to the first or second column. The third exchanger heats residual nitrogen 17 originating from the second column and liquid oxygen 15 originating from the second column, after a pressurization step. The liquid oxygen 15 may be replaced by gaseous oxygen originating from the second column. During this regime, there is no production of liquid as final product or there is also a production of cryogenic liquid 27 as final product which may be liquid nitrogen and/or liquid oxygen, the total amount of liquid produced as final product being less than that produced during the normal regime. While the invention has been described in conjunction with specific embodiments thereof, it is evident that many alternatives, modifications, and variations will be apparent to those skilled in the art in light of the foregoing description. Accordingly, it is intended to embrace all such alternatives, modifications, and variations as fall within the spirit and broad scope of the appended claims. The present invention may suitably comprise, consist or consist essentially of the elements disclosed and may be practiced in the absence of an element not disclosed. Furthermore, if there is language referring to order, such as first and second, it should be understood in an exemplary sense and not in a limiting sense. For example, it can be recognized by those skilled in the art that certain steps can be combined into a single step. The singular forms “a”, “an” and “the” include plural referents, unless the context clearly dictates otherwise. “Comprising” in a claim is an open transitional term which means the subsequently identified claim elements are a nonexclusive listing (i.e., anything else may be additionally included and remain within the scope of “comprising”). “Comprising” as used herein may be replaced by the more limited transitional terms “consisting essentially of” and “consisting of” unless otherwise indicated herein. “Providing” in a claim is defined to mean furnishing, supplying, making available, or preparing something. The step may be performed by any actor in the absence of express language in the claim to the contrary. Optional or optionally means that the subsequently described event or circumstances may or may not occur. The description includes instances where the event or circumstance occurs and instances where it does not occur. Ranges may be expressed herein as from about one particular value, and/or to about another particular value. When such a range is expressed, it is to be understood that another embodiment is from the one particular value and/or to the other particular value, along with all combinations within said range. All references identified herein are each hereby incorporated by reference into this application in their entireties, as well as for the specific information for which each is cited. 1-10. (canceled) 11. A process for producing a first pressurized gas and also occasionally a second gas by cryogenic distillation of air in a double column comprising a first column and a second column, the second column operating at lower pressure than the first column, the process comprising a first regime and a second regime, wherein: i) according to the first regime, the process comprises the steps of: cooling a first air flow at a first pressure, which is substantially the operating pressure of the first column, in a first heat exchanger; sending the cooled first air flow to the first column; heating two nitrogen-rich gas flows originating from the first and second columns in the first exchanger, wherein none of the first air flow or the two nitrogen-rich gas flows are heated or cooled in a second heat exchanger; cooling at least one second air flow at a second pressure in a third heat exchanger, the second pressure being above the first pressure; vaporizing a pressurized liquid in the third exchanger; and heating a nitrogen-rich gas flow originating from the second column in the third exchanger, and ii) according to the second regime, the process comprises the steps of: cooling the first air flow at the first pressure in the first exchanger; sending the cooled first air flow to the first column; heating a nitrogen-rich gas flow originating from the second column in the first exchanger; heating and vaporizing a pressurized liquid flow originating from the double column in the second exchanger in order to form an occasionally required gas; cooling a third air flow at the second pressure in the second exchanger, wherein the third air flow and the pressurized liquid flow are the only fluids exchanging heat in the second exchanger, cooling the second air flow at the second pressure in the third exchanger; vaporizing the pressurized liquid in the third exchanger; and heating the nitrogen-rich gas flow originating from the second column in the third exchanger. 12. The process as claimed in claim 11, wherein the second regime further comprises the step of cooling a fourth air flow at a third pressure in the third exchanger, wherein the third pressure is above the first pressure. 13. The process as claimed in claim 12, wherein the third pressure is greater than the second pressure. 14. The process as claimed in claim 12, wherein fourth air flow is expanded in a turbine and sent to the first or second column. 15. The process as claimed in claim 14, wherein the flow sent to the turbine originates from a first booster compressor. 16. The process as claimed in claim 14, wherein the other one of the air flows at the pressure above the operating pressure of the first column originates from a second booster compressor driven by the turbine. 17. The process as claimed in claim 11, wherein, during the second regime, a single nitrogen-rich gas flow originating from the second column is heated in the first exchanger. 18. The process as claimed in claim 11, wherein an amount of liquid is produced as final product according to the first regime and no liquid is produced as final product according to the second regime. 19. The process as claimed in claim 11, wherein an amount of liquid is produced as final product according to the first regime and an amount of liquid smaller than that produced in the first regime is produced as final product according to the second regime. 20. The process as claimed in claim 11, wherein the pressurized liquid flow is rich in nitrogen. 21. A facility for separating air by cryogenic distillation, the facility comprising: a double column having a first column and a second column, the second column operating at lower pressure than the first column, a first heat exchanger; a second heat exchanger connected to feed ducts configured to enable an indirect heat exchange between only two fluids; a third heat exchanger; means for sending a first air flow at a first pressure substantially equal to the operating pressure of the first column to the first exchanger and from the first exchanger to the first column; means for dividing air at a second pressure above the first pressure into a first fraction and a second fraction; means for sending the first fraction at the second pressure to the second exchanger through a first one of the feed ducts; a valve configured to prevent the first fraction from being sent to the second exchanger; means for sending the second fraction at the second pressure to the third exchanger; means for sending a pressurized liquid from the double column to be vaporized in the third exchanger; means for sending an occasionally required liquid from the double column to be vaporized in the second exchanger through a second one of the feed ducts; a valve configured to prevent an occasionally required liquid from being sent from the double column to the second exchanger; means for sending a nitrogen-rich gas from the first column to be heated in the first exchanger; a valve (V1) configured to prevent nitrogen-rich gas from being sent from the first column to the first exchanger; means for sending a nitrogen-enriched gas from the double column to the first exchanger; and means for sending a nitrogen-enriched gas from the double column to the third exchanger. 22. The facility as claimed in claim 21, wherein at least the first and third heat exchangers are brazed aluminum plate-fin exchangers. 23. The facility as claimed in claim 21, further comprising means for sending a fourth air flow at a pressure above the first pressure to the third exchanger.

2013-08-28

en

2015-08-27

US-202016871236-A

Identifying software interaction defects using differential speed processors ABSTRACT Aspects of the invention include methods, systems and computer program products for identifying interaction software defects. Aspects include singly executing a first testcase at a normal processing speed and singly executing a second testcase at the normal processing speed. Aspects also include simultaneously executing the first testcase at a first processing speed and a second testcase at a second processing speed. Based on determining the single and simultaneous testcase results do not match, aspects further include creating an error notification. BACKGROUND The present invention generally relates to software testing, and more specifically, to identifying software defects using differential speed processors. Interaction defects are problems between programs that only occur under very specific circumstances. Interaction defects can be between independent programs or multiple instances of the same program that result in a program producing an incorrect result. A common example of an interaction defect is a race condition. In a race condition, multiple programs use the same area of memory, where depending on the sequencing sometimes all programs get correct results and other times one or more programs get incorrect results. These defects are difficult to discover and reproduce, as the system state has to be set very precisely, and the tester often cannot create the required system state. In the industry, testcases use techniques such as breakpoints to create precise system state to drive tests to detect interaction defects. With breakpoints, testcases can wait until a specific system state is reached and then resume execution. Testcases using breakpoints require testers have deep internal program knowledge. SUMMARY Embodiments of the present invention are directed to identifying software interaction defects using differential speed processors. A non-limiting example computer-implemented method includes singly executing a first testcase at a normal processing speed and singly executing a second testcase at the normal processing speed. The method also includes simultaneously executing the first testcase at a first processing speed and a second testcase at a second processing speed. Based on determining the single and simultaneous testcase results do not match, the method further includes creating an error notification. Other embodiments of the present invention implement features of the above-described method in computer systems and computer program products. Additional technical features and benefits are realized through the techniques of the present invention. Embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed subject matter. For a better understanding, refer to the detailed description and to the drawings. BRIEF DESCRIPTION OF THE DRAWINGS The specifics of the exclusive rights described herein are particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other features and advantages of the embodiments of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which: FIG. 1 depicts a block diagram of a system for identifying software interaction defects using differential speed processors according to one or more embodiments of the present invention; FIG. 2 depicts a flow diagram of a method for identifying software interaction defects using differential speed processors according to one or more embodiments of the present invention; FIG. 3 depicts a block diagram of an error notification according to one or more embodiments of the present invention; and FIG. 4 depicts a computer system according to one or more embodiments of the present invention. The diagrams depicted herein are illustrative. There can be many variations to the diagrams, or the operations described therein without departing from the spirit of the invention. For instance, the actions can be performed in a differing order or actions can be added, deleted or modified. Also, the term “coupled”, and variations thereof describes having a communications path between two elements and does not imply a direct connection between the elements with no intervening elements/connections between them. All of these variations are considered a part of the specification. DETAILED DESCRIPTION One or more embodiments of the present invention provide methods, systems, and computer program products for identifying software interaction defects using differential speed processors. In accordance with one or more embodiments of the present invention, the interactions between multiple computer programs are tested by executing programs at the same time on processors that are operating at different processing speeds. Executing the programs on processors that are operating at different processing speeds, along with CPU timeslicing for ready to run programs, increases the chances of detecting interaction defects. In addition, by using differential speed processors, problems can be found between any interacting computer programs under test. In exemplary embodiments, the interaction of multiple computer programs are tested by simultaneously executing the programs on different processors that are operating at different speeds. In one embodiment, the processors have different operating speeds. In another embodiment, the processors have the same operating speed, but inject no-op instructions into the processing pipeline of one of the processors to adjust the effective speed to the processor. For example, adding no-op instructions effectively decreases processor speed and removing no-op instructions effectively increases processor speed. Turning now to FIG. 1, a block diagram of a system 100 for identifying software interaction defects using differential speed processors is generally shown in accordance with one or more embodiments of the present invention. As illustrated, the system 100 includes a plurality of processors (Processor_1 102, Processor_2 104 through Processor_N 106). In one embodiment, the processors are separate processors. In another embodiment, the processors are different processing cores of a single processor. In exemplary embodiments, at least two of the processors are capable of executing instructions at different processing speeds. In one embodiment, the physical processing speed of at least two of the processors is different. In another embodiment, the physical processing speed of the processors is the same and the effective processing speed of the processors is capable of being adjusted using no-op instructions. The system 100 further includes a memory 108 that is configured to store one or more applications 110 consisting of one or more applications programs and testcases 111 consisting of one or more testcase programs to be executed by processors. In exemplary embodiments, testcases execute singly at normal processing speed to minimize interactions. Then multiple testcases are run simultaneously at different processing speeds to drive application program interactions. Singly and simultaneous testcase results are compared and any differences indicate an error has occurred. Turning now to FIG. 2, a flow diagram of a method 200 for identifying software interaction defects using differential speed processors is generally shown in accordance with one or more embodiments of the present invention. The method 200 shown in FIG. 2 may be executed by an operating system, such as Software 411 of FIG. 4, executing on a computer processor. The method 200 includes singly executing a first testcase at normal processing speed as shown in block 201 and singly executing a second testcase at normal processing speed as shown in block 202. Next, as shown at block 204, the method 200 includes simultaneously executing the first testcase at a first processing speed and the second testcase at a second processing speed. In exemplary embodiments, the first and second processing speeds are different from one another by at least 10%. The method 200 also includes detecting an error in the first or second testcases, as shown at decision block 206. In exemplary embodiments, error detection is performed for singly and simultaneously run testcases. In exemplary embodiments, testcase errors are detected from unexpected results, abnormal termination, or failure to complete. If decision block 206 detects a testcase error, the method 200 proceeds to block 208 and creates an error notification, such as the one shown in FIG. 3. If decision block 206 does not detect a testcase error, the singly and simultaneous testcase results are compared. Next, if decision block 212 determines the single and simultaneous testcase results match, method 200 proceeds to block 214 to modify the first or second processing speed and continues with block 204. However, if decision block 212 determines the single and simultaneous testcase results do not match, method 200 proceeds to block 208 and creates an error notification. In exemplary embodiments, the blocks 204, 206, 212, and 214 iterate for a test determined set of processor speeds or until completion or creation of an error notification in block 208. During each iteration, the first or second processing speed is varied at block 214. In one embodiment, the processing speeds used during each test are configured by a software tester. The flow diagram of FIG. 2 is not intended to indicate that the operations of method 200 are to be executed in any particular order, or that all of the operations of method 200 are to be included in every case. Additionally, method 200 can include any suitable number of additional operations. In one embodiment, when a software test is being performed at a system level, the operating system sets the processor speed based on the work being executed. In this embodiment, the operating system sets the processor speed for a testcase or application instance. In this embodiment, iterating changes the desired speed for testcases or application instances. In another embodiment, the operating system sets the processor speed on a per processor basis. In this embodiment, the operating system runs testcases or application instances on a processor running at the desired speed. In this embodiment, when iterating, testcases or application instances are moved to a different processor to run at the desired speed. Turning now to FIG. 3, a block diagram of an error notification 300 according to one or more embodiments of the present invention is shown. In an exemplary embodiment, the error notification 300 includes the error type detected 302. In this embodiment, the error type detected 302 includes unexpected results, abnormal termination, or failure to complete. In addition, the error type detected 302 includes an identification of the testcase associated with the error. Furthermore, the error notification 300 includes single and simultaneous testcase results in block 304 and single and simultaneous testcase testcase processing speeds in block 306. Turning now to FIG. 4, a computer system 400 is generally shown in accordance with an embodiment. The computer system 400 can be an electronic, computer framework comprising and/or employing any number and combination of computing devices and networks utilizing various communication technologies, as described herein. The computer system 400 can be easily scalable, extensible, and modular, with the ability to change to different services or reconfigure some features independently of others. The computer system 400 may be, for example, a server, desktop computer, laptop computer, tablet computer, or smartphone. In some examples, computer system 400 may be a cloud computing node. Computer system 400 may be described in the general context of computer system executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system 400 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices. As shown in FIG. 4, the computer system 400 has one or more central processors (CPU(s)) 401 a, 401 b, 401 c, etc. (collectively or generically referred to as processor(s) 401). The processors 401 can be a single-core processor, multi-core processor, computing cluster, or any number of other configurations. The processors 401, also referred to as processing circuits, are coupled via a system bus 402 to a system memory 403 and various other components. The system memory 403 can include a read only memory (ROM) 404 and a random access memory (RAM) 405. The ROM 404 is coupled to the system bus 402 and may include a basic input/output system (BIOS), which controls certain basic functions of the computer system 400. The RAM is read-write memory coupled to the system bus 402 for use by the processors 401. The system memory 403 provides temporary memory space for operations of said instructions during operation. The system memory 403 can include random access memory (RAM), read only memory, flash memory, or any other suitable memory systems. The computer system 400 comprises an input/output (I/O) adapter 406 and a communications adapter 407 coupled to the system bus 402. The I/O adapter 406 may be a small computer system interface (SCSI) adapter that communicates with a hard disk 408 and/or any other similar component. The I/O adapter 406 and the hard disk 408 are collectively referred to herein as a mass storage 410. Software 411 for execution on the computer system 400 may be stored in the mass storage 410. The mass storage 410 is an example of a tangible storage medium readable by the processors 401, where the software 411 is stored as instructions for execution by the processors 401 to cause the computer system 400 to operate, such as is described herein below with respect to the various Figures. Examples of computer program product and the execution of such instruction is discussed herein in more detail. The communications adapter 407 interconnects the system bus 402 with a network 412, which may be an outside network, enabling the computer system 400 to communicate with other such systems. In one embodiment, a portion of the system memory 403 and the mass storage 410 collectively store an operating system, which may be any appropriate operating system, such as the z/OS or AIX operating system from IBM Corporation, to coordinate the functions of the various components shown in FIG. 4. Additional input/output devices are shown as connected to the system bus 402 via a display adapter 415 and an interface adapter 416 and. In one embodiment, the adapters 406, 407, 415, and 416 may be connected to one or more I/O buses that are connected to the system bus 402 via an intermediate bus bridge (not shown). A display 419 (e.g., a screen or a display monitor) is connected to the system bus 402 by a display adapter 415, which may include a graphics controller to improve the performance of graphics intensive applications and a video controller. A keyboard 421, a mouse 422, a speaker 423, etc. can be interconnected to the system bus 402 via the interface adapter 416, which may include, for example, a Super I/O chip integrating multiple device adapters into a single integrated circuit. Suitable I/O buses for connecting peripheral devices such as hard disk controllers, network adapters, and graphics adapters typically include common protocols, such as the Peripheral Component Interconnect (PCI). Thus, as configured in FIG. 4, the computer system 400 includes processing capability in the form of the processors 401, and, storage capability including the system memory 403 and the mass storage 410, input means such as the keyboard 421 and the mouse 422, and output capability including the speaker 423 and the display 419. In some embodiments, the communications adapter 407 can transmit data using any suitable interface or protocol, such as the internet small computer system interface, among others. The network 412 may be a cellular network, a radio network, a wide area network (WAN), a local area network (LAN), or the Internet, among others. An external computing device may connect to the computer system 400 through the network 412. In some examples, an external computing device may be an external webserver or a cloud computing node. It is to be understood that the block diagram of FIG. 4 is not intended to indicate that the computer system 400 is to include all of the components shown in FIG. 4. Rather, the computer system 400 can include any appropriate fewer or additional components not illustrated in FIG. 4 (e.g., additional memory components, embedded controllers, modules, additional network interfaces, etc.). Further, the embodiments described herein with respect to computer system 400 may be implemented with any appropriate logic, wherein the logic, as referred to herein, can include any suitable hardware (e.g., a processor, an embedded controller, or an application specific integrated circuit, among others), software (e.g., an application, among others), firmware, or any suitable combination of hardware, software, and firmware, in various embodiments. Various embodiments of the invention are described herein with reference to the related drawings. Alternative embodiments of the invention can be devised without departing from the scope of this invention. Various connections and positional relationships (e.g., over, below, adjacent, etc.) are set forth between elements in the following description and in the drawings. These connections and/or positional relationships, unless specified otherwise, can be direct or indirect, and the present invention is not intended to be limiting in this respect. Accordingly, a coupling of entities can refer to either a direct or an indirect coupling, and a positional relationship between entities can be a direct or indirect positional relationship. Moreover, the various tasks and process steps described herein can be incorporated into a more comprehensive procedure or process having additional steps or functionality not described in detail herein. One or more of the methods described herein can be implemented with any or a combination of the following technologies, which are each well known in the art: a discreet logic circuit(s) having logic gates for implementing logic functions upon data signals, an application specific integrated circuit (ASIC) having appropriate combinational logic gates, a programmable gate array(s) (PGA), a field programmable gate array (FPGA), etc. For the sake of brevity, conventional techniques related to making and using aspects of the invention may or may not be described in detail herein. In particular, various aspects of computing systems and specific computer programs to implement the various technical features described herein are well known. Accordingly, in the interest of brevity, many conventional implementation details are only mentioned briefly herein or are omitted entirely without providing the well-known system and/or process details. In some embodiments, various functions or acts can take place at a given location and/or in connection with the operation of one or more apparatuses or systems. In some embodiments, a portion of a given function or act can be performed at a first device or location, and the remainder of the function or act can be performed at one or more additional devices or locations. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, element components, and/or groups thereof. The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The present disclosure has been presented for purposes of illustration and description but is not intended to be exhaustive or limited to the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the disclosure. The embodiments were chosen and described in order to best explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated. The diagrams depicted herein are illustrative. There can be many variations to the diagram or the steps (or operations) described therein without departing from the spirit of the disclosure. For instance, the actions can be performed in a differing order or actions can be added, deleted or modified. Also, the term “coupled” describes having a signal path between two elements and does not imply a direct connection between the elements with no intervening elements/connections therebetween. All of these variations are considered a part of the present disclosure. The following definitions and abbreviations are to be used for the interpretation of the claims and the specification. As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having,” “contains” or “containing,” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a composition, a mixture, process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but can include other elements not expressly listed or inherent to such composition, mixture, process, method, article, or apparatus. Additionally, the term “exemplary” is used herein to mean “serving as an example, instance or illustration.” Any embodiment or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or designs. The terms “at least one” and “one or more” are understood to include any integer number greater than or equal to one, i.e. one, two, three, four, etc. The terms “a plurality” are understood to include any integer number greater than or equal to two, i.e. two, three, four, five, etc. The term “connection” can include both an indirect “connection” and a direct “connection.” The terms “about,” “substantially,” “approximately,” and variations thereof, are intended to include the degree of error associated with measurement of the particular quantity based upon the equipment available at the time of filing the application. For example, “about” can include a range of ±8% or 5%, or 2% of a given value. The present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention. The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire. Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device. Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instruction by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention. Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions. These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks. The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks. The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions. The descriptions of the various embodiments of the present invention have been presented for purposes of illustration but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments described herein. What is claimed is: 1. A method for identifying interaction software defects, the method comprising: singly executing a first testcase at a normal processing speed; singly executing a second testcase at the normal processing speed; simultaneously executing the first testcase at a first processing speed and a second testcase at a second processing speed; and based on determining the single and simultaneous testcase results do not match, creating an error notification. 2. The method of claim 1, further comprising: based on determining the single and simultaneous testcase results match, simultaneously executing the first testcase at a third processing speed and the second testcase at a fourth processing speed; 3. The method of claim 1, wherein a processor speed is decreased by adding no-op instructions and the processor speed increased by removing no-op instructions. 4. The method of claim 1, wherein the first and second processing speeds are different. 5. The method of claim 1, wherein the first and second processing speeds are the same. 6. The method of claim 1, wherein application instances singly execute with normal processing speed and simultaneously execute with different processor speeds. 7. The method of claim 1, wherein single and simultaneous testcase errors create an error notification. 8. The method of claim 1, wherein creating the error notification includes at least one of: an error type detected and testcase identification; single and simultaneous testcase results; and single and simultaneous testcase processing speeds. 9. A system comprising: one or more processors for executing computer-readable instructions, the computer-readable instructions controlling the one or more processors to perform operations comprising: singly executing a first testcase at a normal processing speed; singly executing a second testcase at the normal processing speed; simultaneously executing the first testcase at a first processing speed and a second testcase at a second processing speed; and based on determining the single and simultaneous testcase results do not match, creating an error notification. 10. The system of claim 9, wherein the operations further comprise: based on determining the single and simultaneous testcase results match, simultaneously executing the first testcase at a third processing speed and the second testcase at a fourth processing speed; 11. The system of claim 9, wherein a processor speed is decreased by adding no-op instructions and the processor speed increased by removing no-op instructions. 12. The system of claim 9, wherein the first and second processing speeds are different. 13. The system of claim 9, wherein the first and second processing speeds are the same. 14. The system of claim 9, wherein application instances singly execute with normal processing speed and simultaneously execute with different processor speeds. 15. The system of claim 9, wherein single and simultaneous testcase errors create an error notification. 16. The system of claim 9, wherein creating the error notification includes at least one of: an error type detected and testcase identification; single and simultaneous testcase results; and single and simultaneous testcase processing speeds. 17. A computer program product comprising a computer-readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform operations comprising: singly executing a first testcase at a normal processing speed; singly executing a second testcase at the normal processing speed; simultaneously executing the first testcase at a first processing speed and a second testcase at a second processing speed; and based on determining the single and simultaneous testcase results do not match, creating an error notification. 18. The computer program product of claim 17, wherein the operations further comprise: based on determining the single and simultaneous testcase results match, simultaneously executing the first testcase at a third processing speed and the second testcase at a fourth processing speed; 19. The computer program product of claim 17, wherein a processor speed is decreased by adding no-op instructions and the processor speed increased by removing no-op instructions. 20. The computer program product of claim 17, wherein the first and second processing speeds are different.

2020-05-11

en

2021-11-11

US-201113025097-A

Display device ABSTRACT A display device is disclosed. The display device includes: a display panel including a display surface and a peripheral area surrounding the display surface, a transparent plate covering the display surface and the peripheral area, a resin layer disposed between the display panel and the transparent plate, and hardened by light, and a reflective layer provided between the transparent plate and the resin layer, along the peripheral area of the display panel. CROSS-REFERENCE TO RELATED APPLICATIONS This application claims priority to and the benefit of Korean Patent Application No. 10-2010-0030983 filed in the Korean Intellectual Property Office on Apr. 5, 2010, the entire contents of which are incorporated herein by reference. BACKGROUND 1. Field The disclosure relates generally to a display device including a transparent plate. 2. Description of the Related Technology A display device displays an image, and may be classified as a liquid crystal display device, a plasma display panel, or an organic light emitting diode (OLED) display according to the type of a display panel included in the display device. A display device generally has a transparent plate on a display panel placed in a receiving member to prevent interference to the display panel, and a resin layer is generally disposed between the display panel and the transparent plate to attach the display panel and the transparent plate to each other. In such devices, the resin layer is disposed between the display panel and the transparent plate to attach the display panel and the transparent plate to each other, and ultraviolet (UV) is irradiated to the resin layer through the transparent plate or irradiated between the display panel and the transparent plate from a side of the display device to harden the resin layer disposed between the display panel and the transparent plate. However, when disposing the resin layer between the display panel and the transparent plate, the resin layer is also disposed between the display panel and the receiving member. A black matrix is typically disposed in the transparent plate between the display panel and the receiving member. The black matrix prevents the display panel and the transparent plate from being viewed from the outside. The UV passed through the transparent plate for hardening the resin layer and the UV irradiated between the display panel and the transparent plate from the side of the display panel are irradiated only to the resin layer disposed between the display panel and the transparent plate. Accordingly the resin layer disposed between the display panel and the receiving member is not fully hardened because the UV is not irradiated thereto. The information disclosed in this section is only for enhancement of understanding of the background of the described technology. SUMMARY OF CERTAIN INVENTIVE ASPECTS The described technology has been made in an effort to provide a display device having a fully hardened resin layer disposed between a display panel and a transparent plate and a fully hardened resin layer disposed between a receiving member and the display panel. One aspect is a display device including: a display panel including a display surface and a peripheral area surrounding the display surface, a transparent plate covering the display surface and the peripheral area, a resin layer disposed between the display panel and the transparent plate, and hardened by light, and a reflective layer provided between the transparent plate and the resin layer, along the peripheral area of the display panel. The resin layer along the peripheral area may be configured to be hardened by the light reflected by the reflective layer. The display panel may further include a second reflective layer along the peripheral area, with the resin layer interposed between the reflective layer and the second reflective layer. The resin layer along the peripheral area may be configured to be hardened by the light reflected between the reflective layer and the second reflective layer. The transparent plate may further include a black matrix layer covered by the reflective layer. The display device may further include a receiving member receiving the display panel, where the receiving member includes a bottom portion facing the display panel and a sidewall extending upward from the bottom portion and facing an edge of the display panel, and where the resin layer is disposed between the edge of the display panel and the sidewall. The reflective layer may be wider than the second reflective layer, and the reflective layer may be disposed on the resin layer disposed between the edge of the display panel and the sidewall. The resin layer disposed between the edge of the display panel and the sidewall may be configured to be hardened by the light reflected by the reflective layer. The display panel may include liquid crystal or an organic light emitting element. The light may have a wavelength in the ultraviolet range. The reflective layer may be configured to reflect light beams incident to the reflective layer to an area between the sidewall and the edge of the display panel substantially filled with resin. Another aspect is a display device including: a display panel including a display surface and a peripheral area surrounding the display surface, a transparent plate covering the display surface and the peripheral area, a resin layer disposed between the display panel and the transparent plate, and hardened by light, a first reflective layer provided between the transparent plate and the resin layer, along the peripheral area of the display panel, a second reflective layer along the peripheral area of the display panel, with the resin layer interposed between the reflective layer and the second reflective layer. The resin layer may beconfigured to be hardened by the light reflected between the reflective layer and the second reflective layer. The transparent plate may further include a black matrix layer covered by the reflective layer. The display device may further include a receiving member receiving the display panel, where the receiving member includes a bottom portion facing the display panel and a sidewall extending upward from the bottom portion and facing an edge of the display panel, and where the resin layer is disposed between the edge of the display panel and the sidewall. The reflective layer may be wider than the second reflective layer, and the reflective layer is disposed on the resin layer disposed between the edge of the display panel and the sidewall. The resin layer disposed between the edge of the display panel and the sidewall may be configured to be hardened by the light reflected by the reflective layer. The display panel may include liquid crystal or an organic light emitting element. The light may have a wavelength in the ultraviolet range. The reflective layer and the second reflective layer may be configured to reflect light beams incident to the reflective layer and the second reflective layer to an area between the sidewall and the edge of the display panel substantially filled with resin. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a perspective view of an embodiment of a display device. FIG. 2 is a cross-sectional view of FIG. 1, taken along line II-II. FIG. 3 is a cross-sectional view of a path of light for hardening a resin layer of the embodiment of a display device of FIG. 2. FIG. 4 is a perspective view of another embodiment of a display device. FIG. 5 is a cross-sectional view of FIG. 4, taken along line V-V. FIG. 6 is a cross-sectional view of a path of light for hardening a resin layer of the embodiment of a display device of FIG. 5. DETAILED DESCRIPTION OF CERTAIN INVENTIVE EMBODIMENTS Embodiments of the present invention will be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments of the invention are shown. As those skilled in the art would realize, the described embodiments may be modified in various ways, without departing from the spirit or scope of the present invention. The drawings and description are to be regarded as illustrative in nature and not restrictive. Like reference numerals generally designate like elements throughout the disclosure. Constituent elements having the same structures throughout the embodiments are generally denoted by the same reference numerals and are described in a first exemplary embodiment. In the subsequent exemplary embodiments, such description is not repeated. In the drawings, the sizes and thicknesses of the components are merely shown for convenience of explanation, and therefore embodiments are not necessarily limited to the illustrations described and shown herein. In the drawings, the thicknesses of layers, films, panels, regions, and the like, are exaggerated for clarity. In the drawings, the thicknesses of some layers and areas are exaggerated for convenience of explanation. When it is described that one element such as a layer, a film, an area, a plate, and the like is formed on another element, it means that one element exists right on another element or that one element exists on another element with a further element therebetween. Throughout this specification and the claims that follow, unless explicitly described to the contrary, the word “comprise” and variations such as “comprises” or “comprising” will be understood to imply the inclusion of stated elements but not the exclusion of any other elements. Throughout this specification, it is understood that the term “on” and similar terms are used generally and are not necessarily related to a gravitational reference. Hereinafter, a display device 1001 according to a first exemplary embodiment will be described with reference to FIG. 1 and FIG. 2. The display device 1001 of the first exemplary embodiment is exemplarily described as a liquid crystal display (LCD), but a display device according to another exemplary embodiment may be an organic light emitting diode (OLED) display having a transparent plate, or a plasma display panel. FIG. 1 is an exploded perspective view of an embodiment of a display device. FIG. 2 is a cross-sectional view of FIG. 1, taken along line II-II. As shown in FIG. 1 and FIG. 2, the display device 1001 according to a first exemplary embodiment includes a display panel 100, a transparent plate 200, a resin layer 300, a backlight unit 400, and a receiving member 500. The display panel 100 includes liquid crystal, and displays an image using light irradiated from the backlight unit 400. The display panel 100 includes substrates facing each other, and liquid crystal is disposed between the facing substrates. Wires are formed in at least one of the facing substrates and the liquid crystal moves by a magnetic field generated by the wires such that an image is displayed on the display panel 100 by controlling the amount of light irradiated to the display panel 100 to the backlight unit 400. A polarizing plate that changes a polarization axis of the light irradiated to the display panel 100, or passed through the display panel 100 and then emitted to the outside, may be attached to a front side or a rear side of the display panel 100. The display panel 100 includes a display area 110 for displaying an image and a peripheral area 120 neighboring the display area 110. In one embodiment, the peripheral area 120 of the display panel 100 surrounds the display area 110. The transparent plate 200 is disposed on the display panel 100, with the resin layer 300 interposed therebetween. The transparent plate 200 includes a transparent plate main body 210 facing the display panel 100, a black matrix layer 220, and a first reflective layer 230. The transparent plate main body 210 may be made of a transparent material such as glass, resin, or the like, and protects the display panel 100 from external impact. The transparent plate main body 210 faces the display panel 100 on the display panel 100, and covers the display area 110 and the peripheral area 120 of the display panel 100. The transparent plate main body 210 is attached to the display panel 100 by the resin layer 300 disposed between the display panel 100 and the transparent plate 200, and improves impact resistance of the display device 1001 by protecting the display panel 100 along with the resin layer 300. In one embodiment, the transparent plate main body 210 is larger than the display panel 100. In other embodiments, the transparent plate 200 may be substantially equivalent to the display panel 100 in size. The black matrix layer 220 is covered by the first reflective layer 230 corresponding thereto, and faces the resin layer 300 interposed by the first reflective layer 230. The black matrix layer 220 may be formed in a shape corresponding to the peripheral area 120 of the display panel 100, and may prevent the peripheral area 120 and a receiving member 500 of the display panel 100 to be viewed from the outside. The black matrix layer 220 includes a light absorbing material such as chromium (Cr), for example. The first reflective layer 230 may be disposed between the black matrix layer 220 and the resin layer 300, and may be formed in a shape corresponding to the peripheral area 120 of the display panel 100. In some embodiments, the first reflective layer 230 may be formed in a shape that is substantially equivalent to the black matrix layer 220, and the first reflective layer 230 and the black matrix layer 220 may be integrally formed. The first reflective layer 230 faces the resin layer 300, and may include a metal having high reflectivity such as aluminum (Al), for example. The first reflective layer 230 may also include various light-reflective metals such as silver (Ag), iron (Fe), and the like, and may also include various organic or inorganic material of which the surface is processed to be high reflective. The first reflective layer 230 reflects the light irradiated thereto to a direction of the resin layer 300, and the resin layer 300 that faces the first reflective layer and corresponds to the peripheral area 120 of the display panel 100 is hardened by the light reflected by the first reflective layer 230. The first reflective layer 230 is disposed on the resin layer 300 that is disposed between the display panel 100 and the receiving member 500, and accordingly, the resin layer 300 is hardened by the light reflected by the first reflective layer 230. Hardening of the resin layer 300 facing the first reflective layer 230 is described below. The resin layer 300 surrounds the display panel, and is located between the display panel 100 and the transparent plate 200, and between display panel 100 and the receiving member 500. The resin layer 300 surrounds the display panel 100 so that an air gap is not formed between the display panel 100 and the transparent plate 200 and between the display panel 100 and the receiving member 500, and so that a foreign particle like dust cannot be inserted between the display panel 100 and the transparent plate 200 and between the display panel 100 and the receiving member 500. Accordingly, distortion of an image displayed on the display panel 100 due to an air gap or foreign particle can be prevented. The resin layer 300 also attaches the transparent plate 200 to the display panel 100 to protect the display panel 100 and the transparent plate 200 and to improve impact resistance of the display device 1001. The resin layer 300 is hardened with light having a UV wavelength by including a UV hardened resin, and the resin layer 300 disposed between the display panel 100 and the receiving member 500 is hardened with light reflected by the first reflective layer 230. The hardening of the resin layer 300 disposed between the display panel 100 and the receiving member 500 with the light reflected by the first reflective layer 230 is described below. The backlight unit 400 irradiates light to the display panel 100, and includes a light emitting unit 410, a light guiding plate 420, an optical sheet 430, and a reflective sheet 440. The light emitting unit 410 generates light, and is located along the edge of the light guiding plate 420. The light generated from the light emitting unit 410 is irradiated to the light guiding plate 420, and the light emitted to the light guiding plate 420 is irradiated to a direction of the display panel 100 by the light guiding plate 420. The light emitting unit 410 may be a dot light source, a linear light source, or the like. The light irradiated from the light emitting unit 410 is converted into a surface light source and then irradiated to a direction of the display panel 100. The light guiding plate 420 is disposed between the optical sheet 430 and the reflective sheet 440, and converts the light irradiated from light emitting unit 410 to a surface light source and irradiates the converted light to the display panel 100. The optical sheet 430 deforms the light irradiated from the light guiding plate 420 to improve the display quality of an image realized by the display panel 100. The optical sheet 430 may include a diffusion sheet, a prism sheet, and a protection sheet. The reflective sheet 440 is disposed between the light guiding plate 420 and the receiving member 500, and reflects the light passed through the light guiding plate 420 and irradiated to the reflective sheet 440 back to the light guiding plate 420 so as to reflect light emitted from the light emitting unit 410 and passed through the light guiding plate 420, to the display panel 100. One embodiment of the display device 1001 may further include a mould frame supporting the backlight unit 400. The display panel 100, the backlight unit 400, and the mould frame may be received in the receiving member 500. The receiving member 500 receives the display panel 100 and the backlight unit 400, and may be formed with a material that is stronger than the transparent plate 200. In some embodiments, the receiving member 500 may be made of a metal such as stainless steel, cold-rolled steel plate, an aluminum-nickel-silver alloy, or the like. A bottom portion 510 may have a plate shape, may face the display panel 100, and the backlight unit 400 disposed on the bottom portion 510 may be interposed therebetween. A barrier rib (or a sidewall) 520 is bent to extend upwards from the bottom portion 510. The barrier rib (or sidewall) 520 is bent to extend from the bottom portion 510 and faces an edge 130 of the display panel 100, with the resin layer 300 interposed therebetween. The resin layer 300 is disposed between the barrier rib 520 and the display panel 100. The resin layer supports the display panel 100 with respect to the receiving member 500. In addition, wires formed in the display panel 100 and the barrier rib 520 can be prevented from being short-circuited by interposing the resin layer 300 between the barrier rib 520 and the display panel 100. Hereinafter, hardening of the resin layer 300 by light will be described in further detail with reference to FIG. 3. FIG. 3 is a cross-sectional view of a path of light for hardening the resin layer of the embodiment of the display device of FIG. 2. As shown in FIG. 3, an embodiment of the display device 1001 irradiates a first light L1, having a UV wavelength, through the transparent plate 200 of the display device 1001 to the resin layer 300 disposed between the transparent plate 200 and the display panel 100 to fully harden the resin layer 300 disposed between the transparent plate 200 and the display panel 100. In The first light L1 is blocked by the black matrix layer 220 corresponding to the peripheral area 120 of the display panel 100 so that only the resin layer 300 corresponding to the display area 110 of the display panel 100 is fully hardened. In order to fully harden the resin layer 300 corresponding to the peripheral area 120 of the display panel 100, a second light L2 having a UV wavelength is irradiated between the display panel 100 and the transparent plate 200 from a side of the display device 1001. The second light L2 is reflected by the first reflective layer 230 so that the resin layer 300 corresponding to the peripheral area 120 of the display panel 100 is fully hardened. The second light L2 is reflected by the first reflective layer 230 and irradiated between the edge 130 of the display panel 100 and the barrier rib (or sidewall) 520 of the receiving member 500, and the resin layer 300 disposed between the edge 130 of the display panel 100 and the barrier rib 520 of the receiving member 500 is fully hardened by the light reflected by the first reflective layer 230 and irradiated between the edge 130 of the display panel 100 and the barrier rib 520 of the receiving member 500. In an embodiment of the display device 1001, all the resin layers 300 surrounding the display panel 100 are fully hardened so that adhesiveness of the transparent plate 200 to the display panel 100 is enhanced and the adhesiveness of the display panel 100 to the receiving member 500 is also enhanced. Accordingly, impact resistance of the display device 1001 is enhanced. Since all the resin layers 300 surrounding the display panel 100 are fully hardened in the display device 1001, occurrence of image distortion caused by stains or spots formed in the resin layer 300 may be prevented. In one embodiment of the display device 1001, the resin layer 300 surrounds the display panel 100 so that generation of air gaps between the display panel 100 and the transparent plate 200 and between the display panel 100 and the receiving member 500 can be prevented. Insertion of foreign particles between the display panel 100 and the transparent plate 200 and between the display panel 100 and the receiving member 500 may also be prevented. Accordingly, the image displayed on the display panel 100 is prevented from being distorted due to an air gap or a foreign particle. In one embodiment of the display device 1001, the resin layer 300 is hardened while the display panel 100 is in the receiving member 500, such that it is not necessary to harden the resin layer 300 before the display panel 100 is in the receiving member 500, and accordingly convenience of the process is enhanced. In order to harden the resin layer 300 before the display panel 100 is received in the receiving member 500, an additional process is generally performed to mechanically cut or add the resin layer 300 to fit it into the receiving space of the receiving member 500. Hereinafter, another embodiment of a display device 1002 will be described with reference to FIG. 4 and FIG. 5. The embodiment of the display device 1002 will be exemplarily described as an OLED display. FIG. 4 is a perspective view of another embodiment of the display device. FIG. 5 is a cross-sectional view taken along line V-V of FIG. 4. As shown in FIG. 4 and FIG. 5, the embodiment of the display device 1002 includes a display panel 102, transparent plate 200, a resin layer 300, and a receiving member 500. The display panel 102 includes an organic light emitting element, and displays an image using a self-light emission capability of the organic light emitting element. The display panel 102 includes substrates facing each other, and the organic light emitting element is interposed between the facing substrates. Wires are formed in at least one of the facing substrates, and the organic light emitting element emits light such that an image is displayed on the display panel 102. A polarizing plate that converts a polarization axis of light irradiated from the display panel 102 may be attached to a front side of the display panel 102. In some embodiments, the display panel 102 includes a display area 110 displaying an image and a peripheral area 120 surrounding the display area 110. The display panel 102 includes a second reflective layer 140 that corresponds to the peripheral area 120 and faces the first reflective layer 230 with a resin layer 300 interposed therebetween. The second reflective layer 140 faces the first reflective layer 230, and has a shape that corresponds to the peripheral area 120 of the display panel 102. In some embodiments, the second reflective layer 140 may include a metal having high reflectivity, such as aluminum (Al), or the like. In other embodiments, the second reflective layer 140 may include various metals that can reflect light, such as silver (Ag), iron (Fe), and the like, and may include an organic or inorganic material of which a surface is processed to be high reflective. The second reflective layer 140 reflects light irradiated to the second reflective layer 140 to a direction of the resin layer 300, and the resin layer 300 facing the second reflective layer 140 is hardened by the light reflected by the second reflective layer 140. The width of the first reflective layer 230 may be formed to be larger than that of the second reflective layer 140, and the light reflected by the second reflective layer 140 is thus irradiated back to the second reflective layer 140 by the first reflective layer 230 so that light reflection is performed between the second reflective layer 140 and the first reflective layer 230. Thus, the resin layer 300 corresponding to the peripheral area 120 of the display panel 102 disposed between the second reflective layer 140 and the first reflective layer 230 is fully hardened by the light reflected between the second reflective layer 140 and the first reflective layer 230. The hardening of the resin layer 300 disposed between the second reflective layer 140 and the first reflective layer 230 is described below. The hardening of the resin layer 300 will now be described in further detail with reference to FIG. 6. FIG. 6 is a cross-sectional view of a path of light for hardening the resin layer of the embodiment of a display device of FIG. 5. As shown in FIG. 6, in order to harden the resin layer 300 included in the display device 1001, an embodiment of the display device 1002 irradiates a first light L1, having a UV wavelength, through the transparent plate 200 of the display device 1001 to fully harden the resin layer 300 disposed between the transparent plate 200 and the display panel 102. In one embodiment, the resin layer 300 corresponding to the display area 110 of the display panel 102 is fully hardened by the first light L1 passed through the transparent plate 200, and the resin layer 300 corresponding to the peripheral area 120 of the display panel is fully hardened by the first light L1 reflected between the second reflective layer 140 and the first reflective layer 230. In addition, the first light L1 reflected between the second reflective layer 140 and the first reflective layer 230 is reflected back between the edge 130 of the display panel 102 and the barrier rib (or sidewall) 520 of the receiving member 500, by the first reflective layer 230 corresponding the edge 130 of the display panel 102 and the barrier rib 520 of the receiving member 500. Accordingly, the resin layer 300 disposed between the edge 130 of the display panel 102 and the barrier rib 520 of the receiving member 500 is fully hardened. The first light L1 passed through the transparent plate 200 is reflected between the first reflective layer 230 and the second reflective layer 140 so that the resin layer 300 disposed between the display panel 102 and the transparent plate 200 is fully hardened. The first light L1 is reflected back to the first reflective layer 230 so that the resin layer 300 disposed between the edge 130 of the display panel 102 and the receiving member 500 is hardened, and all the resin layers 300 surrounding the display panel 102 are thus fully hardened. When a second light L2, having a UV wavelength, is irradiated between the display panel 102 and the transparent plate 200 from a side of the display device 1002, the second light L2 is directly irradiated between the display panel 102 and the transparent plate 200 and is also reflected by the first reflective layer 230 or the second reflective layer 140. The second light L2 is reflected between the first and second reflective layers 230 and 140 such that the resin layer 300 disposed between the display panel 102 and the transparent plate 200 is fully hardened. The resin layer 300 disposed between the edge 130 of the display panel 102 and the barrier rib (or sidewall) 520 of the receiving member 500 is fully hardened by the second light L2 reflected by the first reflective layer 230 corresponding between the edge 130 of the display panel 102 and the barrier rib 520 of the receiving member 500 and then irradiated between the edge 130 of the display panel 102 and the barrier rib 520 of the receiving member 500. The second light L2 irradiated between the display panel 102 and the transparent plate 200 is reflected between the first reflective layer 230 and the second reflective layer 140 so that the resin layer 300 disposed between the display panel 102 and the transparent plate 200 is fully hardened. The second light L2 is reflected back to the first reflectively layer 230 so that the resin layer 300 disposed between the edge 130 of the display panel 102 and the barrier rib (or sidewall) 520 of the receiving member 500 is fully hardened such that all the resin layers 300 surrounding the display panel 102 are fully hardened. An embodiment of the display device 1002 fully hardens all the resin layers 300 surrounding the display panel 102 using at least one of the first and second lights L1 and L2, and all the resin layers 300 can be fully hardened more promptly when using the first and second lights L1 and L2 both. With the resin layers 300 surrounding the display panel 102 fully hardened, the adhesiveness of the transparent plate 200 to the display panel 102 is enhanced and, the adhesiveness of the display panel 102 to the receiving member 500 is also enhanced. Accordingly, the impact resistance of the display device 1002 is enhanced. Since all the resin layers 300 surrounding the display panel 102 are hardened in the display device 1002, image distortion that occurs due to stains or spots that may be generated in a resin layer that is not fully hardened may be prevented. Since the resin layer 300 surrounds the display panel 102 in the display device 1002, generation of air gaps between the display panel 102 and the transparent plate 200 and between the display panel 102 and the receiving member 500 may be prevented. Insertion of foreign particles between the display panel 102 and the transparent plate 200 and between the display panel 102 and the receiving member 500 may also be prevented. Therefore, distortion of the image displayed on the display panel 102 due to the air gap or foreign particles may be prevented. In some embodiments, the first and second reflective layers 230 and 140 have a plane shape. In some embodiments, at least a part of each of the first and second reflective layers 230 and 240 may be formed in a curved shape or with protrusions and depressions, in order to set a path of light reflected by the first and second reflective layers 230 and 140. While this disclosure has been described in connection with what certain exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims. 1. A display device comprising: a display panel including a display surface and a peripheral area surrounding the display surface; a transparent plate covering the display surface and the peripheral area; a resin layer disposed between the display panel and the transparent plate, and hardened by light; and a reflective layer provided between the transparent plate and the resin layer, along the peripheral area of the display panel. 2. The display device of claim 1, wherein the resin layer along the peripheral area is configured to be hardened by the light reflected by the reflective layer. 3. The display device of claim 1, wherein the display panel further comprises a second reflective layer along the peripheral area, with the resin layer interposed between the reflective layer and the second reflective layer. 4. The display device of claim 3, wherein the resin layer along the peripheral area is configured to be hardened by the light reflected between the reflective layer and the second reflective layer. 5. The display device of claim 4, wherein the transparent plate further comprises a black matrix layer covered by the reflective layer. 6. The display device of claim 5, further comprising a receiving member receiving the display panel, wherein the receiving member comprises a bottom portion facing the display panel and a sidewall extending upward from the bottom portion and facing an edge of the display panel, and wherein the resin layer is disposed between the edge of the display panel and the sidewall. 7. The display device of claim 6, wherein the reflective layer is wider than the second reflective layer, and the reflective layer is disposed on the resin layer disposed between the edge of the display panel and the sidewall. 8. The display device of claim 7, wherein the resin layer disposed between the edge of the display panel and the sidewall is configured to be hardened by the light reflected by the reflective layer. 9. The display device of claim 1, wherein the display panel comprises liquid crystal or an organic light emitting element. 10. The display device of claim 9, wherein the light has a wavelength in the ultraviolet range. 11. The display device of claim 6, wherein the reflective layer is configured to reflect light beams incident to the reflective layer to an area between the sidewall and the edge of the display panel substantially filled with resin. 12. A display device comprising: a display panel including a display surface and a peripheral area surrounding the display surface; a transparent plate covering the display surface and the peripheral area; a resin layer disposed between the display panel and the transparent plate, and hardened by light; a first reflective layer provided between the transparent plate and the resin layer, along the peripheral area of the display panel; a second reflective layer along the peripheral area of the display panel, with the resin layer interposed between the reflective layer and the second reflective layer. 13. The display device of claim 12, wherein the resin layer is configured to be hardened by the light reflected between the reflective layer and the second reflective layer. 14. The display device of claim 12, wherein the transparent plate further comprises a black matrix layer covered by the reflective layer. 15. The display device of claim 14, further comprising a receiving member receiving the display panel, wherein the receiving member comprises a bottom portion facing the display panel and a sidewall extending upward from the bottom portion and facing an edge of the display panel, and wherein the resin layer is disposed between the edge of the display panel and the sidewall. 16. The display device of claim 15, wherein the reflective layer is wider than the second reflective layer, and the reflective layer is disposed on the resin layer disposed between the edge of the display panel and the sidewall. 17. The display device of claim 16, wherein the resin layer disposed between the edge of the display panel and the sidewall is configured to be hardened by the light reflected by the reflective layer. 18. The display device of claim 12, wherein the display panel comprises liquid crystal or an organic light emitting element. 19. The display device of claim 18, wherein the light has a wavelength in the ultraviolet range. 20. The display device of claim 12, wherein the reflective layer and the second reflective layer are configured to reflect light beams incident to the reflective layer and the second reflective layer to an area between the sidewall and the edge of the display panel substantially filled with resin.

2011-02-10

en

2011-10-06

US-201915733663-A

Malware infection prediction ABSTRACT A computer implemented method of protecting a target subnet in a hierarchy of subnets of a computer network from malware attack, the subnet including a set of network connected devices, the method including generating a dynamical system for each subnet in the network, each dynamical system modelling a rate of change of a number of network connected devices in the subnet that are: susceptible to infection by the malware; infected by the malware; protected against infection by the malware; and remediated of infection by the malware, the dynamical systems being based on rates of transmission of the malware between pairs of subnets; evaluating a measure of risk of infection of the target subnet at a predetermined point in time based on the dynamical system for the target subnet; and responsive to the measure of risk meeting a predetermined threshold, deploying malware protection measures to devices in the target subnet. PRIORITY CLAIM The present application is a National Phase entry of PCT Application No. PCT/EP2019/056887, filed Mar. 19, 2019, which claims priority from European Application No. 18163823.0, filed Mar. 25, 2018, each of which is hereby fully incorporated herein by reference. TECHNICAL FIELD The present disclosure relates to the detection of malware in computer systems. In particular, it relates to a prediction of occurrences of malware infection. BACKGROUND Malware detection technology is typically implemented on a per-system basis with communication between systems on the realization of a threat or attack. For example, organizations implement standard malware detection technology installed in or for each system, appliance or resource connected to an intranet. Such approaches suffer the disadvantage of reliance on speed of communication, speed of update of malware detection rules and speed of implementation of those rules to effectively respond to a malware attack. SUMMARY Accordingly, it would be beneficial to mitigate these disadvantages. The present disclosure accordingly provides, in a first aspect, a computer implemented method of protecting a target subnet in a hierarchy of subnets of a computer network from malware attack, the subnet including a set of network connected devices, the method comprising: generating a dynamical system for each subnet in the network, each dynamical system modelling a rate of change of a number of network connected devices in the subnet that are: susceptible to infection by the malware; infected by the malware; protected against infection by the malware; and remediated of infection by the malware, the dynamical systems being based on rates of transmission of the malware between pairs of subnets; evaluating a measure of risk of infection of the target subnet at a predetermined point in time based on the dynamical system for the target subnet; and responsive to the measure of risk meeting a predetermined threshold, deploying malware protection measures to devices in the target subnet. In some embodiments , the predetermined point in time is determined based on a time required to deploy the malware protection measures to all susceptible devices in the subnet. In some embodiments , the protective measures include modifications to devices in the target subnet such that susceptible devices in the target subnet are rendered insusceptible to the malware. In some embodiments , the protective measures include remediation measures to devices infected by the malware in the target subnet. The present disclosure accordingly provides, in a third aspect, a computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the method set out above. BRIEF DESCRIPTION OF THE DRAWINGS Embodiments of the present disclosure will now be described, by way of example only, with reference to the accompanying drawings, in which: FIG. 1 is a block diagram a computer system suitable for the operation of embodiments of the present disclosure. FIG. 2 is a component diagram of an arrangement for a network protector to protect a target subnet of a computer network in accordance with embodiments of the present disclosure. FIG. 3 is a flowchart of a method of protecting the target subnet in accordance with embodiments of the present disclosure. FIG. 4 is a component diagram of an arrangement for a network protector to protect a portion of a computer network in accordance with embodiments of the present disclosure. FIG. 5 is a flowchart of a method for protecting a portion of a computer network in accordance with embodiments of the present disclosure. FIG. 6 is a flowchart of an alternative method for protecting a portion of a computer network in accordance with embodiments of the present disclosure. DETAILED DESCRIPTION Embodiments of the present disclosure provide protection against malware attacks on a per-subnet basis in which a subnet is a subnetwork as a logical subdivision of an IP network as is well known in the art. Network connected devices are associated with a subnet in a computer network by a common identifier in a portion of their network address. In internet protocol (IP) version 4 addressing, a subnet is identified in a group of most significant bits of an IP address, the particular set of bits being characterized by a subnet mask as is known to those skilled in the art. Subnets can be modeled organized hierarchically such that a network is organized divided into subnets that can themselves be further subdivided into further subnets. Thus, subnets can be represented by a tree structure of subnets, each node in the tree structure corresponding to a subnet, and each node having a parent node save for a root node for the tree. Embodiments of the present disclosure take advantage of a model of relationships between subnets as a tree of subnets to predict the transmission and infection of devices in subnets by malicious software as malware. In particular, the transmission and cross-infection between subnets directly linked in the hierarchy of subnets is known to occur with a higher likelihood and at a higher rate than transmission and cross-infection between hierarchically distant subnets. Embodiments of the present disclosure employ a model of each subnet as a dynamical system to determine a rate of change of a number of network devices in a subnet that are: susceptible to infection by the malware; infected by the malware; protected against infection by the malware; and remediated of infection by the malware. Each dynamical system is a function describing the time dependence of each parameter, such as a differential equation as is known in the art. Employing such dynamical systems it is possible to determine, for a point in time, a risk or likelihood of infection of devices in a particular subnet in the hierarchy. Furthermore, such risk information can be used to mitigate, prevent or alleviate the prospect of such infection by deployment of malware protection measures such as anti-malware services or remediations, rectifications and/or removal of vulnerabilities relied upon by the malware. Furthermore, such risk information can be used to identify subnets in a network being at lower risk of infection at a point in time and, therefore, subnets for which protective measures are to be prioritized of with which communication is to be prevented to provide a barrier to propagation of the malware. FIG. 1 is a block diagram of a computer system suitable for the operation of embodiments of the present disclosure. A central processor unit (CPU) 102 is communicatively connected to a storage 104 and an input/output (I/O) interface 106 via a data bus 108. The storage 104 can be any read/write storage device such as a random access memory (RAM) or a non-volatile storage device. An example of a non-volatile storage device includes a disk or tape storage device. The I/O interface 106 is an interface to devices for the input or output of data, or for both input and output of data. Examples of I/O devices connectable to I/O interface 106 include a keyboard, a mouse, a display (such as a monitor) and a network connection. FIG. 2 is a component diagram of an arrangement for a network protector 200 to protect a target subnet of a computer network 202 in accordance with embodiments of the present disclosure. The network protector 200 is a software, hardware, firmware or combination component for protecting a target subnet in the network 202. The network 202 is comprised of a plurality of subnets each having network connected devices and each being organized hierarchically and represented as a tree data structure having a node per subnet with each node having a parent save for the root node of the tree. Thus, subnets identified as A through M are provided. For example, in practice, subnet A could be represented by IP addresses starting 10.xxx.xxx.xxx with subnet B being represented by IP addresses starting 10.102.xxx.xxx and subnet C being represented by IP addresses starting 10.103.xxx.xxx. Such subnet addressing is familiar to those skilled in the art. The network protector 200 generates a dynamical system for each subnet in the network 202 to provide a set of dynamical systems 204. Thus, the dynamical systems 204 illustrated in FIG. 2 with broken lines correspond each to the subnets in the network 202. Each dynamical system models a rate of change of a number of network connected devices in a subnet that are: susceptible to infection by the malware; infected by the malware; protected against infection by the malware; and remediated of infection by the malware, the dynamical systems being based on rates of transmission of the malware between pairs of subnets. In embodiments of the present disclosure , network devices in each subnet are monitored and protected by anti-malware software. The anti-malware software provides for the detection of infected devices and therefore a number of infected devices can be determined at any specific point in time period. For each detected malware, a time series of infected devices can be modelled using dynamical systems covering all subnets. For each subnet, a dynamical system is built to model malware propagation. For n subnets, there are n interactive dynamical systems to model the propagation over the whole computer network 202. For an arbitrary subnet i, a dynamical system is built as a suite of differential equations for constituting the dynamical system for subnet i from the set of n subnets. A dynamical system describes a system's change over a period of time and models changes of the status of network connected devices in the network 202. In one exemplary embodiment, devices can have one of four statuses: a status of “susceptible” meaning the device is not immune from infection by the malware; a status of “infected” or “infectious” meaning the device is currently infected by the malware and may be involved in, or a source of, propagation of the malware; a status of “protected” or “vaccinated” meaning the device has been remediated, patched or otherwise made immune to infection by the malware; and a status of “recovered” which means the device which has formerly been infected has been disinfected, cleaned or rebuilt and is no longer infected. Once one or several network connected devices are infected by a specific malware, the infection force pushes a proportion of the susceptible devices to be infectious; meanwhile vaccination force pushes a proportion of the susceptible devices to be immune to the infection; and recovery force pushes a proportion of infectious devices to be recovered from the infection. Exemplary equations (1) to (5) for a dynamical system for a subnet i are provided below: where: C1 is a number of network connected devices in subnet i; Rji is a transmission rate of the malware between subnets i and j; Ij is a number of devices in subnet j infected by malware; Si is a number of devices in subnet i susceptible to infection by the malware; Vi is a rate at which devices in subnet i can be protected from the malware (i.e. a vaccination rate); Yi is a rate of recovery of infected devices in subnet i; Ai is a number of vaccinated devices in subnet i; Bi is a number of recovered devices in subnet i; and Xi is a total number of network connected devices in subnet i. Thus: dSi/dt is a differential equation for the rate of change of a number of susceptible devices in subnet i over time; dIi/dt is a differential equation for the rate of change of a number of infected devices in subnet i over time; dAi/dt is a differential equation for the rate of change of a number of vaccinated devices in subnet i over time; and thus, dBi/dt is a differential equation for the rate of change of a number of recovered devices in subnet i over time. Each dynamical system contains a mathematical term which models the malware transmission between devices within the same subnet and the malware transmission between devices from different subnets. The transmission rate among the devices within the same subnet and the transmission rate between devices from different subnets can be determined by a scale difference between them in terms of the hierarchy of subnets which reflects how likely a malware is to be transmitted from one device to another. The transmission rate among the devices within the same subnet can be set as a base transmission rate. The transmission rate between devices in different subnets can be defined to be proportional to the base transmission rate. The proportion can be determined by a kernel function which contains a scale difference between different subnets: Rij=base transmission rate×kernel function The Kernel function can be a scaling and bounding function which utilizes the hierarchical model of subnets to determine scale differences between network connected devices. Scale difference can be an integer which is calculated from model of the subnet hierarchy based on, for example, the branching in the hierarchy. For example, a scale difference between two devices in the same subnet can be defined to be 0 (e.g., devices with addresses 10.102.147.07 and 10.102.147.08, both in subnet 10.102.147.xxx). A transmission scale difference between two devices which are in the different subnets but share the first two parts of the IP address can be defined to be 1 (e.g., 10.102.147.07 and 10.102.196.08). A transmission scale difference of two devices which are in different subnets but share the first one part of the IP address can be defined to be 2 (e.g., 10.102.147.07 and 10.171.186.08). A transmission scale difference of devices which do not share even the top part of the IP address in the IP hierarchy can be defined to be 3 (e.g., 10.102.147.07 and 142.36.196.08). kernel function=f (scale difference between subnets) The kernel function is a function in the exponential form to scale the transmission rate and make sure the transmission rate bounds between 0 and 1. The within-subnet base transmission rates, the between-subnet transmission rates, the vaccination rate and the recovery rate are parameters for each dynamical system relating to a particular malware. Such parameters can be predetermined, predefined, estimated or learned from empirical data. For example, existing reported event data from anti-malware software can be divided into a training data set and a test data set. The training data can be used to estimate or learn these parameter values, such as by machine learning techniques. For example, the parameters can be estimated using machine learning methods such as regression, Bayesian inference and the Markov Chain Monte Carlo (MCMC). The estimates can then be built into the dynamical systems so as to build a model of the subnets and malware propagation through the subnets. Once generated, the network protector 200 can evaluate a measure of a risk of infection of a particular target subnet in the network 200 at a particular point in time based on the dynamical systems 204 using the above equations. For example, the measure of risk can be a numerical value derived from on proportion of devices in the target subnet that are forecast to be susceptible or infected at the point in time by extrapolating current device information using the differential equations above. The network protector 200 further receives a threshold 206 as a predetermined threshold level of risk which, when the threshold is met, indicates a need for protective measures to be deployed to the target subnet. Such protective measures can include, for example, the installation of remediations for devices in the target subnet to vaccinate the devices against infection by the malware. Such protective measures can therefore include: modifications to devices in the target subnet; and/or remediation measures to devices infected by the malware in the target subnet. In determining the risk of infection of the target subnet, a particular point in time must be used for which the risk is evaluated. The point in time can be selected based on a standard, predefined or estimated point in time in the future from a reference point in time. In some embodiments, the point in time is determined based on a prediction, estimate or determination of a time required to deploy malware protection measures to all susceptible and/or infected devices in the target subnet. That is, the point in time can be selected to be sufficiently far into the future that there is enough time to, if warranted, deploy responsive malware protection measures for the target subnet. FIG. 3 is a flowchart of a method of protecting the target subnet in accordance with embodiments of the present disclosure . Initially, at 302, the network protector 200 generates dynamical systems 204 for the subnets in the network 202. At 304 the method evaluates a measure of risk of infection of a target subnet at a particular point in time. At 306 the method determines if the risk of infection at the point in time meets the threshold risk 206 and, where the threshold is met, the method deploys malware protection measures to devices in the target subnet at 308. Further embodiments of the present disclosure will now be described suitable for protecting a portion of a computer network. FIG. 4 is a component diagram of an arrangement for a network protector 400 to protect a portion of a computer network 402 in accordance with embodiments of the present invention. Many of the features of FIG. 4 are identical to those described above with respect to FIG. 2 and these will not be repeated here. The network protector 400 of FIG. 4 differs from that described with respect to FIG. 2 in that the network protector 400 is arranged to protect a portion of the network 402 as a subset of subnets in the network 402, as opposed to a single target subnet. This is achieved by the network protector 400 evaluating a measure of risk of infection for each subnet in the network 402 for a predetermined point in time based on the dynamical systems 404. A model 410 of the subnets as, for example, a tree data structure, is then employed to record risk measures for each subnet. Preferably, the model 410 is a tree data structure comprising a node corresponding to each subnet and with each node having a parent save for a root node of the tree. Thus, the model 410 includes a risk measure for each subnet. The network protector 400 identifies a first subset of nodes in the tree data structure for which the risk of infection by the malware at the predetermined point in is below the threshold risk 406. For example, as illustrated in FIG. 4, a node “I” in the model 410 is cross hatched to indicate that it is currently infected by malware, and nodes “C”, “J” and “K” are diagonally hatched to indicate a measure of risk of infection at the predetermined point in time at or above the threshold measure 406. All other nodes are not shaded to indicate that a measure of risk of infection is below the threshold measure 406. Thus, the first subset determined by the network protector 400 includes all unshaded nodes in the model 410. The network protector 400 further identifies a second subset of nodes as a subset of the first subset where the nodes in the second subset have connections in the model 410 to nodes having a risk of infection meeting or exceeding the threshold measure of risk 406. Notably, node “A” indicated by emphasized lines in the model 410 of FIG. 4 is so connected in the model 410 to node “C” having a measure of risk meeting or exceeding the threshold 406. Accordingly, node “A” constitutes the second subset of nodes. Thus, in this way the network protector 400 determines, in the second subset, subnets in the network 402 having a risk of infection at the predetermined point in time below the threshold risk 406 but being in topologically proximate in the hierarchy of subnets to other subnets having a risk of infection at or above the threshold risk 406. Thus, the network protector 400 identifies, in the second subset, subnets that should be prioritized to defend the network against propagation of the malware by forming a border or boundary within the network 402 between subnets at which protective and/or defensive measures can be deployed to limit propagation of the malware in the network 402 by providing a barrier of subnets in the second subset. In some embodiments , protective actions are performed on all subnets identified in the first subset, though the network protector 400 prioritizes those subnets in the second subset so as to provide such a barrier. In some embodiments, the predetermined point can is determined based on an estimate of a second point in time at which the protective actions in respect of devices in the subnets associated with each node in the second subset of nodes will be completed such that the protective actions can be implemented before the predetermined point of time. For example, the predetermined point in time can be compared with the estimated second point in time and, where the predetermined point in time is found to be before the second point in time, then a new predetermined point in time can be defined later than the second point in time and the processing of the network protector 400 can be repeated. FIG. 5 is a flowchart of a method for protecting a portion of a computer network 402 in accordance with embodiments of the present disclosure. Initially, at 502, the method generates dynamical systems for the subnets as previously described. At 504 the method evaluates a measure of risk of infection at a predetermined point in time for each subnet in the network 402. At 506 the method identifies a first subset of subnets for which a risk of infection by the malware is determined to be below the threshold risk 406. At 508 the method identifies a second subset of subnets as a subset of the first subset including subnets associated with nodes in the model 410 that are connected with nodes associated with subnets determined to have a measure of risk that meets or exceeds the threshold level 306 at the predetermined point in time. At 510 the method performs protective actions on devices in the first subset of subnets prioritizing devices in the second subset of subnets. FIG. 6 is a flowchart of an alternative method for protecting a portion of a computer network in accordance with embodiments of the present disclosure . According to the method of FIG. 6 an “air-gap”, communication barrier or preclusion of communication is implemented between devices in subnets being having a risk of infection below the threshold 406 and subnets having a risk of infection above the threshold at the predetermined point in time. In this way, propagation of the malware can be reduced or prevented and a portion of the network being comprised of subnets with a risk of infection below the threshold 406 can be protected from communication with an infected (or likely infected) portion of the network. Thus, according to the method of FIG. 6, only a first subset of subnets is necessary for determination to identify those subnets for which communication should be prevented. Optionally, the second subset described above with respect to FIGS. 4 and 5 can additionally be determined in order to provide a barrier in the network 402 at the subnets in the second subset for which prevention of communication should be prioritized. Prevention of communication between devices in different subnets can be achieved by, for example: forcing disconnection of communications connections between devices in the different subnets; preventing routing of network communications, packets or data between the different subnets; preventing forwarding or transfer or network communications between the different subnets; preventing network address translation, address resolution or address lookup for devices in a subnet to which communication is to be prevented; filtering network packets, data or units of communication to intercept, delete or prevent communication between the different subnets; intercepting communication between the different subnets; adapting routing rules to prevent communication between the different subnets including routing of network communications between the different subnets; and physical disconnection of network connections between the different subnets. Initially, at 602, the method generates dynamical systems for the subnets as previously described. At 604 the method evaluates a measure of risk of infection at a predetermined point in time for each subnet in the network 402. At 606 the method identifies a first subset of subnets for which a risk of infection by the malware is determined to be below the threshold risk 406. At 608 the method implements prevention measures to prevent communication between subnets in the first subset and subnets outside the first subset. Insofar as embodiments of the disclosure described are implementable, at least in part, using a software-controlled programmable processing device, such as a microprocessor, digital signal processor or other processing device, data processing apparatus or system, it will be appreciated that a computer program for configuring a programmable device, apparatus or system to implement the foregoing described methods is envisaged as an aspect of the present disclosure . The computer program may be embodied as source code or undergo compilation for implementation on a processing device, apparatus or system or may be embodied as object code, for example. Suitably, the computer program is stored on a carrier medium in machine or device readable form, for example in solid-state memory, magnetic memory such as disk or tape, optically or magneto-optically readable memory such as compact disk or digital versatile disk etc., and the processing device utilizes the program or a part thereof to configure it for operation. The computer program may be supplied from a remote source embodied in a communications medium such as an electronic signal, radio frequency carrier wave or optical carrier wave. Such carrier media are also envisaged as aspects of the present disclosure . It will be understood by those skilled in the art that, although the present disclosure has been described in relation to the above described example embodiments, the invention is not limited thereto and that there are many possible variations and modifications which fall within the scope of the invention. The scope of the present disclosure includes any novel features or combination of features disclosed herein. The applicant hereby gives notice that new claims may be formulated to such features or combination of features during prosecution of this application or of any such further applications derived therefrom. In particular, with reference to the appended claims, features from dependent claims may be combined with those of the independent claims and features from respective independent claims may be combined in any appropriate manner and not merely in the specific combinations enumerated in the claims. 1. A computer implemented method of protecting a target subnet in a hierarchy of subnets of a computer network from malware attack, the subnet including a set of network connected devices, the method comprising: generating a dynamical system for each subnet in the computer network, each dynamical system modelling a rate of change of a number of network connected devices in the subnet that are: susceptible to infection by malware; infected by the malware; protected against infection by the malware; and remediated of infection by the malware, the dynamical systems being based on rates of transmission of the malware between pairs of subnets; evaluating a measure of risk of infection of the target subnet at a predetermined point in time based on the dynamical system for the target subnet; and responsive to the measure of risk meeting a predetermined threshold, deploying malware protection measures to devices in the target subnet. 2. The method of claim wherein the predetermined point in time is determined based on a time required to deploy the malware protection measures to all susceptible devices in the subnet. 3. The method of claim 1 wherein the malware protection measures include modifications to devices in the target subnet such that susceptible devices in the target subnet are rendered insusceptible to the malware. 4. The method of claim 1 wherein the malware protection measures include remediation measures to devices infected by the malware in the target subnet. 5. A computer system comprising: a processor and memory storing computer program code for protecting a target subnet in a hierarchy of subnets of a computer network from malware attack, the subnet including a set of network connected devices, by: generating a dynamical system for each subnet in the computer network, each dynamical system modelling a rate of change of a number of network connected devices in the subnet that are: susceptible to infection by malware; infected by the malware; protected against infection by the malware; and remediated of infection by the malware, the dynamical systems being based on rates of transmission of the malware between pairs of subnets; evaluating a measure of risk of infection of the target subnet at a predetermined point in time based on the dynamical system for the target subnet, and responsive to the measure of risk meeting a predetermined threshold, deploying malware protection measures to devices in the target subnet. 7. A non-transitory computer-readable storage medium storing a computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer system to perform the method as claimed in claim 1.

2019-03-19

en

2021-01-14

US-89160007-A

Terminal-to-terminal communication connection control method using IP transfer network ABSTRACT Both a connection server and a relay connection server are installed in an IP transfer network; a function similar to a line connection control of a subscriber exchanger is applied to a connection server; a function similar to a line connection control of a relay exchanger is applied to the relay connection server; and a terminal-to-terminal communication connection control method with using the IP transfer network is realized in such a manner that a telephone set and a terminal such as an IP terminal and a video terminal transmit/receive an initial address message, an address completion message, a call pass message, a response message, a release message and a release completion message, which can be made in a 1-to-1 correspondence relationship with line connection control messages of the common line signal system. Furthermore, while an address administration table is set to a network node apparatus of an IP transfer network, means for registering addresses of the terminals into this address administration table is employed, so that an IP packet communication by a multicast manner can be realized with improving information security performance. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is related to a terminal-to-terminal (inter-terminal) communication connection control method using an IP (Internet Protocol) transfer network, which is applicable to an IP communication established between two terminal units such as an IP terminal, an IP telephone, and a voice/image apparatus (audio/visual apparatus), and also applicable to a 1:n type IP Communication utilizing a multicast IP technique. 2. Description of the Prior Art As a method capable of realizing various terminal-to-terminal communications such as mail transmissions/receptions, telephone, and image communications while an IP transfer network is utilized, Japanese Patent Application No. 128956/1999 (will be referred to as a “prior patent application” hereinafter) has been filed by the Applicant. This prior patent application discloses the method of realizing “integrated IP transfer network” containing therein a plurality of IP transfer networks having various characteristics, while separating these IP transfer networks. These IP transfer networks are known as an IP telephone network, an IP image network, and IP electronic data general-purpose network. To realize the IP transfer network for uniting various sorts of terminal-to-terminal communications, contents disclosed by the above-explained prior patent application will now be briefly explained with reference to FIG. 1. Inside integrated IP transfer network 901, a plurality of IP transfer networks having different characteristics such as the IP image network 902, the IP electronic data general-purpose network 903, and the IP telephone network 904 are virtually installed. While the address management tables are set inside the network rode apparatus 905-X and the network node apparatus 905-Y, which are provided at the input points to the integrated IP transfer network 901 from the external unit for the integrated IP transfer network 901, the address of the terminal unit is previously registered into the address management table. Since the address written into the IP packet entered into the integrated IP transfer network 901 is compared with the address registered in the address management table, the IP packets can be transmitted, while these IP packets are separated to the individual IP transfer networks within the integrated IP transfer network 901. Next, in connection with the present invention, the terminal-to-terminal communication connection control method (No. 7-common line signal system) employed in a public switched telephone network (PSTN) will now be simply explained. In FIG. 2, reference numerals 98-1 and 98-3 show exchangers (subscriber exchangers) to which telephone sets are connected, reference numeral 98-2 indicates a relay exchanger, and also reference numerals 98-4 and 98-5 represent telephone sets. Reference numerals 98-6 to 98-8 show communication path control units of the exchangers, reference numerals 98-9 to 98-11 indicate internal control units of the exchangers, and also reference numerals 98-12 to 98-14 indicate signalling points for controlling terminal-to-terminal connections of telephone sets. The internal control units of the exchangers perform information exchanges used to set/recover communication lines between the communication path control units and the signalling points in conjunction with the internal operation controls of the exchangers. In particular, reference numerals 98-12 and 98-14 will be referred to as signalling end points (SEP). More specifically, reference numeral 98-13 is called as a signalling transfer point (STP). Also, reference numeral 98-15 denotes another signalling end point. These signalling end points 98-12 to 98-15 are connected via signal lines 98-24 to 98-27 to a signal network 98-16. While information used to control terminal-to-terminal communication connections and also execute maintenance/operations of networks is stored into a signalling unit (SU), these signalling end points 98-12 to 98-15 mutually transmit/receive the stored information to each other. A 16-bit point code (PC) is applied to one signalling end point in order to discriminate the own signalling end point from another signalling end point. On the other hand, reference numerals 98-21 to 98-22 show communication lines used to transfer telephone voice (speech), but not used to transfer information for controlling terminal-to-terminal communication connections. The telephone lines 98-20 and 98-23 correspond to interfaces (UNI) through which a combination between voice and control information of terminal-to-terminal communication connections is transferred in an integral form. Namely, both the voice and the control information of terminal-to-terminal communication connections are transferred through the interfaces without being separated from each other. The No. 7-common line signal system is featured by that the signal lines 98-24 to 98-26 are separated from the communication lines 98-21 and 98-22 inside the public switched telephone network (PSTN). A signalling unit indicated in FIG. 3 contains a “destination point code (DPC)”, an “origin point code (OPC)”, a “circuit identification code (CIC)”, a “message type (MSG)” and a parameter of the message. The destination point code shows a destination to which a signalling unit is transmitted, the origin point code indicates a transmission source of a signalling unit, and the circuit identification code represents an identification number for identifying a communication line set between a transmission source signal point and a destination signal point. As the message, for example, there are IAM, ACM, CPG, ANM, REL, RLC, SUS, RES and CON, which are used to control terminal-to-terminal communication connections. Such a signalling unit which is written as “IAM” into a message area of the signalling unit is referred to as an initial address message (IAM). Similarly, such a signalling unit which is written as “ACM” into the message area of the signalling unit is referred to as an address completion message (ACM), such a signalling unit which is written as “CPG” into the message area of the signalling unit is referred to as a call pass message (CPG), and also such a signalling unit which is written as “ANM” into the message area of the signalling unit is referred to as an answering message (ANM). Similarly, such a signalling unit which is written as “REL” into the message area of the signalling unit is referred to as a release message (REL), such a signalling unit which is written as “RLC” into the message area of the signalling unit is referred to as a release completion message (RLC), and also such a signalling unit which is written as “SUS” into the message area of the signalling unit is referred to as an interrupt message (SUS). Similarly, such a signalling unit which is written as “RES” into the message area of the signalling unit is referred to as a restart message (RES), and such a signalling unit which is written as “CON” into the message area of the signalling unit is referred to as a connection message (CON). Referring now to FIG. 2, a description will be made of a method for controlling a terminal-to-terminal connection control by which a telephone communication is established from the telephone set 98-4 via the exchangers 98-1, 98-2, 98-3 to the telephone set 98-5, as shown in FIG. 2. It should be noted that the respective signalling points exchange such a signalling unit via the signal lines 98-24 to 98-27 and the common line signal network 98-16 to each other. In the signalling unit, the signalling point codes applied to the respective signalling points are set as addresses indicative of designations and transmission sources. The telephone set 98-4 is connected via the telephone line 98-20 to the exchanger 98-1. The terminal-to-terminal connection control of the telephone set 98-4 is loaded to the signalling point 98-12 within the exchanger 98-1. Similarly, the telephone set 98-5 is connected via the telephone line 98-23 to the exchanger 98-3. The terminal-to-terminal connection control of the telephone set 98-5 is loaded to the signalling point 98-14 within the exchanger 98-3. When a user issues a call request from the telephone set 98-4, the signalling point 98-12 receives this call request (Step X1 of FIG. 4), and a communication line is determined by using a destination telephone number received from the telephone number 98-4 because of the functions of both the communication path control unit 98-6 and the exchanger internal control unit 98-9 of the exchanger 98-1. A signalling unit into which a circuit line identifier (CIC) of the determined communication line is written is formed as an initial address message (IAM). In the parameter area of the initial address message (IAM), at least the telephone number of the telephone set 98-5, namely a destination telephone number “Tel-No-98-5” is written. Furthermore, the telephone number of the telephone 98-4, namely, a telephone number of a transmission source “Tel-No-98-4” may be written thereinto. Next, the signalling point 98-12 sends the initial address message (IAM) for issuing the telephone call to the signalling point 98-13 provided in the exchanger 98-2 (Step X2). The initial address message IAM contains a line number “98-4-98-5” of a communication line corresponding to the logic communication line inside the telephone communication line 98-21, the destination telephone number “Tel-No-98-5”, the transmission source telephone number “Tel-No-98-4” (omittable option), and the like. After the signalling point 98-12 has sent the IAM, the operation of the signalling point 98-12 is advanced to a waiting condition for an address completion message (ACM: will be explained later), and also initiates an ACM waiting timer. The signalling point 98-13 provided within the exchanger 98-2 receives the above-explained IAM, and then notifies the line number “98-4-98-5” via the exchanger internal control unit 98-10 to the telephone communication line control unit 98-7. The telephone communication line control unit 98-7 executes a conducting test in order that the telephone communication line 98-21 can be used for the telephone communication. The signalling point 98-13 sends the IAM to the signalling point 98-14 provided in the exchanger 98-3 (step X3). The signalling point 98-14 checks the content of the received IAM in order that the telephone communication line 98-22 can be used for the telephone communication via the control unit 98-11 and the telephone communication line control unit 98-8. Furthermore, while the signalling point 98-14 connects the telephone set 98-5 to the exchanger 98-3, this signalling point 98-14 checks as to whether or not a call reception is permitted. When the call reception is allowed, the signalling point 98-14 issues a call setting request to the telephone set 98-5 (Step X4). Further, the signalling point 98-14 returns such an address completion message (ACM) which notifies that the IAM is received (Step X5). The ACM message is reached via the signalling point 98-13 to the signalling point 98-12 (Step X6). Upon receipt of the ACM message, the signalling point 98-12 stops the counting operation of the ACM waiting timer which has been set. In such a case that the counting operation of the ACM waiting timer is completed at a time instant before the ACM message is received, the telephone communication line is released. When the signalling point 98-14 within the exchanger 98-3 receives information for implying such a fact that the calling request is being received from the telephone set 98-5 (Step X7), the signalling point 98-14 transmits the call pass message (CPG) to the signalling point 98-13 (Step X8). The signalling point 98-13 transmits the received CGP to the signalling point 98-12 (Step X9). The signalling point 9-12 within the switching point 98-1 receives the CPG message. Next, the signalling point 98-12 sends a calling sound to the telephone set 99-4 (Step X10). When the telephone set 98-5 responds to the above-described call setting request (Step X11), the telephone communication line 98-23 between the telephone set 98-5 and the exchanger 98-4 can be used for the telephone communication, and further the response message (ANM) for indicating that the telephone set 98-5 responds to the call setting request is sent to the signalling point 98-13 (Step X12). The signalling point 98-13 transmits the received ANM to the signalling point 98-12 (Step X13), the signalling point 98-12 notifies stopping of the calling sound under transmission to the telephone set 98-4 (Step X14), and thus, telephone voice (speech) can be transmitted/received between the telephone set 98-4 and the telephone set 98-5. The operation is advanced to a telephone communication phase (Step X15). In the case that the handset of the telephone set 98-4 is put on (on-hook), the release request (REL) is sent out (Step X16), and the signalling point 98-12 receives the release request (REL), the signalling point 98-12 sends out a next release request (REL) to the signalling point 98-13 (Step X17), and furthermore, notifies to the telephone set 98-4, such a release completion (RLC) for indicating that the telephone communication line is brought into an empty state (Step X18). Then, upon receipt of the release request (REL), the signalling point 98-13 sends out the next release request (REL) to the signalling point 98-14 (Step X19), and further, notifies such a release completion (RLC) for indicating that the telephone communication line is brought into the empty state to the signalling point 98-12 (Step X20). Then, upon receipt of the release request (REL), the signalling point 98-14 sends out the next release request (REL) to the telephone set 98-5 (Step X21), and further, notifies such a release completion (RLC) for indicating that the telephone communication line is brought into the empty state to the signalling point 98-13 (Step X22). There are several variations in the sequential operations of the terminal-to-terminal communication connection controls which are transmitted/received between the telephone set 98-4 and the signalling point 98-12, and also between the signalling point 98-14 and the telephone set 98-15, depending upon sorts of telephone sets. For instance, a confirmation notification with respect to a release completion may be issued from the telephone set 98-4 to the signalling point 98-12 just after the above-explained Step X18. Alternatively, a confirmation notification with respect to the release completion may be issued from the signalling point 98-14 to the telephone set 98-5 just after the Step X23. FIG. 5 is an explanatory diagram for explaining another control method for controlling terminal-to-terminal connections by which a telephone communication is made from the telephone set 98-4 via the exchanger 98-1 through the exchanger 98-3 to the telephone set 98-5. This terminal-to-terminal communication connection control method corresponds to such a communication connection control method made by eliminating the process operations defined at the Steps X5 and X6 (namely, by eliminating address completion message ACM) from the terminal-to-terminal communication connection control method as explained in FIG. 4. It should be understood that at the Step X2, the signalling point 98-12 sets the CPG waiting timer instead of the above-explained ACM waiting timer, and the signalling point 98-12 stops the CPG waiting timer after the Step X9. The above-explained terminal-to-terminal communication connection control method is such a control method applied to such a case that the exchanger is not an ISDN exchanger, but is an analog exchanger. FIG. 6 is an explanatory diagram for explaining another method of controlling terminal-to-terminal communication connections between the telephone set 98-4 and the telephone set 98-5. This terminal-to-terminal communication connection control method corresponds to such a control method example that in the above-described terminal-to-terminal communication connection control method, a series of process steps for interrupting a telephone communication without waiting for the response completion message (Step X14) and the telephone communication phase (Step X15) is carried out (Step X16 to Step X23). FIG. 7 is an explanatory diagram for explaining a further control method for controlling terminal-to-terminal communication connections by which a telephone communication is made from the telephone set 98-4 via the exchanger 98-1 through the exchanger 98-3 to the telephone set 98-5. This terminal-to-terminal communication connection control method corresponds to such a control method. That is, while a telephone communication is carried out (Step X15), the handset of the telephone set 98-4 is positioned only for a short time period (on hook), and an interrupt message is transmitted in order to temporarily stop the telephone communication (Steps X30 to X33). Then, the handset is returned to the original setting position (off hook), and the restart message for restarting the telephone communication is transmitted (Steps X35 to X38), and thus, the process operation is returned to the telephone communication (Step X39). The subsequent steps of the release (REL) and the release completion (RLC) are similar to those as explained with reference to FIG. 5 (Steps X40 to X47). Next, with respect to the IP telephone communication, there is proposed “multimedia communication system based on JT-H323” of TTC standard, which is described in, for instance, ITU-T recommendation H323 ANNEX D regulation (version of April, 1999). The technical idea “SIGNALLING PROTOCOL AND PACKETING OF MEDIA SIGNAL” by which the call connections are controlled in the multimedia terminal-to-terminal communication is defined as JT-H225. Also, the technical idea “CONTROL PROTOCOL FOR MULTIMEDIA COMMUNICATION” in the multimedia terminal-to-terminal communication is defined as JT-H245. Next, referring to FIG. 8 to FIG. 11, the basic functions of the JT-H323 gateway defined by ITU will be described. The present invention also refers to the basic functions. In FIG. 8, a block 800 indicates the JT-H323 gateway. In this gateway 800, a voice (speech) signal and/or an image (picture) signal entered from an SCN line 801 is converted into a digital signal in an SCN terminal function 802, a data format and/or a signal transmission/reception rule is converted in a conversion function 803, and then, the data format is converted into the format of the IP packet in a terminal function 804. The resulting IP packet is sent out to an IP communication line 805. Also, as to a packet flow along an opposite direction, namely, an IP packet containing voice (speech) data and/or image data entered from the IP communication line 805 is decoded in a digital data format by the terminal function 804, and a data format and/or a signal transmission/reception rule are converted by the conversion function 803. The resultant digital data is converted into a signal flowing through the SCN line by the SCN terminal function 802 and sent to the SCN line 801. In this case, both a voice signal and an image signal may be separated into both “call control data” and “net data.” This call control data is used so as to send/receive a telephone number with respect to a communication third party. The net data constitutes voice and/or images itself. Through a communication line 805, an IP packet 810 (refer to FIG. 9) functioning as the call control data flows, an IP packet 811 (refer to FIG. 10) functioning as the net data which constitutes the voice itself flows, and an IP packet 812 (refer to FIG. 11) functioning as the net data which constitutes the image itself flows. In the case of an ISDN line, the SCN terminal function 802 corresponds to a data line terminating apparatus (DSU). Also, the terminal function 804 owns such a terminal communication function required for the bidirectional (interactive) communication between the JT-323 telephone set and the JT-323 voice/image apparatus. Next, the integrated information communication network proposed in Japanese Patent No. 3084681-B2 closely related to the terminal-to-terminal communication connection control method of the present invention will now be briefly explained with reference to FIG. 12. A block 191 shows an integrated IP communication network, an IP terminal 192-1 owns an IP address “EA01”, and another IP terminal 192-2 owns an IP address “EA02”. This example corresponds to such an example that an external IP packet 193-1 is transferred from the IP terminal 192-1 via the integrated IP communication network to the IP terminal 192-2. Both the IP addresses “EA01” and “EA02” are referred to as “external IP addresses”, since these IP addresses are used outside the integrated IP communication network 191. In FIG. 12 to FIG. 15, as to head portions of IPs, only IP address portions are described, and other items are omitted. When the network node apparatus 195-1 receives the external IP packet 193-1, this network node apparatus 195-1 confirms that the internal IP address is equal to “IA01”, and the destination external IP address of the IP packet 193-1 is equal to “EA02”. The internal IP address is applied to the terminal unit (logic terminal) of the logic communication line 194-1 into which the IP packet 193-1 is entered. Then, the network node apparatus 195-1 retrieves the content of the address management table 196-1 shown in FIG. 12, and retrieves such a record in which the internal IP address of the transmission source is equal to “IA01” in the beginning, and thereafter, the destination external IP address is equal to “EA02”. Furthermore, the network node apparatus 195-1 checks as to whether or not the external IP address “EA01” of the transmission source within the IP packet 193-1 is contained in the previously detected record. It should be understood that such a check operation as to whether or not the external IP address “EA01” of the transmission source within the IP packet 193-1 is contained in the previously-detected record may be omitted. In the present example, while it is such a record containing the IP addresses “EA01, EA02, IA01, IA02” on the second row from the top row, an IP packet 193-2 having such an IP header is formed (namely, IP packet is encapsulated) using the IP addresses “IA01” and “IA02” located inside the record. The IP header is such that the transmission source IP address is “IA01”, and the destination IP address is “IA02”. In this case, symbols “IA01” and “IA02” are called as internal IP addresses of the integrated IP communication network 191. The internal IP packet 193-2 is reached through the routers 197-1, 197-2 and 197-3 to the network node apparatus 195-2. The network node apparatus 195-2 removes the IP header of the received internal IP packet 193-2 (anti-encapsulation of IP packet), sends out the acquired external IP packet 193-3 to the communication line 194-2, and then, the IP terminal 192-2 receives the external IP packet 193-3. Is should also be noted that 197-6 is an example of such a server that the external IP address is “EA81”, and the internal IP address is “IA81”. FIG. 13 indicates another embodiment of an address management table. That is, the address management table 196-1 of FIG. 12 is replaced by an address management table 196-3 of FIG. 13, the address management table 196-2 of FIG. 12 is replaced by an address management table 196-4 of FIG. 13, and other portions are identical to those of the above-explained address management table. The known address mask technique may be applied to the address management tables 196-3 and 196-4. In the beginning, the record of the address management table 196-3 containing the internal IP address “IA01” is retrieved. This internal IP address is applied to the logic terminal of the terminal unit of the communication line 194-1. In this case, both the record of the first row at the record of the second row in the address management table 196-3 from the top row correspond to the records of interest. With respect to the record of the first row, a check is made as to whether or not an AND-gating result between a destination-use external IP mask “Mask81” and the destination external IP address “EA02” within the external IP packet 193-1 is coincident with a destination external IP address “EA81 x” within the first row record (refer to the below-mentioned formula (1)). In this case, the AND-gating result is not coincident with the external IP address “EA81 x”. With respect to the record of the second row, a check is made as to whether or not an AND-gating result between a destination-use external IP mask “Mask2” and the destination external IP address “EA02” within the external IP packet 193-1 is coincident with a destination external IP address “EA02 y” within the second row record (refer to the below-mentioned formula (2)). In this case, the AND-gating result is coincident with the external IP address “EA02 y”. Also, with respect to the transmission source IP address, a comparison is made in accordance with the below-mentioned formula (3) in a similar manner: If (“Mask81” and “EA02”=“EA81x”)  (1) If (“Mask2” and “EA02”=“EA02y”)  (2) If (“Mask1y” and “EA01”=“EA01y”)  (3) Based upon the above-explained comparison result, the record of the second row is selected, and both the internal records “IA01” and “IA02” contained in the record of the second row are employed so as to perform the encapsulation, so that the internal IP packet 193-2 is formed. It should be noted that the comparison using above-mentioned formula (3) can not be made when the regions of both the transmission source external IP address and the address mask in the record of the address administration table 196-3 are omitted. FIG. 14 indicates a further embodiment of an address management table. That is, the address management table 196-1 of FIG. 12 is replaced by an address management table 196-5 of FIG. 14, the address management table 196-2 of FIG. 12 is replaced by an address management table 196-6 of FIG. 14, and other portions are identical to those of the above-explained address management table. In this example, the address management tables 196-5 and 196-6 do not contain the transmission source external IP addresses, and the transmission source external IP address is not cited in the IP encapsulation. When the IP packet 193-1 is encapsulated, the destination internal IP address “IA02” is determined based upon the transmission source internal IP address “IA01” and the destination external IP address “EA02” inside the address management table 196-5. FIG. 15 illustratively shows a further embodiment of the address management table. This embodiment corresponds to such an embodiment that the integarated IP communication network of FIG. 12 is replaced by an optical network, and the internal IP packet is substituted by an internal optical frame. This further embodiment will now be briefly explained. In this drawing, a block 191 x indicates an IP packet transfer network, and also represents an optical network in which an IP packet is transferred by employing an optical frame. The optical frame is transferred to an optical communication path provided inside the optical network 191 x. This optical communication path is equal to such a function of a communication-1 layer and a communication-2 layer. An optical link address is applied to a header portion of an optical frame. In such a case that the optical frame corresponds to an HDLC frame, the optical link address corresponds to an HDLC address employed in the HDLC frame. An IP terminal 192-1 x owns an IP address “EA1”, and another IP terminal 192-2 x owns an IP address “EA2”. This example corresponds to such an example that an external IP packet 193-1 x is transferred from the IP terminal 193-1 x via the optical network 191 x to the IP terminal 192-2 x. In FIG. 15, only IP address portion is described as to a header portion of an IP, only header portion is similarly described as to an optical frame, and other items are omitted. When the network node apparatus 195-1 x receives the external IP packet 193-1 x, this network node apparatus 195-1 x confirms such a fact that an internal optical link address is equal to “IA1”, and an external destination IP address of the IP packet 193-1 x is equal to “EA2”, and the internal optical link address is applied to a termination unit (logic terminal) of a logic communication line 194-1 x into which the IP packet 193-1 x is inputted. Then, the network node apparatus 195-1 x retrieves a content of an address administration table 196-1 x shown in FIG. 15, and also retrieves a record containing such addresses that an internal optical link address of a transmission source corresponds to “IA1” in the beginning, and subsequently, an external destination IP address corresponds to “EA2”. Furthermore, the network node apparatus 195-1 checks as to whether or not the transmission source external IP address “EA1” contained in the IP packet 193-1 x is included in the above-detected record. Alternatively, the checking operation as to whether or not the transmission source external IP address “EA1” contained in the IP packet 193-1 x is included in the detected record may be omitted. In this example, while the record is equal to such a record containing addresses of “EA1, EA2, IA1, IA2” on the second column from the top column, an optical frame 193-2 x is produced by employing to optical link addresses “IA1” and “IA2” present inside the record (namely, IP packet is capsulated). This optical frame 193-2 x owns such a header that the optical link address of the transmission link address is “IA1” and the optical link address of the destination is “IA2”. In this case, symbols “IA1” and “IA2” correspond to internal addresses of the optical communication network 191 x. The internal optical frame 193-2 x is reached to the network node apparatus 195-2 x via routers 197-1 x, 197-2 x and 197-3 x, which own an optical frame transfer function. The network node apparatus 195-2 x removes a header of the received internal optical frame 193-2 x (namely, optical frame is inverse-capsulated), sends out the acquired external IP packet 193-3 x to a communication line 194-2 x, and the IP terminal 192-2 x receives an external IP packet 193-3 x. In accordance with the present invention, while IP addresses are applied to an IP telephone set, a media router (will be explained later), and various sorts of servers (these appliances will be referred to as “IP transmittable/receivable nodes” hereinafter), the IP packets are transmitted/received, so that the data may be exchanged in a mutual manner. These appliances will be referred to as “IP communication means”. FIG. 15 shows such an example that while an IP transmittable/receivable node 340-1 and another IP transmittable/receivable node 340-2 own IP addresses “AD1” and “AD2” respectively, an IP packet 341-1 having the transmission source IP address “AD1” and the destination IP address “AD2” is transmitted from the terminal 340-1 to the terminal 340-2. Also, both the IP transmittable/receivable nodes 340-1 and 340-2 receive the IP packet 341-2 along the opposite direction, so that the various sorts of data are mutually transmitted/received. A data portion from which the header of the IP packet is removed may also be called as a “payload”. Next, there are provided with IP data multicast networks, IP base TV broadcast networks and, IP base movies distribution networks, while the multicast technique corresponding to one of the IP techniques is employed as the IP transfer networks. In the IP data multicast network, IP data such as electronic books and electronic newspapers is transferred from one distribution source to a plurality of destinations. In both the IP base TV broadcast networks and IP base movie distribution networks, which may function as IP sound (speech)/image networks, both TV sound data and TV picture (image) data are transferred (broadcasted) to a plurality of destinations. Referring now to FIG. 16, a multicast type IP transfer network 27-1 for transferring from one distribution source to a plurality of destinations will now be explained. In FIG. 16, reference numerals 27-11 to 27-20 show routers. Each of these routers 27-11 to 27-20 holds a router-sort multicast table. This router-sort multicast table represents that a received IP packet should be transferred to a plurality of communication lines in accordance with multicast addresses contained in the received IP packets. In this embodiment, a multicast address designates “MA1”. In such a case that an IP packet 29-1 having the multicast address “MA1” is transmitted from an IP terminal 28-1, and then is reached via the router 27-11 to the router 27-18, this router 27-18 copies an IP packet 29-2, and transfers both an IP packet 29-3 and another IP packet 29-4 to a communication line by citating the router-sort multicast table held in the router 27-18. Also, the router 27-17 copies the received IP packet 29-3, and transfers an IP packet 29-5 to a communication line 29-17 by referring to the router-sort multicast table held in the router 27-18. Also, this router 27-17 transfers an IP packet 29-6 to a communication line 29-18 by referring to the router-sort multicast table. Since the router 27-19 owns no router-sort multicast table, the IP packet 29-4 directly passes through the router 27-19 to become another IP packet 29-7 which will be transferred to the router 27-14. As indicated in FIG. 17, the router 27-17 inputs the IP packet 29-3 from the communication line 29-16, and makes such a confirmation that the transmission source IP address of the IP packet 29-3 is equal to “SRC1” and the destination IP address thereof is equal to the multicast address “MA1”. Since the output interfaces with respect to the multicast address “MA1” are designated as “IF-1” and “IF-2” in the multicast table 29-15, the router 27-17 copies the IP packet 29-3, and outputs the copied IP packet as an IP packet 29-5 to the communication line 29-17 whose output interface is equal to “IF-1”. Furthermore, the router 27-17 copies the IP packet 29-3, and then outputs the copied IP packet as an IP packet 29-6 to the communication line 29-18 whose output interface is equal to “IF-2”. The router 27-12 copies the received IP packet 29-5, and then transfers the IP packet 29-8 to the IP terminal 28-2 and also the IP packet 29-9 to the IP terminal 28-3 by referring to the route-sort multicast table. Also, the router 27-13 copies the received IP packet 29-6, and then transfers the IP packet 29-10 to the IP terminal 28-4 and also the IP packet 29-11 to the IP terminal 28-5 by referring to the route-sort multicast table. Also, the router 27-14 copies the received IP packet 29-7, and then transfers the IP packet 29-12 to the IP terminal 28-6 and also the IP packet 29-13 to the IP terminal 28-7 by referring to the route-sort multicast table. In the case that the IP terminal 28-1 of the transmission source transfers a digital-formatted electronic book and a digital-formatted electronic newspaper to the IP transfer network 27-1, this IP transfer network 27-1 corresponds to an IP data multicast network which is employed so as to distribute an electronic book and an electronic newspaper, whereas the IP terminals 28-2 to 28-8 constitute IP terminals of users who purchase the electronic books and the electronic newspapers. In such a case that the IP terminal 28-1 of the transmission source is replaced by a TV broadcasting sound/image transmission apparatus so as to broadcast a TV program (both sound and image), the IP transfer network may constitute an IP base TV broadcast network, whereas the IP terminals 28-2 to 28-7 may constitute IP terminals equipped with TV reception functions for TV audiences. In the above-described embodiment of the multicast system shown in FIG. 16, the IP terminal 28-1 constitutes the transmitter to transmit the multicast data, whereas the IP terminals 28-2 to 28-7 constitute the receivers to receive the multicast data. The multicast system with employment of such a method is utilized in the Internet and broadband LANs as a test purpose. However, in the multicast system, since any of the IP terminals may constitute the transmission source for transmitting the multicast data, the following risk may occur. That is, while a transmitter having a ill-intention appears, the transmitter continuously transmits multicast data in an endless manner, so that a network may be congested by the multicast data, and thus, a network function should be stopped. There is another risk that since multicast tables contained in routers are rewritten and/or a very large amount of data are supplied into routers in an endless manner, source routers are brought into overload conditions, and finally shut down. A large expectation is made of realizing such a multicast system with highly improved information securities, while employing the following security methods. That is, while a multicast data transmission source is limited, any of unfair users may be eliminated, and/or attacking of overload/shut-down of routers may be avoided. SUMMARY OF THE INVENTION Terminal-to-terminal (inter-terminal) communication connection control methods for IP terminals which mainly transmit/receive data have been established as, for example, a terminal-to-terminal communication connection control method capable of transmitting/receiving an electronic mail in the Internet. In accordance with the present invention, such a terminal-to-terminal communication connection control method could be established, in which the terminal-to-terminal communication connection control method among the IP terminals, which has been established in the Internet and the like and mainly transmits/receives data, may be applied to multimedia communications such as communications among IP telephone sets, voice/image communications, and IP multicast communications by employing a technical idea different from the above-explained TTC standard. The present invention has been made to solve the above-explained problem, and has an object to provide a terminal-to-terminal communication connection control system which can be applied to multimedia communications such as communications established among IP telephones, voice (speech)/image communications, and IP multicast communications. In accordance with the present invention, since the line connection control method of the No. 7-common line signal system is rearranged so as to be fitted to an IP transfer network, the terminal-to-terminal communication connection control method may be realized in which IP packets are transferred via the IP transfer network among terminals known as telephone sets, IP terminals, audio-moving image transmitting/receiving terminals and facsimiles. In FIG. 18, reference numeral 1 shows an IP transfer network having an IP packet transmission/reception function, reference numerals 1-1 and 1-2 indicate terminals (telephone set, IP terminal, audio-moving image transmitting/receiving terminal, facsimiles etc.), reference numerals 1-3 and 1-4 represent media routers for connecting one, or more terminals to the IP transfer network, and reference numerals 1-5 and 1-6 show connection servers, and further reference numeral 1-7 denotes a relay connection server. A function similar to the line connection control of the subscriber exchanger (LS) of the public switched telephone network (PSTN) is applied to each of the connection servers 1-5 and 1-6. A function similar to the line connection control of the relay exchanger (TS) is applied to the relay connection server 1-7. A user inputs a destination telephone number from the terminal 1-1 so as to send a call setting signal (Step Z1), and then, the media router 1-3 returns a call setting acceptance (Step Z2). Next, the media router 1-3 transmits an IP packet to the connection server 1-5 (Step Y1). This IP packet contains the destination telephone number and a telephone number of a transmission source, and is to set a telephone call. The connection server 1-5 determines a communication line for a terminal communication provided in an IP transfer network by using the received destination telephone number, and produces both a line number (circuit number: CIC) used to identify a communication line, and an IP packet containing both the destination telephone number and the transmission source telephone number. In this case, the line number (CIC) is exclusively determined in such a manner that the circuit number is capable of identifying a set of both the destination telephone number and the transmission source telephone number. The IP packet will be referred to as an IP packet containing an initial address message (IAM), or simply referred to as an initial address message (IAM). The above-explained communication line for the terminal communication corresponds to, for example, such an IP communication line used to transfer a digitalized voice packet. The IP communication line may be defined as a set of a transmission source IP address and a destination IP address, which is set to a voice IP packet, or a label of an MPLS technique applied to an IP packet. When other terminals such as an IP terminal, an audio-moving image data, facsimile data are used, a communication line corresponds to a data transferring communication line for an IP terminal, and/or a data transferring communication line for an audio-moving image data and facsimile data. Next, the connection server 1-5 sends the initial address message (IAM) to the connection server 1-7 (Step Y2), and operation of the connection server is advanced to an address completion message (ACM) waiting condition and initiates an ACM waiting timer (will be explained later). The relay connection server 1-7 receives the message IAM, and then sends this message IAM to the connection server 1-6 (Step Y3). The connection server 1-6 checks the content of the received IAM message, and also judges as to whether or not a communication line is set to such a media router 1-4 which is connected to the telephone set 1-2 having the destination telephone number. In other words, the connection server 1-6 checks as to whether or not the media router 1-4 is allowed to receive a connection request call. When the connection request call reception is allowed, the connection server 1-6 requests the media router 1-4 to set the connection request call (Step Y4). The media router 1-4 requests the telephone set 1-2 to set the telephone call (Step Z4). Furthermore, the connection server 1-6 produces such an IP packet for notifying such a fact that the message IAM is received. The connection server 1-6 returns the produced IP packet (called as address completion message: ACM) to the relay connection server 1-7 (Step Y5). The message ACM is reached via the relay connection server 1-7 to the relay connection server 1-5 (Step Y6). When the connection server 1-5 receives the message ACM, the connection server 1-5 stops the previously set ACM waiting timer. In the case that the ACM waiting timer is fully counted up before the message ACM is received, the telephone communication line is released. Alternatively, the message ACM may succeed the line number (CIC) from the message IAM and may save it inside the message ACM or the message ACM forms a line number from the caller's telephone number and the address telephone number at the Step Y5 and save it inside the message ACM. The terminal 1-2 produces a connection request call reception sound, and reports the call reception to the media router 1-4 (Step Z7). The media router 1-4 sends to the connection server 1-6, the connection request call reception notice. The connection server 1-6 produces such an IP packet for notifying such a fact that the telephone set 1-2 issues the telephone set 1-2 receives the connection request call. This produced IP packet is referred to as an “IP packet containing a call pass message (CPG)”, or simply called as a call pass message (CPG). The connection server 1-6 sends this call pass message “CPG” to the relay connection server 1-7 (Step Y8). The relay connection server 1-7 sends the received message CPG to the connection server 1-5 (Step Y9), and the connection server 1-5 receives the message CPG. Then, the connection server 1-5 notifies such a fact that the terminal 1-2 is being called by considering the content of the message CPG to the media router 1-3 (Step Y10). The media router 1-3 notifies the telephone calling sound to the telephone set 1-1 (Step Z10). It should be noted that as to the message CPG, at the Step Y5, while the line number is formed from the set of the transmission source telephone number and the destination telephone number, and then may be saved in the message CPG. When the terminal 1-2 responds to the call setting request made at the Step Z4 (Step Z11), the media router 1-4 notifies such a fact that the terminal 1-2 responds the connection request call to the connection server 1-6 (Step Y11). The connection server 1-6 produces such an IP packet for indicating that the terminal 1-2 responds to the request of the call setting operation. The IP packet is referred to as an IP packet containing a response message (ANM), or simply called as a response message (ANM). The connection server 1-6 transmits the produced ANM message packet to the relay connection server 1-7 (Step Y12). The relay connection server 1-7 sends the received ANM message to the connection server 1-5 (Step Y13). Then, this connection server 1-5 notifies such a fact that the destination terminal 1-2 responds to the media router 1-3 (Step Y14). The media router 1-3 notifies the calling sound stop transmitted to the terminal 1-1 (Step Z14), so that the IP packet on which the digital voice is superimposed can be transmitted/received by employing the communication which is specified by the line number (CIC) between the terminals 1-1 and 1-2. Then, the operation is advanced to a terminal communication phase (Step Y15). As to the ANM message IP packet, at the Step Y5, the line number may be formed from a set of the transmission source telephone number and the destination terminal number, and may be saved in the message ANM. When a call interrupt request is issued (Step Z16), the media router 1-3 notifies the call interrupt request to the connection server 1-5 (Step Y16) and notifies a cut confirmation to the terminal 1-1 (Step Z18). When the connection server 1-5 receives the interrupt request, this connection server 1-5 discriminates the line number (CIC) from the set of the transmission source terminal number and the destination terminal number, and then produces such an IP packet employing a release request (REL) of the communication line. The produced IP packet is referred to as an IP packet containing a release (REL), or simply referred to as a release message (REL). The release message (REL) contains the line number (CIC). The connection server 1-5 sends the release message (REL) to the relay connection server 1-7 (Step Y17), and further, returns to the media router 1-3, such a recovery completion for indicating a completion of the interrupt request (Step Y18). The relay connection server 1-7 sends out the release request (REL) to the connection server 1-6 (Step Y19), and furthermore, produces such an IP packet indicative of a completion of the release request (REL). The produced IP packet is called as an IP packet containing a release completion (RLC), or simply referred to as a release completion message (RLC). This release completion message (RLC) is returned to the connection server 1-5 (Step Y20). When the connection server 1-6 receives the release request (REL), the connection server 1-6 sends out an interrupt request to the media router 1-4 (Step Y21), and also returns a release completion message (RLC) to the relay connection server 1-7 (Step Y22). The release completion message (RLC) implies that the release request (REL) is completed. When the media router 1-4 receives the interrupt request, the media router 1-4 notifies an interrupt instruction of a connection request call to the terminal 1-2 (Step Z22), and also to the connection server 1-6, an interrupt completion for indicating that the interrupt instruction is carried out (Step Y23). The terminal 1-2 notifies a recovery completion to the media router (Step E23). In the procedure for accomplishing the terminal communication, the terminal 1-2 may send the interrupt request of the terminal communication to the media router 1-4, which is similar to the above-explained procedure. Alternatively, while the relay connection server 1-7 is not present, a method for a terminal-to-terminal communication control between the connection servers 1-5 and 1-6 may be realized. After the terminal communication between the terminals 1-1 and 1-2 has been accomplished, namely at the Steps Y18 and Y22, both the connection servers 1-5 and 1-6 may acquire a terminal communication record including a line number (CIC), a communication time instant, and a telephone number, and may record the terminal communication record inside the connection server so as to be used for the charging and operation managing purposes. In the above described terminal-to-terminal communication connection control, when the terminal is a telephone set, the digital media is digitalized voice and the media communication is telephone communication, when the terminal is an IP terminal, the digital media is characters or digitalized still images and the media communication is IP data communication, when the terminal is an audio-moving image transmission/reception terminal, the digital media is digitalized audio-moving image and the media communication is voice-moving image communication, and when the terminal is a facsimile terminal, the digital media is digitalized facsimile image and the media communication is facsimile communication. The telephone number to discriminate the communicating terminals may be a terminal discrimination number to individually define specified terminals, for example, a terminal original number which is effective within the specified communication network. Also, there are various sorts of modified terminal-to-terminal communication connection control methods between a media router and a connection server, and between connection servers. Alternatively, the initiation of the ACM waiting timer defined at the Step Y2 may be omitted, and also the above-mentioned Step Y5 and Y6, namely address completion message (ACM) can be omitted. However, CPG waiting timer is set instead of the ACM waiting timer and is stopped after Step Y9. These means will be explained with reference to a following embodiment. The present invention is related to a terminal-to-terminal communication control method with employment of an IP transfer network. The above-explained object of the present invention may be achieved by such a terminal-to-terminal communication connection control method with employment of an IP transfer network wherein: in order to perform a multimedia IP communication between a first IP terminal and a second IP terminal, the first terminal transmits such an IP packet containing a host name of the second IP terminal via a domain name server contained in a media router and a network node apparatus to a domain name server contained in a integrated IP transfer network; the domain name server contained in the integrated IP transfer network returns such an IP address corresponding to the host name of the second IP terminal in an 1-to-1 correspondence relationship via the domain name server contained in the media router, or directly to the first IP terminal; when the first terminal sends out an IP packet to be transmitted to the second IP terminal, the IP packet reaches another network node apparatus connected to said second IP terminal via the media router connected to said first IP terminal and then the network node apparatus and more than one routers inside the IP transfer network, so as to deliver the IP packet to said IP terminal via another media router through a communication line and the domain name server is utilized. Also, the above-explained object of the present invention may be achieved by such a terminal-to-terminal communication connection control method with employment of an IP transfer network, wherein: in order to perform a telephone communication between a first dependent type IP telephone set and a second dependent type IP telephone set, when a handset of the first dependent type IP telephone set is taken up, such an IP packet for notifying a telephone call is transmitted from the first dependent type IP telephone set; a first H323 termination unit inside a first media router detects the IP packet, and returns a response IP packet to the first dependent type IP telephone set; the first dependent type IP telephone set transmits an IP packet containing the telephone number of the second dependent type IP telephone set via the first H323 termination unit and reach a first domain name server inside the first media router and a first network node apparatus connected with the first media router via the communication line; the first network node apparatus transmits the IP packet to a second domain name server inside a integrated IP transfer network; the second domain name server returns a second IP address corresponding to the telephone number of the first dependent type IP telephone set in an 1-to-1 correspondence relationship via the first domain name server or without passing through the first domain name server to the first H323 termination unit; when a first IP address is a source IP address in an 1-to-1 correspondence relationship with the first dependent type IP telephone set and the first H323 termination unit generates and sends an IP packet with a destination IP address as being the second IP address, the IP packet passes through the second H323 termination unit, the second network node apparatus, the more than one router inside the IP transfer network, the first network node apparatus and the first H323 termination unit, and reaches the first dependent IP telephone set; when the first user hangs up a handset upon completion of telephone communication, an IP packet indicating the completion of telephone communication is generated/transmitted with a source IP address as being the first IP address and a destination IP address as being the second IP address; when [the IP packet] passes through the first H323 termination unit, the first network node apparatus, the more than one router inside the IP transfer network, the second network node apparatus and the second H323 termination unit, and reaches the second dependent IP telephone set, thereby enabling the second user to acknowledge the completion of telephone communication; when the second user hangs up the telephone set and an IP packet for acknowledgement of completed telephone communication is generated and sent with a source IP address as being the second IP address and a destination IP address as being the first IP address, the IP packet passes through the second H323 termination unit, the second network node apparatus, the more than one router inside the IP transfer network and the first network node apparatus, and reaches the first H323 termination unit; when telephone communication is completed between the first dependent type IP telephone set and the second dependent type IP telephone set and an IP packet for transmitting the second dependent type IP telephone set from the H323 termination unit, the IP packet passes through the network node apparatus and the more than one router inside the IP transfer network and reaches another network node apparatus connected to the second dependent type IP telephone set, and the IP packet enters another media router via a communication line thereby enabling the same to reach the second dependent IP telephone set via the H323 termination unit; the IP packet reaches another second network node apparatus connected to the second dependent IP telephone set via the first network node apparatus and more than one routers inside the IP transfer network and arrives via the communication line at a second H323 termination unit which is inside another second router and connected to the second type dependent type telephone set; when a first user starts a telephone call, the first dependent IP telephone set sends an IP packet containing a voice sound expressed in digital form with a source IP address as being the first IP address and a destination IP address as being the second IP address; the IP packet passes through the first H323 termination unit, and reaches the second dependent IP telephone set; and when a second user causes a voice sound, the second dependent IP telephone set sends an IP packet containing a voice sound expressed in digital form with a source address as being the second IP address and a destination IP address as being the first IP address. The present invention is featured by that while an address management table is set to a network node apparatus employed in an IP transfer network, the means for registering an address of a terminal into this address management table (refer to Japanese Patent Application No. 128956/1999) is applied to the multicast technique, which will now be described. As a network in which an IP transfer network is operated/managed by a communication company, a network node apparatus is provided in this IP transfer network. Since the IP addresses of the IP terminals are registered into the network node apparatus, the IP packet transmission by the multicast method with improving the information security performance can be realized. When such an IP packet containing a multicast IP address which is not yet registered into the network node apparatus is received, this received IP packet is discarded (IP address filtering operation). Referring now to FIG. 19, both network node apparatus 1-11 to 1-14 and routers 1-15 to 1-20 are installed into an IP transfer network 1-10. These network node apparatus are directly connected to the routers by using an IP communication line, or in directly connected to the routers via the network node apparatus and the routers. IP terminals 1-21 to 1-27 having an IP packet transmission/reception function are connected to the network node apparatus by way of an IP communication line. An IP terminal does not directly allow the connection to the router. The network node apparatus 1-11 to 1-14 register thereinto at least an IP address among the IP terminal information about the IP terminals connected to the own node apparatus. As a first IP packet acceptance check, a check is made as to whether or not a destination IP address contained in a header of an external IP packet which is entered into an IP transfer network is registered into the address management table of the node apparatus. In the case that the destination IP address is not registered, this IP packet is discarded. As a second IP packet acceptance check, a check is made as to whether or not a transmission source IP address contained in a header of an external IP packet which is entered into an IP transfer network is registered into the address management table of the node apparatus. In the case that the destination IP address is not registered, this IP packet is discarded. As a first address registration check, while a destination multicast address is registered into the address management table of the network node apparatus, in such a case that a destination multicast address contained in a header of an external IP packet entered into the network node apparatus is not registered into the address management table, the network node apparatus discards the entered IP packet. As a result, it is possible to avoid such a condition that an unexpected IP packet is mixed into the IP transfer network. Also, since an address of a multicast transmission person is not allowed to be registered into an address management table of a network node apparatus of a packet reception person, an ACK packet cannot pass through the network node apparatus. The ACK packet is sent so as to confirm a reception of an IP packet, and is directed from the multicast IP packet reception person to the multicast IP packet transmission person. As a consequence, it is possible to prevent an occurrence of congestion of the IP transfer network, which is caused by ACK implosion of these ACK packets. Also, while an IP address of a router is not allowed to be registered as a destination address, a dangerous IP packet is not sent out from an IP transfer network to a router of the IP transfer network. The dangerous IP packet may mistakenly rewrite a content of a multicast table. Alternatively, while an IP address of an operation management server for multicast operation provided in an IP transfer network is not allowed to be registered, such an access operation from the IP transfer net work into the operation management server employed in the IP transfer network cannot be carried out, so that the information security performance can be improved. As a second address registration check, a transmission source of an IP packet containing multicast data is limited, so that an occurrence of unfair user can be suppressed. Also, in such a case that unfair action is carried out, an IP packet transmission source can be easily specified, so that the information security performance of the IP transfer network can be improved. BRIEF DESCRIPTION OF THE DRAWINGS In the accompanying Drawings: FIG. 1 is a block diagram for simply indicating a integrated IP transfer network; FIG. 2 is a block diagram for explaining a relationship between a exchanger and a signal network; FIG. 3 is a diagram for indicating an example of a signalling unit of the No. 7-common line signal system; FIG. 4 is a flow chart for explaining a relationship between a exchanger and a signal network; FIG. 5 is a flow chart for explaining a relationship between a exchanger and a signal network; FIG. 6 is a flow chart for explaining a relationship between a exchanger and a signal network; FIG. 7 is a flow chart for explaining a relationship between a exchanger and a signal network; FIG. 8 is block structural diagram for indicating a basic function of a gateway; FIG. 9 is a diagram for representing an example of call control data contained in an IP packet; FIG. 10 is a diagram for showing an example of voice data contained in an IP packet; FIG. 11 is a diagram for showing an example of image data contained in an IP packet; FIG. 12 is a block diagram for indicating a basic idea of a integrated information communication network; FIG. 13 is a block diagram for indicating a basic idea of a integrated information communication network; FIG. 14 is a block diagram for indicating a basic idea of a integrated information communication network; FIG. 15 is a diagram for explaining operation of the integrated information communication network; FIG. 16 is a block diagram for showing a structural example of a multicast IP transfer network; FIG. 17 shows an example of a multicast table used in the multicast IP transfer network; FIG. 18 is a diagram for explaining a terminal-to-terminal communication connection control method of an IP transfer network to which the common line communication signal system is applied; FIG. 19 is a schematic diagram for describing a structure of a management type IP network for registering terminals according to the present invention; FIG. 20 is a schematic diagram for showing a node of an IP transfer network directed to the present invention; FIG. 21 is an auxiliary diagram for explaining a function of a media router disclosed as a first embodiment of the present invention, and a function of a gateway disclosed as a second embodiment; FIG. 22 is an explanatory diagram for explaining one mode of an IP packet used to describe the functions of the media router/gateways according to the first embodiment and the second embodiment of the present invention; FIG. 23 is an auxiliary diagram for schematically representing an arrangement of the media router according to the first embodiment of the present invention, and for explaining operation sequence of this media router; FIG. 24 is an auxiliary diagram for schematically representing an arrangement of the media router according to the first embodiment of the present invention, and for explaining operation sequence of this media router; FIG. 25 is a diagram for explaining an address management table contained in a network node apparatus according to the first embodiment of the present invention; FIG. 26 is a diagram for explaining a mode of an IP packet appearing in two IP terminal-to-terminal communications; FIG. 27 is a diagram for explaining a mode of an IP packet appearing in two IP terminal-to-terminal communications; FIG. 28 is a diagram for explaining a mode of an IP packet appearing in two IP terminal-to-terminal communications; FIG. 29 is a diagram for explaining a mode of an IP packet appearing in two IP terminal-to-terminal communications; FIG. 30 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 31 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 32 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 33 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 34 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 35 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 36 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 37 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 38 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 39 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication. FIG. 40 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 41 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 42 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication. FIG. 43 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication. FIG. 44 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 45 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 46 is a diagram for explaining a mode of an IP packet appearing in two IP telephones communication; FIG. 47 is a diagram for showing an example of a media router condition table provided in the media router; FIG. 48 is a block diagram for representing a conceptional structure of an independent type telephone set; FIG. 49 is a block diagram for representing a conceptional structure of an independent type IP voice/image apparatus; FIG. 50 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 51 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 52 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 53 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 54 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 55 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 56 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 57 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 58 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 59 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 60 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 61 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 62 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 63 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 64 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 65 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication in the first embodiment of the present invention; FIG. 66 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication in the first embodiment of the present invention; FIG. 67 is a schematic diagram for explaining a RAS management of the media router in the first embodiment of the present invention; FIG. 68 is an auxiliary diagram for schematically showing a structure of a gateway according to a second embodiment of the present invention, and for explaining operation sequence of this gateway; FIG. 69 is an auxiliary diagram for schematically showing a structure of a gateway according to a second embodiment of the present invention, and for explaining operation sequence of this gateway; FIG. 70 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 71 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 72 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 73 is a diagram for explaining another embodiment mode of an IP packet appearing in two IP telephone sets communication in the second embodiment of the present invention; FIG. 74 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 75 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 76 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 77 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 78 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 79 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 80 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 81 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 82 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 83 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 84 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 85 is a diagram for describing another embodiment mode of an IP packet appearing in two IP telephone sets communication; FIG. 86 is a diagram for explaining another address management table employed in the network node apparatus according to the second embodiment of the present invention; FIG. 87 is a description example of a gateway condition table in the second embodiment of the present invention; FIG. 88 is a schematic diagram for showing an arrangement of a media router mounted inside a CATV system according to a third embodiment of the present invention; FIG. 89 is a diagram for explaining a method of connecting various sorts of terminals by using a wireless terminal storage apparatus and a gateway apparatus according to a fourth embodiment of the present invention; FIG. 90 is a block diagram for indicating a structural example of a gateway according to a fifth embodiment of the present invention; FIG. 91 is a block diagram for showing a structural diagram in the case of employing a telephone communication control server in a sixth embodiment of the present invention; FIG. 92 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 93 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 94 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 95 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 96 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 97 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 98 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 99 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 100 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 101 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 102 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 103 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 104 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 105 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 106 is a flow chart for explaining operations of the sixth embodiment of the present invention; FIG. 107 is a flow chart for explaining a sixth embodiment (release phase) of the present invention; FIG. 108 is a diagram for explaining a sixth embodiment (one communication company) of the present invention; FIG. 109 is a flow chart for explaining the sixth embodiment of the present invention; FIG. 110 is a flow chart for explaining the sixth embodiment of the present invention; FIG. 111 is a diagram for indication an example of a communication company segment table of telephone numbers; FIG. 112 is a diagram for representing an example of a telephone management server segment table of telephone numbers; FIG. 113 is a block diagram for indicating a structural example of a media router according to a seventh embodiment of the present invention; FIG. 114 is an explanatory diagram for explaining the seventh embodiment of the present invention; FIG. 115 is a block diagram for representing an arrangement of an eighth embodiment of the present invention; FIG. 116 is a flow chart for showing an operation example of the eighth embodiment of the present invention; FIG. 117 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 118 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 119 is a flow chart for indicating an operation example of the eighth embodiment of the present invention; FIG. 120 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 121 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 122 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 123 is an explanatory diagram for explaining the sixth embodiment of the present invention; FIG. 124 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 125 is an explanatory diagram for explaining the sixth embodiment of the present invention; FIG. 126 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 127 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 128 is a diagram for explaining an eighth embodiment (another example of media router) of the present invention; FIG. 129 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 130 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 131 is an explanatory diagram for explaining the eighth embodiment of the present invention; FIG. 132 is a schematic diagram for indicating an internal portion of a media router, and a connection condition of IP terminal and LAN, connected to this media router; FIG. 133 is a diagram for indicating an example of a calling priority order control management table; FIG. 134 is a diagram for indicating an example of a calling priority order control management table; FIG. 135 is a diagram for explaining a ninth embodiment of the present invention; FIG. 136 is a block diagram for indicating an arrangement of the ninth embodiment of the present invention; FIG. 137 is a flow chart for explaining an operation example of the ninth embodiment of the present invention; FIG. 138 is an explanatory diagram for explaining the ninth embodiment of the present invention; FIG. 139 is an explanatory diagram for explaining the ninth embodiment of the present invention; FIG. 140 is an explanatory diagram for explaining the ninth embodiment of the present invention; FIG. 141 is an explanatory diagram for explaining the ninth embodiment of the present invention; FIG. 142 is an explanatory diagram for explaining the ninth embodiment of the present invention; FIG. 143 is an explanatory diagram for explaining the ninth embodiment of the present invention; FIG. 144 is an explanatory diagram for explaining the ninth embodiment of the present invention; FIG. 145 is a block diagram for indicating an arrangement of the tenth embodiment of the present invention; FIG. 146 is a flow chart for explaining an operation example of the tenth embodiment of the present invention; FIG. 147 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 148 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 149 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 150 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 151 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 152 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 153 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 154 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 155 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 156 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 157 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 158 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 159 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 160 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 161 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 162 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 163 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 164 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 165 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 166 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 167 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 168 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 169 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 170 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 171 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 172 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 173 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 174 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 175 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 176 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 177 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 178 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 179 is a flow diagram for showing an operation example of the tenth embodiment of the present invention; FIG. 180 is a flow diagram for showing an operation example of the tenth embodiment of the present invention; FIG. 181 is a flow chart for describing an operation example (TCP-IAM) of the tenth embodiment of the present invention; FIG. 182 is a flow chart for explaining an operation example (TCP-ACM) of the tenth embodiment of the present invention; FIG. 183 is a flow chart for describing an operation example (TCP-CPG) of the tenth embodiment of the present invention; FIG. 184 is a flow chart for explaining an operation example (TCP-ANM) of the tenth embodiment of the present invention; FIG. 185 is a flow chart for describing an operation example (TCP-REL) of the tenth embodiment of the present invention; FIG. 186 is a flow chart for explaining an operation example (TCP-RLC) of the tenth embodiment of the present invention; FIG. 187 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 188 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 189 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 190 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 191 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 192 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 193 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 194 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 195 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 196 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 197 is an explanatory diagram for explaining the tenth embodiment of the present invention; FIG. 198 is a block diagram for showing an arrangement of an 11-th embodiment of the present invention; FIG. 199 is a flow chart for showing operations of the 11-th embodiment of the present invention; FIG. 200 is a flow chart for showing operations of the 11th embodiment of the present invention; FIG. 201 is a flow chart for showing operations of the 11th embodiment of the present invention; FIG. 202 is a block diagram for showing an arrangement of a 12-th embodiment of the present invention; FIG. 203 is an explanatory diagram for explaining the 12th embodiment of the present invention; FIG. 204 is an explanatory diagram for explaining the 12th embodiment of the present invention; FIG. 205 is a flow chart for showing operations of the 12th embodiment of the present invention. FIG. 206 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 207 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 208 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 209 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 210 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 211 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 212 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 213 is a flow chart for showing operations of the 12th embodiment of the present invention; FIG. 214 is a block diagram for showing a 13-th embodiment of the present invention; FIG. 215 is a flow chart for describing an operation example of the 13-th embodiment of the present invention; FIG. 216 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 217 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 218 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 219 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 220 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 221 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 222 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 223 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 224 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 225 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 226 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 227 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 228 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 229 is an explanatory diagram for explaining the 13-th embodiment of the present invention; FIG. 230 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 231 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 233 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 234 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 235 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 236 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 237 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 238 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 239 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 240 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 241 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 242 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 243 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 244 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 245 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 246 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 247 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 248 is an explanatory diagram for explaining the 13th embodiment of the present invention; FIG. 249 is a block diagram for showing a 14-th embodiment of the present invention; FIG. 250 is a flow chart for describing an operation example of the 14-th embodiment of the present invention; FIG. 251 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 252 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 253 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 254 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 255 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 256 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 257 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 258 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 259 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 260 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 261 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 262 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 263 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 264 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 265 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 266 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 267 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 268 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 269 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 270 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 271 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 272 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 273 is an explanatory diagram for explaining the 14-th embodiment of the present invention. FIG. 274 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 275 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 276 is an explanatory diagram for explaining the 14th embodiment of the present invention; FIG. 277 is a block diagram for showing a 15-th embodiment of the present invention; FIG. 278 is a flow chart for describing an operation example of the 15-th embodiment of the present invention; FIG. 279 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 280 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 281 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 282 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 283 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 284 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 285 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 286 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 287 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 288 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 289 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 290 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 291 is an explanatory diagram for explaining the 15th embodiment of the present inventions FIG. 292 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 293 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 294 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 295 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 296 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 297 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 298 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 299 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 300 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 301 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 302 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 303 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 304 is an explanatory diagram for explaining the 15th embodiment of the present invention; FIG. 305 is a block diagram for showing a 16-th embodiment of the present invention; FIG. 306 is a flowchart for describing an operation example of the 16-th embodiment of the present invention; FIG. 307 is an explanatory diagram for explaining the 16th embodiment of the present invention; FIG. 308 is an explanatory diagram for explaining the 16th embodiment of the present invention; FIG. 309 is an explanatory diagram for explaining the 16th embodiment of the present invention; FIG. 310 is a part of a block diagram for showing a 17-th embodiment of the present invention; FIG. 311 is a part of a block diagram for showing a 17-th embodiment of the present invention; FIG. 312 is a part of a block diagram for showing a 17-th embodiment of the present invention; FIG. 313 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 314 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 315 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 316 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 317 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 318 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 319 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 320 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 321 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 322 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 323 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 324 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 325 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 326 is a part of a diagram for explaining the address management table in the 17-th embodiment of the present invention; FIG. 327 is a part of a diagram for explaining the address management table in the 17-th embodiment of the present invention; FIG. 328 is a part of a diagram for explaining the address management table in the 17-th embodiment of the present invention; FIG. 329 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 330 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 331 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 332 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 333 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 334 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 335 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 336 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 337 is an explanatory diagram for explaining the 17th embodiment of the present invention; FIG. 338 is a part of a block diagram for showing the 18th embodiment of the present invention; FIG. 339 is a part of a block diagram for showing the 18th embodiment of the present invention; FIG. 340 is a part of a block diagram for showing the 18th embodiment of the present invention; FIG. 341 is a part of a block diagram for showing the 18th embodiment of the present invention; FIG. 342 is an explanatory diagram for explaining the 18th embodiment of the present invention; FIG. 343 is an explanatory diagram for explaining the 18th embodiment of the present invention; FIG. 344 is an explanatory diagram for explaining the 18th embodiment of the present invention; FIG. 345 is an explanatory diagram for explaining the 18th embodiment of the present invention; FIG. 346 is an explanatory diagram for explaining the 18th embodiment of the present invention; FIG. 347 is a part of a block diagram for showing a 19-th embodiment of the present invention; FIG. 348 is a part of a block diagram for showing a 19-th embodiment of the present invention; FIG. 349 is a part of a block diagram for showing a 19-th embodiment of the present invention; FIG. 350 is an explanatory diagram for explaining the 19th embodiment of the present invention; FIG. 351 is an explanatory diagram for explaining the 19th embodiment of the present invention; FIG. 352 is a block diagram for showing a 20-th embodiment of the present invention; FIG. 353 is an explanatory diagram for explaining the 20th embodiment of the present invention; FIG. 354 is an explanatory diagram for explaining the 20th embodiment of the present invention; FIG. 355 is an explanatory diagram for explaining the 20th embodiment of the present invention; FIG. 356 is an explanatory diagram for explaining the present invention; FIG. 357 is an explanatory diagram for explaining the present invention; FIG. 358 is an explanatory diagram for explaining the present invention; FIG. 359 is an explanatory diagram for explaining the present invention; and FIG. 360 is an explanatory diagram for explaining the present invention. DESCRIPTION OF THE PREFERRED EMBODIMENTS It should be understood that both the IP-capsulation operation and the IP-inverse-capsulation operation, which are explained in the embodiment of the present invention, may be replaced by both a capsulation operation and an inverse-capsulation operation executed in a layer lower than the communication layer-3 layers, for instance, may be substituted by both a capsulation operation and an inverse-capsulation operation by a header of an optical HDLC frame of the communication layer-2 layers. Furthermore, an internal address of a transmission source is not contained in a header which is applied in a capsulation operation and an inverse-capsulation operation. In other words, both a simple capsulation operation and a simple inverse-capsulation operation may be realized to which a simple header is applied. It should also be noted that similarly in this simple capsulation operation, an address administration table having the same function is employed, which is used in the capsulation operation and the inverse-capsulation operation. Referring now to FIG. 357, the simple capsulation operation will be described. In this drawing, block 2300 indicates an IP communication network; reference numerals 2301, 2302, 2303, 2304, 2305 denote network node apparatus; reference numerals 2301-1, 2302-1, 2303-1, 2304-1, 2305-1 show address administration tables; and reference numerals 2301-1, 2301-3, 2302-2, 2302-3, 2303-2, 2303-3, 2304-2, 2304-3 represent contents (logic terminals) between termination units of communication lines and the network node apparatus. Internal addresses “IA1”, “IA2”, “IA3”, “IA4”, “IA5”, “IA6”, “IA7”, “IA8” are applied to these logic terminals. Reference numerals 2306-1 to 2306-9 show IP terminals having functions for transmitting/receiving IP packets, and own external IP addresses “EA1” to “EA9”. Reference numerals 2307-1 to 2307-4 shown routers. The above-explained network node apparatus and routers are directly connected via a communication line to each other, or are indirectly connected via routers to each other. The terminals are connected via a communication line to the network node apparatus. In the description of FIG. 357, only an IP header portion is described as a header portion of an IP, and other items are omitted. In the case that the terminal 2306-1 transmits such a IP packet 2310 whose transmission source address is equal to “EA1” and whose destination address is equal to “EA3” and also the network node apparatus 2301 receives an IP packet 2310, the network node apparatus 2301 confirms such a fact that an internal address applied to a logic terminal of a terminal of a communication line into which the IP packet 2310 is entered is equal to “IA1”, and furthermore, a destination external IP address of the IP packet 2310 is equal to “EA3”. Then, the network node apparatus 2301 retrieves a content of the address administration table 2301-1, and also retrieves a record containing such addresses that an internal IP address of a transmission source corresponds to “IA1” in the beginning, and subsequently, an external destination IP address corresponds to “EA3”. Furthermore, the network node apparatus 2301 checks as to whether or not the transmission source external IP address “EA1” contained in the IP packet 2310 is included in the above-detected record. In this example, a record of a first column of the address administration table 2301-1 from a top column is equal to “EA1, EA3, IA1, IA3”. While using the address of “IA3” present in this record, a simple header is applied to the IP packet 2310 so as to form an internal packet 2313 (namely, simple capsulation operation). It should be noted that the simple header does not contain the transmission source internal address “IA1”. The formed internal packet 2313 is reached via the routers 2307-1 and 2307-2 to the network node apparatus 2302. The network node apparatus 2302 removes the simple header of the received internal packet 2313 (simple inverse-capsulation operation), and sends out the acquired external IP packet 2317 (having the same content of IP packet 2310) to the communication line. Then, the IP terminal 2306-3 receives this IP packet 2317. It should also be noted that the record “EA3, EA1, IA3, IA1” of the first column of the address administration table 2302-1 is used so as to transfer the IP packet by employing a method similar to the above-described method along a direction opposite to the above-explained direction. When the simple capsulation operation is carried out in the network node apparatus 2301, such a checking operation may be omitted. That is, the network node apparatus 2301 checks as to whether or not the transmission source external IP address “EA1” contained in the IP packet 2310 is included in the detected record within the address administration table 2301-1. In such a case of the above-explained checking operation of the IP address “EA1”, the respective records of the address administration table 2301-1 can be made excluding the transmission source external IP address. Furthermore, with respect to two external IP addresses (namely, transmission source IP address and destination IP address) contained in each of the records of the address administration table 2301-1, such a simple capsulation technical method which is made based upon a similar principle idea to an address mask technical method (will be discussed later) may be applied. A description will now be made of another example where an IP packet is transferred. In the case that the terminal 2306-5 transmits such an IP packet 2312 whose transmission source address is equal to “EA5” and whose destination address is equal to “EA4” and also the network node apparatus 2303 receives an IP packet 2312, the network node apparatus 2303 confirms such a fact that an internal address applied to a logic terminal of a terminal of a communication line into which the IP packet 2312 is entered is equal to “IA5”, and furthermore, a destination external IP address of the IP packet 2312 is equal to “EA4”. Then, the network node apparatus 2303 retrieves a content of the address administration table 2303-1, and also retrieves such a record that the transmission source internal IP address is equal to “IA5” in the beginning. In this case, a record “Mask7, EA7 x, IA5, IA7” of a first column of the address administration table 2303-1 from a top column corresponds to a record “Mask4, EA4 x, IA5, IA4” of a second column of this address administration table. As to the record of the first column, the network node apparatus 2303 checks as to whether or not a result of “AND”-gating operation between the mask “Mask7” and the destination external IP address “EA4” contained in the external IP packet 2312 is made coincident with the destination external IP address “EA7 x” contained in the record of the first column (refer to below-mentioned formula (4)). In this case, the “AND”-gating result is not made coincident with the destination external IP address “EA7 x”. Next, as to the record of the second column, the network node apparatus 2303 checks as to whether or not a result of “AND”-gating operation between the destination external IP mask “Mask4” and the destination external IP address “EA4” contained in the external IP packet 2312 is made coincident with the destination external IP address “EA4 x” contained in the record of the second column (refer to below-mentioned formula (5)). In this case, this “AND”-gating result is made coincident with the destination external IP address “EA4 x”. If (“Mask7” and “EA4”=“EA7x”)  (4) If (“Mask4” and “EA4”=“EA4x”)  (5) In this example, a record of a second column of the address administration table 2303-1 from a top column is equal to “Mask4, EA4 x, IA5, IA4”. While using the address of “IA4” present in this record, a simple header is applied to the IP packet 2312 so as to form an internal packet 2314 (namely, simple capsulation operation). It should be noted that the simple header does not contain the transmission source internal address “IA5”. The formed internal packet 2314 is reached via the routers 2307-3, 2307-4 and 2307-2 to the network node apparatus 2302. The network node apparatus 2302 removes the simple header of the received internal packet 2314 (simple inverse-capsulation operation), and sends out the acquired external IP packet 2318 (having the same content of IP packet 2312) to the communication line. Then, the IP terminal 2306-4 receives this IP packet 2318. Next, in the network node apparatus 2301-1, an IP packet 2311 which is sent from the terminal 2306-2 to the terminal 2306-7 is simple-capsulated in a capsulation manner similar to the above-explained capsulation manner by employing a record “EA2, EA7, IA2, IA7” of a second column of the address administration table 2301-1 so as to become an internal capsule 2316. This internal capsule 2316 is reached via the routers 2307-1, 2307-2 and 2307-4 to the network node apparatus 2304. This network node apparatus 2304 removes the simple header of the received internal packet 2316 (namely, simple reverse-capsulation operation), and then sends out the acquired external IP packet 2319 (having the same content of IP packet 2311) to the communication line, and the IP terminal 2306-7 receives this IP packet 2319. It should also be understood that the above-explained address mask technical method has a similar basic idea to that of the address mask technical method as explained with reference to FIG. 351. As another example of the capsulation operation and the inverse-capsulation operation by employing the simple header, the known MPLS label by way of the MPLS technical method may be utilized. In this example, while the MPLS label contains the destination internal address, the MPLS label does not contain the transmission source internal address. Next, in the network node apparatus 2305, the IP packet 2321 sent out from the terminal 2306-9 to the terminal 2306-8 undergoes a simple encapsulation using the record “Msk8, EA8 y, IA8” in the second line of the address management table 2305-1 according to a method similar to that of the above-mentioned case thereby to become an internal capsule 2322, which goes through the router 2307-4 and then reaches the network node apparatus 2304. The network node apparatus 2304 removes the simple header of the received internal packet 2322 (simple decapsulation), and then sends out the external IP packet 2323 (having the same contents of the IP packet 2321) obtained as described above onto the communication line. The IP terminal 2306-8 then receives the IP packet 2319. FIG. 358 shows the form of an internal packet (referred to also as an internal frame) formed in the above-mentioned simple encapsulation. The internal packet has a form in which a simple header is added to an external IP packet. The simple header includes a destination internal address and an information region, but does not include a transmission source internal address. The information region includes the information (protocol and the like) concerning the payload region of the internal packet. Another embodiment of the above-mentioned simple encapsulation and decapsulation is described below with reference to FIGS. 359 and 360. In the figure, reference numerals 2351-1 to 2351-7 indicate IP transfer networks. Reference numerals 2352-1 to 2352-7 indicate terminals having an external IP address “EA1”. Reference numerals 2353-1 to 2353-7 indicate terminals having an external IP address “EA2”. Reference numerals 2354-1 to 2354-7 indicate internal packets (internal frames). Reference numerals 2355-1 to 2355-7 and 2356-1 to 2356-7 indicate network node apparatuses. Each reference numeral 2359-1 to 2359-7 indicates a connection point (logical terminal) between a communication line and a network node apparatus, and an internal IP address “IA1” is assigned. Each reference numeral 2360-1 to 2360-7 indicates a connection point (logical terminal) between a communication line and a network node apparatus, and an internal IP address “IA2” is assigned. Reference numerals 2357-1 to 2357-7 and 2358-1 to 2358-7 indicate address administration tables. Each terminal and each network node apparatus are interconnected by a communication line, and so are each network node apparatus and the other terminals. An IP packet is transmitted and received between each terminal and each network node apparatus, while an above-mentioned internal packet (internal frame) is transferred between the network node apparatuses. The terminal 2352-1 transmits an IP packet having a transmission source address “EA1” and a destination address “EA2”. On receiving the IP packet, the network node apparatus 2355-1 confirms that the internal address assigned to the logical terminal at the termination end of the communication line to which the IP packet is inputted is “IA1”, and that the destination external IP address of the IP packet is “EA2”. The network node apparatus then searches the inside of the address administration table 2357-1 thereby to find a record having firstly the transmission source internal IP address “IA1” and secondly the destination external IP address “EA2”. In this example, this is the record “EA2, IA1, IA2” in the first line of the address administration table 2357-1. By using the address “IA2” within the record, a simple header is added to the IP packet, whereby an internal packet 2354-1 is formed (simple encapsulation). The formed internal packet 2354-1 goes through the communication line and then reaches the network node apparatus 2356-1. The network node apparatus 2356-1 removes the simple header of the received internal packet 2354-1 (simple decapsulation), and then sends out the obtained external IP packet to the communication line. The IP terminal 2353-1 then receives the restored IP packet. The terminal 2352-2 transmits an IP packet having a transmission source address “EA1” and a destination address “EA2”. On receiving the IP packet, regardless of the internal address assigned to the logical terminal at the termination end of the communication line to which the IP packet is inputted, the network node apparatus 2355-2 confirms that the transmission source external IP address of the IP packet is “EA1”, and that the destination external IP address is “EA2”. The network node apparatus then searches the inside of the address administration table 2357-2. In this example, the result is the record “EA1, EA2, IA2” in the first line of the address administration table 2357-2. By using the address “IA2” within the record, a simple header is added to the IP packet, whereby an internal packet 2354-2 is formed (simple encapsulation). The formed internal packet 2354-2 goes through the communication line and then reaches the network node apparatus 2356-2. The network node apparatus 2356-2 removes the simple header of the received internal packet 2354-1 (simple decapsulation), and then sends out the obtained external IP packet to the communication line. The IP terminal 2353-2 then receives the restored IP packet. The terminal 2352-3 transmits an IP packet having a transmission source address “EA1” and a destination address “EA2”. On receiving the IP packet, regardless of the internal address assigned to the logical terminal at the termination end of the communication line to which the IP packet is inputted, the network node apparatus 2355-3 confirms that the destination external IP address of the IP packet is “EA2”. The network node apparatus then searches the inside of the address administration table 2357-1 thereby to find a record having the destination external IP address “EA2”. In this example, the result is the record “EA2, IA2” in the first line of the address administration table 2357-1. By using the address “IA2” within the record, a simple header is added to the IP packet, whereby an internal packet 2354-3 is formed (simple encapsulation). The formed internal packet 2354-3 goes through the communication line and then reaches the network node apparatus 2356-3. The network node apparatus 2356-1 removes the simple header of the received internal packet 2354-3 (simple decapsulation), and then sends out the obtained external IP packet to the communication line. The IP terminal 2353-3 then receives the IP packet. The terminal 2352-4 transmits an IP packet having a transmission source address “EA1” and a destination address “EA2”. On receiving the IP packet, the network node apparatus 2355-4 confirms that the internal address assigned to the logical terminal at the termination end of the communication line to which the IP packet is input is “IA1”, and that the destination external IP address of the IP packet is “EA2”. The network node apparatus then searches the inside of the address administration table 2357-4 thereby to find a record having firstly the transmission source internal IP address “IA1”. In this example, the result is the record “Msk1, EA1 x, Msk2, EA2 x, IA, IA2” in the first line of the address administration table 2357-4. The network node apparatus checks first whether the result of the “and” operation between the mask “Msk2” of the record in the first line and the destination external IP address “EA2” of the input external IP packet coincides with the destination external IP address “EA2 x” of the record in the first line or not (the following equation (6)), and further checks whether the result of the “and” operation between the transmission source external IP mask “Msk1” and the transmission source external IP address “EA1” in the external IP packet coincides with the destination external IP address “EA1 x” in the record or not (the following equation (7)). They coincide in this case. If (“Msk2” and “EA2”=“EA2x”)  (6) If (“Msk1” and “EA1”=“EA1x”)  (7) In this example, it is the above-mentioned record in the first line of the address administration table 2357-4. By using the address “IA2” within the record, a simple header is added to the IP packet, whereby an internal packet 2354-4 is formed (simple encapsulation). The formed internal packet 2354-4 goes through the communication line and then reaches the network node apparatus 2356-4. The network node apparatus 2356-4 removes the simple header of the received internal packet 2354-4 (simple decapsulation), and then sends out the obtained external IP packet to the communication line. The IP terminal 2353-4 then receives the IP packet. The case that the terminal 2352-5 transmits an IP packet having a transmission source address “EA1” and a destination address “EA2” and that the network node apparatus 2355-5 receives the IP packet is similar to the case that the terminal 2352-4 transmits the IP packet having a transmission source address “EA1” and a destination address “EA2”. The point of difference is not to carry out the “and” operation between the destination external IP mask and the destination external IP address in the external IP packet. The other points are the same. The case that the terminal 2352-6 transmits an IP packet having a transmission source address “EA1” and a destination address “EA2” and that the network node apparatus 2355-6 receives the IP packet is similar to the case that the terminal 2352-4 transmits the IP packet having a transmission source address “EA1” and a destination address “EA2”. The point of difference is not to carry out the confirmation on the internal address assigned to the logical terminal at the termination end of the communication line to which the IP packet is inputted. The other points are the same. The case that the terminal 2352-7 transmits an IP packet having a transmission source address “EA1” and a destination address “EA2” and that the network node apparatus 2355-7 receives the IP packet is similar to the case that the terminal 2352-5 transmits the IP packet having a transmission source address “EA1” and a destination address “EA2”. The point of difference is not to carry out the confirmation on the internal address assigned to the logical terminal at the termination end of the communication line to which the IP packet is inputted. The other points are the same. In accordance with the present invention, the terminal-to-terminal communication connection control method applicable to IP transfer networks may be realized, while combining several functions with each other, or changing some functions, which are disclosed in Japanese Patent Application No. 128956/1999 filed by the Applicant, the line (circuit) connecting method of the No. 7-common line signal system, “JT-H323 gateway standardized by ITU-T recommendation H323 ANNEX D”, “SIP telephone protocol”, and the embodiment-36 of Japanese Patent No. 3084681-B2. Furthermore, while a media router, a gateway, and an IP network service operation/management server are conducted, the arrangements and the operation sequences of the media router and the gateway are concretely defined; modes of IP packets used in terminal-to-terminal communications with employment of the media router and the gateway are concretely defined; and also the functions which should be owned by the IP network service operation/management servers are concretely defined. In accordance with Japanese Patent Application No. 128956/1999, the integrated IP transfer network contains a plurality of IP transfer networks. In other words, the integrated IP transfer network contains at least two, or more networks of the IP data network, the IP telephone network, the IP voice/image network (IP audio/visual network), the best effort network, the IP data multicast network, the IP base TV broadcast network, and the network node apparatus. The network node apparatus is connected via the communication line to any one, or more of the IP transfer networks. On the other hand, the network node apparatus terminal of the network node apparatus is connected via the communication line to the terminal externally provided with the integrated IP transfer network. In the present invention, an integrated IP transfer network contains thereinto one, or more gateways. Alternatively, the integrated IP transfer network is directly connected via a communication line connected to a network node apparatus to one, or more media routers, otherwise, is indirectly connected to a media router provided inside a LAN. Both a gateway and a media router correspond to one sort of such a router having a function that an IP terminal, an IP telephone set, an IP voice/image (audio/visual) apparatus, and the like are directly connected to the router so as to be stored thereinto. While either the gateway or the media router, and a domain name server provided inside the integrated IP transfer network, are employed, a connection control of terminal-to-terminal communications is carried out by employing an IP transfer network among terminals. In order that terminals are registered/recorded into the IP transfer network, at least addresses of these terminals are recorded/saved in an address management table employed in the network node apparatus, or in the domain name server installed in the IP transfer network. Also, an IP network service operation/management server is provided in each of the IP transfer networks. This IP network service operation/management server is provided so as to manage resources of network in a batch mode every communication industry. As the network resources, there are operation/management of the IP transfer network, services provided by the IP transfer networks, the routers, and communication lines. The sort of the above-explained IP service operation/management servers may be determined with respect to each of the various IP transfer networks. For instance, an IP data service operation/management server (DNS) for managing IP data communications in a batch mode may be installed inside the IP data network. Also, an IP telephone service operation/management server (TES) for managing telephone communications in a batch mode may be installed inside the IP telephone network. Also, an IP voice/image service operation/management server (AVS) for managing voice/image communications in a batch mode may be installed inside the IP voice/image network. A best effort service operation/management server (BES) for managing best effort communications in a batch mode may be installed inside a best effort network. An IP data multicast service operation/management server (DMS) for managing IP data multicast communications in a batch mode may be installed inside an IP data multicast network. Further, an IP base TV broadcast service operation/management server (TVS) for managing IP base TV broadcasting operations in a batch mode may be installed in an IP base TV broadcast network. It should be understood that a service operation/management server provided in each of the IP transfer networks may be subdivided into a network service server and a network operation/management server. The network service server mainly manages network services provided by the respective IP transfer networks, whereas the network operation/management server mainly manages resources of a network. Referring now to drawings, various embodiments of the present invention will be described. 1. First Embodiment Using Media Router In FIG. 20, reference numeral 2 shows an integrated IP transfer network, reference numeral 3 indicates an IP data network, reference numeral 4 represents an IP telephone network, reference numeral 5-1 denotes an IP voice/image network, reference numeral 5-2 shows a best effort network, reference numeral 6-1 indicates a range of an IP transfer network operated/managed by a communication company “X”, and reference numeral 6-2 represents a range of an IP transfer network operated/managed by a communication company “Y”. Also, reference numerals 7-1, 7-2, 7-3, 7-4, 8-1, 8-2, 8-3 and 8-4 show a network node apparatus, respectively. Reference numerals 9-1 and 9-2 represent gateways. Reference numerals 10-1 to 10-8 show communication lines, reference numerals 11-1 to 11-10 denote IP terminals, reference numerals 12-1 and 12-2 show independent type IP telephone sets, and reference numerals 13-1 to 13-4 represent dependent type IP telephone sets. Further, reference numerals 16-1 to 16-4 represent dependent type IP voice/image apparatus. The network node apparatus is connected to any of the IP transfer networks via a communication line. In other words, the network node apparatus is connected to one, or more networks of the IP data network 3, the IP telephone network 4, the IP voice/image network 5-1 and the best effort network 5-2. On the other hand, the network node apparatus is connected via the communication lines 10-1 to 10-8 to the IP terminals 11-1 and 11-2, the independent type IP telephone sets 12-1 and 12-2, the media routers 14-1 and 14-2, and the LANs 15-1 and 15-2. The IP terminals are installed outside the integrated IP transfer network. The media routers 14-3 and 14-4 are installed inside the LAN 15-1 and the LAN 15-2, and are indirectly connected to the network node apparatus. The media routers 14-1 to 14-4 are directly connected to the dependent type IP telephone sets 13-1, 13-2, 13-4; the dependent type IP voice/image apparatuses 16-1, 16-2, 16-3; and analog telephone sets 18-1 to 18-4 so as to store thereinto them. Other analog telephone sets 18-5 and 18-6 are connected via public switched telephone networks 26-1 and 26-2 to the gateways 9-1 and 9-2. The gateway 9-1 is connected via a communication line to the network node apparatus 8-4, and the gateway 9-2 is connected via a communication line to the network node apparatus 7-4. Reference numerals 19-1 to 19-19 show routers which transfer IP packets, and reference numerals 26-1 and 26-2 represent public switched telephone networks (will be referred to as a “PSTN” hereinafter). The media router 14-1 is connected via the communication line 10-1 to the network node apparatus 8-2, the media router 14-2 is connected via the communication line 10-5 to the network node apparatus 7-2, the LAN 15-1 is connected via the communication line 10-3 to the network node apparatus 8-4, and the LAN 15-2 is connected via the communication line 10-7 to the network node apparatus 7-4. The analog telephone set 18-5 is connected to the network node apparatus 8-4 via the telephone line 17-3, the public switched telephone network 26-1, the telephone line 17-1 and the gateway 9-1. Similarly, the analog telephone set 18-6 is connected to the network node apparatus 7-4 via the telephone line 17-4, the public switched telephone network 26-2, the telephone line 17-2 and the gateway 9-2. The media router 14-1 contains a router 20-3, a connection control unit 22-1, an H323 termination unit 23-1 and an SCN interface 24-1. The router 20-3 is connected to the connection control unit 22-1. The connection control unit 22-1 is connected to the H323 termination unit 23-1. The H323 termination unit 23-1 is connected to the SCN interface. Similarly, the media router 14-2 contains a router 20-4, a connection control unit 22-2, an H323 termination unit 23-2 and an SCN interface 24-2. The router 20-1 provided inside the LAN 15-1 is connected via the communication line 10-3 to the network node apparatus 8-4. The LAN 15-1 is connected via a LAN communication line such as the Ethernet to both the IP terminal 11-4 and the media router 14-3. Also, the media router 14-3 is connected via the communication line to the IP terminal 11-5, the dependent type IP voice/image apparatus 16-2, and the analog telephone set 18-2, respectively. Similarly, the router 20-2 provided inside the LAN 15-2 is connected via the communication line 10-7 to the network node apparatus 7-4. The LAN 15-2 is connected via a LAN communication line such as the Ethernet to both the IP terminal 11-8 and the media router 14-4. Also, the media router 14-4 is connected via the communication line to the IP terminal 11-9, the dependent type IP telephone set 13-4 and the analog telephone set 18-4, respectively. Reference numerals 21-1 to 21-5 show routers which transfer IP packets between the range 6-1 managed by the communication company “X” and the range 6-2 managed by the communication company “Y”. Also, reference numerals 27-1 and 27-2 show ATM (asynchronous transfer mode) networks, reference numeral 27-3 indicates an optical communication network, and reference numeral 27-4 denotes a frame relay (FR) switching network, which are employed as a high speed main line network used to transfer an IP packet, respectively. It should also be noted that the ATM network, the optical communication network and the frame relay switching network may be employed as any of elements of sub-IP networks employed in the integrated IP transfer network. The IP data service operation/management server 35-1, the IP telephone service operation/management server 36-1, the IP voice/image service operation server 37-1, and the best effort service operation/management server 38-1 are managed by the communication company “X”, respectively, and are provided within the range 6-1 of the network which is managed by the communication company “X”. Also, the IP data service operation/management server 35-2, the IP telephone service operation/management server 36-2, the IP voice/image service operation server 37-2 and the best effort service operation/management server 38-2 are managed by the communication company “Y”, respectively, and are provided within the range 6-2 of the network which is managed by the communication company “Y”. Various sorts of multimedia terminals which are connected via the communication lines outside the integrated IP transfer network 2, namely, an IP telephone set and an IP voice/image apparatus can be specified as to internal location positions of the integrated IP transfer network 2 by using host names as addresses for identifying multimedia terminals in a similar manner to other IP terminals. The host names of the IP terminals and of the multimedia terminals are similar to host names of computers used in the Internet. These host names may be applied in correspondence with IP addresses applied to the respective IP terminals and multimedia terminals. In accordance with the present invention, telephone numbers which are applied to IP telephone sets and IP voice/image apparatus are employed as the host names of the IP telephone sets and the IP voice/image apparatus. A domain name server (will be referred to as a “DNS” hereinafter) holds information as to a one-to-one correspondence relationship between a host name and an IP address. A major function of the domain name server is given as follows: When a host name is provided, an IP address is answered. The major function owns a similar function used in the Internet. With respect to the IP terminals 11-3, 11-1, 11-4, 11-6 and the like, which are employed in the IP data network connected to the network node apparatus managed by the communication company “X”, a domain name server 30-1 dedicated to the IP data network holds information as to a one-to-one correspondence relationship among host names and IP addresses, which are applied to the respective terminals. Also, with respect to the IP terminals 11-7, 11-2, 11-8 and the like, which are employed in the IP data network connected to the network node apparatus managed by the communication company “Y”, a domain name server 30-4 dedicated to the IP data network holds information as to a one-to-one correspondence relationship among host names and IP addresses, which are applied to the respective terminals. With respect to the dependent type IP telephone sets 13-1, 13-3, and the analog telephone sets 18-1, 18-2, 18-5, which are employed in the IP telephone network connected to the network node apparatus managed by the communication company “X”, a domain name server 31-1 dedicated to the IP telephone network holds information as to a one-to-one correspondence relationship among host names (telephone numbers) and IP addresses, which are applied to the telephone sets. Also, with respect to the dependent type IP telephone set 13-2 and the analog telephone sets 18-3, 18-4, 18-6, which are employed in the IP telephone network connected to the network node apparatus managed by the communication company “Y”, a domain name server 31-2 dedicated to the IP telephone network holds information as to a one-to-one correspondence relationship among host names (telephone numbers) and IP addresses, which are applied to these telephone sets. With respect to the dependent type IP voice/image apparatus 16-1 and the independent type IP voice/image apparatus 12-3, which are employed in the IP voice/image network connected to the network node apparatus managed by the communication company “X”, a domain name server 32-1 dedicated to the voice/image network holds information as to a one-to-one correspondence relationship among host names (numbers of IP voice/image apparatus) and IP addresses, which are applied to the IP voice/image apparatus. Also, with respect to the dependent type IP voice/image apparatus 16-3 and 16-4 which are employed in the IP voice/image network connected to the network node apparatus managed by the communication company “Y”, a domain name server 32-2 dedicated to the IP voice/image network holds information as to a one-to-one correspondence relationship among host names (numbers of IP voice/image apparatus) and IP addresses, which are applied to the IP voice/image apparatus. With respect to the IP terminal 11-5 and the dependent type IP voice/image apparatus 16-2, which are employed in the best effort network connected to the network node apparatus managed by the communication company “X”, a domain name server 33-1 dedicated to the best effort network holds information as to a one-to-one correspondence relationship among host names and IP addresses, which are applied to the terminals. Also, with respect to the IP terminal 11-9, 11-10 and the dependent type IP telephone set 13-4, which are employed in the best effort network connected to the network node apparatus managed by the communication company “Y”, a domain name server 33-2 dedicated to the best effort network holds information as to a one-to-one correspondence relationship among host names and IP addresses, which are applied to the terminals. Next, both a basic function of a media router and a basic function of a gateway, which constitute the major elements of the present invention, will now be described with reference to FIG. 21 and FIG. 22. An SCN terminal function 802-0, a conversion function 803-0 and a terminal function 804-0 contain the functions owned by the above-explained SCN terminal function 802, conversion function 803 and terminal function 804, respectively. A voice signal and an image signal, which are entered from the analog telephone set 41-3 via the SCN line 40-1, are converted into digital data signals in the SCN terminal function 802-0. In the conversion function 803-0, a data format and a signal transmission/reception rule are converted. In the terminal function 804-0, the converted digital data signal is converted into an IP packet format which is transmitted to the IP communication line 40-2. Also, a signal flow along a direction opposite to the above-described signal flow direction will now be explained. That is, an IP packet containing voice data and image data, which is entered from the IP communication line 40-2, is decoded into a digital data format in the terminal function 804-0. In the conversion function 803-0, both the data format and a signal transmission/reception rule are converted. The converted digital data is further converted into a signal flowing through the SCN line in the SCN terminal function 802-0. Then, the signal is transmitted via the SCN line 40-1 to the analog telephone set 41-3. An SCN interface 24-0 contains both an SCN terminal function 802-0 and a conversion function 803-0. Since an H323 termination unit 23-0 contains the terminal function 804-0 and this terminal function 804-0 contains the above-explained H323 termination function, the H323 termination unit 23-0 can perform an interactive communication through the terminal 41-2 and the communication line 40-5. The multimedia terminal 41-2 employed in the present invention corresponds to an IP telephone set, an IP voice/image apparatus and the like, which are designed in accordance with the H323 specification. A connection control unit 22-0 is connected via the communication line 40-2 to the H323 termination unit 23-0, and via the line 40-3 to a router 20-0. The router 20-0 is connected via the communication line 40-4 to a network node apparatus 41-4, and also via the communication line 40-6 to an IP terminal 41-1. An IP packet 810 functioning as call control data flows through the communication line 40-2, another IP packet 811 functioning as net data which constitutes voice flows through the communication line 40-2, and another IP packet 812 functioning as net data which constitutes an image itself flows through the communication line 40-2. The call control data corresponds to a host name such as a telephone number and a personal computer. On the other hand, the IP packet 43 flowing through the communication line 40-3 may employ such a data format that a host name is notified to a DNS so as to obtain an inquiry response, namely a DNS inquiry/response format, for example, RFC 1996 (A Mechanism for Prompt Notification of Zone Changes). A DNS inquiry/response function 42 has such a function that the H323 format call control data 810 is converted into the DNS inquiry/response format data 43, and the DNS is inquired to obtain an IP address corresponding to a host name. It should be understood that the IP packet 811 which constitutes the voice, and also the IP packet 812 which constitutes the image itself will pass through the connection control unit 42 in the transparent manner. When the above-explained operations are summarized, the telephone number entered from the analog telephone set 41-3 is changed into the digital telephone number by the SCN interface 24-0, and then the digital telephone number is inputted into the H323 termination unit 23-0. Otherwise, both the telephone number and the host name of the multimedia terminal are entered as the H323 format type call control data 810 into the H323 termination unit 23-0. The telephone number and the host name of the multimedia terminal are entered from the H323 format type IP telephone set 41-2, and are designed in accordance with the H323 specification. Both the telephone numbers correspond to the H323 format type call control data 810 on the communication line 40-2, and the H323 format type call control data 810 are converted into the DNS inquiry/response format 43 via the connection control unit 22-0. It should be understood that the call control data sent from the IP terminal 41-1 originally employs the DNS inquiry/response format 43 and need not use the function of the connection control unit 22-0, the call control data is directly connected to the router 20-0. In this case, the router 20-0 collects both the communication lines 40-3 and 40-6, and also penetrates the IP packet through the own router 20-0. It should also be noted that the net data which constitutes the voice and the image itself contained in the IP packets 811 and 812 may pass through the connection control unit 22-0 without being changed. The IP packets are transmitted/received via the line 40-4 between the net node apparatus 41-4 and the router 20-0. A concrete example of the DNS inquiry/response will now be explained. In the case that both a telephone number “81-47-325-3897” and an IP address “192.1.2.3” are applied to an IP telephone set, when the telephone number “81-47-325-3897” is inquired to the domain name server DNS, the DNS responds as the IP address “192.1.2.3”. Alternatively, in such a case that both a host name “host1.dname1.dname2.co.jp” and an IP address “128.3.4.5” are applied to a personal computer corresponding to an IP terminal, when the host name “host1.dname1.dname2.co.jp” is inquired to the DNS, this DNS answers the IP address “128.3.4.5” of the personal computer. Since an IP packet is transmitted/received among the IP terminal 41-1, the multimedia terminal 41-2 and the analog terminal 41-3, a communication can be established. In other words, the IP terminal 41-1 transmits/receives the IP packet with respect to the multimedia terminal 41-2 via the router 20-0, the connection control unit 22-0, and the H323 termination unit 23-0, so that the mutual communication can be established between the IP terminal 41-1 and the multimedia terminal 41-2. Further, the IP terminal 41-1 may mutually communicate with the analog telephone set 41-3 via the SCN interface 24-0. Also, the multimedia terminal 41-2 may mutually communicate with the analog telephone set 41-3 via the H323 termination unit 23-0 and the SCN interface 24-0. <<Operation of Media Router>> Operations of the media router 14-1 according to the present invention will now be explained with reference to FIG. 23. The router 20-3 which constitutes one element of the media router 14-1 owns the function of the router 20-0 shown in FIG. 21. A connection control unit 22-1 of FIG. 23 owns the function of the connection control unit 22-0 shown in FIG. 21. An H323 termination unit 23-1 of FIG. 23 owns the function of the H323 termination unit 23-0 indicated in FIG. 21. An SCN interface 24-1 of FIG. 23 owns the function of the SCN interface 24-0 shown in FIG. 21. Reference numeral 48-1 of FIG. 23 owns a similar function as to the above-explained DNS. An RAS mechanism 49-1 corresponds to such a mechanism capable of registering/certificating a terminal into the media router 14-1, and also capable of managing an internal condition of the media router (for example, the internal components and their utilization conditions are managed in a batch mode). In this case, the registration by the RAS mechanism 49-1 implies that the terminal is connected to the media router, whereas the certification thereof implies that the RAS mechanism 49-1 confirms as to whether or not the terminal is formally utilized in accordance with the connection permission condition of the terminal. Reference numeral 50-1 shows an information processing mechanism capable of executing an information processing operation within the media router 14-1. Reference numeral 51-1 shows an operation input/output unit of the media router 14-1. As a consequence, the respective functions owned by the connection control unit 22-1, the H323 termination unit 23-1, and the SCN interface 24-1 employed in the media router 14-1 of FIG. 23 may be apparent from the descriptions as to the connection control unit 22-0, the H323 termination unit 23-0, and the SCN interface 24-0 indicated in FIG. 21. <<Communication Connection Control Between IP Terminals>> Referring now to FIG. 23, FIG. 24, and FIG. 25 to FIG. 31, a description will be made of a sequential process operation that data stored in an IP packet is transmitted, or received from the IP terminal 11-3 to the IP terminal 11-7. The IP terminal 11-3 transmits such an IP packet 45-1 shown in FIG. 26 via a communication line 52-1 to a domain name server 48-1. The IP packet 45-1 stores thereinto the own address, namely a transmission source IP address “A113”; an address of a domain name server 48-1 employed in the medic router 14-1, namely a destination IP address “A481”; and a host name “IPT-11-7 name” of the IP terminal 11-7 of the communication party. In this case, the inquiry content shown in the IP packet 45-1, namely “IPT-11-7 name” is stored in “inquiry portion” within the “DNS inquiry/response format” indicated in FIG. 22. The domain name server 48-1 checks the content of the received IP packet 45-1, and inquires to a domain name server 30-1 dedicated to the IP data network via the communication line 10-1 and the network node apparatus 8-2 (Step ST10). When the domain name server 30-1 returns an IP packet containing an IP address “A117” which corresponds to the above-explained host name “IPT-11-7 name” in a 1:1 correspondence to the domain name server 48-1 (Step ST11), the domain name server 48-1 returns an IP packet 45-2 to the IP terminal 11-3. In the above-explained sequential process operation, the network node apparatus 8-2 checks as to whether or not the transmission source address “A113” contained in the received IP packet 45-1 is registered into an address administration table with reference to the address administration table 44-1 of FIG. 25. In this case, the address administration table 44-1 indicates that an external IP address is “A113” on a record of a second row of the table from a top row, and a communication line discrimination symbol “Line-10-1” is equal to such an IP packet entered from the communication line 10-1. As a result, it can be confirmed that the IP terminal 11-3 is allowed/registered so as to be communicatable through the network node apparatus. In the case that the IP terminal is not registered in the address administration table 44-1, the network node apparatus 8-2 can discard the received IP packet 45-1. Next, in the case that the IP terminal 11-3 produces an IP packet 45-3 which is transmitted to the IP terminal 11-7 and then transmits the produced IP packet 45-3 via the router 20-3 to the network node apparatus 8-2, if this network node apparatus 8-2 transfers the IP packet 45-3 to the internal unit of the integrated IP transfer network 1, then the IP packet 45-3 passes through the communication lines and a plurality of routers (namely, routers 19-1, 19-3, 21-1, 19-5 and 19-6) employed in the IP data network 3 of FIG. 20, and thereafter, is reached to the network node apparatus 7-2. As a result, the network node apparatus 7-2 sends out the received IP packet 45-3 to the communication line 10-5 shown in FIG. 24 (Step ST12), the router 20-4 receives the IP packet 45-3, and then, transfers the IP packet via the communication line 52-2 to the IP terminal 11-7. When the IP terminal 11-7 which receives the IP packet 45-3 produces a returning IP packet 45-4, and then sends out the returning IP packet 45-4 via the communication line to the router 20-4, the returning IP packet 45-4 is reached to the network node apparatus 8-2 through the communication line 10-5 (Step ST13), the network node apparatus 7-2, and the IP data network 3 provided within the integrated IP transfer network 2. Then, such an IP packet 45-4 shown in FIG. 29 is supplied via the communication line 10-1 to the IP terminal 11-3. Since the IP packet is transmitted/received between the IP terminal 11-3 and the IP terminal 11-7 in the above-explained sequential process operation, the communication can be established. It should be understood that the domain name server 48-1 employed in the media router may be removed from the media router 14-1 in the above-explained communication sequential operation from the IP terminal. In this alternative case, the IP terminal 11-3 transmits the IP packet 45-5 to the domain name server 30-1. The IP packet 45-5 stores thereinto the transmission source IP address “A113”, the IP address “A301” of the domain name server 30-1 dedicated to the IP data network, and the host name “IPT-11-7 name” of the IP terminal 11-7 of the communication party. The domain name server 30-1 returns such an IP packet 45-6 containing an IP address “A117” which corresponds to the host name “IPT-11-7 name” in a 1-to-1 correspondence manner. It should also be noted that the technical method capable of directly accessing the domain name server 30-1 except for the domain name server 48-1 provided in the media router may be realized by way of the known technical method related to the domain name server. When the above-explained process operation defined at the Step ST11 is accomplished, both the IP terminals 11-3 and 11-7 are brought into such a preparation condition that the communication is commenced. Under this preparation condition, when the network node apparatus 8-2 detects both the IP packets 45-2 and 45-6, a record of communications established between the IP terminals may be saved/recorded within the network node apparatus 8-2 in combination with this time instant, if necessary. In other words, a record of communications mode between the IP terminal 11-3 and the IP terminal 11-7 may be saved/recorded. <<Communication Connection Control Between Dependent Type IP Telephone Sets>> Next, a description will now be made of a sequential operation in which while a telephone number is dialed, a telephone communication is carried out from the dependent type IP telephone set 13-1 to the dependent type IP telephone set 13-2. In this example, a “dependent type IP telephone set” indicates such an IP telephone set which is connected to the media routers 14-1, 14-2 and the like so as to establish a telephone communication, whereas an “independent type IP telephone set” indicates the IP telephone sets 12-1 and 12-2 shown in FIG. 20, which are not connected to the media router, but are directly connected to the network node apparatus. This communication sequence will be explained later. The dependent type IP telephone set 13-1 of FIG. 23 is connected via the communication line 53-1 to the H323 termination unit 23-1, and the dependent type IP telephone 13-2 of FIG. 24 is connected via the communication line 53-2 to the H323 termination unit 23-2. When the handset of the dependent type IP telephone 13-1 is took up (off hook), such an IP packet 46-1 shown in FIG. 32, which notifies a telephone call, is sent to the communication line 53-1 indicated in FIG. 23 (Step ST20 of FIG. 23). Then, the H323 termination unit 23-1 detects that the telephone call is entered from the communication line 53-1, and returns an IP packet 46-2 in order to confirm the telephone call (Step ST21). In this case, symbol “CTL-Info-1” described in a payload (data field) of the IP packet 46-1 corresponds to call control information, whereas symbol “CTL-Info-2” described in a payload of the IP packet 46-2 corresponds to call confirmation information. Next, when the user of the dependent type IP telephone set 13-1 dials a telephone number of the dependent type IP telephone set 13-2 as the communication counter party, such an IP packet 46-3 having, for example, the call control data format defined by H.225 is produced within the dependent type IP telephone set 13-1. The IP packet 46-3 contains a telephone number (“Tel-13-2 name”) of the communication counter party, the telephone number of the dependent type IP telephone set 13-1, and the IP address. The IP packet 46-3 is transmitted via the communication line 53-1 to the H323 termination unit 23-1. A condition as to whether or not both the telephone number of the dependent type IP telephone 13-1 and the IP address are contained in the IP packet 46-3 may be optionally selected. The H323 termination unit 23-1 receives the IP packet 46-3 from the communication line 53-1 to retrieve records contained in a media router state table 100-1 shown in FIG. 47. Then, the H323 termination unit 23-1 detects a line identifier indicative of the communication line 53-1, namely, a record of a first row of the media router state table 100-1 from a top row, i.e., “53-1”. Also, the H323 termination unit 23-1 reads out a telephone number “81-3-1234-5679” and an IP address “32.3.53.1” of the dependent type IP telephone set 13-1, which are described in the detected record. Also, when both the IP address and the telephone number are not contained in the IP packet 46-3, the H323 termination unit 23-1 may set the values described in the media router state table to the IP packet 46-3. Alternatively, even when the information related to the IP address and the telephone number is written, if the above values are not made coincident with the above-described IP packet/telephone number, then the H323 termination unit 23-1 discards the IP packet 46-3 as an error process. In this case, a concrete numeral value of the IP address “A131” of the dependent type IP telephone set 13-1 is selected to be “32.3.53.1” (Step ST22). Next, the H323 termination unit 23-1 transmits an IP packet 46-4 to a domain name server 48-1 employed inside the media router 14-1 of FIG. 23 (Step ST23). The IP packet 46-4 stores thereinto the address of the dependent type IP telephone set 13-1, namely a transmission source IP address “A131”; the address of the domain name server 48-1, namely a destination IP address “A481”; and a telephone number “Tel-13-2 name” of a communication counter party. The domain name server 48-1 checks the content of the received IP packet 46-4, and subsequently, transmits an IP packet 46-5 via the communication line 10-1 and the network node apparatus 8-2 to the domain name server 31-1 dedicated to the IP telephone network (Step ST24). When the domain name server 31-1 dedicated to the IP telephone network returns such an IP packet to the domain name server 48-1 (Step ST25), the domain name server 48-1 returns an IP packet 46-6 to the H323 termination unit 23-1. The above-explained returned IP packet contains an IP address “A132” which corresponds to the host name “Tel-13-2 name” in a 1-to-1 correspondence manner. Next, when the H323 termination unit 23-1 produces an IP packet 46-7 which is sent to the H323 termination unit 23-2, and then transmits the produced IP packet 46-7 via the router 20-3 to the network node apparatus 8-2 (Step ST26), the network node apparatus 8-2 transfers the received IP packet 46-7 to the internal arrangement of the integrated IP transfer network 2 shown in FIG. 20. Thus, the IP packet 46-7 passes through the routers 19-8, 19-9, 21-2, 19-11 and 19-13 provided inside the IP telephone network 4, and then is reached to the network node apparatus 7-2. As a result, the network node apparatus 7-2 sends out the received IP packet 46-7 to the communication line 10-5, and the H323 termination unit 23-2 receives the IP packet 46-7 via the router 20-4. The H323 termination unit 23-3 interprets the IP packet 46-7 as a telephone call, and thus executes the below-mentioned two procedure operations. As a first procedure operation, the H323 termination unit 23-2 produces a returning IP packet 46-8 and then returns the IP packet 46-8 to the router 20-4. As a second procedure operation, the H323 termination unit 23-2 transfers the IP packet 46-7 via the communication line 53-2 shown in FIG. 24 to the dependent type IP telephone set 13-2. Referring now to FIG. 24, the following operation is made: The IP packet 46-8 produced in the first procedure is transmitted via the communication line 10-5 (Step ST27), the network node apparatus 7-2, and the IP telephone network 4 to the network node apparatus 8-2, and then is reached via the communication line 10-1 to the router 20-3 and also via the H323 termination unit 23-1 to the dependent type IP telephone set 13-1, respectively. The dependent type IP telephone 13-1 interprets that the communication counter party is being called by receiving the IP packet 46-8. Because of the second procedure, the dependent type IP telephone 13-2 produces a telephone call sound by receiving the IP packet 46-7. The user of the dependent type IP telephone set 13-2 hears the telephone call sound, and then takes up the handset of the dependent type IP telephone set 13-2 (off hook). As a result, the dependent type IP telephone set 13-2 produces an IP packet 46-9 to be sent out to the line 53-2 (Step ST28), and the H323 termination unit 23-2 receives the IP packet 46-9. Then, the IP packet 46-9 is supplied via the network node apparatus 7-2 and the IP telephone network 4 to the network node apparatus 8-2, and is reached via the communication line 10-1 to the router 20-3, and also via the H323 termination unit 23-1 to the dependent type IP telephone set 13-1. As a result, the user of the dependent type IP telephone set 13-1 may be informed that the telephone communication counter party takes up the handset of the dependent type IP telephone set 13-2. The above-described Step ST28 corresponds to such a procedure that information of a response is transferred, namely, the IP packet 46-9 is transferred which notifies such a fact that the telephone communication is commenced between the dependent type IP telephone set 13-1 and the dependent type IP telephone set 13-2. When the network node apparatus 7-2 and 8-2 detect the IP packet 46-9, a record of the commencement of the telephone communication may be saved in a charge record file. In other words, such a fact that the telephone communication is commenced between the dependent type IP telephone sets 13-1 and 13-2 is saved in the charge record file. Namely, this charge record file stores thereinto a portion of the contents of the IP packet 46-9 set into the network node apparatus, for example, a transmission source IP address, a destination IP address, a transmission source port number, a destination port number and detection time instants thereof. When the user of the dependent type IP telephone set 13-1 starts his telephone conversation, the dependent type IP telephone set 13-1 produces an IP packet 46-10 containing digitalized voice (speech), and transmits the IP packet 46-10 to the communication line 53-1 (Step ST29). The voice packet 46-10 is supplied to the dependent type IP telephone set 13-2 via the H323 control unit 23-1; the router 20-3; the network node apparatus 8-2; the routers 19-8, 19-9, 21-2, 19-11 and 19-13; the network node apparatus 7-2; the router 20-4; and the H323 termination unit 23-2. The voice of the user of the dependent type IP telephone set 13-2 is stored in an IP packet 46-11 in a digital form. The voice packet is supplied to the dependent type IP telephone set 13-1 along a direction opposite to the above-explained packet flow direction (Step ST30), namely, is supplied via the H323 control unit 23-2; the router 20-4; the network node apparatus 7-2; the routers 19-13, 19-11, 21-2, 19-9 and 19-8; the network node apparatus 8-2; the router 20-3; and the H323 termination unit 23-1. When the user of the dependent type IP telephone set 13-1 puts on (hangs up) the handset thereof in order to finish the telephone communication, the dependent type IP telephone set 13-1 produces an IP packet 46-12 which indicates that the telephone communication is ended, and then sends out the IP packet 46-12 to the communication line 53-1 (Step ST31). The IP packet 46-12 is supplied to the dependent type IP telephone set 13-2 via the H323 control unit 23-1; the router 20-3; the network node apparatus 8-2; the routers 19-8, 19-9, 21-2, 19-11, and 19-13; the network node apparatus 7-2; the router 20-4; and the H323 termination unit 23-2. The user of the dependent type IP telephone set 13-2 may know such a fact that the telephone communication is ended, and then, when the user puts on the handset of the dependent type telephone set 13-2, an IP packet 46-13 is produced. The produced IP packet 46-13 is supplied along a direction opposite to the above-explained packet flow direction, namely, is supplied to the H323 control unit 23-2; the router 20-4; the network node apparatus 7-2; the routers 19-13, 19-11, 21-2, 19-9 and 19-8; the network node apparatus 8-2; the router 20-3; and the H323 termination unit 23-1 (Step ST32). The above-described Step ST32 corresponds to such a procedure that confirmation information of a call interrupt is transferred, namely, the IP packet 46-13 is transferred which notifies such a fact that the telephone communication is ended between the dependent type IP telephone set 13-1 and the dependent type IP telephone set 13-2. When both the network node apparatus 7-2 and 8-2 detect the IP packet 46-13, a record of the completion of the telephone communication may be saved in the charge record file. In other words, such a fact that the telephone communication is ended between the dependent type IP telephone sets 13-1 and 13-2 is saved in the charge record file. Namely, this charge record file stores thereinto a portion of the contents of the IP packet 46-13 set into the network node apparatus, for example, a transmission source IP address, a destination IP address, a transmission source port number, a destination port number and detection time instant thereof. Since both the dependent type IP telephone set 13-1 and the dependent type IP telephone set 13-2 transmit and also receive the IP packets in accordance with the above-explained procedures, the telephone communications can be established. In the above-described communication procedures, while the domain name server 48-1 contained in the media router may be removed from the media router 14-1, the above-explained Steps ST23 to ST25 may be replaced by the below-mentioned Steps ST23 x and ST25 x. In other words, the H323 termination unit 23-1 transmits an IP packet 46-14 via the communication line 10-1 and the network node apparatus 8-2 to the domain name server 31-1 dedicated to the IP telephone network (Step ST23 x). The IP packet 46-14 stores thereinto the address of the dependent type IP telephone set 13-1, namely the transmission source IP address “A131”; the address of the domain name server 31-1 dedicated to the IP telephone network, namely the destination IP address “A311”; and the telephone number of the communication counter party “Tel-13-2 name”. The domain name server 31-1 returns another IP packet 46-15 to the H323 termination unit 23-1 (Step ST25 x). The IP packet 46-15 contains the IP address “A132” which corresponds to the telephone number of the communication counter party “Tel-13-2 name” in a 1-to-1 correspondence manner. In the above-explained procedures defined from the Steps ST23 to the Step ST25, or by both the Step ST23 x and the Step ST25 x, the network node apparatus 8-2 may confirm that the dependent type IP telephone set 13-1 is allowed to be communicated from the communication line 10-1 via the network node apparatus 8-2 by checking as to whether or not the combination between the transmission source address “A481” contained in the IP packet 46-5 received via the communication line 10-1 and the communication line identification symbol “Line-10-1” similarly received is registered in the address management table 44-1 (refer to FIG. 25), or by checking as to whether or not the combination between the transmission source address “A131” contained in the IP packet 46-14 received via the communication line 10-1 and the communication line identification symbol “Line-10-1” similarly received is registered in the address management table 44-1 (refer to FIG. 25). <<Communication Connection Control Between Independent Type IP Telephone Sets>> Since the dependent type IP telephone set 13-1 of FIG. 23 contains the termination function of the H323 termination unit 23-1, this dependent type IP telephone set 13-1 may be formed with the connection control unit 22-1 in an integral form. Because of this reason, a dependent type IP telephone set 13-11 provided inside such an independent type IP telephone set 12-1 shown in FIG. 48 is directly connected via a communication line to a connection control unit 22-11. A communication line 10-4 is derived from the connection control unit 22-11, and then is connected to the network node apparatus 8-4 of FIG. 20. Both the independent type IP telephone set 12-1 and an independent type IP telephone set 12-2 can carry out a telephone communication by transmitting/receiving an IP packet. This communication procedure is similar to that defined from the Step ST20 to the Step ST32, in which the above-described dependent type IP telephone sets 13-1 and 13-2 perform the telephone communication by transmitting/receiving the IP packets. However, there is a first different point. That is, since the domain name server 48-1 inside the media router 14-1 is not present, both the Step ST23 and the Steps ST24 may be regarded as an integrated steps without passing through the domain name server 48-1. As a second different point, since the H323 termination units 23-1 and 23-2 are not present, the portions of the H323 termination units 23-1 and 23-2 are required to be replaced by such a communication line through which the IP packets may pass. <<Communication Between Two Dependent Type IP Voice/Image Apparatus>> Since an IP packet is transmitted, or received from the dependent type IP voice/image (audio/visual) apparatus 16-1 to the dependent type IP voice/image (audio/visual) apparatus 16-3, a host name for identifying an apparatus can be realized by a voice/image communication for transmitting/receiving an IP packet. The communication procedure is similar to that defined from the Step ST20 to the Step ST32 in which both the dependent type IP telephone set 13-1 and the dependent type IP telephone set 13-2 use the domain name server 31-1 dedicated to the IP telephone network. As a technical different point, while the domain name server 32-1 dedicated to the IP voice/image network of FIG. 24 is employed without using the domain name server 31-1 dedicated to the IP telephone network, a process operation of a Step ST44 is executed instead of the Step ST24, and also a process operation of a Step ST45 is executed instead of the Step ST25. The dependent type IP voice/image apparatus 16-1 inquires the domain name server 32-1 dedicated to the IP image inside the IP transfer network as to the host name of the dependent type IP voice/image apparatus 16-2 to thereby acquire an IP address of the dependent type IP voice/image apparatus 16-2. Next, since the voice/image data is transmitted from the dependent type IP voice/image apparatus 16-1 to the dependent type IP voice/image apparatus 16-2, the voice/image communication for transmitting/receiving the voice/image data can be carried out between the dependent type IP voice/image apparatus 16-1 and the dependent type IP voice/image apparatus 16-2. <<Communication Between Independent Type IP Voice/Image Apparatus and Dependent Type IP Voice/Image Apparatus>> Since the dependent type IP voice/image apparatus 16-1 shown in FIG. 23 contains the termination function of the H323 termination unit 23-1, this dependent type IP voice/image apparatus 16-1 may be formed with the connection control unit 22-1 in an integral form. Because of this reason, a dependent type IP voice/image apparatus 16-12 provided inside such an independent type IP voice/image apparatus 12-3 shown in FIG. 49 is directly connected via a communication line to a connection control unit 22-12. A communication line 10-9 is derived from the connection control unit 22-12, and then is connected to the network node apparatus 8-4 of FIG. 20. Both the independent type IP voice/image apparatus 12-3 and the dependent type IP voice/image apparatus 16-3 can execute a voice/image communication for transmitting/receiving an IP packet. The communication procedure thereof is similar to the process operations defined from the Step ST20 to the Steps ST32, in which both the dependent type IP voice/image apparatus 16-1 and the dependent type IP voice/image apparatus 16-3 use the domain name server 32-1 dedicated to the IP voice/image network 5-1 so as to transmit/receive the IP packet, so that the voice/image communication is carried out. As a technical different point, since the domain name server 48-1 within the media router 14-1 is not present, both the Step ST23 and the Step ST24 are recorded as an integrated step, without passing through the domain name server 48-1. By connecting the independent type IP voice/image apparatus 16-4 with the network node apparatus 7-4, the voice/image communication to transmit/receive the IP packet is carried out between the independent type IP voice/image apparatus 12-3 and the independent type IP voice/image apparatus 16-4 via the network node apparatus 8-4, the IP voice/image network 5-1 and the network node apparatus 7-4. Assuming now that the independent type IP voice/image apparatus 12-3 is regarded as a sales means of a voice (sound)/image goods selling firm for selling voice/image goods, and also both the dependent type IP voice/image apparatus 16-3 and the independent type IP voice/image apparatus 16-4 are regarded as a purchase means of a voice (sound)/image goods purchaser, such a virtual market can be realized through which the voice/image goods can be distributed with employment of the IP transfer network. A purchaser may order voice/image goods to a sales firm by using a voice/image slip, and thus, the sales firm can send digital voice/image goods. <<Communication Among Analog Telephone Sets>> Referring now to FIG. 20, FIG. 23, FIG. 24, and FIG. 50 to FIG. 64, a description will be made of a sequential operation in which while a telephone number is dialed, a telephone communication is established from one normal telephone set to another normal telephone set, not an IP telephone set, namely from one analog telephone set 18-1 to another analog telephone set 18-3. The analog telephone set 18-1 of FIG. 23 is connected via a communication line 55-1 to the SCN interface 24-1, and the analog telephone set 18-3 of FIG. 24 is connected via a communication line 55-2 to the SCN interface 24-2. When the handset of the analog telephone 18-1 is taken up (off hook), a telephone calling analog signal is sent out via the communication line 55-1 to the SCN interface 24-1, and then this SCN interface 24-1 converts the received analog calling signal into digital-format calling data. Next, the SCN interface 24-1 converts the transmission/reception rule of the digital calling data, and produces such a digital data 47-1 shown in FIG. 50 which notifies a telephone call. The digital data 47-1 is inputted to the H323 termination unit 23-1 (Step ST60 of FIG. 23). The H323 termination unit 23-1 returns digital data 47-2 of FIG. 51 used to confirm the telephone call to the SCN interface 24-1 (Step ST61). In this case, symbol “CTL-Info-1” contained in the digital data 47-1 indicates call control information, and symbol “CTL-Info-2” contained in the digital data 47-2 shows call confirmation information. Next, when a user of the analog telephone set 18-1 dials a telephone number of the analog telephone set 18-3 as a communication counter party, the analog telephone set 18-1 sends out a call setting analog signal to the communication line 55-1, and the SCN interface 23-1 produces a data block 47-3 of FIG. 52 for notifying the telephone number by using the “call setting” analog signal to send out the data block 47-3 to the H323 termination unit 23-1. In this case, the H323 termination unit 23-1 retrieves records contained in a media router state table 100-1 of FIG. 47 so as to detect a line identifier indicative of the communication line 55-1, a record on a third row of the media router state table 100-1 from a top row, namely “55-1”. Next, the H323 termination unit 23-1 reads a telephone number “81-47-325-3887” of the analog telephone set 18-1 and an IP address “20.0.55.1”, which are described in the record. In this case, a concrete numeral value of the IP address “A181” of the analog telephone set 18-1 is selected to be “20.0.55.1” (Step ST62). Next, the H323 termination unit 23-1 produces an IP packet 47-4 of FIG. 53, and then transmits the produced IP packet 47-4 to the domain name server 48-1 (Step ST63). This IP packet 47-4 stores thereinto an address which is virtually applied to the analog telephone set 18-1, namely a transmission source IP address “A181”; an address of the domain name server 48-1 provided inside the media router, namely a destination IP address “A481”; and a telephone number “Tel-18-3 name” of a communication counter party. The domain name server 48-1 checks the content of the received IP packet 47-4, and subsequently, transmits an IP packet 47-5 via the communication line 10-1 and the network node apparatus 8-2 to the domain name server 31-1 dedicated to the IP telephone network (Step ST64). When the domain name server 31-1 dedicated to the IP telephone network returns such an IP packet 47-6 to the domain name server 48-1 (Step ST65), the domain name server 48-1 returns an IP packet 47-6 to the H323 termination unit 23-1. The above-explained returned IP packet 47-6 contains an IP address “A183” which corresponds to the host name “Tel-13-3 name” in a 1-to-1 correspondence manner. Next, when the H323 termination unit 23-1 produces an IP packet 47-7 which is sent to the H323 termination unit 23-2, and then transmits the produced IP packet 47-7 via the router 20-3 to the network node apparatus 8-2 (Step ST66), the network node apparatus 8-2 transfers the received IP packet 47-7 to the internal arrangement of the integrated IP transfer network 2 shown in FIG. 20. Thus, the IP packet 47-7 passes through the routers 19-8, 19-9, 21-2, 19-11 and 19-13 provided inside the IP telephone network 4, and then is reached to the network node apparatus 7-2. As a result, the network node apparatus 7-2 sends out the received IP packet 47-7 to the communication line 10-5, and the H323 termination unit 23-2 receives the IP packet 47-7 via the router 20-4. The H323 termination unit 23-2 interprets the IP packet 47-7 as a telephone call, and thus executes the below-mentioned two procedure operations. As a first procedure operation, the H323 termination unit 23-2 produces a returning IP packet 47-8 and then returns the IP packet 47-8 to the router 20-4. Also, since the analog telephone set 18-3 receives the IP packet 47-7, this analog telephone set 18-3 produces a calling bell sound. As a second procedure operation, the H323 termination unit 23-2 transfers the IP packet 47-7 via the SCN interface 24-2 to the analog telephone 18-3. Referring now to FIG. 24, the following operation is made: The IP packet 47-8 produced in the first procedure is transmitted via the communication line 10-5 (Step ST67), the network node apparatus 7-2, and the IP telephone network 4 to the network node apparatus 8-2, and then is reached via the communication line 10-1 to the router 20-3 and also via the H323 termination unit 23-1 and the SCN interface 24-1 to the analog telephone set 18-1. The analog telephone set 18-1 interprets that the communication counter party is being called by receiving the IP packet 47-8. Because of the second procedure, the user of the analog telephone set 18-3 hears the telephone call sound, and then takes up the handset of the analog telephone set 18-3 (off hook). As a result, the H323 termination unit 23-2 produces an IP packet 47-9 (Step ST68). The H323 termination unit 23-2 sends out the IP packet 47-9 to the router 20-4. Then, the IP packet 47-9 is supplied via the network node apparatus 7-2 and the IP telephone network 4 to the network node apparatus 8-2, and is reached via the communication line 10-1 to the router 20-3, and also via the H323 termination unit 23-1 and the SCN interface 24-1 to the analog telephone set 18-1. As a result, the user of the analog telephone set 18-1 may be informed as sound for notifying that the telephone communication counter party takes up the handset of the analog telephone set 18-3. This sound is to confirm a call setting operation. The above-described Step ST68 corresponds to such a procedure that information of a call setting confirmation is transferred, namely, the IP packet 47-9 is transferred which notifies such a fact that the telephone communication is commenced between the analog telephone set 18-1 and the analog telephone set 18-3. When both the network node apparatus 7-2 and 8-2 detect the IP packet 47-9, a record of the commencement of the telephone communication may be saved in a charge record file. In other words, such a fact that the telephone communication is commenced between the analog telephone sets 18-1 and 18-3 is saved in the charge record file. Namely, this charge record file stores thereinto a portion of the contents of the IP packet 47-9 set into the network node apparatus, for example, a transmission source IP address, a destination IP address, a transmission source port number, a destination port number and detection time instants thereof. When the user of the analog telephone set 18-1 commences a telephone conversation of a telephone communication, the voice (speech) signal is transferred via the communication line 55-1 to the SCN interface 24-1, and is converted into a digital voice signal. Next, the H323 termination unit 23-1 produces such an IP packet 47-10 containing the digitalized voice, and then sends out the produced IP packet 47-10 to the communication line 10-1 (Step ST69). The voice packet 47-10 is supplied to the analog telephone set 18-3 via the H323 control unit 23-1; the router 20-3; the network node apparatus 8-2; the routers 19-8, 19-9, 21-2, 19-11 and 19-13; the network node apparatus 7-2; the router 20-4; and the H323 termination unit 23-2. The voice of the user of the analog telephone set 18-3 is supplied to the analog telephone set 18-1 along a direction opposite to the above-explained packet flow direction (Step ST70), namely, is supplied via the H323 control unit 23-2; the router 20-4; the network node apparatus 7-2; the routers 19-13, 19-11, 21-2, 19-9 and 19-8; the network node apparatus 8-2; the router 20-3; and the H323 termination unit 23-1. When the user of the analog telephone set 18-1 puts on the handset in order to accomplish the telephone conversation, the analog telephone set 18-1 sends out a call interrupt signal to the communication line 55-1. The call interrupt signal indicates the completion of the telephone communication. The SCN interface 24-1 converts the call interrupt signal into a digital data format. Next, the H323 termination unit 23-1 produces an IP packet 47-12 for indicating that the telephone communication is ended, and then sends to the IP packet 47-12 to the communication line 10-1 (Step ST71). The IP packet 47-12 is supplied to the analog telephone set 18-3 via the H323 control unit 23-1; the router 20-3; the network node apparatus 8-2; the routers 19-8, 19-9, 21-2, 19-11 and 19-13; the network node apparatus 7-2; the router 20-4; and the H323 termination unit 23-2. The user of the analog telephone set 18-3 may know such a fact that the telephone communication is ended, and then, when the user puts on the handset of the analog telephone set 18-3, an IP packet 47-13 is produced. The produced IP packet 47-13 is supplied along a direction opposite to the above-explained packet flow direction (Step ST72), namely, is supplied via the H323 control unit 23-2; the router 20-4; the network node apparatus 7-2; the routers 19-13, 19-11, 21-2, 19-9 and 19-8; the network node apparatus 8-2; the router 20-3; and the H323 termination unit 23-1. The above-described Step ST72 corresponds to such a procedure that formation for confirming a call interrupt is transferred, namely, the IP packet 47-13 is transferred which notifies such a fact that the telephone communication is ended between the analog telephone set 18-1 and the analog telephone set 18-3. When both the network node apparatus 7-2 and 8-2 detect the IP packet 47-13, a record of the completion of the telephone communication may be saved in a charge record file. In other words, such a fact that the telephone communication is completed between the analog telephone sets 18-1 and 18-3 is saved in the charge record file. Namely, the charge record file stores thereinto a portion of the contents of the IP packet 47-13 set into the network node apparatus, for example, a transmission source IP address, a destination IP address, a transmission source port number, a destination port number and detection time instants thereof. Since both the analog telephone set 18-1 and the analog telephone set 18-3 transmit and also receive the IP packets in accordance with the above-explained procedures, the telephone communications can be established. In the above-described communication procedures, while the domain name server 48-1 contained in the media router may be removed from the media router 14-1, the above-explained Steps ST63 to ST65 may be replaced by the below-mentioned Steps ST63 x and ST65 x. In other words, the H323 termination unit 23-1 transmits an IP packet 47-14 via the communication line 10-1 and the network node apparatus 8-2 to the domain name server 31-1 dedicated to the IP telephone network (Step ST63 x). The IP packet 47-14 stores thereinto the address of the analog telephone set 18-1, namely the transmission source IP address “A181”; the address of the domain name server 31-1 dedicated to the IP telephone network, namely the destination IP address “A311”; and the telephone number of the communication counter party “Tel-18-3 name”. The domain name server 31-1 returns another IP packet 47-15 to the H323 termination unit 23-1 (Step ST65 x). The IP packet 47-15 contains the IP address “A183” which corresponds to the telephone number of the communication counter party “Tel-18-3 name” in a 1-to-1 correspondence manner. In the above-explained procedures defined from the Step ST63 to the Step ST65, or by both the Step ST63 x and the Step ST65 x, the network node apparatus 8-2 may confirm that the analog telephone set 18-1 is allowed to be communicated from the communication line 10-1 via the network node apparatus 8-2 by checking as to whether or not the combination between the transmission source address “A481” contained in the IP packet 47-5 received via the communication line 10-1 and the communication line identification symbol “Line-10-1” similarly received is registered in the address administration table 44-1 (refer to FIG. 25), or by checking as to whether or not the combination between the transmission source address “A181” contained in the IP packet 47-14 received via the communication line 10-1 and the communication line identification symbol “Line-10-1” similarly received is registered in the address administration table 44-1 (refer to FIG. 25). <<IP Data Service Operation/Management Server>> The IP data service operation/management server 35-1 managed by the communication company “X” acquires the IP terminal-to-terminal communication record which is formed by the network node apparatus at the Step ST11 in such a manner that the IP data service operation/management server 35-1 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 8-2 and 8-4. Also, the IP data service operation/management server 35-1 checks as to whether or not the internal resources of the IP data network managed by the communication company “X” are operated under normal condition by using such a means for transmitting/receiving an ICMP packet (namely, failure management). These internal resources are, for instance, the routers 19-1, 19-2, 19-3; the domain name servers 30-1 and 30-2 dedicated to the IP data network; and the communication lines among the routers. Also, the IP data service operation/management server 35-1 monitors as to whether or not the congestion of the IP packets within the IP data network is excessively increased (namely, communication quality control) in order that the IP data network of the communication company “X” may be operated/managed in a batch mode. Similarly, the IP data service operation/management server 35-2 managed by the communication company “Y” acquires the above-explained IP terminal-to-terminal communication record in such a manner that the IP data service operation/management server 35-2 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 7-2 and 7-4. Also, the IP data service operation/management server 35-2 operates/manages the failure management and the communication quality of the IP data network of the communication company “Y” in a batch manner. It should be understood that both the IP data service operation/management servers 35-1 and 35-2 may be subdivided into an IP data service server which exclusively manages the IP data services, and also an IP data network operation/management server which exclusively manages the resources of the IP data network. <<IP Telephone Service Operation/Management Server>> The IP telephone service operation/management server 36-1 managed by the communication company “X” acquires the above-explained telephone communication starting record and also telephone communication end record in such a manner that the IP telephone service operation/management server 36-1 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 8-2 and 8-4. Also, the IP telephone service operation/management server 36-1 checks as to whether or not the internal resources of the IP telephone network managed by the communication company “X” are operated under normal condition by using such a means for transmitting/receiving an ICMP packet (namely, failure management). These internal resources are, for instance, the routers 19-8, 19-9, 19-10; the domain name server 31-1 dedicated to the IP telephone network, and the communication lines among the routers. Also, the IP telephone service operation/management server 36-1 monitors as to whether or not the congestion of the IP packets within the IP telephone network is excessively increased (namely, communication quality control) in order that the IP telephone network of the communication company “X” may be operated/managed in a batch mode. Similarly, the IP telephone service operation/management server 36-2 managed by the communication company “Y” acquires the above-explained telephone communication starting record and telephone communication end record in such a manner that the IP telephone service operation/management server 36-2 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 7-2 and 7-4. Also, the IP telephone service operation/management server 36-2 operates/manages the failure management and the communication quality of the IP telephone network of the communication company “Y” in a batch manner. It should also be noted that the record about the telephone communication commencement defined at the Steps ST28 and ST68, and the record about the end of the telephone communication defined at the Steps ST32 and ST72 among the above-explained procedure may be omitted. In this alternative case, the acquisitions of both the telephone communication starting record and the telephone communication end record by the communication company “X” and the communication company “Y” may be omitted. It should also be noted that both the IP telephone service operation/management servers 36-1 and 36-2 may be subdivided into an IP telephone service server which exclusively manages the IP telephone services, and also an IP telephone network operation/management server which exclusively manages the resources of the IP telephone network. <<IP Voice/Image Service Operation/Management Server>> The IP voice/image (audio/visual) service operation/management server 37-1 managed by the communication company “X” acquires the above-explained voice/image communication starting record and voice/image communication end record in such a manner that the IP voice/image service operation/management server 37-1 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 8-2 and 8-4. Also, the IP voice/image service operation/management server 37-1 checks as to whether or not the internal resources of the IP voice/image network managed by the communication company “X” are operated under normal condition by using such a means for transmitting/receiving an ICMP packet (namely, failure management). These internal resources are, for instance, the routers 19-14, 19-15; the domain name server 32-1 dedicated to the IP telephone network; and the communication lines among the routers. Also, the IP voice/image service operation/management server 37-1 monitors as to whether or not the congestion of the IP packets within the IP voice/image network is excessively increased (namely, communication quality control) in order that the IP voice/image network of the communication company “X” may be operated/managed in a batch mode. Similarly, the IP voice/image service operation/management server 37-2 managed by the communication company “Y” acquires the above-explained voice/image communication starting record and voice/image communication end record in such a manner that the IP voice/image service operation/management server 37-2 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 7-2 and 7-4. Also, the IP voice/image service operation/management server 37-2 operates/manages the failure management and the communication quality of the IP voice/image network of the communication company “Y” in a batch manner. It should be understood that both the IP voice/image service operation/management servers 37-1 and 37-2 may be subdivided into an IP voice/image service server which exclusively manages the IP voice/image services, and also an IP voice/image network operation/management server which exclusively manages the resources of the IP voice/image network. <<Best Effort Service Operation/Management Server>> A best effort service operation/management server 38-1 managed by the communication company “X” operates/manages failure managements and communication qualities of a best effort network of the communication company “X” in a batch manner. Similarly, a best effort service operation/management server 38-2 managed by the communication company “Y” operates/manages failure managements and communication qualities of a best effort network of the communication company “Y” in a batch manner. It should be noted that both the best effort service operation/management services 38-1 and 38-2 may be subdivided into a best effort service server for exclusively managing best effort services, and also a best effort network operation/management server for exclusively managing resources of a best effort service network, respectively. In the above-described description, the names of elements employed in the embodiment are applied as, for example, “H323 termination unit and “H323 gateway”. This does not imply that these element names are made in accordance with the ITU-H323 recommendation. Instead, these element names own meanings related to the ITU-H323 recommendation. As indicated in FIG. 65, a media router operator 102 exchanges information via an operation input/output unit 51-1 with respect to an RAS administration program 101-1 employed in the RAS mechanism 49-1, or rewrites a RAS table provided in the RAS administration program 101-1 so as to manage registration/certification of terminals, and also manage an internal state of the media router 14-1. As represented in FIG. 66, while a terminal operator 103 operates the dependent type IP telephone set 13-1, this operation information is supplied via an H323 terminal program 105-2 and subsequently a 3-layer communication path 106 which is virtually present within a communication line 53-1 so as to be exchanged with an interface 105-1 of the RAS administration program employed in the RAS mechanism 49-1 and an AP layer 101-2 of the RAS administration program. Also, the RAS table provided in the RAS administration program is rewritten, so that the terminal operator 103 manages registration/certification of terminals and an internal state of the media router 14-1. As represented in FIG. 67, while a telephone operator 104 operates the analog telephone set 18-1, this operation information is supplied so as to be exchanged with a telephone operation program 106-2 employed in the SCN interface 24-1, and subsequently a TCP/IP interface 106-1 of the RAS administration program employed in the RAS mechanism 49-1 and an AP layer 101-3 of the RAS administration program. Also, the RAS table provided in the RAS administration program is rewritten, so that the telephone operator 104 manages registration/certification of terminals and an internal state of the media router 14-1. In the embodiment of FIG. 20, all of the elements provided within the range 6-2 of the IP transfer network which is operated/managed by the communication company “Y” may be eliminated, and furthermore, the routers 21-1 through 21-5 may be eliminated. In such an alternative case, the internal elements of the integrated IP transfer network 2 are arranged only by employing the range 6-1 of the IP transfer network operated/managed by the communication company “X”, the network node apparatus 7-1 to 7-4 and 8-1 to 8-4 and the gateways 9-1 to 9-2. In the case of the IP data communication, for example, the information is transferred from the network node apparatus 8-2 via the router 19-1 and the router 19-3 to the network node apparatus 7-2. In the case of the IP telephone communication, for instance, the information is transferred from the network node apparatus 8-2 via the router 19-8 and the router 19-9 to the network node apparatus 7-2. 2. Second Embodiment Using Gateway <<Communications Among Analog Telephone Sets Via Gateway>> Both the media routers 14-1 and 14-2 shown in FIG. 23 and FIG. 24 own the substantially same internal arrangements and also functions as those of a gateway 9-1 shown in FIG. 68 and of a gateway 9-2 indicated in FIG. 69. There are the below-mentioned technical different points. That is, the media routers 14-1 and 14-2 are provided outside the integrated IP transfer network 2, whereas the gateways 9-1 and 9-2 are provided inside the integrated IP transfer network 2. Also, charging units 72-1 and 72-2 are provided inside the gateways 9-1 and 9-2. Each internal structure of the media routers 14-11, 14-2 and the gateways 9-1, 9-2 is constituted by common internal element blocks such as an SCN interface, an H323 termination unit, a connection control unit and a router. Also, reference numeral 79-1 shows a RAS mechanism of the gateway 9-1, reference numeral 80-1 denotes an information process mechanism of the gateway 9-1, and reference numeral 81-1 shows an operation input/output unit of the gateway 9-1. Both the media routers and the gateways are arranged by substantially similar functions to each other, except for process operations related to the charging units. An IP terminal 11-6 and a dependent type IP telephone set 13-3 are connected via a communication line to the gateway 9-1, whereas an IP terminal 11-10 and a dependent type IP voice/image apparatus 16-4 are connected via a communication line to the gateway 9-2. In order that a terminal-to-terminal communication can be established via a media router, the below-mentioned terminal-to-terminal communications are realized via the gateway 9-1, the integrated IP transfer network 2 and the gateway 9-2. For example, a terminal-to-terminal communication may be established between the IP terminal 11-6 and the IP terminal 11-10 shown in FIG. 20. Also, a terminal-to-terminal communication may be established between the dependent type IP telephone set 13-3 and the dependent type IP telephone set 13-4 shown in FIG. 20. Also, a terminal-to-terminal communication may be established between the dependent type IP voice/image apparatus 16-1 and the dependent type IP voice/image apparatus 16-4 shown in FIG. 20. Referring now to FIG. 68 to FIG. 85, a description will be made of communication process operations executed between an analog telephone set 18-5 and an analog telephone set 18-6 via the gateway 9-1, the integrated IP transfer network 2 and the gateway 9-2. When the handset of the analog telephone set 18-5 is taken up, a telephone call signal is reached via a telephone line 17-3, a public switched telephone network 26-1, and a telephone line 17-1 to an SCN interface 77-1 provided within the gateway 9-1 (Step S60 of FIG. 68), and then, the SCN interface 77-1 returns a call confirmation signal via the public switched telephone network 26-1 to the analog telephone set 18-5 (Step S61). Next, when the user of the analog telephone set 18-5 dials a telephone number “Tel-18-6 name” of the telephone set 18-6 of the communication counter party, if the analog telephone set 18-5 sends out a call setting signal to the communication line 17-3, then the call setting signal is reached via the public switched telephone network 26-1 and the telephone line 17-1 to the SCN interface 77-1 (Step S62). A data block 48-1 shown in FIG. 70, which is produced by digitalling the call setting signal, is transferred to the H323 termination unit 76-1 (Step S62 x). The H323 termination unit 76-1 retrieves records contained in a gateway state table 100-2 of FIG. 87, and then detects a line identifier indicative of the communication line 17-1, newly a record (i.e., “17-1”) on a first row of this gateway state table 100-2 from the top row. Next, the H323 termination unit 76-1 reads out a telephone number “81-3-9876-5432” of the analog telephone set 18-5 and an IP address “100.101.102.103” thereof, which are described in the record. Furthermore, the H323 termination unit 76-1 produces an IP packet 48-2 and transmits it to a domain name server 78-1 (Step S63). The IP packet 48-2 stores thereinto the address of the analog telephone set 18-5, namely a transmission source IP address “A185”; the address of the domain name server 78-1 within the gateway, namely a destination IP address “A781”; and a telephone number “Tel-18-6 name” of a communication counter party. The domain name server 78-1 checks the content of the received IP packet 48-2, and subsequently, transmits an IP packet 48-3 via the network node apparatus 8-4 to the domain name server 31-1 dedicated to the IP telephone network (Step S64). When the domain name server 31-1 dedicated to the IP telephone network returns such an IP packet 48-4 to the domain name server 78-1 (Step S65), the domain name server 78-1 returns the IP packet 48-4 to the H323 termination unit 76-1. The above-explained returned IP packet 48-4 contains an IP address “A186” which corresponds to the telephone number “Tel-18-6 name” of the communication counter party in a 1-to-1 correspondence manner. Next, in such a case that the H323 termination unit 76-1 produces an IP packet 48-5 and transmits the IP packet 48-5 to the network node apparatus 8-4 (Step S66), when the network node apparatus 8-4 transfers the received IP packet 48-5 to the internal arrangement of the integrated IP transfer network 2 shown in FIG. 20, the IP packet 48-5 passes through the routers 19-8, 19-9, 21-2, 19-11 and 19-13 provided inside the IP telephone network 4, and then is reached to the network node apparatus 7-4. As a result, the network node apparatus 7-4 sends out the received IP packet 48-5 via the router 74-2 and the H323 termination unit 76-2 to the SCN interface 77-2. This SCN interface 77-2 interprets the IP packet 48-5 as a telephone call to the analog telephone set 18-6, and sends out a telephone call signal to the telephone line 17-2 (Step S66 x). Upon receipt of a call confirmation signal from the public switched telephone network 26-2 (Step S66 y), the SCN termination unit 77-2 executes the below-mentioned two procedure operations. As a first procedure operation, the SCN interface 77-2 produces a returning IP packet 48-6 and then returns the IP packet 48-6 to the router 74-2. As a second procedure operation, the SCN interface 77-2 sends out a call setting signal via the line 17-2 to the public switched telephone network 26-2. The IP packet 48-6 produced by the first procedure operation is reached via the network node apparatus 7-4 (Step S67) and the IP telephone network 4 to the network node apparatus 8-4, and is finally delivered to the H323 termination unit 76-1 provided within the gateway 9-1. Next, the H323 termination unit 76-1 interprets the received IP packet 48-6 as such a fact that a telephone set of a communication counter party (analog telephone set 18-6) is being called, and thus, sends out a data block 48-7 for implying a telephone calling sound to the SCN interface 77-1. As a result, the SCN interface 77-1 sends out the telephone calling sound to the communication line 17-1. When the calling sound is reached via the public switched telephone network 26-1 and the communication line 17-3 to the analog telephone set 18-5, the analog telephone set 18-5 interprets that the analog telephone set 18-6 is being called as the communication counter party. While the above-explained second procedure operation is carried out, the analog telephone set 18-6 receives the call setting signal (Step S67 x) and produces the telephone call sound. When the user of the analog telephone set 18-6 hears the telephone call sound and then picks up the handset of the analog telephone set 18-6, a call setting confirmation signal is sent out from the analog telephone set 18-6. The call setting confirmation signal is reached via the line 17-4, the public switched telephone network 26-2, and the line 17-2 to the SCN interface 77-2. When a response received from the SCN interface 77-2 is transferred to the H323 termination unit 76-2 (Step S67 y), the H323 termination unit 76-2 produces an IP packet 48-8, and then sends out the IP packet 48-8 to the H323 termination unit 76-1 (Step S68). As a result, the IP packet 48-8 is reached via the network node apparatus 7-4 and the IP telephone network 4 to the network node apparatus 8-4, and then, is received via the router 74-1 within the gateway 9-1 to the H323 termination unit 76-1. The H323 termination unit 76-1 understands that the received IP packet 48-8 is a response (namely, user of analog telephone set 18-6 takes up handset), and thus, sends out a data block 48-9 for implying a call setting confirmation to the SCN interface 77-1. As a result, the SCN interface 77-1 sends out a call setting confirmation signal to the communication line 17-1, and then, is delivered via the public switched telephone network 26-1 and the communication line 17-3 to the analog telephone set 18-5. The above-described Step S68 corresponds to such a procedure that information of a response is transferred, namely, the IP packet 48-9 is transferred which notifies such a fact that the telephone communication is commenced between the analog telephone set 18-5 and the analog telephone set 18-6. When both the network node apparatus 7-4 and 8-4 detect the IP packet 48-9, a record of the commencement of the telephone communication may be saved in a charge record file. In other words, such a fact that the telephone communication is commenced between the analog telephone sets 18-5 and 18-6 and a time instant thereof is saved in the charge record file. When the user of the analog telephone set 18-1 starts a telephone conversation, a voice (speech) signal is transferred via the communication line 17-3, the public switched telephone network 26-1, and the communication line 17-1 to the SCN interface 77-1 so as to be converted into digital voice data. Next, the H323 termination unit 76 produces an IP packet 48-10 containing the digital voice data. The voice packet 48-10 is delivered to the analog telephone set 18-6 via the router 74-1; the network node apparatus 8-4; the routers 19-8, 19-9, 21-2, 19-11 and 19-13; the network node apparatus 7-4; the H323 termination unit 76-3; the SCN interface 77-2; the communication line 17-2; the public switched telephone network 26-2; and the communication line 17-4 (Step S69). The voice of the user of the analog telephone set 18-6 is delivered to the analog telephone set 18-5 along a direction opposite to the above-explained packet flow direction (Step S70), namely, is supplied via the SCN interface 77-2; the H323 control unit 76-2; the network node apparatus 7-4; the routers 19-13, 19-11, 21-2, 19-9 and 19-8; the network node apparatus 8-4; the H323 termination unit 76-1 provided inside the gateway 9-1; the SCN interface 77-1; and the communication line 17-1. When the user of the analog telephone set 18-5 puts on the handset in order to end the telephone communication, the analog telephone set 18-5 sends out a call interrupt signal indicative of ending of the telephone conversation to the communication line 17-3. The SCN interface 77-1 converts the call interrupt signal into a digital data format. Next, the H323 termination unit 76-1 produces an IP packet 48-12 which indicates that the telephone communication is ended, and then sends out the IP packet 48-12 to the router 74-1 (Step S71). Then, the IP packet 48-12 is delivered to the analog telephone set 18-6 via the network node apparatus 8-4; the routers 19-8, 19-9, 21-2, 19-11 and 19-13; the network node apparatus (7-4); the H323 termination unit 76-2; and the SCN termination unit 77-2. The user of the analog telephone set 18-6 may know such a fact that the telephone communication is ended, and then, when this user puts on the handset of the analog telephone set 18-6, the SCN interface 77-2 interprets a confirmation of a call interrupt (namely, end of telephone communication), and requests the public switched telephone network 26-2 to notify “use fee of public switched telephone network” which is required for the telephone communication between the analog telephone sets 18-5 and 18-6. For example, when the communication line 17-2 is the ISDN line, charge information is notified when the telephone communication is ended. The SCN interface 77-2 notifies the acquired use fee of the public switched telephone network as a charge fee to the H323 termination unit 76-2. The H323 termination unit 76-2 grasps both a call release confirmation and the charge fee, so that the below-mentioned two procedure operations can be carried out. As the first procedure operation, the H323 termination unit 76-2 produces an IP packet 48-13, and sends out the IP packet 48-13 to the router 74-2. As a result, the IP packet 48-13 is delivered to the H323 termination unit 76-1 (Step S72) along a direction opposite to the above-explained packet flow direction, namely, is supplied via the network node apparatus 7-4; the routers 19-13, 19-11, 21-2, 19-9 and 19-8; the network node apparatus 8-4 to the H323 termination unit 76-1. Furthermore, as the second procedure process, the H323 termination unit 76-2 notifies a data block 48-14 to a charging unit 72-2 by employing a data transfer function operable within the gateway 9-2. The data block 48-14 contains the information about the charge fee which has been acquired in accordance with the above-explained procedure. The charging unit 72-2 may save thereinto the acquired charge information when the public switched telephone network 26-2 is used in the telephone communication established between the analog telephone sets 18-5 and 18-6. In accordance with the above-explained procedure operation, the analog telephone set 18-5 transmits/receives the IP packet to/from the analog telephone set 18-6, so that the telephone communication can be established. The above-described Step S72 corresponds to such a procedure that information of a call interrupt confirmation is transferred, namely, the IP packet 48-13 is transferred which notifies such a fact that the telephone communication is ended between the analog telephone set 18-5 and the analog telephone set 18-6. When both the network node apparatus 8-4 and 7-4 detect the IP packet 48-13, a record of the completion of the telephone communication may be saved in a charge record file. In other words, such a fact that the telephone communication is ended between the analog telephone sets 18-5 and 18-6 and an ending time instant are saved in the charge record file. The IP telephone service operation/management server 36-1 managed by the communication company “X” acquires the above-described telephone communication starting record and telephone communication end record, in such a manner that the IP telephone service operation/management server 36-1 periodically, or temporarily transmits/receives an inquiry IP packet with respect to the network node apparatus 8-4. Also, the IP telephone service operation/management server 36-1 acquires the above-explained charge information by transmitting/receiving the inquiry IP packet to/from the charging unit 72-1. Similarly, the IP telephone service operation/management server 36-2 managed by the communication company “Y” acquires the above-explained telephone communication starting record and telephone communication end record in such a manner that the IP telephone service operation/management server 36-2 periodically, or temporarily transmits/receives an inquiry IP packet with respect to the network node apparatus 7-4. Furthermore, the IP telephone service operation/management server 36-2 acquires the charge information by transmitting/receiving the inquiry IP packet to/from the charging unit 72-2. In the above-described communication procedures, while the domain name server 78-1 may be removed from the gateway 9-1, the above-explained Steps S63 to S65 may be replaced by the below-mentioned Steps S63 x and S65 x. In other words, the H323 termination unit 76-1 transmits an IP packet 48-15 via the network node apparatus 8-4 to the domain name server 31-1 (Step S63 x). The IP packet 48-15 stores thereinto the address of the analog telephone set 18-5, namely the transmission source IP address “A185”; the address of the domain name server 31-1 dedicated to the IP telephone network, namely the destination IP address “A311”; and the telephone number of the communication counter party “Tel-18-6 name”. The domain name server 31-1 dedicated to the IP telephone network returns another IP packet 48-16 to the H323 termination unit 76-1 (Step S65 x). The IP packet 48-16 contains the IP address “A186” which corresponds to the telephone number of the communication counter party “Tel-18-6 name” in a 1-to-1 correspondence manner. In the above-explained procedures defined from the Step S63 to the Step S65, or by both the Step S63 x and the Step S65 x, the network node apparatus 8-4 may confirm that the analog telephone set 18-5 is allowed to be communicated from the communication line 17-1 via the network node apparatus 8-4 by checking as to whether or not the combination between the transmission source address “A781” contained in the IP packet 48-3 produced in the domain name server 78-1 in the gateway and the communication line identification symbol “Line-17-1” similarly produced is registered in the address administration table 44-2 (refer to FIG. 86), or by checking as to whether or not the combination between the transmission source address “A185” contained in the IP packet 48-15 produced in the H323 termination unit 76-1 and the communication line identification symbol “Line-17-1” similarly produced is registered in the address administration table 44-2 (refer to FIG. 86). <<Telephone Service Operation/Management Server>> The IP telephone service operation/management server 36-1 managed by the communication company “X” acquires the above-explained telephone communication starting record and also telephone communication end record in such a manner that the IP telephone service operation/management server 36-1 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 8-2 and 8-4. Also, the IP telephone service operation/management server 36-1 checks as to whether or not the internal resources of the IP telephone network managed by the communication company “X” are operated under normal condition by using such a means for transmitting/receiving an ICMP packet (namely, failure management). These internal resources are, for instance, the routers 19-8, 19-9, 19-10; the domain name server 31-1, and the communication lines among the routers. Also, the IP telephone service operation/management server 36-1 monitors as to whether or not the congestion of the IP packets within the IP telephone network is excessively increased (namely, communication quality control) in order that the IP telephone network of the communication company “X” may be operated/managed in a batch mode. Similarly, the IP telephone service operation/management server 36-2 managed by the communication company “Y” acquires the above-explained telephone communication starting record and telephone communication end record in such a manner that the IP telephone service operation/management server 36-2 periodically, or temporarily transmits/receives an inquiry IP packet with respect to both the network node apparatus 7-2 and 7-4. Also, the IP telephone service operation/management server 36-2 operates/manages the failure management and the communication quality of the IP telephone network of the communication company “Y” in a batch manner. It should also be noted that the record about the telephone communication commencement defined at the Step S68, and the record about the end of the telephone communication defined at the Step S72 among the above-explained procedure may be omitted. In this alternative case, the acquisitions of both the telephone communication starting record and the telephone communication end record by the communication company “X” and the communication company “Y” may be omitted. It should also be noted that both the IP telephone service operation/management servers 36-1 and 36-2 may be subdivided into an IP telephone service server which exclusively manages the IP telephone services, and also an IP telephone network operation/management server which exclusively manages the resources of the IP telephone network. 3. Third Embodiment Using Media Router Inside CATV Communication Network Referring now to FIG. 88, a description will be made of a third embodiment featured by that since the media router according to the present invention is used inside a CATV communication network, terminals are communicated/connected to each other with employment of an IP transfer network. A media router 115 is located within a CATV gateway 113-2 employed inside a CATV network 113-1, and is connected via a communication 112 to a network node apparatus 111 provided in an integrated IP transfer network 110. Also, the media router 115 is connected via any one of a CATV line interface 114, and CATV lines 119-1 through 119-4 to IP terminals 116-1 through 116-3; an analog telephone set 117, a dependent type IP telephone set 118-1, and a dependent type IP voice/image apparatus 118-2. The CATV lines 119-1 to 119-4 contain communication lower layers (namely, communication physical layer and data link layer) specific to the CATV lines, and also have functions for transferring IP packets in a communication network. An IP packet transmitted from the IP terminal 116-1 is entered via the CATV line 119-1 to the CATV line interface 114 in which the IP packet is derived. The derived IP packet is sent to the media router 115. The media router 115 is arranged in a similar manner to that of the media router 14-1 shown in FIG. 23, and contains the same function as that of the media router 14-1, for example, a domain name server. Because of this reason, the media router 115 can convert an IP packet containing call control data into DNS inquiry response format data, and can send out the converted IP packet to the communication line 112. Also, such an IP packet is transmitted via the media router 115 to the communication line 112. The IP packet is inputted from the analog telephone set 117, the dependent type IP telephone set 118-1, or the dependent type IP voice/image apparatus 118-2 through the CATV lines 119-2 to 119-4 and the CATV line interface 114. Conversely, an IP packet which is sent from the network node apparatus 111 via the communication line 112 may be transmitted via the media router 115, the CATV line interface 114, and thereafter any one of the CATV lines 119-1 to 119-4 to any one of the IP terminal 116-1, the analog telephone set 117, the dependent type IP telephone set 118-1 and the dependent type IP voice/image apparatus 118-2. As previously explained in other embodiments, the IP terminal 116-1, the analog telephone set 117, the dependent type IP telephone set 118-1 and the dependent type IP voice/image apparatus 118-2 provided inside the CATV network 113-1 can establish the terminal-to-terminal communications via the integrated IP transfer network 110 with respect to other various terminals connected to the integrated IP transfer network 110, namely an IP terminal, an analog telephone set, an IP telephone set, and an IP voice/image apparatus, while using the domain name server within the integrated IP transfer network. Since the IP terminal 116-1 indicates a host name of an IP terminal functioning as a communication counter party to the domain name server within the integrated IP transfer network 110 via the CATV line 119-2 and the CATV gateway 113-2 so as to acquire an IP address of the IP terminal of the counter party and subsequently data is transmitted/received from/to the IP terminal 116-1 to the IP terminal of the counter party, a terminal-to-terminal communication for transmitting/receiving data can be carried out. Similarly, since the analog telephone set 117 indicates a host name of an analog telephone functioning as a communication counter party, i.e., a telephone number of a telephone set thereof to the domain name server within the integrated IP transfer network 110 via the CATV line 119-2 and the CATV gateway 113-2 so as to acquire an IP address of the telephone set of the counter party and subsequently voice data is transmitted/received from the analog telephone set 117 to the analog telephone set of the counter party, a telephone communication can be carried out. Similarly, since the dependent type IP telephone set 118-1 indicates a host name of an analog telephone set functioning as a communication counter party, i.e., a telephone number of a telephone set of the counter party to the domain name server within the integrated IP transfer network 110 via the CATV line 119-2 and the CATV gateway 113-2 so as to acquire an IP address of the analog telephone of the counter party and subsequently voice data is transmitted/received from the analog telephone set 117 to this analog telephone set of the counter party, a telephone communication can be carried out. 4. Fourth Embodiment Using Gateway Referring now to FIG. 89, a fourth embodiment will be explained in which while a terminal storage wireless apparatus is combined with the gateway according to the present invention, terminals are connected/communicated with each other by employment of an IP transfer network. In this drawing, reference numeral 120 shows an integrated IP transfer network, reference numeral 121 denotes a network node apparatus, reference numeral 122 represents a gateway apparatus, 123 indicates a wireless transmission/reception unit, reference numeral 124-1 shows a wireless interface conversion unit, reference numeral 124-2 represents a communication line, reference numeral 125 indicates a wireless communication path, reference numeral 126 shows a terminal storage wireless apparatus, reference numeral 127 indicates a wireless transmission/reception unit, reference numeral 128-1 is an IP terminal, reference numeral 128-2 represents a dependent type IP telephone set, reference numeral 128-3 shows a dependent IP voice/image apparatus, and reference numerals 129-1 to 129-3 indicate wireless interface conversion unit. The gateway 122 owns the same function as that of the above-described gateway 9-1 shown in FIG. 68. When terminals such as an IP terminal, an H323 terminal and an analog telephone set are connected via the communication line 124-2, the gateway 122 may be employed for carrying out a terminal-to-terminal communication. Because of this reason, since an IP terminal, an IP telephone set, and an IP voice/image apparatus are connected to each other by using the communication line 124-2, the gateway 122 may perform the terminal-to-terminal communication. Both data having a DNS inquiry/response format sent from the IP terminal 128-1 and text data which will be transmitted/received are converted into an input data format of a wireless transmission/reception unit by the wireless interface conversion unit 129-1, and then the converted data format is entered into the wireless transmission/reception unit 127, and further supplied via the wireless communication path 125 to the wireless transmission/reception unit 123. Then, the data format is converted into such a data format of an IP packet which is applicable to a gateway in the wireless interface conversion unit 124-1, and then the converted IP packet is sent out via the communication line 124-2 to the gateway 122. Both telephone call controlling data and digitally-represented voice (speech) data to be transmitted/received, which are transmitted from the dependent type IP telephone set 128-2, are converted into the input data formats of a wireless transmission/reception unit by the wireless interface conversion unit 129-2, and then the converted data formats are inputted to the wireless transmission/reception unit 127. The converted data formats are supplied via the wireless communication path 125, the wireless transmission/reception unit 123, and the communication line 124-2 to the wireless interface conversion unit 124-1 so as to be converted into data formats of IP packets which is applicable to a gateway by the wireless interface conversion unit 124-1. These data formats are sent to the gateway 122. Both call control data of an IP voice/image apparatus and digitally-expressed voice/moving image data to be transmitted/received, which are transmitted from the dependent type IP voice/image apparatus 128-3 are converted into the input data formats of a wireless transmission/reception unit by the wireless interface conversion unit 129-3, and then the converted data formats are inputted to the wireless transmission/reception unit 127. The converted data formats are supplied via the wireless communication path 125, the wireless transmission/reception unit 123, the wireless interface conversion unit 124-1 and the communication line 124-2 to the wireless interface conversion unit 124-1 so as to be converted into data formats of IP packets which is applicable to a gateway by the wireless interface conversion unit 124-1. These data formats are sent to the gateway 122. Also, as a data flow along a direction opposite to the above-described direction, for instance, an IP packet of an IP telephone supplied from the network node apparatus 121 is delivered via the gateway 122, the communication line 124-2, the wireless interface converting unit 124-1, the wireless transmission/reception unit 123, the wireless communication path 125, the wireless transmission/reception unit 127, and the wireless interface conversion unit 129-2 to the dependent type IP telephone set 128-2. Furthermore, the IP terminal 128-1, the dependent type IP telephone set 128-2 and the dependent type IP voice/image apparatus 128-3, which are connected to the terminal storage wireless apparatus 126, may establish the terminal-to-terminal communication with respect to other various terminals which are connected via the integrated IP transfer network 120 to the integrated IP transfer network 120, namely an IP terminal, an analog telephone set, an IP telephone set, an IP voice/image apparatus and the like. 5. Fifth Embodiment with Gateway Having Different Structure This fifth embodiment is a gateway having a different structure from that of the gateway 9-1 shown in FIG. 68 of the second embodiment, and will now be explained with reference to FIG. 90. In this drawing, reference numeral 9-5 shows a gateway, reference numeral 74-5 shows a router, reference numeral 78-5 denotes a domain name server, and reference numeral 79-5 represents a RAS mechanism. This RAS mechanism 79-5 manages registration/certification of terminals to the gateway 9-5, and also internal states (for example, communication state and rest state) of the gateway 9-5. In this case, “registration of terminal” implies that a terminal is connected to the gateway, whereas “certification of terminal” is to confirm as to whether or not a terminal can be formally utilized in accordance with a connection permission condition of the terminal. Reference numeral 80-5 shows an information processing mechanism for executing an information process operation within the gateway 9-5. Reference numeral 81-5 shows an operation input/output unit of the gateway 9-5, and reference numeral 72-5 represents a charging unit. Reference numeral 82-3 represents a gateway unit for H323 communication procedure (H323-GW), reference numeral 75-3 denotes an H323 connection control unit, reference numeral 76-3 shows an H323 termination unit, and reference numeral 77-3 denotes an SCN interface. Also, reference numeral 82-4 indicates a gateway unit for SIP communication procedure (SIP-GW), reference numeral 75-4 shows an SIP connection control unit, reference numeral 76-4 denotes an SIP termination unit, and reference numeral 77-4 represents an SCN interface. Reference numeral 52-3 shows an IP communication line to which an IP terminal is connectable, reference numeral 53-3 indicates a communication line to which an IP telephone set of H323 communication procedure is connectable, and reference numeral 53-4 shows a communication line to which an IP telephone set of SIP communication procedure is connectable. Also, reference numerals 17-3 and 17-4 denote communication lines connected to a public switched telephone network, respectively. The gateway 9-5 of FIG. 90 is replaceable by the gateway 9-1 shown in FIG. 68 of the second embodiment, and the router 74-5 is replaceable by the router 74-1. Also, the domain name server 78-5 is replaceable by the domain name server 78-1, the RAS mechanism 79-5 is replaceable by the RAS mechanism 79-1, the information processing mechanism 80-5 is replaceable by the information processing mechanism 80-1, and the operation input/output unit 81-5 is replaceable by the operation input/output unit 81-1. Also, the charging unit 72-5 is replaceable by the charging unit 72-1, the H323 connection control unit 75-3 is replaceable by the H323 connection control unit 75-1, the H323 termination unit 76-3 is replaceable by the H323 termination unit 76-1, and further, the SCN interface 77-3 is replaceable by the SCN interface 77-1. Under such a circumstance, after the gateway 9-5 of FIG. 90 has been replaced by the gateway 9-1 of FIG. 68, a communication may be carried out by the following manner. That is, an IP terminal is connected to a tip of the IP communication line 52-3, an IP telephone set of H323 communication procedure is connected to a tip of the communication line 53-3, an analog telephone set is connected to a tip of the communication line 17-3, and also is connected via the gateway 9-5 to the terminals 11-10 and 18-6 of FIG. 69 in the second embodiment, which are connected to the integrated IP transfer network 2. Further, reference numeral 82-3 of H323-GW indicates gateway communication interface function unit for H323 communication procedure. Similarly, symbol SIP-GW 82-4 is a gateway communication interface function unit for SIP communication procedure, and is connected to the telephone set 18-6 of FIG. 69 from the IP telephone set for SIP communication procedure connected to a tip of a communication line 53-4 via the communication line 53-4, the SIP termination unit 76-4 which operates the terminal in accordance with the SIP communication procedure, and also the SIP connection control unit 75-4 and the router 74-5, for connecting the terminals in accordance with the SIP communication procedure, so that the communication can be carried out. Moreover, SIP-GW 82-4 is connected from a telephone set connected to a tip of the communication line 17-4 via the SCN interface 77-4 to the telephone set 18-6, so that the communication can be carried out. Both H323-GW 82-3 and SIP-GW 82-4 may provide communication line interfaces corresponding to the two communication procedures. In future, when a communication means is newly developed, a gateway used for this new communication means may be additionally provided at the locations of both the gateways 82-3 and 82-4. Alternatively, since a plurality of gateway communication interface function units depending upon a sort of communication procedures are employed, the gateway may be applied to various telephone connection controls for various communication procedures. 6. Sixth Embodiment Using Telephone Management Server In FIG. 91, reference numeral 201 is an integrated IP communication network, reference numeral 202 indicates an IP data network, reference numeral 203 shows an IP telephone network, and reference numeral 204 represents a voice/image network. Also, reference numeral 206-1 shows a range of an integrated IP communication network which is operated/managed by a communication company “1”, and reference numeral 206-2 denotes a range of an integrated IP communication network which is operated/managed by a communication company “2”. Referring now to FIG. 91 and FIG. 92, a preparation of a telephone communication is explained as follows. That is, a description is made of a terminal-to-terminal communication control method by which a telephone communication is made from an analog telephone set 213-5 to another analog telephone set 214-4 via a media router 212-1, a communication line 210-1, a network node apparatus 208-1, an internal structure of an IP telephone network 203, a network node apparatus 209-2, a communication line 210-5 and also a media router 212-2. In this embodiment, reference numerals 219-1 to 219-10 and 221-2 represent routers. Also, various sorts of severs are installed within the integrated IP communication network 201, and IP addresses are applied to the respective servers. As indicated in FIG. 91, various sorts of servers, the routers, and the node apparatus are connected to each other via IP communication lines, and may exchange data with each other by transmitting/receiving IP packets by using IP communication means owned in the respective units. Reference numerals 209-1 to 209-2 show telephone gateways by which a telephone communication can be carried out, for example, from the analog telephone set 209-4 via a public switched telephone network 209-3 to other telephone sets (which has been explained in other embodiments). It should be noted that telephone administration servers 313-5 and 314-5 are substantially equal to the connection servers 1-5 and 1-6 of FIG. 18. Both the gateways 209-1 and 209-2 are substantially equal to the relay connection server 1-7 of FIG. 18. The functions of these gateways will be described in other embodiment. Reference numerals 213-1 and 214-1 show PBX for storing analog telephone sets, and reference numerals 213-2 to 213-6 and 214-2 to 214-6 represent analog telephone sets. The telephone sets 213-2 to 213-3 are connected to the PBX 213-1, whereas the telephone sets 214-2 and 214-3 are connected to the PBX 214-1. The telephone sets 213-4 to 213-6 are connected to the media router 212-1, and the telephone sets 214-4 to 214-6 are connected to the media router 212-2. An IP address “EA01” is applied to the media router 212-1, and an IP address “EA02” is applied to the media router 212-2. A representative telephone number “Tel-No-1” is applied to the telephone sets 213-4 to 213-6, a representative telephone number “Tel-No-2” is applied to the telephone sets 214-4 to 214-6, and extension telephone numbers “2132”, “2133”, “2142” and “2143” are applied to the telephone sets 213-2, 213-3, 214-2 and 214-3, respectively. In this example, no telephone communication is established by the extension telephone sets 213-2 and 213-3 from the media router 212-1 to a telephone set provided on the side of the IP telephone network 203. Similarly no telephone communication is established by the extension telephone sets 214-2 and 214-3 from the media router 212-2 to a telephone set provided on the side of the IP telephone network 203. <<Preparation of Telephone Communication>> A user 227-1 who wishes to use an IP telephone requests an IP telephone acceptance person 228-1 belonging to the communication company “1” to use an IP telephone service (Step P100 of FIG. 92). The IP telephone acceptance person 228-1 acquires from the user 227-1, a user name, a user address, a payment way of a communication fee, and a user telephone number “Tel-No-1”, which constitute the propose information of the IP telephone. Also, an external IP address “EA01” applied to the media router 212-1, an identification symbol “L210-1” of the communication line 210-1 used to be connected to the media router 212-1 by the user, and also a network node apparatus identification number “NN-208-1” of the network node apparatus 208-1 to which the communication line 210-1 is connected are notified to a user service server 313-6 (Step P101). In this case, the user 227-1 indicates the IP address “EA01” to the IP telephone acceptance person 228-1. The user sets the IP address “EA01” to the media router 212-1, which is used in correspondence with the user telephone number “Tel-No-1”. Next, the user service server 313-6 applies to the user 227-1, a user identification symbol “UID-1” used to identify the accepted telephone user, and determines an internal IP address “IA01” for the user 227-1 while the symbol “UID-1” is made in correspondence with the external IP address “EA01”. Then, the user service server 313-6 stores information into a database of the user service server (Step P102). This information is related to the user name, the user address, the payment way of the communication fee, the user telephone number “Tel-No-1”, and the external IP address “EA01”. Since the telephone set 213-5 uses the external IP address “EA01” corresponding to the telephone number “Tel-No-1”, such a representation that the external address of the telephone set 213-5 is equal to “EA01” in the telephone communication by using the IP telephone network 203. Next, the user service server 313-6 notifies at least the above-described user telephone number “Tel-No-1”, external IP address “EA01”, internal IP address “IA01” of the IP telephone request person to the telephone administration server 313-5 by employing the IP communication means (Step P103). The telephone administration server 313-5 notifies one set of corresponding information, namely, the user telephone number “Tel-No-1”, the external IP address “EA01” and the internal IP address “IA01”, to the telephone domain name server 313-2 (Step P105). The telephone domain name server 313-2 saves the user telephone number “Tel-No-1”, “the external IP address” and “internal IP address” in such a format as the resource records which are determined based on the operation rule of the domain name server defined as RFC 1996 (Step P106). Furthermore, the telephone administration server 313-5 notifies four addresses “EA01, EA81, IA01, IA81” to a table administration server 313-3 (Step P107). It should be understood that the telephone administration server 313-5 continuously saves both an external IP address “EA81” and an internal IP address “IA81” of a telephone proxy server 313-1. When the table administration server 313-3 notifies the above-explained four addresses “EA01, EA81, IA01, IA81” with respect to the network node apparatus 208-1 (Step P108), the network node apparatus 208-1 holds four addresses “EA01, EA81, IA01, IA81” (Step P109). These four addresses are indicated on a first record of the address administration table 360-1 provided in the network node apparatus 208-1 as indicated in FIG. 93. In this case, the address “IA01” corresponds to an IP address which is applied to a joint point (logic terminal) between the communication line 210-1 and the network node apparatus 208-1. This IP address “IA01” will be referred to as an “internal IP address” hereinafter, which is applied to the logic terminal of the communication line 210-1. At this time, a record indicated in a second row of the address administration table 360-1 is empty. It should be understood that the record indicated in the first row of the address administration table 360-1 is called as an “IP communication record” of the address administration table of the network node apparatus, and then the IP communication record is defined based upon the external IP address “EA01” of the transmission source, the external IP address “EA81” of the destination, the internal IP address “IA01” of the transmission source, and also the internal IP address “IA81” of the destination. In particular, this IP communication record is referred to as the “IP communication record” of an address administration table of a network node apparatus which defines an IP communication path established between the representative telephone proxy server 313-1 and the media router 212-1. Similarly, a user 227-2 who wishes to use an IP telephone requests an IP telephone acceptance person 228-2 belonging to the communication company “2” to use an IP telephone service (Step P110 of FIG. 92). The IP telephone acceptance person 228-2 acquires from the user 227-2, a user name, a user address, a payment way of a communication fee and a user telephone number “Tel-No-2”, which constitute the propose information of the IP telephone. Also, the external IP address “EA02” applied to the media router 212-2, an identification symbol “L210-5” of the communication line 210-5 used to be connected to the media router 212-2 by the user, and also a network node apparatus identification number “NN-209-2” of the network node apparatus 209-2 to which the communication line 210-5 is connected are notified to a user service server 314-6 (Step P111). In this case, the user 227-2 indicates the acquired IP address “EA02” to the IP telephone acceptance person 228-2. The user sets the IP address “EA02” to the media router 212-2, which is used in correspondence with the user telephone number “Tel-No-2”. Next, the user service server 314-6 applies to the user 227-2, a user identification symbol “UID-2” used to identify the accepted telephone user, and determines an internal IP address “IA02” for the user 227-2 in correspondence with the external IP address “EA02”. Then, the user service server 314-6 stores information into a database of the user service server (Step P112). The information is related to the user name, the user address, the payment way of the communication fee, the user telephone number “Tel-No-2” and the external IP address “EA02”. Since the telephone set 214-4 uses the external IP address “EA02” corresponding to the telephone number “Tel-No-2”, such a representation is used that the external IP address of the telephone set 214-4 is equal to “EA02” in the telephone communication by using the IP telephone network 203. Next, the user service server 314-6 notifies at least the above-described user telephone number “Tel-No-2”, external IP address “EA02”, internal IP address “IA02” of the IP telephone request person to the telephone administration server 314-5 by employing the IP communication means (Step P113). The telephone administration server 314-5 notifies one set of corresponding information, namely, the user telephone number “Tel-No-2”, the external IP address “EA02” and the internal IP address “IA02”, to the telephone domain name server 314-2 (Step P115). The telephone domain name server 314-2 saves one set of such information which is made in correspondence with the user telephone number “Tel-No-2”, the external IP address “EA02” and internal IP address “IA02” in such as format as the resource records (Step P116). Furthermore, the telephone administration server 314-5 notifies four addresses “EA02, EA82, IA02, IA82” to a table administration server 314-3 (Step P117). It should also be noted that the telephone administration server 314-5 continuously saves the external IP address “EA82” and the internal IP address “IA82” of the a telephone proxy server 314-1. Also, both the telephone domain name servers 313-2 and 314-2 owns a redialing function similar to that of a domain name server used in the Internet. Thus, the telephone domain name servers 313-2 and 314-2 may exchange there own information to each other, if necessary (Step P120). When the table administration server 314-3 notifies the above-explained four addresses “EA02, EA82, IA02, IA82” with respect to the network node apparatus 209-2 (Step P118), the network node apparatus 209-2 holds four addresses “EA02, EA82, IA02, IA82” (Step P119). These four addresses are indicated on a first record of the address administration table 360-2 provided in the network node apparatus 209-2 as indicated in FIG. 94. In this case, the address “IA02” corresponds to an IP address which is applied to a joint point (logic terminal) between the communication line 210-5 and the network node apparatus 209-2. At this time, a record indicated in a second row of the address administration table 360-2 is empty. In particular, this IP communication record is referred as an “IP communication record” of an address administration table of a network node apparatus which defines an IP communication path established between the telephone proxy server 314-1 and the media router 212-2. <<Communication Path Establishing Phase>> Referring now to FIG. 91, and FIG. 93 to FIG. 95, a description will be made of a method for controlling a terminal-to-terminal communication connection in which a telephone call is made from the telephone set 213-5 to the telephone set 214-4. The media router 212-1 holds both the telephone number of “Tel-No-1” and the external IP address “EA01”, and the media router 212-2 holds both the telephone number of “Tel-No-2” and the external IP address “EA02”. When the telephone set 213-5 establishes a telephone communication with another telephone set, the telephone number of “Tel-No-1” applied to the media router 212-1 is used, whereas when the telephone set 214-4 establishes a telephone communication with another telephone set, the telephone number of “Tel-No-2” applied to the media router 212-2 is employed. <<Connection Phase>> In the case that the user picks up the handset of the telephone 213-5 (off hook), dials the telephone number of “Tel-No-2” of the telephone set 214-4 functioning as the communication counter party, and then transmits the inputted telephone number to the media router 212-1 (Step P200), the media router 212-2 responds to this telephone number (Step P201). Next, the media router 212-1 produces such an IP packet (refer to 379 of FIG. 96) which contains at least the transmission source telephone number “Tel-No-1”, the destination telephone number “Tel-No-2”, and the user identification information (User-Info.), and then transmits the IP packet to the network node apparatus 208-1, so that the media router 212-1 commences a procedure of telephone call setting operation (Step P204). It should be noted that the user identification information (User-Info.) may be delivered to the media router 212-2 at a Step P219 (will be explained later). This user identification information is constituted by a telephone call identifier “C-id” used to manage, for example, a telephone call on the user side; an identification symbol for a voice (speech) compression system of an IP telephone; and an identification symbol of a voice code conversion codes. A payload portion of an IP packet 379 shown in FIG. 96 may be used as an UDP segment. For instance, both a transmission source port number and a destination port number may be employed as “5060” in order that a program for controlling the telephone communication connection provided inside the media router 212-1 and 212-2 is discriminated from other programs. Upon receipt of the IP packet, the network node apparatus 208-1 retrieves the address administration table 360-1 shown in FIG. 93 so as to seek such a record that the transmission source IP address is “EA01” as the external IP address and the destination IP address of “EA81” is contained. In this example, when the network node apparatus 208-1 finds out the record indicated in the first row of the address administration table 360-1 from the top row, namely, the record being equal to “EA01, EA81, IA01, IA81”, the network node apparatus 208-1 applies the capsulating technique of the IP packet to form an IP packet 380 equal to an internal IP packet shown in FIG. 97 by using the IP addresses “IA01” and “IA81”, which are described in third and fourth addresses inside the record. Thereafter, the network node apparatus 208-1 transmits such a telephone proxy server 313-1 whose IP address is equal to “IA81” (Step P205). In this case, a payload portion of the IP packet 380 corresponds to “379” of the IP packet. When the telephone proxy server 313-1 receives the IP packet 380, the telephone proxy server 313-1 produces an IP packet 381 whose payload portion is equal to the IP packet 379, and sends the produced IP packet 381 to the telephone administration server 313-5 whose IP address is equal to “IA91” (Step P206). The telephone administration server 313-5 determines a communication line identifier (CIC-1-2) as, for instance, CIC-1-2=“Tel-1-No-1”+“Tel-No-2”, depending upon a combination between the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2”, and then saves the communication line identifier (CIC-1-2) into the telephone administration server 313-5. In this case, symbol “+” implies that the telephone number is arranged (namely, coupling of data). The telephone administration server 313-5 notifies both the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2”, which are received at the previous Step P206, to the telephone domain name server 313-2 (Step P207). The telephone administration server 313-5 receives from the telephone domain name server 313-2, the external IP address of “EA01” corresponding to the telephone number “Tel-No-1” in a 1-to-1 correspondence relationship; the internal IP address of “IA01”; and both the IP address “EA02” and the internal IP address “IA02”, which correspond to the telephone number “Tel-No-2” in a 1-to-1 correspondence relationship (Step P208). In this case, the telephone domain name server 313-2 inquires IP address information of the telephone number “Tel-No-2” to the telephone domain name server 314-2 by employing the redialing function so as to acquire the IP address information. The telephone administration server 313-5 checks as to whether or not the IP address “EA01” received from the telephone domain name server 313-2 is made coincident with the transmission source IP address “EA01” which has been acquired from the inside of the IP packet 381 at the Step P206. When the IP address is not made coincident with the transmission source IP address, the telephone administration server 313-5 stops the telephone connection procedure. To the contrary, when the IP address is made coincident with the transmission source IP address, the telephone administration server 313-5 additionally saves the IP address “EA01” of the transmission source telephone set, the internal IP address “IA01” thereof, the IP address “EA02” of the destination telephone set, and also the internal IP address “IA02” thereof into the information of the held communication line identifier (CIC-1-2). It should be noted that as to the IP packet of the communication among the servers provided inside the integrated IP communication network, an IP packet 382 having a format shown in FIG. 99 is transmitted/received by employing the internal IP address. The network node apparatus is not equal to the server. The IP packet transmitted/received between the network node apparatus and the telephone proxy server corresponds to such an IP packet having a capsulated format shown in FIG. 97 and FIG. 101, whereas the IP packet transmitted/received between the network node apparatus and the media router corresponds to an IP packet before being capsulated, to which the external IP address as shown in FIG. 96 has been applied. Next, the telephone administration server 313-5 transmits such an IP packet (IAM packet) via a representative server 313-7 of the communication company “1” (Step P214) and via a representative server 314-7 of the communication company “2” (Step P215) to the telephone administration server 314-5 of the communication company “2” (Step P216). The IP packet contains the IP address “EA01” of the transmission source telephone set, the internal IP address “IA01” thereof, the transmission source telephone number “Tel-No-1”, the IP address “EA02” of the destination telephone set, the internal IP address “IA02” thereof, the destination telephone number “Tel-No-2”, the user identification number (User Info.), and the communication line identifier (CIC-1-2). Then, the telephone administration server 314-5 receives the four IP addresses “EA01, IA01, EA02, IA02”; the two telephone numbers “Tel-No-1” and “Tel-No-2”; the communication line identifier “CIC-1-2”; and the user identification information (User-Info.), and saves all of the received items other than the user identification information (User-Info.) into the internal circuit thereof. Furthermore, the telephone administration server 314-5 whose internal address is “IA92” notifies the IP packet 383 of FIG. 100 to the telephone proxy server 314-1 whose internal IP address is equal to “IA82” (Step P217). In this case, the IP packet 383 contains the IP address “EA01” of the transmission source telephone set, the IP address “EA02” of the destination telephone set, the transmission source telephone number “Tel-No-1”, the destination telephone number “Tel-No-2”, and the user additional information (User-Info.). Then, the telephone proxy server 314-1 forms an IP packet 384 shown in FIG. 101 and sends the IP packet 384 to the network node apparatus 209-2 (Step P218). The network node apparatus 209-2 performs the inverse-capsulation of such an IP packet by removing the header of the IP packet 384 to form an IP packet 385 shown in FIG. 102, and then transmits the IP packet 385 to the media router 212-2 (Step P219). The media router 212-2 acquires the IP address “EA01” of the transmission source telephone set, the IP address “EA02” of the destination telephone set, the transmission source telephone number “Tel-No-1”, the destination telephone number “Tel-No-2” and the user additional information (User-Info.). Next, the media router 212-2 returns the reception of the above-explained information for notifying the telephone reception in connection with two sets of the telephone numbers “Tel-No-1” and “Tel-No-2” to the telephone administration server 314-5 (Steps P221, P222, P223). This telephone administration server 314-5 restores the communication line identifier (CIC-1-2) from the two telephone numbers “Tel-No-1” and “Tel-No-2”, and then transmits a reception confirmation (acknowledgment) IP packet (ACM packet) of above-explained information containing the communication line identifier (CIC-1-2) via the telephone administration server 313-5 to the media router 212-1 (Steps P224 to P229). Next, the media router 212-2 notifies the telephone call (call reception) to the telephone set 214-4 (Step P230), and when the telephone set 214-4 accepts the telephone call, the telephone set 214-4 produces telephone calling sound. The media router 212-2 notifies such a fact that the telephone set 214-4 having the called telephone number “Tel-No-2” is being called via the network node apparatus 209-2 (Step P231) and further via the telephone proxy server (Step P232) to the telephone administration server 314-5, while attaching a set of the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2” (Step P233). The telephone administration server 314-5 of the communication company 2 restores the communication line identifier (CIC-1-2) by employing the set of the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2” sent from the media router 212-2. Next, the telephone administration server 314-5 forms a reception confirmation IP packet (CPG packet) of the above-explained information containing the communication line identifier (CIC-1-2), and then sends the CPG packet to the telephone administration server 313-5 (Steps P234, P235, P236). The telephone administration server 313-5 receives the CPG packet and reads the communication line identifier (CIC-1-2) from the CPG packet. Next, while the telephone administration server 313-5 employs the communication line identifier (CIC-1-2), in such a case that the telephone administration server 313-5 reads out both the address and the telephone number which are recorded/saved at the Step P214, and then transmits at least the IP address “EA01” of the media router 212-1 connected to the transmission source telephone set; the IP address “EA02” of the media router 212-2 connected to the destination telephone set; the transmission source telephone number “Tel-No-1”; and the destination telephone number “Tel-No-2” to the telephone proxy server 313-1 (Step P237), these items are notified via the network node apparatus 208-1 (Step P238) to the media router 212-1 (Step P239). The media router 212-1 informs that the destination telephone set 214-4 is being called to the transmission source telephone set 213-5 (Step P240), and the transmission source telephone 213-5 produces the telephone calling sound. On the other hand, when the user of the telephone set 214-4 hears the telephone calling sound to take up the handset of this telephone set (off hook), the IP telephone set 214-4 notifies the off hook condition to the media router 212-2 (Step P241). Then, the media router 212-2 notifies the off hook notification via the network node apparatus 209-2 (Step P242), and further, via the telephone proxy server (Step P243) to the telephone administration server 314-5 (Step P244). The telephone administration server 314-5 of the communication company 2 restores the communication line identifier (CIC-1-2) from the set of both the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2”, and forms a reception confirmation IP packet (ANM packet) of the above-explained information containing the communication line identifier (CIC-1-2) to transmit the ANM packet to the telephone administration server 313-5 (Steps P245, P246, P247). The telephone administration server 313-5 receives the ANN packet so as to read out the communication line identifier (CIC-1-2) from the ANM packet. While the telephone administration server 314-5 employs the communication line identifier (CIC-1-2) held at the stage of the Step P245, the telephone administration server 314-5 reads both the IP address and the telephone number which are held/stored at the previous Step P217. Next, the telephone administration server 314-5 notifies both the IP address “EA01” and the internal IP address “IA01” of the transmission source telephone set and the IP address “EA02” and the internal IP address “IA02” of the media router 212-2 connected to the destination telephone set to the table administration server 314-3 (Step P250). The table administration server 314-3 saves thereinto a set of the communication line identifier (CIC-1-2); both the IP address “EA01” and the internal IP address “IA01” of the transmission source telephone set; and both the IP address “EA02” and the internal IP address “IA02” of the destination telephone set, and also stores these IP addresses into the address administration table 360-2 contained in the network node apparatus 209-2 (Step P251). This condition is indicated as a record of a second row of the address administration table 360-2 of FIG. 94. While using the read communication line identifier (CIC-1-2), the telephone administration server 313-5 reads out both the IP address and the telephone number saved/stored at the Step P214. Next, the telephone administration server 313-5 notifies the communication line identifier (CIC-1-2), both the IP address “EA01” and the internal IP address “IA01” of the transmission-sided media router 212-1; and both the IP address “EA02” and the internal IP address “IA02” of the destination media router 212-2 to the table administration server 313-3 (Step P252). The table administration server 313-3 holds thereinto the communication line identifier (CIC-1-2); both the IP address “EA01” and the internal IP address “IA01” of the transmission source telephone set; and both the IP address “EA02” and the internal IP address “IA02” of the destination telephone set, and further holds these items into the address administration table 360-1 provided in the network node apparatus 208-1 (Step P253). This condition is indicated as the record of the second row of the address administration table 360-1 of FIG. 93. The record of the second row in the address administration table 360-1 of FIG. 93 corresponds to an “IP communication record of address administration table” which is set into the network node apparatus. The content of the IP communication record is ruled based upon such a definition made of the transmission source external IP address “EA01”, the destination external IP address “EA02”, the transmission source internal IP address “IA01”, and the destination internal IP address “IA02”. The IP communication record of the second row of the address administration table 360-1 contains both the external IP address “EA01” and the external IP address “EA02”, and determines such an IP communication path defined between the media router 212-1 to which the external IP address “EA01” is applied, and the media router 212-2 to which the external IP address “EA02” is applied. Also, the IP communication record of the second row of the address administration table 360-2 determines an IP communication path established between the media router 212-1 and the media router 212-2. It should be noted that the transmission source external IP address “EA01” is determined in a 1-to-1 correspondence relationship with respect to the telephone number “Tel-No-1”, and similarly, the destination external IP address “EA02” is determined in a 1-to-1 correspondence relationship with respect to the telephone number “Tel-No-2”, and when the transmission source is not discriminated from the destination, the IP communication record of the address administration table of the network node apparatus is merely equal to a record of an address administration table for determining an IP communication path between the telephone number “Tel-No-1” and the telephone number “Tel-No-2”. The above-explained Step P245 corresponds to such a procedure capable of notifying response information for confirming a call setting operation, namely capable of notifying such a possibility that the telephone communication between the telephone set 213-5 and the telephone set 214-4 is commenced. The telephone administration server 314-5 notifies, for instance, the communication line identifier (CIC-1-2); the IP address “EA01” of the transmission source media router 212-1; the IP address “EA02” of the destination media router 212-2; the transmission source telephone number “Tel-No-1”; the destination telephone number “Tel-No-2” to a charging administration server 314-4 on the basic of such a time instant when the telephone communication can be started (Step P254). Then, the charging administration server 314-4 can record/hold thereinto the communication line identifier (CIC-1-2); the transmission source telephone number “Tel-No-1”; the destination telephone number “Tel-No-2”; the IP address “EA01” of the transmission source media router 212-1; and the IP address “EA02” of the destination media router 212-2 (Step P254). Similarly, the charging administration server 313-4 can record/hold thereinto the transmission source telephone number “Tel-No-1”; the destination telephone number “Tel-No-2”; the IP address “EA01” of the transmission source telephone set; and the IP address “EA02” of the destination telephone set (Step P255). Also, the telephone administration server 313-5 notifies to the telephone set 213-5, such a fact that the user of the destination telephone set 214-4 takes up the handset so as to respond to the telephone call. In other words, the telephone administration server 313-5 notifies the response to the telephone call via the telephone proxy server 313-1 (Step P256), and furthermore via the network node apparatus 208-1 (Step P257) and the media router 212-1 (Step P258) to the telephone set 213-5 (Step P259). A series of the above-explained steps defined from the Step P200 up to the step P259 will be referred to as a “connection phase of a telephone communication”. At the Step P200, the user of the IP telephone set 213-5 takes up the handset. At the Step P259, the completion of the call setting operation is notified to the telephone 213-5. Also, in the above-explained terminal-to-terminal connection control, such a communication line connected from the network node apparatus 208-1 via the communication line 370-1, and also via the router 219-1, the representative servers 313-7 and 314-7, the router 219-2, and the communication line 370-5 to the network node apparatus 209-2 will be referred to as a “connection control line” inside the IP telephone network 203. The connection control line is used in order to transmit/receive an IP packet for controlling the terminal-to-terminal communication connection. <<Communication Phase>> Referring now to FIG. 103 to FIG. 106, a communication phase will be described. Voice entered into the telephone set 213-5 is transferred to a media router (Step P300), and the media router digitalizes the voice to form an IP packet 387, and transmits the IP packet 387 to the network node apparatus 208-1 (Step P301). The IP packet 387 is capsulated and then is converted into an internal IP packet 388. This internal packet 388 is reached via a communication line 370-3; routers 219-5, 219-7, 221-1, 219-10 and 219-9; a communication line 370-6 to a network node apparatus 209-2 (Step P302). Then, the IP packet 387 is inverse-capsulated by removing the IP header to be converted into an IP packet 389. This IP packet 389 is delivered via a media router 212-2 (Step P303) to a telephone set 214-4 (Step P304). Voice of a user of the telephone set 214-4 is transferred along a direction opposite to the above-explained direction. In other words, the voice of the user of the telephone set 214-4 is reached via the media router 212-2 (Step P305), the network node apparatus 209-2 (Step P306), and the routers 219-9, 219-10, 221-1, 219-7, 219-5 to the network node apparatus 208-1 (Step P307), and then is delivered via the media router 212-1 (Step P308) to a telephone set 213-5 (Step P309). In the above-explained communication phase, while payload portions of the IP packets 387 and 389 are used as “UDP segments”, both a transmission source UDP port number and a destination UDP port number are changed into, for example, “5004”, “5006”, “5010”, “5012”, “5016” etc., so that a telephone communication for transferring other voice can be established. An IP packet 388 containing digitalized voice is transferred through a communication line which connects from the network node apparatus 208-1 via the communication line 370-3; the routers 219-5, 219-7, 221-1, 219-10, 219-9; and the communication line 370-6 to the network node apparatus 209-2. As a result, the IP communication line is called as a “voice communication line” employed in the IP telephone network 203. The voice communication line may be discriminated from the above-described “connection control line” of the IP telephone network 203 in the connection phase. In the communication phase, a record indicated on a second row of an address administration table 360-1 shown in FIG. 93 is carried out by employing a record of an address administration table for determining the IP communication path between the telephone number “Tel-No-1” and the telephone number “Tel-No-2”, namely the IP communication record equal to the transmission source external IP address “EA01”; the destination external IP address “EA02”; the transmission source internal IP address “IA01”; and the destination internal IP address “IA02”. <<Release Phase>> Referring now to FIG. 107, a release phase is explained. In such a case that the user of the telephone set 213-5 puts on the handset thereof in order to accomplish the telephone communication and then notifies the end of the telephone communication to the media router 212-1 (Step P400), the media router 212-1 produces such an IP packet which contains at least an indication of a request for releasing a telephone communication, the transmission source telephone number “Tel-No-1”, and the destination telephone number “Tel-No-2”. When the media router 212-1 sends the produced IP packet to a network node apparatus 208-1 (Step P401), this network node apparatus 208-1 produces such an IP packet made by that the received IP packet is capsulated by employing a record of a first row of the address administration table 360-1 shown in FIG. 93, and then transmits the produced IP packet to the telephone proxy server 313-1 (Step P402). Next, the pilot telephone administration server 313-1 produces such an IP packet containing the indication of the telephone release request, the transmission source telephone number “Tel-No-1”, and the destination telephone number “Tel-No-2”, which have been produced by the media router in the beginning and transmits the produced IP packet to the telephone administration server (Step P403). The above-explained formats of the IP packets and the setting method of the IP addresses used in the above-explained Steps P401, P402, P403 are identical to those of the Steps P204, P205, P206 in the telephone communication connection phase. The telephone administration server 313-5 restores the communication line identifier (CIC-1-2) from both the telephone numbers “Tel-No-1” and “Tel-No-2” so as to produce an IP packet (REL packet) containing both the indicative of requesting the release of the telephone communication and the communication line identifier (CIC-1-2), and then sends the IP packet to the representative server 313-7 of the communication company “1” (Step P404). The IP packet is reached via the representative server 314-7 of the communication company 2 (Step P405) to the telephone administration server 314-5 under management of the communication company “2” (Step P406). Next, the telephone administration server 313-5 returns such a release completion IP packet via the telephone proxy server 313-1 and the network node apparatus 208-1 to the media router 212-1 (Steps P407, P408, P409). This release completion IP packet reports that the release request defined at the Steps P400 to P403 is carried out. Also, the telephone administration server 313-5 transmits an IP packet containing the communication line identifier (CIC-1-2) to the table administration server 313-3 (Step P433). Since the table administration server 313-3 holds the address corresponding to the communication line identifier (CIC-1-2) after the process operation of the Step P252 has been carried out, the table administration server 313-3 confirms to receive an instruction for deleting the four IP addresses “EA01, EA02, IA01, IA02”, and then deletes the record indicated on the second row of the address administration table 360-1 employed in the network node apparatus 208-1 shown in FIG. 93. In other words, the table administration server 313-3 deletes the transmission source external IP address “EA01”; the destination external IP address “EA02”; the transmission source internal IP address “IA01”; the destination internal IP address “IA02”; and the IP communication record (Step P434). That is to say, the table administration server 313-3 deletes the record of the address administration table which determines the IP communication path between the telephone number “Tel-No-1” and the telephone number “Tel-No-2”. When the telephone administration server 314-5 receives the IP packet containing both the communication line identifier (CIC-1-2) and the indication of the release request at the Step P406, the telephone administration server 314-5 forms a release requesting IP packet and sends the IP packet to the telephone proxy server 314-1. The IP packet for implying the instruction of the release request is reached via the network node apparatus 209-2 to the media router 212-2 (Steps P411, P412, P413). Also, since the telephone administration server 314-5 reports that the process operation of the Step P411 is accomplished, the telephone administration server 314-5 produces an IP packet (RLC packet) containing the communication line identifier (CIC-1-2), and then sends the RLC packet to the representative server 314-7 of the communication company “2” (Step P414). The RLC packet is reached via the representative server 313-7 of the communication company 1 (Step P415) to the telephone administration server 313-5 under administration of the communication company “1” (Step P416). The telephone administration server 313-5 which receives the release completion IP packet notifies the end of the telephone communication to the charging administration server 313-4 (Step P442), this charging administration server 313-4 knows such a fact that the telephone communication is ended, which is identified by the communication line number (CIC-1-2), and then records the result inside the server. Next, the telephone administration server 314-5 transmits the IP packet containing the communication line identifier (CIC-1-2) to the table administration server 314-3 (Step P431), and this table administration server 314-3 deletes a set of 4 addresses defined by “EA02, EA01, IA02, IA01” corresponding to the content of the record on the second row of the address administration table 360-2 provided in the network node apparatus 209-2 shown in FIG. 94 (Step P432). When the media router 212-2 knows the release request of the telephone communication at the Step P413, the media router 212-2 instructs the telephone set 214-5 to cut off the telephone communication (Step P420), and subsequently returns the release completion IP packet to the network node apparatus 209-2, the telephone proxy server 314-1, and the telephone administration server 314-5 (Steps P421, P423, P424). The IP packet reports that the release request is carried out at the Step P413. When the telephone administration server 314-5 notifies the end of the telephone communication of the call number to the charging administration server 314-4 (Step P441), this charging administration server 314-4 knows such a fact that the telephone communication is ended, which is identified by the communication line number (CIC-1-2), and then records the result inside the server. <<Items Related to Telephone Communication Connection Control>> The following case is conceivable. That is, a telephone user keeps a telephone communication for a long time, and does not accomplish this telephone communication. Namely, a telephone ending Step P400 shown in FIG. 107 is not executed. In this case, such a risk may be expected that a telephone communication fee is increased to an infinite amount. To avoid such a risk, for example, the telephone administration server 313-5 may inquire a telephone communication fee to the charging administration server 313-4 every time a long time period (e.g., 24 hours) has passed. When the telephone administration server 313-5 detects the long telephone communication, the telephone administration server 313-5 may separately carry out the process operations defined at the Steps P404, P407, P433, P442 except for the process operations defined from the Steps P400 to P403 of FIG. 107. <<Collecting Method of Other Communication Fees>> As to a communication fee, for instance, while a charging information collection server for the communication company “1” is installed inside the integrated IP communication network 201, charging information collected by the charging administration server 313-4 is acquired to be notified to the user service server 313-6, and then the telephone fee may be charged to the telephone user from the charging server. Similarly, a charging information collection server may be installed in the communication company “2”. The above-explained collected charging information may be exchanged between the communication company “1” and the communication company “2” by employing the IP communication means via the representative servers 313-7 and 314-7 of the communication companies. <<In Case of Single Communication Company>> Even in such a case that the operation/management range 206-2 of the communication company 2 shown in FIG. 91 is not present, and the IP telephone network 203 constitutes the operation/management range of the communication company “1”, the operation of the above-described telephone connection phase is available. As a result, as represented in FIG. 108, the operation/management range 206-2 of the communication company “2” is changed into the operation/management range of the communication company “1”, the representative server 314-7 of the communication company 2 is avoidable, and the IP communication line is employed so as to connect the router 219-1 to the router 219-2 with each other. As a consequence, in the connection phase of the telephone communication, the Steps P214 to P216 shown in FIG. 95 become a Step P214X shown in FIG. 109; the Steps P224 to P226 shown in FIG. 95 become another Step P224X indicated in FIG. 109; the Steps P234 to P236 shown in FIG. 95 become another Step P234X indicated in FIG. 109; and the Steps P245 to P247 shown in FIG. 95 become a further Step P245X indicated in FIG. 109; and also other Steps of FIG. 95 are identical to those of FIG. 109. A series of all telephone communication preparations of the communication company “2” are changed into those of the communication company “1”. Among a series of the above-explained steps described in both the telephone communication connection phase and the telephone communication release phase, the communication established between the telephone administration server 313-5 and the telephone administration server 314-5 is left, and a series of the processing steps which are carried out by both the representative server 313-7 of the communication company 1 and the representative server 314-7 of the communication company 2 are omitted. Moreover, such a telephone administration server may be formed by employing the telephone administration server 313-5 and the telephone administration server 314-5. As a result, in the above-described telephone communication connection phase, the Steps P214X, P224X, P234X, P245X, P254X indicated in FIG. 109 are omitted; the Steps P217, P223, P233, P244, P250, P251 become P217 x, P223 x, P233 x, P244 x, P250 x, P251 x shown in FIG. 110, respectively; and other Steps shown in FIG. 109 are identical to those of FIG. 110. <<Explanation No. 1 Related to Connection Control of Telephone Administration Server>> In the above-explained Step P214 in which the communication is made from the telephone administration server 313-5 to the representative server 313-7 of the communication company, before inquiring to the telephone domain name server 313-2, it can be known as to whether the destination telephone number “Tel-No-2” belongs (/is joined) to the IP telephone network managed/operated by the own communication company, or the IP telephone network managed/operated by another communication company. This process operation is carried out as follows: The telephone administration server 313-5 may solve the above problem by employing “communication company section table of telephone number”. A description will now be made of an example of the communication company section table of the telephone number shown in FIG. 111. As a record of a serial No. 1 of the communication company section table, “81-3-5414-xxxx” is indicated in the column of “telephone number”; “No” is denoted in the column of “own communication company?”; and “Com-130” is indicated in the column of “identification information of another communication company”. Symbol “xxxx” implies decimal notation of “0000” to “9999” In this case, the telephone numbers “81-3-5414-0000” to “81-3-5414-9999” show such a fact that these telephone numbers belong to the IP telephone network managed by the communication company identified by symbol “Com-130”. Also, a telephone number “1-2245-5678” described on a record of a serial No. 2 of the communication company section table belongs to the IP telephone network operated/managed by the communication company identified by symbol “Com-025”. Also, a telephone number “81-47-327-3887” described on a record of a serial No. 3 of the communication company section table belongs to the IP telephone network operated/managed by the communication company to which the telephone administration server 313-5 belongs. <<Explanation No. 2 Related to Connection Control of Telephone Administration Server>> In the above-explained Step P214 in which the communication is made from the telephone administration server 313-5 to the representative server 313-7 of the communication company, even when it can be seen that the IP telephone set of the destination telephone number “Tel-No-2” is operated/managed by the own communication company, it is possible to know as to whether or not such a telephone set whose telephone number is “Tel-No-2” and to which another telephone administration server is connected is joined to which network node apparatus, which will be explained as follows: The telephone administration server 313-5 may solve this problem by way of a telephone administration server section table of telephone number. An explanation will be made of an example of a telephone administration server section table of telephone numbers shown in FIG. 112. The telephone number “81-47-325-3887” on the record of the serial No. 1 of the telephone administration server section table represents such a fact that the telephone set is joined (namely, the communication line is connected) to the network node apparatus operated/managed by the telephone administration server 313-5. The telephone number “81-2245-56xx” described on the record of the serial No. 2 of the telephone administration server section table indicates such a fact that the telephone numbers of “81-2245-5600” to “1-2245-5699” are joined (namely, communication line is connected) to the network node apparatus which is operated/managed by such a communication company in which the IP address of the telephone administration server is equal to “100.10.11.40”. Next, the telephone number “81-6-1234-xxxx” described on the record of the serial No. 3 of the telephone administration server section table indicates such a fact that the telephone numbers of “81-6-1234-0000” to “81-6-1234-9999” are joined (namely, communication line is connected) to the network node apparatus which is operated/managed by such a communication company. <<Operation/Management of Network by Operation/Management Server>> While the operation/management server 313-9 of the communication company “1” periodically, or temporarily uses internal resources of the operation/management range 206-1 of the communication company “1”, namely the network node apparatus 208-1, 208-2; the routers 219-1, 219-3, 219-5, 219-6, 219-7; the telephone domain name server 313-2; the telephone administration server 313-5; the pilot telephone administration server 313-1; the table administration server 313-3; the charging management server 313-4; the representative server 313-7; the user service server 313-6; and the telephone gateway 209-1; and further the IP communication means, or the means for transmitting/receiving the ICMP packet, the operation/management server 313-9 checks as to whether or not these resources are operated under normal conditions. Alternatively, the operation/management server 313-9 checks as to whether or not the communication lines among the resources are operable under normal states (failure management), or checks as to whether or not congestion of the IP packet within the network becomes excessively large (communication quality control). As a result, the operation/management server 313-9 operates/manages the internal resources of the operation/management range 206-1 of the communication company “1” in a batch manner. Both the failure condition and the communication quality condition of the network resources containing the communication line, which are acquired by the operation/management results, may be reported via the user service server 313-6 to the telephone user 227-1. Similarly, while the operation/management server 314-9 of the communication company “2” periodically, or temporarily communicates various sorts of resources provided inside the operation/management range 206-2 of the communication company 2, the server checks as to whether or not these resources are operated under normal condition. Alternatively, the operation/management server 314-9 checks as to whether or not the communication lines among the resources are operable under normal states (failure management), or checks as to whether or not congestion of the IP packet within the network becomes excessively large (communication quality control). As a result, the operation/management server 314-9 operates/manages the internal resources of the operation/management range 206-2 of the communication company “2” in a batch manner. Both the failure condition and the communication quality condition of the network resources containing the communication line, which are acquired by the operation/management results, may be reported via the user service server 314-6 to the telephone user 227-2. Since the above-described network operation/management are carried out by the operation/management servers 313-9 and 314-9, it is possible to improve the reliability in the terminal-to-terminal communication connection control of the telephone network 203 provided inside the IP transfer network 201 established between the IP telephone set 213-5 and the IP telephone set 214-4. Similarly, since the network operation economical base of the communication company can be supported by the collecting means of the communication fees by the charging administration servers 313-4 and 314-4, it is possible to improve the reliability in the terminal-to-terminal communication connection control of the telephone network 203 within the IP transfer network 201. The contents of the embodiment 6 will now be summarized with supplemental information as follows: That is, the IP transfer network contains at least the network node apparatus, the telephone administration server, the media router, the telephone domain name server and the table administration server. A user “i” (i=1, 2, 3, . . . ) sets the individual external IP address “EA-i” to the media router of the user located outside the IP transfer network, one, or more telephone sets are connected to the media router of the user “i”, and the media router is connected via the communication line to any one of the network node apparatus. An internal IP address “IA-i” used for the communication of the user “i” is applied to the termination unit (logic terminal) on the side of the network node apparatus of the communication line, and also the telephone number of the individual user is applied to the media router. Also, the telephone domain name server holds the set constituted by the telephone number of the individual user; the external IP address “EA-i” of the media router; and the internal IP address “IA-i”. When the telephone domain name server is inquired as to the telephone number of the individual user, the telephone domain name server responds both the external IP address and the internal IP address, and also sets the IP communication record for determining the IP communication path established between the media router and the telephone proxy server into the network node apparatus. The IP communication record is used to request the transmission source telephone set, and is transferred via the telephone proxy server to the telephone administration server. The telephone administration server requests the telephone domain name server so as to acquire both the external IP address of the transmission source media router and the internal IP address (“EA-i, IA-i”) thereof from the transmission source telephone number, or both the external IP address and the internal IP address (“EA-j, IA-j”) of the destination media router from the destination telephone number. Then, the table administration server sets these IP addresses to the network node apparatus on the transmission side and the network node apparatus on the destination side as the IP communication records which are used in the telephone communications between the transmission source telephone set and the destination telephone set. When the telephone set on the transmission source side requests the call setting operation, the media router on the transmission source side sends the IP packet containing both the destination telephone number and the transmission source telephone number to the telephone administration server on the transmission source side. Then, the telephone administration server on the transmission source side exclusively determines the line number (CIC) for identifying the communication line for the telephone voice based upon the set of the destination telephone number and the transmission source telephone number. Next, the telephone administration server on the transmission source transmits “IAM packet for requesting telephone call setting operation” which contains the transmission source telephone number, the destination telephone number, and the line number to the telephone administration server on the destination side. The telephone administration server on the destination side notifies the call reception to the media router on the destination side. When the telephone reception of the telephone set is allowed, the telephone administration server on the destination side transmits the above-explained “ACM packet for notifying reception of IAM packet” via the telephone administration server on the transmission source to the media router on the transmission source side. Also, the media router on the destination side requests the telephone set on the destination side to execute the telephone call setting operation. When the telephone set produces the telephone calling sound, the media router informs to the telephone administration server on the destination side, such a fact that the telephone set is being called. The telephone administration server on the destination side transmits “CPG packet for notifying call reception” to the telephone administration server on the transmission source, and then, the telephone management server on the transmission source side notifies the call reception via the media router to the telephone set on the transmission source side. In response to the call setting request, the telephone set on the destination side notifies the response via the media router on the destination side to the telephone administration server on the destination side. The telephone administration server on the destination side produces ANM packet for indicating response to call setting request, and transmits the ANM packet to the telephone administration server on the transmission side. The telephone administration server on the transmission source side notifies the response to request the call setting operation to the media router on the transmission source side. The telephone set on the transmission source side stops the calling sound, and is advanced to the communication phase. When the telephone communication of the telephone set on the transmission source side, or the destination side is ended, and also the cut request of the telephone calling operation is notified, this cut request is notified via the media router to the telephone administration server. The telephone administration server which requests telephone call interruption forms “REL packet for requesting end of telephone communication” by employing the line number (CIC), and then, transmits the REL packet to the telephone administration server on the call interrupt side. This telephone administration server on the call interrupt side returns “RLC packet for reporting reception of REL packet”. The telephone administration server on the call interrupt side notifies the end report of the telephone communication to the media router on the interrupt request side. After the telephone communication is ended, the telephone administration server may collect the telephone communication record containing the line number, the communication time instant, and the telephone number, and then may notify the telephone communication record to both the operation managing server and the charging server. In the terminal-to-terminal communication connection control established between the telephone administration server and the relay telephone administration server, and also the terminal-to-terminal communication connection control established between the two telephone administration servers, the above-explained IAM, ACM, CPG, ANM, REL and RLC are transmitted/received. The IP packet is transmitted/received between the telephone administration server and the media router so as to perform the terminal-to-terminal connection control. While the payload portion of the IP packet is used as the UDP segment, and also both the telephone call connection phase and the telephone release phase are used as a single port number, a single call control program for managing both the connection phase and the telephone release phase may be utilized in the different telephone communications. Also, in the telephone communication phase, since the UDP port numbers different from each other every telephone set are allocated, even when the media router is only one IP address, the different voice every telephone set may be transferred. In order that one telephone administration server may solely play both the function of the telephone administration server on the transmission side and the function of the telephone administration server on the reception side, the above-explained telephone administration server may perform the procedures of both the telephone communication connection phase and the telephone release phase in combination with both the transmission source media router and the destination media router via the telephone proxy server. In order that the telephone administration server may know as to whether the destination telephone number belongs to the IP telephone network operated/managed by the own communication company, or by another communication company, the telephone administration server may employ the communication company segment table of the telephone number. Also, in order to know such a fact that the telephone set having the destination telephone number is joined to which network node apparatus, the telephone administration server may employ the telephone administration server segment table of the telephone number. Since the operation/management server of the communication company exchanges the information with respect to the network node apparatus of the operation/management range of the communication company, the various sorts of servers, and also the telephone gateway so as to operate/manage the internal resources of the network in the batch node, the reliability in the terminal-to-terminal communication connection control inside the network can be improved. Otherwise, the operation/management server can improve the reliability of the terminal-to-terminal communication connection control of the IP transfer network in conjunction with the charging administration server. Furthermore, in this embodiment, the above-mentioned IP encapsulation and reverse-capsulation by the network node apparatus can be replaced to the simple encapsulation which forms an internal packet by adding a simple header to an external IP packet and the simple reverse-capsulation which removes the simple header from the internal packet, respectively. 7. Seventh Embodiment in which Structures of Media Routers are Different from Each Other FIG. 113 is a schematic diagram for explaining a method for applying an IP address and a telephone number with respect to a media router. FIG. 114 is an explanatory diagram for explaining a capsulation relation item of an IP packet of a network node apparatus. Referring to these drawings, a seventh embodiment will now be explained. A media router 530 stores IP telephone sets 515-1 to 515-4, and analog telephone sets 516-1 to 516-3, and is connected from the line interface unit 533 via logic communication lines 539-1 through 539-3 for transmitting/receiving IP packets to a network node apparatus 540. In this case, a physical communication line 538 contains all of these logic communication lines 539-1 to 539-3. The media router 530 executes a telephone call control, and other major process operations of the media router 530. The media router 530 contains an analog interface unit 532 having a connection interface between a media router major unit 531 and an analog telephone set, a line interface unit 533, an address telephone number correspondence table 534, and a telephone set administration table 535. The media router major unit 531 contains thereinto IP addresses “EA01”, “EA12”, “EA13” and “ADR”. The IP address “EA01” is made in 1-to-1 correspondence with the telephone number “Tel-No-1”; the IP address “EA12” is made in 1-to-1 correspondence with the telephone number “Tel-No-12”; and also the IP address “EA13” is made in 1-to-1 correspondence with the telephone number “Tel-No-13”. This condition is indicated in an address telephone number correspondence table 534. Telephone numbers applied to both an IP telephone set and an analog telephone set are managed by employing an address administration table. As a result, when a telephone number is changed, the address administration table is rewritten. While ports 538-1 to 538-7 are provided inside the media router major unit 531, such port numbers as “1” to “7” are applied to these ports. Furthermore, these ports are directly connected via communication lines to IP telephone sets, or indirectly connected via an analog interface unit 532 to analog telephone sets 516-1 to 516-3. To these IP telephone sets 515-1 to 515-4, such identifier names as “Id-5” to “Id-8” and IP addresses “AD01” to “AD04” are applied. This condition is represented on such records within a telephone set administration table 535 in which port numbers are selected to be 1 to 4. Symbol “D” within the telephone set administration table shows an IP telephone set, and symbol “A” denotes an analog telephone set. The IP address “EA01” is applied to the port 532-1, the IP address “EA12” is applied to the port 532-2, and the IP address “EA13” is applied to the port 532-3. Both the ports 538-1 and 532-1 are connected to each other by the communication line, and both the ports 538-7 and 532-3 are connected to each other by the communication line. Since the IP telephone set 515-1 is connected via the communication line 517-1 to the port 538-1, when the IP telephone 515-1 is connected via the media router 530 to the network node apparatus, the IP address “EA01” may be employed. Similarly, the IP address “EA13” is fixedly allocated to the analog telephone set 516-3. When the analog telephone set 516-3 is connected via the media router 530 to the network node apparatus, the IP address “EA13” may be continuously employed. This condition is indicated in such a record equal to the port 1 of the address administration table 535, and also such a record equal to the port 7 thereof. Both the port 538-4 and the port 538-5 are connected to each other via the communication line. The IP telephone set 515-4 is connected via the communication line 517-4; the ports 538-4 and 538-5; the analog interface 532; and the communication line 518-1 to the analog telephone set 516-1, so that the IP telephone set 515-4 can establish the telephone communication with the analog telephone set 516-1. Similarly, the IP telephone set 515-2 is connected via the communication line 517-2; the ports 538-2 and 538-3; and the communication line 517-3 to the IP telephone set 515-3, so that the IP telephone set 515-2 can establish the telephone communication with the IP telephone set 515-3. The telephone communication between two analog telephone sets may be established by a function of an analog interface unit. The IP telephone sets 515-1 to 515-4 digitalize voice, and superimpose the digitalized voice on an IP packet to thereby send the IP packet, and also restore the digitalized voice to obtain analog voice as a reverse function. The analog interface unit digitalizes the voice received from the analog telephone sets 516-1 to 516-3 and then sends the digitalized voice to the media router major unit 531, and also restores the digitalized voice received from the media router major unit 531 to obtain analog voice as a reverse function thereof, and then supplies the analog voice to the analog telephone set. <<A Series of Procedures Executed in Media Router and Network Node Apparatus for Telephone Connection>> When the handset of the IP telephone set 515-1 is taken up, a calling IP packet 520 is transferred via the communication line 517-1 to the media router major unit 531. In this case, a transmission source IP address is “AD01”, and a destination IP address is “ADR”, which are written in a header contained in the IP packet 520. The media router major unit 531 returns an IP packet of “call acceptance” to the IP telephone set 515-1. Next, when the user of the IP telephone set 515-1 dials the telephone number “Tel-No-4” of the communication counter party, such a “call setting” IP packet is produced inside the IP telephone set 515-1, and then is transmitted to the media router 530. The IP packet contains the transmission source telephone number “Tel-No-1” and the telephone number “Tel-No-4” of the communication counter party in the payload of the IP packet. The media router 530 receives the above IP packet in the media router major unit 531, and produces such an IP packet containing at least both the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-4”, and then transmits the produced IP packet to the network node apparatus 540 so as to commence the call setting procedure. When the network node apparatus 540 receives an IP packet 521, an address administration table 541 shown in FIG. 114 is retrieved so as to seek such a record which contains the transmission source IP address of “EA01” as the external IP address and the destination IP address of “EA81”. In this case, when the network node apparatus 540 finds out a record indicated on a first row of the address administration table 541 from a top row, namely such a record described as “EA01, EA81, IA01, IA81”, the network node apparatus 540 produces an internal IP packet 542 by using the IP address of “IA01” and IA81” described in a third row and a fourth row with the record by applying the capsulation method of the IP packet, and then transmits the IP packet 542 to such a pilot telephone administration server 545 whose IP address is equal to “IA81”. In this case, the payload portion of the IP packet 542 is the IP packet 521. It should be understood that since the physical communication line 538 contains all of the logic communication lines 539-1 to 539-3 in the above-explained case, the logic terminals 543-1 to 543-3 are selected to be all of the same internal IP address values “IA01”. Furthermore, in this embodiment, the above-mentioned IP encapsulation and reverse-capsulation by the network node apparatus can be replaced to the simple encapsulation which forms an internal packet by adding a simple header to an external IP packet and the simple reverse-capsulation which removes the simple header from the internal packet, respectively. 8. 8th Embodiment for Executing Closed-Area Telephone Communication In FIG. 115, reference numeral 1001 shows an integrated IP communication network, reference numeral 1002 indicates an IP data network, reference numeral 1003 represents an IP telephone network, reference numeral 1004 denotes an IP voice/image (audio/visual) network, reference numeral 1005 indicates a range of an integrated IP communication network operated/managed by a communication company “1”, and reference numeral 1006 represents a range of an integrated IP communication network operated/managed by a communication company “2”. Also, reference numerals 1002 to 1004 also correspond to IP transfer networks having IP packet transfer functions. These IP transfer networks may exchange information by employing the IP communication means for transmitting/receiving IP packets inside the IP transfer networks. An IP address used outside the integrated IP communication network 1001 is called as an external IP address, whereas an IP address employed inside the integrated IP communication network 1001 is referred to as an internal IP address. Also, reference numerals 1011 to 1017 indicate telephone sets. Reference numerals 1021 to 1025 show media routers, and reference numerals 1080 and 1081 indicate telephone gateways. Reference numerals 1082 and 1083 show public switched telephone networks (PSTN), and reference numerals 1084 and 1085 represent telephone sets. Next, a description will now be made of a “method for controlling terminal-to-terminal communication connection” in which a telephone communication connection is carried out from the telephone set 1011 via the media router 1021, the communication line 1040, the network node apparatus 1031, the inside of the IP telephone network 1003, the network node apparatus 1032, the communication line 1041 and the media router 1022 to the telephone set 1012. The users of the telephone sets 1011 to 1013 previously determine telephone numbers, and values of external IP addresses which are applied to the media routers connected to these telephone sets. Referring now to FIG. 117 and FIG. 118, the telephone set 1011 uses the telephone number “Tel-No-1”, and the external IP address “EA1” is applied to the media router 1021. Also, telephone set 1012 uses the telephone number “Tel-No-2”, and the external IP address “EA2” is applied to the media router 1022, and further, the telephone set 1013 uses the telephone number “Tel-No-3”, and the external IP address “EA3” is applied to the media router 1023. Also, such a setting operation is made as follows. That is, when the telephone number “Tel-No-1” is indicated, any of the telephone number servers 1026 to 1028 answer the external IP address “EA1”. When the telephone number “Tel-No-2” is indicated, any of the telephone number servers 1026 to 1028 answer the external IP address “EA2”. Also, when the telephone number “Tel-No-3” is indicated, any of the telephone number servers 1026 to 1028 answer the external IP address “EA3”. This method may be realized by applying the known technique of the domain name server (DNS) in which, for example, a telephone number group such as extension telephone numbers “100” to “199” is made in correspondence with a domain name “1” by way of a predetermined rule, for instance, 100-digit numbers are set to “1”. <<Preparation of Telephone Communication>> A preparation of a telephone communication will now be explained with reference to FIG. 115 and FIG. 116, a user 1060 proposes a telephone acceptance person 1061 to use a telephone (Step A100 of FIG. 116). The telephone acceptance person 1061 acquires from the user 1060, a user name, a user address, a payment way of a communication fee, and the external IP addresses “EA1” and “EA2” which constitute the propose information of the telephone, an identification symbol “L-1040” of the communication line 1040 and also a network node apparatus identification number “NN-1031” of the network node apparatus 1031, an identification symbol “L-1041” of a communication line 1041, and an identification symbol “NN-1032” of a network node apparatus 1032, and then notifies these acquired items to a user service server 1041 (Step A101). The user service server 1041 determines a user identification symbol “UTD-1” used to identify the user 1060, and saves the user propose information such as the external IP addresses “EA1” and “EA2” and the user name acquired from the above acceptance into a database owned in the user server 1041 (Step A102). Next, when the user service server 1041 notifies to a telephone administration server 1042, the external IP addresses “EA1” and “EA2”; the identification symbols “L-1040” and “L-1041” of the communication line; and the identification symbols “NN-1031” and “NN-1032” of the network node apparatus, which are obtained by the above procedure (Step A103), the telephone administration server 1042 determines internal IP addresses “IA1” and “IA2”, and notifies the four addresses “EA1, EA2, IA1, IA2” to the table administration server 1043 (Step A107). In this case, the internal IP address of “IA1” is such an internal IP address applied to a joint point between the communication line 1040 and the network node apparatus 1031, and the internal IP address of “IA2” is such an internal IP address applied to a joint point between the communication line 1041 and the network node apparatus 1032, which are values internally determined by the integrated IP transfer network 1001 by employing the identification symbols “NN-1031” and “NN-1032” of the network node apparatus, and the identification symbols “L-1040” and “L-1041” of the communication line. Both the telephone administration servers 1042 and 1065 exchange information with the IP communication means so as to confirm that these values are identical to each other in advance. When the table administration server 1043 notifies the above-explained four addresses to the network node apparatus 1031 (Step A108), the network node apparatus 1031 holds the four addresses “EA1, EA2, IA1, IA2” as a first record of the address administration table 1034 provided in the network node apparatus as shown in FIG. 117 (Step A109). A record of a first row in the address administration table 1034 is defined as an IP communication record between the media router 1021 having the external IP address “EA1” and the media router 1022 having the external IP address “EA2”. The IP communication record may provide address information contained in an IP header, while the IP packet is capsulated to produce the internal IP packet. Similarly, as a record of a second row of the address administration table 1034, the four addresses “EA1, EA3, IA1, IA3” are set as the IP communication record. Another user 1062 proposes the telephone acceptance person 1063 to receive a telephone service in a similar manner. As indicated in FIG. 118, an IP communication record is set between the media router 1022 having the external IP address “EA2” and the media router 1021 having the external IP address “EA1” within the network node apparatus 1032 in a similar procedure (namely, Steps A110 to A119 of FIG. 116). In accordance with the same principle idea, an IP communication record is set, or another IP communication record is set between the media router 1022 having the external IP address “EA2” and the media router 1023 having the external IP address “EA3” in the first record to the fourth record of the address administration table 1035. Instead of the above-described procedure in which the user 1062 proposes to telephone acceptance person 1063 so as to set the IP communication record between the media router 1022 and the media router 1021, another user 1060 may propose another telephone acceptance person 1061 so as to set an IP communication record between the media router 1022 and the media router 1021. As a result, when the telephone administration server 1042 executes the above Step “A107”, this server simultaneously executes the step “A117-2” (refer to FIG. 116) in order to request the table administration server 1066 to set the IP communication record. <<Connection Phase>> The user takes up the handset of the telephone set 1011 to dial the telephone number “Tel-No-2” of the telephone set 1012 of the communication counter party, and sends a telephone call to the media router administration unit 1056 provided inside the media router 1021 (Step A200 of FIG. 119). The media router administration unit 1056 confirms the telephone call (Step S201). The media router administration unit 1056 indicates the telephone number “Tel-No-2” to the telephone number server 1026 (Step A202), acquires the corresponding IP address “EA2” of the media router 1022 (Step A203), and produces an external IP packet 1070 (refer to FIG. 120) used to set a telephone calling operation, and then sends the external IP packet 1070 to the network node apparatus 1031 (Step A204). The external IP packet 1070 contains the transmission source telephone number “Tel-No-1”, the destination telephone number “Tel-No-2”, the telephone call identifier “C-ID”, and the connection control relative information “Info-1”. In this case, such an example is made that an IP address area of an IP header of the external IP packet 1070 corresponds to both the transmission source IP address “EA1” and the destination IP address “EA2”; a payload portion of the external IP packet 1070 corresponds to a UDP segment; the transmission source port number is “5060”; and the destination port number is “5060”. A telephone call identifier “C-ID” is employed in order that a telephone call defined from the connection phase up to the voice communication phase, and the release phase after the telephone call has been issued in the telephones communication may be discriminated from other telephone calls. The connection control relative information “Info-1” contains at least the UDP port number, for example, “5004” in the voice communication phase, and also may include an identification symbol of a voice compression system, a voice code conversion code identification symbol, and the IP address “EA1” of the media router 1021 as other contents. In this case, both the media router administration units 1056 and 1057 set both the telephone call identifier “C-ID” and the connection control relative information “Info-1” based upon a previously determined rule, and may refer to them. Upon receipt of the IP packet 1070, the network node apparatus 1031 confirms that the internal IP address is equal to “IA1”, the internal IP address is applied to the termination unit (logic terminal) of the communication line 1040 into which the IP packet 1070 is inputted, and also the destination external IP address of the IP packet 1070 is equal to “EA2”, and thereafter retrieves the address administration table 1034 shown in FIG. 117. In the beginning, the network node apparatus 1031 retrieves such an IP communication record whose transmission source internal IP address is equal to “IA1”, and subsequently, retrieves as to whether or not the destination external IP address “EA2” is contained in the IP communication record within the detected IP communication record. Next, the network node apparatus 1031 checks as to whether or not the transmission source external IP address “EA1” within the IP packet 1070 is contained in the detected IP communication record. In such a case that the network node apparatus 1031 finds out such an IP communication record “EA1, EA2, IA1, IA2”, namely a first row of the address administration table 1034 from the top row, the network node apparatus 1031 applies the capsulation technical method of the IP packet by employing the address “IA1” and “IA2” described in the third row and the fourth row inside the IP communication record so as to produce an internal IP packet 1071 shown in FIG. 121. The capsulation technical method is to apply a new IP header to the external IP packet 1070. In the above-explained retrieving operation of the IP communication record within the address administration table in the beginning, the network node apparatus 1031 retrieves such an IP communication record whose transmission source internal IP address is equal to “IA1” (plural subjects and present), and subsequently, retrieves as to whether or not the destination external IP address “EA2” is contained in the IP communication record within the detected IP communication record. Alternatively, such a retrieve operation of the transmission source external IP address “EA1” may be omitted. When the IP packet is capsulated, both the transmission source IP address “IA1” of the internal IP address and the destination IP address “IA2” are set to the IP address area of the header portion of the internal IP packet. The formed internal IP packet 1071 is transmitted to the network node apparatus 1032 (Step A205), and is reached via the routers 1035-1 to 1035-6 to the network node apparatus 1032. The network node apparatus 1032 executes the inverse-capsulation of the IP packet except for the header of the IP packet 1071 so as to restore an IP packet 1072 (refer to FIG. 122). Then, this IP packet 1072 is sent to the media router 1022 (Step A206). While the above-described IP packet is inverse-capsulated, the network node apparatus 1032 may use such an IP communication record whose addresses are equal to “EA2, EA1, IA2, IA1” as follows: In other words, the network node apparatus 1032 confirms that the IP packet may be inverse-capsulated, since the IP communication record containing the four IP address is present in the address administration table 1035 inside the network node apparatus 1032, the addresses or “IA2” and IA1” are present in the IP address area of the header of the received internal IP packet 1071, and also the addresses “EA2” and “EA1” are present in the IP address area contained in the external IP packet 1072. When there is no such an IP communication record, the four addresses (“EA2, EA1, IA2, IA1”) are made coincident with each other, the received IP packet may be discarded. Alternatively, when there is no such IP communication record, the three addresses (“EA1, IA2, IA1”) are made coincident with each other within the address administration table 1035, since the destination IP address “EA2” contained in the IP packet 1071 is not checked, the network node apparatus 1032 does not execute the inverse-capsulation, but may discard the received IP packet. The media router administration unit 1057 acquires the transmission source telephone number “Tel-No-1”, the destination telephone number “Tel-No-2”, the telephone call identifier “C-ID”, and the connection control relative information “Info-1” from the external IP packet 1072. The media router administration unit 1057 acquires, for example, “5004” from the inside of the connection control relative information “Info-1” as a port number which is employed by a transmission source telephone set in the voice communication phase. Also, while using the telephone call identifier “C-ID”, the media router administration unit 1057 may discriminate the received telephone call from other telephone calls. A series of the above-explained Steps A204, A205, A206 are called as a “call setting operation”, and the series of Steps may be abbreviated as “IAM”. The media router administration unit 1057 returns such an IP packet containing the telephone call identifier “C-ID”, the transmission source telephone number “Tel-No-1”, and the destination telephone number “Tel-No-2” to the media router administration unit 1056 in order to notify a call setting acceptance with respect to the above-explained call setting operation (Steps A207, A208, A209). A series of these Steps A207, A208 and A209 will be referred to as a “call setting acceptance” which is expressed by “ACM” as an abbreviation symbol. The media router administration unit 1057 may return to use only the telephone call identifier “C-ID” in the above-explained call setting acceptance, and may not return both the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2”. Next, when the media router administration unit 1057 transfers a telephone call (call reception) to the telephone set 1012 (Step A210), the telephone set 1012 returns a response in order to confirm the telephone reception (Step A211), and produces the telephone call sound. In order to notify that the telephone set 1012 is being called, the media router administration unit 1057 produces such an IP packet containing the telephone call identifier “C-ID”, the transmission source telephone number “Tel-No-1”, and the destination telephone number “Tel-No-2”, and then transmits the IP packet to the media router administration unit 1056 (Steps A212, A213, A214). A series of these Steps A212, A213, A214 is called as either a call passing or a call issuing, and are expressed by “CPG” as an abbreviation symbol. In the call passing steps, both the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2” may not be returned. The media router administration unit 1056 notifies such a fact that the destination telephone set 1012 is being called to the transmission source telephone set 1011 (Step A215). On the other hand, when the user of the telephone set 1012 hears the calling sound of the telephone set, and notifies the call reception to the media router administration unit 1057 by taking up the handset thereof (Step A220), the media router administration unit 1057 produces such an IP packet containing the telephone call identifier “C-ID”, the transmission source telephone number “Tel-No-1”, the destination telephone number “Tel-No-2” and the connection control relative information “Info-2” and then notifies the IP packet to the media router administration unit 1056 provided within the media router 1021 (Steps A222, A223, A224). A series of these Steps A222, A223 and A224 is referred to as a “response”, and is expressed as “ANM” as an abbreviation symbol. At least, the UDP port number employed in the voice communication phase, for example, “5006” is contained in the connection control relative information “Info-2”. The format of the above IP packet owns the same format of the internal IP packet 1071 shown in FIG. 121. Alternatively, it is possible to omit such that both the transmission source telephone number “Tel-No-1” and the destination telephone number “Tel-No-2” are written into the IP packet. The media router administration unit 1056 confirms the response (Step A220) of the telephone set 1012 (Step A221). The media router administration unit 1056 may know the destination port number, for example, “5006” which is employed in the communication phase from the connection control relative information “Info-2”, and notifies the response (off hook) issued from the telephone set 1012 (Step A225) to the telephone set 1011. Then, the telephone set 1011 confirms the response (Step A226). It should also be noted that the above-explained Steps A221 and A226 may be omitted. With execution of the above-explained process operations, the connection phase of the telephone calling operation is accomplished. It should also be noted that the Steps A200 and A210 are called as “call setting operation”; the Steps A201 and A211 are called as “call setting acceptance”; the Step A215 is referred to as “calling”; the Steps S220 and S225 are called as “response”; and the Steps A221 and A226 are called as “response confirmation” among the above-explained steps. <<Communication Phase>> When the user of the telephone set 1011 starts a telephone conversation by voice (speech), a voice signal is sent to the media router administration unit 1056 (Step A250 of FIG. 123). Then, the media router administration unit 1056 digitalizes the voice signal, and furthermore, segments the digital data to form a proper length, and then forms an external IP packet 1073 of FIG. 124. Then, the digitalized voice data is stored into a payload portion of an internal UDP segment of this external IP packet 1073, and the resulting IP packet 1073 is transmitted to the network node apparatus 1031 (Step A251). In the connection phase, as an internal transmission source port number of the UDP segment, both the transmission source port number “5004” and the destination port number “5006” are utilized which are acquired by being mutually exchanged by the media router administration units 1056 and 1057. Upon receipt of the external IP packet 1073, the network node apparatus 1031 may find out the IP communication record equal to “EA1, EA2, IA1, IA2” inside the address administration table, while using the IP communication record, the external IP packet 1073 is capsulated to constitute an internal IP packet 1074. The internal IP packet 1074 is reached via the routers 1035-1 to 1035-6 to the network node apparatus 1032 (Step A252). Then, the external IP packet 1075 is restored, and the external IP packet 1075 is delivered via the media router administration unit 1057 (Step A253) to the telephone set 1012 (Step A254). An IP packet containing the voice of the user of the telephone set 1012 is transmitted along a direction opposite to the above-explained direction, namely is reached via the media router administration unit 1057 (Step A260), the network node apparatus 1032 (Step A261), and the routers 1035-6 to 1035-1 to the network node apparatus 1031 (Step A262), and also is delivered via the media router administration unit 1056 (Step A263) to the telephone set 1011 (Step A264). <<Release Phase>> In the case that the user of the telephone set 1011 puts on the handset thereof so as to end the telephone communication, and notifies the end of the telephone communication to the media router administration unit 1056 (Step A280 of FIG. 127), the media router administration unit 1056 produces such an IP packet containing at least information and the telephone call identifier “C-ID”. The information implies that the telephone communication is ended. The IP packet is transmitted to the network node apparatus 1031 (Step A281), and is capsulated in the network node apparatus 1031. The capsulated IP packet is reached via the IP transfer network 1003 to the network node apparatus 103 (Step A282). The IP packet is inverse-capsulated in the network node apparatus 1032, and then, the resulting IP packet is reached via the media router administration unit 1057 (Step A283) to the telephone set 1012 (Step A284). A series of these Steps A281, A282, A283, A284 is called as a “release”, and is expressed by “REL” as an abbreviation symbol. Next, such an IP packet for reporting a completion of the release is notified along a direction opposite to the above direction (Steps A286, A287, A288). A series of these Steps A286, A287, A288 is called as a “completion of release”, and is expressed by “RLC” as an abbreviation symbol. Both the format of the IP packet and the setting method of the IP address used in the steps A281, A282, A283 are identical to those of the Steps A204, A205, A206 in the connection phase of the telephone communication. <<Communication Among Other Telephone Sets>> In a similar manner, a telephone communication may be made from the telephone set 1011 to such a telephone set 1013 having a telephone number “Tel-No-3”. When an inquiry is sent to the telephone number server 1026, an external IP address “EA3” corresponding to the telephone number “Tel-No-3” is answered. Both the IP communication records “EA1, EA3, IA1, IA3” provided inside the address administration table 1034 and the IP communication records “EA3, EA1, IA3, IA1” provided inside the address administration table 1035 are used so as to capsulate and also inverse-capsulate the IP packet. Also, a telephone communication may be made from a telephone set 1012 to another telephone set 1013 by way of a method for controlling a terminal-to-terminal communication connection similar to the above embodiment. When the telephone communication is ended, both the port number “5004” and the port number “5006” may be employed as empty numbers in the next telephone communication. <<Case of Single Communication Company>> Even in such a case that there is no such an operation/management range 1006 of the communication company 2 of FIG. 115, but the IP telephone network 1003 constitutes the operation/management range of the communication company 1, the above-described telephone call connection phase, communication phase thereof, and also release phase thereof may be realized. In this case, the operation/management range 1006 of the communication company 2 is changed into the operation/management range of the communication company 1; the representative server 1 of the communication company “1” and the representative servers 1036-1 to 1036-2 of the communication company 2 are discontinued; and also, the router 1035-7 is connected to the router 1035-1 by employing the IP communication line. Other Embodiments of Media Router Referring now to FIG. 128, other embodiment as to the media router will be explained. A media router 1021-1 contains the function of the media router 1021 shown in FIG. 115, a media router administration unit 1056-1 contains the function of the media router administration unit 1056, and a telephone number server 1026-1 owns the function of the telephone number server 1026. Reference numeral 1040-1 shows a communication line to the network node apparatus. Reference numeral 1080-1 represents a connection control unit, reference numeral 1081-1 shows a telephone control unit, reference numeral 1082 shows a media router operation/management unit, and also, reference numeral 1083 indicates a correspondence table for telephone number/pin number/UDP port number. The media router operation/management unit 1028 contains a function capable of recording a telephone communication, and also a reliability administration function by detecting a failure occurred inside a media router. A telephone control unit 1081-1 is connected via a communication line to telephone sets 1011-1 through 1011-4. The telephone control unit 1081-1 has such a function that a protocol conversion is performed, a voice code conversion is effected, a fluctuation control is carried out, analog voice is converted into digital voice, or inverse-converted in a telephone communication. Reference numeral 1084 shows a line interface unit which contains a function capable of transmitting/receiving the IP packet, and owns a communication line 1040-1. The media router operation/managements unit 1056-1 may perform both a telephone connection control and a release control, which are similar to those of the media router operation/management unit 1056. In other words, the media router operation/management unit 1056-1 can execute the telephone connection control as explained with reference to FIG. 119, and also the telephone release control as explained with reference to FIG. 127. The telephone number/pin number/UDP port number correspondence table 1083 indicates that the telephone number “Tel-No-1” corresponds to a pin number “T1” in the telephone control unit 1081-1 in a 1-to-1 correspondence relationship; and furthermore, a UDP port number “5004” corresponds to the pin number “T1” in a 1-to-1 correspondence relationship. Similarly, the correspondence table 1083 shows that the telephone number “Tel-No-12” corresponds to a pin number “T2” in the telephone control unit 1081-1 in a 1-to-1 correspondence relationship, and furthermore, a UDP port number “5006” corresponds to the pin number “T2” in a 1-to-1 correspondence relationship. Similarly, the correspondence table 1083 shows that the telephone number “Tel-No-13” corresponds to a pin number “T3” in the telephone control unit 1081-1 in a 1-to-1 correspondence relationship, and furthermore, a UDP port number “5008” corresponds to the pin number “T3” in a 1-to-1 correspondence relationship. Similarly, the correspondence table 1083 shows that the telephone number “Tel-No-14” corresponds to a pin number “T4” in the telephone control unit 1081-1 in a 1-to-1 correspondence relationship, and furthermore, a UDP port number “5010” corresponds to the pin number “T4” in a 1-to-1 correspondence relationship. Since the above-described correspondence relationship is established, for instance, in the case that the telephone number “Tel-No-1” is employed, the UDP port number is selected to be “5004” with reference to the telephone number/pin number/UDP port number correspondence table 1083. The UDP port number is used as a port number for identifying the known RTP used in the voice communication (namely, voice communication RTP port number). Reference numeral 1083-1 of FIG. 129 shows another embodiment of a telephone number/pin number/UDP port number correspondence table, and is replaceable with the telephone number/pin number/UDP port number correspondence table 1083. In this case, the telephone number “Tel-No-1” indicates a pilot telephone number, the telephone sets 1011-1 to 1011-4 own the same telephone number “Tel-No-1”, and the UDP port numbers are “5004” to “5010” different from each other. As a result, the telephone sets 1011-1 to 1011-4 may perform the telephone voice communications at the same time instant without interference, or jamming by using the different port numbers. Reference numeral 1083-2 of FIG. 130 shows another embodiment of a telephone number/pin number/UDP port number correspondence table, and is replaceable with the telephone number/pin number/UDP port number correspondence table 1083. In this case, the telephone set 1011-2 having the telephone number “Tel-No-12” makes a telephone at a preceding time instant, and the UDP port number “5004” is applied. At the connection phase stage where the telephone communication is commenced, other unallocated UDP port numbers “5006” and “5008” are applied to other telephone sets 1011-1, 1011-3 and 1011-4. In the release phase of the telephone call, the application of the applied UDP port number is stopped (returned). The connection control unit 1080-1 may realize the above-explained pilot telephone number by properly changing the correspondence combination between the pin number and the UDP port number. Another Embodiment of Media Router Referring now to FIG. 131, another embodiment as to the media router will be explained. A media router 1021-2 contains the function of the media router 1021 shown in FIG. 115, a connection control unit 1080-2 contains the function of the connection control unit 1080-1 shown in FIG. 128, and a telephone control unit 1081-2 contains the function of the telephone control unit 1081-1. Reference numeral 1040-2 shows a communication line to the network node apparatus. A media router administration unit 1056-2 contains the function of the media router administration unit 1056, and a telephone number server 1026-2 owns the function of the telephone number server 1026. Reference numeral 1085-1 shows a PBX control unit. Reference numeral 1085-2 represents a PBX control unit, reference numerals 1086 and 1087 show routers, reference numeral 1088 shows a media router operation/management unit, reference numeral 1089 indicates a communication line using the Ethernet, and reference numerals 1090 and 1091 show IP terminals having functions capable of transmitting/receiving IP packets. Also, reference numeral 1092 is a moving image transmitter/receiver having a function capable of transmitting/receiving an audio/visual (voice/image) signal. Both the IP terminals 1090 and 1091, and the moving image transmitter/receiver 1092 are connected to the router 1087 via the IP communication line. Also, the router 1087 is connected via an IP communication line to a LAN 1093. The connection control unit 1080-2, the telephone number server 1026-2, and the routers 1086/1087 are connected to each other via the communication line 1089. The PBX 1085-2 implies a private branch exchange for storing a plurality of telephones. The PBX control unit 1085-1 is located between the connection control unit 1080-2 and the PBX 1085-2, and performs interface operations between both units, for example, performs a voice code (speech code) converting operation and a speech compressing operation. Since the above-explained arrangement is made, the media router 1021-2 directly stores a large number of telephone sets via the telephone control unit 1081-2, or via the PBX 1085-2. These telephone sets may establish the telephone communication via the IP transfer network to other telephone sets. Since the media router 1021-2 is arranged in the above-explained manner, an IP packet entered from the communication line 1040-2 may be reached via the router 1086 and the communication line 1089 to the connection control unit 1080-2. Also, the IP packet may be transferred along a direction opposite to the above-described direction, namely transferred from the connection control unit 1080-2 toward the communication line 1089, the router 1086, and the communication line 1040-2. Similarly, an IP packet entered from the communication line 1040-2 may be reached via the router 1086, the communication line 1089, the router 1087, and the communication line to the IP terminal 1090, the IP terminal 1091, and the moving image transmitter/receiver 1092 employed in the LAN 1093. Also, the IP packet may be transferred along a direction opposite to the above-described direction, namely from the IP terminal 1090, the IP terminal 1091, and the moving image transmitter/receiver 1092 to the communication line, the router 1087, the communication line 1089, the router 1086, and the communication line 1040-2. <<Calling Priority Order Control>> Next, a description will now be made of a function of a calling priority order control executed by the media router 1021-2. FIG. 132 is a schematic diagram for representing a partial inner arrangement of the media router 1021-2, and a connection condition between an IP terminal and a LAN, connected to the media router 1021-2. If should be noted that communication lines provided in a half way are omitted. Reference numeral 1085-21 shows an IP packet sent from the telephone number server 1026-2, reference numeral 1085-22 represents an IP packet sent from the connection control unit 1080-2, reference numeral 1085-23 shows an IP packet sent from the LAN 1093, reference numeral 1085-24 indicates an IP packet sent from the IP terminal 1091, and also reference numeral 1085-25 denotes an IP packet sent from the moving image transmitter/receiver 1092. The IP packets 1085-21 to 1085-25 are transmitted via the Ethernet communication line 1089 and the router 1086 to the communication line 1040-2. In such a case that payloads of the IP packets 1085-21 to 1085-25 are equal to TCP, or UDP segments, both transmission source port numbers and destination port numbers are contained inside these segments. Reference numeral 1085-3 of FIG. 133 shows a calling priority order control administration table used to determine a sequential order by which the above-explained IP packet is transmitted from the Ethernet communication line 1089 to the communication line 1040-2. In such a case that an IP packet is entered from the Ethernet communication line 1089, passes through the router 1086, and then is outputted to the communication line 1040-2, a check is made as to whether a payload contained inside the passing IP packet is equal to a TCP segment, or a UDP segment. When the payload corresponds to either the TCP segment or the UDP segment, a transmission source port number contained in the IP packet is checked. In such a case that the IP packets are reached to the router 1086 at time instants which are temporally closed to each other, such an IP packet containing either a TCP segment or a UDP segment, the transmission source port number of which is equal to “108”, is transmitted with a top priority in view of temporal aspects. Next, IP packets are transmitted which contain TCP segments or UDP segments, the transmission source port numbers of which are equal to “5060”, or “5004” to “5020”. Alternatively, the values of the port numbers described in the calling priority order control administration table 1085-3 may be replaced by other values to be used. Also, the calling priority order administration table 1085-3 may be substituted by the calling priority order control management table 1085-4 of FIG. 134 to be used. In such a case that the calling priority order control management table 1085-4 is used, such an IP packet whose transmission source IP address is “150.1.2.3” and also whose transmission source port number is “108” is employed as a top priority order, and then, such an IP packet whose transmission source IP address is “192.1.2.3” and whose transmission source port number is “5060”, “5004” to “5020” is employed as a second top priority order. The above-explained embodiment is featured by that while the port number designated by the calling priority order control administration table 1085-3 is used as a reference, or a set of both the IP address and the port number designated by the calling priority order control administration table 1085-4 is employed as a reference, the media router 1021-2 owns the function capable of determining the transmission sequence of the IP packets sent to the communication line 1040-2. Next, a description is made of the embodiment with reference to FIG. 135. The media router 1021-3 is connected via the IP transfer network 1001-1 to the media router 1021-4; the IP terminal 1091-1, the moving image transmitter/receiver 1092-1, and the LAN 1093-1 are connected to the media router 1021-3; and the IP terminal 1090-1 is contained in the LAN 1093-1. Similarly, the IP terminal 1091-2, the moving image transmitter/receiver 1092-2 and the LAN 1093-2 are connected to the media router 1021-4; and the IP terminal 1090-2 is contained in the LAN 1093-2. Both the media routers 1021-3 and 1021-4 contain the function of the media router 1021-2 shown in FIG. 131. Since the above-explained circuit arrangement is made, the IP packet can be transmitted/received via the media router 1021-3, the IP transfer network 1001-1, and the media router 1021-4, for example, between the IP terminal 1090-1 and the IP terminal 1090-2; between the IP terminal 1091-1 and the IP terminal 1090-2; and between the moving image transmitter/receiver 1092-1 and the moving image transmitter/receiver 1092-2. The operations of this embodiment will now be summarized. That is, the IP transfer network contains two, or more network node apparatus; the media router is connected via the IP communication line to any one of these network node apparatus; the internal IP address is applied to the termination units on the side of the network node apparatus of the IP communication line; the external IP addresses are applied to the respective media routers; and while telephone number server is contained in the media router, the media router is connected via the communication line to one, or more telephone sets. Also, as the record of the address administration table contained in the network node apparatus, both the external IP address and the internal IP address are contained; at least the IP communication record for determining the IP capsulating method is previously set; at least the transmission source telephone number, and the destination telephone number are employed inside the call setting IP packet, and furthermore, the common port number is used for a plurality of telephone sets in the connection control. Also, since the individual voice communication with respect to each of the telephone sets is performed by allocating the different port numbers to the plural telephone sets, the media router contains either one or two sets of the PBX control unit; and the telephone control unit; and the media router is connectable to the IP terminal having the function of transmitting/receiving the IP packet, or the LAN, or to the voice/image transmitter/receiver having the function capable of transmitting/receiving the voice/image by being stored into the IP packet through the IP communication line. The media router contains the calling priority order control administration table. While the media router employs the transmission source port number of either the TCP segment or the UDP segment contained in the IP packet which is transferred from the telephone set, the IP terminal and the moving image transmitter/receiver, which are connected to the media router, and further employs the transmission source IP address, this media router may send out the IP packets to the communication line provided on the side of the network node apparatus in the order of the top priority order in accordance with the instruction of the calling priority order control administration table. Furthermore, in this embodiment, the above-mentioned IP encapsulation and reverse-capsulation by the network node apparatus can be replaced to the simple encapsulation which forms an internal packet by adding a simple header to an external IP packet and the simple reverse-capsulation which removes the simple header from the internal packet, respectively. 9. 9th Embodiment in which Closed-Area Telephone Communication is Carried Out In FIG. 136, reference numeral 1100 shows an IP transfer network. An IP address used outside the IP transfer network 1100 is called as an external IP address, and an IP address used inside the IP transfer network 1100 is called as an internal IP address. The external IP addresses “EA1” to “EA3” are applied to media routers 1115 to 1117, respectively. The telephone numbers “101”, “102”, “103” and “104” are applied to telephone sets 1121 to 1124, respectively. Similarly, the telephone numbers “211”, “212”, “213” and “214” are applied to telephone sets 1125 to 1128, respectively. Similarly, the telephone numbers “301”, “302”, “303” and “304” are applied to telephone sets 1129 to 1132, respectively. Telephone number servers 1135 to 1137 own such a function similar to that of a domain name server (DNS) which is widely used in the Internet. In this embodiment, when a telephone number is indicated, the telephone number server answers an external IP address of a media router which stores thereinto a telephone set having the indicated telephone number. For instance, when the telephone number “212” is inquired to the telephone number server 1135, this telephone number server 1135 answers the external IP address “EA2” of the media router 1116 which stores the telephone set 1126 having the telephone number “212”. <<Preparation of Telephone Communication>> In the network node apparatus 1101 to 1103, IP communication records are set as records of address administration tables 1110 to 1112 provided thereinto. For example, as an IP communication record indicated on a second row of the address administration table 1110, “EA1, EA3, IA1, IA3” are set. The IP communication record is employed in the telephone communication established between the media router 1115 having the external IP address “EA1” and the media router 1117 having the external IP address “EA3”. Also, the internal IP address “IA1” is applied to the termination unit (logic terminal) provided on the side of the network node apparatus 1101 of a logic IP communication line 1144, and the internal IP address “IA3” is applied to the termination unit (logic terminal) provided on the side of the network node apparatus 1103 of a logic IP communication line 1146. Next, a description will now be made of a “terminal-to-terminal communication connection control method” used to execute a telephone communication from the telephone set 1121 via the media router 1115, the IP transfer network 1100, and the media router 1117 to the telephone set 1131. <<Connection Phase>> The user takes up the handset of the telephone set 1121 to dial the telephone number “303” of the telephone set 1131 of the communication counter party, and sends a telephone call to the media router administration unit 1138 provided inside the media router 1115 via the telephone control unit 1133 (Step A300 of FIG. 137). The media router administration unit 1138 confirms the telephone call (Step A301). The media router administration unit 1138 indicates the telephone number “303” to the telephone number server 1135 (Step A302), acquires the corresponding IP address “EA3” of the media router 1117 (Step A303), and produces an external IP packet 1134 (refer to FIG. 136), and then sends the external IP packet 1134 to the network node apparatus 1101 (Step A304). The external IP packet 1134 contains the transmission source telephone number “101”, the destination telephone number “303”, the telephone call identifier “C-ID”, and the UDP port number “5004” as the connection control relative information. In this case, such an example is made that an IP address area of an IP header of the external IP packet 1134 corresponds to both the transmission source IP address “EA1” and the destination IP address “EA3”; a payload portion of the external IP packet 1134 corresponds to a UDP segment; the transmission source port number is “5060;” and the destination port number is “5060”. Upon receipt of the IP packet 1134, the network node apparatus 1101 produces an internal IP packet 1140 by applying the capsulation method of the IP packet, while using the IP communication record indicated on the second row of the address administration table 1110 from the top row, namely “EA1, EA3, IA1, IA3”, and then transmits the IP packet 1140 to the network node apparatus 1103 (Step A305). The internal IP packet 1140 is reached via the routers 1105, 1106, 1107 to the network node apparatus 1103. Then, the network node apparatus 1103 restores an IP packet 1134 by executing the inverse-capsulation method of such an IP packet except for a header thereof, and then sends the restored IP packet 1134 to the media router administration unit 1117 (Step A306). A series of these Steps A304, A305, A306 is called as a “call setting operation”, and is expressed by “IAM” as an abbreviation symbol. After the media router administration unit 1139 has acquired the transmission source telephone number “101”, the destination telephone number “303”, the IP address “EA1” of the media router 1115, the telephone call identifier “C-ID” from the above received IP packet, and the UDP port number “5004” which is used as the connection control relative information by the transmission source telephone set in the voice communication phase, the media router administration unit 1139 returns a confirmation of a telephone call (Steps A307, A308, A309). A series of these Steps A307, A308, A309 is called as a “call setting acceptance”, and is expressed by “ACM” as an abbreviation symbol. Next, the media router administration unit 1139 sends such an IP packet for informing the telephone call (call reception) to the telephone set 1131 (Step A310), and then, the telephone set 1131 returns a response (Step A311). When the telephone set 1131 knows the telephone calling, the telephone calling sound (ringing) is produced. When the media router administration unit 1139 returns the telephone calling operation of the telephone set 1131 to the media router administration unit 1138 (Steps A312, A313, A314), this media router administration unit 1138 notifies to the transmission source telephone set 1121, such a fact that the destination telephone set 1131 is being called (Step A315). A series of these Steps A312, A313, A314 is called as either “call pass” or “calling”, and is expressed by “CPG” as an abbreviation symbol. When the user of the telephone set 1131 takes up the handset thereof (off hook), this off hook signal is notified to the media router administration unit 1139 (Step A320), and the media router administration unit 1139 returns a response (Step A321: response confirmation). Furthermore, the media router administration unit 1139 produces such an IP packet and then returns the IP packet to the media router administration unit 1138 (Steps A322, A323, A324). The IP packet contains the transmission source telephone number “101”, the destination telephone number “303”, the telephone call identifier “C-ID”, and also the UDP port number “5008” which is used by the telephone set 1131 as the connection control relative information in the voice communication phase. The media router administration unit 1138 knows the UDP port number “5008” used by the destination telephone set from the received information. The media router administration unit 1138 reports the off hook notification sent from the telephone set 1131 to the telephone set 1121 (Step A325), and then the telephone set 1121 returns a response (Step A326: response confirmation). A series of these Steps A322, A323, A324 is called as a “response”, is expressed by “ANM” as an abbreviation symbol. The Steps A321 and A326 of the response confirmation correspond to optional process steps. Thus, the connection phase of the telephone is accomplished by executing the above-explained process operation. <<Communication Phase>> When the user of the telephone set 1121 starts a telephone conversation by voice (speech), a voice signal is sent to the media router management unit 1138 (Step A350 of FIG. 137). Then, this media router administration unit 1138 stores the voice signal digitalized by the telephone control unit 1133 into a payload portion of an internal UDP segment of the IP packet, and thereafter the resulting IP packet is transmitted to the network node apparatus 1101 (Step A351). In the connection phase, as an internal transmission source port number of the UDP segment, both the transmission source port number “5004” and the destination port number “5006” are utilized. Upon receipt of the IP packet containing the digitalized voice, the network node apparatus 1101 may capsulate the IP packet to constitute an internal IP packet 1141. The internal IP packet 1141 is reached via the routers 1105, 1106, 1107 to the network node apparatus 1103 (Step A352). The network node apparatus 1103 executes an IP inverse-capsulation of the internal IP packet 1141 except for the internal IP header, and then, transmits the resulting external IP packet to the media router administration unit 1139 (Step A353) so as to deliver the external IP packet to the telephone set 1131 (Step A354). An IP packet containing the digitalized voice of the user of the telephone set 1131 is transmitted along a direction opposite to the above-explained direction to the telephone set 1121 (Steps A360 to A364). <<Release Phase>> In the case that the user of the telephone set 1121 notifies the end of the telephone communication to the media router administration unit (Step A380 of FIG. 137), the resulting IP packet is reached to the telephone set 1131 via a series of process steps (Steps A381 to A383) in a similar manner to those as explained in other embodiments (Step A384). The end report of the telephone communication is returned via Steps A386 through A388 to the media router unit 1138. A series of these Steps A380, A381, A382, A383, A384 is called as a “release”, and is expressed by “REL” as an abbreviation symbol. Furthermore, a series of these Steps A386, A387, A388 is called as a “completion of release”, and is expressed by “RLC” as a abbreviation symbol. The telephone communications may be established among other telephone sets. For example, a telephone communication may be established from the telephone set 1121 to another telephone set 1126 having a telephone number “212”, and a telephone communication may be established from the telephone set 1132 to another telephone set 1127 having a telephone number “213” by way of a terminal-to-terminal communication connection control method similar to the previous control method. <<Detailed Description of Telephone Number Server>> The function of the telephone number server will now be explained more in detail. The telephone sets having the telephone numbers of 100 digits are connected to the media router 1115, the telephone sets having the telephone numbers of 200 digits are connected to the media router 1116, and the telephone sets having the telephone numbers of 300 digits are connected to the media router 1117. Considering the connection relationship, a tree structure of the telephone numbers may be determined as represented in FIG. 138. Domains 1151 to 1153 may be defined in the form of the tree structure at the same level under low grade of the route 1150. Thus, the domain 1151 may provide information related to the telephone numbers of 100 digits, the domain 1152 may provide information related to the telephone numbers of 200 digits, and the domain 1153 may provide information related to the telephone numbers of 300 digits. The following rules are made: The telephone numbers of 100 digits are expressed as a domain name of “1.”, the telephone numbers of 200 digits are expressed as a domain name of “2.”, and the telephone numbers of 300 digits are expressed as a domain name of “3.”, and also these domain names/telephone numbers are rearranged as shown in FIG. 139. In FIG. 139, symbol “1XX” shows the telephone numbers of 100 digits, symbol “2XX” indicates the telephone numbers of 200 digits, and symbol “3XX” represents the telephone numbers of 300 digits. It should be understood that while the known technical idea as to the domain name server DNS is applied, such a function capable of handling a function of a telephone number server for managing the route 1150 may be applied to the telephone number server 1135. As the function of the telephone number server for managing the route 1150, when “1.” is inquired, the telephone number server answers the IP address “EA1” of the telephone number server 1135 for directly managing the domain 1151. When “2.” and “3.” are inquired, the server answers the addresses “EA2” and “EA3”, respectively. In the case that the telephone number server is inquired as to the domain names which are directly managed by the server, this server may answer an IP address of another telephone number server in a half way. However, the telephone number server finally answers the IP address corresponding to the inquired domain name (refer to FIG. 140). As a consequence, when “3.” is inquired to the telephone number server 1136, the IP address “EA3” corresponding to “3.” may be acquired. Such a concrete realizing method of “redialing function of telephone number server” in which inquires are repeatedly made between telephone number servers can be realized by employing the redialing function of the domain name server known in the technical field. Another Embodiment of Telephone Number Server As indicated in FIG. 141, while the media routers 1191 to 1197 are connected via the communication line to any one of the network node apparatus 1180 to 1184 of the IP transfer network 1190, a telephone number of a telephone set which is connected to the media router 1191 belonging to a company “A” is equal to the opened telephone number “1-1XX” which is notified to other companies “B” and “C”. In this case, symbol “-” is neglected and is equal to an empty space as a telephone number, and symbol “XX” implies numbers of “00” to “99” in the decimal notation. Also, a telephone number of a telephone set which is connected to the media router 1193 belonging to the company “A” is equal to the opened telephone number “1-2XX”. A telephone number of a telephone set which is connected to the media router 1195 belonging to the company “A” corresponds to the telephone number “1-3XX” opened to other companies, and also an extension telephone number “8XX” which is not opened to other companies than the company “A”. A telephone number of a telephone set which is connected to the media router 1192 belonging to the company “B” corresponds to the opened telephone number “2-1XX”, and a telephone number of a telephone set which is connected to the media router 1194 belonging to the company “B” corresponds to the opened telephone number “2-2XX”. A telephone number of a telephone set which is connected to the media router 1196 belonging to the company “C” corresponds to the opened telephone number “3-XXX”. Symbol “XXX” implies numbers “000” to “999” of the decimal notation. A telephone number of a telephone set which is connected to the media router 1197 belonging to the company “A” corresponds to an extension telephone number “7XX” which is not opened to other companies than the company “A”. FIG. 142 represents the system of the above-explained telephone numbers as a tree structure of telephone numbers. Reference numeral 1185 shows a route domain, reference numeral 1186 indicates a domain directed to the non-opened extension telephone number of the company “A”, and reference numeral 1187 shows a domain directed to the opened telephone number of the company “A”, and reference numeral 1188 indicates a domain made of the opened telephone number of the company “B”, and also reference numeral 1189 is a domain directed to the opened telephone number of the company “C”. In this case, a domain name “##” of the reference numeral 1186 corresponds to a secret domain name which is used only in the media routers 1195 and 1197 belonging to the company “A”. The secret domain name contains no numeral, and the length of the secret domain name is determined as such a long name of 20 characters. As explained above, any one can hardly know and/or acquire the value of the secret domain name “##”, or the secret domain name “##” itself which is exclusively used by the company “A” from the media routers 1192, 1194, 1196 of the company “B” and the company “C”. For example, no IP address is answered with respect to the inquiry “##”. As a result, safety characteristics may be improved in view of the following implication. That is, a telephone user of either the company “B” or the company “C” can hardly access the telephone set having the extension telephone number of the company “A”, namely can hardly use the extension telephone number. When the user of the telephone set 1198 dials the destination telephone number “2-145”, the media router administration unit 1195-1 provided in the media router 1195 converts the telephone number “2-145” into “1.2.” corresponding to the domain name of the telephone number, as indicated in a conversion table 1185-1 of FIG. 143. Next, when the user of the telephone set inquiries by indicating the domain name format “1.2.” to the telephone number server 1195-2 of the media router 1195, the telephone number server 1195-2 answers an IP address “MR2” of the media router 1192 corresponding to “1.2.”, as indicated in a table 1185-2 of FIG. 144. A condition as to whether or not a telephone call can be made from a telephone set having an extension telephone number “700” of the company “A” to a telephone set having a telephone number of “2-100” of the company “B” may be determined based upon setting conditions of the domain name server. Both conditions may be realized. The above-explained operations of the ninth embodiment will now be summarized. That is, the IP transfer network contains two, or more network node apparatus; the media router is connected via the logic IP communication line to any one of these network node apparatus; the internal IP address is applied to the termination units on the side of the network node apparatus of the logic IP communication line; the external IP addresses are applied to the respective media routers; and while telephone number server is contained in the media router, the media router is connected via the communication line to one, or more telephone sets. Also, as the record of the address administration table contained in the network node apparatus, both the external IP address and the internal IP address are contained and at least the IP communication record for determining the IP capsulating method is previously set. While preselected IP communication records are set within the network node apparatus among the company “A”, the company “B” and the company “C”, such a closed-area telephone communication network can be set. In this communication network, the telephone numbers (“1-XXX”, “2-XXX”, “3-XXX”) which are effective only among the companies “A”, “B”, “C” are used. The telephone communications can be established as follows: A telephone call may be issued from a telephone set having a telephone number “1-100” of the company “A” to a telephone set having a telephone number “1-200” of the company “A”. Also, a telephone call may be issued from the telephone set having telephone number “1-100” of the company “A” to a telephone set having a telephone number “2-100” of the company “B”. Also, a telephone call can be issued from the telephone set having the telephone number “1-100” of the company “A” to a telephone set having a telephone number “3-100” of the company “C”, and also to telephone sets having extension telephone numbers “700” and “800” of this company “A”. Also, a telephone call can be issued from a telephone set having an extension telephone number “700” of the company “A” to a telephone set having an extension telephone number “800” of the company “A”, and also to a telephone set having telephone number “1-200” of the company “A”. As previously explained by using symbol “##”, no telephone call can be made from a telephone set having a telephone number “2-100” of the company “B” to the telephone set having the extension telephone number “800” of the company “A”. Assuming now that a total number of the companies is selected to be “N”, the following telephone communications can be established. While an IP communication code is set in order that the telephone communications can be made only among preselected companies “A-1”, “A-2”, . . . , “A-N” (symbol N>2), the closed area telephone communication can be carried out. A telephone set of the company “A-1” which is connected to the closed area telephone communication network which is effective among the companies “A-1”, “A-2”, . . . , “A-N” (symbol N>2) may establish a telephone communication with an extension telephone set of the company “A-1”, but telephone sets of companies other than the company “A-1” cannot establish a telephone communication with the extension telephone set of the company “A-1”. Furthermore, in this embodiment, the above-mentioned IP encapsulation and reverse-capsulation by the network node apparatus can be replaced to the simple encapsulation which forms an internal packet by adding a simple header to an external IP packet and the simple reverse-capsulation which removes the simple header from the internal packet, respectively. 10. 10th Embodiment Combined with Closed-Area Telephone Communication and Open-Area Telephone Communication In FIG. 145, reference numeral 1200 shows an IP transfer network, and external IP addresses “EA1” to “EA6” are applied to media routers 1201 to 1206, respectively. A telephone number “1001” is applied to a telephone set 1208, and a telephone number “1002” is applied to a telephone set 1209. A telephone number “101” is applied to a telephone set 1210, and a telephone number “102” is applied to a telephone set 1211. Also, telephone numbers “3001” to “3004” are applied to telephone sets 1212 to 1215, respectively. Telephone sets 1216 to 1219 connected to the media router 1202 own telephone numbers “234-2001” to “234-2004”, respectively. Also, telephone numbers “2001” to “2004” are applied to telephone sets 1220 to 1223, respectively, and telephone numbers “301” to “304” are applied to telephone sets 1224 to 1227, respectively. Further, telephone numbers “201” to “204” are applied to telephone sets 1228 to 1231, respectively. In this case, telephone numbers “1XX”, “2XX” and “3XX” are equal to extension telephone numbers which are exclusively used to the company “A”, and symbol “X” shows numeral values defined from “0” to “9” in the decimal notation. A telephone number “1XXX” is a telephone number of the company “A”, and a telephone number “2XXX” is a telephone number of the company “B”, and a telephone number “3XXX” shows a telephone number of the company “C”. These three telephone numbers “1XXX”, “2XXX” and “3XXX” correspond to telephone numbers which constitute a logical closed-area telephone network used to establish a telephone communication only among the company A, the company B and the company C, and are referred to as closed-area telephone numbers. It should be noted that telephone numbers “234-2001” to “234-2004” are equal to such telephone numbers which are employed so as to establish a telephone communication with respect to an undefinite communication counter party, and will be referred to as open-area telephone numbers. The telephone number servers 1134, 1272, and 1137 to 1142 own such a function similar to that of a domain name server (DNS) used in the Internet. When a telephone number is indicated, a telephone number server answers an external IP address of a media router which stores a telephone set having a telephone number thereof. For example, when a telephone number “3001” is inquired to the telephone number server 1137, the external IP address “EA6” of the media router 1206 which stores the telephone set 1212 having the telephone number “3001” is answered. <<Preparation of Terminal-to-Terminal Connection Control for Telephone Communication>> As indicated in FIG. 145, network node apparatus 1244 to 1248 contain address administration tables 1250 to 1255, respectively, in which IP communication records, as explained in other embodiments, are set. For instance, as an IP communication record indicated in a first row of the address administration table 1250, “EA1, EA3, IA1, IA3” are set. The IP communication record is used in a telephone communication established between the media router 1201 having the external IP address “EA1” and the media router 1203 having the external IP address “EA3”. The internal IP address “IA1” is applied to a termination unit (logic terminal) provided on the side of the network node apparatus 1244 of a logic IP communication line 1257, whereas the internal IP address “IA3” is applied to a termination unit provided on the side of the network node apparatus 1248 of a logic IP communication line 1258. Referring now to FIG. 145 to FIG. 146, a “terminal-to-terminal communication connection control method” will be described which is employed so as to establish a telephone communication from the telephone set 1208 having the telephone number “1001” via the IP transfer network 1200 to the telephone set 1224 having the telephone number “301”. <<Connection Phase>> When the handset of the telephone set 1208 is taken up to dial the telephone number “301” of the telephone set 1224 having the communication counter party, a telephone call signal is transferred to the media router administration unit 1260 (Step H300), and then the media router administration unit 1260 confirms a telephone call (Step H301). The media router administration unit 1260 checks a table 1255-1 of FIG. 192 which is held in the media router administration unit 1260 so as to know such a fact that a domain name of a telephone number corresponding to the telephone number “301” is equal to “3.#.a”, and then, inquires the telephone number domain name “3.#.a” to the telephone number server 1137 (Step H302). The telephone number server 1137 answers the IP address “EA4” of the media router 1204 in accordance with a rule shown in a table 1255-2 of FIG. 193 (Step H303). Next, the telephone number server 1137 produces an external IP packet 1310 (FIG. 147), and then transmits the produced external IP packet 1310 to the network node apparatus 1244 (Step H304). The external IP packet 1310 contains at least the transmission source telephone number “1001”, the destination telephone number “301”, and also the UDP port number “5004” which is used in the telephone communication transmission of the telephone set 1208. Alternatively, it should be understood that relative information “Info-1” may be contained in the external IP packet 1310, and the relative information “Info-1” is constituted by an identification number of a telephone call, a speech compression system, and an identification title such as a speech (voice) code conversion, which are related to the media router 1260. Upon receipt of the IP packet 1310, the network node apparatus 1244 produces an internal IP packet 1311 (refer to FIG. 148) to transmit the internal IP packet 1311 by employing both the IP packet 1310 and the IP communication record (namely, EA1, EA4, IA1, IA4) indicated on the second row of the address administration table 1250 from the top row, while applying the capsulating technical method of the IP packet. The internal IP packet 1311 is reached via the routers 1263 and 1264 shown in FIG. 145 to the network node apparatus 1246 (Step H305). Then, the network node apparatus 1246 performs the inverse-capsulation of the IP packet so as to restore a IP packet, and then, sends the restored IP packet to the media router 1204 (Step H306). The media router management unit 1265 acquires at least the transmission source telephone number “1001”, the destination telephone number “301”, and the communication-purpose UDP port number “5004” from the received IP packet, and thereafter, returns a confirmation of a telephone calling operation (Steps H307, H308, H309). Next, the media router administration unit 1265 transfers the telephone call (call reception) to the telephone set 1224 (Step H310). The telephone set 1224 returns to the media router administration unit 1265 (Step H311), and furthermore, produces a telephone calling sound (ringing). The media router administration unit 1265 notifies the telephone call of the telephone set 1224 via the media router administration unit 1260 to the destination telephone set 1208 (Steps H312, H313, H314, H315). At the Step H314, the media router administration unit 1265 notifies the transmission source telephone number “1001”, the destination telephone number “301”, and the UDP port number “5008” used in the telephone communication transmission of the telephone set 1224 to the telephone set 1208. When the user of the telephone set 1224 takes up the handset thereof, the telephone set 1224 notifies the fact to the media router administration unit 1265 (Step H320). The media router administration unit 1265 responds a response made at the step H320 via the media router 1260 to the telephone set 1208 of the transmission source (Steps H322, H323, H324, H325). The telephone set 1208 confirms the response with respect to the media router 1260 (Step H321), and then, the media router 1265 confirms the response with respect to the telephone set 1224 (Step H326). It should also be noted that the Steps H321 and H326 correspond to an optical process step. With execution of the above-described process operations, the connection phase of the telephone set is completed. In the above-described connection phase, an internal portion of an external IP packet is a UDP segment, and as both a transmission UDP port number and a reception UDP port number, for example, “5060” is employed. <<Communication Phase>> A telephone communication established between the user of the telephone set 1208 and the telephone set 1224 corresponds to steps similar to those explained in other embodiments. In this telephone communication, both an IP communication record indicated in the second row of the address administration table 1250 (namely, records of “EA1, EA4, IA1, IA4”), and an IP communication record indicated in a first row of an address administration table 1253 (namely, records of “EA4, EA1, IA4, IA1”) are employed. The voice (speech) is sent from the telephone set 1208 to the media router management unit 1260 (step H350). In the media router administration unit 1260, the above-described voice signal is digitalized, and the digital voice data is transferred to a payload portion of an external IP packet 1312 (refer to FIG. 149), and then the resulting IP packet 1312 is reached to the network node apparatus 1244. Then, after the external IP packet is IP-capsulated to be converted into an internal IP packet 1313 (refer to FIG. 150), the internal IP packet 1313 is transferred into the inside of the IP transfer network 1200, and then, is reached to the network node apparatus 1246. The network node apparatus 1246 inverse-capsulates the internal IP packet 1313 and supplies the inverse-capsulated IP packet to the media router administration unit 1265 (Steps H351 to H353). In this media router management unit 1265, the digitalized voice data is converted into an analog voice signal, and then, the analog voice signal is reached to the telephone set 1224 (Step H354). The telephone voice signal produced from the telephone set 1224 may be similarly transferred to the telephone set 1208 along a direction opposite to the above-explained direction (Steps H360 to H364). In the communication phase, such an example is shown that an internal portion of the external IP packet 1312 is a UDP segment, a UDP port number sent from the telephone set 1208 is “5004”, and a UDP port number received by the telephone set 1208 is “5008”. <<Release Phase>> When the user of the telephone set 1208 notifies the end of the telephone communication (Step H380 of FIG. 146), a series of process steps (namely, Steps H381 to H383) are performed in a similar manner to those as explained in other embodiment. The notification is reached to the telephone set 1224 (Step H384). Then, media router administration unit 1265 notifies a release completion to the media router administration unit 1260 (Steps H386 to H388). In the above-explained release phase, a format of an external IP packet is similar to that of the IP packet 1310 used in the above-described connection phase. That is, a payload portion of this external IP packet is the UDP segment, and as to both the transmission UDP port number and the reception UDP port number, for instance, “5060” is employed. Another Example Using Telephone Number Server Contained in Media Router When the user takes up the handset of the telephone set 1208 so as to dial a telephone number “2001” of a telephone set 1220 belonging to another company of a communication counter party, the media router administration unit 1260 checks a table 1255-1 held therein, and knows that a domain name of a telephone number corresponding to the telephone number “2001” is equal to “b.”. Next, the media router administration unit 1260 inquires the telephone number domain name “b.” to the telephone number server 1137. Then, the telephone number server 1137 answers the IP address “EA5” of the media router 1205 which is connected to the telephone set 1220. As a result, the telephone communication can be established between the telephone set 1208 and the telephone set 1220, which belong to different companies in accordance with such a similar terminal-to-terminal communication connection control method. In the above-explained terminal-to-terminal communication connection control method, while both the telephone number servers 1134 and 1272 employed inside the IP transfer network 1200 are not used, the telephone number server 1137 provided in the media router 1201 is used. There is such a feature that the IP communication records are used which have already been set in the address administration tables 1250, 1253 and 1252. <<Method for Producing IP Communication Record to Establish Telephone Communication by Employing Telephone Number Server Within IP Transfer Network>> Referring now to FIG. 151, a description will be made of a terminal-to-terminal communication connection control method for establishing a telephone communication from the telephone set 1208 having the telephone number “1001” to a telephone set 1216 having a telephone number “234-2001”. <<Connection Phase>> When the handset of the telephone set 1208 is taken up, a calling signal is transferred to the media router administration unit 1260 (Step V0). Then, this media router administration unit 1260 confirms the telephone calling operation (Step V1), and checks the table 1255-1 (refer to FIG. 192) held therein so as to grasp that a domain name of a telephone number corresponding to the telephone number “234-2001” is equal to “0.”. Next, the media router administration unit 1260 inquiries the telephone number domain name “0.” to the telephone number server 1137 (Step V2), and the telephone number server 1137 answers the external IP address “EA81” of the telephone proxy server 1270 to the media router administration unit 1260 (Step V3). The external IP address is employed so as to access the telephone number server 1272 for managing the above-explained domain name “0.”. Next, while the transmission source IP address is selected to be the IP address “EA1” of the media router 1201 and also the destination IP address is selected to be the previously acquired IP address “EA81”, the media router administration unit 1260 produces such an IP packet 1320 (refer to FIG. 152), and thereafter transmits the IP packet 1320 to the network node apparatus 1244 (Step V4). The IP packet 1320 contains the transmission source telephone number “1001”, the destination telephone number “234-2001”, the UDP port number “5006” used in the telephone voice communication, and also the additional information “Info-2”. A payload portion of the IP packet 1320 corresponds to a UDP packet, and both the transmission source port number and the destination port number are selected to be “5060”. The additional information corresponds to such information which is internally used in the media router 1260. The additional information corresponds to, for example, the speech compression system (G.711 and G729A) employed so as to use the telephone set 1208, the speech code conversion system, and also the number for discriminating the telephone call. It should be noted that both the telephone administration server 1271 and the telephone proxy server 1270 are not related to the above-explained additional information. The network node apparatus 1244 retrieves the IP communication record contained in the address administration table 1250 of FIG. 145 by employing both the internal IP address “IA1” and the destination IP address “EA81” contained in the IP packet 1320. The internal IP address “IA1” is applied to the termination unit of the logic communication line 1257 into which the external IP packet 1320 is entered. Furthermore, the network node apparatus 1244 confirms such a fact that the transmission source IP address “EA1” contained in the IP packet 1320 is involved in the IP communication record. In this case, the network node apparatus 1244 produces an IP packet 1321 (refer to FIG. 153) by employing a record indicated in a fourth row of the address administration table 1250 from the top row, namely “EA1, EA81, IA1, IA81” equal to IP address (i.e., “IA1” and “IA81”) which are described on a third address and a fourth address within the record, while applying the IP packet capsulating technical idea. Then, the network node apparatus 1244 transmits the produced IP packet 1321 to the telephone proxy server 1270 whose internal IP address is equal to “IA81” (Step V5). When the telephone proxy server 1270 receives the IP packet 1321, the pilot telephone administration server 1270 produces a payload portion of the IP packet 1321, and such an IP packet 1322 (refer to FIG. 154) in which the above-explained addresses “EA1, IA1, EA81, IA81” are contained in the payload portion thereof, and then, transmits the IP packet 1322 to the telephone administration server 1271 (Step V6). In this case, the telephone proxy server 1270 uses an IP address “IA91” of the telephone administration server 1271, which is previously saved. <<Control of Telephone Calling Line Number>> The telephone administration server 1271 derives the address “EA1” of the media router 1201 on the transmission side from the received IP packet 1322, and compares the derived address with a telephone call line administration table 1326-5 of FIG. 177. As to such a record whose IP address is equal to “EA1”, the telephone administration server 1271 increases the under use line number by “1” to compare the increased line number with the upper-limit line number. In this 10-th embodiment, since the under use line number is equal to “2” and the upper-limit line number is equal to “5”, the subsequent procedure is carried out. Then the under use line number is larger than the upper-limit line number, the telephone administration server 1271 interrupts the present process operation, which the process operation is not advanced to the subsequent connection phase. Alternatively, the telephone administration server 1271 forms such an IP packet for explaining the interrupt reason, and then notifies the IP packet via the telephone proxy server 1270 to the transmission source media router administration unit 1260. The telephone administration server 1271 may selectively determine as to whether or not the telephone call line number control is carried out. <<Management of Line Number>> The telephone administration server 1271 reads out the IP packet 1322 (FIG. 154) so as to acquire both the transmission source telephone number “1001” and the destination telephone number “234-2001”, and then, calculates a line number “CIC-2” (Circuit Identification Code) for managing a voice communication line from a set of these two telephone numbers. Next, the telephone administration server 1271 writes in a record of a CIC administration table 1323 (refer to FIG. 155), the line number “CIC-2”; the transmission source telephone number “1001”; the destination telephone number “234-2001”; both the external IP address “EA1” and the internal IP address “IA1” of the media router 1201 to which the telephone set 1208 is connected; both the external IP address “EA81” and the internal IP address “IA81” of the telephone proxy server 1270; an IP address “IA91” of the telephone administration server 1271; the procedure segment “IAM”; and a writing time instant (year, month, day, time, minute, second) “St-2”. Next, the telephone administration server 1271 indicates an IP packet 1324 (refer to FIG. 156) to the telephone number server 1272 (Step V7). The IP packet 1324 inquires the IP address related to the destination telephone number “234-2001”. The telephone number server 1272 answers an IP packet 1325 (refer to FIG. 157) to the telephone administration server 1271 (Step V8). The IP packet 1325 contains both the external IP address “EA2” and the internal IP address “IA2” of the media router 1202 connected to the telephone set 1216; both the external IP address “EA82” and the internal IP address “IA82” of the telephone proxy server 1275; and the IP address “IA92” of the telephone administration server 1274. Then, the telephone administration server 1271 adds five sets of IP addresses (“EA2, IA2, EA82, IA82, IA92”) acquired from the telephone number server 1272 to the CIC administration table 1323 (refer to FIG. 155). This result is indicated in a column of an IP address item of the second row record of the CIC administration table 1326-1 (refer to FIG. 158). Next, the telephone administration server 1271 produces an IP packet 1327 (refer to FIG. 159, will be referred to as an “IAM packet”) from the packet 1322 (FIG. 154) with reference to the IP address information of the CIC administration table 1326-1 (FIG. 158), and then transmits the formed IP packet 1327 to the telephone administration server 1274 (Step V9). In this case, the transmission source IP address of the IP packet 1327 corresponds to “IA91” of the telephone administration server, and the destination IP address thereof corresponds to “IA92” of the telephone administration server 1274. The operation of the telephone administration server 1271 is advanced to a waiting state of a Step V16 (will be discussed later), and also initiates the Step V16 waiting timer corresponding to the line number “CIC-2”. When the counting operation of this timer is completed, a release procedure of a communication line is commenced similar to a process operation defined at a Step V60 (will be explained later). <<Control of Call Receiving Line Number>> The telephone administration server 1274 derives the address “EA2” of the media router 1202 on the destination side from the received IP packet 1327 (FIG. 159), and compares the derived address with a telephone call line administration table 1326-6 of FIG. 178. The telephone administration server 1274 increases the under use line number by “1” to compare the increased line number with the upper-limit line number. In this 10-th embodiment, since the under use line number is equal to “2” and the upper-limit line number is equal to “7”, the subsequent procedure is carried out, as to the record of the address “EA2”. While the telephone call reception line administration table 1326-6 is employed, the telephone administration server 1271 may selectively determine as to whether or not the telephone call line number control is carried out. <<Management of Line Number>> Upon receipt of the IP packet 1327, the telephone administration server 1274 derives the line number “CIC-2”, the procedure segment “IAM”, the transmission source telephone number “1001”, the destination telephone number “234-2001”, and the IP addresses (“EA1”, “IA1”, “EA81”, “IA81”, “IA91”, “EA2”, “IA2”, “EA82”, “IA82”, “IA92”), which are contained in the payload portion of the received IP packet 1327, and thereafter writes these derived items as a record of a CIC administration table 1326-2 (refer to FIG. 160) managed by the telephone administration server 1274. This writing time instant “St-3” is also written into the record of the CIC administration table 1326-2 by the telephone administration server 1274. Subsequently, the telephone administration server 1274 forms an IP packet 1328 (refer to FIG. 161) by employing the information acquired from the IP packet 1327, and transmits the formed IP packet 1328 to the telephone proxy server 1275 (Step V10). The payload of the IP packet 1328 contains both a UDP segment and an address area, the IP address “EA1” of the transmission source media router 1206 is additionally written into the UDP segment. The address area contains the IP addresses “EA2, IA2, EA82, IA82”. The telephone proxy server 1275 produces an IP packet 1329 (refer to FIG. 162) by using the information acquired from the IP packet 1328, and then sends the produced IP packet 1329 to the network node apparatus 1247. The IP packet 1329 having the transmission source address of “IA82” and the destination address of “IA2” is reached to the network node apparatus 1247 (Step V11). Then, the network node apparatus 1247 executes the inverse-capsulating operation as to the received IP packet 1329 to produce an IP packet 1330 (refer to FIG. 163), and thereafter transmits the produced IP packet 1330 to the media router administration unit 1267 (Step V12). The media router administration unit 1267 receives the IP packet 1330 so as to confirm as to whether or not the destination telephone number “234-2001” contained in the IP packet 1330 can be received. When the destination telephone number can be received, the media router administration unit 1267 notifies the telephone call (call reception) to the telephone set 1216 (Step V20). Furthermore, the media router administration unit 1267 reads out the contents of the IP packet 1330 to save the read contents, namely the transmission source telephone number “1001”, the destination telephone number “234-2001”, the IP address “EA1” of the transmission source, the UDP port number “5006” of the transmission source, and the additional information Info-2. In order that a call reception possibility (namely, discrimination between call receivable and call not receivable) of the telephone set 1216 is notified, the media router administration unit 1267 produces such an IP packet containing the transmission source telephone number “1001”, the destination telephone number “234-2001”, and the call reception possibility. Then, the media router administration unit 1267 notifies this produced IP packet to the telephone administration server 1274 (Steps V13, V14, V15). It should be noted that the format of the IP packet used at the Steps V13, V14, V15 is similar to a format of an IP packet employed in Steps V22, V23, V24 (will be discussed later). The telephone administration server 1274 receives the above-explained IP packet which has been formed and transmitted by the media router administration unit 1267, and then, derives the transmission source telephone number “1001”, the destination telephone number “234-2001”, and the information of the call reception possibility from the received IP packet. Then, the telephone administration server 1274 calculates the line number “CIC-2” from the two telephone numbers, and produces such an IP packet 1331 (refer to FIG. 164, will be referred to as an “ACM packet”) which contains the line number “CIC-2” and the information as to the call reception possibility of the telephone set 1216, and then transmits the IP packet to the telephone administration server 1271 (Step V16). The telephone administration server 1271 derives both the line number “CIC-2” and the procedure segment “ACM” from the received IP packet 1331, and stops the ACM waiting timer corresponding to the line number “CIC-2” which has been set at the time instant of the above Step V9. The telephone administration server 1271 checks the CIC administration table 1326-1 (refer to FIG. 158) held by the telephone administration server 1271 so as to find out such a record whose line number is equal to “CIC-2”, and rewrites a procedure segment column of the above-explained record into the above-mentioned procedure segment “ACM”. Next, the telephone administration server 1271 produces such an IP packet for indicating that the ACM packet is received (the IP packet includes information of call reception possibility of telephone set 1216), and then notifies the IP packet to the media router administration unit 1260 (Steps V17, V18, V19). It should be noted that the format of the IP packet used at the Steps V17, V18, V19 is identical to a format of an IP packet employed in Steps V26, V27, V28 (will be discussed later). The process operations defined at the Steps V17, V18, V19 may be selectively carried out. When the telephone set 1216 reports the telephone calling operation to the media router administration unit 1267 (Step V21), the media router administration unit 1267 produces such an IP packet 1332 (refer to FIG. 165) and transmits the IP packet 1332 to the network node apparatus 1247 in order to notify such a fact that the telephone set 1216 is being called (Step V22). The produced IP packet 1332 contains the transmission source telephone number “1001”, the destination telephone number “234-2001”, the UDP port number “5008” used in the voice communication by the telephone set, and the additional information Info-3. The network node apparatus 1247 capsulates the IP packet 1332 by using such a record that the address values of the address administration table 1254 are “EA2, EA82, IA2, IA82”, and thus produces an IP packet 1332-2 (refer to FIG. 166). The IP packet 1332-1 is transmitted to the pilot telephone administration server 1275 (Step V23). The pilot telephone administration server 1275 forms an IP packet 1332-2 (refer to FIG. 167), and then transmits the IP packet 1332-2 to the telephone administration server 1274 (Step V24). The telephone administration server 1274 derives both the transmission source telephone number “1001” and the destination telephone number “234-2001” from the received IP packet 1332-2, and then calculates the line number “CIC-2” from the two telephone numbers so as to produce an IP packet 1333 (refer to FIG. 168, called as a “CPG” packet). The telephone administration server 1274 transmits the IP packet 1333 to the telephone administration server 1271 (Step V25). The IP packet 1333 contains both the UDP port number “5008” and the additional information “Info-3” acquired from the IP packet 1332-2. The telephone administration server 1271 derives the line number “CIC-2”, the procedure segment “CPG”, the UDP port number “5008”, and the additional information Info-3 from the received IP packet 1333, and rewrites the procedure segment of the line number “CIC-2” of the CIC management table 1326-1 (FIG. 158) as “CPG”. Then, the telephone administration server 1271 reads out the IP addresses “EA1, IA1, EA81, IA81”, the transmission source telephone number “1001”, and the destination telephone number “234-2001”, and then produces an IP packet 1333-1 (refer to FIG. 169) by employing all of the acquired information, and transmits the produced IP packet 1333-1 to the telephone proxy server (Step V26). The telephone proxy server 1270 produces an IP packet 1333-2 (refer to FIG. 170) by using the information contained in the received IP packet 1333-1, and then sends the produced IP packet 1333-2 to the network node apparatus 1244 (Step V27). The network node apparatus 1244 executes the inverse-capsulating operation as to the received IP packet 1333-2 to produce an IP packet 1333-3 (refer to FIG. 171), and thereafter transmits the produced IP packet 1333-3 to the media router administration unit 1260 (Step V28). The media router administration unit 1260 reads out from the received IP packet 1333-3, the transmission source telephone number “1001”, the destination telephone number “234-2001”, the destination IP address “EA2”, the destination UPD port number “5008”, and the additional information Info-3 so as to save the read information. The media router administration unit 1260 notifies such a fact that the destination telephone set is being called to the telephone set 1208 (Step V29). Next, when the user of the telephone set 1216 responds to the telephone call (Step V31), the telephone set 1216 transmits the IP packet containing both the transmission source telephone number “1001” and the destination telephone number “234-2001” to the telephone administration server 1274 in order to notify the response of the telephone set 1216 (Steps V32, V33, V34). The telephone administration server 1274 derives both the transmission source telephone number “1001” and the destination telephone number “234-2001” from the received IP packet so as to calculate the line number “CIC-2” from the two telephone numbers, and produces such an IP packet 1334 (refer to FIG. 172, is called as an “ANM” packet) containing at least the calculated line number “CIC-2”, and then transmits the IP packet 1334 to the telephone administration server 1271 (Step V35). The telephone administration server 1271 derives both the line number “CIC-2” and the procedure segment “ANM” from the received IP packet 1334, and checks the CIC administration table 1326-1 (refer to FIG. 158) held by the telephone administration server 1271 so as to find out such a record in which the line number is equal to “CIC-2”, and then rewrites the procedure segment column of the record into the above-explained procedure segment “ANM”. Next, the telephone administration server 1271 notifies the reception of the ANM packet to the media router administration unit 1260, namely the telephone administration server 1271 notifies that the telephone set 1216 responds to the telephone calling (Steps V36, V37, V38), and then, the media router administration unit 1260 sends a telephone call signal to the telephone set 1208 (Step V39). <<Setting of IP Communication Record>> At the Step V34, the telephone administration server 1274 acquires the line number “CIC-2” from the IP packet which passes through the telephone administration server 1274, and finds out such a record that the line number is “CIC-2” from the CIC administration table 1326-2 owned by the telephone administration server 1274 so as to derive the IP addresses “EA2”, “EA1”, “IA2”, “IA1” from the record content. Then, the telephone administration server 1274 transmits the derived IP addresses to the table administration server 1276 (Step V42). The table administration server 1276 sets these transmitted IP addresses as a record “EA2, EA1, IA2, IA1” indicated on a second row of the address administration table 1254 provided in the network node apparatus 1247 (Step V43). Similarly, at the above-described Step V35, the telephone administration server 1271 acquires the line number “CIC-2” from the IP packet which passes through the telephone administration server 1271, and finds out such a record that the line number is “CIC-2” from the CIC administration table 1323 owned by the telephone administration server 1271 so as to derive the IP addresses “EA1”, “EA2”, “IA1”, “IA2” from the record content. Then, the telephone administration server 1271 transmits the derived IP addresses to the table administration server 1273 (Step V44). The table administration server 1273 sets these transmitted IP addresses as a record “EA1, EA2, IA2, IA2” indicated on a fifth row of the address administration table 1250 provided in the network node apparatus 1244 (Step V45). <<Variation in Connection Phase>> It should be noted that the media router administration unit 1267 can transmit a response confirmation with respect to the Step V31 to the telephone set 1216 (Step V41). Similarly, the telephone set 1208 can send a response confirmation with respect to the Step V39 to the media router administration unit 1260 (Step V40). The process operations defined at the Steps V41 and V40 correspond to optional process operation which may be selectively performed. Also, in the above-explained connection phase, the communication-purpose UDP port and the addition information of the telephone set 1216 are transmitted at the Steps V22 to V29, but may be alternatively sent at the Steps V32 to V39. <<Communication Phase>> A telephone communication established between the user of the telephone set 1208 and the telephone set 1216 corresponds to steps similar to those explained in other embodiments. In this telephone communication, both an IP communication record indicated in the fifth row of the address administration table 1250 (namely, records of “EA1, EA2, IA1, IA2”), and an IP communication record indicated in a second row of an address administration table 1254 (namely, records of “EA2, EA1, IA2, IA1”) are employed. The voice (speech) signal of the telephone set 1208 is digitalized, and the digitalized voice data is described on the payload of the IP packet 1335 (refer to FIG. 173). In this case, both the destination address and the UDP port number, which are acquired in the above-explained connection phase are employed. In other words, the transmission source address corresponds to the IP address “EA1” of the media router 1201, the destination address corresponds to the IP address “EA2” of the media router 1202 connected to the destination telephone set 1216, “5006” is employed as the transmission source UDP port number, and “5008” is used as the destination UDP port number. The analog voice is sent from the telephone set 1208 (Step V50), and the analog voice is digitalized to become a voice IP packet 1335 in the media router administration unit 1260, and then the voice IP packet 1335 is sent to the network node apparatus 1244 (Step V51). In this network node apparatus 1244, the digital voice data is capsulated to become an IP packet 1336 (refer to FIG. 174), and then, the IP packet 1336 is reached via the IP communication line, the router 1263, and the router 1264 of FIG. 145 to the network node apparatus 1247 (Step V52). The network node apparatus 1247 inverse-capsulates the internal IP packet 1336 and supplies the inverse-capsulated IP packet to the media router administration unit 1267 (Step V53). In this media router administration unit 1267, the digitalized voice data is converted into an analog voice signal, and then, the analog voice signal is reached to the telephone set 1216 (Step V54). The analog voice signal produced from the telephone set 1216 may be similarly transferred along a direction opposite to the above-explained direction (Steps V55 to V59). <<Release Phase>> When the user of the telephone set 1208 notifies the release of the telephone communication (Step V60 of FIG. 134), the notification is notified via the media router administration unit 1260, the network node apparatus 1244, and the pilot telephone administration server 1270 to the telephone administration server 1271 (Steps V60 to V63). The telephone administration server 1271 writes an end time instant “Ed-1” into a column of an end time instant of such a record in which the line number contained in the CIC administration table 1326-1 is “CIC-2”. Next, the telephone administration server 1271 produces a release IP packet 1337 (refer to FIG. 175, and is called as a “REL” packet), and then notifies the REL packet to the telephone administration server 1274 (Step V64). The telephone administration server 1274 notifies the release of the telephone communication via the telephone proxy server 1275 to the telephone set 1216 (Steps V71 to V74). Furthermore, the telephone administration server 1274 writes an end time instant “Ed-2” into a column of an end time instant of such a record in which the line number contained in the CIC administration table 1326-2 is “CIC-2”. Next, the telephone administration server 1274 produces a release completion IP packet 1338 (refer to FIG. 176, and is called as a “RLC” packet), and then returns the RLC packet to the telephone administration server 1271 (Step V70) in order that the telephone administration server 1274 notifies the reception of the release IP packet 1337. After the Step V64, the telephone administration server 1271 informs a release instruction via the telephone proxy server 1270 and the network node apparatus 1244 to the media router administration unit 1260 (Steps V65, V66, V67). The media router administration unit 1260 notifies the release instruction to the telephone set 1216 (Step V74), and also informs a release report via the telephone proxy server to the telephone administration server 1274 (Steps V75, V76, V77). <<Deletion of IP Communication Record>> After the Step V64, the telephone administration server 1271 transmits the line number “CIC-2” written in the release IP packet 1337 to the table administration server 1273 (Step V78), and deletes a record of the address administration table 1250 corresponding to the line number “CIC-2” provided in the network node apparatus 1244. In this case, the telephone administration server 1271 deletes the IP communication records whose contents are “EA1, EA2, IA1, IA2” (Step V79). After the Step V70, the telephone administration server 1274 transmits the line number “CIC-2” written in the release completion IP packet 1338 to the table administration server 1276 (Step V80), and deletes a record of the address administration table 1254 corresponding to the line number “CIC-2” provided in the network node apparatus 1247. In this case, the telephone administration server 1274 deletes the IP communication records whose contents are “EA2, EA1, IA2, IA1” (Step V81). <<Acquisition of Telephone Communication Information>> When the operation administration server 1277 employed in the IP transfer network 1200 inquires to the telephone administration server 1271 every a properly determined time instant, or a properly selected time interval (Step V200 of FIG. 179), the operation administration server 1277 detects such a record that a telephone communication is ended by considering as to whether or not an end time instant is written into the CIC administration table 1236-1. Then, the operation administration server 1277 notifies a telephone communication record such as a transmission source telephone number, a destination telephone number, a starting time instant, and an end time instant to the telephone administration server 1271 (Step V201). The operation administration server 1277 deletes a record of the CIC administration table 1326 in which a telephone communication is ended. Similarly, when the operation administration server 1277 employed in the IP transfer network 1200 inquires to the telephone management server 1274 (Step V202 of FIG. 179), the operation administration server 1277 detects such a record that a telephone communication is ended by considering as to whether or not an end time instant is written into the CIC administration table 1326-2. Then, the operation administration server 1277 notifies a telephone communication record such as a transmission source telephone number, a destination telephone number, a starting time instant, and an end time instant to the telephone administration server 1274 (Step V203). The operation administration server 1277 deletes a record of the CIC administration table 1326-2 in which the telephone communication is ended. As previously explained, the operation administration server can acquire the record of the telephone communication via the telephone administration server, namely, the transmission source telephone number, the destination telephone number, the starting time instant, the end time instant, which may be used in the charging operation of the telephone communication. The acquisition of the telephone communication instants may be selectively carried out. <<Telephone Calling Line Administration and Call Receiving Line Administration>> In the connection phase, when the telephone administration server 1271 forms the IAM packet 1327 shown in FIG. 159 (Step V9), the telephone administration server 1271 increases the under-use line number by “1”, which corresponds to the address “EA1” of the media router provided on the transmission side of the calling line administration table 1326-5 shown in FIG. 177. Similarly, the telephone administration server 1274 increases the under-use line number by “1”, which corresponds to the address “EA2” of the media router provided on the destination of the call receiving line administration table 1326-6 of FIG. 178. In the release phase, when the telephone administration server 1271 forms the REL packet 1337 shown in FIG. 175 (Step V64), the telephone administration server 1271 decreases the under-use line number by “1”, which corresponds to the address “EA1” of the media router provided on the transmission side of the calling line administration table 1326-5 shown in FIG. 177. Similarly, the telephone administration server 1274 decreases the under-use line number by “1”, which corresponds to the address “EA2” of the media router provided on the destination of the call receiving line administration table 1326-6 of FIG. 178, while the RLC packet 1388 of FIG. 176 is produced (Step V70). It should be noted that both the telephone calling line administration and the call reception line administration may be selectively executed. Another Example of Connection Phase In the above-explained connection phase (Steps V0 to V45), a step for confirming a response may be additionally introduced, namely Steps V90 to V96, which will now be explained with reference to FIG. 180. When the media router administration unit 1260 receives a notification of a response (Step V38), the media router administration unit 1260 may produce such an IP packet which implies a notification of the response confirmation and may return the IP packet. The IP packet for confirming the response is transmitted via the network node apparatus 1244, the telephone proxy server 1270, the telephone administration server 1271, the telephone proxy server 1274, the telephone representative server 1275, and the network node apparatus 1247 to the media router administration unit 1267 (Steps V90 to V96). As previously explained, reliability of the communication may be improved. Another Example of Release Phase The above-explained release phase (Steps V60 to V77) may be replaced by the below-mentioned steps, which will be explained with reference to FIG. 180. When the user of the telephone set 1208 notifies releasing of the telephone communication (Step V100 of FIG. 185), the notification is supplied via the media router administration unit 1260 the network node apparatus 1244, the pilot telephone administration server 1270, the telephone administration server 1271, the telephone administration server 1274, the telephone proxy server 1275, the network node apparatus 1247, and the media router administration unit 1267 to the telephone set 1216 (Steps V100 to V108). When the media router administration unit 1267 receives the notification of the communication release (Step V107), the media router administration unit 1267 notifies the release reception to the media router administration unit 1260 along a direction opposite to the above-explained direction, namely via the network node apparatus 1247, the telephone proxy server 1275, the telephone administration server 1274, the telephone administration server 1271, the pilot telephone proxy server 1270, and the network node apparatus 1244 (Steps V111 to V118). Subsequently, the release reception is notified via the same route as that of the notification for the release completion, namely, via the network node apparatus 1247, the telephone proxy server 1275, the telephone administration server 1274, the telephone administration server 1271, the telephone proxy server 1270, and the network node apparatus 1244 to the media router administration unit 1260 (Steps V121 to V127). Also, the deletion of the records employed in the address administration table 1250 employed in the network node apparatus 1244, and used in the voice communication within the address administration table 1254 provided in the network node apparatus 1247 is carried out in a similar manner to the above-explained Steps V80 and V81, or Steps V78 and V79. The reliability can be improved by executing the procedure of the release acceptance, and the procedure of the release completion two times. <<Employment of TCP Technique>> In the above-explained connection phase and release phase, the communication established between the telephone administration server 1271 and the telephone administration server 1274 (namely, UDP communication defined by the Steps V9, V16, V25, V35, V64 and V70 shown in FIG. 151) may be substituted by a TCP communication. Referring now to FIG. 181 to FIG. 186, the TCP communication will be explained. FIG. 181 indicates an embodiment in which the Step V9 is carried out by way of the TCP communication. That is, while the telephone administration server 1271 transmits a TCP packet 1390-1 containing an SYN designation used to establish a TCP connection to the telephone administration server 1274, the telephone administration server 1274 responds a TCP packet 1391-1 containing an ACK indication of a communication start acknowledgment, and then the telephone administration server 1271 transmits a TCP packet 1392-1 to the telephone administration server 1274 (Step V9 t). The TCP packet 1392-1 contains the same content (notification of call setting IAM) as that of the IP packet 1327. Next, the telephone administration server 1271 transmits a TCP packet 1393-1 containing an FIN designation used to end the TCP connection to the telephone administration server 1274, and the telephone administration server 1274 returns a TCP packet 1394-1 for an end confirmation to the telephone administration server 1271. FIG. 182 indicates an embodiment in which the Step V16 is carried out by way of the TCP communication. That is, while the telephone administration server 1274 transmits a TCP packet 1390-2 containing an SYN designation used to establish a TCP connection to the telephone administration server 1271, the telephone administration server 1271 responds a TCP packet 1391-2 containing an ACK indication of a communication start acknowledgment, and then the telephone administration server 1274 transmits a TCP packet 1392-2 to the telephone administration server 1271 (Step V16 t). The TCP packet 1392-2 contains the same content (notification of call setting acceptance ACM) as that of the IP packet 1331. Next, the telephone administration server 1274 transmits a TCP packet 1393-2 containing an FIN designation used to end the TCP connection to the telephone administration server 1271, and the telephone administration server 1271 returns a TCP packet 1394-2 for an end confirmation to the telephone administration server 1274. FIG. 183 indicates an embodiment in which the Step V25 is carried out by way of the TCP communication. That is, while the telephone administration server 1271 transmits a TCP packet 1390-3 containing an SYN designation used to establish a TCP connection to the telephone administration server 1274, the telephone administration server 1274 responds a TCP packet 1391-3 containing an ACK indication of a communication start acknowledgment, and then the telephone administration server 1271 transmits a TCP packet 1392-3 to the telephone administration server 1274 (Step V25 t). The TCP packet 1392-3 contains the same content (notification of call passing CPG) as that of the IP packet 1333. Next, the telephone administration server 1271 transmits a TCP packet 1393-3 containing an FIN designation used to end the TCP connection to the telephone administration server 1274, and the telephone administration server 1274 returns a TCP packet 1394-3 for an end confirmation to the telephone administration server 1271. FIG. 184 indicates an embodiment in which the Step V35 is carried out by way of the TCP communication. That is, the telephone administration server 1271 transmits a TCP packet 1392-4 to the telephone administration server 1274 (Step V35 t). The TCP packet 1392-4 contains the same content (notification of call passing ANM) as that of the IP packet 1334. The TCP communication can be carried out in a similar manner to that of other communication methods. FIG. 185 shows an embodiment in which the step V64 is carried out by way of a TCP communication. That is, the telephone administration server 1271 transmits a TCP packet 1392-5 to the telephone administration server 1274. The TCP packet 1392-5 contains the same content (notification of release REL) as that of the IP packet 1337 (Step V64 t). The TCP communication can be done in a similar manner to that of other communication methods. FIG. 186 shows an embodiment in which the Step V70 is carried out by way of a TCP communication. That is, the telephone administration server 1274 transmits a TCP packet 1392-6 to the telephone administration server 1271. The TCP packet 1392-6 contains the same content (notification of release completion RLC) as that of the IP packet 1338 (Step V70 t). The TCP communication can be done in a similar manner to that of other communication methods. <<Separation Between Control Line and Telephone Communication Line>> Next, a description will now be made of such a fact that in an open-area telephone communication, an IP communication line employed in a terminal-to-terminal connection control can be separated from a communication line used in a voice communication. The IP packets 1322, 1327, 1328, 1331, 1332-2, 1333, 1333-1, 1334, 1337 and 1338 used in the terminal-to-terminal connection control are transferred to a range 1289 (refer to FIG. 187) of any of IP communication lines which connect the telephone proxy 1270, the telephone administration server 1271, the telephone administration server 1274, and the telephone proxy server 1275. On the other hand, the IP packets 1335 and 1336 used in the voice communication are transferred to a range 1293 (refer to FIG. 187) of IP communication lines which connect the network node apparatus 1244, the router 1291, the router 1292, and the network node apparatus 1247. The IP communication lines employed in the terminal-to-terminal connection control correspond to a line of a common line signal network of a switched communication network, whereas the communication lines used in the voice communication correspond to a voice communication line of a switched communication network. As previously explained, the network node apparatus 1244 owns such a function that the IP packet for the terminal-to-terminal communication connection sent from the media router 1201 can be transmitted to the router 1263, and the IP packet for the voice communication can be separately transmitted to the router 1291. Considering the flow of the IP packet along the reverse direction, while the IP packet for the terminal-to-terminal communication connection is combined with the IP packet for the voice communication, the combined IP packet is transmitted to the media router 1201. <<Tree Structure of Telephone Numbers and Telephone DNS Server>> A tree structure shown in FIG. 188 corresponds to such a tree structure of telephone numbers managed by a telephone number server 1140 of a company “B”. While domains 1251 to 1254 are related to each other at the same level in a tree structural form at a lower grade of a route 1250, the domain 1251 manages a telephone number “1XXX” (namely, telephone numbers of 1000 digits); the domain 1252 manages a telephone number “2XXX”; the domain 1253 manages the telephone number “3XXX”; and the domain 1254 manages IP addresses related to other telephone numbers. Also, a tree structure shown in FIG. 189 corresponds to such a tree structure of telephone numbers managed by a telephone number server 1142 of a company “A”, respectively. While domains 1251-2, 1251-3 and 1254 are related to each other at the same level in a tree structural form at a low grade of a route 1251, the domain 1251-2 manages a telephone number “1XXX” of the company “A”; the domain 1251-3 manages a domain “#” of the company “A”; the domain 1251-4 manages an extension telephone number “1XX” of the company “A”; the domain 1251-5 manages an extension telephone number “2XX” of the company “A”; and also the domain 1251-6 manages IP addresses related to extension telephone number “3XX” of the company “A”, respectively. In this case, symbol “#” of the domain corresponds to a secret value which is exclusively used in the company “A”, and is not opened to other companies. In other words, with respect to an inquiry issued from a telephone number server belonging to the company “B” and the company “C” other than the company “A”, the telephone number server 1142 does not respond the information related to the domains 1151-4 through 1151-6 managed by the domain “#”. The domain 1254 manages the IP addresses related to other telephone numbers. A tree structure shown in FIG. 190 corresponds to such a tree structure of telephone numbers managed by a telephone number server 1137 of a company “A”. While domains 1251 to 1254 are related to each other at the same level in a tree structural form at a lower grade of a route 1250-1, the domain 1251 manages a telephone number belonging to the company “A”; the domain 1252 manages a telephone number “2XXX” of the company “B”; the domain 1253 manages the telephone number “3XXX” of the company “C”; and the domain 1254 manages IP addresses related to other telephone numbers. The domain 1251-2 manages a telephone number “1XXX” of the company “A”; the domain 1251-3 manages a domain “#” of the company “A”; the domain 1251-4 manages an extension telephone number “1XX” of the company “A”; the domain 1251-5 manages an extension telephone number “2XX” of the company “A”; and also the domain 1251-6 manages IP addresses related to extension telephone number “3XX” of the company “A”, respectively. In this case, symbol “#” of the domain corresponds to a secret value which is exclusively used in the company “A”. A tree structure shown in FIG. 191 corresponds to such a tree structure of telephone numbers managed by a telephone number server 1139 of a company “X”. While domains 1254-2 to 1254 are related to each other at the same level in a tree structural form at a lower grade of a route 1250-2, the domain 1254-2 manages a telephone number belonging to the company “X”; and the domain 1254 manages IP addresses related to other telephone numbers, respectively. A table 1255-1 of FIG. 192 represents such a method that a media router administration unit 1260 converts telephone numbers into domain names, and these telephone numbers are telephone communication counter party of the telephone sets 1208 to 1211 connected to the media router 1201. For instance, a telephone number “1XXX” of a first row of the table 1255-1, e.g., a telephone number “1001” is represented by a telephone number domain name “1.a.”; a telephone number “2XXX” of a second row of the table 1255-1 is expressed by a telephone number domain name “b.”; and another telephone number of a seventh row of the table 1255-1 is represented by a telephone number domain name “0.”, respectively. Other rows of this table are expressed in a similar manner. In accordance with the table 1255-2 of FIG. 193, for example, the telephone number server 1137 responds the IP address “EA1” when the telephone number domain name “1.a.” is inquired; the telephone number server 1137 responds the IP address “EA5” when the telephone number domain name “b.” is inquired; and the telephone number server 1137 answers the IP address “EA81” when the telephone number domain name “0.” is inquired. A table 1256-1 of FIG. 194 represents such a method that a media router administration unit 1264 converts telephone numbers into domain names, and these telephone numbers are telephone communication counter party of the telephone sets 1228 to 1231 connected to the media router 1203. For instance, a telephone number “1XXX” of a first row of the table 1256-1 is represented by a telephone number domain name “1.a.”; a telephone number “1XX” of a second row of the table 1256-1 is expressed by a telephone number domain name “1.#.a.”; and another telephone number of a fifth row of the table 1256-1 is represented by a telephone number domain name “0.”, respectively. Other rows of the table are expressed in a similar manner. In accordance with the table 1256-2 of FIG. 195, for example, the telephone number server 1142 responds the IP address “EA1” when the telephone number domain name “1.a.” is inquired; the telephone number server 1142 responds the IP address “EA5” when the telephone number domain name “1.#.a.” is inquired; and the telephone number server 1142 answers the IP address “EA81” when the telephone number domain name “0.” is inquired. A table 1257-1 of FIG. 196 represents such a method that a media router administration unit 1266 converts telephone numbers into domain names, and these telephone numbers are telephone communication counter party of the telephone sets 1220 to 1223 connected to the media router 1205. For instance, a telephone number “1XXX” of a first row of the table 1257-1, is represented by a telephone number domain name “a.”; a telephone number “2XXX” of a second row of the table 1257-1 is expressed by a telephone number domain name “b.”; and another telephone number of a fourth row of the table 1256-1 is represented by a telephone number domain name “0.”, respectively. Other rows of the table are expressed in a similar manner. In accordance with the table 1257-2 of FIG. 197, for example, the telephone number server 1140 responds the IP address “EA1” when the telephone number domain name “a.” is inquired; the telephone number server 1140 responds the IP address “EA5” when the telephone number domain name “b.” is inquired; and the telephone number server 1140 answers the IP address “EA81” when the telephone number domain name “0.” is inquired. The telephone number servers 1137 to 1142 call other telephone number servers by employing the known redialing function of the domain name server (DNS), and then acquire the IP addresses which are directly managed by other telephone number servers. The operations of the above-explained tenth embodiment will now be summarized. That is, the media router 1 is connected via the IP transfer network to the media router 2; the telephone set 1 is connected to the media router 1; and the telephone set 2 is connected to the media router 2. While both the telephone set 1 and the telephone set 2 use the telephone number server employed in the media router 1, the telephone communication can be established without using the telephone number server employed in the IP transfer network. It should be noted that a plurality of telephone sets may be connected to either the media router 1 or the media router 2. Also, while the IP transfer network contains the specific telephone number server, both the telephone set 1 and the telephone set 2 access the telephone number server provided in the IP transfer network by employing the telephone number server inside the media router 1, and can telephone-communicate with the telephone set 2. The IP transfer network contains two, or more network node apparatus; the media router is connected via the logic IP communication line to any one of these network node apparatus; the internal IP addresses are applied to the termination units provided on the side of the network node apparatus of the logic IP communication line; and the external IP addresses are applied to the media routers. The media router contains the telephone number server, and is connected via the communication line to one, or more telephone sets. As the records of the address administration table within the network node apparatus, both the external IP address and the communication record are previously set, the connection phase of the telephone communication is arranged by a series of processing steps made of the call setting operation (IAM), the call setting acceptance (ACM), the call passing (CPG) and the response (ANM). Also, the release phase of the telephone communication is arranged by a series of process steps made of the release (REL) and the release completion (RLC). Alternatively, while the response confirmation (ACK) is carried out after the response (ANM), the release acceptance may be executed between the release (REL) and the release completion (RLC). The operations of the tenth embodiment will now be further summarized. That is, the IAM packet, the ACM packet, the CPG packet, the ANM packet, the REL packet and the RLC packet are transmitted/received between the telephone administration server provided on the telephone calling side and the telephone administration server provided on the call receiving side. In the closed-area telephone communication for limiting the telephone communication parties, the telephone number server provided inside the media router is employed. Also, in the open-area telephone communication not for restricting the telephone communication parties, since the telephone number server employed in the media router is used, the telephone number server employed in the IP transfer network is employed. In the open-area telephone communication, the IP communication line employed in the terminal-to-terminal connection control can be separated from the communication line used in the voice communication. While the telephone administration server contains the CIC administration table, the telephone administration server can record the transmission source telephone number, the destination telephone number, the starting time instant of the telephone communication, and the end time instant thereof. The operation administration server inquiries the telephone administration server so as to acquire the transmission source telephone number, the destination telephone number, the starting time instant of the telephone communication and the end time instant thereof, which may be used in the charging operation. Furthermore, in this embodiment, the above-mentioned IP encapsulation and reverse-capsulation by the network node apparatus can be replaced to the simple encapsulation which forms an internal packet by adding a simple header to an external IP packet and the simple reverse-capsulation which removes the simple header from the internal packet, respectively. 11. 11th Embodiment in which Telephone Transfer is Carried Out from Public Telephone Network <<Preparation>> Referring now to FIG. 198, an 11-th embodiment of the present invention will be described. A telephone set 520 owns a telephone number “03-5414-8510”, and is connected via a telephone line 517 to an exchanger 513. A communication line 524-1 is used to connect an exchanger 514-1 to a gateway 521-1. An interface is an “NNI” containing a common signal line and a telephone communication line. A signalling unit defined by the common line signal system is transmitted on the common signal line. A signal station code “#1234” which is discriminatable on the side of the public switched telephone network and a gateway logic name “GW5211” to be public are applied to the gateway 521-1. The subscriber exchangers 513 and 511 in advance store pairs of the gateway logic name “GW5211” and the signal station code “#1234”. A communication line 524-2 is used to connect an exchanger 514-2 to a gateway 521-2, and an interface is a UNI. A telephone number “03-1111-2222” is applied to a terminal on the side of the gateway 521-2 of the communication line. <<Preparation of NNI Line Call Reception Transfer>> An owner of the telephone set 520 separates the telephone set 520 from the telephone line 517, and connects the telephone set to a communication line 528 connected to a media router 527 as a telephone set 530. A telephone number of the telephone set 530 is “03-5414-8510”. A user 532 of the telephone set 520 notifies to an acceptance 533 of the public switched telephone network, such a fact that the telephone set 520 is positionally switched to the position of the telephone set 530 (Step H01 of FIG. 199). The acceptance 533 notifies a changed content via the communication line 534 to the exchanger 513 (Step H02). The exchanger 513 converts the gateway logic name #GW5211# into the signal station code “#1234” by using the stored information and causes a transfer processing unit 516 thereof to store thereinto a set of the telephone number “03-5414-8510” and the signal station code “#1234” of the transfer destination gateway 521-1 (Step H03). <<NNI Line Call Reception Transfer>> When a telephone call is issued from the telephone set 510 having the telephone number “047-325-3897” to the destination telephone number “03-5414-8510” (Step H05), the exchanger 511 accepts this telephone call (Step H06). Next, the exchanger 511 executes such a procedure that a telephone call is issued from the exchanger 511 via the communication line 512 to another exchanger 513 so as to call the telephone set 520 (Step H08). The exchanger 513 finds out both the telephone number “03-5414-8510” and the signal station code “#1234” of the transfer destination gateway 521-1, which are previously stored in the transfer processing unit 516 (Step H09), and then notifies the acquired signal station code “#1234” to the exchanger 511 (Step H10). The exchanger 511 produces a signalling unit containing the destination telephone number “03-5414-8510” of the transfer destination at a message portion thereof, and transmits the signalling unit to a destination of the signal station code “#1234” as the address of the received gateway. Then, the signalling unit is reached via the exchanger 514-1 (Step H11) and the communication line 524-1 to the gateway 521-1 (Step H12). Thereafter, this signalling unit is transmitted via a router 525-1, a telephone administration server 525 (Step H15), a connection control line 524-5, a router 525-2, a connection control line 524-4, and a network node apparatus 523-2 (Step H16), and furthermore, a communication line 526, and then is reached to a media router 527 (Step H17). In the case that the media router 527 transmits a notification of a telephone call acceptance with respect to the telephone connection request along a direction opposite to the above-explained direction, the notification of the telephone call acceptance is reached via a network node apparatus 523-2 (Step H21) and further a telephone administration server 525 (Step H22) to the gateway 521-1 (Step H23). The telephone call acceptance is notified via the exchanger 514-1 (Step H25) to the exchanger 511 (Step H26). Next, when the media router 527 calls the telephone set 530 having the telephone number “03-5414-8510” via the communication line 528 (Step H28), the notification of the calling operation is sent to the telephone set 510 along a direction opposite to the above-explained direction, namely via the media router 527, the network node apparatus 523-2, the connection control line 524-4, the telephone administration server 525, the gateway 521-1, the exchanger 514-1, and the exchanger 511 to the call-issuing telephone set 510 (Steps H30 to H37). When the user of the telephone set 530 takes up the handset (off hook), the telephone set 530 notifies a response notification to the media router 527 (Step H40). Subsequently, similar to the above-explained operation, the response notification is notified via the media router 527, the network node apparatus 523-2, the connection control line 524-4, the telephone administration server 525, the gateway 521-1, the exchanger 514-1, the exchanger 511 to the telephone set 510 (Steps H41 to H47). The above-explained connection control data which is transmitted/received as the above Steps H11, H12, H15 so as to connect the telephone call will be referred to as an “IAM message”; and the connection control data used among the Steps H23, H25, H26 will be called as an ACM message; and the connection control data used among the Steps H33, H35, H36 will be called as a CPG message; and furthermore, the connection control data used among the Steps H43, H45, H46 will be called as an ANM message. In the telephone call connection phase, the above-explained message (IAM, ACM, CPG, ANM) do not pass through the network node apparatus 523-1. In other words, it is so featured that the above-explained messages are directly transmitted/received between the gateway 521-1 and the telephone administration server 525. As previously explained, the communication connection procedure between the telephone set 510 and the telephone set 530 can be completed, so that the voice (speech) communication can be established between the telephone set 510 and the telephone set 530. It should be noted that the voice transmitted from the telephone set 510 is reached via the exchanger 511, the exchanger 514-1, and the communication line 524-1 to the gateway 521-1. In this gateway 521-1, the analog voice is converted into digitalized voice. The digitalized voice is reached to the network node apparatus 523-1, the communication line 524-3, the router 525-2, the communication line 524-6 for the voice communication, the network node apparatus 523-1 and the media router 527. The media router 527 converts the reached digital voice into an analog voice signal which is delivered to the telephone set 530. Also, the speech transmitted from the telephone set 530 is transferred via a communication path along a reverse direction with respect to the above-explained communication path to the telephone set 510. When a telephone communication is ended, a telephone call release is sent from the telephone set 510 to the exchanger 511 (Step H50), and is then notified via the exchanger 514-1 (Step H51) to the gateway 521-1 (Step H53). The notification of the call release completion is sent out from the gateway 521-1 to the exchanger 511 (Steps H54 and H55). Next, the gateway 521-1 sends out the telephone call release which is acquired in the above-explained procedure via the IP transfer network 522 to the telephone set 530 (Steps H61 to H64). The notification of the call release completion is returned from the media router 527 to the gateway 521-1 (Step H65 to H67). The reason why the call release can be done along the reverse direction, namely from the telephone set 530 to the public switched telephone network 515 is already explained in other embodiments. The connection control data for the telephone call release defined at the Steps H51, H53, H61 will be referred to as an “REL message” whereas the connection control data defined at the Steps H67, H57, H55 will be referred to as an “RLC” message. While the process operations defined from the Steps H01 to H03 are not carried out, the owner 532 of the telephone set 520 notifies such a notice via the communication line 517 to the exchanger 513, and thereafter may switch the telephone set 520 to the position (the IP transfer network of which entrance is the gateway “GW5211”) of the telephone set 530 (Step H01X of FIG. 199). The notice implies that the telephone set 520 having the telephone number of “03-5414-8510” is switched to the position of the telephone set 530. Next, the exchanger 513 converts the gateway logic name “GW5211” into the signal station code “#1234” by using the stored information and may employ such a method that the set of the telephone number “03-5414-8510” and the signal station code “#1234” of the transfer destination gateway 521-1 is saved in the transfer processing unit 516 (Step H03X). With execution of the above-explained process operation, the description of the telephone call reception transfer operation via the NNI line is accomplished. Next, a description will be made of a telephone call reception transfer operation based upon UNI. <<Preparation of UNI Line Telephone Call Reception Transfer>> Referring now to FIG. 198 and FIG. 200, the UNI line telephone call reception transfer is described. An owner of the telephone set 520 separates the telephone set 520 from the telephone line 517, and connects the telephone set to a communication line 528 as a telephone set 530. A telephone number of the telephone set 530 is “03-5414-8510”. The user 532 of the telephone set 520 notifies to the acceptance 533 of the public switched telephone network, such a fact that the telephone set 520 is positionally switched to the position of the telephone set 530 (Step HO). The acceptance 533 notifies a changed content via the communication line 534 to the exchanger 513 (Step H02). The exchanger 513 causes a transfer processing unit 516 thereof to store thereinto a set of the telephone number “03-5414-8510” and a telephone number “03-1111-2222” which is applied to the termination unit on the side of the transfer destination gateway 521-2 of the communication 524-2 (Step H03-2). <<UNI Line Telephone Call Reception Transfer>> In this case, there is such a different point that while a exchanger 514-2 is employed instead of the exchanger 514-1, a gateway 521-2 may be employed instead of the gateway 521-1. Due to this reason, the control procedure of the terminal-to-terminal communication control between the exchanger 514-2 and the gateway 521-2 is realized by executing new process operations defined from a Step H12-2 and a Step H13-2, as will be explained. When a telephone call is issued from the telephone set 510 having the telephone number “047-325-3897” to the destination telephone number “03-5414-8510” (Step H05-2), the exchanger 511 receives the telephone call (Step H06-2). Next, the exchanger 511 issues a telephone call to the telephone set 520 via the communication line 512 to the exchanger 513 (Step H08-2). The exchanger 513 finds out both the telephone number “03-5414-8510” previously stored in the transfer processing unit 516 and the telephone number “03-1111-2222” applied to the termination unit of the input line 524-2 of the transfer destination gateway 521-2 (Step H03-2), and then notifies the acquired telephone number “03-1111-2222” to the exchanger 511 (Step H10-2). The exchanger 511 produces a final unit containing the above-explained transfer destination telephone number “03-5414-8510”, and then, transmits the signalling unit, while the received telephone number “03-1111-2222” of the input line of the gateway 521-2. Then, the signalling unit is reached to the exchanger 514-2 (Step H11-2). When a telephone connection request (SETUP) contained in the signalling unit is transmitted via the communication line 524-2 to the gateway 521-2 (Step H12-2), the gateway 521-2 notifies to the exchanger 514-2, such a fact that the telephone call connection request of the Step H12-2 is accepted (Step H12-3). Furthermore, the notification is reached via the telephone administration saver 525 (Step H15-2), the router 525-2, the connection control line 524-4, the network node apparatus 523-2 (Step H16-2), and the communication line 526 to the media router 527 (Step H17-2). When the media router 527 transmits a notification of a telephone call acceptance with respect to the telephone connection request along a direction opposite to the above-described direction, the notification of the telephone call reception is reached via the network node apparatus 523-2 (Step H21-2), the network node apparatus 523-1 (Step H23-2) to the gateway 521-2 (Step H24-2). The gateway 521-2 sends the telephone call acceptance via the exchanger 514-2 (Step H25-2) to the exchanger 511 (Step H26-2). Next, when the media router 527 calls the telephone set 530 having the telephone number “03-5414-8510” via the communication line 528 (Step H28-2), the notification of the calling operation is sent to the telephone set 510 along a direction opposite to the above-explained direction, namely via the media router 527 (Step H30-2), the network node apparatus 523-2 (Step H31-2), the telephone administration server 525 (Step H32-2), the network node apparatus (Step H33-2) the gateway 521-2 (Step H34-2), the exchanger 514-2 (Step H35-2), and the exchanger 511 (Step H36-2) to the call-issuing telephone set 510 (Step H37-2). When the user of the telephone set 530 takes up the handset (off hook), the telephone set 530 notifies a response notification to the media router 527 (Step H40-2). Subsequently, similar to the above-explained operation, the response notification is notified via the media router 527, the network node apparatus 523-2, the telephone administration server 525, the network node apparatus 523-1, the gateway 521-2, the exchangers and 514-2 and 511 to the telephone set 510 (Steps H41-1 to H47-2). In the telephone call connection phase, the message is transmitted/received via the network node apparatus 523-1 for the connection phase established between the gateway 521-2 and the telephone administration server 525. As previously explained, the communication connection procedure can be completed between the telephone set 510 and the telephone set 530, so that the voice communication can be established between the telephone set 510 and the telephone set 530. <<Communication Phase and Release Phase>> Both a telephone communication phase and a release phase are similar to those of the above-explained case as to the NNI line call reception transfer operation, but own the following different point that while the exchanger 514-2 is employed instead of the exchanger 514-1, the gateway 521-2 is used instead of the gateway 521-1 (Steps H50-2 to H53-2, H54-2 to H55-2, H60-2 to H63-2, H65-2 to H68-2). Another Embodiment of Call Reception Transfer Via UNI A description is made with reference to FIG. 198 and FIG. 201. The owner of the telephone set 520 disconnects the telephone set 520 from the telephone line 517, and connects the telephone set to the communication line connected to the media router 527 as the telephone set 530. The preparation is similar to the above-explained preparation for the UNI line call reception transfer of the above embodiment. <<UNI Line Call Reception Transfer>> In this embodiment, the UNI line call reception transfer operation is featured by that both the exchanger 511 and the exchanger 514-2 transmit/receive a connection controlling message via a exchanger 513, which is explained as follows: When a telephone call is issued form the telephone set 510 having the telephone number “047-325-3897” to the destination telephone number “03-5414-8510” (Step H05-3), the exchanger 511 accepts the telephone call (Step H06-3). Next, the exchanger 511 executes such a procedure that a telephone call is issued from the exchanger 511 via the communication line 512 to another exchanger 513 so as to call the telephone set 520 (Step H08-3). The exchanger 513 finds out both the telephone number “03-5414-8510” which is previously stored in the transfer processing unit 516, and also the telephone number “03-1111-2222” which is applied to the termination unit of the input line 524-2 of the transfer destination gateway 521-2 (Step H09-3). Subsequently, the exchanger 511 produces a signalling unit containing the destination telephone number “03-5414-8510” of the transfer destination, and transmits the signalling unit, while the telephone number “03-1111-2222” of the input line of the gateway 521-2 is used as the destination. The signalling unit is reached to the exchanger 514-2 (Step H11-3). When the telephone connection request (SETUP) contained in the signalling unit is sent via the communication line 524-2 to the gateway 521-2 (Step H12-3), the gateway 521-2 notifies the acceptance of the telephone call connection request of the previous Steps H12-3 to the exchanger 514-2 (Step H13-3). Furthermore, the signalling unit is transmitted via the network node apparatus 523-1 (Step H14-3), a router 525-2, a telephone administration server 525 (Step H15-3), a connection control line 524-4, the router 525-2, and a network node apparatus 523-2 (Step H16-3), and furthermore, a communication line 526, and then is reached to a media router 527 (Step H17-3). In the case that the media router 527 transmits a notification of a telephone call acceptance with respect to the telephone connection request along a direction opposite to the above-explained direction, the notification of the telephone call acceptance is reached via the network node apparatus 523-2 (Step H21-3) and a telephone administration server 525 (Step H22-3), and the network node apparatus 523-1 (Step H23-3) to the gateway 521-2 (Step H24-3). The gateway 521-2 notifies the telephone call acceptance via the exchanger 514-2 (Step H25-3) and the exchanger 513 (Step H26-3) to the exchanger 511 (Step H27-3). Next, when the media router 527 calls the telephone set 530 having the telephone number “03-5414-8510” via the communication line 528 (Step H28-3), the notification of the calling operation is sent to the telephone set 510 along a direction opposite to the above-explained direction, namely via the media router 527 (Step H30-3), the network node apparatus 523-2 (Step H31-3), the telephone administration server 525 (Step H32-3), the network node apparatus 523-1 (Step H33-3), the gateway 521-2 (Step H34-3), the exchanger 514-2 (Step H35-3) and the exchanger 513 (Step H36-3), and also the exchanger 511 to the call-issuing telephone set 510 (Step H38-3). When the user of the telephone set 530 takes up the handset (off hook), the telephone set 530 notifies a response notification to the media router 527 (Step H40-3). Subsequently, similar to the above-explained operation, this response notification is notified via the media router 527, the network node apparatus 523-2 the telephone administration server 525, the network node apparatus 523-1, the gateway 521-1, the exchanger 514-2, the exchanger 513, the exchanger 511 to the telephone set 510 (Steps H41-3 to H48-3). While the above-explained process operations are carried out, the communication connection procedure between the telephone set 510 and the telephone set 530 is completed. <<Communication Phase and Release Phase>> Both a communication phase and a release phase are similar to those of the above-explained UNI line call reception transfer operation, but owns a different point that the exchanger 511 and the exchanger 514-2 transmit/receive the connection calling message via the exchanger 513. Based upon the above-explained principle idea, the analog telephone set 510 connected to the public switched telephone network 515 can establish the terminal-to-terminal communication with respect to the analog telephone set 530 which is connected to the media router 527 having the telephone number “03-5414-8510” used in the public switched telephone network via the IP transfer network 522. As previously explained in another embodiment, the media router may be installed inside the LAN. Due to this reason, while the telephone set having the telephone number “03-5414-8510” employed in the public switched telephone network is connected to the media router inside the LAN, the terminal-to-terminal communication can be established from the analog telephone set 510 connected to the public switched telephone network 515 via the IP transfer network 522 to the analog telephone set having the telephone number “03-5414-8510” provided inside the LAN. 12, 12th Embodiment in which Telephone Transfer Operation is Performed from Public Telephone Network <<Preparation>> In FIG. 202, reference numeral 540 shows an IP transfer network, reference numerals 541 to 545 show network node apparatus, reference numerals 546-1 to 546-5 represent relay apparatus (router), reference numerals 550 and 554 indicate “gateway containing line information”, and reference numerals 515, 552, 553 show gateways. These network node apparatus, relay apparatus, and gateways are directly connected via communication lines having each IP packet transfer functions to each other, or are indirectly connected via the relay apparatus to each other. Reference numerals 555 to 556 indicate public switched telephone networks (PSTN), reference numerals 557 to 566 are exchangers, reference numerals 570 to 573 are telephone sets, reference numerals 597 and 598 show telephone sets, reference numerals 576 to 578 show communication lines having network/network interface (NNI), reference numerals 580 to 581 indicate communication lines having user network interfaces (UNI), and reference numeral 583 represents a communication line having an IP packet transfer function. Reference numerals 584 and 585 indicate IP transfer network input line tables, and reference numerals 586 to 590 show IP transfer network output line tables. Reference numeral 591 shows a media router. Reference numerals 593 to 594 indicate telephone number servers which are connected via a communication line to either the router 546-1 or the router 546-3. The signal station code to discriminate from public switched telephone network side and the IP address to discriminate from IP transfer network side are respectively applied to the gateways 550 and 554 to be connected with the NNI communication line This embodiment is such an example that a communication enterprise identification code “00XY” is applied to the gateway 550 containing the line information, and a communication enterprise identification code “00UV” is applied to the gateway 554 containing the line information. A signal station code “#2222” is applied to the gateway 551, and a telephone number “03-4444-4000” is applied to an inlet of the communication line 508 of the gateway 552. The telephone number servers 593 to 594 owns such a function that when a telephone number is indicated, an IP address of a gateway having the telephone number, or an IP address of a media router (MR) having the telephone number is responded. The IP transfer network output line tables 586 to 590 contain IP address information corresponding to all of the telephone numbers owned by the gateways and the media routers. A telephone number of the telephone set 570 is “03-1111-2222”, a telephone number of the telephone set 571 is “06-3333-4444”, and a telephone number of the telephone set 572 is “092-555-6666”. A telephone number of the telephone set 597 is “07-3333-4444”, and a telephone number of the telephone set 598 is “093-555-6666”. These telephone sets are connected via the communication lines to the exchanger of either the public switched telephone network 555 or 556. The telephone set 573 owns a telephone number of “045-777-8888”, and is connected to the media router 591 via the communication line. FIG. 203 represents a content (example) of the IP transfer network input line table 584, and also shows the following fact. That is, in the case of a record on a first row, a segment of a gateway is “NNI”, and also a signal station code of the gateway is “#2222”. The gateway is used to connect a communication line to such a telephone set that a range of a destination telephone number is defined from “06-0000-0000” to “06-9999-9999”. In this case, the gateway becomes 551. In the case of a fifth row, a similar condition is set. Also, in the case of a record on a second row, a segment of a gateway is “UNI”. The gateway is used to connect a communication line to such a telephone set that a range of a destination telephone number is defined from “092-0000-0000” to “092-9999-9999”. The telephone numbers connected to the gateway are present within a range defined from “03-4444-4000” to “03-4444-4099”. In this case, the gateway becomes 552. Both a record on a third row and a record on a fourth row are similar conditions. A content of the IP transfer network input line table 585 contains a similar content to that of the IP transfer network input line table 584. FIG. 204 shows a content (example) of the IP transfer network output line table 586. In the case of a record on a first row, the table 586 shows such a fact that either a gateway (GW) or a media router (MR) is connected to an IP transfer network, and an IP address of the gateway, or the media router is “10.240.240.1” to “10.240.240.255”. The gateway, or the media router is employed so as to connect a communication line to a telephone set whose destination telephone number range is defined from “06-0000-0000” to “06-9999-9999”. A record on a second row is a similar content. Contents of the IP transfer network output line tables 587 to 590 contain same sorts of information owned by the IP transfer network output line table 586. <<No. 1-Communication Connection Control Between Telephone Sets>> FIG. 202 shows an example in which a telephone connection is made from the telephone set 570 having a telephone number of “03-1111-2222” as a transmission source to the telephone set 571 having a telephone number of “06-3333-4444” as a destination. In FIG. 205, reference numeral 590-1 shows a telephone connection made inside the public switched telephone network 555, reference numeral 590-2 indicates a telephone connection made inside the IP transfer network 540, and reference numeral 590-3 represents a telephone connection made inside the public switched telephone network 556. Referring now to FIG. 205 and FIG. 206, the telephone connections will be described. When the telephone set 570 dials “00XY-06-3333-4444” to make a telephone call (Step J01 of FIG. 205), the exchanger 557 confirms the telephone call (Step J02). While the exchanger 557 employs the communication enterprise identification code “00XY” contained in the dialed information, the exchanger 557 finds out such a exchanger 558 which is connected to the gateway 550 containing the line information to which “00XY” is applied. Then, the exchanger 557 transmits to the exchanger 558, both the transmission source telephone numbers “03-1111-2222” and “00XY-06-3333-4444”, which are acquired during the dialing operation (Step J03). Then, the exchanger 558 transmits both the transmission source telephone number “03-1111-2222” and the destination telephone number “06-3333-4444” to the gateway 550 containing the line information (Step J04). Referring to the IP transfer network input line table 584 within the gateway 550 containing the line information, the gateway 550 containing the line information owns the NNI interface, while the telephone number of the destination telephone set is used as a parameter, namely access information to such a gateway for connecting a communication line to the telephone set whose destination telephone set is “06-3333-4444”. Also, the gateway 550 knows such a fact that a signal station code of a gateway functioning as a signal station is “#2222”, and returns to the exchanger 558 (Step J05). Next, the exchanger 558 seeks a exchanger which is connected to such a gateway whose signal station code is “#2222”, namely finds out the exchanger 559 in this case, and transfers to the exchanger 559, such information containing the signal station code “#2222” functioning as the access information to the gateway and acquired in the above procedure, the transmission source telephone number “03-1111-2222”, and the destination telephone number “06-3333-4444” (Step J06). The exchanger 559 transfers the transmission source telephone number “03-1111-2222”, the destination telephone number “06-3333-4444” to the gateway 551 whose signal station code is “#2222” via the NNI communication line 557 (Step J07). The gateway 551 produces an IP packet containing both the transmission source telephone number “03-1111-2222” and the destination telephone number “06-3333-4444”, which are acquired in the above-described procedure. A transmission source IP address of the IP packet is equal to an IP address applied to the gateway 551 (namely, gateway 551 knows own IP address), and a destination IP address of the IP packet is equal to an IP address of a communication counter party to which a communication line is connected, namely, the IP address “10.240.240.1” of the gateway 554 in this case. While the telephone number of the destination telephone set is employed as a parameter from the IP transfer network output line table 586 (FIG. 204) provided inside the gateway 551, one of the IP addresses “10.240.240.1” corresponding to the destination telephone number “06-3333-4444”. Instead of the above-explained finding procedure that the gateway 551 finds out the IP address of the gateway 554, the gateway 551 may transmit an “inquiry IP packet” to the telephone number server 593, and thereafter may receive a response from the telephone number server 593 to employ the response (optional procedure). The inquiry IP packet is to inquire an IP address of a gateway used to be connected to the telephone set having the destination telephone number “06-3333-4444”. Among the above-explained functions of the exchangers, at the Step “J04” and the Step “J05”, a message of a common circuit signal system/transaction function unit of a telephone switching network may be employed. The IP packet produced in the above-described manner is sent out from the gateway 551 via the router 546-1 and the telephone administration server 549-1 (Step J08), via the router 546-1, the router 546-5, and the telephone administration server 549-5 (Step J09), via the router 546-5, and the gateway 554 (Step J10), and also via the NNI communication line 578 to the exchanger 562 (Step J11). The above-described IP packet contains the transmission source telephone number “03-1111-2222” and the destination telephone number “06-3333-4444”. Subsequently, a call setting request which contains the transmission source telephone number “03-1111-2222” and the destination telephone number “06-3333-4444” is transferred to the exchanger 561 (Step J12). The exchanger 561 which receives the call setting request returns a confirmation notification of the call setting request to the exchanger 557 (Step J14 to Step J20). Next, when the exchanger 561 calls the telephone set 571 (Step J13) and the telephone set 571 returns a calling operation to the exchanger 561 (Step J22), the exchanger 561 notifies the calling operation of the destination telephone set 571 to the transmission source telephone set 570 (Step J23 to Step J30). When the telephone set 571 is taken up (off hook), such an IP packet indicative of a telephone communication commencement is notified to the transmission source telephone set 570 (Step J32 to Step J40), so that the telephone communication is commenced. As previously described, the procedure of the terminal-to-terminal communication connection control established between the telephone set 570 and the telephone set 571 is accomplished, so that the telephone communication can be carried out between the telephone set 570 and the telephone set 571. When the telephone communication is ended, a telephone call release notification is transmitted to the exchanger 557 (Step J42 of FIG. 206), and then, a call release completion notification is returned from the exchanger 557 to the telephone set 570 (Step J43). Subsequently, releasing of the communication connection is performed in such a manner that the call release notification and the call release completion notification are sequentially transmitted/received among the exchanger 557, the exchanger 559, the gateway 551, the telephone administration server 549-1, the telephone administration server 549-5, the gateway 554, the exchanger 562, the exchanger 561 and the telephone set 571 (Steps J44 to J59). The control data which are transmitted/received by the exchangers and the telephone administration server at the steps correspond to the connection control messages of the common line signals. For instance, the Steps J09, J17, J26, J36, J50 and J51 correspond to the IAM message, the ACM message, the CPG message, the ANM message, the REL message and the RLC message. The above-explained “No. 1-Communication Connection Control between Telephone Sets” will now be summarized as follows: That is, this control method corresponds to such a communication control method between two telephone sets, in which while the IP transfer network is used as the relay network, the IP transfer network is connected to the public switched telephone network. The transmission source telephone set issues the telephone call by employing the transmission source telephone number, the communication enterprise identification code, and the destination telephone number. In the IP transfer network-sided gateway specified by the communication enterprise code, the transmission source telephone set acquires the signal station code of the input gateway used to be connected to the IP transfer network with reference to “input line table provided inside IP transfer network”. In the input gateway, while using the destination telephone number as the parameter, the transmission source telephone set acquires the IP address of the output gateway used to connect the communication line from the IP transfer network to the public switched telephone network with reference to “output line table provided outside IP transfer network” within this input gateway. Then, the transmission source telephone set transfers the IP packet containing the transmission source telephone number and the destination telephone number to the output gateway toward the acquired IP address. IN the output gateway, the telephone call is issued to the public switched telephone network based upon both the transmission source telephone number and the destination telephone number contained in the received IP packet, and is transferred via the exchanger to the destination telephone set. As the another control method, “output line information provided inside IP transfer network” is inquired to the telephone number server, and then, the telephone number server responds. The “input line information provided inside IP transfer network” corresponds to the signal station code of the gateway having the NNI communication line outside the IP transfer network. The “output line information provided outside IP transfer network” corresponds to the IP address to the gateway having the NNI communication line outside the IP transfer network. <<No. 2-Communication Connection Control Between Telephone Sets>> Referring now to FIG. 207 and FIG. 208, a communication connection control No. 2 will be described. This is such an example that a telephone connection is made from the transmission source telephone set 570 having the telephone number of “03-1111-2222” to the destination telephone set 572 having the telephone number of “092-555-6666”. When the telephone set 570 dials “00XY-092-555-6666” to request a telephone connection (Step K01 of FIG. 207), the exchanger 557 sends a response (Step K02). While the exchanger 557 employs the communication enterprise identification code “00XY” contained in the dialed information, the exchanger 557 finds out such a exchanger 558 which is connected to the gateway 550 containing the line information to which “00XY” is applied. Then, the exchanger 557 transmits to the exchanger 558, both the transmission source telephone numbers “03-1111-2222” and “00XY-092-555-6666”, which are acquired during the dialing operation (Step K03). Then, the exchanger 558 transmits both the transmission source telephone number 03-1111-2222” and the destination telephone number “092-555-6666” to the gateway 550 containing the line information (Step K04). Referring to the IP transfer network input line table 584 within the gateway 550 containing the line information, the gateway 550 containing the line information finds out one telephone number “03-4444-4000” as access information, and then notifies the found telephone number to the exchanger 558 (Step K05). This access information is used for the gateway for connecting the communication line to such a telephone set whose destination telephone number is “092-555-6666”. Next, the exchanger 558 seeks such an exchanger connected to the gateway telephone number “03-4444-4000”, namely, finds out the exchanger 560 in this case. Then, the exchanger 558 transfers to the exchanger 560, such information containing the telephone number “03-4444-4000” functioning as the access information to the gateway and acquired in the above procedure, the transmission source telephone number “03-1111-2222”, and the destination telephone number “092-555-6660”. The exchanger 560 transfers both the transmission source telephone number “03-1111-2222” and the destination telephone number “092-555-6666” via the UNI communication line 580 to the gateway 552 to which the telephone number “03-4444-4000” is applied (Step K07). The gateway 552 reports to the exchanger 560, such a fact that these two telephone numbers are received (Step K08). Upon receipt of the above-explained information, the gateway 552 retrieves the IP transfer network output line table 587 of FIG. 204, and also acquires an IP address of a gateway functioning as a communication counter party used to connect a communication line, namely the IP address “10.240.241.1” of the gateway 553 in this case, while the destination telephone number “092-555-6666” is used as a parameter. The gateway 552 produces an IP packet containing both the transmission source telephone number “03-1111-2222” and the destination telephone number “092-555-6666”, which are acquired in the above-described procedure. A transmission source IP address of the produced IP packet is equal to an IP address applied to the gateway 552 (namely, gateway 552 knows own IP address), and a destination IP address of the IP packet is equal to the acquired IP address “10.240.240.1” of the gateway 553 in this case. It should be noted that in the above-explained procedure in which the gateway 552 finds out the IP address of the gateway 553, the gateway 552 may send an “inquiry IP packet” to the telephone number server 594 (Step KK1 of FIG. 207), and the inquiry IP packet inquires the value of the IP address of the gateway 553 by indicating the destination telephone number “092-555-6666”. Then, the gateway 552 may receive a response from the telephone number server 594 (Step KK2 of FIG. 207). Alternatively, while the content of the telephone number server 594 is previously transferred to the internal unit of the gateway 552, the gateway 552 may use the transferred content as the IP transfer network output line table (note that the Steps KK1 and KK2 are optional steps). Next, the IP packet which is formed and then is sent out from the gateway 552 is reached via the network node apparatus 543, the router 546-2 and the telephone management server 549-2 (Step K09), via the router 546-3, the router 546-4 and the telephone administration server 549-4 (Step K10), and via the network node apparatus 545 to the gateway 553 (Step K11). Next, the gateway 553 notifies such information via the UNI communication line 581 to the exchanger 563 (Step K12). The information contains the transmission source telephone number “03-1111-2222” and the destination telephone number “092-555-6666”. The exchanger 563 returns such a fact that these two telephone numbers are received to the gateway 553 (Step K13). The exchanger 563 transfers a call setting request which contains the transmission source telephone number “03-1111-2222” and the destination telephone number “092-555-6666” to the exchanger 564 (Step K14). The exchanger 564 returns such a fact that the above-explained call setting request is received to the exchanger 557 (Step K16 to Step K22). Next, the exchanger 564 calls the telephone set 572 (Step K15), and the telephone set 572 notifies the calling operation to the exchanger 564 (Step K24). The exchanger 564 notifies the calling operation of the destination telephone set 572 to the transmission source telephone set 570 (Step K25 to Step K32). When the telephone set 572 is taken up (off hook) (Step K33), such a notification indicative of a telephone communication commencement is notified to the transmission source telephone set 570 (Step K35 to Step K42), so that the telephone communication is commenced. As previously described, the procedure of the terminal-to-terminal communication connection control established between the telephone set 570 and the telephone set 572 is accomplished, so that the telephone communication can be carried out between the telephone set 570 and the telephone set 572. When the telephone communication is ended, a telephone call release notification is transmitted from the telephone set 570 to the exchanger 557 (Step K44 of FIG. 208), and then, a call release completion notification is returned from the exchanger 557 to the telephone set 570 (Step K45). Since the call release is notified and the call release completion is notified, the connection between the telephone set 570 and the exchanger 557 is released. Subsequently, releasing of the communication connection is performed in such a manner that the call release notification and the call release completion notification are sequentially transmitted/received among the exchanger 557, the exchanger 560, the gateway 552, the telephone administration server 549-2, the telephone administration server 549-4, the gateway 553, the exchanger 563, the exchanger 564 and the telephone set 572 (Steps K46 to K61). The above-explained “No. 2-Communication Connection Control between Telephone Sets” will now be summarized. That is, this control method is such a terminal-to-terminal communication connection control method in which the telephone communication is made from one telephone set connected to the public switched telephone network via the IP transfer network to another telephone set connected to the public switched telephone network. The second connection control method is similar to the above-explained first connection control method. A major different point is given as follows. The “input line information provided inside IP transfer network” corresponds to the telephone number of the gateway having the UNI communication line outside the IP transfer network. The “output line information provided outside IP transfer network” corresponds to the IP address to the gateway having the UNI communication line outside the IP transfer network. <<No. 3-Communication Connection Control Between Telephone Sets>> This is such an example that a telephone connection is made from the transmission source telephone set 570 having the telephone number of “03-1111-2222” to the destination telephone set 598 having the telephone number of “093-555-6666”. In this example, when the telephone set 570 dials “00XY-093-555-6666” so as to request a telephone connection and also the exchanger 558 issues a request to the gateway 550 containing the line information, the IP transfer network input line table 584 is employed in the gateway 550. The exchanger 558 acquires a signal station code “#2222” as the access information to the gateway used to connect the communication line to the telephone set whose destination telephone number is “093-555-6666”. In this case, the exchanger 559 is connected to the gateway 551 via the NNI communication line 577. Next, the gateway 551 inquires either the IP transfer network output line table 586 or the telephone number server 593, which is provided inside the gateway 551 so as to acquire the IP address of the gateway 553 used to connect the communication line to such a telephone set whose destination telephone number is “093-555-6666”, and then forms an IP packet containing both the transmission source telephone number “03-1111-2222” and the destination telephone number “093-555-6666”. This formed IP packet is sent out from the gateway 551, and then is reached via the router 546-1, the telephone management server 549-1, the router 546-1, the router 546-5, the telephone management server 549-5, the router 546-5, and the network node apparatus 545 to the gateway 553. Subsequently, terminal-to-terminal connection information is reached via the exchanger 563 and the exchanger 566 to the telephone set 598, so that the terminal-to-terminal communication connection control between the telephone set 570 and the telephone set 598 is completed. The terminal-to-terminal connection information contains both the transmission source telephone number “03-1111-2222” and the destination telephone number “093-555-6666”, which are acquired from the IP packet. As previously described, this third connection control method is similar to the above-explained first connection control method. A major different point is given as follows. The “input line information provided inside IP transfer network” corresponds to the signal station code of the gateway having the NNI communication line outside the IP transfer network. The “output line information provided outside IP transfer network” corresponds to the IP address to the gateway having the UNI communication line outside the IP transfer network. <<No. 4-Communication Connection Control Between Telephone Sets>> This is such an example that a telephone connection is made from the transmission source telephone set 570 having the telephone number of “03-1111-2222” to the destination telephone set 597 having the telephone number of “07-3333-4444”. In this example, when the telephone set 570 dials “00XY-07-3333-4444” so as to request a telephone connection and also the exchanger 558 issues a request to the gateway 550 containing the line information, the IP transfer network input line table 584 is employed in the gateway 550. The exchanger 558 acquires the telephone number “03-4444-4000” as the access information to the gateway used to connect the communication line to the telephone set whose destination telephone number is “07-3333-4444”. Next, the gateway 552 inquires either the IP transfer network output line table 587 or the telephone number server 594, which is provided inside the gateway 552 so as to acquire the IP address of the gateway 554 used to connect the communication line to such a telephone set whose destination telephone number is “07-3333-4444”, and then forms an IP packet containing both the transmission source telephone number “03-1111-2222” and the destination telephone number “07-3333-4444”. This formed IP packet is sent out from the gateway 552, and then is reached via the network node apparatus 543, the router 546-2, the telephone administration server 549-2, the router 546-2, the router 546-1, the router 546-5, the telephone administration server 549-5 and the router 546-5 to the gateway 554. Subsequently, terminal-to-terminal connection information is reached via the exchanger 562 and the exchanger 565 to the telephone set 597, so that the terminal-to-terminal communication connection control between the telephone set 570 and the telephone set 597 is completed. The terminal-to-terminal connection information contains both the transmission source telephone number “03-1111-2222” and the destination telephone number “07-3333-4444”, which are acquired from the IP packet. As previously described, this fourth connection control method is similar to the above explained first connection control method. A major different point is given as follows. The “input line information provided inside IP transfer network” corresponds to the telephone number of the gateway having the UNI communication line outside the IP transfer network. The “output line information provided outside IP transfer network” corresponds to the IP address to the gateway having the NNI communication line outside the IP transfer network. <<No. 5-Communication Connection Control Between Telephone Sets>> This is such an example that a telephone connection is made from a transmission source telephone set 570 having a telephone number of “03-1111-2222” to a telephone set 573 (note that telephone number of the telephone is “045-777-8888”) connected to the media router 591. When the telephone set 570 dials “00XY-045-777-8888” to request a telephone connection (Step L01 of FIG. 209), the exchanger 557 responds the telephone call (Step L02). While the exchanger 557 employs the communication enterprise identification code “00XY” contained in the dialed information, the exchanger 557 finds out such a exchanger 558 which is connected to the gateway 550 containing the line information to which “00XY” is applied. Then, the exchanger 557 transmits to the exchanger 558, both the transmission source telephone numbers “03-1111-2222” and “00XY-045-777-8888”, which are acquired during the dialing operation (Step L03). The exchanger 558 transmits both the transmission source telephone number “03-1111-2222” and the destination telephone number “045-777-8888” to the gateway 550 containing the line information (Step L04). Referring to the IP transfer network input line table 584, the gateway 550 finds out one telephone number “03-4444-4000” as access information, and then notifies the found telephone number to the exchanger 558 (Step L05). The access information is used for the gateway for connecting the communication line to such a telephone set whose destination telephone number is “045-777-8888”. Next, the exchanger 558 seeks such an exchanger connected to the gateway telephone number “03-4444-4000”. Then, the exchanger 558 transfers to the exchanger 560, such information containing the telephone number “03-4444-4000” acquired in the above procedure, the transmission source telephone number “03-1111-2222”, and the destination telephone number “045-777-8888” (Step L06). The exchanger 560 transfers both the transmission source telephone number “03-1111-2222” and the destination telephone number “045-777-8888” via the communication line 580 to the gateway 552 to which the telephone number “03-4444-4000” is applied (Step L07). The gateway 552 returns such a fact that this gateway receives at least two telephone numbers to the exchanger 560 (Step L08). Next, the gateway 552 produces an IP packet containing both the transmission source telephone number “03-1111-2222” and the destination telephone number “045-777-8888”, which are acquired by the above-explained communication control. A transmission source IP address of the IP packet is equal to an IP address applied to the gateway 552 (namely, gateway 552 knows own IP address), and a destination IP address of the IP packet is equal to an IP address of a communication counter party to which a communication line is connected, namely, the IP address “10.241.1.1” of the media router 591 in this case. The destination telephone number “045-777-8888” is found out as a parameter from the IP transfer network output line table 587. The IP packet of telephone call connection request produced in the above-described manner is sent out from the gateway 552 via the network node apparatus 543, the router 546-2 and the telephone administration server 549-2, via the router 546-2, the router 546-3 and the telephone administration server 549-3 via the router 546-3, and the network node apparatus 544 to the media router (Steps L10 to L16). The media router 591 returns the reception of the telephone call connection request to the exchanger 557 (Step L20 to Step L25). Furthermore, the media router 591 calls the telephone sets 573 (Step L18). When the telephone set sends a response (Step L27), the media router 591 notifies the transmission source telephone set 570 that it is calling telephone set (Step L29 to Step L35). When the telephone set 573 is taken up (off hook) (Step L36), a response indicative of a telephone communication commencement is notified to the transmission source telephone set 570 (Step L38 to Step L44), so that the telephone communication is commenced. As previously described, the procedure of the terminal-to-terminal communication connection control established between the telephone set 570 and the telephone set 573 is accomplished, so that the telephone communication can be carried out between the telephone set 570 and the telephone set 573. When the telephone communication is ended, a telephone call release notification is transmitted from the telephone set 570 to the exchanger 557 (Step L45), and then, a call release completion notification is returned from the exchanger 557 to the telephone set 570 (Step L46). Both the notification of the call release and the notification of the call release completion are issued, so that the connection between the telephone set 570 and the exchanger 557 is released. Subsequently, releasing of the communication connection is performed in such a manner that the call release notification and the call release completion notification are sequentially transmitted/received among the exchanger 557, the exchanger 560, the gateway 552, the telephone administration server 549-3, the telephone administration server 549-3, the media router 591 and the telephone set 573 (Steps L47 to L60). The above-described “No. 5-Communication Connection Control between Telephone Sets” is similar to the previously explained “No. 1-Communication Connection Control between Telephone Sets”, and then, own the following major comparison point: That is, a telephone connection destination corresponds to such a telephone set connected to a media router. <<No. 6-Communication Connection Control Between Telephone Sets>. Referring now to FIG. 210, this sixth communication connection control between telephone sets will be explained. Reference numeral 550-1 and 554-1 show gateways, reference numeral 540-1 indicates an IP transfer network, and reference numeral 1000 indicates an “input line information server”. The same reference numerals shown in FIG. 202 will be employed as those for denoting the same, or similar apparatus, telephone sets, public switched telephone networks and other apparatus of this control method. This embodiment is featured by that instead of the gateway 550 containing the line information (shown in FIG. 202), the input line information server 1000 containing the IP transfer network input line table 584 is employed. Also, instead of the Steps J04 and J05 shown in FIG. 205, both a Step J04 x and a J05 x of FIG. 211 are employed. A communication enterprise identification code “00XY” dicriminatable from the public switched telephone network 555 and the signal station code to discriminate from the public switched telephone network 555 are applied to the input line information server 1000. FIG. 211 shows an example in which a telephone connection is made from the telephone set 570 having a telephone number of “03-1111-2222” as a transmission source to the telephone set 571 having a telephone number of “06-3333-4444” as a destination, which will be explained as follows with reference to FIG. 211. When the telephone set 570 dials “00XY-06-3333-4444” to make a telephone call (Step J01 of FIG. 211), the exchanger 557 confirms the telephone call (Step J02). While the exchanger 557 employs the communication enterprise identification code “00XY” contained in the dialed information, the exchanger 557 finds out such a exchanger 558 which is connected to the input line information server 1000 to which “00XY” is applied. Then, the exchanger 557 transmits to the exchanger 558, both the transmission source telephone numbers “03-1111-2222” and “00XY-06-3333-4444”, which acquired during the dialing operation (Step J03). Then, the exchanger 558 transmits both the transmission source telephone number “03-1111-2222” and the destination telephone number “06-3333-4444” to the input line information server 1000 (Step J04 x). Referring to the IP transfer network input line table 584 within the input line information server 1000, the gateway owns the NNI interface, while the telephone number of the destination telephone set is used as a parameter, namely access information to such a gateway for connecting a communication line to the telephone set whose destination telephone set is “06-3333-4444”. Also the input line information server 1000 knows such a fact that a signal station code of a gateway functioning as a signal station is “#2222”, and returns to the exchanger 558 (Step J05 x). Subsequently, since the process operations defined by the Steps J06 to J40 are carried out, the terminal-to-terminal communication connection control procedure between the telephone set 570 and the telephone set 571 is carried out, so that the telephone communication can be made between the telephone set 570 and the telephone set 571. Similarly, the telephone set 570 can execute the terminal-to-terminal communication connection control procedure with respect to the telephone sets 572, 597, 598 and 573. One Embodiment of Network Node Apparatus Referring now to FIG. 212, a description will be made of a network node apparatus employed in the above-described terminal-to-terminal communication connection control method. Reference numeral 540-1 is an IP transfer network, reference numerals 543-1 to 545-1 represents network node apparatus, reference numerals 552-1 and 554-1 show gateways, and also reference numerals 547-1 and 548-1 indicate relay apparatus, which are connected is communication lines to each other. An IP address “a” is applied to the gateway 552-1, and an IP address “b” is applied to the gateway 554-1. Furthermore, an IP address “x” is applied to a joint point between the network node apparatus 543-1 and a communication line provided on the side of the gateway 552-1, and an IP address y” is applied to a joint point between the network node apparatus 545-1 and a communication line provided on the side of the gateway 554-1. Referring numeral 543-1T shows an address administration table for holding the four sets of IP addresses “a”, “b”, “x” and “y”. Reference numeral 543-1T shows an address administration table for holding the four sets of IP addresses “a”, “b”, “y” and “x”. As to an IP packet PCK-1 which is transmitted from the gateway 552-1 to the gateway 554-1, a transmission source IP address thereof is “a”, and a destination IP address thereof is “b”. When the IP packet PCK-1 is reached to the network node apparatus 543-1, the address management tables 543-1T is considered. In this embodiment, since the three sets of front IP addresses “a”, “b”, “x” among the internal information “a”, “b”, “x”, “y” are made coincident with the three IP addresses contained in the IP packet PCK-1, another IP packet “y” contained inside the address administration table 543-1 and an IP capsulation operation for applying an IP header is carried out, so that a new IP packet PCK-2 is formed. The IP packet PCK-2 is transmitted from the network node apparatus 543-1 to a communication line, and then, is reached via the routers 547-1 and 548-1 to the network node apparatus 545-1. In this network node apparatus 545-1, an inverse-capsulation operation is carried out so as to remove the IP header which has been applied by the above-explained IP capsulation operation. As a result, an IP packet PCK-3 is restored, and then is sent via the communication line to the gateway 554-1. The address administration table 545-1T is used so as to transmit the IP packet along a direction opposite to the above-explained direction. Both the network node apparatus 543-1 and 545-1 own such a function capable of executing both as IP capsulation operation and an inverse-capsulation operation, and hold therein address administration tables for this purpose. The IP addresses of the gateways are featured to be registered/held in the address administration tables of the network node apparatus 543-1 and 545-1. Another Embodiment of Network Node Apparatus Referring now to FIG. 213, a description will be made of network node apparatus 543-2 and 545-2 employed in the above-described terminal-to-terminal communication connection control method, according to another embodiment. Reference numeral 540-2 is an IP transfer network, reference numerals 543-2 and 545-2 represent network node apparatus, reference numerals 552-2 and 554-2 show gateways, and also reference numerals 547-2 and 548-2 indicate relay apparatus, which are connected via communication lines to each other. An IP address “a” is applied to the gateway 552-2, and an IP address “b” is applied to the gateway 554-2. Reference numeral 543-2T shows an address administration table for holding the above-described IP addresses “a”, and reference numeral 545-2T shows an address administration table for holding the above-described IP addresses “b”. As to an IP packet PCK-11 which is transmitted from the gateway 552-2 to the gateway 554-2, a transmission source IP address thereof is “a”, and a destination IP address thereof is “b”. When the IP packet PCK-11 is reached to the network node apparatus 543-2, the address administration table 543-2T is considered. In this embodiment, since “a” of the internal information is made coincident with the transmission source IP address contained in the IP packet PCK-11, it can be understood that the IP packet PCK-11 is transferred into the IP transfer network 540. Next, the IP packet PCK-11 may be directly changed into an IP packet PCK-12. The IP packet PCK-12 is sent from the network node apparatus 543-2 to the communication line, and then is reached via the routers 547-2 and 548-2 to the network node apparatus 545-2. In this case, since the destination IP address “b” of the IP packet PCK-12 is recorded, in the address administration table 545-2T, the IP packet PCK-12 is directly sent as an IP packet PCK-13 via the communication line to the gateway 554-2. Both the network node apparatus 543-2 and 545-2 may confirm such a permission that the IP packet is accepted within the IP transfer network 540-2. Otherwise, both the network node apparatus 543-2 and 545-2 may confirm that the IP address “b” is present outside the IP transfer network 540-2. The IP addresses of the gateways are featured to be registered/held into the address administration tables employed in the network node apparatus 543-2 and 545-2. The above-explained functions of the network node apparatus are summarized as follows: That is, in this embodiment, there are two different types of the network node apparatus. When the IP packet is accepted from the external unit of the IP transfer network into the internal unit of the IP transfer network, one network node apparatus executes the IP capsulation operation to newly apply the IP header to the received IP packet, and another network node apparatus does not execute the IP capsulation operation. The IP addresses of the gateways are registered/held in the address administration tables of the network node apparatus. 13. 13th Embodiment in which Control Line and Voice Line are Separated from Each Other to be Connected to Public Switched Telephone Network A description is made of a method for controlling a telephone-to-telephone communication connection, in which a communication signal is transmitted via an IP transfer network and a public switched telephone network (PSTN), while a control communication line is separated from a voice (speech) communication line. In FIG. 214, reference numeral 1500 shows an IP transfer network, reference numeral 1501 represents a public switched telephone network, reference numeral 1502 shows a gateway equipped with a capsulation function, reference numeral 1503 represents a relay gateway, reference numerals 1508 and 1520 indicate telephone sets, reference numeral 1518 denotes a relay exchanger, reference numeral 1519 shows a subscriber exchanger, reference numeral 1505 represents a control communication line by the common line signal system, and reference numeral 1506 indicates a voice (speech) communication line. Also, reference numeral 1507 indicates a control IP communication line, and reference numeral 1509 shows a voice IP communication line. Also, reference numerals 1544 and 1547 show network node apparatus, reference numerals 1570 indicates a pilot telephone server, reference numeral 1571 shows a telephone administration server, reference numeral 1572 represents a telephone number server, reference numeral 1573 shows a table administration server, and reference numerals 1521, 1522, 1523, 1524 indicate routers. Further, reference numeral 1513 shows a relay control unit (STP), and reference numeral 1516 indicates a voice control unit. A portion of internal resources (namely, apparatus and servers) of the IP transfer network shown in FIG. 214 may be made in correspondence with a portion of the internal resources of the IP transfer network shown in FIG. 145 or FIG. 187. That is, a telephone set 1508, a media router 1560, a network node apparatus 1544, a pilot telephone server 1570, a telephone administration server 1571, a telephone number server 1572, a table administration server 1573, a network node apparatus 1547 correspond to the telephone set 1208, the media router 1201, the network node apparatus 1244, the pilot telephone server 1270, the telephone administration server 1271, the telephone number server 1272, the table administration server 1273 and the network node apparatus 1247, respectively. <<Function of Relay Control Unit>> In the present invention, a point provided in the common line signal system is expressed by a signal station, and a point code is represented by a “signal station address”. The relay control unit 1513 in the relay gateway 1503 is equal to a relay signal station (STP) of a common line signal system, as viewed form the public switched telephone network 1501, and a signal station address “PC-3” is applied to the relay signal station. The relay control unit 1513 manages a signal station address administration table 1527 (refer to FIG. 225). The relay control unit 1513 retrieves the signal station address administration table, and then can acquire a signal station address of a exchanger employed in the public telephone network 1501. The relay control unit 1513 determines a producing rule as same as the rule of the public switched telephone network 1501. The producing rule is to produce a line number “CIC-n” written in a signalling unit which is transmitted to an NNI communication line 1505, and is to produce a signal link selection “SLS-n”. The relay control unit 1513 is assigned an IP address “GW03” and converts various sorts of messages (namely, IAM, ACM, CPG, ANM, REL, RLC etc.) of telephone call controls stored in an IP packet transmitted from the control IP communication line 1507 into various sorts of messages (namely, IAM, ACM, CPG, ANM, REL, RLC etc.) stored in a signalling unit by the common signal line system, and then, transmits these converted messages to the control communication line 1505. Also, the relay control unit 1513 owns such a function having an opposite sense. That is, various sorts of telephone call control, which are stored in the signalling unit sent from the control communication line 1505 are converted into messages stored in the IP packet, and then, the converted message is transmitted to the control IP communication line 1507. The IP address “GW03” and the signal station code “PC-3” assigned to the relay control unit 1513 are also IP address and signal station code assigned to the relay control unit 1503. <<Function of Voice Control Unit>> The voice control unit converts voice stored in an IP packet transmitted from the voice IP communication line 1509 into a voice packet, and then transmits the voice frame to the voice communication line 1506. The voice frame is adapted to such a format of a frame which can be transferred within the public switched telephone network 1501, for instance, primary group interface (PRI, 23B+D) of the ISDN. Also, the voice control unit 1516 owns a function opposite to the above-explained function. That is, the voice control unit 1516 converts a voice frame sent from the voice communication line 1506 of the public switched telephone network 1501 into an IP frame format, and then transmits the converted IP frame to the voice IP communication line 1509. The voice control unit has an IP address used to transmit/receive a voice IP frame. The IP address is employed so as to set a media path connection table. <<Telephone Number Server>> When a telephone number is inquired to the telephone number server 1572, this telephone number server 1572 responds an IP address which is used to communicate a telephone set having the inquired telephone number. In such a case that a telephone communication destination correspond to a relay gateway, the telephone number server 1572 responds a value of an IP address applied to the relay gateway. In such a case that a telephone communication destination corresponds to a gateway equipped with a capsulation function, the telephone number server 1572 responds to an IP address of a media router connected to a destination of the gateway. <<Connection Phase>> This is such an example that a telephone communication is made from the telephone set 1508 to the telephone set 1520. In this embodiment, an IP address “EA81” of the pilot telephone server 1570 is opened to the user of the IP transfer network 1500, and the media router 1560 holds the IP address “EA81”. When the handset of the telephone set 1508 is taken up, a telephone call signal is transferred to the media router 1560 (Step N01 of FIG. 215), and the media router 1560 confirms telephone calling operation (Step N02). Next, the media router 1560 produces such an IP packet 1530 (refer to FIG. 216), and then, transmits the IP packet 1530 to the network node apparatus 1544 (Step N03), where a transmission source IP address is an IP address “EA1” of the media router 1560, and a destination IP address is an external IP address “EA81” of the pilot telephone server 1570. The IP packet 1530 contains a telephone number “TN-1” of the telephone set 1508 functioning as a transmission source, a telephone number “TN-2” of the telephone set 1520 functioning as a destination, a UDP port number “5006”, and additional information “Info-2”, which are employed in order to allow the telephone set 1508 functioning as the transmission source to transmit the telephone voice. A payload portion of the IP packet 1530 is a UDP packet, both the transmission source and the destination port number of which are equal to “5060”. The network node apparatus 1544 inputs the external IP packet 1530, and applies the IP capsulation operation (as previously explained in other embodiments) so as to form an internal IP packet 1531 (refer to FIG. 217), and then transmits the IP packet 1531 to the pilot telephone server 1570 whose internal IP address is equal to “IA81” (Step N04). Upon receipt of the IP packet 1531, the pilot telephone server 1570 produces such an IP packet 1532-1 (refer to FIG. 218) in which the IP addresses “EA1, IA1, EA81, IA81” contained in the IP packet 1531 are included in a payload portion thereof. Then, the pilot telephone server 1570 sends the IP packet 1532-1 to the telephone administration server 1571 (Step N05). In this case, the pilot telephone server 1570 uses the previously held IP address “IA91” of the telephone administration server 1571. <<Forming of CIC Administration Table>> The telephone administration server 1571 receives the IP packet 1532-1 and writes the below-mentioned items into a record of a CIC administration table managed by the telephone administration server 1571, namely, the IP address “IA91” of the telephone administration server 1571, the procedure segment “IAM”, the transmission source telephone number “TN-1”, the destination telephone number “TN-2”, both the external IP address “EA1” and the internal IP address “IA1” of the media router 1560, the voice communication port number “5006” provided in the IP packet 1532-1, both the external IP address “EA81” and the internal IP address “IA81” of the pilot telephone server 1570, the write time instant (year, months, day, hour, minute, second) “St-2” (see CIC administration table 1571-1 of FIG. 219). Next, the telephone administration server 1571 indicates an IP packet 1532-2 (refer to FIG. 220) for inquiring the destination telephone number “TN-2” to the telephone number 1572 (Step N06). The telephone number server 1572 stores an IP address “GW03” into an IP packet 1532-3 (refer to FIG. 221) and responds this IP packet (Step N07). The IP address “GW03” is related to apparatus and the like which are connected to the telephone set 1520. It should be noted that the apparatus and the like which are connected to the telephone set 1520 constitute the relay control unit 1513 in the relay gateway 1503 in this example. <<Administration of Line Number>> The telephone administration server 1571 adds the IP address “GW03” of the relay control unit 1513 acquired from the telephone number server 1572 into the CIC administration table 1571-1 (refer to FIG. 219). Further, the telephone administration server 1571 determines a CIC number “CIC-2” based upon the rule determined by the telephone administration server 1571 with respect to a set of the IP address “IA9” of the telephone administration server 1571 and the IP address “GW03” of the relay control unit 1513, and then writes the CIC number “CIC-2” into the CIC administration table. The condition is indicated in a record of a CIC administration table 1571-2 (refer to FIG. 222). Next, the telephone administration server 1571 produces an IP packet 1534 (refer to FIG. 223) (IAM packet) from the IP packet 1532-1 (refer to FIG. 218) with reference to the CIC administration table 1571-2 (refer to FIG. 222), and then transmits the IP packet 1534 to the relay control unit 1513 (Step N09). In this case, a destination IP address of the IP packet 1534 corresponds to the IP address “GW03” of the relay control unit 1513. <<Operation of Relay Control Unit>> Upon receipt of the IP packet 1534 (refer to FIG. 223) (Step N09), the relay control unit 1513 derives from the IP packet 1534, the transmission source IP address “IA91”, the destination IP address “GW03”, the line number “CIC-2”, the procedure segment “IAM”, the transmission source telephone number “TN-1”, the destination telephone number “TN-2”, both the external IP address “EA1” and the internal IP address “IA1” of the media router 1560, the voice communication port number “5006”, both the external IP address “EA81” and the internal IP address “IA81” of the pilot telephone server 1570. The relay control unit 1513 writes/records the derived items as a record of a CIC administration table 1513-1 (refer to FIG. 224) managed by the relay control unit 1513 in combination with a time instant “St-3”. Further, the relay control unit 1513 retrieves a signal station address administration table 1527 (refer to FIG. 225), indicates the telephone number “TN-2” of the destination telephone 1520, and acquires a signal station address “PC-19” of the exchanger 1519 for managing the telephone set 1520. Furthermore, the relay control unit 1513 determines both a CIC number “CIC-3” and a signal link selection “SLS-3” based upon such a rule which is previously defined with respect to the public switched telephone network 1501. The relay control unit 1513 writes the signal station address “PC-3” of the relay control unit 1513, the acquired “PC-19”, the signal link selection “SLS-3”, and the line number “CIC-3” as a new record of the address connection table 1525 in combination with a media path identifier “MP-7”. As a result, this address connection table becomes a table 1525-1 (refer to FIG. 226). Subsequently, the relay control unit 1513 produces a signalling unit 1535 which contains the signal station address “PC-3”, the acquired “PC-19”, the line number “CIC-3”, the signal link selection “SLS-3”, the message “IAM” required from the IP packet 1534, and the parameter “Para-2” (refer to FIG. 227), and then transmits this signalling unit 1535 to the control communication line 1505 (Step N10). <<Cooperation Between Relay Control Unit and Voice Control Unit>> The relay control unit 1513 notifies the media path identifier “MP-7”, internal IP address “IA1” for encapsulation (Step 1513-1 in FIG. 228), the external IP address “EA1” of the media router 1560, and the voice communication port number “5006” via the information line 1515 to the voice control unit 1516. The voice control unit 1516 writes the notified information as a record of the media path connection table 1528, and then reports the completion of the notified information writing operation (Step 1516-1). The media path identifier is used to discriminate voice communication path for telephone call. A record of a media path connection table 1528-1 (refer to FIG. 231) indicates such information before the writing operation, and a media path connection table 1528-2 (refer to FIG. 232) indicates a written result. It should be noted that the voice control unit 1516 determines a logic communication line used to transmit voice data from the voice control unit 1516 to the voice communication line 1506, and writes a logic communication line identifier “CH1” (namely, transmission channel indicated by Channel-S) thereof as a record of the media path connection table 1528-2. <<Operation of Switching Network and ACM Message>> The exchanger 1518 receives the signalling unit 1535 via the control communication line 1505 (Step N10), and thereafter transfers the signalling unit 1535 to the exchanger 1519 (Step N11). The exchanger 1519 receives the signalling unit 1535, and confirms as to whether or not the destination telephone “TN-2” contained in the signalling unit 1535 can be received. If the telephone call can be received, then the exchanger 1519 notifies a telephone reception notification to the telephone set 1520 (Step N12). Furthermore, the telephone set 1520 produces such a signalling unit 1538-1 (refer to FIG. 235) for notifying the reception of the signalling unit 1535 and returns the signalling unit 1538-1. The signalling unit is reached via the exchanger 1518 (Step N13) to the relay control unit 1513 (Step N14). The relay control unit 1513 acquires address information used to produce an IP packet based upon label information of the received signalling unit 1538-1, and then produces an IP packet 1551 (ACM message, refer to FIG. 236) and further sends the IP packet 1551 to the telephone administration server 1571 (Step N15). The telephone administration server 1571 derives both the line number “CIC-2” and the procedure segment “ACM” from the received IP packet 1551, and investigates the CIC administration table 1571-2 (refer to FIG. 222) held by the telephone administration server 1571 so as to find out such a record indicative of the own IP address “IA91”, the IP address “GW03” of the communication counter party, and the line number “CIC-2”. Then, the telephone administration server 1571 rewrites a procedure segment column of the relevant record of the CIC administration table 1571-2 into the above-explained procedure segment “ACM”. Next, the telephone administration server 1571 produces an IP packet which indicates that the ACM message is received, and notifies the IP packet to the media router 1560 (Steps N17, N18, N19). <<Media Path Connection Table>> After the process operation of the Step N10 has been completed, the relay control unit 1513 adds the media path identifier “MP-7” to the voice control unit 1516. Then, when the relay control unit 1513 requests both an IP address and a port number (Step 1513-2 in FIG. 228), the voice control unit 1516 answers the internal IP address “IA1” for capsulation, the transmission source IP address “EA3” of the IP packet and the port number “5008” of the UDP packet to the relay control unit 1513 (Step 1516-2), which are formed and sent to the voice communication line 1509 employed in the IP transfer network 1500 by the voice control unit. It should also be noted that the voice control unit 1516 secures a logic voice communication line for receiving voice data from the exchanger 1518, and determines an identifier “CH-2” (reception channel indicated by Channel-R) to record this identifier in the record of the media path connection table 1528-3 (refer to FIG. 233). The relay control unit 1513 receives the internal IP address of the voice control unit 1516, the transmission source IP address “EA3” and the port number “5008” of the UDP packet provided in the speech control unit from the voice control unit 1516, and writes this internal IP address into the CIC management table 1513-1 (refer to FIG. 224). The resultant content is indicated in the CIC administration table 1513-2 (refer to FIG. 234). In this table, the address of the telephone proxy server is not contained. The voice control unit 1516 previously holds one, or more internal IP address of the vice control unit 1516, while one of these internal IP addresses is used as the above-explained internal IP address “IA3”. <<Transmission of CPG Message>> When the telephone set 1520 reports the telephone calling operation to the exchanger 1519 (Step N20), the exchanger 1519 forms a signalling unit (CPG message) for notifying the telephone calling operation and transmits the signalling unit via the exchanger 1518 (Step N21) to the relay control unit 1513 (Step N22). The relay control unit 1513 acquires address information used to an IP packet based upon the label information of the received signalling unit with reference to the address connection table 1525-1 (refer to FIG. 226), and produces a CPG message (FIG. 237) having an IP packet format. The IP packet is sent to the telephone administration server 1571 (Step N23). The telephone administration server 1571 notifies the notification of the telephone calling operation via the media router 1560 to the telephone set 1508 (Steps N25 to N28). While the CPG message is formed, the relay control unit 1513 acquires the transmission source external IP address “EA3”, the internal IP address “IA3”, and the port number “5008” of the UDP packet within the voice control unit 1516 from the CIC administration table 1513-2 (refer to FIG. 234), and then writes these acquired data into a CPG message 1552. The telephone administration server 1571 derives the external IP address “EA3”, the internal IP address “IA3”, and the port number “5008” from the received CPG packet 1552, and may write the derived data into the administration table 1571-2 (refer to FIG. 222). <<Transmission of ANM Message>> Next, when the user of the telephone set 1520 responds to the telephone calling operation (Step N30), the exchanger 1519 forms a signalling unit (ANM message) for notifying the telephone responding operation and transmits the signalling unit via the exchanger 1518 (Step N31) to the relay control unit 1513 (Step N32). The relay control unit 1513 produces an ANM message 1553 having an IP packet format (refer to FIG. 238) based upon the label information of the received signalling unit with reference to the address connection table 1525-1 (refer to FIG. 226). The IP packet 1553 is sent to the telephone administration server 1571 (Step N33). Then, the telephone administration server 1571 notifies the notification of the telephone response via the media router 1560 to the telephone set 1508 (Steps N35 to N38). In other words, an IP packet 1554 (FIG. 240) is sent from the telephone administration server 1571 to the pilot telephone server 1570 (Step N35), and IP packet 1555 (FIG. 241) is sent from the pilot telephone server 1570 to the network node apparatus 1544 (Step N36), and an IP packet 1556 (FIG. 242) is sent from the network node apparatus 1544 to the media router 1560 (Step N37). When the relay control unit 1513 produces the ANM message, the relay control unit 1513 acquires the transmission source external IP address “EA3”, the internal IP address “IA3” of the voice control unit 1516, and the port number “5008” of the UDP packet from the CIC administration table 1513-2 (refer to FIG. 234), and then writes these acquired data into an ANM message 1553. The telephone administration server 1571 derives the external IP address “EA3”, the internal IP address “IA3”, and the port number “5008” from the received response packet 1553, and may write the derived data into the administration table 1571-2 (refer to FIG. 222). <<Write Timing into CIC Management Table 1571>> The timing at which the telephone administration server 1571 derives the external IP address “EA3”, the internal IP address “IA3”, and the port number “5008” and then writes the derived addresses into the CIC administration table 1571-2 is carried out only at one of the process operations defined at the step N23 where the CPG message is received and the step N33 where the ANM message is received. <<Setting of IP Communication Record by Relay Control Unit>> The relay control unit derives the IP addresses “EA3”, “EA1”, “IA3”, “IA1” from the internal record of the CIC administration table 1513-3 (refer to FIG. 239) at the Step N33, and then transmits the derived IP addresses to the table administration server 1576 (Step N41). The table administration server 1576 sets the received IP addresses as IP communication records “EA3, EA1, IA3, IA1” of the address administration table provided in the network node apparatus 1547 (Step N42). It should be understood that both the record format of the address administration table and the address setting method to the record have already been explained in other embodiments. <<Setting of IP Communication Record by Telephone Administration Server>> Similarly, the telephone administration server 1571 derives the IP addresses “EA1”, “EA3”, “IA1”, “IA3” from the internal record of the CIC administration table 1513-3, and then transmits the derived IP addresses to the table administration server 1573 (Step N43). The table administration server 1573 sets the received IP addresses as IP communication records “EA1, EA3, IA1, IA3” of the address administration table provided in the network node apparatus 1544 (Step N44). <<Communication Phase>> A telephone communication established between the user of the telephone set 1508 and the telephone set 1520 corresponds to steps similar to those explained in other embodiments. In this telephone communication, both an IP communication record indicated in the address administration table (namely, records of “EA1, EA3, IA1, IA3”) of the network node apparatus 1544, and an IP communication record indicated in an address administration table (namely, records of “EA3, EA1, IA3, IA1”) of the network node apparatus 1547 are employed. The voice (speech) signal of the telephone set 1508 is digitalized, and the digitalized voice data is described on the payload of the IP packet 1561 (refer to FIG. 243). In this case, both the destination address and the UDP port number, which are acquired in the above-explained connection phase are employed. In other words, the transmission source address corresponds to the IP address “EA1” of the media router 1560, the destination address corresponds to the IP address “EA3” of the voice control unit 1516 connected to the destination telephone set 1520, “5006” is employed as the UDP port number used in the voice transmission by the media router, and also “5008” is employed as the UDP port number used in the voice transmission by the voice control unit 1516. The analog voice is sent from the telephone set 1508, and the analog voice is digitalized to become a voice IP packet 1561 (refer to FIG. 243) in the media router 1560, and then the voice IP packet 1561 is sent to the network node apparatus 1544. In this network node apparatus 1544, the digital voice data is capsulated to become an IP packet 1562 (refer to FIG. 244) by using the IP communication records “EA1, EA3, IA1, IA3”, and then, the IP packet 1562 is reached via the voice IP communication line, and the router 1524 to the network node apparatus 1547. The network node apparatus 1547 inverse-capsulates the internal IP packet 1562 by using the above-described IP communication records “EA3, EA1, IA3, IA1” to produce an IP packet 1563 (refer to FIG. 245). The IP packet 1563 into which the digitalized voice is stored is reached to the voice control unit 1516. The voice control unit derives the transmission source IP address “EA1”, the transmission source port number “5006”, the destination IP address “EA3”, and the destination port number “5008”, which are contained in the IP packet 1563, and also refers to the media path connection table 1528-3 (FIG. 233). While using a media path record equal to the transmission source IP address “EA1”, the transmission source port number “5006”, the destination IP address “EA3”, and the destination port number “5008”, the digitalized voice contained in the IP packet 1563 is converted into a speech (voice) frame 1564 (FIG. 246) having a format transferred to the voice communication line 1506. The speech frame 1564 is reached via the exchanger 1518 to the exchanger 1519, so that voice is outputted from the telephone set 1520. The voice stored in the speech frame sent from the telephone set 1520 is transferred along a direction opposite to the above-explained direction to be reached to the telephone set 1508. <<Release Phase>> When the user of the telephone set 1508 notifies the end of the telephone communication (Step N50 of FIG. 215), the notification is notified from the media router 1560 to the telephone administration server 1571 (Steps N51 to N53). The telephone administration server 1571 returns the release completion to the media router 1560 (Steps N64 to N66). Also, the telephone administration server 1571 sends an IP packet 1565 (FIG. 247) for notifying the telephone call release to the relay control unit 1513 (Step N55). The relay control unit 1513 returns an IP packet 1566 (FIG. 248) for notifying the release completion to the telephone administration server 1571 (Step N62). The relay control unit 1513 sends a telephone call release notification to the relay exchanger 1518 (Step N56), and then, the relay exchanger 1518 returns the release completion to the relay control unit 1513 (Step N61). The relay control unit 1518 sends the telephone call release notification to the relay exchanger 1519 (Step N57), and then, the relay exchanger 1519 returns the release completion to the relay exchanger 1518 (Step N60). The exchanger 1519 sends a telephone call cut-off signal to the telephone set 1520 (Step N58). <<Deletion of Media Path Record>> At the Step N55, the relay control unit 1513 instructs the voice control unit 1516 to delete the record of the media path of the media path connection table 1528-3 (Step 1513-3 of FIG. 230). The voice control unit 1516 reports the record deletion of this media path (Step 1516-3). The record may be used in operation/record (optional process). <<Deletion of IP Communication Record and CIC Management Table Record>> After the Step N55, the telephone administration server 1571 transmits the line number “CIC-2” written in the release IP packet 1565 to the table administration server 1573 (Step N73) so as to delete the IP communication records “EA1, EA3, IA1, IA3” corresponding to the line number “CIC-2” provided in the network node apparatus 1544 (Step N74). Furthermore, the telephone administration server 1571 deletes the record of the telephone set of the CIC administration table 1571-2 (refer to FIG. 222) managed by the telephone administration server 1571. It should be noted that the telephone administration server 1571 may employ the record in the operation/record of the telephone call (optional process). The relay control unit 1513 transmits the line number “CIC-2” written in the release IP packet 1566 to the table administration server 1576 (Step N71) so as to delete the IP communication records “EA3, EA1, IA3, IA1” provided in the network node apparatus 1547 (Step N72). Furthermore, the relay control unit 1513 deletes the record of the telephone set of the CIC administration table 1513-3 (refer to FIG. 239) managed by the relay control unit 1513. It should be noted that the relay control unit 1513 may employ this record in the operation/record (optical process). Next, the operations of the 13-th embodiment will now be summarized. While the control IP communication line and the voice IP communication line of the telephone are separated from each other between the termination gateway equipped with the capsulation function and the relay gateway, the telephone communication can be established between the telephone set 1 and the telephone set 2 via the termination gateway equipped with the capsulation function, the relay gateway, the NNI interface communication line, and the public switched telephone network. Both the telephone administration server in the termination gateway equipped with the capsulation function and the relay control unit in the relay gateway own the individual CIC administration tables, and manage the line numbers by using these individual CIC administration tables. The relay control unit provided in the relay gateway converts the IP packet and the signalling unit by using the address connection table which contains the address information of the IP packet and the label information of the signalling unit. The relay control unit retrieves the signal station address administration table, indicates the telephone number of the destination telephone set, and acquires the signal station address of the exchanger for managing this telephone set. Also, the relay control unit determines the line number and the signal link selection based upon the rule previously determined by the public switched telephone network. While using the media path connection table contained in the voice control unit within the relay gateway, the voice control unit converts the IP packet which stores the digital voice, and the voice signal which is transferred into the voice communication line of the NNI communication line. While using the address connection table containing both the address information of the IP packet and the label information of the signalling unit, the voice control unit executes the conversion between the IP packet and the signalling unit. The voice control unit owns the IP address used to transmit/receive the voice IP packet, and then provides the IP address so as to set the media path connection table. While using the media path connection table, the voice control unit converts the IP packet which stores the digital voice, and the voice signal which is transferred into the voice communication line of the NNI communication line. The voice control unit secures the logic voice communication line which is used in the reception, or the transmission from the public switched telephone network, and determines the identifier thereof. The termination gateway equipped with the capsulation function contains the relay control unit and the network node apparatus. The network node apparatus owns the IP capsulation function and the inverse-capsulation function. The relay control unit contains the telephone administration server, the telephone number server, the pilot telephone server and the table administration server. The relay control unit transfers the telephone call control packet to the relay control unit among the IP packets which are entered from the media router into the network node apparatus, and branches the voice IP packet to the voice IP communication line. As a consequence, the telephone sets 1508 and 1520 can establish the telephone communication with each other via the IP transfer network 1500 and the public switched telephone network 1501. 14. 14th Embodiment in which IP Transfer is Employed as Relay Network In FIG. 249, reference numeral 1400 shows an IP transfer network, reference numerals 1401 and 1402 represent relay gateways, reference numeral 1403 shows a gateway equipped with a capsulation function, reference numerals 1405 to 1407 represent public switched telephone networks (PSTN), reference numerals 1408 to 1411 show subscriber exchangers, reference numerals 1412 and 1413 denote relay exchangers, reference numerals 1415 and 1416 represent control communication lines by the common line signal system, and reference numerals 1417 and 1418 indicate voice (speech) communication lines. Also, a set of the control communication line 1415 and the voice communication line 1417 are an NNI communication line between the exchanger 1412 and the relay gateway 1401, whereas a set of the control communication line 1416 and the voice communication line 1418 is an NNI communication line between the exchanger 1413 and the relay gateway 1402. Reference numerals 1438 and 1439 show address connection tables. Reference numerals 1441 and 1442 indicate gateway address administration server (“DNS-1” in FIG. 273) and reference numerals 1443 and 1444 indicate signal station address administration server (“DNS-2” in FIG. 274). Also reference numerals 1429 and 1430 show media path connection tables. In the present invention, a point provided in the common line signal system is expressed by a signal station, and a point code is represented by a “signal station address”. The IP address of the relay gateway 1401 is “GW05”. The relay control unit 1423 holds the IP address “GW05”. Similarly, the IP address of the relay gateway 1402 is “GW06”, and the relay control unit 1424 holds the IP address “GW06”. <<Communication Between Telephone Sets 1420 and 1421>> In the beginning, a description is made of a terminal to-terminal communication connection control method by which the telephone set 1420 is communicated with the telephone set 1421 via the public switched telephone network 1405, the IP transfer network 1400, and the public switched telephone network 1406. <<Connection Phase>> When the handset of the telephone set 1420 is taken up, a telephone call signal is transferred to the exchanger 1408 (Step HA01 of FIG. 250), and the exchanger 1408 confirms telephone calling operation (Step HA02). The exchanger 1408 notifies a telephone call setting request to the relay exchanger 1412 (Step H03). Then, the relay exchanger 1412 accepts the telephone call setting request to produce a signalling unit 1451 of the common line signal system, and then transfers the signalling unit 1451 via the control communication line 1415 to the relay control unit 1423 employed in the relay gateway 1401 (Step HA04). A destination signal station code of the signalling unit 1451 is “DPC-1”, a transmission source signal station code thereof is “OPC-1”, a signal link selection thereof is “SLS-1”, a line number thereof is “CIC-1”, a message thereof is “IAM”, and a parameter is “Para-1”. The content of the parameter “Para-1” contains both a telephone number “TN-1” of the telephone set 1420 and a telephone number “TN-2” of the telephone set 1421. A message “MSG-1” contained in the signalling unit 1451 shown in FIG. 249 implies “IAM”. <<Operation of Relay Control Unit 1423>> The relay control unit 1423 receives the signalling unit 1451 (Step HA04). FIG. 273 represents such a procedure that the relay control unit 1423 converts the signalling unit 1451 into an IP packet 1542. The relay control unit 1423 receives the signalling unit 1451 (Step S1461-2 of FIG. 273) so as to derive signal station labels “DPC-1, OPC-1, SLS-1, CIC-1” (Step S1461-3) contained in the signalling unit 1451. The relay control unit 1423 checks as to whether or not a signal station label is present in the address connection table 1438 (Step S1461-4), namely such a record containing a set of the destination signal station code (DPC), the transmission source signal station code (OPC), the signal link selection (SLS) and the line number (CIC). In this case, since there is no record coincident with each other in the address connection table 1438-1 (refer to FIG. 261), the signal station label is additionally written at the record of the address connection table 1438 (Step S1461-5) and the relay control unit 1423 derives the telephone number “TN-2” of the telephone number 1421 within the parameter “Para-1”, and inquiries the gateway address administration server 1441 to obtain an answer of an IP address of a gateway which manages the above-explained telephone number “TN-2” (Step S1461-6). In this case, the relay control unit 1423 may acquire an IP address “D-ad-x” (namely, “GW06”) of the relay gateway 1402. In this case, both the gateway address administration server 1441 and 1442 receive input information of all of 10-digits of a telephone number, or upper-graded 6 digits thereof (namely, both local area number and telephone office number), and provide output information of an IP address of a gateway which manages the telephone number. It should also be noted that the gateway address administration servers 1441 and 1442 may provide the above information by the known way of domain name server (DNS) replacing the telephone number by a domain name. Furthermore, in the case that a total number of telephone numbers to be inquired is small, the gateway address administration server may be replaced by the IP address administration table 1441-1 (refer to FIG. 251). In this case, the IP address administration table 1441-1 corresponds to such a table list representative of a correspondence relationship between telephone numbers and IP addresses of the relevant relay gateways. When a telephone number is designated, an IP address of the corresponding relay gateway may be obtained. It should also be noted that the IP address administration table has the same purpose as that of the IP transfer network output line table as explained in other embodiments, namely, the IP address administration table may be used so as to retrieve the correspondence relationship between the telephone number and the IP address. The relay control unit 1423 holds the IP address “S-ad-x” (namely, “GW05”) of the relay gateway 1401, and produces an IP packet 1452. The destination IP address of the IP packet 1452 is “D-ad-x”, the transmission source IP address thereof is “S-ad-x”, the line number thereof is “CIC-x”, and the message thereof is “IAM”. The parameter “Para-x” contains the telephone number “TN-1” of the telephone set 1420 and the telephone number “TN-2” of the telephone set 1421. The above-explained message and parameter are acquired from the signalling unit 1451 (refer to FIG. 253). The relay control unit 1423 determines the line number “CIC-x” for every set of “S-ad-x” and “D-ad-x” based upon a predetermined rule, and employs the determined line number (Step S1461-7 of FIG. 273). For instance, while a value of a line number which is produced just before is saved in an internal memory, the relay control unit 1423 adds the values of the line numbers one by one, and then produces a desirable value of the line number by employing the below-mentioned formula: CIC-x=CIC-x+1 mod 65536  (8) At a time instant before the relay control unit 1423 receives the signalling unit 1451, the address connection table 1438 of the relay control unit 1423 becomes empty, and the empty condition is indicated as an address connection table 1438-1 (refer to FIG. 261). When the relay control unit 1423 produces an IP packet 1452, while the label information “DPC-1, OPC-1, SLS-1, CIC-1” contained in the signalling unit 1451 is combined with the label information “S-ad-x, D-ad-x, CIC-x” contained in the IP packet 1452, the relay control unit 1423 further determines a media path identifier “MP-8”, and then writes the media path identifier “MP-8” in the address connection table (Step S1461-8 of FIG. 273). The media path identifier is used to request a voice communication path with respect to the voice control unit 1427. The condition is indicated in an address connection table 1438-2 (refer to FIG. 262). Among the signal station address items (“DPC-1, OPC-1”) contained in the record of the address connection table 1438-2, the address item “DPC-1” located on the left side corresponds to the signal station address of the relay connection gateway 1401 which holds the address connection table 1438-2. Similarly, among the IP address items (“S-ad-x, D-ad-x”) contained in the address connection table 1438-2, the address item “S-ad-x” located on the left side corresponds to the IP address of the relay connection gateway 1401 which holds the address connection table 1438-2. A right end of the record is the media path identifier “MP-8”. <<Cooperation Between Relay Control Unit and Voice Control Unit>> Referring now to FIG. 249, a cooperation between the relay control unit and the voice control unit will be described. The relay control unit 1423 indicates the media path identifier “MP-8” via the information line 1429-1 to the voice control unit 1427 (Step 1423-1 of FIG. 268). The voice control unit 1427 secures an internal IP address “IA5”, an external IP address “EA5” and a voice communication port number “5010” of an internal module of the voice control unit 1429 used for the voice communication, and notifies to the relay control unit 1423 via the information line 1429-1 (Step 1427-1). Furthermore, the voice control unit 1427 determines a logic communication line identifier “CH-1” used to identify a logic communication line for transmitting a voice frame to the voice communication line 1417, a logic communication line identifier “CH-2” for identifying a logic communication line used to receive a voice frame from the voice communication line 1417, and writes the logic communication line identifiers “CH-1” and “CH-2” into the media path connection table 1429. The written result is indicated in a media path connection table 1429-1 (refer to FIG. 265). In the case that the logic communication line 1417 corresponds to a primary group interface line of an ISDN communication line, the logic communication line identifier is constituted by a number of an ISDN communication apparatus and also a number for indicating a specific B-channel (namely, logic transfer line of user information). The relay control unit 1423 writes into the CIC administration table, the IP address “GW05” of the relay gateway 1401; the CIC number “CIC-2” which has been acquired in the above-explained manner, or has been produced; the telephone number “TN-1” and “TN-2”, the IP addresses “EA5” and “IA5”, and the port number “5010” contained in the signalling unit 1451. The written result is shown as in the CIC administration table 1423-1 (refer to FIG. 257). It should also be noted that since the procedure step is located after the Step H04, the procedure step is selected to be “IAM”. <<Transfer within IP Transfer Network>> The relay control unit 1423 transmits the produced (Step S1461-9) IP packet 1452 to the internal unit of the IP transfer network 1400 (Step S1461-10), and the IP packet 1452 is reached via the control communication line 1431-1, the router 1431, and the control communication line 1431-2 to the relay control unit 1424 contained in the relay gateway 1402 (Step HA05). <<Setting of CIC Management Table and Address Connection Table by Relay Control Unit 1424>> The relay control unit 1424 receives the IP packet 1452 (Step S1462-2 of FIG. 274). The relay control unit 1424 derives an IP address, a message, a line number, and a parameter from the IP packet 1452 (Step S1462-3). In this case, the destination IP address of the IP packet 1452 is “D-ad-x”, the transmission source IP address thereof is “S-ad-x”, the line number thereof is “CIC-x”, and the message thereof is “IAM” and also the parameter is “Para-x”. The parameter “Para-x” contains both the telephone number “TN-1” of the telephone set 1420 and the telephone number “TN-2” of the telephone set 1421. The relay control unit 1424 checks as to whether or not a set of the corresponding IP addresses “S-ad-x” and “D-ad-x” and the line number is present in the address connection table 1439-1 (refer to FIG. 263) (Step S1462-4). In this case, since there is no such a set, the relay control unit 1424 derives the IP addresses “S-ad-x” and “D-ad-x”, and also the line number address “CIC-x” so as to write these derived addresses into the address connection table 1439-1 (Step S1462-5). The relay control unit 1424 indicates the telephone number “TN-2” of the destination telephone set to the signal station address administration server 1444, and acquires the signal station address “DPC-2” of the exchanger 1409 which manages the telephone set 1421 having the telephone number “TN-2” (Step S1462-6), and then write the acquired signal station address “DPC-2” into the address connection table 1439-1 of FIG. 263 (Step S1462-7). As a result, this address connection table becomes 1439-2 (refer to FIG. 264). A right end of the record corresponds to a media path identifier “MP-9”. The relay control unit 1424 determines a line number “CIC-2” and a signal link selection “SLS-2” based upon a predetermined rule with respect to the public switched telephone network 1406, and produces such a signalling unit 1453 containing the message “IAM” and a parameter “Para-2” (Step S1462-8), and then sends the signalling unit 1453 to the control communication line 1416 (Step S1462-9). <<Cooperation Between Relay Control Unit and Voice Control Unit>> Referring now to FIG. 249, a cooperation between the relay control unit and the voice control unit will be described. The relay control unit 1424 indicates the following items via the information line 1430-1 to the voice control unit 1428, namely, the media path identifier “MP-9”, the internal IP address “IA5” and the external IP address “EA5” of the module provided in the voice control unit 1427, which have been acquired, and the port number “5010” which is employed by the voice control unit 14328 to transmit the voice. Then, the voice control unit 1428 responds to the voice control unit 1428, the internal IP address “IA5” and the external IP address “EA6” of the module inside the voice control unit 1428 and the port number “5012” which is used by the voice control unit 1428 to send the voice. In this procedure, the voice control unit 1428 writes two pairs of the IP addresses and the port numbers (namely, internal IP address “IA5”, external IP address “EA5” and port number “5010”; internal IP address “IA6”, external IP address “EA6” and port number “5012”) into the media path connection table 1430. Furthermore, the voice control unit 1428 determines a logic communication line identifier “CH-3” used to identify a logic communication line for transmitting a voice frame to the voice communication line 1418, a logic communication line identifier “CH-4” for identifying a logic communication line used to receive a voice frame from the voice communication line 1418, and writes the logic communication line identifiers “CH-3” and “CH-4” into the media path connection table 1430. The written result is indicated in a media path connection table 1430-1 (refer to FIG. 266). The media path connection table 1430-1 owns the following implication: When such an IP packet (payload is UDP) which contains the transmission IP address “EA5”, the transmission source port number “5010”, the destination IP address “EA6”, and the destination port number “5012” and also the IP capsulated packet of which the transmission source IP address is “IA5” and the destination IP address is “IA6”, are received the digitalized voice contained in this UDP payload is transmitted to the logic communication line identifier “CH-3” of the logic communication line 1418. Also, when the digitalized voice is received from the logic communication line identifier “CH-4”, the digitalized voice is stored into such an IP packet (payload is UDP) is received which contains the transmission IP address “EA6”, the transmission source port number “5012”, the destination IP address “EA5”, and the destination port number “5010”, and then, the IP packet is converted into the IP capsulated packet of which the transmission source IP address is “IA5” and the destination IP address is “IA6”, transmitted to the IP transfer network 1400. <<Operation of Public Switched Telephone Network 1406>> The signalling unit 1453 is reached to the relay exchanger 1413 (Step HA06), the signalling unit 1453 is transferred into the public switched telephone network 1406, and then is reached to the exchanger 1409 (Step HA07). The exchanger 1409 checks as to whether or not the telephone set 1421 having the telephone number “TN-2” is allowed to receive a telephone call. When the call reception is allowed, the exchanger 1409 notifies a telephone call setting request (call reception notification) to the telephone set 1421 (Step HA08). Next, the exchanger 1409 produces the signalling unit 1454 shown in FIG. 254. In the signalling unit 1454, the destination signal station address is “DPC-3”; the transmission source signal station address is “OPC-3”; the signal link selection is “SLS-3”; and the line number is “CIC-3.” In this case, the value of “OPC-3” is the value of “DPC-2”; the value of “DPC-3” is the value of “OPC-2”; the value of “SLS-3” is the value of “SLS-2”; and the value of “CIC-3” is the value of “CIC-2”. In other words, the signal station address corresponds to such a value that the address of the transmission source signal station is replaced by the address of the destination signal station at the previous step, and there are no changes in the values of the signal link selection and the line number. The exchanger 1409 transfers the signalling unit 1454 into the public switched telephone network 1406, and this signalling unit 1454 passes through the exchanger 1413 (Step HA11), and then is reached via the control communication line 1416 to the relay control unit 1424 of the relay gateway 1402 (Step HA12). The relay control unit 1424 receives the signalling unit 1454 (Step S1461-2 of FIG. 273) so as to derive a signal station label contained in the signalling unit 1454 (Step S1461-3), and checks as to whether or not the address connection table 1439 contains the same record content as the derived signal station labels “DPC-3, OPC-3, SLS-3, CIC-3”. In this case, since there is the coincident record in the address connection table 1439-2, the relay control unit 1424 produces an IP packet 1455 shown in FIG. 255 (Step S1461-9 of FIG. 273), and transmits the IP packet 1455 to the IP transfer network 1400 (Step S1461-10). In the IP packet 1455, the transmission IP address is “S-ad-u”; the destination IP address is “D-ad-u”; and the line number is “CIC-u”. In this case, the value of the IP address “S-ad-u” is the value of the IP address “D-ad-u”; the value of the IP address “D-ad-u” is the value of the IP address “S-ad-x”; and the value of the IP address “CIC-u” is the value of the IP address “CIC-x”. In other words, the address of the relay station gateway corresponds to such a value that the transmission source of the IP address of the IP packet 1452 is replaced by the destination thereof, and there is no change in the line numbers. The IP packet 1455 is reached via the control communication line 1431-2, the router 1431, and the control communication line 1431-1 to the relay control unit 1423 (Step HA13 of FIG. 250). The relay control unit 1423 receives the IP packet 1455 (Step S1462-2 of FIG. 274) so as to derive the IP addresses “S-ad-u” and “D-ad-u”, and the line number “CIC-u” from the IP packet 1455. Then, in the address connection table 1438, the label information “S-ad-u” is made coincident with “D-ad-x”; the label information “D-ad-u” is made coincident with “S-ad-x”; and the line number “CIC-u” is made coincident with “CIC-x”. As a result, the relay control unit 1423 produces a signalling unit 1456 shown in FIG. 256 (Step S1462-8 of FIG. 274). Next, the signalling unit 1456 is sent to the control communication line 1415 (Step S1462-9), and is reached to the relay exchanger 1412 (Step HA14). The signalling unit 1456 is transferred into the public switched telephone network 1405 and then is reached to the exchanger 1408 (Step HA15). On the other hand, the telephone set 1421 returns a signalling unit indicative of the telephone calling operation to the exchanger 1409 in response to the call reception notification of the Step HA08 (Step HA20). The exchanger 1409 notifies a signalling unit (CPG message) indicative of the telephone calling operation to the exchanger 1413 (Step HA21). The exchanger 1413 transmits the signalling unit via the control communication line 1416 to the relay control unit 1424 of the relay gateway 1402 (Step HA22), and produces such an IP packet for notifying the telephone calling operation in accordance with such a procedure similar to that shown in FIG. 273 with reference to the address connection table 1439-2 thereof. The produced IP packet is reached via the control communication line 1431-2, the router 1431, and the control communication line 1431-1 to the relay control unit 1423 (Step HA23). The relay control unit 1423 receives the IP packet to produce such a signalling unit for notifying the telephone calling operation, and then sends the signalling unit to the control communication line 1415 (Step S1462-9). The signalling unit is reached via the relay exchanger 1412 (Step HA24) to the exchanger 1408 (Step HA25). The exchanger 1408 notifies such a fact that the telephone unit 1421 is being called to the telephone set 1420 (Step HA26). Next, when the user of the telephone set 1421 responds to the telephone call (Step HA30), a signalling unit for notifying a response is subsequently transmitted from the exchanger 1409, and then is reached via the exchanger 1413 (Step HA31) to the relay control unit 1424 (Step HA32). The relay control unit 1424 produces an IP packet (ANM) for notifying a response with reference to the connection address table 1439, and this IP packet is reached via the control communication line 1431-2, the router 1431, the control communication line 1431-1 to the relay control unit 1423 (Step HA33). The relay control unit 1423 produces a signalling unit for notifying a response with reference to the connection address table 1438, and the signalling unit is reached via the control communication line 1415 and the exchanger 1412 (Step HA34) to the exchanger 1408 (Step HA35). The exchanger 1408 sends a response signal to the telephone set 1420 (Step HA36). <<Completion of Address Connection Table>> Referring now to FIG. 249, a description will be made of a completion of an address connection table. In the case that the relay control unit 1423 indicates the media path identifier “MP-8”, the acquired external IP address “EA6” of the module in the voice control unit 1428, and the port number “5012” which is used to send the voice by the voice control unit 1428 to the voice control unit 1427, the voice control unit 1427 writes both the IP address “EA6” and the port number “5012” into the media path connection table 1429-1 (FIG. 265) so as to accomplish a media path connection table 1429-2 (refer to FIG. 267), and notifies to the relay control unit 1423 (Step 1427-2). In the connection phase, the line number “CIC-1” set by the public switched telephone network 1405 for setting the telephone lines of the telephone sets 1420/1421 may be made in correspondence with the line number “CIC-x” set by the IP transfer network 1400 in the address connection table 1438, whereas the line number “CIC-x” set by the IP transfer network 1400 may be made in correspondence with the line number “CIC-2” set by the public switched telephone network 1406 in the address connection table 1439. These two correspondence relationships are made constant from the beginning of the telephone communications of the telephone sets 1420 and 1421 until the end of the telephone communications. <<Communication Phase>> While the above-described procedure is carried out, the telephone communication can be established between the telephone set 1420 and the telephone set 1421, so that the voice communication is performed (Step HA38). The voice sent from the telephone set 1420 is separated into the call connection control signal and the voice signal in the exchanger 1408, and thereafter are supplied to the exchanger 1412. These signals are transmitted via the voice communication line 1417, the voice control unit 1427 employed in the relay gateway 1401, via the voice communication line 1433-1, the router 1433, the voice communication line 1433-2, and the voice control unit 1428 provided in the relay gateway 1402, and further via the voice communication line 1418, the exchanger 1423, and the exchanger 1409 to the telephone set 1421. The voice signals are transferred from the telephone set 1421 to the telephone set 1420 along a direction opposite to the above-explained direction. This embodiment is featured by that the communication lines used to the voice signal and the telephone connection control can be separated from each other between the exchanger 1408 and the exchanger 1409. <<Release Phase>> When the user puts on the handset, the communication release condition is notified from the telephone set 1420 to the exchanger 1408 (Step HA40 of FIG. 250), and the exchanger 1408 notifies the release message (REL) to the exchanger 1412 (Step HA41). When the exchanger 1412 receives the release message, the exchanger 1412 immediately returns the release completion message (RLC) to the exchanger 1408 (Step HA55), and notifies the release message (REL) to the relay control unit 1423 (Step HA42). The relay control unit 1423 returns the release completion message (RLC) to the exchanger 1412 (Step HA54). The relay control unit 1423 notifies the release message (REL) to the relay control unit 1424 (Step HA43), and the relay control unit 1424 returns the release completion message (RLC) to the relay control unit 1423 (Step HA53). The relay control unit 1424 notifies the release message (REL) to the exchanger 1473 (Step HA44). The exchanger 1413 returns the release completion message (RLC) to the relay control unit 1424 (Step HA52). The exchanger 1413 notifies the release message (REL) to the exchanger 1409 (Step HA45). The exchanger 1409 returns the release completion message (RLC) to the exchanger 1413 (Step HA51). The exchanger 1409 notifies the release notification to the telephone set 1421 (Step HA46). When the relay control unit 1423 judges at the Step HA42 (Step S1463-2 of FIG. 275) that the signalling unit corresponds to the release message (REL) (Steps S1463-3, S1463-4, S1463-5), the relay control unit 1423 deletes the relevant record of the address connection table (Step S1463-6). As a result, the record of the address connection table 1438-2 (refer to FIG. 262) becomes empty as indicated in the address connection table 1438-1 (refer to FIG. 261). Similarly, when the relay control unit 1424 judges at the Step HA43 (Step S1464-2 of FIG. 276) that the message contained in the signalling unit corresponds to the release message (REL) (Steps S1464-3, S1464-4, S1464-5), the relay control unit 1424 deletes the relevant record of the address connection table (Step S1464-6). As a result, the record of the address connection table 1439-2 (refer to FIG. 264) becomes empty as indicated in the address connection table 1439-1 (refer to FIG. 263). <<Deletion of Media Path Record>> At the Step HA43, the relay control unit 1423 instructs the voice control unit 1429 to delete the record of the relevant media path “MP-8” of the media path connection table 1429-2 (refer to FIG. 267), and the voice control unit 1427 reports the deletion of the record of the media path connection table (refer to FIG. 271) (Step 1427-3). Also, at the Step N53, the relay control unit 1424 instructs the voice control unit 1428 to delete the record of the relevant media path “MP-9” of the media path connection table 1430-1 (refer to FIG. 266), and the voice control unit 1428 reports the deletion of the record of the media path connection table (Step 1428-2). It should be understood that the record may be employed in the operation/recording operation. <<Communication Between Telephone Set 1420 and Telephone Set 1422>> The terminal-to-terminal communication connection control method has been described in other embodiments, in which the telephone call is made from the telephone set 1422 via the media router 1404, the termination gateway equipped with the capsulation function 1403, the relay gateway 1402, and the public switched telephone network 1406 to the telephone set 1421. In other words, such a terminal-to-terminal communication control method in which the telephone communication is established among the telephone set 1-media router-IP transfer network side-public switched telephone network-telephone set 2 has already been explained in other embodiments. Another terminal-to-terminal communication connection method in which a telephone communication is established among the telephone set 2-public switched telephone network-IP transfer network-media router-telephone set 1 operable in an opposite sense may be readily accomplished by way of a similar procedure to the above-explained procedure. As apparent from the foregoing description, such a terminal-to-terminal communication connection control method may be easily realized in which a telephone call is made from the telephone set 1420 via the public switched telephone network 1405, the relay gateway 1401, the termination gateway 1403 equipped with the capsulation function, and the media router 1404 to the telephone set 1422. Furthermore, such a terminal-to-terminal communication connection control method may be easily realized in which a telephone call is made from the telephone set 1420 via the public switched telephone network 1405, the relay gateway 1401, the termination gateway 1403 equipped with the capsulation function, and the media router 1404, the UNI communication line 1419, and the public switched telephone network 1407 to the telephone set 1423. The operations of the 14th embodiment will now be summarized. In the terminal-to-terminal communication control between two telephone sets, the information goes through the telephone set 1, the public switched telephone network 1, NNI interface communication line 1, the relay gateways 1 and 2 belonging the IP transfer network, the NNI interface communication line 2, the public switched telephone network 1 and the telephone set 2 consecutively. 15. 15th Embodiment in which Voice Line is not IP-Capsulated This 15-th embodiment is featured by that a network node apparatus employed in other embodiments is replaced by a so-called “non-IP-capsulation type termination apparatus”, a termination gateway of other embodiments is substituted by a so-termed “non-capsulation type termination apparatus”, and further, a relay gateway of other embodiments is replaced by a so-called “non-capsulation type relay gateway”. Also, in this 15-th embodiment, while a voice (speech) IP packet is not IP-capsulated, both a table administration server and a telephone proxy server are omitted. In FIG. 277, reference numeral 1600 shows an IP transfer network, reference numeral 1601 indicates a public switched telephone network, reference numeral 1602 represents a non-capsulation type termination gateway, reference numeral 1603 denotes a termination apparatus, reference numeral 1604 is a termination gateway control unit (SEP), and reference numeral 1605 shows a non-capsulation type relay gateway. Reference numeral 1606 represents a relay control unit (STP), reference numeral 1607 shows a voice control unit, reference numeral 1608 indicates a relay exchanger, reference numeral 1609 represents a subscriber exchanger, reference numeral 1610 denotes a telephone set having a telephone number “TN-1”, and reference numeral 1611 indicates a telephone set having a telephone number “TN-2”. Also, reference numerals 1612 and 1613 show control IP communication lines, reference numerals 1614 and 1615 represent voice IP communication lines, reference numeral 1616 shows a control communication line of a common line signal system, reference numeral 1617 denotes a voice communication line, reference numeral 1620 shows an address administration table, reference numeral 1671 denotes a telephone administration server, and also reference numeral 1672 represents a telephone number server. The non-capsulation type relay gateway 1605 corresponds to such a relay gateway capable of mutually communicating with the non-capsulation type termination gateway 1602. An IP address by which the apparatus and the like such as the media router 1660 and telephone sets, provided outside the IP transfer network 1600 can be used is referred to as an “external IP address”, whereas an IP address exclusively used in the IP network, by which the apparatus provided outside the IP transfer network 1600 cannot be used is called as an “internal IP address”. The telephone administration server 1671 owns both an external IP address “EA91” and an internal IP address “IA91”, and may improve information security performance while the external IP address “EA91” and the internal IP address “IA91” are separately used. <<Connection Phase>> This is such an example that a telephone communication is made from the telephone set 1610 to the telephone set 1611. When the handset of the telephone set 1610 is taken up, a telephone call signal is transferred to the media router 1660 (Step B01 of FIG. 278), and the media router 1660 confirms telephone calling operation (Step B02). Next, the media router 1660 produces such an IP packet 1630 (refer to FIG. 279), and then, transmits the IP packet 1630 to the termination apparatus 1603 (Step B03), which contains a transmission source IP address “EA1”, a destination IP address “EA91”, a telephone number “TN-1” of the telephone set 1610, a telephone number “TN-2” of the telephone set 1611, a voice transmission port number “5006” and additional information “Info-2”. In this case, the IP address “EA1” corresponds to an IP address of the media router 1660, the IP address “EA91” corresponds to an external IP address of the telephone administration server 1671, a payload portion of the IP packet 1630 is a UDP packet, and both a transmission source port number and a destination port number are equal to “5060”. <<Packet Filter by Termination Apparatus>> Upon receipt of the IP packet 1630, the termination apparatus 1603 checks as to whether or not all of the transmission source IP address “EA1”, the transmission source port number “5060”, the destination IP address “EA91”, and the destination port number “5060”, which are contained in the IP packet 1630, are registered as a record contained in the address administration table 1620. In this case, since all of these items are registered as a record indicated on a first row of an address administration table 1620-1 (refer to FIG. 280), the termination apparatus 1603 converts the destination IP address “EA91” contained in the IP packet 1630 into the internal IP address “IA91” of the telephone administration server 1671 (namely, NAT function). Next, in response to an instruction of an output interface “IF1612” located at a right end of the relevant record provided in the address administration table 1620, the termination apparatus 1603 sends out an IP packet 1631 to the control IP communication line 1612 (Step B04). It should be noted that when both the IP address and the port number contained in the received IP packet 1630 are not registered into the address administration table 1620, the IP packet 1630 is discarded. As explained above, the filtering process operation of the IP packet is carried out by this termination apparatus 1603. <<Forming of CIC Administration Table>> The telephone administration server 1671 receives the IP packet 1631 and writes the below-mentioned items into a record of a CIC administration table held by the telephone administration server 1631, namely, the internal IP address “IA91” of the telephone administration server 1671, the procedure segment “IAM”, the transmission source telephone number “TN-1”, the destination telephone number “TN-2”, the external IP address “EA1”, the voice transmission port number “5006” and a write time instant (year, month, day, hour, minute, second) “ST6” as a CIC administration table 1671-1 (refer to FIG. 281). Next, the telephone administration server 1671 indicates an IP packet 1632-1 (refer to FIG. 282) for inquiring the destination telephone number “TN-2” to the telephone number server 1672 (Step B06). The telephone number server 1672 stores an IP address “GW03” into an IP packet 1632-2 (refer to FIG. 283) and responds this IP packet 1632-2 (Step B07). In this case, the above-described IP address “GW03” constitutes an IP address of the relay gateway 1605. <<Administration of Line Number>> The telephone administration server 1671 determines a CIC number “CIC-2” based upon the CIC number forming rule determined with respect to a set of the IP address “IA91” of the telephone administration server 1671 and the IP address “GW03” of the relay gateway 1605, and then writes the CIC number “CIC-2” into the CIC administration table together with the IP address “GW03”. The condition is indicated in a record of a CIC administration table 1671-2 (refer to FIG. 284). Next, the telephone administration server 1671 produces an IP packet 1634 (refer to FIG. 285) (IAM packet) with reference to the CIC administration table 1671-2 and the IP packet 1631, and then transmits the IP packet 1634 to the relay gateway 1605 (Step B09). <<Operation of Relay Control Unit>> Upon receipt of the IP packet 1634 (refer to FIG. 285) (Step B09), the relay control unit 1606 derives from the IP packet 1634, the transmission source IP address “IA91”, the destination IP address “GW03”, the line number “CIC-2”, the procedure segment “IAM”, the transmission source telephone number “TN-1”, the destination telephone number “TN-2”, the external IP address “EA1”, and the voice transmission port number “5006”. The relay control unit 1606 writes/records the derived items as a record of a CIC administration table 1605-1 (refer to FIG. 286) held by the relay gateway 1605 in combination with a time instant “St-7”. Further, the relay control unit 1606 retrieves a signal station address administration table 1627 (refer to FIG. 287), indicates the telephone number “TN-2”, and acquires a signal station address “PC-09” of the exchanger 1609 for managing the telephone set 1611. Furthermore, the relay control unit 1606 determines both a CIC number “CIC-3” and a signal link selection “SLS-3” based upon such a rule which is previously defined with respect to the public switched telephone network 1601. The relay control unit 1606 writes the signal station address “PC-3” of the relay gateway 1605, the acquired “PC-09”, the signal link selection “SLS-3”, and the line number “CIC-3”, the IP address “GW03”, the IP address “IA91”, and the line number “CIC-2” as a new record of the address connection table 1625 in combination with a media path identifier “MP-7”. As a result, this address connection table becomes a table 1625-1 (refer to FIG. 288). Subsequently, the relay control unit 1606 produces a signalling unit 1635 (refer to FIG. 289) which contains the signal station addresses “PC-09” and “PC-3”, the line number “CIC-3”, the signal link selection “SLS-3”, the message “IAM”, the telephone numbers “TN-1” and “TN-2” and then transmits the signalling unit 1635 to the control communication line 1616 (Step B10). <<Cooperation Between Relay Control Unit and Control Unit>> The relay control unit 1606 notifies the media path identifier “MP-7”, the external IP address “EA1”, and the voice transmission port number “5006” via the information line 1629 to the voice control unit 1607. The voice control unit 1607 writes the notified information as a record of the media path connection table 1628. Furthermore, the voice control unit 1607 determines a logic communication line used to transmit voice data from the voice control unit 1607 to the voice communication line 1617, and writes a logic communication line identifier “CH-1” thereof as a record of the media path connection table 1628. The above-explained result is indicated in the media path connection table 1628-1 (refer to FIG. 290). <<Operation of Switching Network and ACM Message>> The exchanger 1608 receives the signalling unit 1635 via the control communication line 1616 (Step B10), and thereafter transfers the signalling unit 1635 to the exchanger 1609 (Step B11). The exchanger 1609 receives the signalling unit 1635, and confirms as to whether or not the destination telephone number “TN-2” contained in the signalling unit 1635 can be received. If the telephone call can be received, then the exchanger 1609 notifies a telephone reception notification to the telephone set 1611 (Step B12). Furthermore, the telephone set 1635 produces such a signalling unit 1635-1 (refer to FIG. 292) for notifying the reception of the signalling unit 1635 and returns the signalling unit 1635-1. The signalling unit is reached via the exchanger 1608 (Step B13) to the relay gateway 1605 (Step B14). The relay control unit 1606 acquires address information used to produce an IP packet based upon label information of the received signalling unit 1635-1; and then produces an IP packet 1651 (ACM message, refer to FIG. 293) and further sends this IP packet 1651 to the telephone administration server 1671 (Step B15). The telephone administration server 1671 derives both the line number “CIC-2” and the procedure step “ACM” from the received IP packet 1651, and investigates the CIC administration table 1671-2 (refer to FIG. 284) held by the telephone administration server 1671 so as to find out such a record indicative of the own IP address “IA91”, the IP address “GW03” of the communication counter party and the line number “CIC-2”. Then, the telephone administration server 1671 rewrites a procedure step column of the relevant record of the CIC administration table 1671-2 into the above-explained procedure step “ACM”. Next, the telephone administration server 1671 produces an IP packet which indicates that the ACM message is received, and notifies this IP packet to the media router 1660 (Steps B18, B19). <<Media Path Connection Table>> While a process operation is carried out in parallel to the above-explained Step B10, or after the process operation of the Step B10 has been completed, the relay control unit 1606 indicates the media path identifier “MP-7” to the voice control unit 1607. At the same time, when the relay control unit 1606 requests both an IP address and a port number. As a result, the voice control unit 1607 answers both the transmission source IP address “EA7” of the IP packet and the port number “5008” of the UDP packet to the relay control unit 1606, which are sent to the voice IP communication line 1615. It should also be noted that the voice control unit 1607 secures a logic voice communication line for receiving voice data from the exchanger 1608, and determines an identifier “CH-2” to record the identifier in the record of the media path connection table 1628-2 (refer to FIG. 291). The media path connection table 1628-2 is arranged in such a manner that a left side of a record of the media path connection table constitutes both the IP address “EA7” and the port number “5008” of the voice control unit 1607, and a right side thereof constitutes the IP address “EA1” and the port number “5006” of the communication counter party. The relay control unit 1606 receives both the IP address “EA7” and the port number “5008”, and then writes the received items into the CIC administration table 1605-1 (refer to FIG. 286). The resultant data is indicated in a CIC administration table 1605-2 (refer to FIG. 296). <<Transmission of CPG Message>> When the telephone set 1611 reports the telephone calling operation to the exchanger 1609 (Step B20), the exchanger 1609 forms a signalling unit (CPG message) for notifying the telephone calling operation and transmits the signalling unit via the exchanger 1608 (Step B21) to the relay control unit 1606 (Step B22). The relay control unit 1606 acquires address information used to produce an IP packet based upon the label information of the received signalling unit with reference to the address connection table 1625-1 (refer to FIG. 288), and produces a CPG message 1652 (FIG. 294) having an IP packet format. The IP packet is sent to the telephone administration server 1671 (Step B23). The telephone administration server 1671 notifies the notification of the telephone calling operation via the media router 1660 to the telephone set 1610 (Steps B26 to B28). While the CPG message is formed, the relay control unit 1606 acquires the external IP address “EA7”, and the port number “5008” from the CIC administration table 1605-2 (refer to FIG. 296), and then writes these acquired data into a CPG message 1652. The telephone administration server 1671 derives the external IP address “EA7”, and the port number “5008” from the received CPG packet 1652, and may write the derived data into the administration table 1671-2 (refer to FIG. 284). <<Transmission of ANM Message>> Next, when the user of the telephone set 1611 responds to the telephone calling operation (Step B30), the exchanger 1609 forms a signalling unit (ANM message) for notifying the telephone responding operation and transmits this signalling unit via the exchanger 1608 (Step B31) to the relay control unit 1605 (Step B32). The relay control unit 1606 produces an ANM message 1653 having an IP packet format (refer to FIG. 295) based upon the label information of the received signalling unit with reference to the address connection table 1625-1 (refer to FIG. 288). The IP packet 1653 is sent to the telephone administration server 1671 (Step B33). Then, the telephone administration server 1671 notifies the notification of the telephone response via the media router 1660 to the telephone set 1610 (Steps B36 to B38). In other words, an IP packet 1656 (refer to FIG. 299) is sent from the telephone administration server 1671 via the termination apparatus 1603 (Step B36) to the media router 1660 (Step B37). When the relay control unit 1606 produces the ANM message, the relay control unit 1606 acquires the external IP address “EA7”, and the port number “5008” from the CIC administration table 1605-2 (refer to FIG. 296), and then writes these acquired data into an ANM message 1653. The telephone administration server 1671 derives the external IP address “EA7”, and the port number “5008” from the received response packet 1653, and may write the derived data into the administration table 1671-2 (refer to FIG. 284). <<Write Timing into CIC Administration Table>> The timing at which the telephone administration server 1671 derives the external IP address “EA7”, and the port number “5008” and then writes the derived addresses into the CIC administration table 1671-2, and produces a CIC administration table 1671-3 (refer to FIG. 297) is carried out only at one of the process operations defined at the Step B23 where the CPG message is received and the Step B33 where the ANM message is received. <<Written into Address Management Table>> The telephone administration server 1671 derives from the CIC administration table 1671-3 (FIG. 297), the following items, i.e., the external IP address “EA1” of the media router 1660 connected to the transmission source telephone set 1610, the port number “5006” which is used by the media router 1660 so as to transmit the voice, the external IP address “EA7” contained in the voice control unit 1607, and the port number “5008” which is employed by the voice control unit 1607 so as to transmit the voice data. Then, this telephone administration server 1671 writes the derived items into an address administration table 1620 of the termination apparatus 1603 in combination with a voice sending interface “IF1614” (Step B39). The resultant data is indicated on records “EA1, 5006, EA7, 5008, IF1614” of a third row of an address administration table 1620-2 (refer to FIG. 298). <<Communication Phase>> A telephone communication established between the user of the telephone set 1610 and the telephone set 1611 corresponds to steps similar to those explained in other embodiments. The analog voice (speech) signal of the telephone set 1610 is digitalized, and the digitalized voice data is described on the payload of the IP packet 1661 (refer to FIG. 300). In this case, the transmission source address of the IP packet 1661 corresponds to the IP address “EA1” of the media router 1660, the destination address corresponds to the acquired IP address “EA7” of the voice control unit 1607, the voice transmission port number of the media router corresponds to “5006”, and the UDP port number employed by the voice control unit 1607 so as to transmit the voice data corresponds to “5008”. Since both the IP address and the port number contained in the IP packet 1661 are involved in the record “EA1, 5006, EA7, 5008, IF1614” of the third row of the address administration table 1620-2, the IP packet 1661 is sent out as an IP packet 1662 (FIG. 277) to the voice IP communication line 1614 by way of the designation of the output line interface “IF1614”, and thereafter is reached via the router 1624 and the voice IP communication line 1615 to the voice control unit 1607 of the relay gateway 1606. The voice control unit 1607 derives both the IP address and the port numbers “EA1, 5006, EA7, 5008” from the received IP packet 1662, and then retrieves such a record that both an IP address and a port number thereof are made coincident with the derived IP address/port number within the media path connection table 1628-2 (FIG. 291). In this case, since a set of an IP address and a port number contained in a record of a first row of the media pass connection table 1628-2 is made coincident with the derived IP address/port number, the IP packet 1662 is regarded as the formal IP packet and therefore is received. When there is no coincident set, the above-explained IP packet is discarded. Next, the digitalized voice contained in the IP packet 1662 is converted into a speech (voice) frame 1664 (refer to FIG. 301) having a format transferred to the voice communication line 1617. The speech frame 1664 is reached via the exchanger 1608 to the exchanger 1609, so that voice is outputted from the telephone set 1611. The voice stored in the speech frame sent from the telephone set 1611 is transferred along a direction opposite to the above-explained direction to be reached to the telephone set 1610. <<Release Phase>> When the user of the telephone set 1610 notifies the release of the telephone communication (Step B50 of FIG. 278), this notification is notified from the media router 1660 to the telephone administration server 1671 (Steps B51 to B53). The telephone administration server 1671 returns the call release completion to the media router 1660 (steps B64 to B66). Also, the telephone administration server 1671 sends an IP packet 1665 (refer to FIG. 302) for notifying the telephone call release to the relay control unit 1606 (Step B55). The relay control unit 1606 returns an IP packet 1666 (FIG. 303) for notifying the release completion to the telephone administration server 1671 (Step B62). The relay control unit 1606 sends a telephone call release notification to the relay exchanger 1608 (Step B56), and then, the relay exchanger 1608 returns the release completion to the relay control unit 1606 (Step B61). The relay control unit 1608 sends the telephone call release notification to the relay exchanger 1609 (Step B57), and then, the relay exchanger 1609 returns the release completion to the relay exchanger 1608 (Step B60). The exchanger 1609 sends a telephone call cut-off signal to the telephone set 1611 (Step B58). <<Deletion of Media Path Record>> At the Step B55, the relay control unit 1606 instructs the voice control unit 1607 to delete the record of the media path of the media path connection table 1628-2 (refer to FIG. 291) in accordance with this media path connection table 1628-2, and also instructs to delete the relevant record of the CIC administration table 1605-2 (refer to FIG. 296). Furthermore, the relay control unit 1606 deletes the relevant record of the address connection table 1625-1 (FIG. 288) which is set in the above-explained telephone communication connection control. <<Deletion of Address Administration Table and CIC Administration Record>> The telephone administration server 1671 instructs the termination apparatus 1603 to delete the relevant record of the CIC administration table 1671-3 (refer to FIG. 297), which is set in the telephone communication connection control, and also to delete the relevant record of the address administration table 1620-2 (FIG. 298) managed by the termination apparatus 1603 (Step B69). <<One Variation in Termination Apparatus>> The termination apparatus 1603 may not execute the function (NAT function) capable of changing an address of a received IP packet. In this alternative case, the external IP address “EA91” of the telephone administration server is made coincident with the internal IP address “IA91”. <<Another Variation in Termination Apparatus>> Alternatively, an IP address may not be contained in the address administration table 1620 provided in the termination apparatus 1603, and the changed address administration table 1620 is indicated as an address administration table 1620-3 (FIG. 304). In this alternative case, while no IP address is registered, the port number “5060” is employed in the terminal-to-terminal connection control of the telephone sets, and the port numbers from “5004” to “5048” are employed in the telephone voice communication, and IP packets of other port numbers are discarded. As previously explained, it is prohibited to transmit/receive IP packets other than the telephone. Since the 15th embodiment is operated in the above-explained manner, both the telephone sets 1610 and 1611 can establish the telephone communications via both the IP transfer network 1600 and the public switched telephone network 1601. The relay gateway contains both the relay control unit and the voice control unit, whereas the relay control unit contains both the address connection table and the signal station address. The voice control unit contains the media path connection table. The voice control unit determines the logic communication channel provided in the voice communication line, and writes the channel identifier “CH-j” into the media path connection table. While the non-capsulation type termination gateway and the non-capsulation type relay gateway are employed, the IP packet filtering operation is carried out by which only such an IP packet may pass that the set of the IP address and the port number is registered based upon the address administration table of the termination apparatus employed in the non-capsulation termination gateway. Alternatively, the IP packet filtering operation may be carried out by which only such an IP packet may pass that the port number is registered based on the address packet. Also, the telephone communication may be carried out between the telephone set connected to the public switched network and the telephone set connected to the IP transfer network. 16. 16th Embodiment in which Control Line and Voice Line are Separated from Each Other, and are Connected to Public Switched Telephone Network In FIG. 305, reference numerals 1700 and 1701 show IP transfer networks, reference numeral 1702 represents a public switched telephone network (PSTN), reference numerals 1703 and 1704 show gateways equipped with a capsulation function, reference numeral 1705 represents a relay gateway connected to a control line 1738 of a common line signal system, reference numerals 1706 and 1707 show relay gateways connected to an IP communication line, reference numerals 1710, 1713 and 1718 are relay control units, reference numerals 1714 and 1715 show network node apparatus, and reference numerals 1716 and 1717 indicate voice (speech) control unit. Also, reference numerals 1720 and 1721 indicate telephone sets, reference numeral 1725 to reference numeral 1729 represent control communication lines, and reference numerals 1731 to 1736 indicate voice (speech) communication lines. Also, reference numerals 1725 to 1736 indicate IP communication lines, and reference numeral 1738 denotes a control communication line of a common line signal system, and reference numeral 1739 shows a voice communication line. The network node apparatuses 1714 and 1715 own IP capsulation functions which have been described in other embodiments. The IP transfer networks 1700 and 1701 are individual IP transfer networks operated by different communication companies. However, an IP packet may be transferred from one IP transfer network to the other IP transfer network via any one of the communication lines 1727 and 1734. As previously explained in other embodiments, the relay control unit 1710 employed in the termination gateway 1703 equipped with the capsulation function contains a telephone administration server, a telephone proxy server, a telephone number server, and a table administration server. Similarly, the relay control unit 1713 includes a telephone administration server, a pilot telephone server, a telephone administration server and a table administration server. <<Connection Phase>> This is such a case that a telephone communication is made from a telephone set 1720 to another telephone set 1721. In FIG. 306, reference numeral 1700-1 shows a range of the IP transfer network 1700, and reference numeral 1701-1 represents a range of the IP transfer network 1701. When the handset of the telephone set 1720 is taken up, a telephone call signal is transferred to the media router 1722 (Step E01). The media router 1722 confirms the telephone call operation (Step E02). Next, the media router 1722 produces an IP packet for requesting a telephone call connection containing the telephone number “TN-1” of the telephone set 1720 which constitutes the transmission source, and the telephone number “TN-2” of the telephone set 1721 which constitutes the destination, and then transmits the IP packet to the network node apparatus 1714. While the network node apparatus 1714 enters the IP packet, the network node apparatus 1714 produces an internal IP packet by applying the IP capsulation operation as previously explained in other embodiment, and transmits the IP packet to the termination gateway equipped with the capsulation functions 1710 (Step E03). The relay control unit 1710 produces an IP packet 1750 for requesting a telephone call connection, and then sends the IP packet to the connection IP communication line 1725. As a result, the IP packet 1750 is reached via the control IP communication line 1726 to the relay control unit 1711 (Step E05). The IP packet 1750 contains a transmission source IP address “S-ad-4”, a destination IP address “D-ad-4”, a line number “CIC-4”, a message “IAM”, and a parameter “Para-4”. The above-described parameter contains both the telephone numbers “TN-1” and “TN-2”. The destination IP address “D-ad-4” corresponds to an IP address of the relay control unit 1713. The IP packet 1750 is directly reached via the control communication line 1728 to the relay control unit 1713 employed in the relay gateway 1704 (Step E07). It should be noted that both the relay control units 1711 and 1712 may records the IP address “S-ad-4” and “D-ad-4”, the line number “CIC-4”, the message “IAM”, the telephone numbers “TN-1” and “TN-2” from the IP packet 1750 as a CIC administration table 1711-1 (FIG. 307) as explained in other embodiments. Also, the relay control unit 1712 holds such a telephone number server as explained in other embodiments. The relay control unit 1712 may retrieve a new destination IP address within the IP transfer network 1701 of the IP packet 1750 based on the destination telephone number “TN-2” and may use this new IP address as a destination IP address of the IP packet 1750. The IP packet 1751 sent out from the relay control unit 1712 is identical to the IP packet 1750, or the above-explained packet to which the new IP address is set. The IP packet 1751 is reached via the control communication lines 1728 and 1729 to the relay control unit 1713 of the termination gateway equipped with the packet function 1704 (Step E07). As previously explained in other embodiments, the relay control unit 1713 is arranged by a telephone administration server, a telephone proxy server, a telephone number server, and a table administration server. The telephone administration server employed in the relay control unit 1713 sends such an IP packet for notifying a telephone calling request to a media router based upon the IP packet 1751, and the media router 1723 receives the IP packet (Step E08). The media router 1723 notifies a telephone call setting request to the telephone set 1721 (Step E09), and returns such an IP packet for notifying that the step E08 is received (Step E11). The relay control unit 1713 produces an ACM packet and returns this ACM packet (Step E12), and the ACM packet is reached via the relay control units 1712, 1711 and 1710 to the media router 1722 (Steps E13, E14 and E15). When the telephone set 1721 notifies a telephone calling notification to the media router (Step E20), the telephone calling notification is notified via the media router 1723, the relay control units 1713, 1712, 1711, 1710, and the media router 1722 to the telephone set 1720 (Steps E21 to E26). When the telephone set 1721 responds, a telephone calling operation of the telephone set 1721 to the telephone set 1720 is notified via the media router 1723, the relay control units 1713, 1712, 1711, 1710, and the media router 1722, so that the telephone communication can be established. The voice communication is carried out between the telephone set 1720 and the telephone set 1721 (Step E38). The voice sent from the telephone set 1720 is digitalized in the media router 1722 to be stored into the IP packet, and the IP packet is reached via the network node apparatus 1714, the communication lines 1731, 1732, 1733, the voice control unit 1716, the communication line 1734, the voice control unit 1717, the communication lines 1735, 1736, and the network node apparatus 1715 to the media router 1723. In this media router 1723, the digitalized voice is converted into the analog voice which is reached to the telephone 1721. The IP-capsulation operation and the inverse-capsulation operation of the IP packet in the network node apparatus 1714 and 1715 are explained in other embodiments. When the telephone set 1720 issues the release request (Step E40), as previously explained, a series of telephone call release operations and telephone call release completion are performed, so that the telephone communication is completed (Steps E41 to E45, Steps E51 to E55). <<Connection of Various Sort of Networks>> FIG. 291 is a diagram for representing a connection between public switched networks and IP transfer networks by including other embodiments. In FIG. 308, reference numerals 1760 and 1761 represent public switched telephone networks (PSTN), reference numerals 1762 and 1763 represent IP transfer networks, reference numerals 1764 and 1765 show subscriber exchangers (LS), reference numerals 1766 and 1767 show relay exchanger, reference numerals 1768 and 1771 show termination gateways equipped with a capsulation function, reference numerals 1772 and 1773 represent relay gateways, reference numerals 1776 to 1779 denote media routers and reference numerals 1780 to 1785 indicate telephone sets. Each of the exchangers contains a relay control unit and a voice control unit. Each of the termination gateways equipped with the capsulation function and each of the relay gateways contain a relay control unit and a voice control unit. The exchanger is connected to the gateway by a control communication line and a voice control line. The network node apparatus are installed among the control lines between the relay gateway 1772 and the termination gateways equipped with the capsulation functions 1768 and 1769. The network node apparatus are installed among the control lines between the relay gateways 1773 and the termination gateways equipped with the capsulation functions 1770 and 1771. Since the construction has been explained in other embodiments, this construction is omitted in FIG. 308. As previously explained, for instance, the telephone sets 1782 and 1785 can establish the telephone communications through the media router 1776, the termination gateway equipped with the capsulation function 1768, the relay gateways 1772 and 1773, the termination gateway equipped the capsulation function 1771, and the media router 1779 under control of the terminal-to-terminal communication control. Also, the telephone set 1780 and the telephone set 1785 can establish the telephone communication via the exchangers 1764 and 1766, the relay gateways 1772 and 1773, the termination gateway equipped with the capsulation function 1771, and the media router 1779 under control of the terminal-to-terminal communication control. Furthermore, the telephone set 1780 and the telephone set 1781 can establish the telephone communication via the exchangers 1764 and 1766, the relay gateways 1772 and 1773, and the exchangers 1767 and 1765 under control of the terminal-to-terminal communication control. It should be understood that the case is advantageous for such a condition that the switching set 1766 is geographically separated far from the switching set 1767. Example with Employment of Non-Capsulation Type Termination Gateway This example is similar to the above-explained connections of the various sorts of networks. As shown in FIG. 309, termination gateways equipped non-capsulation function 1768 x to 1771 x are newly employed without using the termination gateways equipped with the capsulation function 1768 to 1771. Also, while the relay gateways 1772 and 1773 are not used, non-capsulation type relay gateways 1772 x and 1773 x are newly used which can be mutually communicated with the termination gateways equipped with the non-capsulation function. As previously described, the telephone communications can be established between the telephone sets 1782 and 1785, between the telephone sets 1780 and 1785, and between the telephone sets 1780 and 1781 under control of terminal-to-terminal communication connection controls. As explained in the above operation, the telephone communication can be carried out between the two telephone sets from the telephone set 1 via the media router 1, both the termination gateway equipped with the capsulation function and the relay gateway belonging to the IP transfer network 1, via another relay gateway and another termination gateway equipped with the capsulation function belonging to the IP transfer network 2, and the media router 2 to the telephone set 2. Furthermore, the telephone communication can be carried out between the two telephone sets from the telephone set 1 via the media router 1, both the termination gateway equipped with the non-capsulation function and the relay gateway equipped with the non-capsulation function belonging to the IP transfer network 1, via another relay gateway and another termination gateway equipped with the capsulation function belonging to the IP transfer network 2, and the media router 2 to the telephone set 2. 17. 17th Embodiment Conducting Multicast Communication The following description is made with reference to the FIGS. 310 to 312. Network node apparatuses 1801 to 1805 and routers 1807 to 1809 are provided within an IP transfer network 1800. The network node apparatuses and the routers are interconnected by IP communication lines directly or indirectly via a network node apparatus or a router. Terminals 1810-1 to 1810-19 having an IP packet transmission/reception function are connected via an IP communication line to a network node apparatus. Reference numerals 1811-1 to 1815-1 indicate address administration tables of the network node apparatuses, and reference numerals 1817-1 to 1819-1 indicate route tables of the routers. Reference numeral 1868 (in FIG. 311) shows major locations of servers for implementing the terminal-to-terminal communication connection control function in multicast communication. Reference numeral 1857 indicates a multicast administration server. Reference numerals 1855 and 1856 are user service servers. Reference numerals 1853 and 1854 are receptionists. Reference numeral 1851 is a multicast service provider. Reference numeral 1852 is a multicast service purchaser. Reference numeral 1850 is a router. Reference numeral 1859 is a tree construction server. Reference numeral 1858 is a network resource administration server for the IP transfer network 1800. Reference numerals 1861 to 1863 are table administration servers. Reference numerals 1841 to 1845 are overflow communication lines to which IP packets out of schedule are outputted. Each of the servers and routers within the IP transfer network 1800 has IP communication means which is provided with an IP address and thereby can exchange information with each other by transmitting and receiving an IP packet. Here, in the present embodiment, each server and router can be provided with a plurality of multicast IP addresses in addition to the proper IP address. The terminal 1810-2 serves also as a transmission terminal for transmitting the multicast data in a multicast service. The multicast service includes what is called multimedia data such as digitized voice, fax data, still images and moving images. <<Communication Record>> Each line of the address administration table is called a communication record or an IP communication record. The second line “I01, E01, E26, I26, G03, F02” in the address administration table 1811-1 is called a communication record between an external address “E01” and an external address “E26,” or a communication record defining an IP communication route between the terminal 1810-2 having an external address “E01” and the terminal 1810-16 having an external address “E26”. When the content of a communication record is “a, b, c, d, e, f,” the first item is “a,” and the second item is “b,” and so on. When an item is an address, it is expressed as, for example, the third address item is “c”. The first item of a communication record is called a transmission source internal IP address provided to a transmission source logical terminal (a logical connection point between an external IP communication line and a network node apparatus). The second item is called a transmission source external IP address. The third item is called a destination external IP address. The fourth item is called a destination internal IP address provided to a transmission source logical terminal. The fifth item is called an output destination specification of the internal IP packet. The sixth item is called an output destination specification of the external IP packet. <<IP Transfer Between Two Terminals>> The terminal 1810-2 (in FIG. 310) is provided with an external IP address “E01”. The terminal end of the communication line 1822 on the network node apparatus 1801 side is provided with an internal IP address “I01”. The terminal 1810-16 (in FIG. 312) is provided with an external IP address “E26”. The terminal end of the communication line 1826-6 on the network node apparatus 1804 side is provided with an internal IP address “I26”. The values in the address administration tables 1811-1 to 1815-1 of the network node apparatuses are shown in a state that the initial values have been set by a method similar to that described in the other embodiments. The following description is made for the case of IP packet transfer. The terminal 1810-2 sends out an external IP packet 1829-1 having a transmission source external IP address “E01” and a destination external IP address “E26” onto the communication line 1822. The network node apparatus 1801 then receives the external IP packet 1829-1. Next, the network node apparatus 1801 confirms that the record “I01, E01, E26, I26, G03, F02” in the second line of the address management table 1811-1 contains above-mentioned three acquired IP addresses, that is, an internal IP address “I01” provided to the terminal end of the communication line 1810-2, a transmission source external IP address “E01” within the received external IP packet 1829-1, and a destination external IP address “E26”, then forms an internal IP packet using “I01, I26” included in the record, and then sends it out as an internal IP packet 1829-2 onto the communication line 1823-2 specified by “G03” included in the record. In the above-mentioned procedure of capsulation, since the internal packet output specification “G03” (the fifth item) of the communication record “I01, E01, E26, I26, G03, F02” in question is other than “0”, an internal IP packet is formed by IP encapsulation thereby to be output. However, in case that the internal packet output specification is “0”, the IP packet in question is not encapsulated and is transferred to the overflow communication line 1841 of the network node apparatus. The router 1809 receives the internal IP packet 1829-2, and then sends out an internal IP packet 1829-3 obtained by copying the internal IP packet 1829-2, onto the communication line 1824-2 specified by the output interface “G21” specified by the route table 1819-1. The network node apparatus 1804 receives the internal IP packet 1829-3, then confirms that the record “I26, E26, E01, I01, G36, F16” in the third line of the address administration table 1814-1 contains three IP addresses “I26, E01, I01” within the internal IP packet 1829-3, then restores an external IP packet by decapsulation in which the IP header of the internal IP packet 1829-3 is eliminated, and then sends it out as an external IP packet 1829-4 onto the communication line 1826-6 specified by the output interface “F16” included in the record in question. The terminal 1810-16 receives the external IP packet 1829-4. <<Kinds of Terminal>> The terminals 1810-1 to 1810-19 are data terminals having a data transmission/reception function, telephones having a digitized voice transmission/reception function, voice transmission terminals capable of transmitting digitized voice (that is, transmitters for cable voice broadcast), voice reception terminals capable of receiving digitized voice (that is, receivers for cable voice broadcast), voice/image transmission/reception terminals or TV conferencing terminals having a digitized voice/image transmission/reception function, voice/image transmission terminals capable of transmitting digitized voice and motion pictures (that is, transmitters for cable voice/image broadcast), and voice/image reception terminals capable of receiving digitized voice and motion pictures (that is, cable TV receivers). Further, the terminals may be a combination of a media router and one of a data terminal, a telephone and a voice/image apparatus connected to the media router. The data transmitted from or received by each above-mentioned terminal is stored in the payload section of an IP packet, the multicast technology described below is applicable to each above-mentioned terminal. <<Preparation for Implementation of Multicast Communication>> The method of terminal-to-terminal communication connection control between a transmission terminal and a reception terminal is described below for the case that the terminal 1810-2 serves as a multicast transmission terminal and that each of the terminals 1810-11, 1810-13, 1810-14, 1810-17, 1810-18 serves as a multicast reception terminal. FIG. 313 shows the cost of a communication line interconnecting a network node apparatus and a router within the IP transfer network 1800 in a whole number for each communication line. In the figure, the communication cost between the network node apparatus 1801 and the router 1807 is “1”. The communication cost between the network node apparatus 1801 and the router 1809 is “2”. The communication cost between the network node apparatus 1802 and the router 1807 is “2”. The communication cost between the network node apparatus 1802 and the router 1809 is “1”. The communication cost between the router 1807 and the router 1808 is “1”. The communication cost between the router 1807 and the router 1809 is “3”. The communication cost between the router 1808 and the router 1809 is “3”. The communication cost between the router 1808 and the network node apparatus 1803 is “1”. The communication cost between the router 1808 and the network node apparatus 1804 is “4”. The communication cost between the router 1809 and the network node apparatus 1804 is “1”. The communication cost between the router 1809 and the network node apparatus 1805 is “1”. Routers and communication lines other than those shown in FIG. 313 are further included within the IP transfer network 1800. However, only routers and communication lines relevant to the communication cost calculation are shown in the figure. Further, the cost of a communication line may be assigned separately for the transmission direction and the reception direction such that, for example, the communication cost of a transmission line is “2” and that the communication cost of a reception line is “3.” However, in the present embodiment, the same communication cost is assigned to both of the transmission line and the reception line. The network resource server 1858 (in FIG. 311) retains an internal data base of the function and the like of various resources such as routers, servers, communication lines within the IP transfer network 1800. FIG. 314 is a cost table 1869 retained by the network resource server 1858 for showing the communication cost of the communication lines between the network node apparatuses and routers. The symbol “N1801” in the cost table 1869 indicates the network node apparatus 1801, and the “R1807” indicates the router 1807. The cost table 1869 is a list displaying the communication cost shown in FIG. 313. For example, the “1” in the seventh column of the second line of the cost table 1869 indicates that the communication cost from the network node apparatus 1801 to the router 1807 is “1”. The “2” in the ninth column of the second line of the cost table 1869 indicates that the communication cost from the network node apparatus 1801 to the router 1809 is “2”. The “2” in the seventh column of the third line of the cost table 1869 indicates that the communication cost from the network node apparatus 1802 to the router 1807 is “2”. The “1” in the ninth column of the third line of the cost table 1869 indicates that the communication cost from the network node apparatus 1802 to the router 1809 is “1” and so on. The procedure of multicast communication is described below with reference to FIGS. 315 to 317. The transmitter 1851 (in FIG. 311) of multicast data and the like applies to the receptionist 1853 for connecting to the network node apparatus 1801 using the terminal 1810-2 as a transmission terminal of the multicast data and the like (Step MS1 in FIG. 300). The receptionist 1853 inputs the transmission terminal information 1870 (FIG. 315) together with the transmission identification information and the charge payment method, to the user service server 1855 (Step MS2). Here, the transmission terminal information 1870 includes the information that the terminal 1810-2 for multicast transmission is connected to the network node apparatus 1801. Further, the symbol “N1801” in the transmission terminal information 1870 indicates the network node apparatus 1801, and the “T1810-2” indicates the terminal 1810-2. The user service server 1855 transmits the transmission terminal information 1870 together with the acquired transmission identification information and transmission charge payment method, to the multicast administration server 1857 (Step MS3). The multicast administration server 1857 retains the received information described above in the data base thereof (Step MS4). Described below is the case that the users of the terminals 1810-11, 1810-13, 1810-14, 1810-17, 1810-18 receive the multicast data and the like. The user 1852 applies to the receptionist 1854 for the reception of the multicast data and the like (Step MS11). The receptionist 1854 inputs the reception terminal information 1871 together with the user identification information and the reception charge payment method, to the user service server 1856 (Step MS12). Here, the reception terminal information 1871 (FIG. 316) includes the information that the terminals 1810-11, 1810-13 for multicast data reception are connected to the network node apparatus 1803, that the terminal 1810-14 is connected to the network node apparatus 1804, and that the terminals 1810-17, 1810-18 are connected to the network node apparatus 1805. Further, the symbol “N1803” in the reception terminal information 1871 indicates the network node apparatus 1803, and the “T1810-11” indicates the terminal 1810-11 and so on. The user service server 1856 transmits the reception terminal information 1871 together with the acquired reception identification information and charge payment method, to the multicast administration server 1857 (Step MS13). The multicast administration server 1857 retains the received information described above in the data base thereof (Step MS14). On receiving both the Step MS4 and the Step MS14, the multicast administration server 1857 provides a multicast identification information ID-k to the set of the transmission terminal information 1870 and the reception terminal information 1871, and then sends the information to the tree construction server 1859 (FIG. 311) (Step MS18). The tree construction server 1859 requests the resource management server 1858 for the cost table 1869 (Step MS19) thereby to obtain the cost table 1869 (Step MS20). The tree construction server 1859 determines the multicast tree structure (FIG. 318) defined by the multicast identification information ID-k using the multicast tree structure calculation module 1859-1 (FIG. 311), that is, determines the communication route of IP packet transfer by the multicast technique, and forms the address administration table additional information (FIGS. 319 to 322) for the network node apparatuses and the route table additional information (FIGS. 323 to 325) for the routers, thereby retaining them within the tree construction server 1859 (Step MS21). <<Construction of Multicast Tree Structure by Tree Construction Server>> The tree construction server 1859 then requests the table administration server 1861 to add the address administration table additional information 1811-2 and the route table additional information 1817-2 to the address administration table 1811-1 and the route table 1817-1, respectively (Step MS22). The table administration server 1861 reports the setting for the above-mentioned request (Step MS25). The tree construction server 1859 requests the table administration server 1862 to add the address administration table additional information 1813-2, the address administration table additional information 1814-2, and the route table additional information 1818-2 to the address administration table 1813-1, the address administration table 1814-1, and the route table 1818-1, respectively (Step MS23). The table administration server 1862 reports the setting for the above-mentioned request (Step MS26). The tree construction server 1859 requests the table administration server 1863 to add the address administration table additional information 1815-2 and the route table additional information 1819-2 to the address administration table 1815-1 and the route table 1819-1, respectively (Step MS24). The table administration server 1863 reports the setting for the above-mentioned request (Step MS27). Here, each table administration server is connected to a router near a network node apparatus. The meaning of the address administration table additional information and route table additional information is described later in the description of the flow of IP packet transfer. On confirmation of the completion of the Steps MS25 to MS27, the tree construction server 1859 reports the completion of the tree construction requested in the Step MS18 to the multicast administration server 1857 (Step MS28). By the above-mentioned procedure, the former half of the terminal-to-terminal communication connection control for multicast communication, that is, the construction of multicast tree structure, has completed. <<Multicast Tree Structure>> The meaning of the multicast tree structure shown in FIG. 318 is as follows. An external IP packet sent out by the terminal 1810-2 reaches the network node apparatus 1801, and then becomes an internal IP packet. The internal IP packet is bifurcated into two directions toward the router 1807 and the router 1809. The internal IP packet having reached the router 1807 goes through the router 1807 and the router 1808, and then reaches the network node apparatus 1803. The other internal IP packet reaches the router 1809. The router 1809 sends out the internal IP packet into two directions toward the network node apparatus 1804 and the network node apparatus 1805. The network node apparatus 1803 decapsulates the received internal IP packet thereby to restore an external IP packet, and then sends out the restored external IP packet to the terminal 1810-11 and the terminal 1810-13. The network node apparatus 1804 decapsulates the received internal IP packet thereby to restore an external IP packet, and then sends out the restored external IP packet to the terminal 1810-14. The network node apparatus 1805 decapsulates the received internal IP packet thereby to restore an external IP packet, and then sends out the restored external IP packet to the terminal 1810-117 and the terminal 1810-18. As such, in multicast communication, an IP packet is transferred through a communication route looking like a tree. Thus, the shape of the communication route is called a multicast tree structure. <<Construction of Tree Structure by Multicast Technique>> In the Steps MS22 to MS24, the communication from the tree construction server 1859 to the table administration servers 1861 to 1863 is carried out by TCP communication (connection communication) having a high communication reliability. However, the plurality of table administration servers are connected to a large number of routers within the IP transfer network for the above-TCP connection, and hence share the work of the initial setting and the record rewriting of the address administration tables of the network node apparatuses and the route tables of the routers. The present embodiment involves merely three routers 1807 to 1809. However, another embodiment can involve a large number of routers, for example, a hundred thousand routers, and a large number of table administration servers within an IP transfer network. In such a case, it is not advantageous that the address administration table additional information and the route table additional information are transferred from the tree construction server to the large number of table administration servers, because of a large communication traffic. Accordingly, the record of route table for the transfer of address administration table additional information and route table additional information from the tree construction server to the hundred thousand routers can be set also into each router at the time of construction of the IP transfer network. Here, it is configured so that the IP packet is transferred in a multicast tree structure for the overall communication record of each router. By virtue of this, it is avoided that the communication traffic becomes too large in the transfer of address administration table additional information and route table additional information from the tree construction server to the large number of routers. Furthermore, in order to transfer the address administration and the router table additional information from the tree construction server to the large number of table administration servers, a well-known address can also be used. <<Address Management Table>> The following description is made with reference to FIGS. 326 to 328. The first line of the address administration table 1811 includes the address administration table additional information 1811-2. The first line of the address administration table 1813 includes the address administration table additional information 1813-2. The first line of the address administration table 1814 includes the address administration table additional information 1815-2. The first line of the address administration table 1815 includes the address administration table additional information 1815-2. The terminal end of the communication line 1822 (in FIG. 326) on the network node apparatus 1801 side is provided with an internal IP address “I01”. The terminal end of the communication line 1826-1 (in FIG. 328) on the network node apparatus 1803 side is provided with internal IP addresses “I20” and “IM2”. The terminal end of the communication line 1826-2 on the network node apparatus 1803 side is provided with internal IP addresses “I22” and “IM2”. The terminal end of the communication line 1826-3 on the network node apparatus 1804 side is provided with internal IP addresses “I24” and “IM2”. The terminal end of the communication line 1826-4 on the network node apparatus 1805 side is provided with internal IP addresses “I27” and “IM2”. The terminal end of the communication line 1826-5 on the network node apparatus 1805 side is provided with internal IP addresses “I28” and “IM2”. Here, the internal IP address “IM2” is an example of an address used for multicast. <<Method of Representation of Address Administration Table>> A comment is made below on the order of description of the items within a record of the address administration tables 1811 to 1815 in the present embodiment. In the description of the prior art in the present specification, the items within a record is expressed in the order of “E1, E2, I1, I2”. However, in the present embodiment, the order of items is changed into “I1, E1, I2, E2”. The difference is merely in representation and not essential. An IP packet 1830 sent out from the terminal 1810-2 having an IP address “E01” reaches the network node apparatus 1801 via the communication line 1822. The destination address “M2” of the IP packet 1830 is a multicast external IP address, for example, “224.1.2.3” in a specific number. Here, the “224” indicates a multicast address according to IETF definition. An example of a specific number of the multicast internal IP address “IM2” is “225.1.2.3”. <<Route Table of Router>> The following description is made with reference to FIG. 327. The figure shows route tables 1817 to 1819 indicating the communication lines to which the received IP packets are to be transferred. The second line of the route table 1817 includes the route table additional information 1817-2, the second line of the route table 1818 includes the route table additional information 1818-2, and the second line of the route table 1819 includes the route table additional information 1819-2. For example, in case of the record in the second line of the route table 1817, an IP packet having a destination IP address “IM2” is transferred to the communication line 1824-1 specified by the logical communication line name G12. In case of the record in the second line of the route table 1818, an IP packet having a destination IP address “IM2” is transferred to the communication line 1825 specified by the logical communication line name G27. Further, since the record in the second line of the route table 1819 has the items “IM2” and “G21, G22”, an IP packet having a destination IP address “IM2” is transferred to the communication line 1824-2 specified by the logical communication line name G21 as well as to the communication line 1824-3 specified by the logical communication line name G22. <<Transfer of IP Packet>> Next, described below is the series of steps of IP packet transfer starting from the transmission of the external IP packet 1830. Reference numeral 1800-1 (in FIG. 329) indicates the transmission and reception of an IP packet within the IP transfer network 1800. The terminal 1810-2 transmits an external IP packet 1830 to the communication line 1822 (Step D1 in FIG. 329). On receiving the external IP packet 1830, the network node apparatus 1801 confirms the internal IP address “I01” provided to the terminal end (logical terminal) of the communication line 1822 to which the external IP packet 1830 is inputted and the destination external IP address “M2” of the IP packet 1830, then searches the content of the address administration table 1811 thereby to find a record having the transmission source internal IP address “I01” and the destination external IP address “M2” (first IP packet acceptance test), and then checks whether the searched record includes the transmission source external IP address “E01” of the IP packet 1830 or not (second IP packet acceptance test). In this example, a record including “I01, E01, M2, IM2, G02, G03, 0” is found in the first line of the address administration table 1811. By using the IP addresses “I01” and “IM2” in the record, an internal packet of the transmission source IP address “I01” and the destination internal IP address “IM2” are formed (encapsulation of IP packet). It is then sent out as an internal IP packet 1831-1 to the communication line 1823-1 corresponding to the logical communication line name G02 (Step D2), and sent out as an internal IP packet 1831-2 to the communication line 1823-2 corresponding to theological communication line name G03 (Step D3). In the procedure, when the destination external IP address “M2” of the external IP packet 1830 is not included in the address administration table 1811, the external IP packet 1830 is abandoned (first IP packet acceptance test). The above-mentioned check whether the detected record includes the transmission source IP address “E01” of the IP packet 1830 or not may be omitted. In this case, the above-mentioned second IP packet acceptance test is not carried out. The internal IP packet 1831-1 transferred via the communication line 1823-1 reaches the router 1807. Since the destination IP address of the internal IP packet 1831-1 is “IM2”, according to the “IM2, G12” of the second line of the route table 1817, it is sent out as an internal IP packet 1831-3 to the communication line 1824-1 for the logical communication line name G12 (Step D4). Here, the IP packet 1831-1 is copied to be the IP packet 1831-3. The internal IP packet 1831-3 reaches the router 1808. Since the destination IP address of the internal IP packet 1831-3 is “IM2”, according to the “IM2, G27” of the second line of the route table 1818, it is sent out as an internal IP packet 1831-4 to the communication line 1825 for the logical communication line name G27 (Step D5). Here, the IP packet 1831-3 is copied to be the IP packet 1831-4. On the other hand, the internal IP packet 1831-2 transferred via the communication line 1823-2 reaches router 1809. Since the destination IP address of the internal IP packet 1831-2 is “IM2”, according to the “IM2, G21, G22” of the second line of the route table 1819, it is sent out as an internal IP packet 1831-5 to the communication line 1824-2 for the logical communication line name G21 (Step D7), and further sent out as an internal IP packet 1831-6 to the communication line 1824-3 for the logical communication line name G22 (Step D8). Here, the IP packet 1831-2 is copied to be the IP packet 1831-5 and the IP packet 1831-6. Further, the route tables 1817 to 1819 of the routers and the route tables of the network node apparatuses may have address masks which are known to the public. However, they are omitted in this example. The internal IP packet 1831-4 reaches the network node apparatus 1803 via the communication line 1825. The left four items “IM2, M2, E01, I01” of the record “IM2, M2, E01, I01, 0, F10, F12” in the first line of the address administration table 1813 coincide with the four addresses “I01, IM2, E01, M2” in the internal IP packet 1831-4. Accordingly, the internal IP packet 1831-4 undergoes encapsulation in which the IP header is eliminated as described in the other embodiments, whereby the external IP packet 1830 is restored. The restored IP packet is sent out to the communication lines specified by the output interfaces F10 and F12. That is, it is sent out as an external IP packet 1832-1 to the communication line 1826-1 specified by the output interface F10 (Step D11), and further sent out as an external IP packet 1832-2 to the communication line 1826-2 specified by the output interface F12 (Step D13). The IP packet 1832-1 reaches the terminal 1810-11, and the IP packet 1832-2 reaches the terminal 1810-13. Similarly, the internal IP packet 1831-5 reaches the network node apparatus 1804 via the communication line 1824-2. The left four items “IM2, M2, E01, I01” of the record “IM2, M2, E01, I01, 0, F14” in the first line of the address administration table 1814 coincide with the four addresses “I01, IM2, E01, M2” in the internal IP packet 1831-5. Accordingly, the internal IP packet 1831-5 undergoes encapsulation in which the IP header is eliminated as described in the other embodiments, whereby the external IP packet 1830 is restored. The restored IP packet is sent out to the communication lines specified by the output interface F14. That is, it is sent out as an external IP packet 1832-3 to the communication line 1826-3 specified by the output interface F14 (Step D14). The IP packet 1832-3 reaches the terminal 1810-14. The internal IP packet 1831-6 reaches the network node apparatus 1805 via the communication line 1824-3. The left four items “IM2, M2, E01, I01” of the record “IM2, M2, E01, I01, 0, F17, F18” in the first line of the address administration table 1815 coincide with the four addresses “I01, IM2, E01, M2” in the internal IP packet 1831-6. Accordingly, the internal IP packet 1831-6 undergoes encapsulation in which the IP header is eliminated as described in the other embodiments, whereby the external IP packet 1830 is restored. The restored IP packet is sent out to the communication lines specified by the output interfaces F17 and F18. That is, it is sent out as an external IP packet 1832-4 to the communication line 1826-4 specified by the output interface F17 (Step D17), and further sent out as an external IP packet 1832-5 to the communication line 1826-5 specified by the output interface F18 (Step D18). The IP packet 1832-4 reaches the terminal 1810-17, and the IP packet 1832-5 reaches the terminal 1810-18. <<Prevention of Implosion of ACK Packets and NACK Packets>> Considered below is the case that in order to report the reception of an external IP packet 1832-1 to the transmitter terminal 1810-2, the terminal 1810-11 forms an external IP packet 1833 having the transmission source external IP address “M2” and the destination external IP address “E01” thereby to send it out to the communication line 1826-1 (Step D21 in FIG. 29). On receiving the external IP packet 1833, the network node apparatus 1803 confirms that the transmission source external IP address “M2” in the received external IP packet is a multicast address, and then transfers the received external IP packet intact to the packet overflow communication line 1843. The external IP packet transferred to the packet overflow communication line 1843 is abandoned. Similarly, when the network node apparatus 1804 receives an external IP packet from the terminal 1810-14 (Step D22) or when the network node apparatus 1805 receives an external IP packet from the terminal 1810-17 (Step D23), the received external IP packet is transferred intact to the communication line 1844 or 1845. The external IP packet transferred to the packet overflow communication line 1844 or 1845 is abandoned. As such, the sending-out of IP packets of individual terminal report from all the terminals receiving the multicast data to the multicast data transmitter terminal is suppressed. Accordingly, the implosion of ACK packets within the IP transfer network is prevented. Next, described below is the specific method that the network node apparatus 1803 transfers the received external IP packet 1833 to the overflow communication line 1843. The network node apparatus 1803 confirms the internal IP address “IM2” provided to the terminal end (logical terminal) of the communication line 1826-1 to which the IP packet 1833 is inputted and the destination external IP address “E01” of the IP packet 1833, then searches the communication records within the address administration table 1813 thereby to find a communication record having the transmission source internal IP address “IM2” followed by the destination external IP address “E01”, and then checks whether the searched record includes the transmission source external IP address “M2” of the IP packet 1833 or not. In this case, all of the first to the third address items of the communication record “IM2, M2, E01, I01, 0, F10, F12” in the first line of the address administration table 1813 agree. Accordingly, the record is selected. Further, since the fifth item (internal packet output specification) of the communication record is “0”, the IP packet 1833 is not encapsulated, and is then transferred to the overflow communication line 1843. In the case that the terminals 1810-13, 1810-14, 1810-17, 1810-18 transmit an external IP packet having an transmission source IP address “M2” and a destination IP address “E01” to the network node apparatuses, the IP packet is transferred to the overflow communication line of each network node apparatus by a procedure similar to the above-mentioned case. As described above, even when the reception terminal 1810-11 sends out an ACK packet for confirmation of the reception of the multicast IP packet to the transmitter terminal 1810-2, the ACK packet can not pass through the network node apparatus 1803. Accordingly, the occurrence of congestion in the IP transfer network due to ACK packet implosion is prevented. The use of IP packets on the packet overflow communication lines is described later. Even in case that the network node apparatus 1803 receives an NACK packet instead of the ACK packet from the terminal 1810-11, the NACK packet is abandoned by a similar principle. Accordingly, the NACK packet implosion is prevented. With regard to the timing of transmission of an NACK packet by the terminals 1810-11 to 1810-19, for example, the time of the IP packet transfer by multicast technique is previously determined, and then, when no IP packet is distributed at the scheduled time, an NACK packet is transmitted. <<Implementation of Cable Broadcast>> In case that the terminal 1810-2 is a voice transmission terminal capable of transmitting a digitized voice and that the terminals 1810-11, 1810-13, 1810-14, 1810-17, 1810-18 are digitized voice reception terminals, the transmission of the IP packet 1830 is a cable voice broadcast. Further, in case that the terminal 1810-2 is a voice/moving image transmission terminal capable of transmitting a digitized voice/moving image and that the terminals 1810-11, 1810-13, 1810-14, 1810-17, 1810-18 are digitized voice/moving image reception terminals, the transmission of the IP packet 1830 is a cable TV broadcast. <<Correction of Multicast Tree Structure>> The multicast tree structure can be corrected in case of an increase or decrease of the multicast data reception terminals. The receptionist 1854 (FIG. 313) previously obtains and retains the correspondence between the contents of multicast service and the multicast identification information ID-k (k=1, 2, . . . ), from the multicast administration server 1857. A use 1852 applies to the receptionist 1854 for the reception of multicast service data using the terminal 1810-15 connected to the network node apparatus 1804 (Step MS31 in FIG. 330). The receptionist 1854 acquires the receiver identification information, the charge payment method, and the terminal relevant information (that is, the fact that the network node apparatus 1804 and the terminal 1810-15 are used) from the user 1852, and then identifies the multicast identification information ID-k from the content of multicast service obtained from the user 1852. The receptionist 1854 then inputs these information to the user service server 1856 (Step MS32). The user service server 1856 transmits the acquired receiver identification information, charge payment method, terminal relevant information, and multicast identification information ID-k to the multicast administration server 1857 (Step MS33). The multicast administration server 1857 retains the reception terminal information in the data base thereof (Step MS34). The multicast administration server 1857 sends the multicast identification information ID-k and terminal relevant information (the use of the network node apparatus 1804 and the terminal 1810-15) to the tree construction server 1859 (Step MS35). The tree construction server 1859 request the network resource administration server 1858 for the cost table (Step MS36) thereby to obtain the cost table (Step MS37). Using the multicast tree structure calculation module 1859-1, the tree construction server 1859 calculates the multicast tree structure involving the above-mentioned multicast identification information ID-k and terminal relevant information, and generates the address administration table additional information for the network node apparatuses and the route table change information for the routers (Step MS38), thereby retaining them within the tree construction server 1859. The tree construction server 1859 then requests the table administration server 1862 to add the address administration table change information into the address administration table 1814 of the network node apparatus 1804 (Step MS40). The table administration server 1862 then reports the setting for the above-mentioned request (Step MS41). The tree construction server 1859 reports the completion of change of the multicast tree structure to the multicast administration server 1857 (Step MS42). The multicast administration server 1857 reports the completion of processing of the application by the user 1852 in the Step MS31, through the user service server 1856 (Step MS43), through the receptionist 1854 (Step MS44), to the user 1852 (Step MS45). The address administration table 1814 is assumed to be set by the table administration server 1862. The above-mentioned address administration table change information specifies so that the sixth item “F14” in the first line of the address management table 1814 is changed into “(F14, F15)” and that the terminal 1810-15 connected to the logical communication line “F15” is to be added as an reception terminal. As a result the first record of the address administration table 1814 is changed into “IM2, M2, E01, I01, 0, (F14, F15)”. In case that the multicast data reception by the terminal 1810-11 is to be canceled, the user 1852 applies to the receptionist for the cancellation of the multicast data reception by the terminal 1810-11. As a result, it is specified that the logical communication line “F10” connected to the terminal 1810-11 is to be deleted from the sixth item “(F10, F12)” of the first line “IM2, M2, E01, I01, 0, (F10, F12)” of the address administration table 1813 (in FIG. 311). As a result, the first line of the address administration table 1813 is changed into “IM2, M2, E01, I01, 0, F12”. The above-mentioned embodiment is for a case that the route table of the router 1807 and the like is not changed. However, depending on the content of the other correction request of the multicast tree structure, the route table change information can be generated for the route tables of the routers 1807 to 1809, or alternatively the communication record change information can be generated for the address administration tables of the other network node apparatuses 1801 and 1802. In this case, similarly to the initial setting of the tree structure, the route tables of the routers and the address administration tables of the network node apparatuses are changed by requesting to the other table administration servers 1861 and 1863. <<Release of Multicast Tree Structure>> Described below is the procedure of releasing the multicast tree structure for terminating the multicast service. The receptionist 1853 (FIG. 311) previously obtains and retains the correspondence between the contents of multicast service and the multicast identification information ID-k (k=1, 2, . . . ), from the multicast administration server 1857. The transmitter 1851 of multicast data and the like applies to the receptionist 1853 for releasing the multicast tree structure having formed by the above-mentioned procedure (Step MS60 in FIG. 330). The receptionist 1853 inputs the release of the multicast tree structure to the user service server 1855 depending on the transmission identification information and the multicast identification information ID-k (Step MS61). The user service server 1855 transmits the release of the multicast tree structure together with the transmission identification information to the multicast administration server 1857 (Step MS62). The multicast administration server 1857 records the termination of the multicast service into the data base thereof depending on the received transmission identification information and multicast tree structure release information (including the multicast identification information ID-k) (Step MS 63). The multicast administration server 1857 then instructs the tree construction server 1859 to release the multicast tree structure identified by the multicast identification information ID-k (Step MS64). Depending on the multicast identification information ID-k, the tree construction server 1859 instructs the table administration servers 1861 to 1863 to delete the address administration table additional information 1811-2, 1813-2, 1814-2, 1815-2 (FIGS. 319 to 322) from the address administration tables 1811, 1813, 1814, 1815 of the network node apparatuses and to delete the route table additional information 1817-2, 1818-2, 1819-2 (FIGS. 323 to 325) from the route tables 1817, 1818, 1819 of the routers (Steps MS66 to MS68), and then receives the report (Steps MS70 to MS72). The tree construction server 1859 reports completion using cost table 1869 to the network resource administration server 1858 (Step MS73), and then receives the check report (Step MS74). The tree construction server 1859 reports the completion of the release procedure of the multicast tree structure to the multicast administration server 1857 (Step MS77). Further, the multicast administration server 1857 reports the completion of the release procedure of the multicast tree structure, through the user service server 1855 (Step MS78), through the data transmission receptionist 1853 (Step MS79), to the data transmitter 1851 (Step MS80). Here, the Steps MS78 to MS80 are optional and may be omitted. By the above-mentioned procedure, the latter half of the terminal-to-terminal communication connection control by multicast technique, that is, the release of multicast tree structure, has completed. <<Use of Overflow Communication Line>> The usage of the overflow communication lines 1843 to 1845 is described below. Reference numerals 1801 to 1805 (in FIG. 331) indicate network node apparatuses. Reference numeral 1810-2 indicates a terminal for transmitting the multicast data. Reference numerals 1810-11 to 1810-13 indicate terminals for receiving the multicast data. Reference numerals 1880 to 1882 indicate overflow communication line servers connected to output lines 1843 to 1845. The IP packet 1833 (in FIG. 328) sent out from the terminal 1810-11, that is, the IP packet 1833 having an transmission source IP address “M2” and a destination IP address “E01,” is transferred to the overflow communication line 1843 according to the value “0” of the fifth item of the record “IM2, M2, E01, I01, 0, (F10,F12)” in the first line of the address administration table 1813. When the internal packet output specification (the fifth item) in the record is “0”, the IP packet is transferred to the overflow communication line. On the contrary, when the internal packet output specification is not “0”, the IP packet is not transferred to the overflow communication line. The following description is made with reference to FIG. 332. An IP packet 1833 sent out from the terminal 1810-11 and having a transmission source external IP address “M2” reaches the network node apparatus 1803 (Step MCI). The IP packet 1833 then reaches the overflow communication line server 1880 via the overflow communication line 1843 (Step MC2). When an IP packet having a transmission source external IP address “M2” is sent out from the terminal 1810-12, the IP packet in question reaches the network node apparatus 1803 (Step MC3). The IP packet then reaches the overflow communication line server 1880 via the overflow communication line 1843 (Step MC4). When an IP packet having a transmission source external IP address “M2” is sent out from the terminal 1810-13, the IP packet in question reaches the network node apparatus 1803 (Step MC5). The IP packet then reaches the overflow communication line server 1880 via the overflow communication line 1843 (Step MC6). In these cases, the overflow communication line server 1880 receives a plurality of IP packets the transmission source external IP address of which is “M2”, that is, a multicast IP address. When the terminals 1810-11 to 1810-13 transmit an IP packet, the transmitter terminal address is described in the payload portion of the IP packet. That is, according to the rule, the terminal 1810-11 sets the transmitter terminal address “E20”, the terminal 1810-12 sets the transmitter terminal address “E21”, and the terminal 1810-13 sets the transmitter terminal address “E22”. Thus, the overflow communication line servers 1880 to 1882 can identify the external IP address of each transmitter terminal using the IP address of each transmitter terminal. As such, when the terminals 1810-11 to 1810-13 transmit an ACK packet or NACK packet, the transmitter terminal is identifiable. The overflow communication line server 1880 can collect the information of the tree terminals obtained by the above-mentioned method, and can notify it, through the network node apparatus 1803 (Step MD1), through the IP transfer network 1800, through the network node apparatus 1801 (Step MD2), to the transmission terminal 1810-2 of the multicast data (Step MD3). Here, in order to permit the IP packet transfer between the overflow communication line server 1880 and the terminal 1810-2 for the purpose of the Steps MD1 to MD3, the records for IP encapsulation and decapsulation are set both in the address administration table 1811 in the network node apparatus 1801 and in the address administration table 1813 in the network node apparatus 1803. As a result, the multicast data transmission terminal 1810-2 can recognize whether the terminals 1810-11 to 1810-13 have received the multicast data or not (distribution confirmation function). At that time, the increase is suppressed in the amount of communication in the IP transfer network due to the increase of ACK packets and NACK packets. The overflow communication line server 1880 can transmit, an IP packet to the terminals 1810-11 to 1810-13 using an multicast address “M2” (Steps ME1 to ME4). Alternatively, the overflow communication line server 1880 can set a record including an encapsulation address into the address administration table 1813, and then transmit an IP packet to the terminal 1810-12 using an IP address “E21” (Steps MF1 to MF4). The following description is made with reference to FIG. 333. The overflow communication line server 1880 can exchange information with the multicast transmission terminal 1810-2 by transmitting and receiving an IP packet (Steps MG1 to MG3). The overflow communication line server 1881 can exchange information with the multicast transmission terminal 1810-2 by transmitting and receiving an IP packet (Steps MH1 to MH3). The overflow communication line server 1882 can exchange information with the multicast transmission terminal 1810-2 by transmitting and receiving an IP packet (Steps MI1 to MI3). As such, the overflow communication line server transmits and receives an IP packet to and from each multicast data reception terminal connected to the network node apparatus, and accordingly the multicast data transmission terminal 1810-2 does not need to transmit and receive an IP packet to and from all multicast data reception terminals, whereby the load of the multicast data transmission terminal 1810-2 is reduced. Further, for example, when the terminal 1810-11 requests the resending multicast data, the transmission terminal 1810-2 transmits IP packets using the above mentioned multicast tree structure. Thereby, high reliability of transmission can be achieved. Alternative Embodiments of Address Administration Table The address administration table 1811 (in FIG. 326) can be implemented in the form of the address administration table 1811-5 (in FIG. 334). In this embodiment, the record of the address administration table 1811-5 is formed by eliminating the second item (that is, the transmission source external IP address) of the record of the address administration table 1811. For example, the second item “E01” of the record “I01, E01, E26, I26, G03, F02” in the third line of the address administration table 1811 is eliminated thereby to become the record “I10, E26, I26, G03, F02” in the third line of the address administration table 1811-5. The IP encapsulation function of the network node apparatus in the case that the second item is eliminated is described also in the present embodiment. Further, the address management table 1811 (in FIG. 326) can be implemented in the form of the address management table 1811-6 (in FIG. 325). In this case, an address mask technique is used in the IP encapsulation by the network node apparatus. When an external IP packet having a destination external IP address “E26” and a transmission source external IP address “E01” is inputted from the communication line 1822 the internal IP address of the terminal end of which is “I01”, the records in the first line and the third line of the address administration table 1811-6 are in question. With regard to the record in the first line, it is checked whether the result of the “and” operation between a destination-use external IP mask “M-t2” and the destination external IP address “E26” in the external IP packet coincides with the destination external IP address “E2 x” in the record of the first line or not (equation (9) given below). No coincidence occurs in this case. With regard to the record in the third line, it is checked whether the result of the “and” operation between a destination-use external IP mask “M-t26” and the destination external IP address “E26” in the external IP packet coincides with the destination external IP address “E26 x” in the record of the third line or not (equation (10) given below). Coincidence occurs in this case. The transmission source IP address also is compared using the equation (11) given below, similarly to the above-mentioned cases. If (“M-t2” and “E26”=“M2x”)  (9) If (“M-t26” and “E26”=“M26x”)  (10) If (“M-h01” and “E01”=“E01x”)  (11) According to the result of above-mentioned comparison, the record of the third line is selected. Encapsulation is carried out using the internal records “I01” and “I26” of the record of the third line, thereby forming an internal IP packet. The address administration table 1811 (in FIG. 326) can be separated and represented into the table 1811-7 and the table 181-8 shown in FIGS. 336 and 337, and can then be implemented in the form of such tables on the memory. That is, the record “I01, E01, M2, IM2, (G02,G03), 0” in the first line of the address administration table 1811 is separated into the record “I01, E01, M2, IM2, MT-1, 0” in the first line of the address administration table 1811-7 and the record “MT-1, G02, G03” in the first line of the address administration table 1811-8. In other words, the multicast branching point is described in the table 1811-8. <<Summary>> The information of a multicast service provider and the information of a multicast service purchaser are accepted via a user service server thereby to be used in the setting of the multicast tree structure. A tree construction server inquires to a resource administration server for the connection information and the communication line cost of the communication lines between the network node apparatuses and the routers, thereby acquiring them. The tree construction server further notifies, to a plurality of table administration servers, the address additional information to the address administration tables in the network node apparatuses and the additional information to the route table servers in the routers, thereby setting the multicast tree structure. A multicast communication record may be set in the route table of each router, whereby using the multicast communication record, a tree construction server can transfer the address administration table additional information and the route table additional information for setting the tree structure for multicast service, to a table administration server. The transmission terminal 1810-2 can resent the multicast data, thereby high reliability multicast can be achieved. Further, a voice transmission terminal transmits digitized voice, and a plurality of digitized voice reception terminals receive the digitized voice. Furthermore, a voice/motion picture transmission terminal transmits digitized voice/moving image, and a plurality of digitized voice/moving image reception terminals receive the digitized voice/moving image. When the internal packet output specification of an address administration table is “0”, the IP packet is transferred to an overflow communication line. On the contrary, when the packet overflow parameter is not “0”, the IP packet is not transferred to the overflow communication line. Here, the determination value “0” of the internal packet output specification may be replaced by another fixed value. Further, when an IP packet including a multicast IP address as the transmission source address is detected, the IP packet is abandoned, whereby the IP packet concentration to the transmission source can be avoided. As a first address registration test, a destination multicast address is previously registered in the address administration table of a network node apparatus. When the destination multicast address in the header of an external IP packet input to the network node apparatus is not one registered in the address administration table, the network node apparatus abandons the IP packet, thereby preventing the mixing-in of an unregistered IP packet into the IP transfer network. Similarly, as a second address registration test, a transmission source multicast address is previously registered in the address administration table of the network node apparatus. When the transmission source multicast address in the header of an external IP packet inputted to the network node apparatus is not one registered in the address administration table, the network node apparatus abandons the IP packet, thereby preventing the mixing-in of an unregistered IP packet into the IP transfer network. The registration of a multicast address into the address administration table of a network node apparatus on the receiver side is not permitted, whereby an ACK packet for IP packet reception confirmation from a multicast IP packet receiver to the multicast IP packet transmitter can not pass through the network node apparatus. Accordingly, the occurrence of congestion in the IP transfer network due to ACK packet implosion and NACK packet implosion is prevented. The registration of the IP address of a router as a destination address is unpermitted, whereby the intrusion of a harmful IP packet for rewriting a multicast table and the like sent from the outside of the IP transfer network into a router within the IP transfer network is prevented. Alternatively, the registration of the IP address of an operation administration server for multicast within the IP transfer network is unpermitted, whereby the access from the outside of the IP transfer network to the operation management server within the IP transfer network is prevented. Accordingly, the informational security is improved. As a second address registration test, the transmission sources for IP packets including multicast data are restricted, whereby the occurrence of an illegal action by an illegal person is suppressed. Further, in case of the occurrence of an illegal action, the transmission source of the IP packet is easily identified, and hence the informational security of the IP transfer network is improved. 18. 18th Embodiment Conducting Multicast Communication The following description is made with reference to the FIGS. 338 to 341. Network node apparatuses 1901 to 1905 and routers 1907-1 to 1907-4 are provided within an IP transfer network 1900. The network node apparatuses and the routers are interconnected by IP communication lines directly or indirectly via a network node apparatus or a router. Terminals 1910-2 to 1910-70 having an IP packet transmission/reception function are connected via an IP communication line to a network node apparatus. Reference numerals 1911 to 1915 indicate address administration tables of the network node apparatuses. Reference numerals 1911-3, 1911-4, 1911-5, 1912-3, 1912-4, 1912-5 indicate multicast service proxy servers. Reference numerals 1913-3, 1913-4, 1913-5 indicate overflow communication line servers. Reference numerals 1941 to 1945 indicate overflow communication lines. In the present embodiment, each server and router has a plurality of multicast IP addresses in addition to the proper IP address, and can exchange information with each other by exchanging IP packets. <<Transmission Terminal and Transmission Administration Server>> The terminals 1910-02 and 1910-05 serve also as a transmission terminal for transmitting multicast data in a multicast service. The terminals 1910-06 and 1910-08 serve also as a transmission administration server for the multicast service. Each transmission administration server comprises a data base and a information processing mechanism, thereby exchanging the information with the multicast service proxy servers and sharing a part of the information processing of the multicast data transmission terminals. <<Output Destination Specification of Communication Record>> The fifth item of a communication record of an address administration table is called the output destination specification of an internal IP packet. When the value of the item is not “0”, it indicates a specified state. When the value is “0”, it indicates an unspecified state. Similarly, the sixth item of the communication record of the address administration table is called the output destination specification of an external IP packet. When the value of the item is not “0”, it indicates a specified state. When the value is “0”, it indicates an unspecified state. For example, in the communication record “IM2, M2, E02, I02, 0, (F11 to F30, F91)” in the first line of the address administration table 1913, the output destination specification of the internal IP packet is “0”, that is, unspecified. The output destination specification of the external IP packet is “F11 to F30, F91”, that is, the logical communication lines F11 to F30 and F91. Here, the logical communication lines F11 to F30 are communication lines 1960-11 to 1960-30, and the logical communication line F91 is a communication line 1960-91. <<Overflow Communication Line>> The overflow communication line server collects IP packets, such as ACK packets and NACK packets, which are replied from an reception terminal to a transmission terminal, via an overflow communication line, and then transfers them to separate multicast service proxy servers depending on the multicast address. <<Transfer of Multicast IP Packet, 1>> An external IP packet 1930 having a transmission source external IP address “E02” and a destination external IP address “M2” is sent out from the terminal 1910-02 (in FIG. 338) (Step Q1 in FIG. 342), and then reaches the network node apparatus 1901. The communication record “I02, E02, M2, IM2, . . . , 0” of the first line of the address administration table 1911 is used, whereby internal IP packets 1931-1 and 1931-2 are formed. The internal IP packet 1931-1 reaches the router 1907-1 (Step Q2), and then becomes to an internal IP packet 1931-3 thereby to reach the network node apparatus 1903 (Step Q3). On the other hand, the internal IP packet 1931-2 reaches the router 1907-2 (Step Q4). In the router 1907-2, the internal IP packet 1931-2 is copied thereby to be bifurcated into two. The internal IP packet 1931-4 reaches the network node apparatus 1904 (Step Q5), and the internal IP packet 1931-5 reaches the network node apparatus 1905 (Step Q6). On receiving the internal IP packet 1931-3, using the communication record “IM2, M2, E02, I02, 0, F11 to F30, F91” in the first line of the address administration table 1913, the network node apparatus 1903 decapsulates the internal IP packet 1931-3 thereby to restore an external IP packet (having the same content of the external IP packet 1930), and then sends out the restored external IP packet to the terminals 1910-11 to 1910-30 and the multicast service proxy server 1911-3 (Steps Q7, Q7 x). Here, the terminals 1910-11 to 1910-30 are provided with a multicast address “M2” in addition to the external IP addresses “E11” to “E30”. Further, the multicast service proxy server 1911-3 is provided with a multicast address “M2” as well as an external IP addresses “E91”. The feature of the present embodiment is that the multicast service proxy server 1911-3 receives the multicast service data (Step Q7 x) at almost the same time as that of the terminals 1910-11 to 1910-30. On receiving the internal IP packet 1931-4, using the communication record “IM2, M2, E02, I02, 0, (F31 to F50, F93)” in the first line of the address administration table 1914, the network node apparatus 1904 decapsulates the internal IP packet 1931-4 thereby to restore an external IP packet, and then sends out the restored external IP packet to the terminals 1910-31 to 1910-50 and the multicast service proxy server 1911-4 (Steps Q8 and Q8 x). Here, the terminals 1910-31 to 1910-50 are provided with a multicast address “M2” in addition to the external IP addresses “E31” to “E50”. Further, the multicast service proxy server 1911-4 is provided with a multicast address “M2” as well as an external IP addresses “E93”. On receiving the internal IP packet 1931-5, using the communication record “IM2, M2, E02, I02, 0, (F51 to F70, F95)” in the first line of the address administration table 1915, the network node apparatus 1905 decapsulates the internal IP packet 1931-5 thereby to restore an external IP packet, and then sends out the restored external IP packet to the terminals 1910-51 to 1910-70 and the multicast service proxy server 1911-5 (Steps Q9, Q9 x). Here, the terminals 1910-51 to 1910-70 are provided with a multicast address “M2” in addition to the external IP addresses “E51” to “E70”. Further, the multicast service proxy server 1911-5 is provided with a multicast address “M2” as well as an external IP addresses “E95”. <<Send-Out of IP Packet by Reception Terminal, 1>> In some cases, the terminals 1910-11 to 1910-70 send out various IP packets, such as an ACK packet for notifying a normal reception to the transmission terminal, an NACK packet for notifying a reception failure to the transmission terminal, and an IP packet for replying a question, to the transmitter terminal 1910-02 having an external IP address “E02”. The procedure for this is described below. In this example, the transmission source address is a multicast IP address “M2”, and the destination address is “E02”. The terminals 1910-11 to 1910-30 form an IP packet to be sent to the terminal 1910-02 (Step Q10) thereby to send it out to the network node apparatus (Step Q11). On receiving the external IP packet, the network node apparatus 1903 transfers the external IP packet intact to the packet overflow output line 1943 (Step Q12), because the internal IP packet output destination specification in the communication record “IM2, M2, E02, I02, 0, (F11 to F30, F91)” in the first line of the address administration table 1913 corresponding to the input external IP packet is unspecified, that is, the fifth item of the record is “0”. <<Function of Overflow Communication Line Server, 1>> The overflow communication line server 1913-3 receives an external IP packet 1946-1 (FIG. 345) from the overflow communication line 1943 (Step MPS1 in FIG. 344), then confirms that the transmission source IP address of the external IP packet 1946-1 is “M2” (Step MPS2), and then forms an IP packet 1946-2 to be sent to the multicast service proxy server 1911-3 for processing the multicast service specified by the multicast address “M2”, thereby sending out the IP packet (Step MPS3). Here, the transmission source IP address of the IP packet 1946-2 is the IP address “E90” of the overflow communication line server 1913-3, and the destination IP address is the IP address “E91” of the multicast service proxy server 1911-3. The IP packet 1946-2 is sent out from the overflow communication line server 1913-3 (Step Q13 in FIG. 342), through the network node apparatus 1903, and reaches the multicast service proxy server 1911-3 (Step Q14). At that time, the communication record “I90, E90, E91, I91, . . . , F90” in the twelfth line and the communication record “I91, E91, E90, I90, . . . , F91” in the tenth line of the address administration table 1913 are used. In this case, the multicast service proxy server 1911-3 is requested for the re-transmission of the multicast data, because the received IP packet is an NACK packet. The multicast service proxy server 1911-3 has previously received the multicast data classified by the IP address “M2” in the Step Q7 x, and hence can use the multicast data for the re-transmission request. The multicast service proxy server 1911-3 re-transmits the multicast data requested for re-transmission to the network node apparatus 1903 (Step Q15). The multicast data reaches the terminals 1910-11 to 1910-30 (Step Q16). At that time, the communication record “I91, E91, M2, IM2, . . . , F91” in the third line and the communication record “IM2, M2, E91, I91, 0, F11 to F30” in the second line of the address administration table 1913 are used. <<Function of Multicast Service Proxy Server, 1>> The multicast service proxy server 1911-3 checks the content of the received IP packet 1946-2 thereby to form an IP packet containing: the information in which ACK packets indicating the reception confirmation are concentrated and listed; the information in which NACK packets indicating the reception failure notified from the terminals are concentrated and listed; the concentrated information such as individual terminal information; and the like; and then sends it to the transmitter terminal 1910-2, or alternatively, receives an IP packet replied from the transmitter terminal 1910-2 (Steps Q41 to Q44 in FIG. 342). Here, the IP addresses of the IP packet are the external IP address “E91” of the multicast service proxy server 1911-3 and the external IP address “E02” of the transmitter terminal 1910-2. Further, the communication record “I91, E91, E02, I02, . . . , F91” in the seventh line of the address administration table 1913 and the communication record “I02, E02, E91, I91, . . . , F02” in the second line of the address administration table 1911 are used. <<Send-Out of IP Packet by Reception Terminal, 2>> The terminals 1910-31 to 1910-50 receive the multicast data in the Step Q8. The terminals 1910-31 to 1910-50 form an IP packet used for a reception confirmation and the like (Step Q20 in FIG. 342) thereby to send it to the network node apparatus 1904 (Step Q21). On receiving the external IP packet, the network node apparatus transfers the external IP packet intact without IP encapsulation to the packet overflow output line 1944 (Step Q22), because the internal IP packet output destination specification in the communication record “IM2, M2, E02, I02, 0, (F31 to F50, F93)” in the first line of the address administration table 1914 corresponding to the input external IP packet is unspecified, that is, the fifth item of the record is “0”. <<Overflow Communication Line Server, 2>> The overflow communication line server 1913-4 receives the external IP packet from the overflow communication line 1944, then confirms that the transmission source IP address of the external IP packet is “M2”, and then forms an IP packet to be sent to the multicast service proxy server 1911-4 for processing the multicast service specified by the multicast address “M2”, thereby sending out the IP packet via the communication line 1914-1 to the multicast service proxy server 1911-4 (Step Q24 in FIG. 342). In this case, the feature is that the overflow communication line server 1913-4 and the multicast service proxy server 1911-4 are interconnected by the communication line 1914-1. <<Function of Multicast Service Proxy Server, 2>> The multicast service proxy server 1911-4 has previously received the multicast data in the Step Q8 x. The multicast service proxy server 1911-4 re-transmits the multicast data requested for re-transmission to the network node apparatus 1904 (Step Q25). The multicast data reaches the terminals 1910-31 to 1910-50 (Step Q26). At that time, the communication record “I93, E93, M2, IM2, . . . , F93” in the third line and the communication record “IM2, M2, E93, I93, 0, F31 to F50” in the second line of the address administration table 1914 are used. The multicast service proxy server 1911-4 checks the content of the received IP packet thereby to form an IP packet containing: the concentrated ACK packet information; the concentrated NACK packet information; the concentrated individual terminal information; and the like; and then sends it to the transmitter terminal 1910-2, or alternatively, receives an IP packet replied from the transmitter terminal 1910-2 (Steps Q45 to Q48 in FIG. 342). Here, the communication record “I93, E93, E02, I02, . . . , F93” in the seventh line of the address management table 1914 and the communication record “I02, E02, E93, I93, . . . , F02” in the third line of the address administration table 1911 are used. <<Send-Out of IP Packet by Reception Terminal, 3>> The terminals 1910-51 to 1910-70 receive the multicast data in the Step Q9. The terminals 1910-51 to 1910-70 form an IP packet used for a reception confirmation and the like (Step Q30 in FIG. 342) thereby to send it to the network node apparatus 1905 (Step Q31). The network node apparatus 1905 transfers the external IP packet to the packet overflow output line 1945 (Step Q32). The overflow communication line server 1913-5 receives the external IP packet from the overflow communication line 1945, and then sends out the IP packet via the communication line 1915-1 to the multicast service proxy server 1911-5 (Step Q34 in FIG. 342). The multicast service proxy server 1911-5 has previously received the multicast data in the Step Q9 x. The multicast service proxy server 1911-5 re-transmits the multicast data requested for re-transmission to the network node apparatus 1905 (Step Q35). The multicast data reaches the terminals 1910-51 to 1910-70 (Step Q36). The multicast service proxy server 1911-5 checks the content of the received IP packet thereby to form an IP packet containing the concentrated ACK packet information and the like, and then sends it to the transmitter terminal 1910-2, or alternatively, receives an IP packet replied from the transmitter terminal 1910-2 (steps Q49 to Q52 in FIG. 342). Further, the multicast service proxy server 1911-5 can exchange information directly with the terminal 1910-70 by transmitting and receiving an IP packet (Steps Q38, Q39). Here, the communication record “I95, E95, E70, I70, . . . , F95” in the ninth line and the communication record “I70, E70, E95, I95, . . . F70” in the tenth line of the address administration table 1915 are used. In this case, the feature is that the multicast service proxy server 1911-5 provides a service for communicating directly with the terminal 1910-70. <<Packet Transfer of Multicast IP Address “M5”>> An external IP packet 1932 having a transmission source external IP address “E05” and a destination external IP address “M5” is sent out from the terminal 1910-05 (in FIG. 339), and then undergoes IP encapsulation via the network node apparatus 1902, thereby becoming internal IP packets 1933-1 and 1933-2. Each packet reaches the network node apparatus 1903 or 1905 via the router 1907-3 or 1907-4. Each internal IP packet is then decapsulated and sent to the terminals 1910-21 to 1910-30, 1910-41 to 1910-50, and 1910-61 to 1910-70. This procedure is shown in FIG. 343. A first major difference from FIG. 342 is that the terminal 1910-05 serves as the transmission terminal instead of the terminal 1910-02 and that the routers 1907-3 and 1907-4 are used instead of the routers 1907-1 and 1907-2. The route through which the IP packet is transferred is changed as shown in FIG. 343 (Steps R1 to R9, R7 x, R8 x, R9 x). As described above, the plurality of reception terminals connected to a network node apparatus are provided with a proper external IP address as well as one or more multicast IP addresses defined for each multicast service, whereby one or more multicast services can be used. <<Transmission Administration Server>> A second major point is that the multicast service proxy servers 1912-3 to 1912-5 can transmit the concentrated ACK information IP packet, the concentrated NACK information IP packet, and the concentrated individual terminal information IP packet to the transmission administration server 1910-08, and can receive the data sent out from the transmission administration server 1910-08 (Steps R41 to R44, R45 to R48 and R49 to R52 in FIG. 343). The transmission administration server 1910-08 and the transmission terminal 1910-05 also exchange information with each other by transmitting and receiving an IP packet (Step R55 in FIG. 343). In the transmission/reception of an IP packet between the multicast service proxy server 1912-3 (IP address “E92”) and the transmission administration server 1910-08 (IP address “E08”), the communication record “I08, E08, E92, I92, . . . , F08” in the fifth line of the address administration table 1912 and the communication record “I92, E92, E08, I08, . . . , F92” in the eighth line of the address administration table 1913 are used. In the transmission/reception of an IP packet between the multicast service proxy server 1912-4 (IP address “E94”) and the transmission administration server 1910-08, the communication record “I08, E08, E94, I94, . . . , F08” in the sixth line of the address administration table 1912 and the communication record “I94, E94, E08, I08, . . . , F94” in the eighth line of the address administration table 1914 are used. In the transmission/reception of an IP packet between the multicast service proxy server 1912-5 (IP address “E96”) and the transmission administration server 1910-08, the communication record “I08, E08, E96, I96, . . . , F08” in the seventh line of the address administration table 1912 and the communication record “I96, E96, E08, I08, . . . , F96” in the eighth line of the address administration table 1915 are used. In the transmission/reception of an IP packet between the transmission administration server 1910-08 (IP address “E08”) and the transmission terminal 1910-05 (IP address “E05”) and, the communication record “I08, E08, E05, I05, . . . , F08” in the eighth line and the communication record “I05, E05, E08, I08, . . . F05” in the ninth line of the address administration table 1912 are used. <<Overflow Communication Line Server and Multicast Service Proxy Server>> The function of the overflow communication line server and the multicast service proxy server is the same as that of the above-mentioned case of multicast IP address “M2”. On receiving an IP packet from the overflow communication line 1943 (Step MPS1 in FIG. 344, Steps R10 to R12 in FIG. 343), the overflow communication line server 1913-3 checks whether the multicast IP address of the IP packet is “M2,” “M5,” or the like (Step MPS2), and then transfers it to the multicast service proxy server 1911-3 or the multicast service proxy server 1912-3 depending on the situation (Step MPS3, Steps R13, R14 in FIG. 343). <<Initial Setting and Cancellation of Multicast IP Address>> The administrator of the IP transfer network 1900 has the authority to rewrite the communication record of the address administration tables 1911 to 1915 of the network node apparatuses. For Example, a communication record “I07, E07, M7, IM7, . . . , 0” used by the terminal 1910-7 for multicast service transmission is added to the address administration table 1911 in the network node apparatus 1901. Here, “M7” is a multicast IP address. The route information of the multicast address “M7” is added to the route tables in the routers 1907-1 to 1907-4. A communication record “IM7, M7, E07, I07, 0, F11 to F20, F91-1” used by the terminals 1910-11 to 1910-20 for multicast service reception can be added to the address administration table 1913 in the network node apparatus 1903. Here, “M7” is the same multicast IP address as the above-mentioned “M7”. The F11 to F20 indicate the output line interfaces connected to the terminals 1910-11 to 1910-20. The F91-1 indicates an output line interface connected to a multicast service proxy server newly installed. The administrator of the IP transfer network 1900 installs the above-mentioned multicast IP address “M7” in the terminals 1910-11 to 1911-20. Similarly, a communication record “IM7, M7, E07, I07, 0, F31 to F40, F93-1” used by the terminals 1910-31 to 1910-40 for multicast service reception is added to the address administration table 1914 in the network node apparatus 1904. Further, a communication record “IM7, M7, E07, I07, 0, F51 to F60, F95-1” used by the terminals 1910-51 to 1910-60 for multicast service reception can be added to the address administration table 1915 in the network node apparatus 1905. By virtue of the above-mentioned procedure, the terminals 1910-11 to 1910-20, the terminals 1910-31 to 1910-40, and the terminals 1910-51 to 1910-60 can receive the new multicast service. The terminals 1910-21 to 1910-30 can cancel the reception of the multicast IP service identified by the IP address “M5” by erasing a communication record “IM5, M5, E92, I92, 0, (F21 to F29)” in the fifth line of the address administration table 1913. <<Network Node Apparatus to which Transmission Administration Server is Connected>> In the above-mentioned embodiment, the transmission terminal 1910-05 and the transmission administration server 1910-08 are connected to the common network node apparatus 1902. However, it is possible that the terminal 1910-07 (IP address “E07”) connected to the network node apparatus 1901 is set to be a new transmission administration server, that the terminal 1910-08 (IP address “E08”) is no longer used as a transmission administration server, that the transmission terminal 1910-05 is connected to the network node apparatus 1902, and that the transmission administration server 1910-07 is connected to the network node apparatus 1901. That is, the transmission terminal 1910-05 and the transmission administration server 1910-08 can be connected to separate network node apparatuses. In this case, the communication record “I92, E92, E08, I08, . . . , F92” in the eighth line of the address administration table 1913 is changed into “I92, E92, E07, I07, . . . , F92”. The communication record “I94, E94, E08, I08, . . . , F94” in the eighth line of the address administration table 1914 is changed into “I94, E94, E07, I07, . . . , F94”. And, the communication record “I96, E96, E08, I08, . . . , F96” in the eighth line of the address administration table 1915 is changed into “I96, E96, E07, I07, . . . , F96”. Further, a communication record “I07, E07, E05, I05, . . . , F07” used between the transmission administration server 1910-07 and the transmission terminal 1910-05 and communication records “I07, E07, E92, I92, . . . , F07,” “I07, E07, E94, I94, . . . , F07”, and “I07, E07, E96, I96, . . . , F07” used between the transmission administration server 1910-07 and the multicast service proxy servers 1912-3 to 1912-5 are added in the address administration table 1911. Furthermore, a communication record “I05, E05, E07, I07, . . . , F05” within the address administration table 1912 used between the transmission terminal 1910-05 and the transmission administration server 1910-07 is added in the address administration table 1912. Further, the communication record “I08, E08, E05, I05, . . . , F08” used between the terminal 1910-08 and the transmission terminal 1910-05 and the communication records “I08, E08, E92, I92, . . . , F08” and the like used the multicast service proxy servers 1912-3 to 1912-5 are eliminated. <<Integration of Transmission Terminal and Transmission Administration Server>> Further, it is possible that the transmission terminal 1910-02 and the transmission administration server 1910-06 are provided with a common IP, and that the function of the transmission administration server 1910-06 is integrated into the function of the transmission terminal 1910-02. In that case, the function of the transmission administration server 1910-06 and the function of the transmission terminal 1910-02 are distinguished with each other by TCP port numbers and UDP port numbers. <<Variation of Overflow Communication Line>> The overflow communication line server 1913-5 shown in FIG. 341 is means for classifying the multicast IP address of an IP packet received from the overflow communication line 1945 thereby to send it to the communication line 1915-1 or 1915-2. Described below is a method in which an overflow IP packet classification function section is provided as a variation of that means. Reference numeral 1905-1 (FIG. 346) indicates a network node apparatus. Reference numeral 1915-1 indicates an address administration table. Reference numeral 1925-1 indicates an external line interface section. Reference numeral 1911-5 x indicates a multicast service proxy server having the same function as that of the server 1911-5 (FIG. 341) and identified by the multicast IP address “M2”. Reference numeral 1912-5X indicates a multicast service proxy server having the same function as that of the server 1912-5 (FIG. 341) and identified by the multicast IP address “M5”. Reference numeral 1913-5X indicates an overflow IP packet classification function section having a function similar to that of the overflow communication line server 1913-5. When the overflow IP packet classification function section 1913-5 x receives an external IP packet the transmission source of which is a multicast IP address and when the overflow parameter of the communication record is specified as “0”, the overflow IP packet classification function section determines the transmission source multicast IP address thereby to transfer the IP packet to the corresponding multicast service proxy server via the communication line 1915-1X or 1915-2X <<Implementation of Cable Broadcast and Media Distribution Communication System>> The multicast data includes what is called multimedia data such as digitized voice, fax data, still images and moving images. In case that the terminal 1910-02 is a voice transmission terminal capable of transmitting a digitized voice and that the terminals 1910-11 to 1910-70 are digitized voice reception terminals, the transmission of the IP packet 1930 is the transmission of a cable voice broadcast. Thus, a cable voice broadcast communication system is implemented using IP transfer. Further, in case that the terminal 1910-02 is a voice/moving image transmission terminal capable of transmitting a digitized voice/motion picture and that the terminals 1910-11 to 1910-70 are digitized voice/moving image reception terminals, the transmission of the IP packet 1930 is the transmission of a cable TV broadcast. Thus, a cable TV broadcast communication system is implemented using IP transfer. In a similar way, a cable fax communication system for transmitting and receiving a digitized still image is implemented using IP transfer. The above-mentioned digitized voice reception terminals and voice/moving image reception terminals can transmit an IP packet containing the individual reception terminal information, such as a comment on the received multicast data (that is, the contents of the broadcast), to the transmission terminal 1910-02. The multicast service proxy server can receive the IP packets from the plurality of reception terminals, and can send an IP packet containing the concentrated information in which the information contained in the above-mentioned IP packets has been edited into a list or a short message, to the transmission terminal and the transmission administration server. The transmission terminal and the transmission administration server can further replies an IP packet containing the comment on the result of the received IP packet containing the concentrated information, to the multicast service proxy server. As a result, a cable broadcast communication system is implemented in which the information can be exchanged between the multicast data transmitter and the multicast data receivers. As described above, the multicast service proxy server arbitrates the information exchange between the multicast data transmitter and the multicast data receivers. When the transmission media is a book, a news paper, a music or a video, the above-mentioned cable broadcast communication system can implement a book distribution communication system, a news paper distribution communication system, a music distribution communication system or a video distribution communication system as a multicast service. Here, the video indicates the information composed of voice and moving image which is digitized and stored on a video tape, a CD, or a DVD. <<Summary>> A terminal connected to a network node apparatus via an IP communication line can be provided with, in addition to the proper external IP address, one or more multicast IP addresses defined for each multicast service. A plurality of transmission terminals are possible. The multicast data transmitted by each multicast data transmission terminal is transferred through the IP transfer network, and then reaches a plurality of terminals. As such, each terminal can receive one or more multicast services. Each reception terminal can install a new multicast IP address for each multicast service and cancel it at any time by requesting to the IP transfer network operator. One of more multicast service proxy servers can be connected to a network node apparatus. The multicast service proxy server can transmit an IP packet which contains the concentrated ACK packet information, the concentrated NACK packet information, and the concentrated individual terminal information received from one or more terminals connected to the network node apparatus to which the multicast service proxy server is connected, to the transmission terminal or the transmission administration server operating the multicast service. The multicast service can be a high quality service by virtue of the improvement request such as a reception confirmation notification (ACK packet) and a reception failure notification (NACK packet). The communication company can suppress the increase in communication traffic in the IP transfer network by suppressing the ACK packets, NACK packets and individual receiver reports. Further, the distribution of multicast data not having a contract with the communication company is prevented, and the charging to the multicast service users is carried out easily. The multicast service proxy server can exchange information by transmitting and receiving an IP packet with the transmission terminal and the transmission administration server which are connected to the multicast service proxy server and operate the multicast service. The multicast service proxy server receives and retains the multicast data transmitted from the transmitter terminal. The multicast service proxy server can then send out the retained multicast data to the terminals connected to the network node apparatus to which the multicast service proxy server is connected, using the multicast function of the network node apparatus. The multicast service proxy server can exchange information by transmitting and receiving an IP packet with a specific terminal the communication record of which is set in the network node apparatus. IP encapsulation is carried out when the internal IP packet output destination specification in the communication record for specifying the method of IP encapsulation and IP decapsulation is specified, whereas IP encapsulation is not carried out when the internal IP packet output destination specification is unspecified. The external IP packet in question is then outputted to the external IP packet overflow communication line. The overflow communication line server receives a non-IP-encapsulated external IP packet via the external IP packet overflow communication line, and then transfers the information included in the external IP packet through the network node apparatus to the multicast service proxy server. The overflow communication line server receives a non-IP-encapsulated external IP packet via the external IP packet overflow communication line, and then transfers the information included in the external IP packet to the multicast service proxy server via the communication line interconnecting the overflow communication line server and the multicast service proxy server. The overflow IP packet classification function section connected to the external IP packet overflow communication line is included. IP decapsulation is carried out when the external IP packet output destination specification in the communication record is specified, whereas IP decapsulation is not carried out when the external IP packet output destination specification is unspecified. The internal IP packet in question is then outputted to the internal IP packet overflow communication line. 19. 19th Embodiment Conducting Multicast Communication Network node apparatuses have the feature of not carrying out IP encapsulation. The following description is made with reference to the FIGS. 347 to 350. Network node apparatuses 2001 to 2005 and routers 2007 to 2009 are provided within an IP transfer network 2000. The network node apparatuses and the routers are interconnected by IP communication lines directly or indirectly via a network node apparatus or a router. Reference numerals 2011 to 2015 indicate address administration tables of the network node apparatuses, and each table registers the IP addresses of the terminals connected to each network node apparatus via a communication line. Reference numerals 2016 to 2020 indicate route tables of the network node apparatuses. Reference numerals 2021 to 2023 indicate route tables of the routers. Terminals 2025 to 2039 have an IP packet transmission/reception function, and are connected to each network node apparatus via an IP communication line. Reference numerals 2045 to 2049 indicate overflow communication lines to which an unscheduled IP packet is outputted. Reference numeral 2050 indicates a multicast service proxy server. The terminal 2026 serves also as the transmission terminal for transmitting the multicast data in a multicast service. The multicast data includes what is called multimedia data such as digitized voice, fax data, static images and moving images. The terminal 2027 serves also as the transmission administration server for the multicast service. <<Transfer of IP Packet>> Next, described below is the series of steps of IP packet transfer starting from the transmission of an external IP packet 2040 by the transmission terminal 2026. The terminal 2026 transmits the external IP packet 2040 having an transmission source external IP address “E02” and a destination IP address “M2” to the communication line 2051 (Step DD1 in FIG. 350). The network node apparatus 2001 checks whether the transmission source IP address “E02” of the received external IP packet 2040 is registered in the address administration table 2011 or not (IP packet acceptance test). In this case, the set of the logical communication line name “F02” and the IP address “E02” of the communication line 2051 is registered as “F02, E02” in the record in the second line of the address administration table 2011, and hence the IP packet 2040 is accepted. In case that the IP address is not registered, the received IP packet is transferred intact to the packet overflow communication line 2045, and then abandoned. Next, with regard to the record “Msk-m2, M2, (G02, G03)” in the first line of the route table 2016, it is checked whether the result of the “and” operation between the first item “Msk-m2” of the record and the destination IP address “M2” of the IP packet 2040 coincides with the second item “M2” of the record or not (the following equation (12)). Coincidence occurs in this case. Here, the value of address mask “Msk-m2” is “255.255.255.255” in this case. If (“Msk-m2” and “M2”=“M2”)  (12) Next, with regard to the third item G02 and G03 of the record, an IP packet 2041 is sent out to the communication line 2053 having the logical communication line name “G02” (Step DD2), while an IP packet 2042 is sent out to the communication line 2054 having the logical communication line name “G03” (Step DD3). The IP packets 2041 and 2042 are generated by copying the IP packet 2040. In the above-mentioned procedure, when the destination IP address “M2” of the IP packet 2040 is not included in the route table 2016, the IP packet 2040 is abandoned (registration test of multicast address). The IP packet 2041 reaches the router 2007, and is then sent out as an IP packet 2043 to the communication line 2055 having a logical communication line name G12 according to the record “M2, G12” in the second line of the route table 2021 (Step DD4). The IP packet 2043 reaches the router 2008, and is then sent out as an IP packet 2034 to the communication line 2058 having a logical communication line name G27 according to the record “M2, G27” in the second line of the route table 2022 (Step DD5). On the other hand, the IP packet 2042 sent out to the communication line 2054 reaches router 2009, and is then sent out as an IP packet 2035 to the communication line 2056 having a logical communication line name “G21” (Step DD6) and as an IP packet 2036 to the communication line 2057 for the logical communication line name “G22” (Step DD7), according to the “M2, G21, G22” of the second line of the route table 2023. The IP packets 2035 and 2036 are generated by copying the IP packet 2042. Here, the route tables 2021 to 2023 of the routers may have address masks similar to those of the route table 2016 of the network node apparatus. However, they are known to the public and hence omitted. The IP packet 2034 reaches the network node apparatus 2003 via the communication line 2058. With regard to the record “Msk-m2, M2, (F10, F12, F22)” in the first line of the route table 2018, it is checked whether the result of the “and” operation between the first item “Msk-m2” of the record and the destination IP address “M2” of the IP packet 2034 coincides with the second item “M2” of the record or not (the following equation (13)). Coincidence occurs in this case. Here, the value of address mask “Msk-m2” is “255.255.255.255” in this case. If (“Msk-m2”) and “M2”=“M2”)  (13) Next, with regard to the third item F10, F12, F22 of the record, an IP packet 2038 is sent out to the communication line 2060 having a logical communication line name “F10” (Step DD11). An IP packet 2039 is sent out to the communication line 2061 having a logical communication line name “F12” (Step DD13). An IP packet is sent out to the communication line 2059 having a logical communication line name “F22” (Step DD9). The terminals 2031, 2033 receive the multicast data via the communication lines 2060, 2061, respectively. The multicast service proxy server 2050 retains the multicast data received via the communication line 2059 in an internal data base. The network node apparatus 2004 receives the IP packet 2035, and then sends out an IP packet 2040 copied from the IP packet 2035 using the record “Msk-m2, M2, F13” in the first line of the route table 2019 in a procedure similar to that of the above-mentioned network node apparatus 2003, to the communication line 2062 having a logical communication line name “F13” (Step DD14). The network node apparatus 2005 receives the IP packet 2036, and then sends out IP packets 2041, 2042 copied from the IP packet 2035 using the record “Msk-m2, M2, (F16, F17)” in the first line of the route table 2020 in a procedure similar to that of the above-mentioned network node apparatus 2003, to the communication lines 2063, 2064, respectively (Steps DD17, DD18). <<Prevention of Implosion of ACK Packets and NACK Packets>> In order to report the information relevant to the reception of the IP packet 2038, such as an ACK packet for reception report, an NACK packet for reception failure report, and an individual terminal report, to the transmission terminal 2026, the terminal 2031 forms an IP packet 2044 having the transmission source external IP address “M2” and the destination external IP address “E02” thereby to send it out to the communication line 2060 (Step DD21 in FIG. 350). Similarly, in order to report the reception of the IP packet 2039 to the transmission terminal 2026, the terminal 2033 sends out an IP packet having the transmission source external IP address “M2” and the destination external IP address “E02” to the communication line 2061 (Step DD22). On receiving the IP packets sent out by the terminals 2031, 2033 for the report to the transmission terminal 2026, the network node apparatus 2003 checks whether the transmission source external IP address “M2” of the IP packets is registered in the address administration table 2013 or not. Since it is not registered in this case, the received IP packets are transferred intact to the packet overflow communication line 2059 (Step DD26). As such, the sending-out of IP packets of individual terminal report from all the terminals receiving the multicast data to the multicast data transmission terminal is suppressed. Accordingly, the implosion of ACK packets and NACK packets within the IP transfer network is prevented. <<Data Transmission by Multicast Service Proxy Server>> The multicast service proxy server 2050 has received the multicast data transmitted by the terminal 2026 in the Step DD9, and retains it in the internal data base. When the terminal 2031 or 2033 requests the re-transmission of the multicast data in the step DD21 or DD22, the multicast service proxy server 2050 can re-transmit the retained multicast data through the network node apparatus 2003 (Step DD27) to the terminal 2031 (Step DD28) or to the terminal 2033 (Step DD29). At that time, the first line “Msk-m2, M2, (F10, F12, F22) of the route table 2018 within the network node apparatus 2003 is used for the transmission of this multicast data. <<Data Transmission to and Reception from Transmission Terminal>> The multicast service proxy server 2050 sends the formed IP packet containing the concentrated information to the transmission terminal 2026, or alternatively, receives an IP packet replied from the transmission terminal 2026 (Steps DD41 to DD45 in FIG. 350). Here, the IP addresses of the IP packet are the IP address “E22” of the multicast service proxy server 2050 and the IP address “E02” of the transmission terminal 2026. Used here are the communication record “F22, E22” in the fourth line of the address administration table 2013, the communication record “Msk22, E22, F22” in the fifth line of the route table 2018, the communication record “F02, E02” in the second line of the address administration table 2011, and the communication record “Msk02, E02, F02” in the third line of the route table 2016. As such, the multicast service proxy server can exchange information by transmitting and receiving an IP packet with the transmission terminal 2026 which is connected to the multicast service proxy server and operates the multicast service. <<Data Transmission to and Reception from Transmission Administration Server>> The multicast service proxy server 2050 sends the formed IP packet containing the concentrated information (the concentrated ACK packet information, the concentrated NACK packet information, and the concentrated individual terminal information) to the transmission administration server 2027, or alternatively, can receive an IP packet replied from the transmission administration server 2027 (Steps DD46 to DD50 in FIG. 350). Here, the IP addresses of the IP packet are the IP address “E22” of the multicast service proxy server 2050 and the IP address “E03” of the transmission administration server 2027. Used here are the communication record “F22, E22” in the fourth line of the address administration table 2013, the communication record “Msk22, E22, F22” in the fifth line of the route table 2018, the communication record “F03, E03” in the third line of the address administration table 2011, and the communication record “Msk03, E03, F03” in the fourth line of the route table 2016. As such, the multicast service proxy server can exchange information by transmitting and receiving an IP packet with the transmission administration server which is connected to the multicast service proxy server and operates the multicast service. <<Exchange of Information Between Transmission Terminal and Transmission Administration Server>> The transmission terminal and the transmission administration server can exchange information with each other by exchanging an IP packet in order to operate the multicast service (Step DD51 in FIG. 350). Further, it is possible that the transmission terminal 2026 and the transmission administration server 2027 are provided with a common IP address, and that the function of the transmission administration server 2027 is integrated into the function of the transmission terminal 2026. In that case, the function of the transmission administration server 2027 and the function of the transmission terminal 2026 are distinguished with each other by TCP port numbers and UDP port numbers. <<Network Node Apparatus to which Transmission Administration Server is Connected>> In the above-mentioned embodiment, the transmission terminal 2026 and the transmission administration server 2027 are connected to the common network node apparatus 2001. However, it is possible that the terminal 2028 (IP address “E04”) connected to the network node apparatus 2002 is set to be a new transmission administration server, and that the transmission administration server 2027 is no longer used as the transmission administration server. That is, the transmission terminal and the transmission administration server can be connected to separate network node apparatuses. In this case, in the multicast service proxy server 2050 and the transmission terminal 2026 which transmit and receive an IP packet to and from the transmission administration server 2028, the IP address “E04” is used for the transmission administration server in the transmission/reception of the IP packet. <<Variation of Network Node Apparatus>> The network node apparatus 2001 (in FIG. 347) can be implemented by separating it into an address administration module 2090 and a router 2091 shown in FIG. 351. Here, the address administration module 2090 and the router 2091 can exchange information with each other via a line 2092. The address administration table 2011 x in the address administration module 2090 contains the same information of the address administration table 2011 in the network node apparatus 2001, and the route table 2016 x in the router 2091 contains the same information of the route table 2016 in the network node apparatus 2001. The address administration module 2090 is implemented by a server implemented by a personal computer, or by a hardware module. <<Transfer of IP Packet Using Address Administration Module>> Described below is the IP packet transfer within the IP transfer network 2000 with reference to FIG. 351. The terminal 2026 transmits an external IP packet 2040 having an transmission source external IP address “E02” and a destination IP address “M2” to the communication line 2051. The router 2091 receives the external IP packet 2040 via the communication line 2051, and then sends the received external IP packet 2040 through the line 2092 to the address administration module 2090. The address administration module 2090 checks whether the transmission source IP address “E02” of the received external IP packet 2040 is registered in the address administration table 2011 x or not. In this case, the address administration module confirms that the set of the logical communication line name “F02” and the IP address “E02” of the communication line 2051 is registered as “F02, E02” in the record in the second line of the address administration table 2011 x, and then notifies the confirmation result to the router 2091. In response to the report from the address administration module 2090, the router 2091 accepts the IP packet 2040. In case that the IP packet is not registered, the received IP packet is transferred intact to the packet overflow communication line 2045, and then abandoned. Next, with regard to the record “Msk-m2, M2, (G02, G03)” in the first line of the route table 2016 x, the router 2091 checks whether the result of the “and” operation between the first item “Msk-m2” of the record and the destination IP address “M2” of the IP packet 2040 coincides with the second item “M2” of the record or not (the following equation (14)). Coincidence occurs in this case. Here, the value of address mask “Msk-m2” is 255.255.255.255 in this case. If (“Msk-m2”) and “M2”=“M2”)  (14) Next, with regard to the third item G02 and G03 of the record, an IP packet 2041 is sent out to the communication line 2053 having the logical communication line name “G02”, while an IP packet 2042 is sent out to the communication line 2054 having the logical communication line name “G03”. The network node apparatus 2003 (FIG. 349) can be replaced by the combination of an address administration module and a router having a function similar to the above-mentioned one. Here, the replaced address administration module comprises a address administration table containing the same information of the address administration table 2013, and the replaced router comprises the same information of the route table 2018. By a similar principle, the network node apparatuses 2004 and 2005 can be replaced by the combinations of an address administration module and a router having a function similar to the above-mentioned one. They comprise the same information of the address administration tables and the route tables in the network node apparatuses 2004 and 2005. <<Implementation of Cable Broadcast and Media Distribution Communication System>> In case that the terminal 2026 is a voice transmission terminal capable of transmitting a digitized voice and that the terminals 2031 to 2039 are digitized voice reception terminals, the transmission of the IP packet 2040 is the transmission of a cable voice broadcast. Thus, a cable voice broadcast communication system is implemented using IP transfer. Further, in case that the terminal 2060 is a voice/moving image transmission terminal capable of transmitting a digitized voice/moving image picture and that the terminals 2031 to 2039 are digitized voice/moving image reception terminals, the transmission of the IP packet 2040 is the transmission of a cable TV broadcast. Thus, a cable TV broadcast communication system is implemented using IP transfer. In a similar way, a cable fax communication system for transmitting and receiving a digitized still image is implemented using IP transfer. The above-mentioned digitized voice reception terminals and voice/moving image reception terminals can transmit an IP packet containing the individual reception terminal information, such as a comment on the received multicast data (that is, the contents of the broadcast), to the transmission terminal 2026. The multicast service proxy server can receive the IP packets from the plurality of reception terminals, and can send an IP packet containing the concentrated information in which the information contained in the above-mentioned IP packets has been edited into a list or a short message, to the transmission terminal and the transmission administration server. The transmission terminal and the transmission administration server can further replies an IP packet containing the comment on the result of the received IP packet containing the concentrated information, to the multicast service proxy server. As a result, a cable broadcast communication system is implemented in which the information can be exchanged between the multicast data transmitter and the multicast data receivers. As described above, the multicast service proxy server arbitrates the information exchange between the multicast data transmitter and the multicast data receivers. When the transmission media is a book, a news paper, a music, or a video, the above-mentioned cable broadcast communication system can implement a book distribution communication system, a news paper distribution communication system, a music distribution communication system, or a video distribution communication system as a multicast service. Here, the video indicates the information composed of voice and moving images which is digitized and stored on a video tape, a CD, or a DVD. <<Summary>> Each terminal is connected through a communication line to a router to which an address administration module is connected. The transmission source IP address is registered in the address administration table of the address administration module. When the transmission source IP address in the header of an IP packet being input to the router is registered in the address administration table in the address administration module, the IP packet is transferred. When it is not registered, the IP packet is transferred to the overflow communication line of the router, whereby the mixing-in of an unscheduled IP packet into the IP transfer network is prevented. Further, when the destination multicast IP address in the header of an IP packet being inputted to the router is not registered in the route table of the router, the IP packet is transferred to the overflow communication line of the router, whereby the mixing-in of an unscheduled IP packet into the IP transfer network is prevented. When the IP address of a terminal is registered in the address administration table of a network node apparatus, the IP packet is transmitted. When it is not registered, the IP packet is transferred to the overflow communication line. The IP packet is either abandoned or sent to the multicast service proxy server. The registration of a multicast address into the address administration table of a network node apparatus is not permitted, whereby an ACK packet for IP packet reception confirmation from a multicast IP packet receiver to the multicast IP packet transmitter, an NACK packet for reception failure notification, and an individual report packet can not pass through the network node apparatus. Further, in case that a destination multicast address is registered in the route table of a network node apparatus, when the destination multicast IP address in the header of an IP packet being inputted to the network node apparatus is registered in the route table, the IP packet is transferred. When it is not registered in the route table, the IP packet is abandoned by the network node apparatus, whereby the mixing-in of an unscheduled IP packet into the IP transfer network is prevented. The multicast service proxy server receives the multicast data transmitted by the transmission terminal, and retains it in the inside. The multicast service proxy server can then send out the retained multicast data to a terminal connected to the network node apparatus to which the multicast service proxy server is connected, using the multicast function of the network node apparatus. The multicast service proxy server can transmit an IP packet which contains the concentrated ACK packet information, the concentrated NACK packet information, and the concentrated individual terminal information received from one or more terminals connected to the network node apparatus to which the multicast service proxy server is connected, to the transmission terminal or the transmission administration server operating the multicast service. The multicast service proxy server can exchange information by transmitting and receiving an IP packet with the transmission terminal and the transmission administration server which are connected to the multicast service proxy server and operate the multicast service. Further, the multicast service proxy server uses the information contained in an IP packet received via the IP packet overflow communication line. A cable voice broadcast communication system, a cable TV broadcast communication system, or a cable fax communication system by IP transfer can be implemented by using a voice transmission terminal, a voice/moving image transmission terminal, or a still image transmission terminal capable of transmitting a digitized voice, a voice/moving image, or a still image. The cable broadcast reception terminals can transmit an IP packet containing the individual reception terminal information to the transmission terminal. As a result, a cable broadcast communication system is implemented in which the information can be exchanged between the multicast data transmitter and the multicast data receivers. The multicast service proxy server arbitrates the information exchange between the multicast data transmitter and the multicast data receivers. The multicast service can be a high quality service by virtue of the improvement request such as a reception confirmation notification (ACK packet) and a reception failure notification (NACK packet). The communication company can suppress the increase in communication traffic in the IP transfer network by suppressing the ACK packets, NACK packets, and individual receiver reports. Further, the distribution of multicast data not having a contract with the communication company is prevented, and the charging to the multicast service users is carried out easily. 20. 20th Embodiment Conducting Multicast Communication The following description is made with reference to the FIG. 352. An IP transfer network 2100 comprises: the administration region 2101 of a communication company X; the administration region 2102 of a communication company Y; network node apparatuses 2103 to 2114; routers 2115-1 to 2115-11; and a router 2116. The network node apparatuses and the routers are interconnected by IP communication lines directly or indirectly via a network node apparatus or a router. Terminals 2117 to 2133 having an IP packet transmission/reception function are connected to each network node apparatus via an IP communication line. Reference numerals 2140 to 2143 indicate multicast P service proxy servers. Reference numerals 2144 to 2147 indicate multicast Q service proxy servers. Reference numerals 2048 to 2051 indicate overflow communication servers. The communication company X and the communication company Y manage the router 2116 in cooperation. All of the network node apparatuses 2103 to 2114 are apparatuses having an IP encapsulation/IP decapsulation function, or alternatively, all of them are apparatuses not having an IP encapsulation/IP decapsulation function. The internal configuration of each network node apparatus is described in another embodiment. <<Transmission Terminal and Transmission Work Server of Communication Company>> The electronic news paper distribution service by a news paper publishing company “A” is designated to a multicast P service, whereas the news distribution service by a broadcast station B is designated to a multicast Q service. The terminal 2117 is a multicast data transmission terminal managed by the communication company X. The terminal 2118 is a transmission work server managed by the communication company X. The terminal 2120 is a multicast data transmission terminal managed by the communication company Y. The terminal 2122 is a transmission work server managed by the communication company Y. The terminal 2123 is a terminal managed by the news paper publishing company “A”, and is a multicast P service terminal for transmitting the electronic news paper published by the news paper publishing company “A” to the transmission work server 2118 of the communication company X and the transmission work server 2122 of the communication company Y and for conducting the work communication on the electronic news paper distribution. The terminal 2119 is a terminal managed by the broadcast station B, and is a multicast Q service terminal for transmitting the (voice/moving image) TV news distribution service provided by the broadcast station B to the transmission administration server 2118 of the communication company X and the transmission work server 2122 of the communication company Y and for conducting the working/notifying communication on the electronic news paper. The transmission work server 2118 represents the communication company X, and processes the administrative work on the transmission of the multicast data, such as the distribution of the electronic news paper published by the news paper publishing company “A”, the TV news distribution service by the broadcast station B, and the electronic stock price announcement service by a securities company C. Similarly, the transmission work server 2122 represents the communication company Y, and processes the administrative work on the transmission of the multicast data. <<Transfer of Multicast IP Packet>> The electronic news paper is stored as the digital information in a large number of IP packets, and each packet is called an electronic news paper IP packet. The news paper publishing company “A” transmits the electronic news paper IP packet from the terminal 2123 of the news paper publishing company “A” to the transmission work server 2118 of the communication company X(Step 2160 in FIG. 353). The electronic news paper IP packet goes through the network node apparatus 2111, through the routers 2115-10, 2115-7, 2115-6, 2116, 2115-5, 2115-3, 2115-1, through the network node apparatus 2103, and then reaches the transmission work server 2118. The transmission of the electronic news paper IP packet from the terminal 2123 to the transmission work server 2118 can be carried out by any one of UDP communication technique (connection-less communication) and TCP communication technique (connection communication). The transmission work server 2118 retains the received electronic news paper IP packet in the internal data base (Step 2161). The transmission work server 2118 then transmits the received and retained electronic news paper IP packet to the transmission terminal 2117 (Step 2162). The transmission terminal 2117 retains the received electronic news paper IP packet. The transmission of the electronic news paper IP packet from the transmission work server 2118 to the terminal 2117 can be carried out by any one of UDP communication technique and TCP communication technique. The transmission terminal 2117 transmits the retained electronic news paper IP packet to the network node apparatus 2103 (Step 2163). Here, the destination address is a multicast address “Mx”. The transmitted electronic news paper IP packet is, at the same time, transferred within the multicast-dedicated IP transfer network 2152 thereby to reach the network node apparatuses 2106 to 2108 (Step 2171 to 2174), to reach the electronic news paper IP packet reception terminals 2124 to 2128 (Step 2175 to 2177), and at the same time, to reach the multicast P service proxy servers 2140 to 2141 (Step 2178). The terminals 2124 to 2125 transmit an ACK packet notifying the normal reception of the electronic news paper IP packet or an NACK packet notifying the failure of the IP packet (Step 2181). The ACK or NACK packet is transferred to the multicast P service proxy server 2140 in charge of the electronic news paper distribution service (Step 2183). Similarly, the terminals 2126 to 2127 transmit an ACK packet or an NACK packet notifying the situation of reception of the IP packet (Step 2182). The ACK or NACK packet is transferred to the multicast P service proxy server 2141 (Step 2184). The transmission of an ACK packet or an NACK packet from the terminal 2128 is in a similar manner. The multicast P service proxy servers 2140 to 2141 re-transmits the electronic news paper IP packet as the multicast data to the terminals 2124 to 2127 (Steps 2185, 2186). The multicast P service proxy servers 2140 to 2141 form an IP packet for reporting the situation of reception of the electronic news paper IP packet, and then sends it out to the network node apparatuses 2106 to 2107 (Step 2187). The IP packet goes through the IP transfer network 2152 (Step 2188), through the network node apparatus 2103, and then reaches the transmission work server 2118 (Step 2189). The transmission work server 2118 managed by the communication company X can calculate the usage charge of the IP transfer network 2101 managed by the communication company X depending on the information relevant to the electronic news paper IP packet distribution in the Steps 2162 and 2189. The transmission work server 2118 uses the information contained in the content of the received IP packet thereby to form an IP packet containing the report item to the news paper publishing company “A”, and then transmits the formed IP packet to the terminal 2123 of the news paper publishing company “A” (Step 2190). Here, the IP packet goes through the network node apparatus 2103 and the routers 2115-1, 2115-3, 2115-5, 2116, 2115-6, 2115-7, 2115-10, 2111, and then reaches the terminal 2123. The news paper publishing company “A” receives the IP packet, and then confirms the situation of distribution of the electronic news paper IP packet having requested to the communication company X. On completion of the Step 2160, the news paper publishing company “A” transmits the electronic news paper IP packet from the terminal 2123 of the news paper publishing company “A” to the transmission work server 2122 of the communication company Y(Step 2164 in FIG. 353). Here, the electronic news paper IP packet goes through the network node apparatus 2111, through the router 2115-10, through the network node apparatus 2110, and then reaches to the transmission work server 2122. The transmission work server 2122 retains the received electronic news paper IP packet in the internal data base (Step 2165). The transmission work server 2122 receives an authentication that the transmission work server 2122 is an authorized transmission work server qualified for transmitting the electronic news paper IP packet, from the transmission terminal 2120 (Step 2260). The transmission work server 2122 then transmits the received and retained electronic news paper IP packet to the transmission terminal 2120 (Step 2166). The transmission terminal 2120 retains the received electronic news paper IP packet. Further, in the Step 2164, the terminal 2123 of the news paper publishing company “A” can receive an authentication that the terminal itself is correctly the terminal 2123 of the news paper publishing company “A”, from the transmission work server 2122 of the communication company Y. The transmission terminal 2120 transmits the retained electronic news paper IP packet to the network node apparatus 2109 (Step 2167). Here, the destination address is a multicast address “My”. The transmitted electronic news paper IP packet is, at the same time, transferred within the multicast-dedicated IP transfer network 2153 thereby to reach the network node apparatuses 2112 to 2114 (Step 2191 to 2194), to reach the electronic news paper IP packet reception terminals 2129 to 2133 (Step 2195 to 2197), and at the same time, to reach the multicast P service proxy servers 2142 to 2143 (Step 2198). The terminals 2129 to 2133 transmit an ACK packet or an NACK packet notifying the situation of reception of the IP packet (Steps 2201, 2202). The ACK or NACK packet is transferred to the multicast P service proxy server 2142 or 2143 in charge of the electronic news paper distribution service (Steps 2203 or 2204). The multicast P service proxy servers 2142 to 2143 re-transmits the electronic news paper IP packet as the multicast data to the terminals 2129 to 2133 (Steps 2205, 2206). The multicast P service proxy servers 2142 to 2143 form an IP packet for reporting the situation of reception of the electronic news paper IP packet, and then sends it out to the network node apparatuses 2112 to 2113 (Step 2207). The IP packet goes through the IP transfer network 2153 (Step 2208), through the network node apparatus 2109, and then reaches the transmission work server 2122 (Step 2209). The transmission work server 2122 managed by the communication company Y calculates the usage charge of the IP transfer network 2102 managed by the communication company Y. The transmission work server 2122 uses the information contained in the content of the received IP packet thereby to form an IP packet containing the report item to the news paper publishing company “A”, and then transmits the formed IP packet to the terminal 2123 of the news paper publishing company “A” (Step 2210). Here, the IP packet goes through the network node apparatus 2110, through the router 2115-10, through the network node apparatus 2111, and then reaches the terminal 2123. The news paper publishing company “A” receives the IP packet, and then confirms the situation of distribution of the electronic news paper IP packet having requested to the communication company X. The multicast Q service can be implemented by a similar method. <<Procedure of Authentication>> As a procedure of authentication in the Step 2260, there are various techniques known to the public. An example is described below with reference to FIG. 354. The transmission work server 2122 and the transmission terminal 2120 retain a common function y=f (a, b) and a secret authentication key “K” in the inside. The transmission work server 2122 transmits the information “ID2122” for identifying the transmission work server 2122 to the transmission terminal 2120 (step 2160-1). The transmission terminal 2120 receives the information “ID2122” for identifying the transmission work server 2122, then generates a random number “R”, then calculates and retains C1=f (K, R), and then transmits the random number “R” to the transmission work server 2122 (Step 2160-2). The transmission work server 2122 uses the received random number “R”, the authentication key “K,” and the function “f” thereby to calculate C2=f (K, R), and then transmits the “C2” to the transmission terminal 2120 (Step 2160-3). The transmission terminal checks whether the generated and retained “C1” coincides with the received “C2” or not. When the coincidence occurs, it has been confirmed that the transmission work server 2122 has the authorized authentication key “K” and hence the transmission work server 2122 is the authorized transmission work server. <<Variation>> The following description is made with reference to the FIG. 355. An IP transfer network 2100-1 comprises: the administration region 2101-1 of a communication company X; the administration region 2102-1 of a communication company Y; network node apparatuses 2104-1, 2105-1, 2107-1 to 2114-1; routers 2230, 2232; address administration modules 2231, 2233; routers 2115-1 to 2115-11; and a router 2116. All of the network node apparatuses 2104-1, 2105-1, 2107-1 to 2114-1 are apparatuses not having an IP encapsulation/IP decapsulation function. The internal configuration of each network node apparatus is the same as that described in another embodiment. The router 2230 and the address administration module 2231 are interconnected and integrated through a line thereby to serve as the network node apparatus. Similarly, the router 2232 and the address administration module 2233 are interconnected and integrated through a line thereby to serve as the network node apparatus. As such, a multicast service can be implemented similarly to the multicast service described with reference to FIGS. 352 and 353. The terminal 2123 of the news paper publishing company “A” providing the multicast service transmits an electronic news paper IP packet to the transmission work servers 2118 and 2122. The transmission work servers 2118 and 2122 can distribute the received electronic news paper IP packet through the IP transfer networks 2101-1 and 2102-1 to the reception terminals 2124 to 2133, by multicast technique. The result of the distribution is reported to the transmission work servers 2118 and 2122, whereby the charging on the reception terminals 2124 to 2133 is carried out. Here, the IP transfer networks 2152 and 2153 are unnecessary to be multicast-dedicated IP transfer networks. Thus, the multicast service can be implemented in the IP transfer networks being shared with the IP transfer for IP telephone, data transfer, or voice/image transfer described in another embodiment. <<Setting of Address Administration Table and Route Table>> With regard to the address administration tables of the network node apparatuses and the route tables of the routers in the administration region 2101-1 of the communication company X and the administration region 2102-1 of the communication company Y, the setting of separate address administration tables and separate route tables for each multicast service is necessary (setting of multicast tree structure). For this purpose, a method described in another embodiment is applicable. Further, techniques, described in another embodiment, of the change of the multicast tree structure due to the increase or decrease in the number of multicast service users and of the release of the multicast tree structure due to the multicast service cancellation are also applicable in the present embodiment. <<Summary>> By virtue of the above-mentioned method, a plurality of multicast services are implemented using the IP transfer network interconnecting the IP transfer networks of a plurality of communication companies. The multicast service provider can request to the communication company for the vicarious execution of the charging work. Multicast data is transmitted to the transmission work server managed by the communication company X and the transmission work server managed by the communication company Y. The transmission work server managed by the communication company X distributes the multicast data through the transmission terminal of the communication company X to a plurality of terminals connected to the IP transfer network managed by the communication company X. Similarly, the transmission work server managed by the communication company Y distributes the multicast data through the transmission terminal of the communication company Y to a plurality of terminals connected to the IP transfer network managed by the communication company Y. The result of distribution within the IP transfer network managed by the communication company X or the communication company Y is collected via the multicast service proxy server by the transmission work server of the communication company X or the communication company Y. The terminal-to-terminal communication connection control for the terminal-to-terminal (inter-terminal) communications with employment of the IP transfer network can be realized by way of connecting such multimedia terminals for apparatus as IP terminals including personal computers with IP communication functions, IP telephone sets, IP voice/image apparatus to more than one of a network node apparatus within an integrated IP transfer network, a gateway and a media router. In this case, while the media router is installed outside the integrated IP transfer network, and the host name made of the multimedia terminal identifying telephone number is used through the integrated IP transfer network, the natural communications can be carried out, for example, the information can be exchanged among the multimedia terminals. While the telephone set having the telephone number for the public switched telephone network is connected to the media router within the LAN, the terminal-to-terminal communication can be established from the telephone set connected to the public switched telephone network via the integrated IP transfer network to the telephone set contained in the LAN. Also, while a single multimedia terminal constitutes the transmission source, electronic data and voice/image data such as electronic books may employed for IP data multicast networks and IP base TV broadcasting networks for transmitting to multimedia terminals which constitute a plurality of reception ends. 1-466. (canceled) 467. A terminal-to-terminal communication connection control method with employment of an IP transfer network, wherein: when a network node apparatus detects an IP packet which a domain name server is a receiver IP address, the received IP packet is transferred to a domain name server only when a combination of sender IP address of said IP packet and a communication line inputted said IP packet is included in an address administration table of said network node apparatus, thereby to register an allowance of inter-terminal communication. 468. A terminal-to-terminal communication connection control method with employment of an IP transfer network wherein: an IP transfer network includes at least a network node apparatus, a telephone administration server, a media router, a telephone domain name server, and a table administration server; a user “i” (“i”=1, 2, . . . ) sets an individual external IP address to a media route of a user, located outside said IP transfer network, and, one, or more telephone sets are connected to the media router of said user “i”; said media router is connected via a communication line to any of said network node apparatus, an internal IP address “IA-i” used to communicate with said user “i” is applied to a termination portion of said communication line on the side of the network node apparatus, and a telephone number specific to a user is connected to said media router; said telephone domain name server saves a set of the user individual telephone number, the external IP address “EA-i” of said media router and said internal IP address “IA-i”; when the user individual telephone number is inquired to the telephone domain name server, said telephone domain name server answers the external IP address and the internal IP address; an IP communication record for determining an IP communication path between said media router and a pilot telephone administration server is set to said network node apparatus; as a request of a source telephone set, said IP communication record is employed, and said IP communication record is transferred via the pilot telephone administration server to a telephone administration server; said telephone administration server requests said telephone domain name server to acquire both the external IP address and the internal IP address (“EA-i,IA-i”) of the transmission source media router from a source telephone number, and both an external IP address and an internal IP address (“EA-j, IA-j”) of a destination media router from a destination telephone number; while the telephone administration servers provided on both the transmission source side and the destination side execute a series of procedures in combination with the media routers on the sides of the transmission source and the destination, and the telephone set, said table administration server sets said four IP addresses as an IP communication record between the transmission-source-sided network node apparatus and the destination network node apparatus and as another IP communication record between the source telephone set and the destination-sided telephone set; and when the telephone communication is ended, said telephone administration server requests said table administration server to delete said IP communication records. 469. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 468, wherein: when the telephone set on the transmission source side requests a telephone call setting operation, the telephone set on the transmission source side exclusively determines a circuit identification code used to identify a communication line for telephone voice from a set of the destination telephone number and the source telephone number; the telephone administration server on the transmission source side transmits an IAM packet containing said circuit identification code for requesting the telephone call setting operation to the telephone administration server on the destination side; the telephone administration server on the destination side returns an ACM packet for reporting the reception of said IAM packet to the telephone administration server on the transmission source side; when the telephone set on the destination side produces a telephone call reception sound, the telephone management server on the destination side transmits a CPG packet for notifying a call reception to the telephone administration server on the transmission source side; when the telephone set on the destination side responds to the call setting request, the telephone administration server on the destination side transmits an ANM packet indicative of a response to the call setting request to the telephone administration server on the transmission source side, and then, the telephone set on the transmission source side stops the calling sound thereby allowing to enter a communication phase; when communication is completed and when a call-interrupting request is transmitted, the telephone administration server on the call-interrupting request said forms a REL packet requesting the completion of telephone communication using the circuit identification code and transmits the RLC packet to the telephone administration server on the call-interrupted side; and said telephone administration server on the call-interrupted side returns an acknowledgement reporting the reception of the REL packet. 470. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 468, wherein: a payload portion of an IP packet is of UDP segments; a telephone call connection phase and telephone release phase has only one port number; a sole call control program to manage the connection phase and the telephone release phase is usable on different communication lines; and a different voice from a different telephone set can be sent even if the media router is the only IP address by way of allocating a different UDP port number to each telephone set. 471. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 468, wherein: in order that one telephone administration server may solo play the function of the transmission-sided telephone administration server and the function of the reception-sided telephone administration server, said telephone administration server performs procedures of a telephone connection phase and a telephone release phase via the pilot telephone administration server is combination with a transmission source media router and a destination media router. 472. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 468, wherein: said telephone administration server employs the communication company segment table of the telephone number in order to know as to whether the destination telephone number belongs to an IP telephone network operated/managed by the own communication company, or an IP telephone network operated/managed by another communication company. 473. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 468, wherein: a telephone set having a destination telephone number employs a telephone administration server segment table of telephone numbers in order to know that the own telephone set joins to which network node apparatus. 474. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 468, wherein: an operation administration server acquires a telephone communication record containing a circuit identification code, a communication time instant, and a telephone number; and said operation administration server notifies the acquired telephone communication record to an operation administration server and a charging server so as to exclusively manage the network thereby to enhance the reliability of controlling the terminal-to-terminal communication connection. 475. A terminal-to-terminal communication connection control method with employment of an IP transfer network wherein: an IP transfer network includes more than two network node apparatus; a media router is connected to an IP communication line to any one of said network node apparatus; an internal IP address is applied to a logic terminal of a termination unit on the side of said network node apparatus of the IP communication line; an external IP address is applied to each of the media routers, and also said media router is connected via a communication line to more than one telephone set; as a record of an address administration table provided in said network node apparatus, both said external IP addresses and said internal IP addresses are contained, and an IP communication record for defining an IP capsulation method can be previously set; and while more than one IP communication record is previously set which is supplied to a terminal-to-terminal communication within such a closed-area communication network for limiting a communication counter party, such an IP communication record which is supplied to a terminal-to-terminal communication not for previously limiting the communication counter party is newly set in a connection phase in response to a connection request among terminals, and thereafter is supplied to the terminal-to-terminal communication; and also said IP communication record is deleted. 476. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 475 wherein: in the closed-area telephone communication for limiting the communication counter party, the telephone number server contained in said media router, whereas in the closed-area telephone communication for not limiting the communication counter party, the telephone number server provided in the IP transfer network is used. 477. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 475 wherein: an IAM packet, an ACM packet, a CPG packet, an ANM packet, a REL packet, and a RLC packet are transmitted/received between the telephone administration server on the telephone calling side and the telephone administration server on the telephone reception side. 478. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 477 wherein: after a response, a response confirmation is carried out; and a release acceptance is carried out between a release and a release completion. 479. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 475 wherein: a telephone number server owns a CIC administration table, and can record a source telephone number, a destination telephone number, a starting time instant of a telephone communication, and an end time instant thereof on said CIC administration table. 480. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 475 wherein: an operation administration server inquires a source telephone number, a destination telephone number, a starting time instant of a telephone communication, and an end time instant thereof in order to use the acquired items for charging operation. 481. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 475 wherein: a telephone calling line number administration is carried out. 482. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 475 wherein: a telephone call reception line number administration is carried out. 483. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 475 wherein: the network node apparatus owns a function capable of separating an IP packet for a terminal-to-terminal communication connection from an IP packet for a voice communication, which are inputted outside the IP network; and said network node apparatus synthesizes IP packets sent from the IP network to the network node apparatus to thereby send out the synthesized IP packet to the media router. 484. A terminal-to-terminal connection as claimed in claim 475, wherein: a user makes an application for telephone service, the telephone service application information is set as an IP communication record of an address management table in a network node apparatus via at least a user service server and a telephone management server and used in telephone communication, and the telephone communication user can be requested to pay a communication charge for the telephone communication via at least the telephone management server and the user service server. 485. A method of acquiring an IP address with employment of a terminal-to-terminal communication connection method as claimed in claim 476, wherein: a telephone number is converted into a domain name format of telephone number, and an IP address used in telephone communication is acquired from the domain name format. 486. A terminal-to-terminal communication connection control method with employment of an IP transfer network wherein: in order to make a telephone communication from a telephone set which is connected to a public switched telephone network to another telephone set which is connected via an IP transfer network to another public switched telephone network; information of the input line supplied to the IP transfer network which is employed so as to connect a telephone communication line from said public telephone network to said IP transfer network is inquired to the internal gateway of said IP transfer network which contains line information, and is acquired while a telephone number of a destination telephone set is used as a parameter; and in this case, said gateway containing said line information refers to an IP transfer network input line table thereof. 487. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 486 wherein: information of the said input line supplied to the IP transfer network corresponds to information of accessing obtained via an NNI or a UNI communication line; and information of the output line supplied outside the IP transfer network corresponds to information of accessing via an NNI or a UNI communication line. 488. A terminal-to-terminal communication connection control method with employment of an IP transfer network wherein, a communication line for a telephone communication connection control is separated from a voice communication line between a termination gateway equipped with an encapsulation function and a relay gateway, and a telephone communication is carried out between two telephone sets via a telephone set 1, a termination gateway equipped with a capsulation function, a relay gateway, an NNI interface communication line, a public switched telephone network, and a telephone set 2 in this order, wherein: a telephone number server employed in said termination gateway equipped with the encapsulation function, and a relay control unit employed in the relay gateway own individual CIC administration tables; and manage circuit identification codes by employing the respective CIC administration tables. 489. A terminal-to-terminal communication connection control method with employment of an IP transfer network wherein: in order to make a telephone communication from a telephone set which is connected to a public switched telephone network to another telephone set which is connected via an IP transfer network to another public switched telephone network; information of the input line supplied to the IP transfer network which is employed so as to connect a telephone communication line from said public telephone network to said IP transfer network is inquired to the input line information server which is provided outside of said IP transfer network, and is acquired, while a telephone number of a destination telephone set is used as a parameter; and in this case, an input line information server refers to an IP transfer network input line table thereof. 490. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 489 wherein: information of said input line supplied to the IP transfer network corresponds to information of accessing via an NNI or a UNI communication line; and information of the output line supplied outside the IP transfer network corresponds to information of accessing via an NNI or a UNI communication line. 491. A terminal-to-terminal communication connection control method with employment of an IP transfer network wherein: in order to make a telephone communication from a telephone set which is connected to a public switched telephone network to another telephone set which is connected via an IP transfer network to another public switched telephone network; as information of the output line supplied outside the IP transfer network which is employed so as to connect a telephone communication line from said IP transfer network to said public telephone network, internal output line information of said IP transfer network is used while a telephone number of a destination telephone set is used as a parameter. 492. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 491 wherein: information of the input line supplied to the IP transfer network corresponds to information of accessing via an NNI or a UNI communication line; and information of said output line supplied outside the IP transfer network corresponds to information of accessing via an NNI or a UNI communication line. 493. A terminal-to-terminal communication connection control method with employment of an IP transfer network wherein: in order to make a telephone communication from a telephone set which is connected to a public switched telephone network to another telephone set which is connected via an IP transfer network to another public switched telephone network; information of the output line supplied outside the IP transfer network which is employed so as to connect a telephone communication line from said IP transfer network to said public telephone network is inquired to the internal gateway of said IP transfer network while a telephone number of a destination telephone set is used as a parameter; said gateway inquires to a telephone number server employed in the IP transfer network; and then said telephone number server responds thereto. 494. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 493 wherein: information of the said input line supplied to the IP transfer network corresponds to information of accessing obtained via a UNI communication line; and information of said output line supplied outside the IP transfer network corresponds to information of accessing via an NNI communication line. 495. A multicast communication system with employment of an IP transfer network, wherein: sender multicast addresses are registered at an address administration table of a network node apparatus; said IP packet is transferred when a sender multicast address in a header inputting to said network node apparatus is registered at said address administration table; said IP packet is abandoned when said sender multicast address is not registered; thereby to prevent that an unexpected IP packet intermixes with the IP transfer network. 496. A multicast communication system as claimed in claim 495, wherein: the network node apparatus is separated into an address management module and a router. 497. A multicast communication system with employment of an IP transfer network, wherein: originating IP addresses are registered at an address administration table of a network node apparatus; the IP packet inputted to said network node apparatus is transferred when an originating IP address in a header is registered at said address administration table; said IP packet is abandoned when said originating IP address is not registered; thereby to prevent that an unexpected IP packet intermixes with the IP transfer network. 498. A network node apparatus, wherein: an IP packet is transferred when an IP address of a terminal is registered at an address administration table; and when said IP address is not registered, that unexpected IP packet intermixes with the IP transfer network is prevented by transferring said IP packet to an overflow communication line. 499. A multicast communication system as claimed in claim 497, wherein: said sending terminal sends digitalized voice, and plural receiving terminals receive said digitalized voice. 500. A multicast communication system as claimed in claim 497, wherein: said sending terminal sends digitalized voice/moving image, and plural receiving terminals receive said digitalized voice/moving image. 501. A multicast communication system as claimed in claim 500, wherein: said multicast proxy server intermediates an information exchange between the sending terminal and the receiving terminal. 502. A network node apparatus, wherein: an IP packet is transferred when an IP address of a terminal is registered at an address administration table; and when said IP address is not registered, that unexpected IP packet intermixes with the IP transfer network is prevented by transferring said IP packet to an overflow communication line. 503. A multicast communication system as claimed in claim 497, wherein: the network node apparatus is separated into an address management module and a router. 504. A multicast communication system with employment of an IP transfer network, wherein: sender multicast addresses are registered at a network node apparatus path table; the IP packet is transferred when a sender multicast address in a header of an external IP packet inputted to said network node apparatus is registered at said network node apparatus path table; said IP packet is abandoned when said sender multicast address is not registered; thereby to prevent that unexpected IP packet intermixes with the IP transfer network. 505. A multicast communication system with employment of an IP transfer network as claimed in claim 504, wherein: a multicast service proxy server receives multicast data sent from a sender's terminal and stores it therein; and said multicast service proxy server outputs said stored multicast data to a terminal connected to said network node apparatus connecting said multicast service proxy server by using a multicast function of said network node apparatus. 506. A multicast communication system with employment of an IP transfer network as claimed in claim 504, wherein: said multicast service proxy server sends an ACK packet intensive information received from one or more terminals connected to said network node apparatus, an IP packet including an NACK packet intensive information and an intensive information of individual terminal to a sending terminal carrying out a multicast service or to a sending work server. 507. A multicast communication system with employment of an IP transfer network as claimed in any one of claims 504, wherein: said multicast service proxy server uses an information included in said IP packet received via said IP packet overflow communication line. 508. A multicast communication system as claimed in claim 504, wherein: said sending terminal sends digitalized voice, and plural receiving terminals received said digitalized voice. 509. A cable voice broadcast communication system as claimed in claim 508, wherein: said multicast proxy server intermediates an information exchange between the sending terminal and the receiving terminal. 510. A multicast communication system as claimed in claim 504, wherein: said sending terminal sends digitalized voice/moving image, and plural receiving terminals receive said digitalized voice/moving image. 511. A multicast communication system as claimed in claim 510, wherein: said multicast proxy server intermediates, an information exchange between the sending terminal and the receiving terminal. 512. A network node apparatus, wherein: sender multicast addresses are registered at a path table; said IP packet is transferred when a sender multicast address in a header of an external IP packet inputting to said network node apparatus is registered at said path table; said IP packet is abandoned when said sender multicast address is not registered; thereby to prevent that unexpected IP packet intermixes with the IP transfer network. 513. A network node apparatus as claimed in claim 512, comprising a function of adding a simple header to an external packet to make an internal capsule and an inverted encapsulating function. 514. A multicast communication system as claimed in claim 512, wherein: the network node apparatus is separated into an address management module and a router. 515. A multicast communication system with employment of an IP transfer network, wherein: a terminal is connected to a router connecting an address administration module via a communication line; a sender's IP address is registered at an address administration table of said address administration module; said IP packet is transferred when said sender's address in a header of an IP packet inputting to said router is not registered at said address administration table; said IP packet is abandoned when said sender's address is not registered; thereby to prevent that an unexpected IP packet intermixes with an IP transfer network. 516. A multicast communication system with employment of an IP transfer network, wherein: a terminal is connected to a router connecting an address administration module via a communication line; a sender's IP address is registered at an address administration table of said address administration module; said IP packet is transferred when said sender's address in a header of an IP packet inputting to said router is not registered at said address administration table; said IP packet is transferred to an overflow communication line when said sender's address is not registered; thereby to prevent that an unexpected IP packet intermixes with an IP transfer network. 517. A multicast communication system with employment of an IP transfer network, wherein: an IP transfer network includes one or more routers; said routers are connected to an IP communication line; a terminal is connected to a router connecting an address administration module via a communication line; an IP address is registered at an address administration table of said address administration module; said IP packet is transferred when said sender's address in a header of an IP packet inputting to said router is not registered at said address administration table; said IP packet is abandoned when said sender's address is not registered; thereby to prevent that an unexpected IP packet intermixes with an IP transfer network. 518. A terminal-to-terminal communication connection control method with employment of an IP transfer network, wherein: an IP transfer network contains two, or more connection servers, and media routers outside said IP transfer network are connected to a terminal having a transmittance/reception function of digital media; a call setting IP packet is transmitted from one of said media routers to one of the connection servers; said connection server provided on the telephone calling side determines both a communication line for an inter-terminal communication within said IP transfer network and a circuit identification code for identifying said communication line by employing both a telephone number provided on the telephone calling side and a telephone number provided on the call reception side, and produces an initial address message containing said circuit identification code; said produced initial address message is transmitted to the connection server provided on the call reception side via a relay connection server, said connection server on the call reception side transmits a call setting IP packet to the media router on the call reception side, and said media router on the call reception side transmits said call setting IP packet to the terminal on the call reception side; said connection server on the call reception side produces an address completion; said address completion message and transmits said received address completion message is transmitted to said connection server on the telephone calling side via said relay connection server; when a report of telephone calling operation is received from the terminal on the call reception side, said connection server on the call reception side produces a call pass message; said call pass message reaches via said relay connection server to said connection server on the telephone calling side; and said connection server on the calling side transmits the report of telephone calling operation of the terminal on the call reception side to the media router on the telephone calling side; upon receipt of a response issued from the terminal on the call reception side, said connection server on the call reception side produces a response message; said response message reaches via said relay connection server to said connection server on the telephone calling side; said connection server on the telephone calling side stops the calling sound of the terminal on the call reception side; both said terminal on the telephone calling side and said terminal on the call reception side can establish an inter-terminal communication between the terminals to transmit/receive the digital media via said media routers provided on the telephone calling side and the call reception side; a request for interrupting the inter-terminal communication is transmitted from said media router provided on either the telephone calling side or the call reception side to said connection server; a release request is sent from said connection server to both said relay connection server and another connection server; an interrupt instruction is transmitted from said another connection server to another media router, and on the other hand, a release completion is transmitted from another connection server via said relay connection server to said server; and an interrupt completion is sent to a media router so as to connect/release the inter-terminal communication between the two terminals. 519. An IP transfer network wherein: an external packet, including a source external address and a destination external address, which reaches a network node apparatus via an external communication line is added with a simple header under a management of an address management table in the network node apparatus, the internal packet comprises the simple header and the external packet, and the simple header includes at least a destination internal address; the internal packet is transmitted from the network node apparatus, when the internal packet is transmitted from the network node apparatus, when the internal packet is transmitted via a relay, the internal address is referred by the relay, it is possible to transmit the internal packet via the relay and to transmit the internal packet without the relay, the internal packet is transferred through an IP transfer network to reach another network node apparatus, the external packet is recovered from the internal packet so as to be transferred to a communication line outside the IP transfer network; and the external packet is converted into the internal packet only when a combination comprising a source internal address added to a logical terminal at the end of the communication line to which the external packet is inputted, a destination external address in the input external packet and a source external address are registered as a record of the address management table of the network node apparatus on the input side. 520. An IP transfer network as claimed in claim 519, wherein: in place of the combination comprising three addresses, a combination comprising the source internal address and the destination external address in the input external packet is used. 521. An IP transfer network as claimed in claim 519 wherein: the record of the address management table includes at least two records; a combination of the destination address and the internal address added to the logical terminal at the end of the communication line is changed depending on the records; and a destination of the internal packet can be changed by changing a destination external address in an external packet inputted from the same logical terminal is changed. 522. An IP transfer network as claimed in claim 519 wherein: only when a result of logical and calculation of the destination address of the input external packet and a destination address mask inside the record in the address management table coincides with the destination address in the same record, the external packet is converted into the internal packet. 523. An IP transfer network as claimed in claim 519 wherein: digitized voice data is transmitted and received from a telephone set I to a telephone set 2 via a media router 1, a communication line 1, a network node apparatus I in an IP transfer network, the inside of the IP transfer network, a network node apparatus 2 in the IP transfer network, a communication line 2 and a media router 2 so as to make it possible to perform the telephone communication. 524. An IP transfer network as claimed in claim 519 wherein: digitized voice/image data is transmitted and received from a voice/image apparatus I to a voice/image apparatus 2 via a media router 1, a communication line 1, a network node apparatus I in an IP transfer network, the inside of the IP transfer network, a network node apparatus 2 in the IP transfer network, a communication line 2 and a media router 2 so as to make it possible to perform voice/image communication. 525. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 519, wherein: the initial address message contains a circuit identification code for identifying the communication line for inter-terminal communication. 526. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 525, wherein: after the inter-terminal communication is completed, the connection server acquires an inter-terminal communication record including a circuit identification code, a communication time instant, and a telephone number, and records the acquired communication record therein so as to be used for a charging purpose and an operation/management. 527. A terminal-to-terminal communication connection control method with employment of an IP transfer network as claimed in claim 519, wherein: an initial address message, an address completion message, a call pass message, a response message, a release message and a release completion message are transmitted/received without passing through the relay connection server. 528. An IP transfer network as claimed in claim 519, wherein: a terminal having a transmittance/reception function of digital media is any one of at least one telephone set, an IP terminal, a voice-moving image transmission/reception terminal and a facsimile terminal. 529. An IP transfer network as claimed in claim 519, wherein: the internal packet is an optical frame. 530. An IP transfer network, wherein there is provided two or more network node apparatus, an external packet is converted into an internal packet at a network node apparatus on sending side, said external packet is restored at a network node apparatus on receiving side, a communication with said internal packet is carried out at inter-network node apparatus, a terminal is connected with said logical terminal on sending side or said logical terminal on receiving side, a terminal-to-terminal communication connection control is carried out by internal packets including a logical terminal discrimination information on receiving side and a call control, an IP address of an IP terminal is registered at said network node apparatus, and said network node apparatus discards said IP packet when it received an IP packet including a non-registered source IP address. 531. A network node apparatus included in an IP transfer network, wherein there is provided two or more network node apparatus, an external packet is converted into an internal packet at a network node apparatus on sending side, said external packet is restored at a network node apparatus on receiving side, said network node apparatus has functions that a communication with said internal packet is carried out at inter-network node apparatus, and a terminal-to-terminal communication connection control is carried out by internal packets including a logical terminal discrimination information on receiving side and a call control, and a terminal is connected with said logical terminal on sending side or said logical terminal on receiving side, an IP address of an IP terminal is registered at said network node apparatus, and said network node apparatus discards said IP packet when it received an IP packet including a non-registered source IP address. 532. A terminal included in an IP transfer network, wherein in said IP transfer network, an internal packet is formed based on a logical terminal on sending side and an external packet, a logical terminal on receiving side is decided based on a logical terminal discrimination information on said formed internal packet, and a terminal is connected with said logical terminal on sending side or said logical terminal on receiving side via a communication line, whereby a terminal-to-terminal communication connection control is carried out by internal packets including call control, and an IP address of said terminal is registered at said network node apparatus, and said network node apparatus discards said IP packet when it receives an IP packet including a non-registered source IP address. 533. An IP transfer network, wherein said IP transfer network includes two or more network node apparatus, terminals are connected with said network node apparatus and form an address of an IP packet based on a telephone number, and a terminal-to-terminal communication connection control is carried out by using an IP packet including a call control when a sender address of said IP packet is included in a sender address registered in a network node apparatus on sending side. 534. An IP transfer network, wherein said IP transfer network includes two or more network node apparatus, terminals are connected with said network node apparatus and form an address of an IP packet based on a telephone number, and a terminal-to-terminal communication connection control is carried out by using an IP packet including a call control when a receiver address of said IP packet is included in a receiver address registered in a network node apparatus on sending side. 535. An IP transfer network, wherein said IP transfer network includes two or more network node apparatus, terminals are connected with said network node apparatus and form an address of an IP packet based on a telephone number, and a terminal-to-terminal communication connection control is carried out by using an IP packet including a call control when a sender address of said IP packet is included in a sender address registered in a network node apparatus on receiving side. 536. A terminal-to-terminal communication control method, wherein an IP transfer network is connected to two or more terminals, said IP transfer network communicate with said terminals by using an IP packet and said IP transfer network includes a server having a function to specify an IP address for communicating with a destination terminal based on a telephone number of said destination terminal, and carries out a terminal-to-terminal communication via said IP transfer network by using internet protocol, wherein said server specifies said IP address, and said IP transfer network includes a connection phase and a communication phase, and registers a record including at least a telephone number, a communication start time and a communication end time. 537. A terminal-to-terminal communication control method according to claim 536, wherein said connection phase is carried out based on a common channel signaling system including an address completion message. 538. A terminal-to-terminal communication control method according to claim 536, wherein said connection phase is a telephone communication. 539. A terminal-to-terminal communication control method according to claim 536, wherein said connection phase includes a response confirmation message. 540. A terminal-to-terminal communication control method according to claim 536, wherein said server specifies said IP address for communicating with said destination terminal based on a domain name of said destination terminal instead of said telephone number. 541. A terminal-to-terminal communication control method according to claim 536, wherein said server specifies said IP address for communicating with said destination terminal based on a host name of said destination terminal instead of said telephone number. 542. A terminal-to-terminal communication control method according to claim 536, wherein said server is a domain name server. 543. A terminal-to-terminal communication control method, wherein an IP transfer network is connected to two or more terminals, said IP transfer network communicate with said terminals by using an IP packet and said IP transfer network includes a server having a function to specify an IP address for communicating with a destination terminal based on a telephone number of said destination terminal, and carries out a terminal-to-terminal communication via said IP transfer network by using internet protocol, wherein said server specifies said IP address, and said IP transfer network carries out a telephone communication connection control and registers a record including at least a telephone number, a communication start time and a communication end time. 544. A terminal-to-terminal communication control method according to claim 543, wherein said server specifies said IP address for communicating with said destination terminal based on a domain name of said destination terminal instead of said telephone number. 545. A terminal-to-terminal communication control method according to claim 543, wherein said server specifies said IP address for communicating with said destination terminal based on a host name of said destination terminal instead of said telephone number. 546. A terminal-to-terminal communication control method according to claim 543, wherein said telephone communication connection control is carried out based on a common channel signaling system including an address completion message. 547. A terminal-to-terminal communication control method according to claim 543, wherein said telephone communication connection control includes a response confirmation message. 548. A terminal-to-terminal communication control method according to claim 543, wherein said server is a domain name server. 549. A terminal-to-terminal communication control method, wherein an IP transfer network is connected to two or more terminals, said IP transfer network communicate with said terminals by using an IP packet and said IP transfer network includes a server having a function to specify an IP address for communicating with a destination terminal based on a telephone number of said destination terminal, and carries out a terminal-to-terminal communication via said IP transfer network by using internet protocol, wherein said server specifies said IP address, and said IP transfer network carries out a call control and registers a record including at least a telephone number, a communication start time and a communication end time. 550. A terminal-to-terminal communication control method according to claim 549, wherein said server specifies said IP address for communicating with said destination terminal based on a domain name of said destination terminal instead of said telephone number. 551. A terminal-to-terminal communication control method according to claim 549, wherein said server specifies said IP address for communicating with said destination terminal based on a host name of said destination terminal instead of said telephone number. 552. A terminal-to-terminal communication control method according to claim 549, wherein a media communication is carried out between said terminals. 553. A terminal-to-terminal communication control method according to claim 549, wherein a call control is carried out based on a common channel signaling system including an address completion message. 554. A terminal-to-terminal communication control method according to claim 553, wherein call control includes a response confirmation message. 555. A terminal-to-terminal communication control method according to claim 549, wherein said server is a domain name server. 556. A terminal-to-terminal communication control method, wherein an IP transfer network is connected to two or more terminals, said IP transfer network communicate with said terminals by using an IP packet and said IP transfer network includes a server having a function to specify an IP address for communicating with a destination terminal based on a telephone number of said destination terminal, and carries out a terminal-to-terminal communication via said IP transfer network by using internet protocol, wherein said server specifies said IP address, and said IP transfer network includes steps of a call control and a communication between said terminals and registers a record including at least a telephone number, a communication start time and a communication end time. 557. A terminal-to-terminal communication control method according to claim 556, wherein said server specifies said IP address for communicating with said destination terminal based on a domain name of said destination terminal instead of said telephone number. 558. A terminal-to-terminal communication control method according to claim 556, wherein said server specifies said IP address for communicating with said destination terminal based on a host name of said destination terminal instead of said telephone number. 559. A terminal-to-terminal communication control method according to claim 556, wherein said call control concerns a telephone communication. 560. A terminal-to-terminal communication control method according to claim 556, wherein said call control is carried out based on a common channel signaling system including an address completion message. 561. A terminal-to-terminal communication control method according to claim 556, wherein said call control includes a response confirmation message. 562. A terminal-to-terminal communication control method according to claim 556, wherein said server is a domain name server. 563. A terminal-to-terminal communication control method, wherein an IP transfer network is connected to two or more terminals, said IP transfer network communicate with said terminals by using an IP packet, and said terminal-to-terminal communication is carries out via said IP transfer network by using internet protocol, wherein said IP transfer network carries out a communication connection control between said terminals by using a communication step based on a common channel signaling system including an address completion message and a record including at least a telephone number, a communication start time and a communication end time is registered. 564. A terminal-to-terminal communication control method according to claim 563, wherein said method further includes a step a specifying an IP address for communicating with a destination terminal based on a telephone number of said destination terminal, and a communication connection control between said terminals is carried out by using a communication step including a response confirmation message. 565. A terminal-to-terminal communication control method, wherein an IP transfer network is connected to two or more terminals, said IP transfer network communicate with said terminals by using an IP packet, said IP transfer network includes a server having a function to specify an IP address for communicating with a destination terminal based on a telephone number of said destination terminal, and said terminal-to-terminal communication is carries out via said IP transfer network by using internet protocol, wherein said server specifies said IP address, and said IP transfer network carries out a communication connection control between said terminals by using a communication step based on a common channel signaling system including an address completion message and registers a record including at least a telephone number, a communication start time and a communication end time. 566. A terminal-to-terminal communication control method according to claim 565, wherein said communication connection control between said terminals is carried out by using a communication step including a response confirmation message instead of said communication step based on said common channel signaling system. 567. A terminal-to-terminal communication control method according to claim 565, wherein a domain name is used instead of said telephone number. 568. A terminal-to-terminal communication control method according to claim 565, wherein a host name is used instead of said telephone number. 569. A terminal-to-terminal communication control method according to claim 565, wherein said server is a domain name server.

2007-08-09

en

2008-10-16

US-202017037411-A

Selective service control to mobile ip network ABSTRACT Systems and methods are described for managing services of a computing device over a mobile network where requests for managed or unmanaged services are translated to corresponding IP addresses sent to the computing device and corresponding requests sent to the translated IP addresses are either permitted, rated, quality controlled or secured if the computing device has a valid data plan or is otherwise permissioned for using the mobile network, are denied if filtered and if the computing device does not have a valid data plan or is not otherwise permissioned and the request corresponds to the first address, and are permitted, rated, quality controlled or not secured even if the computing device does not have a valid data plan or is not otherwise permissioned if the request corresponds to the second address. CROSS REFERENCE TO RELATED APPLICATIONS This application is a continuation of U.S. patent application Ser. No. 16/054,964, filed Aug. 3, 2018, which is a continuation-in-part of U.S. patent application Ser. No. 14/102,452, filed Dec. 10, 2013, now U.S. Pat. No. 10,057,300 issued Aug. 21, 2018; which claims benefit under 35 U.S.C. § 119(e) of Provisional U.S. Patent Application No. 61/735,946, filed Dec. 11, 2012, the contents of which are incorporated herein by reference in their entirety. TECHNICAL FIELD The present disclosure relates to system for managing network services accessible to a computing device. BACKGROUND Personal computers and other types of computing devices typically come equipped with a pre-installed operating system and various application programs for performing typical functions, such as word processing programs for word processing and browser programs for accessing the Internet, email, etc. Some such devices come installed only with enough software to allow the device to boot up, thereafter requiring the user to select and install an operating system and any desired application programs. Other devices include an operating system, but do not include applications to be installed on the device, because the operating system is designed to access such applications over a network. Such devices are designed to be used while connected to the Internet or other networks and support applications that reside on the World Wide Web (the “Web”), for example, instead of being installed on the device. One such device is the GOOGLE CHROMEBOOK, which is shipped with CHROME OS, which uses the LINUX kernel, and the GOOGLE CHROME Web browser with an integrated media player. The CHROMEBOOK has limited offline capability and is primarily designed to be used while connected to the Internet. Users may add desired applications for the CHROMEBOOK from the CHROME Web store. To make use of such applications, however, it is necessary for the devices to have access to an Internet connection and to stay connected during use, which requires the user to either be connected to a wired or wireless Internet access point and typically to have contracted with a network access provider to obtain access and sufficient bandwidth to make use of the applications. When traditional access and feature control methods are not available, or the user has not paid for access/features or has exceeded access/feature limitations, the device will not be able to access or fully utilize the Web-based or other network-based applications, limiting the effectiveness and usefulness of the device. SUMMARY Systems and methods are described for managing services of a computing device over a mobile network where requests for managed or unmanaged services are translated to corresponding IP addresses sent to the computing device and corresponding requests sent to the translated IP addresses are either permitted, rated, quality controlled or secured if the computing device has a valid data plan for using the mobile network or is otherwise permissioned to use the network are denied if filtered and if the computing device does not have a valid data plan or is not otherwise permissioned and the request corresponds to the first address, and are permitted, rated, quality controlled or not secured even if the computing device does not have a valid data plan or is not otherwise permissioned if the request corresponds to the second address. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagram of an embodiment of a selective access control network for a computing device. FIG. 2 is a flow chart illustrating an embodiment for handling requests to managed domains. FIG. 3 is a flow chart illustrating an embodiment for handling requests to an unmanaged domain. FIG. 4 is a block diagram of a computing system. FIG. 5 is a diagram of an embodiment of a selective rating control network for a computing device. FIG. 6 is a flow chart illustrating an embodiment for handling requests to a managed domain. FIG. 7 is a diagram of an embodiment of a selective quality of service control network for a computing device. FIG. 8 is a diagram of an embodiment of a selective security control network for a computing device. DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS For computing devices that only access applications over the Internet, a user is only able to access those applications, and any documents or files created based on those applications, when the device is connected to the Internet via a data network connection, such as a Radio Access Network (RAN), Wi-Fi network, etc. connection, and when the user has a then valid data plan or otherwise permissioned (e.g., ad-sponsored) access to such network by the owner and/or manager of such network. If the user has no data plan, or network connection, or the user has a data plan and access to a network connection, but has exceeded a time or pricing limit for the data plan, the user will not be able to access the applications or any documents or files created from those applications, including the user's email, calendar, contacts, etc. In an embodiment, the computing device may be provided with an embedded connection to the Web or cloud via the RAN that is essentially invisible to the user. This embodiment allows users that do not have a data plan or that have used up their data plan quota (time/price/bandwidth, etc.) or are otherwise are not permissioned to use such network to still have access to certain application services, such as email, disk drive storage, etc., while blocking other application services, such as search, news, etc. As illustrated in FIG. 1, a computing device 102 is connected to a multiprotocol label switching (MPLS) platform 104 for a network service provider. The computer device issues various requests to access different URLs or IP addresses that form inputs to the MPLS platform 104. The MPLS platform 104 may direct the requests and data from the computing device 102 to other devices in or accessible from an access control provider's system 106 based on short path labels rather than long network addresses, thereby avoiding complex lookups in routing tables. The labels may identify virtual links or paths between nodes rather than endpoints and may encapsulate packets of various network protocols. Hence, requests to access different URLs or IP addresses are received by MPLS 104 and labeled with short path labels as DNS requests, managed domains requests or unmanaged domains requests. The MPLS 104 may direct the requests using the short path labels as appropriate to different locations within the access control provider's system 106. When the applications or services accessible on the application provider's network 108 through the computing device 102 are associated with unique IP addresses, or even ranges of IP addresses, controlling access to the applications may be straightforward. A requested URL/URI or IP address for an accessible service may be allowed through to the DNS server 110, and a request to an access controlled service may be redirected by a content filter 112 to a customized deny page 114. However, some application providers do not associate a unique IP address or range of IP addresses with particular applications or services. The same IP address may provide access to multiple services. In addition, many of the services may be provided over secure socket layer (SSL), which causes the requested URI to be encrypted, thereby making it impossible to associate a request that arrives over the SSL with a specific service of the application provider and therefore making it impossible to allow or block the request. In an embodiment, a solution may be provided to the problems associated with application providers that provide services with SSL and/or do not associate different services with unique IP addresses. As illustrated in FIG. 1, the computing device 102 may be provided with an embedded connection to the MPLS 104. All DNS requests received from the computing device 102 may be directed to the DNS server 110, which translates the DNS request to manage domains that belong to new IP addresses provided by the application provider. The application provider provides a new IP address (meaning an IP address that does not currently exist on the application provider's DNS server 116) for every service, including those that should remain available to the computing device, even if the computing device is not currently supported by a data plan or is otherwise permissioned to use such network. For example, if a user of the computing device 102 made a request for email.com or drive.application.com, which are managed domains for allowed services, the DNS server 110 may translate each request to the IP address provided by the application provider for allowed services (i.e., email.com would be translated to x.x.x.x and drive.application.com would be translated to y.y.y.y). On the other hand, the DNS server 110 cannot translate requests for unmanaged domains for disallowed services, so the request may be sent through to the application service provider's DNS server 116, where it is translated to an IP address (i.e., search.application.com would be translated to z.z.z.z). The translated IP addresses for the allowed and disallowed services would then be sent back to the computing device 102 via DNS server 110, which allows the access control provider to manage access to those services. At the same time, the translated IP address for the allowed services may not be published by the application providers DNS server 116 so as to prevent unauthorized access to those services from outside of the access provider's system. It is also best if the translated IP addresses are whitelisted to the access control provider's DNS server 110 and are not loaded to any publicly accessible DNS. The translated requests may then be directed by the MPLS 104 to the content filter 112, which decides whether to permit the service request or deny the service request. When the user of the computing device 102 still has a valid data plan or is otherwise permissioned to use the network, all requests may be directed as requests for unmanaged domains by the content filter 112, which may send the requests through the Internet to the public gateway 118, where all regularly accessible applications/services may be accessed, such as email 120 and drive storage 122, as well as applications 124 which might be inaccessible under certain circumstances. When the user of the computing device 102 has an invalid data plan or is otherwise not permissioned to use the network, requests for permitted services may be routed through the Internet to private gateway 126, where allowed services, such as email 120 and drive storage 122 may be allowed, but access to other applications, such as applications 124 may not be possible. At the same time, when the data plan is not valid, requests to access controlled services may be routed to deny page 114 instead. As a further explanation of the above process, requests to managed domains, e.g., email.com, may be handled as further illustrated in FIG. 2. When the computer device 102 sends a DNS request for a managed domain (permitted service), step 202, the DNS server 110 may translate the managed domain request to the IP address provided by the application provider 204. The DNS server 110 then returns that IP address to the computing device 102, step 206. The computing device 102 then sends an HTTPS request to the IP address provided by the application provider, step 208. The MPLS may then translate that HTTPS request to a short path label and direct that label to the content filter 112, which may be configured to unconditionally allow requests to that path (IP address) and therefore permit the request to go through to the service so requested, step 210. In contrast, requests to unmanaged domains, such as application.com may be handled in accordance with FIG. 3. In step 302, the computing device 102 sends a request for application.com, which is an unmanaged domain. The DNS server 110 cannot translate the DNS as it has no IP address that corresponds to it from the application provider, so the request is sent through to the DNS server 116, step 304, which provides the translation and returns this to DNS server 110, which returns the IP address to the computing device 102, step 306. The computing device 102 then sends an HTTPS request to that IP, step 308, the short label for which may be allowed by the content filter 112 if the data plan is valid, by routing the request through the Internet to the public gateway 118, or denying the request, if the data plan is not valid, step 310. In accordance with the embodiment, if the computing device 102 is within range of the RAN (which is almost ubiquitous) or other wireless network, then the computing device can access applications, services, documents, email, contacts, calendars, and other permitted services, even if the user does not have a data plan, does not have a valid data plan, is without access to Wi-Fi, or is otherwise not permissioned to use a detectable wireless network. Provision of such a feature removes a major difference between more traditional computing devices that store applications and documents on the computing devices themselves and this new form of computing device that stores applications and documents over the cloud. Both devices now have local access to applications and documents and files when otherwise disconnected. In an embodiment, the providers of the computing devices may contract in advance with access service providers and/or wireless network owners to enable their computing devices, and therefore the users of their computing devices, to have a certain level of controlled access all of the time, even when the user of the computer device does not have a data plan or a valid data plan or is otherwise no permissioned to use their wireless network. For example, GOOGLE could contract with various access service providers to make sure that a GOOGLE CHROMEBOOK always had access to a network when a user of a GOOGLE CHROMEBOOK was attempting to use a GOOGLE application, regardless of any relationships between the user and the access providers. If desired, such access could be kept completely secret and invisible to the user, i.e., the device works when accessing some pre-selected applications (e.g., only Google applications hosted in a location other than on the device) and does not work when accessing other applications, without any indication or explanation as to why. Third parties could also contract to provide access to networked applications accessible from user's devices. For example, in a workplace environment, a mall, a college campus, etc., an entity (such as an employer, a store, or an advertiser) could provide free network access to any users of such devices regardless of whether the user's otherwise had network access rights. Such access may be provided in secret, but could also be advertised in some manner, such as routing requests from the content filter to an advertising page instead of the deny page 114. A number of computing systems have been described throughout this disclosure. The descriptions of these systems are not intended to limit the teachings or applicability of this disclosure. Further, the processing of the various components of the illustrated systems may be distributed across multiple machines, networks, and other computing resources. For example, components of the rule engine, process engine, database and corresponding applications may be implemented as separate devices or on separate computing systems, or alternatively as one device or one computing system. In addition, two or more components of a system may be combined into fewer components. Further, various components of the illustrated systems may be implemented in one or more virtual machines, rather than in dedicated computer hardware systems. Likewise, the databases and other storage locations shown may represent physical and/or logical data storage, including, for example, storage area networks or other distributed storage systems. Moreover, in some embodiments the connections between the components shown represent possible paths of data flow, rather than actual connections between hardware. While some examples of possible connections are shown, any of the subset of the components shown may communicate with any other subset of components in various implementations. Depending on the embodiment, certain acts, events, or functions of any of the algorithms described herein may be performed in a different sequence, may be added, merged, or left out altogether (e.g., not all described acts or events are necessary for the practice of the algorithms). Moreover, in certain embodiments, acts or events may be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially. FIG. 4 depicts an embodiment of an exemplary implementation of a computing device 400 suitable for practicing aspects of the present disclosure. Computing device 400 may be configured to perform various functions described herein by executing instructions stored on memory 408 and/or storage device 416, or over a network via network interfaces 414. Various examples of computing devices include personal computers, cellular telephones, smartphones, tablets, workstations, servers, and so forth. Embodiments may also be practiced on distributed computing systems comprising multiple computing devices communicatively coupled via a communications network. One or more processors 406 includes any suitable programmable circuits including one or more systems and microcontrollers, microprocessors, reduced instruction set circuits (RISC), application specific integrated circuits (ASIC), programmable logic circuits (PLC), field programmable gate arrays (FPGA), and any other circuit capable of executing the functions described herein. The above example embodiments are not intended to limit in any way the definition and/or meaning of the term “processor.” Memory 408 and storage devices 416 include non-transitory computer readable storage mediums such as, without limitation but excluding signals per se, random access memory (RAM), flash memory, a hard disk drive, a solid state drive, a diskette, a flash drive, a compact disc, a digital video disc, and/or any suitable memory. In the exemplary implementation, memory 408 and storage device 416 may include data and/or instructions embodying aspects of the disclosure that are executable by processors 406 (e.g., processor 406 may be programmed by the instructions) to enable processors 406 to perform the functions described herein. Additionally, memory 408 and storage devices 416 may comprise an operation system 402, basic input-output system (“BIOS”) 404, and various applications. Display 410 includes at least one output component for presenting information to a user of the computing device and may incorporate a user interface 411 for providing interactivity through the display 410. Display 410 may be any component capable of conveying information to a user of the computing device. In some implementations, display 410 includes an output adapter such as a video adapter and/or an audio adapter or the like. An output adapter is operatively coupled to processor 406 and is configured to be operatively coupled to an output device such as a display device (e.g., a liquid crystal display (LCD), organic light emitting diode (OLED) display, cathode ray tube (CRT), “electronic ink” display, or the like) or an audio output device (e.g., a speaker, headphones, or the like). Input Devices 412 includes at least one input component for receiving input from a user. Input component 412 may include, for example, a keyboard, a pointing device, a mouse, a stylus, a touch sensitive panel (e.g., a touch pad or a touch screen incorporated into the display 410), a gyroscope, an accelerometer, a position detector, an audio input device, or the like. A single component such as a touch screen may function as both an input device 412 and a display 410. Network interfaces 414 may comprise one or more devices configured to transmit and receive control signals and data signals over wired or wireless networks. In various embodiments, one or more of network interfaces 414 may transmit in a radio frequency spectrum and operate using a time-division multiple access (“TDMA”) communication protocol, wideband code division multiple access (“W-CDMA”), and so forth. In various embodiments, network interfaces 414 may transmit and receive data and control signals over wired or wireless networks using Ethernet, 802.11, Internet protocol (“IP”) transmission, and so forth. Wired or wireless networks may comprise various network components such as gateways, switches, hubs, routers, firewalls, proxies, and so forth. Embodiments may perform selective feature control, such as rating control, video resolution control, application performance or other application feature control, quality of service control and/or security control instead of, or in addition to, selective access control. With respect to generic feature control, a request may be made for service from an IP address, which service can be controlled in some manner, such as controlling the resolution of video from a video streaming website, or controlling bandwidth available for use of a video game or other online application. For example, with respect to rating control, variable rating for mobile traffic is based on destination. For instance, all traffic to Facebook may be free or the first 500 MB on YouTube may be free. However, when rating encrypted traffic to an application provider that is using the same IP rate for multiple services, it previously was impossible to rate one service differently than another. The present disclosure provides a solution to this problem. FIG. 5 depicts an embodiment that controls a feature, such as the rating of requests issued by the computing device 102. The MPLS 104 may direct the issued DNS request to the DNS server 110, which translates the DNS request for managed domains to new IP addresses obtained from the application provider. On the other hand, the DNS server 110 cannot translate the DNS requests for unmanaged domains, so the request may be sent through to DNS server 116, where it is translated to an IP address. The translated IP address is then sent back to the computing device 102 via DNS server 110. The MPLS 104 may then direct the translated requests to the content filter 112, which decides whether to permit or deny the service request based on the user's data plan or other criteria. When the user of the computing device 102 still has a valid data plan or is otherwise permissioned to use the network, all requests may be directed as requests for unmanaged domains by the content filter 112, which may send the requests through the Internet to the public gateway 118. When the user of the device 102 has an invalid data plan or is otherwise not permissioned to use the network, requests for permitted services may be directed through the Internet to private gateway 126, or alternatively may be directed to deny page 114. A feature engine or controller 500, such as the rating engine 700 of FIG. 7 may then apply a special rate based on the user's data plan or some other criteria. The rating engine 700 can explicitly identify even encrypted traffic to a specific service offered by an application provider by the destination IP, which is controlled by the DNS server 110. In an alternate embodiment, the MPLS 104 may direct the translated requests to the feature engine/controller 500 or rating engine 700 without first routing them to the content filter 112. Hence, in an embodiment, the feature engine or controller may be a rating controller, the first feature control may be a first price and the second feature control may be a second price. In an embodiment, the feature controller may be a video resolution controller, the first feature control may be a first video resolution and the second feature control may be a second video resolution. In an embodiment, the feature controller may be an application performance controller, the first feature control may be a first level of application performance and the second feature control may be a second level of application performance. As a further explanation of the system disclosed in FIG. 5 and process described above, requests to control unmanaged domains may be handled in accordance with FIG. 6. In step 502, the computing device 102 sends a request for access to a website, such as application.com, which is a managed domain. The DNS server 110 translates the DNS request to an IP address that was obtained from the application provider, step 504. The DNS server 110 returns the IP address to the computing device 102, step 506. The computing device 102 then sends an HTTPS request to that IP address, step 508, and the feature engine 500 applies a feature control, such as special rate, based on the user's data plan or other criteria, step 510, thereby managing the domain. FIG. 7 depicts an embodiment in which the feature engine 500 of FIG. 5 may be a rating engine or Quality of Service (QoS) engine 700. When the feature engine is a QoS engine 700, selective quality of service control may be performed in a manner similar to rating control. QoS refers to allowed traffic speed. A DNS request to an internet domain is translated, either by the DNS server 110 for managed domains or the DNS server 116 for unmanaged domains. The translated IP address is then sent back to the computing device 102. The MPLS 104 may then direct the translated requests to the content filter 112, which decides whether to permit or deny the request based on the user's data plan or other criteria. A QoS engine 700, which may either take the place of the rating engine or be essentially placed in parallel with the rating engine, may then provide different traffic speeds limits for different domains. In an alternative embodiment, the MPLS 104 may direct the translated requests to the QoS engine without first routing them to the content filter 112. FIG. 8 depicts another embodiment in which selective security control may be performed in a manner similar to rating control and quality of service control. Security controls protect the computing device 102 from network threats. A DNS request to an internet domain is translated, either by the DNS server 110 for managed domains or the DNS server 116 for unmanaged domains. The translated IP address is then sent back to the computing device 102. The MPLS 104 may then direct the requests to the content filter 112, which decides whether to permit or deny the service request based on the user's data plan or other criteria. A security control engine 800, such as a firewall, either taking the place of the rating/QoS engine 700 of FIG. 7 or placed in parallel with the rating engine/QoS 700, can protect the computing device 102 from network threats. In an alternate embodiment, the MPLS 104 may direct the translated requests to the security control engine without first routing them to the content filter 112. The DNS server 110 may also need to be updated so that it stays in sync with the global DNS server 116. The DNS server 110 controls the IP assignment for managed domains. These IP addresses are selected from the existing IP range that belongs to the application provider's network 108. Since the application provider may change the IP ranges in its network 108 from time to time, the DNS server 110 may need to be updated accordingly. To ensure that the DNS server 110 is in sync with the global DNS server 116, the global DNS server 116 may be queried each time that a predetermined number of minutes has passed and the IP ranges associated with the managed domains may be obtained. The IP range associated with the managed domain in the DNS server 110 may be checked. If the IP range associated with the managed domain in the DNS server 110 is not fully contained within the range obtained from the global DNS server 116, the IP range defined in the system's DNS server 110 may be updated. Conditional language used herein, such as, among others, “may,” “might,” “e.g.,” and the like, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include certain features, elements and/or states. Thus, such conditional language is not generally intended to imply that features, elements and/or states are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without author input or prompting, whether these features, elements and/or states are included or are to be performed in any particular embodiment. While the above detailed description has shown, described, and pointed out novel features as applied to various embodiments, it will be understood that various omissions, substitutions, and changes in the form and details of the devices or algorithms illustrated may be made without departing from the spirit of the disclosure. As will be recognized, the processes described herein may be embodied within a form that does not provide all of the features and benefits set forth herein, as some features may be used or practiced separately from others. The scope of protection is defined by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope. What is claimed: 1. A system for managing access of a computing device to one or more services over a network, comprising: a first server configured to receive a first request for a service among the one or more services from the computing device, to translate the first request to a first address corresponding to the first request if the first request is for a managed service among the one or more services, and to send the first request to a second server if the first request is for an unmanaged service among the one or more services, the first server being further configured to receive a second address from the second server for the first request for the unmanaged service, the first server being further configured to send the first address or the second address to the computing device; and a quality of service (QoS) engine configured to receive a second request from the computing device based on either the first address or the second address, to set a first QoS that will apply to the second request if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, and to set a second QoS that will apply to the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 2. The system as recited in claim 1, wherein the first QoS is a first traffic speed and the second QoS is a second traffic speed. 3. The system as recited in claim 1, further comprising a rating controller configured to receive the second request from the computing device at the same time as the QoS engine based on either the first address or the second address, to set a first price that will apply to the second request if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, and to set a second price that will apply to the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 4. The system as recited in claim 1, further comprising a filter configured to receive the second request from the computing device prior to the QoS engine based on either the first address or the second address, to permit the second request to proceed to the QoS engine if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, to deny the second request to proceed to the QoS engine if the computing device does not have a valid data plan for using the network or is otherwise not permissioned to use the network and the second request corresponds to the second address, and to permit the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 5. The system as recited in claim 1, further comprising a security control engine configured to receive the second request from the computing device at the same time as the QoS engine based on either the first address or the second address, to set a first security control feature that will apply to the second request if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, and to set a second security control feature that will apply to the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 6. A system for managing access of a computing device to one or more services over a network, comprising: a first server configured to receive a first request for a service among the one or more services from the computing device, to translate the first request to a first address corresponding to the first request if the first request is for a managed service among the one or more services, and to send the first request to a second server if the first request is for an unmanaged service among the one or more services, the first server being further configured to receive a second address from the second server for the first request for the unmanaged service, the first server being further configured to send the first address or the second address to the computing device; and a security control engine configured to receive a second request from the computing device based on either the first address or the second address, to set a first security control feature that will apply to the second request if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, and to set a second security control feature that will apply to the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 7. The system as recited in claim 6, wherein the security control engine is a firewall, wherein the first security control feature is configured to permit the computing device access to the network and the second security control feature is configured to deny the computing device access to the network. 8. The system as recited in claim 6, further comprising a rating controller configured to receive the second request from the computing device at the same time as the security control engine based on either the first address or the second address, to set a first price that will apply to the second request if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, and to set a second price that will apply to the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 9. The system as recited in claim 6, further comprising a quality of service (QoS) engine configured to receive a second request from the computing device at the same time as the security control engine based on either the first address or the second address, to set a first QoS that will apply to the second request if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, and to set a second QoS that will apply to the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 10. The system as recited in claim 6, further comprising a filter configured to receive the second request from the computing device prior to the security control engine based on either the first address or the second address, to permit the second request to proceed to the security control engine if the computing device has a valid data plan for using the network or is otherwise permissioned to use the network and the second request corresponds to the second address, to deny the second request to proceed to the security control engine if the computing device does not have a valid data plan for using the network or is otherwise not permissioned to use the network and the second request corresponds to the second address, and to permit the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 11. A system for managing access of a computing device to one or more services over a network, comprising: a first server configured to: receive a first request for a service among the one or more services from the computing device, translate the first request to a first address corresponding to the first request if the first request is for a managed service among the one or more services, send the first request to a second server if the first request is for an unmanaged service among the one or more services, check after a predetermined period to determine if an IP address range associated with managed services among the one or more services have changed, update the IP address range if the IP address range has changed and is no longer fully contained within a global IP address range associated with the second server, receive a second address from the second server for the first request for the unmanaged service, and send the first address or the second address to the computing device; and a feature controller configured to receive a second request from the computing device based on either the first address or the second address and to set a first feature control that will apply to the second request for the managed service and to set a second feature control that will apply to the second request for the unmanaged service. 12. The system as recited in claim 11, wherein the feature controller is a rating controller, wherein the first feature control is a first price, and wherein the second feature control is a second price. 13. The system as recited in claim 11, wherein the feature controller is a quality of service (QoS) engine, and wherein the first feature control is a first traffic speed and the second feature control is a second traffic speed. 14. The system as recited in claim 11, wherein the feature controller is an application performance controller, wherein the first feature control of the application performance controller is a first level of application performance, and wherein the second feature control of the application performance controller is a second level of application performance. 15. The system as recited in claim 11, wherein the feature controller is a video resolution controller, wherein the first feature control of the video resolution controller is a first video resolution, and wherein the second feature control of the video resolution controller is a second video resolution. 16. The system as recited in claim 11, wherein the feature controller is a security control engine, and wherein the first feature control of the security control engine is a first security control feature, and wherein the second feature control of the security control engine is a second security control feature. 17. A system for managing access of a computing device to one or more services over a network, comprising: a first server configured to receive a first request for a service among the one or more services from the computing device, to translate the first request to a first address corresponding to the request if the first request is for a managed service among the one or more services, and to send the first request to a second server if the first request is for an unmanaged service among the one or more services, the first server being further configured to receive a second address from the second server for the first request for the unmanaged service, the first server being further configured to send the first address or the second address to the computing device; and a feature controller configured to receive a second request from the computing device based on either the first address or the second address, and to set a feature control that will apply to the second request even if the computing device does not have a valid data plan or is otherwise not permissioned to use the network if the second request corresponds to the first address. 18. The system as recited in claim 16, wherein the feature controller is a rating controller, wherein the feature control of the rating controller is a price. 19. The system as recited in claim 16, wherein the feature controller is a video resolution controller, wherein the feature control of the video resolution controller is a video resolution. 20. The system as recited in claim 16, wherein the feature controller is an application performance controller, wherein the feature control of the application performance controller is a level of application performance.

2020-09-29

en

2021-01-14

US-202117335785-A

Sterilization module and sterilization device including thereof ABSTRACT A sterilization apparatus includes a support member and multiple germicidal light sources. The multiple germicidal light sources are mounted on the support member and emit germicidal light which is light having a wavelength capable of inactivating microorganisms. In addition, respective light exit surfaces of the multiple germicidal light sources face in different directions from one another. Further, an irradiance of the germicidal light delivered to a sterilization target is greater than a minimum irradiance required for sterilization. CROSS REFERENCE TO RELATED APPLICATION AND PRIORITY This Present Application is a Non-provisional Application which claims priority to the benefit of U.S. Provisional Application No. 63/033,386 filed Jun. 2, 2020, and U.S. Provisional Application No. 63/064,491 filed Aug. 12, 2020, the disclosure of which is incorporated by reference in its entirety. TECHNICAL FIELD Embodiments of the present disclosure relate to a sterilization unit and a sterilization apparatus including the same. BACKGROUND Recently, with spread of viruses that threaten human health, such as COVID-19, efforts are being made to kill the viruses to protect humans from infection. In particular, a sterilization luminaire capable of sterilizing a living space, such as a house and an office, has recently been in the spotlight. However, such a sterilization luminaire is generally a built-in product, which is not portable from space to space. Accordingly, many built-in sterilization luminaires are needed to sterilize each space, thus resulting in increased expenses. Further, a general portable sterilization device is intended to sterilize a specific object with germicidal light and thus provides a small range of illumination. Accordingly, such a portable sterilization device is not suitable for sterilizing the entire region of a living space such as a house and an office. The above information disclosed in this Background section is only for understanding of the background of the inventive concepts, and, therefore, it may contain information that does not constitute prior art. SUMMARY Embodiments of the present disclosure provide a sterilization module which can sterilize a space, and a sterilization apparatus including the same. Embodiments of the present disclosure provide a sterilization module which can uniformly deliver germicidal light throughout a space to be sterilized, and a sterilization apparatus including the same. Embodiments of the present disclosure provide a sterilization apparatus which can be easily moved from space to space as necessary. Embodiments of the present disclosure provide a sterilization apparatus which can automatically control a sterilization operation. In accordance with one aspect of the present disclosure, there is provided a sterilization module including a support member and multiple germicidal light sources. The multiple germicidal light sources are mounted on the support member and emit germicidal light, which is light having a wavelength capable of inactivating microorganisms. Respective light exit surfaces of the multiple germicidal light sources face in different directions from one another. The sterilization module illuminates a sterilization target with the germicidal light at an irradiance greater than a minimum irradiance required for sterilization. The sterilization unit may include a first sterilization unit and a second sterilization unit each comprising a support member and multiple germicidal light sources. In addition, the first sterilization unit and the second sterilization unit may face in different directions from one another. The sterilization unit may include a pair of first sterilization units spaced apart from each other and facing in opposite directions and a pair of second sterilization units spaced apart from each other and facing in opposite directions. The pair of second sterilization units may be disposed between the pair of first sterilization units. The sterilization unit may further include a third sterilization unit comprising germicidal light sources. Here, the third sterilization unit may be disposed between the first sterilization unit and the second sterilization unit. Alternatively, the third sterilization unit may be disposed above or below the first sterilization unit or the second sterilization unit. Respective light exit surfaces of two germicidal light sources disposed at opposite ends of the support member, among the multiple germicidal light sources, may face in opposite directions with respect to a central axis of the support member. The sterilization unit may further include multiple securing members each having a mounting surface on which the germicidal light source is mounted. Here, respective mounting surfaces of the multiple securing members may face in different directions from one another. The sterilization module has an illumination uniformity of 75% or more. In accordance with another aspect of the present disclosure, a sterilization apparatus includes a main frame, a sterilization unit, and multiple connection members. The sterilization unit includes multiple germicidal light sources emitting germicidal light, which is light having a wavelength capable of inactivating microorganisms. The multiple connection members connect the main frame to the sterilization unit. The sterilization unit includes a first sterilization unit and a second sterilization unit each including a support member and multiple germicidal light sources. The multiple germicidal light sources are disposed on the support member with respective light exit surfaces thereof facing in different directions from one another. The sterilization apparatus illuminates a sterilization target with the germicidal light at an irradiance greater than a minimum irradiance required for sterilization. The first sterilization unit and the second sterilization unit may face in different directions from one another. The sterilization unit may include a pair of first sterilization units spaced apart from each other and facing in opposite directions and a pair of second sterilization units spaced apart from each other and facing in opposite directions. Here, the pair of second sterilization units may be disposed between the pair of first sterilization units. The sterilization unit may further include a third sterilization unit including germicidal light sources and mounted on the connection member or the main frame. Here, the third sterilization unit may be disposed between the first sterilization unit and the second sterilization unit. Alternatively, the third sterilization unit may be disposed above or below the first sterilization unit or the second sterilization unit. Respective light exit surfaces of two germicidal light sources disposed at opposite ends of the support member, among the multiple germicidal light sources, may face in opposite directions with respect to a central axis of the support member. The sterilization unit may further include multiple securing members each having a mounting surface on which the germicidal light source is mounted and a securing portion secured to the support member. Here, respective mounting surfaces of the multiple securing members may face in different directions from one another. The sterilization apparatus may further include an object detection sensor detecting movement of an object. The sterilization apparatus may further include a controller controlling the sterilization unit to stop emission of the germicidal light upon detection of an object by the object detection sensor. The sterilization apparatus may further include at least one of a distance sensor measuring a distance to a sterilization target and a timer transmitting a signal for controlling sterilization time to the controller. The sterilization apparatus may further include a calculation unit calculating at least one of intensity of the germicidal light and sterilization time based on at least one of information about the distance to the sterilization target and information about the sterilization time. The sterilization apparatus has an illumination uniformity of 75% or more. In accordance with some embodiments of the present disclosure, the sterilization module and the sterilization apparatus can uniformly deliver germicidal light throughout a space to be sterilized, thereby providing improved sterilization efficiency. In accordance with other embodiments of the present disclosure, the sterilization apparatus can be moved from space to space. Thus, unlike conventional built-in sterilization apparatuses, the sterilization apparatus according to the present disclosure can eliminate the need to install one sterilization apparatus in each space, thereby providing cost saving benefits. In accordance with yet other embodiments of the present disclosure, the sterilization apparatus can perform efficient sterilization through automatic calculation of sterilization conditions depending on the type of spaces to be sterilized. It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are intended to provide further explanation of the disclosure as claimed. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the disclosure, and together with the description serve to explain the inventive concepts. FIG. 1 to FIG. 3 are exemplary views of a sterilization apparatus according to a first embodiment of the present disclosure, where: FIG. 1 illustrates a perspective view of a sterilization apparatus; FIG. 2 illustrates a side view of the sterilization apparatus of FIG. 1; and FIG. 3 illustrates the sterilization apparatus of FIG. 1 in which sterilization units are coupled to the main frame. FIG. 4 is a schematic block diagram of a sterilization apparatus according to a second embodiment of the present disclosure. FIG. 5 and FIG. 6 are exemplary views of a sterilization apparatus according to a third embodiment of the present disclosure, where: FIG. 5 is a perspective view of the sterilization apparatus according to the third embodiment; and FIG. 6 is a side view of the sterilization apparatus according to the third embodiment. FIG. 7 is a view illustrating illumination range of a sterilization apparatus including a flat support member. FIG. 8 and FIG. 9 are exemplary views of a sterilization apparatus according to a fourth embodiment of the present disclosure where: FIG. 8 is a perspective view of the sterilization apparatus; and FIG. 9 illustrates a first mounting surface tiled at a predetermined angle. FIG. 10A through FIG. 10C show comparison in light distribution between a conventional sterilization apparatus and the sterilization apparatus according to the fourth embodiment, where: FIG. 10A shows the light distribution of the sterilization apparatus according to the fourth embodiment; FIG. 10B shows the light distribution of the sterilization apparatus according to the fourth embodiment around the center of a space to be sterilized; and FIG. 10C shows the light distribution of the conventional sterilization apparatus. FIG. 11 is a schematic plan view of a sterilization apparatus according to a fifth embodiment of the present disclosure. FIG. 12 and FIG. 13 are exemplary views of a sterilization apparatus according to a sixth embodiment of the present disclosure where: FIG. 12 illustrates a main frame having a cuboidal shape; and FIG. 13 illustrates an additional sterilization unit disposed on each surface of the main frame of FIG. 12. FIG. 14 is a schematic block diagram of a sterilization apparatus according to a seventh embodiment of the present disclosure. FIG. 15 is a graph showing changes in intensity depending on travel distance of germicidal light. FIG. 16 is a graph showing changes in sterilization time depending on travel distance of germicidal light. FIG. 17 is a graph showing changes in sterilization time depending on intensity of germicidal light. DETAILED DESCRIPTION Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the embodiments are provided for complete disclosure and a thorough understanding of the present disclosure by those skilled in the art. Therefore, the present disclosure is not limited to the following embodiments and may be embodied in different ways. In addition, the drawings may be exaggerated in width, length, and thickness of components for descriptive convenience and clarity only. Like components will be denoted by like reference numerals throughout the specification. FIG. 1 to FIG. 3 are exemplary views of a sterilization apparatus according to a first embodiment of the present disclosure. FIG. 1 is a perspective view of the sterilization apparatus 100 according to the first embodiment of the present disclosure. FIG. 2 is a side view of the sterilization apparatus 100 according to the first embodiment of the present disclosure. Referring to FIG. 1 and FIG. 2, the sterilization apparatus 100 according to the first embodiment includes a main frame 110 and a sterilization unit. The main frame 110 extends in a vertical direction. In addition, the main frame 110 supports the sterilization unit with a space between the sterilization unit and the floor. In this way, the main frame 110 allows germicidal light emitted from the sterilization unit to be efficiently delivered to a sterilization target. Here, the sterilization target may be a specific object. Alternatively, the sterilization target may be a space in which the sterilization apparatus 100 is located. The main frame 110 may have a vertically elongated shape. The sterilization apparatus 100 may include multiple sterilization units. The multiple sterilization units may be mounted on the main frame 110. Each of the multiple sterilization units includes a support member and a germicidal light source mounted on the support member. The germicidal light source may be, for example, a light emitting diode chip or a light emitting diode package. The support member has an elongated shape and is secured to the main frame 110. The support member is horizontally secured to the main frame 110. The support member is adapted to horizontally arrange multiple germicidal light sources thereon and may be formed of any material that can support the multiple germicidal light sources. In one embodiment, the support member may be a substrate with a circuit pattern formed thereon. In this embodiment, power can be supplied to the multiple germicidal light sources through the circuit pattern of the support member. In another embodiment in which the support member is not formed with a circuit pattern, a separate substrate or cable may be mounted on the support member to supply power to the germicidal light sources therethrough. At least one of the multiple support members may be positioned non-parallel to the other support members. Referring to FIG. 1, the sterilization unit may include a first sterilization unit 120 and a second sterilization unit 130. Although the sterilization unit is described as including the first sterilization unit 120 and the second sterilization unit 130, the first sterilization unit 120 and the second sterilization unit 130 are different as respective support members of the sterilization units face in different directions from each other. Accordingly, characteristics of one of the first sterilization unit 120 and the second sterilization unit 130 can be equally applied to the other one. The first sterilization unit 120 may include a first support member 121 and multiple first germicidal light sources 122, and the second sterilization unit 130 may include a second support member 131 and multiple second germicidal light sources 132. As described above, the first support member 121 and the second support member 131 may be identical to each other except that the first support member 121 and the second support member 131 face in different directions from each other. In addition, the first germicidal light source 122 and the second germicidal light source 132 may be identical to each other. In brief, a germicidal light source mounted on the first support member 121 is referred to as the first germicidal light source 122, and a germicidal light source mounted on the second support member 131 is referred to as the second germicidal light source 132. Both the first support member 121 and the second support member 131 may be horizontally secured to the main frame 110. Here, the first support member 121 and the second support member 131 may disposed to cross each other. The germicidal light source emits germicidal light to sterilize a sterilization target. The germicidal light may be any wavelength of light that can inactivate microorganisms. For example, the germicidal light may be light having germicidal power, such as blue light and UV light. In particular, UVC is known to have high germicidal capability. The sterilization apparatus 100 according to this embodiment illuminates a sterilization target with the germicidal light at an intensity greater than or equal to a minimum intensity required for sterilization. Referring to FIG. 1, the first germicidal light source 122 may be mounted on both surfaces of the first support member 121, and the second germicidal light source 132 may be mounted on both surfaces of the second support member 131. The first support member 121 may be disposed such that the opposite surfaces thereof having the respective first germicidal light sources 122 mounted thereon face in upward and downward directions of the main frame 110, respectively. That is, one side surface of the first support member 121, which is connected between the opposite surfaces having the respective first germicidal light sources 122 mounted thereon, may be secured to the main frame 110. The second support member 131 may be disposed such that the opposite surfaces thereof having the respective second germicidal light sources 122 mounted thereon face in opposite lateral directions of the main frame 110, respectively. That is, one of the opposite surfaces of the second support member 131 having the respective second germicidal light sources 122 mounted thereon may be partially secured to the main frame 110. Each of the first sterilization unit 120 and the second sterilization unit 130 may include a connection member 160. The connection member 160 of the first sterilization unit 120 may connect the first support member 121 to the main frame 110. In addition, the connection member 160 of the second sterilization unit 130 may connect the second support member 131 to the main frame 110. That is, the connection member 160 of the first sterilization unit 120 is connected at one end thereof to the main frame 110 and is connected at the other end thereof to the first support member 121. In addition, the connection member 160 of the second sterilization unit 130 is connected at one end thereof to the main frame 110 and is connected at the other end thereof to the second support member 131. The connection member 160 of the second sterilization unit 130 may allow the main frame 110 to be spaced apart from the second support member 131, as shown in FIG. 2. In addition, although not shown, the connection member 160 of the first sterilization unit 120 may allow the main frame 110 to be spaced apart from the second support member 131. In addition, the sterilization apparatus 100 according to this embodiment may change a travel direction of the germicidal light through adjustment of angles of the first sterilization unit 120 and the second sterilization unit 130. For example, each of the first sterilization unit 120 and the second sterilization unit 130 is adjustable in angle with respect to a longitudinal direction of the main frame 110. In addition, each of the first sterilization unit 120 and the second sterilization unit 130 is movable along a side periphery of the main frame. In addition, each of the first sterilization unit 120 and the second sterilization unit 130 is pivotally coupled to the main frame 110. In this way, the sterilization apparatus 100 can be carried in compact form with the first sterilization unit 120 and the second sterilization unit 130 pivoted to be parallel to the main frame 110, as shown in FIG. 3. Adjustment of the angles of the first sterilization unit 120 and the second sterilization unit 130 may be performed through the first support member 121 and the second support member 131 or through the connection member 160. In addition, adjustment of the angles of the first sterilization unit 120 and the second sterilization unit 130 may be implemented by any angle adjustment technique known in the art, without limitation. Through adjustment of the angles of the first sterilization unit 120 and the second sterilization unit 130, the sterilization apparatus according to this embodiment can provide efficient sterilization regardless of the location of a sterilization target. In addition, the sterilization apparatus according to this embodiment can provide efficient sterilization through adjustment of the angles of the first sterilization unit 120 and the second sterilization unit 130 depending on the shape of a space to be sterilized. With the first support member 121 and the second support member 131 secured to the main frame 110 in a manner as shown in FIG. 1, the sterilization apparatus 100 according to this embodiment can deliver the germicidal light in all directions with respect to the main frame 110. That is, the sterilization apparatus 100 according to this embodiment can increase the area illuminated by the germicidal light, as compared with conventional sterilization apparatuses. Although each of the first sterilization unit 120 and the second sterilization unit 130 is described as including the connection member 160 in this embodiment, it will be understood that the present disclosure is not limited thereto and the connection member 160 may be omitted. The sterilization apparatus 100 according to this embodiment may include a moving member 140. The moving member 140 is disposed on an underside of the main frame 110 and helps to move the sterilization apparatus 100. For example, the moving member 140 may include a wheel. Although the present disclosure is described with reference to an example in which the moving member 140 includes a wheel, it will be understood that the present disclosure is not limited thereto and the moving member 140 may be anything that can help to move the sterilization apparatus 100. With the moving member 140, the sterilization apparatus 100 according to this embodiment can be easily moved from space to space. Since the sterilization apparatus 100 according to this embodiment can be moved to a space in need of sterilization, there is no need to install the sterilization apparatus in each space. Thus, the sterilization apparatus 100 according to this embodiment can provide high cost saving benefits, as compared with conventional built-in sterilization devices. Referring to FIG. 3, each of the first sterilization unit 120 and the second sterilization unit 130 may be pivotally coupled to the main frame 110. Next, other embodiments of the present disclosure will be described. Description of the same components as in the above embodiment will be omitted or briefly given. For details of the same components as in the above embodiment, refer to description given for the above embodiment. FIG. 4 is an exemplary view of a sterilization apparatus according to a second embodiment. Referring to FIG. 4, the sterilization apparatus 200 according to the second embodiment may further include a sensor 230 and a controller 220 besides the components of the sterilization apparatus according to the first embodiment. The sensor 230 detects a person or an object in a space to be sterilized. That is, with the sensor 230, the sterilization apparatus 200 according to this second embodiment can detect the presence/absence of a person in a space in which sterilization is performed. For example, the sensor 230 may include an ultrasonic sensor, an image sensor, an optical sensor, a pressure sensor, and the like. In addition, the sensor 230 may include any type of sensor that can detect a sterilization target in a space to be sterilized, such as a chemical sensor, a biosensor, and a temperature sensor. The controller 220 may control operation of the sterilization unit 210 based on signals received from the sensor 230. The controller 220 may control the sterilization unit 210 to stop emission of the germicidal light in response to a signal from the sensor 230. For example, when the sensor 230 detects a person in a space to be sterilized, the sensor 230 transmits a signal corresponding thereto to the controller 220. The controller 220 stops sterilization operation of the sterilization unit 210 in response to the signal from the sensor 230. When there is no person in the space to be sterilized, the sensor 230 transmits a signal corresponding thereto to the controller 220. The controller 220 controls the sterilization unit 210 to resume emission of the germicidal light in response to the signal from the sensor 230. The sterilization apparatus 200 may further include an output unit 240 displaying detection of an object by the sensor 230. The output unit 240 may be operated in response to a signal from the sensor 230, or may be operated in response to a signal from the controller 220. The sterilization apparatus 200 according to this embodiment can prevent a person or an animal from being exposed to the germicidal light through detection of movement of a person or an animal. FIG. 5 and FIG. 6 are exemplary views of a sterilization apparatus according to a third embodiment of the present disclosure. FIG. 5 is a perspective view of the sterilization apparatus 300 according to the third embodiment, and FIG. 6 is a side view of the sterilization apparatus 300 according to the third embodiment. The sterilization apparatus 300 according to the third embodiment includes a main frame 110, a sterilization unit 320, 330, and a moving member 140. The main frame 110 extends in the vertical direction and serves to support the sterilization unit. In this embodiment, the sterilization unit includes a first sterilization unit 320 and a second sterilization unit 330. Each of the first sterilization unit 320 and the second sterilization unit 330 has a horizontally elongated shape. The first sterilization unit 320 includes a first support member 321 and multiple germicidal light sources 310 mounted on the first support member 321. The second sterilization unit 330 includes a second support member 331 and multiple germicidal light sources 310 mounted on the second support member 331. Referring to FIG. 6, the germicidal light source 310 is disposed on a lower surface of each of the first support member 321 and the second support member 331. Accordingly, the germicidal light source 310 may emit light in a downward direction of the sterilization apparatus 300. The first support member 321 and the second support member 331 have an elongated shape and are disposed side by side with the main frame 110 interposed therebetween. In addition, opposite longitudinal ends of each of the first support member 321 and the second support member 331 are movable up and down with a side surface of each of the first support member 321 and the second support member 331 partially secured to a vertical member. Both longitudinal ends of each of the first support member 321 and the second support member 331 may form multiple mounting portions 301. At least one germicidal light source 310 may be mounted on each of the multiple mounting portions 301. In addition, the multiple mounting sections 301 may be bendable to various angles. As shown in FIG. 6, the germicidal light can reach farther depending on bending angles of the mounting portions 301 of the first support member 321 and the second support member 331. In addition, the germicidal light can be delivered laterally as well as downward depending on the bending angles of the mounting sections 301 of the first support member 321 and the second support member 331. FIG. 7 is an exemplary view illustrating an illumination range of a sterilization apparatus including a flat support member. In the sterilization apparatus 10 of FIG. 7, due to the flat shape of the support member, all germicidal light sources 12 emit light toward a bottom of a space to be sterilized. That is, the sterilization apparatus 10 can illuminate only a portion of the bottom of the space to be sterilized. Conversely, the sterilization apparatus 300 according to this embodiment can deliver the germicidal light laterally as well as downward with the germicidal light sources 310 disposed only on one surface of each of the first support member 321 and the second support member 331, as shown in FIG. 6. As can be seen through comparison between FIG. 6 and FIG. 7, in the sterilization apparatus 300, a region illuminated by each germicidal light source can be varied depending on the bending angle of the support member. Thus, the sterilization apparatus 300 can increase sterilization area through adjustment of the bending angle of the support member. In FIG. 6, the germicidal light is shown as not being delivered to some regions of the space to be sterilized. However, the sterilization apparatus 300 according to this embodiment can illuminate the entire region of the space to be sterilized through adjustment of the bending angle of the support member and the number of germicidal light sources. In addition, when the first support member 321 and the second support member 331 are pivoted to different angles, the germicidal light can be delivered over a larger area. As such, the sterilization apparatus 300 according to this embodiment can illuminate a large area with the germicidal light using a small number of germicidal light sources through adjustment of the bending angles of the opposite ends of each of the first support member 321 and the second support member 331. FIG. 8 and FIG. 9 are exemplary views of a sterilization apparatus according to a fourth embodiment of the present disclosure. Referring to FIG. 8, the sterilization apparatus 400 according to the fourth embodiment includes a main frame 110, a sterilization unit, and a moving member 140. The sterilization unit may be a sterilization module including at least one germicidal light source 410. In this embodiment, the sterilization unit includes a first sterilization units 420, a second sterilization units 430, and a third sterilization unit 450. The sterilization apparatus 400 according to this embodiment has a structure in which sterilization units are disposed at fours sides of the main frame 110, respectively. The first sterilization unit 420 includes a first support member 121, a germicidal light source 410, a connection member 460, and a first securing member 470. The second sterilization unit 420 includes a second support member 131, a germicidal light source 410, a connection member 460, and a first securing member 470. The connection member 460 of the first sterilization unit 420 is connected at one end thereof to the main frame 110 and is connected at the other end thereof to the first support member 121. The connection member 460 of the second sterilization unit 430 is connected at one end thereof to the main frame 110 and is connected at the other end thereof to the second support member 131. In this embodiment, the connection member 460 extends from a side surface of the main frame 110. Thus, the first sterilization unit 420 and the second sterilization unit 430 can deliver the germicidal light farther away from the main frame 110. Multiple first securing members 470 are mounted on each of the first support member 121 and the second support member 131. Multiple germicidal light sources 410 are mounted on respective first securing members 470 of each of the first support member 121 and the second support member 131. The first securing member 470 includes a first mounting surface 471 on which the germicidal light source 410 is mounted and a first securing portion 472 secured to the first support member 121 or the second support member 131. In this embodiment, the first securing member 470 has a bent shape such that the first securing portion part 472 surrounds the first support member 121 or the second support member 131. However, it will be understood that the present disclosure is not limited thereto and the first securing portion 472 of the first securing member 470 may have any shape that allows the first securing portion 472 to be stably secured to the first support member 121 or the second support member 131. The first mounting surface 471 is tilted downward at a predetermined angle outwardly of the main frame 110. In addition, at least one of the multiple first securing members 470 mounted on one support member is tilted in a different direction than the other first securing members 470. For example, three first securing members 470 may be mounted on each of the first support member 121 and the second support member 131. The three first securing members 470 may be referred to as a 1st first securing member 475, a 2nd first securing member 476, and a 3rd first securing member 477, respectively. The 2nd first securing member 476 and the 3rd first securing member 477 are disposed at opposite sides of the 1st first securing member 475. Referring to FIG. 9, the first mounting surface 471 of the 2nd first securing member 476 and the first mounting surface 471 of the 3rd first securing member 477 are tilted at a predetermined angle in opposite directions with respect to the first mounting surface 471 of the 1st first securing member 475. Accordingly, as shown in FIG. 9, the germicidal light sources mounted on the 2nd first securing member 476 and the 3rd first securing member 477 can deliver the germicidal light toward a space located outwardly of a corner of the main frame 110. In the sterilization apparatus 400 according to this embodiment, light exit surfaces of the respective germicidal light sources 410 face in different directions from one another, since the 1st first securing member 475, the 2nd first securing member 476, and the 3rd first securing member 477 face in different directions from one another. Accordingly, the germicidal light sources 410 can deliver the germicidal light in different directions from one another, whereby a larger area can be illuminated with the germicidal light. In addition, since the light exit surfaces of the respective germicidal light sources 410 face in different directions from one another, the sterilization apparatus 400 according to this embodiment can reduce overlap in illumination between adjacent germicidal light sources 410, as compared with when the light exit surfaces of the respective germicidal light sources 410 face in the same direction. Thus, the sterilization apparatus 400 according to this embodiment can improve uniformity of illumination with the germicidal light, as compared with when the light exit surfaces of the respective germicidal light sources 410 face in the same direction. That is, the sterilization apparatus 400 according to the present embodiment can improve irradiance uniformity across the entire sterilization target through minimization of overlap in illumination between adjacent germicidal light sources 410. In particular, due to the structures of the 2nd first securing members 476 and the 3rd first securing member 477 disposed at the opposite ends of the support member, the sterilization apparatus 400 can also deliver the germicidal light to corners of a space to be sterilized, which would otherwise be generally unreachable by the germicidal light. The first securing member 470 may include a component for supplying power to the germicidal light source 410. For example, the first securing member 470 may include a circuit board formed with an interconnect electrically connected to the germicidal light source 410. Alternatively, the first securing member 470 may include a cable connected to the germicidal light source 410. The third sterilization unit 450 includes a second securing member 480 and a germicidal light source 410 mounted on the second securing member 480. Referring to FIG. 8, the third sterilization unit 450 is mounted on each side surface of the main frame 110. However, it will be understood that the third sterilization unit 450 is not necessarily mounted on the main frame 110. The third sterilization unit 450 may be mounted on the connection member 460. In addition, although the third sterilization unit 450 is shown as being disposed above the connection member 460, it will be understood that the present disclosure is not limited thereto and the third sterilization unit 450 may be disposed below the connection member 460. Further, the third sterilization unit 460 may be disposed between the connection members 460 to deliver the germicidal light through a space between the first sterilization unit 420 and the second sterilization unit 430. The second securing member 480 includes a second mounting surface 481 on which the germicidal light source 410 is mounted and a second securing portion 482 secured to the main frame 110. The second securing member 480 is coupled at one end thereof to a side surface of the main frame 110. Here, the one end of the second securing member 480 corresponds to the second securing portion 482. In FIG. 8, the second fixing portion 482 is simply shown as adjoining the side surface of the main frame 110. However, it will be understood that the present disclosure is not limited thereto and the second securing portion 482 may have any structure that allows the second securing portion 482 to be secured to the main frame 110. In addition, a portion of the other end of the second securing member 480 is tilted upward at a predetermined angle with respect to a body of the second securing member 480. Here, a lower surface of the inclined portion corresponds to the second mounting surface 481. Thus, the second mounting surface 481 faces sideways with respect to the main frame 110 and is tilted downward at a predetermined angle. Accordingly, the germicidal light source 410 mounted on the second mounting surface 481 emits the germicidal light diagonally toward a region under the sterilization unit. In this way, the germicidal light source 410 can deliver the germicidal light over a larger area. Like the first securing member 470, the second securing member 480 may include a component for supplying power to the germicidal light source 410. With the first sterilization unit 420 and the second sterilization unit 430 outwardly spaced a predetermined distance apart from the main frame 110, the sterilization apparatus 400 according to this embodiment can deliver the germicidal light to regions far away from the main frame 110. In addition, with the third sterilization unit 450, the sterilization apparatus 400 can deliver the germicidal light to a region between the main frame 110 and the first sterilization unit 420 or the second sterilization unit 430. Accordingly, with the first sterilization unit 420, the second sterilization unit 430, and the third sterilization unit 450, the sterilization apparatus 400 according to this embodiment can uniformly deliver the germicidal light over a large area. Table 1 shows the position and angle of each germicidal light source 410 according to this embodiment. TABLE 1 Position of germicidal Angle of germicidal light source (m) light source (deg.) X Y Z (height) α β γ Germicidal light source 0.8 0.0 2.0 — −65 — on 1st first securing member Germicidal light source 0.1 0.0 2.0 — −50 — on second securing member Germicidal light source 0.8 0.4 1.9 — −60 −55 on 2nd first securing member Germicidal light source 0.8 −0.4 2.0 — −60 55 on 3rd first securing member The germicidal light sources 410 shown in Table 1 are germicidal light sources 410 disposed at one side of the main frame 110. In the sterilization apparatus 400 according to this embodiment, a set of germicidal light sources 410 as shown in Table 1 is disposed at each of the four sides of the main frame 110. Assuming each germicidal light source 410 includes one light emitting diode, a total of 16 light emitting diodes is used in the sterilization apparatus 400 according to this embodiment. The present disclosure has been described with reference to an example in which the sterilization units of the sterilization apparatus 400 according to this embodiment are connected to the main frame 110 through respective connection members 460. However, it will be understood that the present disclosure is not limited thereto and the sterilization apparatus 300 according to this embodiment may have a different structure. By way of another example, the first sterilization unit 420 and the second sterilization unit 430 may be connected to a common connection member 460. For example, the sterilization apparatus 400 may include two connection members 460 connected to the main frame 110. Each of the connection members 460 may be connected at one end thereof to the first sterilization unit 420 and the second sterilization unit 430 and may be connected at the other end thereof to the main frame 110. One end of the support member 121 of the first sterilization unit 420 and one end of the support member 131 of the second sterilization unit 430 may be connected to the one end of the connection member 460. Here, the first sterilization unit 420 and the second sterilization unit 430 may be disposed to face in opposite directions and to be symmetrical with respect to the one end of the connection member 460. In addition, with the one end of each of the first sterilization unit 420 and the second sterilization unit 430 connected to the one end of the connection member 460, the other end of each of the first sterilization unit 420 and the second sterilization unit 430 may be moved outwardly or inwardly of the connection member 430. That is, in the sterilization apparatus 400, the sterilization unit may be folded or unfolded with respect to the connection member 460. The two connection members 460 may also be folded or unfolded with respect to the main frame 110. In addition, the main frame 110 is adjustable in length. Further, these motions of the sterilization apparatus 400 may be automatically performed to improve user convenience. Accordingly, the sterilization apparatus 400 can be carried or stored in compact form with the sterilization units and the connection member 460 folded and the main frame minimized in length. FIG. 10 shows comparison in light distribution between a conventional sterilization apparatus and the sterilization apparatus according to this embodiment. FIG. 10A shows a light distribution produced by the conventional sterilization apparatus and FIG. 10B shows a light distribution produced by the sterilization apparatus according to this embodiment. FIG. 10C shows a light distribution produced by four sterilization apparatuses according to this embodiment disposed around the center of a space to be sterilized. Here, “light distribution” refers to a distribution of the germicidal light delivered to the space to be sterilized by each of the sterilization apparatuses. In addition, the graphs of FIGS. 10A through 10C show irradiance levels of the germicidal light, as measured along the X-axis from the center of the space to be sterilized. The conventional sterilization apparatus (FIG. 10A) includes a sterilization unit located 2 m above the floor, wherein light exit surfaces of respective germicidal light sources of the sterilization unit face in the same direction. The sterilization apparatus according to this embodiment (FIG. 10B) includes a sterilization unit including germicidal light sources disposed as shown in FIG. 8 and Table 1. That is, in the sterilization apparatus of FIG. 10B, respective light exit surfaces of the germicidal light sources face in different directions from one another such that the germicidal light sources emit the germicidal light in different directions from one another. In FIG. 10C, four sterilization apparatuses, identical to the sterilization apparatus of FIG. 8, are disposed in the space to be sterilized. Here, the four sterilization apparatus are disposed in four sections around the center of the space to be sterilized, respectively. Here, one sterilization apparatus is spaced 4 m apart from adjacent sterilization apparatuses. Here, the sterilization units of the sterilization apparatuses of FIG. 10B and FIG. 10C are also located 2 m above the floor. FIG. 10A and FIG. 10B show simulation results for a space having an area of 25 m2 (5 m×5 m (width×length)), and FIG. 10C shows simulation results for a space having an area of 100 m2 (10 m×10 m (width×length)). Here, the sterilization apparatus according to this embodiment, used in the simulations, has a length of about 1.6 m, wherein the length is a distance between opposite horizontal ends thereof. In addition, the simulation results are irradiances measured at the bottom of the space to be sterilized. In FIG. 10A, FIG. 10B, and FIG. 10C, the regions marked in red and green (A1, B1, C1) are regions illuminated with a sufficient amount of the germicidal light for sterilization. That is, A1, B1, and C1 are regions than can be sterilized to a sufficient degree. In FIG. 10A, FIG. 10B, and FIG. 10C, the regions marked in blue are regions illuminated with an insufficient amount of the germicidal light for sterilization. In FIGS. 10A, 10B and 10C, the blue regions are located outside A1, B1, and C1. Referring to FIG. 10A, in the conventional sterilization apparatus, intensity of the germicidal light is high only in a central region of the space to be sterilized and decreases sharply as distance from the central region increases. That is, the graph of FIG. 10A shows that the conventional sterilization apparatus exhibits poor overall illumination uniformity. In this case, most regions, except for the central region close to the germicidal light sources, cannot be properly sterilized. In particular, corner regions are supplied with little or no germicidal light. Referring to FIG. 10B and FIG. 10C, it can be seen that the sterilization apparatus according to this embodiment can deliver a sufficient amount of germicidal light for sterilization over a large area, as compared with the conventional sterilization apparatus. In addition, it can be seen that the sterilization apparatus according to this embodiment provides uniform light distribution, as compared with the conventional sterilization apparatus. Referring to FIG. 10B, in the sterilization apparatus according to this embodiment, a deviation in irradiance across regions of the space to be sterilized is less than 50% of a maximum irradiance. That is, a difference between an average irradiance across the regions of the space to be sterilized and a maximum irradiance is less than 50% of the maximum irradiance. Accordingly, it can be seen that the sterilization apparatus according to this embodiment can ensure uniform irradiance across the regions of the space to be sterilized. In addition, the sterilization apparatus according to this embodiment achieves a uniformity of illumination of 75% or more across the regions of the space to be sterilized. That is, it can be seen that the sterilization apparatus according to this embodiment can ensure uniform illumination over a large area, as compared with the conventional sterilization apparatus. Further, it can be seen that the sterilization apparatus according to this embodiment can illuminate corner regions with the germicidal light at high intensity, as compared with the conventional sterilization apparatus. That is, the results in FIGS. 10A, 10B and 10C show that the sterilization apparatus according to this embodiment can uniformly illuminate a large area with the germicidal light at a high intensity, as compared with the conventional sterilization apparatus. In addition, the sterilization apparatus according to this embodiment can deliver the germicidal light throughout the space to be sterilized, including corner regions, which are supplied with little or no germicidal light by the conventional sterilization apparatus. FIG. 11 is a schematic plan view of a sterilization apparatus according to a fifth embodiment of the present disclosure. Referring to FIG. 11, the sterilization apparatus 500 according to the fifth embodiment includes a pair of first sterilization units 520, a pair of second sterilization units 530, and multiple third sterilization units 550. Although not shown in FIG. 11, the sterilization apparatus 500 may further include a main frame and a moving member. The first sterilization unit 520, the second sterilization unit 530, and the third sterilization unit 550 may have substantially the same structure as the sterilization units according to the above embodiments. In this embodiment, description will be made mainly on differences from the above embodiments in terms of arrangement of germicidal light sources 510 of each sterilization unit. Referring to FIG. 11, the first sterilization unit 520 has a structure in which two germicidal light sources 510 are mounted at opposite ends of a first support member 121, respectively. In addition, the second sterilization unit 530 has a structure in which two germicidal light sources 510 are mounted at opposite ends of the second support member 131, respectively. Although each of the first sterilization unit 520 and the second sterilization unit 530 is shown as including only the two germicidal light sources 510 mounted at the opposite ends of the support member, it will be understood that the present disclosure is not limited thereto and each of the first sterilization unit 520 and the second sterilization unit 530 may further include a germicidal light source 510 mounted at the center of the support member, as shown in FIG. 8. The multiple third sterilization units 550 are mounted on respective connection members 560. Like the first sterilization unit 520 and the second sterilization unit 530, the third sterilization unit 550 has a structure in which two germicidal light sources 510 are mounted at opposite ends of a horizontally elongated support member, respectively. Alternatively, the third sterilization unit 550 may have the same structure as the third sterilization unit of FIG. 8 except that the third sterilization unit 550 is mounted on the connection member 560. The third sterilization unit 550 may be disposed midway between the main frame 110 and the support member to emit the germicidal light to a space between the main frame 110 and the support member. In addition, the germicidal light sources 510 of the third sterilization unit 550 may be disposed between the two germicidal light sources 510 of the first sterilization unit 520 or the second sterilization unit 530. In this way, the third sterilization unit 550 can deliver the germicidal light to a region corresponding to the center of the first sterilization unit 520 or the second sterilization unit 530, which would otherwise be likely to be supplied with a relatively insufficient amount of light, as compared with regions corresponding to the opposite ends of the first sterilization unit 520 or the second sterilization unit 530. The third sterilization unit 550 is mounted on the connection member 560 to be movable along the connection member 560. That is, the third sterilization unit 550 can be moved between the main frame 110 and the support member along the connection member 560 to deliver the germicidal light to a region in short supply of the germicidal light. The germicidal light sources 510 of each of the first sterilization unit 520, the second sterilization unit 530, and the third sterilization unit 550 may be mounted on the support member to face sideways or downwards. Alternatively, the germicidal light sources 510 may be mounted on the support member to face in different directions. In addition, each of the first sterilization unit 520, the second sterilization unit 530, and the third sterilization unit 550 may be adjustable in angle with respect to the vertical direction. Here, each of the sterilization units may be individually adjustable in angle with respect to the vertical direction. In this way, the sterilization apparatus 500 according to this embodiment can uniformly deliver the germicidal light throughout a space to be sterilized through adjustment of the angles of the first sterilization unit 520, the second sterilization unit 530, and the third sterilization unit 550 or movement of the third sterilization unit 550. FIG. 12 and FIG. 13 are exemplary views of a sterilization apparatus according to a sixth embodiment of the present disclosure. The sterilization apparatus 600 according to the sixth embodiment includes a main frame 610, a sterilization unit 620, and a moving member 640. Referring to FIG. 12, the main frame 610 has a cuboidal shape. In addition, the sterilization unit 620 includes multiple sterilization units disposed on the upper surface and four side surfaces of the main frame 610, respectively. The moving member 640 includes a wheel to facilitate movement of the sterilization apparatus 600. In addition, the moving member 640 has an elongated shape and supports the main frame 610 with a space between the main frame 610 and the floor. In this way, the sterilization unit 620 mounted on the main frame 610 can be located at an upper portion of a space to be sterilized rather than at a bottom of the space and thus can deliver the germicidal light over a large area. Although not shown, the sterilization apparatus 600 according to this embodiment may further include a sterilization unit 620 mounted on a lower surface of the main frame 610. Due to the elongated shape of the moving member 640, there can be a large region unreachable by the germicidal light under the main frame 610. The sterilization unit 620 mounted on the lower surface of the main frame 610 can deliver the germicidal light to the region under the main frame 610. The sterilization apparatus 600 according to this embodiment allows adjustment of the number of sterilization units 620 as necessary. Since the main frame 610 of the sterilization apparatus 600 according to this embodiment has a cuboidal shape, rather than an elongated rod-like shape as in the above embodiments, the main frame 610 can secure a large surface area for mounting the sterilization unit 620. Accordingly, as shown in FIG. 13, an additional sterilization unit 620 may be disposed on each surface of the main frame 610, as needed. Although the same number of sterilization units 620 is disposed on each surface of the main frame 610 in FIG. 12 and FIG. 13, it will be understood that the present disclosure is not limited thereto and a different number of sterilization units 620 may be disposed on each surface of the main frame 610, as needed. FIG. 14 is a schematic block diagram of a sterilization apparatus according to a seventh embodiment of the present disclosure. The sterilization apparatus 700 according to the seventh embodiment may further include an input unit 710, a sensor 720, a calculation unit 730, a timer 740, and a controller 750, besides the components of each of the sterilization apparatuses according to the above embodiments. Here, the input unit 710 and the sensor 720 may be disposed outside a body of the sterilization apparatus 700. In addition, the calculation unit 730, the timer 740, and the controller 750 may be disposed inside the body of the sterilization apparatus 700. The sterilization apparatus 700 according to the seventh embodiment may have the same external shape as any of the sterilization apparatuses according to the first to sixth embodiments. For details of a main frame, a moving member, and a sterilization unit 760 of the sterilization apparatus 700 according to the seventh embodiment, description given for the sterilization apparatuses according to the above embodiments can be used. The input unit 710 is adapted to input signals therethrough. The sensor 720 detects an object in a space to be sterilized and measures a distance to the object. The calculation unit 730 calculates conditions under which the sterilization apparatus 700 performs sterilization, such as sterilization time and intensity of the germicidal light, in response to signals from the input unit 710 and the sensor 720. The timer 740 receives information about sterilization time from the input unit 710 or the calculation unit 730 and transmits a signal corresponding to the information to the controller 750. The controller 750 controls operation of the sterilization unit 760 based on signals from at least one of the sensor 720, the calculation unit 730, and the timer 740. Now, each component of the sterilization apparatus 700 according to this embodiment will be described in more detail. The sterilization apparatus 700 may receive an external setting signal via the input unit 710. For example, the setting signal may be a sterilization time signal containing information about sterilization time. That is, a user may input sterilization time to the sterilization apparatus 700 via the input unit 710. For example, the input unit 710 may include any input device that can be used to input information, such as a button or a touchpad. The input unit 710 may transmit the sterilization time signal containing information about the input sterilization time to the calculation unit 730. In addition, the input unit 710 may transmit the sterilization time signal to both the calculation unit 730 and the timer 740. The sensor 720 may include at least one sensor. In this embodiment, the sensor 720 may include a first sensor 721 and a second sensor 722. The first sensor 721 may be a sensor that detects an object within a predetermined range of distances from the sterilization apparatus 700. For example, the first sensor 721 may be an object detection sensor. The first sensor 721 may generate a first sterilization termination signal upon detecting movement of an object in a space to be sterilized. Here, the movement of the object may be movement of a person or an animal. The first sensor 721 may transmit the generated first sterilization termination signal to the controller 750. In addition, the first sensor 721 may transmit a first sterilization start signal to the controller 750 upon detecting that the detected object has left the space to be sterilized. The controller 750 may shut off power supply to the sterilization unit 760 in response to the first sterilization termination signal from the first sensor 721. In addition, the controller 750 may initiate power supply to the sterilization unit 760 in response to the first sterilization start signal from the first sensor 721. As such, the sterilization apparatus 700 according to this embodiment can stop sterilization when a person or an animal enters a space where sterilization is in progress. Accordingly, the sterilization apparatus 700 can prevent a person or an animal from being exposed to the germicidal light. The second sensor 722 may include a distance sensor that measures a distance to a sterilization target. For example, when the sterilization target is a space, the distance sensor may measure distances to walls defining the space. That is, the second sensor 722 may measure the size of a space to be sterilized. The second sensor 722 may generate a sterilization distance signal containing information about the measured distance to the sterilization target. In addition, the second signal may transmit the generated sterilization distance signal to the calculation unit 730. The calculation unit 730 may receive the sterilization time signal from the input unit 710 and may receive the sterilization distance signal from the second sensor 722. The calculation unit 730 may calculate information necessary for sterilization based on the information about the sterilization time and the information about the distance to the sterilization target, which are contained in the respective received signals. FIG. 15 is a graph showing changes in intensity depending on travel distance of the germicidal light. FIG. 16 is a graph showing changes in sterilization time depending on travel distance of the germicidal light. FIG. 17 is a graph showing changes in sterilization time depending on intensity of the germicidal light. Results in FIG. 15 show that intensity of the germicidal light delivered to a sterilization target is inversely proportional to the square of a travel distance of the germicidal light. Results in FIG. 16 show that required sterilization time increases with increasing travel distance of the germicidal light. Results in FIG. 17 show that intensity of the germicidal light incident on a surface of the sterilization target is inversely proportional to sterilization time. Controlled conditions for sterilization of the sterilization target may be represented by Equations 1 to 5: I=α×P0×1/r 2  [Equation 1] From Equation 1, it is possible to obtain the travel distance-dependent light power of germicidal light sources required for sterilization. D=I×T=α×P0×1/r 2 ×T  [Equation 2] From Equation 2, it is possible to know relations between intensity of the germicidal light required for sterilization and travel distance of the germicidal light or sterilization time. T=D×r 2×1/α×1/P0  [Equation 3] From Equation 3, it is possible to obtain the amount of sterilization time depending on travel distance of the germicidal light and intensity of the germicidal light required for sterilization. P0=D×r 2×1/α×1/T  [Equation 4] From Equation 4, it is possible to know relations between travel distance of the germicidal light, sterilization time, intensity of the germicidal light required for sterilization, and light power of the germicidal light sources. r 2 =P0×α×T×1/D=α·P0·T/D  [Equation 5] From Equation 4, it is possible to know relations between light power of the germicidal light sources, sterilization time, intensity of the germicidal light required for sterilization, and travel distance of the germicidal light. In Equations 1 to 5, I is an intensity (unit: mW/cm2) of the germicidal light incident per unit surface area of the sterilization target, P0 is a light power (unit: mW) of the germicidal light sources, T is an amount (unit: sec) of sterilization time, D is a dose (unit: mJ/cm2) of the germicidal light delivered per unit surface area of the sterilization target, r is a distance (unit: cm) to the sterilization target (travel distance), and α is an experimental constant. Here, the experimental constant is a value determined through experiments on relations between the light power (P0) of the germicidal light sources and the intensity (I) of the germicidal light incident on the surface of the sterilization target. The calculation unit 730 may calculate various types of information necessary for sterilization based on information calculated according to Equations 1 to 5. In this embodiment, the calculation unit 730 may calculate an intensity of the germicidal light required to sufficiently sterilize a space to be sterilized based on the information about the distance to the sterilization target, which is received from the second sensor 722. The calculation unit 730 may transmit a sterilization intensity signal containing information about the calculated intensity of the germicidal light to the controller 750. In addition, the calculation unit 730 may transmit the sterilization time signal received from the input unit 710 to the timer 740. The timer 740 may receive the sterilization time signal from the input unit 710 or the calculation unit 730. In addition, the timer 740 may transmit a second sterilization start signal and a second sterilization termination signal to the controller 750 based on the received sterilization time signal. The controller 750 may receive the sterilization intensity signal from the calculation unit 730 and may receive the second sterilization start signal and the second sterilization termination signal from the timer 740. The controller 750 may control the amount of current supplied to the sterilization unit 760 based on the sterilization intensity signal received from the calculation unit 730. That is, the controller 750 may control the intensity of the germicidal light emitted from the sterilization unit 760 through control over the amount of current supplied to the sterilization unit 760. In addition, the controller 750 may initiate power supply to the sterilization unit 760 in response to the second sterilization start signal from the timer 740. Further, the controller 750 may shut off power supply to the sterilization unit 760 in response to the second sterilization termination signal from the timer 740. In this way, the sterilization apparatus 700 according to this embodiment can automatically adjust the intensity of the germicidal light based on the measured distance to the sterilization target to complete sterilization in the input sterilization time. Although the present disclosure has been described with reference to an example in which sterilization time is set via the input unit 710, it will be understood that settings input via the input unit 710 is not limited thereto. In another embodiment, intensity of the germicidal light may be set via the input unit 710. In this embodiment, the calculation unit 730 may calculate sterilization time based on the intensity of the germicidal light set via the input unit 710. The calculation unit 730 may transmit a sterilization time signal containing information about the calculated sterilization time to the timer 740. The timer 740 may transmit the second sterilization start signal and the second sterilization termination signal to the controller 750 based on the sterilization time signal received from the calculation unit 730. The controller 750 may initiate or shut off power supply to the sterilization unit 760 in response to the second sterilization start signal or the second sterilization termination signal received from the timer 740. That is, the controller 750 may control the time the sterilization unit 760 starts or stops operation in response to the second sterilization start signal or the second sterilization termination signal. In addition, the controller 750 may receive information about the intensity of the germicidal light from the input unit 710 or the calculation unit 730. Accordingly, the controller 750 may control operation of the sterilization unit 760 in response to the signals from the timer 740 while controlling the intensity of the germicidal light through control over the amount of current supplied to the sterilization unit 760. In a further embodiment, the sterilization apparatus 700 may automatically calculate sterilization time and may perform sterilization for the calculated sterilization time. The calculation unit 730 may calculate sterilization time based on the information about the distance to the sterilization target, which is received from the second sensor 722. That is, without user input of sterilization time via the input unit 710, the calculation unit 730 can calculate sterilization time required for sterilization based on the distance to the sterilization target and the preset basic intensity of the germicidal light. The calculation unit 730 may generate a sterilization time signal and may transmit the generated sterilization time signal to the timer 740. In this way, the sterilization apparatus 700 according to this embodiment of the present disclosure can perform efficient sterilization through automatic calculation of sterilization time, sterilization intensity, sterilization range, and the like, based on input information. Although the present disclosure has been described with reference to some embodiments in conjunction with the accompanying drawings, it should be understood that these embodiments are provided for illustration only and are not to be construed in any way as limiting the present disclosure. The scope of the present disclosure should be defined by the appended claims and equivalents thereto. 1. A sterilization apparatus comprising: a portable main frame; a sterilization unit coupled to the main frame and comprising: a support member; and multiple germicidal light sources mounted on the support member and emitting germicidal light, the germicidal light being light having a wavelength capable of inactivating microorganisms, wherein two or more light exit surfaces of the multiple germicidal light sources on the support member face in different directions from one another, and the sterilization unit illuminates a sterilization target with the germicidal light at an irradiance greater than a minimum irradiance required for sterilization. 2. The sterilization apparatus according to claim 1, wherein: the sterilization unit further comprises a first sterilization unit and a second sterilization unit each comprising the support member and the multiple germicidal light sources, the first sterilization unit and the second sterilization unit facing in different directions from reach other. 3. The sterilization apparatus according to claim 1, wherein: the sterilization unit further comprises a pair of first sterilization units spaced apart from each other and facing in opposite directions and a pair of second sterilization units spaced apart from each other and facing in opposite directions, the pair of second sterilization units being disposed between the pair of first sterilization units. 4. The sterilization apparatus according to claim 2, wherein the sterilization unit further comprises a third sterilization unit comprising another set of germicidal light sources, the third sterilization unit being disposed between the first sterilization unit and the second sterilization unit. 5. The sterilization apparatus according to claim 2, wherein the sterilization unit further comprises a third sterilization unit comprising another set of germicidal light sources, the third sterilization unit being disposed above or below the first sterilization unit or the second sterilization unit. 6. (canceled) 7. (canceled) 8. The sterilization apparatus according to claim 1, wherein the sterilization unit has an illumination uniformity of 75% or more. 9. A sterilization apparatus comprising: a main frame coupled to a moving mechanism; a sterilization unit comprising multiple germicidal light sources emitting germicidal light, the germicidal light being light having a wavelength capable of inactivating microorganisms; and multiple connection members connecting the main frame to the sterilization unit, wherein the sterilization unit comprises a support member and the multiple germicidal light sources, the multiple germicidal light sources are disposed on the support member such that respective light exit surfaces thereof facing in different directions from one another, and the sterilization apparatus illuminates a sterilization target with the germicidal light at an irradiance greater than a minimum irradiance required for sterilization. 10. (canceled) 11. The sterilization apparatus according to claim 9, wherein the sterilization unit comprises a pair of first sterilization units spaced apart from each other and facing in opposite directions and a pair of second sterilization units spaced apart from each other and facing in opposite directions, the pair of second sterilization units being disposed between the pair of first sterilization units. 12. The sterilization apparatus according to claim 9, wherein the sterilization unit further comprises a third sterilization unit comprising the germicidal light sources and mounted on the connection member or the main frame, the third sterilization unit being disposed between the first sterilization unit and the second sterilization unit. 13. The sterilization apparatus according to claim 9, wherein the sterilization unit further comprises a third sterilization unit comprising the germicidal light sources and mounted on the connection member or the main frame, the third sterilization unit being disposed above or below the first sterilization unit or the second sterilization unit. 14. The sterilization apparatus according to claim 9, wherein respective light exit surfaces of two germicidal light sources disposed at opposite ends of the support member, among the multiple germicidal light sources, face in opposite directions with respect to a central axis of the support member. 15. The sterilization apparatus according to claim 11, wherein the sterilization unit further comprises multiple securing members each having a mounting surface on which the germicidal light source is mounted and a securing portion secured to the support member, at least one mounting surface of the multiple securing members facing in different directions from the rest of mounting surfaces. 16. The sterilization apparatus according to claim 9, further comprising: an object detection sensor detecting movement of an object. 17. The sterilization apparatus according to claim 16, further comprising: a controller controlling the sterilization unit to stop emission of the germicidal light upon detection of an object by the object detection sensor. 18. The sterilization apparatus according to claim 17, further comprising: at least one of a distance sensor measuring a distance to a sterilization target and a timer transmitting a signal for controlling sterilization time to the controller. 19. The sterilization apparatus according to claim 18, further comprising: a calculation unit calculating at least one of intensity of the germicidal light and sterilization time based on at least one of information about the distance to the sterilization target and information about the sterilization time. 20. (canceled) 21. A sterilization apparatus comprising: a portable main frame; a connection member extending from the main frame; one or more germicidal light sources; a first sterilization unit pivotally coupled to the portable main frame via the connection member and delivering germicidal light away from the main frame, the first sterilization unit comprising a first support member and a plurality of first securing members; wherein a first securing member includes a first mounting surface on which a germicidal light source is mounted and a first securing portion is secured to the first support member; the plurality of first securing members is arranged such that at least one of the plurality of first securing members is tilted in a different direction than the rest of the first securing members. 22. The sterilization apparatus according to claim 21, wherein the first securing member has a bent shape such that the first securing portion part surrounds the first support member. 23. The sterilization apparatus according to claim 21, wherein two light exit surfaces of two germicidal light sources disposed at opposite ends of the first support member, face in opposite directions with respect to a central axis of the first support member. 24. The sterilization apparatus according to claim 21, further comprising a second sterilization unit pivotally coupled to the main frame and configured to mount the one or more germicidal light sources at a position that deliver germicidal light into a targeted direction.

2021-06-01

en

2021-12-02

US-201615217321-A

Directional remote control based on ranging ABSTRACT A remote control (RC) has two ultra-wideband tags arranged along the axis of the RC at a known distance “d” from each other. An appliance to be controlled can use a UWB anchor to ping the tags and determine the distance to each tag. The distances are then subtracted and if the difference substantially equals the known distance “d”, this represents an indication that the RC is pointed directly at the appliance, and the appliance accordingly will execute commands from the RC. Otherwise, the appliance ignores the RC commands. FIELD This patent application relates generally to directional remote control of appliances based on ranging. BACKGROUND A single remote control or remote commander (collectively, RC) can be used to control multiple appliances, such as TVs, set-top boxes, disk players, etc. As understood herein, it is sometimes problematic for an appliance to discriminate whether an incoming RC signal is meant for it, or for some other appliance nearby. SUMMARY Accordingly, an apparatus includes at least one computer memory that is not a transitory signal and that in turn includes instructions executable by at least one processor to transmit a wireless interrogation signal to a companion device. The instructions are executable to receive one or more responses to the interrogation signal from the companion device and based on the one or more responses, to determine at least first and second distances. Further, the instructions are executable to determine a difference between the first and second distances, compare the difference to a known distance, and based on the compare, generate one of two binary outputs. In examples, responsive to the compare indicating that the difference equals the known distance, the instructions are executable to output a first binary output. The first binary output may be to execute a command from the RC. In some embodiments, the compare can be determined to indicate that the difference equals the known distance responsive to the difference being within a threshold range of the known distance. In example implementations, responsive to the compare indicating that the difference does not equal the known distance, the instructions are executable to output a second binary output. The second binary output can be to not execute a command from the RC. The compare may be determined to indicate that the difference does not equal the known distance responsive to the difference not being within a threshold range of the known distance. In example embodiments, the known distance is a distance between first and second wireless tags disposed on a remote control (RC). The tags may be UWB tags and if desired the tags can be arranged in a line parallel to a longitudinal axis of the RC. In some implementations, the apparatus is an appliance to be controlled and the companion device is a remote control (RC) configured to send wireless commands to control the appliance. In other implementations, the companion device is an appliance to be controlled and the apparatus is a remote control (RC) configured to send wireless commands to control the appliance. In another aspect, a remote control (RC) has a housing defining a longitudinal axis and at least first and second wireless elements arranged on the housing parallel to the longitudinal axis and configured to respond automatically to wireless pings received from an electronic appliance. In another aspect, an appliance includes at least one processor configured for presenting on a video display demanded images, and at least one computer memory accessible to the at least one processor and including instructions executable for causing a ping to be transmitted to a remote control (RC) that is configured to send wireless commands to the appliance to control the appliance. The instructions are executable for receiving first and second responses to the ping from respective first and second modules on the RC, using the first and second responses to determine first and second distances, and determining a difference between the distances. The instructions are further executable for comparing the difference to a known spacing between the modules of the RC. Responsive to determining that the difference satisfies a test when compared to the known spacing, the instructions are executable for configuring the appliance to execute commands from the RC. In contrast, responsive to determining that the difference does not satisfy the test when compared to the known spacing, the instructions are executable for not configuring the appliance to execute commands from the RC. The details of the present application, both as to its structure and operation, can best be understood in reference to the accompanying drawings, in which like reference numerals refer to like parts, and in which: BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of an example system including an example in accordance with present principles; FIG. 2 is a schematic diagram of an example remote control (RC); and FIG. 3 is a flow chart of example logic according to present principles. DETAILED DESCRIPTION This disclosure relates generally to computer ecosystems including aspects of computer networks that may include consumer electronics (CE) devices. A system herein may include server and client components, connected over a network such that data may be exchanged between the client and server components. The client components may include one or more computing devices including portable televisions (e.g. smart TVs, Internet-enabled TVs), portable computers such as laptops and tablet computers, and other mobile devices including smart phones and additional examples discussed below. These client devices may operate with a variety of operating environments. For example, some of the client computers may employ, as examples, operating systems from Microsoft, or a Unix operating system, or operating systems produced by Apple Computer or Google. These operating environments may be used to execute one or more browsing programs, such as a browser made by Microsoft or Google or Mozilla or other browser program that can access websites hosted by the Internet servers discussed below. Servers and/or gateways may include one or more processors executing instructions that configure the servers to receive and transmit data over a network such as the Internet. Or, a client and server can be connected over a local intranet or a virtual private network. A server or controller may be instantiated by a game console such as a Sony Playstation (trademarked), a personal computer, etc. Information may be exchanged over a network between the clients and servers. To this end and for security, servers and/or clients can include firewalls, load balancers, temporary storages, and proxies, and other network infrastructure for reliability and security. As used herein, instructions refer to computer-implemented steps for processing information in the system. Instructions can be implemented in software, firmware or hardware and include any type of programmed step undertaken by components of the system. A processor may be any conventional general purpose single- or multi-chip processor that can execute logic by means of various lines such as address lines, data lines, and control lines and registers and shift registers. Software modules described by way of the flow charts and user interfaces herein can include various sub-routines, procedures, etc. Without limiting the disclosure, logic stated to be executed by a particular module can be redistributed to other software modules and/or combined together in a single module and/or made available in a shareable library. Present principles described herein can be implemented as hardware, software, firmware, or combinations thereof; hence, illustrative components, blocks, modules, circuits, and steps are set forth in terms of their functionality. Further to what has been alluded to above, logical blocks, modules, and circuits described below can be implemented or performed with a general purpose processor, a digital signal processor (DSP), a field programmable gate array (FPGA) or other programmable logic device such as an application specific integrated circuit (ASIC), discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A processor can be implemented by a controller or state machine or a combination of computing devices. The functions and methods described below, when implemented in software, can be written in an appropriate language such as but not limited to C# or C++, and can be stored on or transmitted through a computer-readable storage medium such as a random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), compact disk read-only memory (CD-ROM) or other optical disk storage such as digital versatile disc (DVD), magnetic disk storage or other magnetic storage devices including removable thumb drives, etc. A connection may establish a computer-readable medium. Such connections can include, as examples, hard-wired cables including fiber optics and coaxial wires and digital subscriber line (DSL) and twisted pair wires. Components included in one embodiment can be used in other embodiments in any appropriate combination. For example, any of the various components described herein and/or depicted in the Figures may be combined, interchanged or excluded from other embodiments. “A system having at least one of A, B, and C” (likewise “a system having at least one of A, B, or C” and “a system having at least one of A, B, C”) includes systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc. Now specifically referring to FIG. 1, an example ecosystem 10 is shown, which may include one or more of the example devices mentioned above and described further below in accordance with present principles. The first of the example devices included in the system 10 is a consumer electronics (CE) device configured as an example primary display device, and in the embodiment shown is an audio video display device (AVDD) 12 such as but not limited to an Internet-enabled TV with a TV tuner (equivalently, set top box controlling a TV). The AVDD 12 may be an Android®-based system. The AVDD 12 alternatively may also be a computerized Internet enabled (“smart”) telephone, a tablet computer, a notebook computer, a wearable computerized device such as e.g. computerized Internet-enabled watch, a computerized Internet-enabled bracelet, other computerized Internet-enabled devices, a computerized Internet-enabled music player, computerized Internet-enabled head phones, a computerized Internet-enabled implantable device such as an implantable skin device, etc. Regardless, it is to be understood that the AVDD 12 and/or other computers described herein is configured to undertake present principles (e.g. communicate with other CE devices to undertake present principles, execute the logic described herein, and perform any other functions and/or operations described herein). Accordingly, to undertake such principles the AVDD 12 can be established by some or all of the components shown in FIG. 1. For example, the AVDD 12 can include one or more displays 14 that may be implemented by a high definition or ultra-high definition “4K” or higher flat screen and that may or may not be touch-enabled for receiving user input signals via touches on the display. Present principles are particularly useful for the circumstance in which the display 14 is not touch-enabled. The AVDD 12 may include one or more speakers 16 for outputting audio in accordance with present principles, and at least one additional input device 18 such as e.g. an audio receiver/microphone for e.g. entering audible commands to the AVDD 12 to control the AVDD 12. The example AVDD 12 may also include one or more network interfaces 20 for communication over at least one network 22 such as the Internet, a WAN, a LAN, a PAN etc. under control of one or more processors 24. Thus, the interface 20 may be, without limitation, a Wi-Fi transceiver, which is an example of a wireless computer network interface, such as but not limited to a mesh network transceiver. The interface 20 may be, without limitation a Bluetooth transceiver, Zigbee transceiver, IrDA transceiver, Wireless USB transceiver, wired USB, wired LAN, Powerline or MoCA. It is to be understood that the processor 24 controls the AVDD 12 to undertake present principles, including the other elements of the AVDD 12 described herein such as e.g. controlling the display 14 to present images thereon and receiving input therefrom. Furthermore, note the network interface 20 may be, e.g., a wired or wireless modem or router, or other appropriate interface such as, e.g., a wireless telephony transceiver, or Wi-Fi transceiver as mentioned above, etc. In addition to the foregoing, the AVDD 12 may also include one or more input ports 26 such as, e.g., a high definition multimedia interface (HDMI) port or a USB port to physically connect (e.g. using a wired connection) to another CE device and/or a headphone port to connect headphones to the AVDD 12 for presentation of audio from the AVDD 12 to a user through the headphones. For example, the input port 26 may be connected via wire or wirelessly to a cable or satellite source 26 a of audio video content. Thus, the source 26 a may be, e.g., a separate or integrated set top box, or a satellite receiver. Or, the source 26 a may be a game console or disk player containing content that might be regarded by a user as a favorite for channel assignation purposes described further below. The AVDD 12 may further include one or more computer memories 28 such as disk-based or solid state storage that are not transitory signals, in some cases embodied in the chassis of the AVDD as standalone devices or as a personal video recording device (PVR) or video disk player either internal or external to the chassis of the AVDD for playing back AV programs or as removable memory media. Also in some embodiments, the AVDD 12 can include a position or location receiver such as but not limited to a cellphone receiver, GPS receiver and/or altimeter 30 that is configured to e.g. receive geographic position information from at least one satellite or cellphone tower and provide the information to the processor 24 and/or determine an altitude at which the AVDD 12 is disposed in conjunction with the processor 24. However, it is to be understood that that another suitable position receiver other than a cellphone receiver, GPS receiver and/or altimeter may be used in accordance with present principles to e.g. determine the location of the AVDD 12 in e.g. all three dimensions. Continuing the description of the AVDD 12, in some embodiments the AVDD 12 may include one or more cameras 32 that may be, e.g., a thermal imaging camera, a digital camera such as a webcam, and/or a camera integrated into the AVDD 12 and controllable by the processor 24 to gather pictures/images and/or video in accordance with present principles. Also included on the AVDD 12 may be a Bluetooth transceiver 34 and other Near Field Communication (NFC) element 36 for communication with other devices using Bluetooth and/or NFC technology, respectively. An example NFC element can be a radio frequency identification (RFID) element. Further still, the AVDD 12 may include one or more auxiliary sensors 37 (e.g., a motion sensor such as an accelerometer, gyroscope, cyclometer, or a magnetic sensor, an infrared (IR) sensor for receiving IR commands from a remote control, an optical sensor, a speed and/or cadence sensor, a gesture sensor (e.g. for sensing gesture command), etc.) providing input to the processor 24. The AVDD 12 may include an over-the-air TV broadcast port 38 for receiving OTA TV broadcasts providing input to the processor 24. In addition to the foregoing, it is noted that the AVDD 12 may also include an infrared (IR) transmitter and/or IR receiver and/or IR transceiver 42 such as an IR data association (IRDA) device. A battery (not shown) may be provided for powering the AVDD 12. Still referring to FIG. 1, in addition to the AVDD 12, the system 10 may include one or more other computer device types that may include some or all of the components shown for the AVDD 12. In one example, a first device 44 and a second device 46 are shown and may include similar components as some or all of the components of the AVDD 12. Fewer or greater devices may be used than shown. In the example shown, to illustrate present principles all three devices 12, 44, 46 are assumed to be members of a local network in, e.g., a dwelling 48, illustrated by dashed lines. The example non-limiting first device 44 may include one or more touch-sensitive surfaces 50 such as a touch-enabled video display for receiving user input signals via touches on the display. The first device 44 may include one or more speakers 52 for outputting audio in accordance with present principles, and at least one additional input device 54 such as e.g. an audio receiver/microphone for e.g. entering audible commands to the first device 44 to control the device 44. The example first device 44 may also include one or more network interfaces 56 for communication over the network 22 under control of one or more vehicle processors 58 such as an engine control module (ECM). Thus, the interface 56 may be, without limitation, a Wi-Fi transceiver, which is an example of a wireless computer network interface, including mesh network interfaces. It is to be understood that the processor 58 controls the first device 44 to undertake present principles, including the other elements of the first device 44 described herein such as e.g. controlling the display 50 to present images thereon and receiving input therefrom. Furthermore, note the network interface 56 may be, e.g., a wired or wireless modem or router, or other appropriate interface such as, e.g., a wireless telephony transceiver, or Wi-Fi transceiver as mentioned above, etc. In addition to the foregoing, the first device 44 may also include one or more input ports 60 such as, e.g., a HDMI port or a USB port to physically connect (e.g. using a wired connection) to another computer device and/or a headphone port to connect headphones to the first device 44 for presentation of audio from the first device 44 to a user through the headphones. The first device 44 may further include one or more tangible computer readable storage medium 62 such as disk-based or solid state storage. Also in some embodiments, the first device 44 can include a position or location receiver such as but not limited to a cellphone and/or GPS receiver and/or altimeter 64 that is configured to e.g. receive geographic position information from at least one satellite and/or cell tower, using triangulation, and provide the information to the device processor 58 and/or determine an altitude at which the first device 44 is disposed in conjunction with the device processor 58. However, it is to be understood that that another suitable position receiver other than a cellphone and/or GPS receiver and/or altimeter may be used in accordance with present principles to e.g. determine the location of the first device 44 in e.g. all three dimensions. Continuing the description of the first device 44, in some embodiments the first device 44 may include one or more cameras 66 that may be, e.g., a thermal imaging camera, a digital camera such as a webcam, etc. Also included on the first device 44 may be a Bluetooth transceiver 68 and other Near Field Communication (NFC) element 70 for communication with other devices using Bluetooth and/or NFC technology, respectively. An example NFC element can be a radio frequency identification (RFID) element. Further still, the first device 44 may include one or more auxiliary sensors 72 (e.g., a motion sensor such as an accelerometer, gyroscope, cyclometer, or a magnetic sensor, an infrared (IR) sensor, an optical sensor, a speed and/or cadence sensor, a gesture sensor (e.g. for sensing gesture command), etc.) providing input to the CE device processor 58. The first device 44 may include still other sensors such as e.g. one or more climate sensors 74 (e.g. barometers, humidity sensors, wind sensors, light sensors, temperature sensors, etc.) and/or one or more biometric sensors 76 providing input to the device processor 58. In addition to the foregoing, it is noted that in some embodiments the first device 44 may also include an infrared (IR) transmitter and/or IR receiver and/or IR transceiver 42 such as an IR data association (IRDA) device. A battery may be provided for powering the first device 44. The device 44 may communicate with the AVDD 12 through any of the above-described communication modes and related components. The second device 46 may include some or all of the components described above. Now in reference to the afore-mentioned at least one server 80, it includes at least one server processor 82, at least one computer memory 84 such as disk-based or solid state storage, and at least one network interface 86 that, under control of the server processor 82, allows for communication with the other devices of FIG. 1 over the network 22, and indeed may facilitate communication between servers, controllers, and client devices in accordance with present principles. Note that the network interface 86 may be, e.g., a wired or wireless modem or router, Wi-Fi transceiver, or other appropriate interface such as, e.g., a wireless telephony transceiver. Accordingly, in some embodiments the server 80 may be an Internet server, and may include and perform “cloud” functions such that the devices of the system 10 may access a “cloud” environment via the server 80 in example embodiments. Or, the server 80 may be implemented by a game console or other computer in the same room as the other devices shown in FIG. 1 or nearby. The TV described below may incorporate some or all of the elements of the AVDD 12 described above. The remote commanders described below may include some or all of the components of the CE device 44 described above in addition to those described below. FIG. 2 shows remote control (RC) 200 that may be shipped with the AVDD 12 and that can include some or all of the components of the CE device 44 in FIG. 1 as well as the components shown in FIG. 2. As shown in FIG. 2, the RC 200 can be used to control multiple appliances (only first and second appliances 202, 204 shown in FIG. 2 for ease of description). The appliances 202, 204 may be any of the appliances discussed herein and may require the same IR codes for control or may require different IR codes for control. For example, the first appliance 202 may be implemented by the AVDD 12 while the second appliance 204 may be implemented by a cable or satellite receiver or Internet receiver or disk player or other source of content. An appliance herein also may be implemented by a gaming controller, a home automation controller that controls indoor lighting, air conditioning, window coverings, door closures, and the like, and the multiple appliances may be multiple commercial displays in a retail outlet in which the RC 200 is used to control a single monitor at a time in a bank of many monitors. In the example shown in FIG. 2, the first appliance 202 is labeled “intended device” because it is the device intended to be controlled by the RC 200, which as shown is pointing straight at the “intended device” (i.e., the longitudinal axis 206 of the RC 200 intersects the intended device 202) as a user holding the RC 200 typically orients the RC 200 to control a device intended to be controlled. In contrast, the second appliance 204 is labeled “unintended device”. Nonetheless, present principles understand that both appliances 202, 204 may pick up the wireless command signal from the RC 200 owing to spreading of the typically IR or other wireless command signal. To ensure that only the “intended device” 202 acts on the command signal from the RC 200 and that the “unintended device” does not, even though both appliances receive the signal, attention is drawn to the remainder of FIG. 2 and subsequent figures. As shown, the RC 200 includes on its housing 207 first and second tags 208, 210 which can be wireless modules and which are spaced from each other by a known distance “d” along or parallel to the longitudinal axis 206 of the RC 200. Each appliance 202, 204 includes a respective “anchor” 212, 214 which is a wireless module configured to wirelessly couple with the tags 208, 210 on the RC 200. In an example, the tags 208, 210 and anchors 212, 214 are ultra-wideband (UWB) devices that may operate according to IEEE 802.15.4, although other ranging technologies may be used. UWB, as understood herein, can measure distances between an anchor 212 and each tag 208, 210 using UWB wireless ranging within an accuracy in the centimeter range. Now referring to FIG. 3 for description of how the hardware in FIG. 2 is used, at block 300 an appliance to be controlled receives a wireless command from the RC 200, typically over IR or RF. Note that in the embodiment of the logic shown in FIG. 3, receipt of the wireless command triggers a ping at block 302 from the appliance's anchor of the tags 208, 210 of the RC 200. In other embodiments, the appliances may ping the tags of the RC 200 periodically, e.g., every few seconds, or on some other ping trigger basis, prior to receiving an RC command. At block 302, the appliance anchor 212/214 pings the tags 208, 210 of the RC 200 to receive back responses from the tags 208, 210. According to the example UWB technique employed or other ranging technique, the processor of the appliance determines the distance to each tag at block 304. Typically, the distance may be calculated as one half the speed of propagation of the ping signal multiplied by the time period between time of ping transmission and time at which the response from the tag was received. If desired, an empirically determined latency period may be subtracted from the time period between ping and response to account for non-simultaneous transmission of ping response by a tag from the time of ping receipt by the tag. Proceeding to block 306, the distance from the anchor of the pinging appliance to the first tag 208 is subtracted from the distance from the anchor of the pinging appliance to the second tag 210. Moving to diamond 308, it is determined by the processor of the pinging appliance whether the difference in distances between the tags as measured in blocks 304 and 306 is the same (within a threshold, if desired, such as half centimeter) as the known distance “d” in FIG. 2, which is made available to the processor of the appliance either at manufacture time or as received from the RC during set up. Responsive to the difference in distances between the tags as measured not equaling the known distance “d” (and, thus, indicating that the RC 200 is not pointed directly at the appliance as is the case shown in FIG. 2 for the “unintended device” 204), the logic moves to block 310 to discard or otherwise ignore the command from the RC received at block 300 without executing the command. On the other hand, responsive to the difference in distances between the tags as measured equaling the known distance “d” (and, thus, indicating that the RC 200 is pointed directly at the appliance as is the case shown in FIG. 2 for the “intended device” 202), the logic moves to block 312 to execute the command from the RC. Note that the status of the RC 200 pointing (or not) at a pinging appliance may be communicated from the appliance back to the RC 200. In this way, both the pinging appliance(s) and the RC 200 know which appliance at which the user is pointing the RC. This is particularly useful in embodiments in which the trigger for block 302 et seq. is not receipt of an RC command at block 300 but rather some other triggering event, because once all components know the identity of the appliance at which the RC is pointed, the RC can send control signals to the intended device via UWB or other medium such as IR or RF. Thus, when the intended and unintended device (202, 204) require different types of remote control codes (or other network based commands), and the appliances convey what type of commands they require to the RC, the RC may send a command using the IR code for the intended device, which may not be recognized by the unintended device. Allowing a user to address a specific device by physically pointing a remote control at it. The remote control will be able to communicate with any device, thus removing the need for multiple remotes. Intuitively control the intended device by pointing at it. Optimally, the anchor 212/214 is placed in the appliance 202/204 to be controlled to minimize the power consumption in the RC. In other embodiments, the RC can include a pinging module at each tag that pings a module on an appliance and determines the distance from the appliance module to each tag to execute the relevant steps in FIG. 3, sharing with the appliances 202, 204 the results of the comparison at diamond 308 so that the appliances know which one is being pointed at by the RC. Furthermore, appliances either before or after the logic of FIG. 3 can identify themselves and their RC command code paradigms to the RC, so that the RC can send the appropriately configured commands to each appliance. To present an example, supposes that the known distance “d” between the tags 208, 210 of the RC 200 in FIG. 2 is thirty centimeters (30 cm). Suppose further that the first appliance 202 measures the distance to the first tag 208 as being 500 cm and to the second tag 210 as being 530 cm. The difference between the measured differences in this case equals=30 cm, which is the same as the known distance “d” between the tags. This would precipitate a positive test result for the first appliance 202 at diamond 308 in FIG. 3. On the other hand, suppose that the second appliance 204 measures the distance from the first tag 208 as being 500 cm and to the second tag 210 as being 515 cm. The difference between the measured distances to the tags is only 15 cm, which is not equal to the known distance “d” between the tags. This would precipitate a negative test result for the second appliance 204 at diamond 308 in FIG. 3. The above methods may be implemented as software instructions executed by a processor, suitably configured application specific integrated circuits (ASIC) or field programmable gate array (FPGA) modules, or any other convenient manner as would be appreciated by those skilled in those art. Where employed, the software instructions may be embodied in a non-transitory device such as a CD ROM or Flash drive. The software code instructions may alternatively be embodied in a transitory arrangement such as a radio or optical signal, or via a download over the internet. It will be appreciated that whilst present principals have been described with reference to some example embodiments, these are not intended to be limiting, and that various alternative arrangements may be used to implement the subject matter claimed herein. What is claimed is: 1. Apparatus comprising: at least one computer memory that is not a transitory signal and that comprises instructions executable by at least one processor to: transmit a wireless interrogation signal to a companion device; receive one or more responses to the interrogation signal from the companion device; based on the one or more responses, determine at least first and second distances; determine a difference between the first and second distances; compare the difference to a known distance; based on the compare, generate one of two binary outputs. 2. The apparatus of claim 1, wherein responsive to the compare indicating that the difference equals the known distance, the instructions are executable to output a first binary output. 3. The apparatus of claim 2, wherein the first binary output is to execute a command from the RC. 4. The apparatus of claim 2, wherein the compare is determined to indicate that the difference equals the known distance responsive to the difference being within a threshold range of the known distance. 5. The apparatus of claim 1, wherein responsive to the compare indicating that the difference does not equal the known distance, the instructions are executable to output a second binary output. 6. The apparatus of claim 5, wherein the second binary output is to not execute a command from the RC. 7. The apparatus of claim 5, wherein the compare is determined to indicate that the difference does not equal the known distance responsive to the difference not being within a threshold range of the known distance. 8. The apparatus of claim 1, wherein the known distance is a distance between first and second wireless tags disposed on a remote control (RC). 9. The apparatus of claim 8, wherein the tags are UWB tags. 10. The apparatus of claim 8, wherein the tags are arranged in a line parallel to a longitudinal axis of the RC. 11. The apparatus of claim 1, wherein the apparatus is an appliance to be controlled and the companion device is a remote control (RC) configured to send wireless commands to control the appliance. 12. The apparatus of claim 1, wherein the companion device is an appliance to be controlled and the apparatus is a remote control (RC) configured to send wireless commands to control the appliance. 13. A remote control (RC) comprising: a housing defining a longitudinal axis; and at least first and second wireless elements arranged on the housing parallel to the longitudinal axis and configured to respond automatically to wireless pings received from an electronic appliance. 14. The RC of claim 13, wherein the wireless elements are ultra-wideband (UWB) elements. 15. An appliance comprising: at least one processor configured for presenting on a video display demanded images; and at least one computer memory accessible to the at least one processor and including instructions executable for: causing a ping to be transmitted to a remote control (RC) configured to send wireless commands to the appliance to control the appliance; receiving first and second responses to the ping from respective first and second modules on the RC; using the first and second responses to determine first and second distances; determining a difference between the distances; comparing the difference to a known spacing between the modules of the RC; responsive to determining that the difference satisfies a test when compared to the known spacing, configuring the appliance to execute commands from the RC; and responsive to determining that the difference does not satisfy the test when compared to the known spacing, not configuring the appliance to execute commands from the RC. 16. The appliance of claim 15, wherein the appliance is established by a display device. 17. The appliance of claim 15, wherein the appliance is established by a source of video content. 18. The appliance of claim 15, wherein the first and second modules are ultra-wideband (UWB) modules. 19. The appliance of claim 15, comprising an ultra-wideband (UWB) anchor on the appliance for transmitting the ping. 20. The appliance of claim 15, wherein the test is satisfied responsive to the difference being within a threshold amount of the known spacing.

2016-07-22

en

2018-01-25

US-201715662459-A

Method and system for trailer tracking and inventory management ABSTRACT A method at a computing device for calculating a distance travelled, the method including receiving a plurality of discrete position fixes; determining a first distance travelled over the plurality of discrete position fixes by using a first calculation technique between successive discrete position fixes; determining a second distance travelled over the plurality of discrete position fixes by using a second calculation technique between successive discrete position fixes; applying a first weight to the first distance travelled and a second weight to the second distance travelled; and determining the distance travelled using a weighted average of the first distance travelled and the second distance travelled. FIELD OF THE DISCLOSURE The present disclosure relates to mileage and inventory management of trailers in the transport industry. BACKGROUND In the transport industry, generally, the safety and maintenance of the trailer is the responsibility of the owner of the trailer, and fines and damages related to the improperly maintained trailers can be high. Trailers may be used by their owners, or may be shared with or leased to others. Sharing or leasing may be done for a variety of reasons, such as to help companies deal with seasonal changes in product volume. For example, a department store may need many trailers at Christmas but very few in the spring. A garden supply store may, conversely, need many trailers in the spring, but very few in the winter. In general, agreements are reached between the owners of the trailer and those leasing or sharing such trailers. Such agreements typically provide for conditions on how far the trailer may travel, and provide for guidelines with regard to the maintenance of the trailer. However, it is difficult to monitor these conditions or guidelines. In particular, it may be difficult to monitor accurately the distance that a trailer has travelled. Further, it may be difficult to ensure that any maintenance that was done by the party leasing or sharing the trailer was done properly and with proper parts. Further, even when operated by the owner, accurate tracking of parts and mileage for a trailer may be useful to ensure that a proper maintenance schedule is maintained for the trailer itself. BRIEF DESCRIPTION OF THE DRAWINGS The present disclosure will be better understood with reference to the drawings, in which: FIG. 1 is a block diagram of an example sensor apparatus for use with the embodiments of the present disclosure; FIG. 2 is a block diagram showing an example environment for a sensor apparatus in accordance with the embodiments of the present disclosure; FIG. 3 is a process diagram showing a process for calculating a distance based on a straight-line calculation; FIG. 4 is a process diagram showing a process for calculating a distance based on a road based routing calculation; FIG. 5 is a process diagram showing a process for calculating a distance based on a road based matrix calculation; FIG. 6 is a process diagram showing a process for calculating a distance based on a bias confirmation calculation; FIG. 7 a process diagram showing the combination of calculated distances with a bias factor to calculate distance; FIG. 8 a block diagram showing a sensor apparatus communicating with parts on a trailer; FIG. 9 is a block diagram of a central controller storing trailer parts information and maintenance information; and FIG. 10 is a block diagram of an example simplified computing device that may be used with the embodiments of the present disclosure. DETAILED DESCRIPTION OF THE DRAWINGS The present disclosure provides a method at a computing device for calculating a distance travelled, the method comprising: receiving a plurality of discrete position fixes; determining a first distance travelled over the plurality of discrete position fixes by using a first calculation technique between successive discrete position fixes; determining a second distance travelled over the plurality of discrete position fixes by using a second calculation technique between successive discrete position fixes; applying a first weight to the first distance travelled and a second weight to the second distance travelled; and determining the distance travelled using a weighted average of the first distance travelled and the second distance travelled. The present disclosure further provides a computing device for calculating a distance travelled, the computing device comprising: a processor; and a communications subsystem, wherein the computing device is configured to: receive a plurality of discrete position fixes; determine a first distance travelled over the plurality of discrete position fixes by using a first calculation technique between successive discrete position fixes; determine a second distance travelled over the plurality of discrete position fixes by using a second calculation technique between successive discrete position fixes; apply a first weight to the first distance travelled and a second weight to the second distance travelled; and determine the distance travelled using a weighted average of the first distance travelled and the second distance travelled. The present disclosure further provides a computer readable medium for storing instruction code, which, when executed by a processor of a computing device, cause the computing device to: receive a plurality of discrete position fixes; determine a first distance travelled over the plurality of discrete position fixes by using a first calculation technique between successive discrete position fixes; determine a second distance travelled over the plurality of discrete position fixes by using a second calculation technique between successive discrete position fixes; apply a first weight to the first distance travelled and a second weight to the second distance travelled; and determine the distance travelled using a weighted average of the first distance travelled and the second distance travelled. In the embodiments described below, methods and systems are provided to track, control, and manage trailer maintenance. In particular, in accordance with the first aspect of the present disclosure, the system provides for mileage tracking for a trailer utilizing sporadic or periodic position fixes. Currently, many trailer leasing companies use a product called a hubometer to track the number of miles a trailer has travelled. A hubometer is a device mounted on an axle of the trailer which counts the number of rotations of the axle and can be used to determine a distance from this reading. However, hubometers are expensive, break routinely and can be inaccurate. The use of a hubometer or a trailer odometer for finding distance also relies on human operators. Specifically, the hubometer or odometer must be read by a human and in the case of rentals, the human reading the odometer or hubometer may give inaccurate, untruthful or non-timely results. Thus, in accordance with the present disclosure, a trailer tracking system may be utilized to provide a mileage tracking application in accordance with the disclosure below. In a further aspect of the present disclosure, a parts inventory may be maintained for the main wearable parts of the trailer platform. Specifically, any part which may wear out and thus need replacement may be tracked through a reporting system. Data about such parts can be attained in a few ways. First, the data may come from a wired bus such as a Control Area Network Bus (CanBUS) of the trailer. The CanBUS may report control units installed on the trailer and may report changes to those control units. A control unit change may mean that a part has been swapped out. For example, if a brake controller is attached to the CanBUS, it can report a unique identity. If the brake controller is replaced, then the reported identity will be different. In other embodiments, data may come from sensors such as a tire pressure monitoring systems or tire wear sensors or brake wear sensors or strain gauges or air pressure systems. This data may be reported from the sensors utilizing a short-range communication technology, including both wired or wireless technologies such as Bluetooth™, ZigBee, near field communications (NFC), radio frequency identifier (RFID), Ethernet, or other similar techniques. In some cases, the sensors may use other technologies such as cellular or Wi-Fi. Detection of a change based on these sensors may be done in various ways. In one embodiment, if a trailer has 16 wheels with tire pressure monitoring sensors (TPMS) installed, it may expect those sensors to report in periodically. If one or more of the TPMS sensors fails to report in, the sensor may be dead or the wheel may have been inappropriately changed. Thus reports from unknown sensors or control units, or failure to report from known sensors may be used to determine that inventory changes have been made to the trailer. In a further aspect of the present disclosure, tracking of maintenance and scheduled maintenance may also be enhanced utilizing the systems and embodiments described herein. One example of a sensor apparatus is provided below. In vehicle operations, sensor systems may be included on the vehicle and include a plurality of sensor apparatuses operating remotely from a central monitoring station to provide remote sensor data to a management or monitoring hub. For example, one sensor system involves fleet management or cargo management systems. In fleet management or cargo management systems, sensors may be placed on a trailer, shipping container or similar product to provide a central station with information regarding the container. Such information may include, but is not limited to, information concerning the current location of the trailer or shipping container, the temperature inside the shipping container or trailer, or that the doors on the shipping container or trailer are closed, whether a sudden acceleration or deceleration event has occurred, the tilt angle of the trailer or shipping container, among other data. In other embodiments the sensor apparatus may be secured to a vehicle itself. As used herein, the term vehicle can include any motorized vehicle such as a truck, tractor, car, boat, motorcycle, snow machine, among others, and can further include a trailer, shipping container or other such cargo moving container, whether attached to a motorized vehicle or not. In accordance with the embodiments described herein, a sensor apparatus may be any apparatus that is capable of providing data or information from sensors associated with the sensor apparatus to a central monitoring or control station. Sensors associated with the sensor apparatus may either be physically part of the sensor apparatus, for example a built-in global positioning system (GPS) chipset, or may be associated with the sensor apparatus through short range wired or wireless communications. For example, a tire pressure monitor may provide information through a Bluetooth™ Low Energy (BLE) signal from the tire to the sensor apparatus. In other cases, a camera may be part of the sensor apparatus or may communicate with a sensor apparatus through wired or wireless technologies. Other examples of sensors are possible. A central monitoring station may be any server or combination of servers that are remote from the sensor apparatus. The central monitoring station can receive data from a plurality of sensor apparatuses, and in some cases may have software to monitor such data and provide alerts to operators if data is outside of the predetermined boundaries. One sensor apparatus is shown with regard to FIG. 1. The sensor apparatus of FIG. 1 is however merely an example and other sensor apparatuses could equally be used in accordance with the embodiments of the present disclosure. Reference is now made to FIG. 1, which shows an example sensor apparatus 110. Sensor apparatus 110 can be any computing device or network node. Such computing device or network node may include any type of electronic device, including but not limited to, mobile devices such as smartphones or cellular telephones. Examples can further include fixed or mobile devices, such as internet of things devices, endpoints, home automation devices, medical equipment in hospital or home environments, inventory tracking devices, environmental monitoring devices, energy management devices, infrastructure management devices, vehicles or devices for vehicles, fixed electronic devices, among others. Sensor apparatus 110 comprises a processor 120 and at least one communications subsystem 130, where the processor 120 and communications subsystem 130 cooperate to perform the methods of the embodiments described herein. Communications subsystem 130 may, in some embodiments, comprise multiple subsystems, for example for different radio technologies. Communications subsystem 130 allows sensor apparatus 110 to communicate with other devices or network elements. Communications subsystem 130 may use one or more of a variety of communications types, including but not limited to cellular, satellite, Bluetooth™, Bluetooth™ Low Energy, Wi-Fi, wireless local area network (WLAN), near field communications (NFC), ZigBee, wired connections such as Ethernet or fiber, among other options. As such, a communications subsystem 130 for wireless communications will typically have one or more receivers and transmitters, as well as associated components such as one or more antenna elements, local oscillators (LOs), and may include a processing module such as a digital signal processor (DSP). As will be apparent to those skilled in the field of communications, the particular design of the communication subsystem 130 will be dependent upon the communication network or communication technology on which the sensor apparatus is intended to operate. Processor 120 generally controls the overall operation of the sensor apparatus 110 and is configured to execute programmable logic, which may be stored, along with data, using memory 140. Memory 140 can be any tangible, non-transitory computer readable storage medium, including but not limited to optical (e.g., CD, DVD, etc.), magnetic (e.g., tape), flash drive, hard drive, or other memory known in the art. Alternatively, or in addition to memory 140, sensor apparatus 110 may access data or programmable logic from an external storage medium, for example through communications subsystem 130. In the embodiment of FIG. 1, sensor apparatus 110 may utilize a plurality of sensors, which may either be part of sensor apparatus 110 in some embodiments or may communicate with sensor apparatus 110 in other embodiments. For internal sensors, processor 120 may receive input from a sensor subsystem 150. Examples of sensors in the embodiment of FIG. 1 include a positioning sensor 151, a vibration sensor 152, a temperature sensor 153, one or more image sensors 154, accelerometer 155, light sensors 156, gyroscopic sensors 157, and other sensors 158. Other sensors may be any sensor that is capable of reading or obtaining data that may be useful for sensor apparatus 110. However, the sensors shown in the embodiment of FIG. 1 are merely examples, and in other embodiments different sensors or a subset of sensors shown in FIG. 1 may be used. Communications between the various elements of sensor apparatus 110 may be through an internal bus 160 in one embodiment. However, other forms of communication are possible. Sensor apparatus 110 may be affixed to any fixed or portable platform. For example, sensor apparatus 110 may be affixed to shipping containers, truck trailers, truck cabs in one embodiment. In other embodiments, sensor apparatus 110 may be affixed to any vehicle, including motor vehicles (e.g., automobiles, cars, trucks, buses, motorcycles, etc.), aircraft (e.g., airplanes, unmanned aerial vehicles, unmanned aircraft systems, drones, helicopters, etc.), spacecraft (e.g., spaceplanes, space shuttles, space capsules, space stations, satellites, etc.), watercraft (e.g., ships, boats, hovercraft, submarines, etc.), railed vehicles (e.g., trains and trams, etc.), and other types of vehicles including any combinations of any of the foregoing, whether currently existing or after arising, among others. In other cases, sensor apparatus 110 could be carried by a user. In other cases, sensor apparatus 110 may be affixed to stationary objects including buildings, lamp posts, fences, cranes, among other options. Such sensor apparatus 110 may be a power limited device. For example sensor apparatus 110 could be a battery operated device that can be affixed to a shipping container or trailer in some embodiments. Other limited power sources could include any limited power supply, such as a small generator or dynamo, a fuel cell, solar power, among other options. In other embodiments, sensor apparatus 110 may utilize external power, for example from the engine of a tractor pulling the trailer, from a land power source for example on a plugged in recreational vehicle or from a building power supply, among other options. External power may further allow for recharging of batteries to allow the sensor apparatus 110 to then operate in a power limited mode again. Recharging methods may also include other power sources, such as, but not limited to, solar, electromagnetic, acoustic or vibration charging. The sensor apparatus from FIG. 1 may be used in a variety of environments. One example environment in which the sensor apparatus may be used is shown with regard to FIG. 2. Referring to FIG. 2, three sensor apparatuses, namely sensor apparatus 210, sensor apparatus 212, and sensor apparatus 214 are provided. In the example of FIG. 2, sensor apparatus 210 may communicate through a cellular base station 220 or through an access point 222. Access point 222 may be any wireless communication access point. Further, in some embodiments, sensor apparatus 210 could communicate through a wired access point such as Ethernet or fiber, among other options. The communication may then proceed over a wide area network such as Internet 230 and proceed to servers 240 or 242. Similarly, sensor apparatus 212 and sensor apparatus 214 may communicate with servers 240 or server 242 through one or both of the base station 220 or access point 222, among other options for such communication. In other embodiments, any one of sensors 210, 212 or 214 may communicate through satellite communication technology. This, for example, may be useful if the sensor apparatus is travelling to areas that are outside of cellular coverage or access point coverage. In other embodiments, sensor apparatus 212 may be out of range of access point 222, and may communicate with sensor apparatus 210 to allow sensor apparatus 210 to act as a relay for communications. Communication between sensor apparatus 210 and server 240 may be one directional or bidirectional. Thus, in one embodiment sensor apparatus 210 may provide information to server 240 but server 240 does not respond. In other cases, server 240 may issue commands to sensor apparatus 210 but data may be stored internally on sensor apparatus 210 until the sensor apparatus arrives at a particular location. In other cases, two-way communication may exist between sensor apparatus 210 and server 240. A server, central server, processing service, endpoint, Uniform Resource Identifier (URI), Uniform Resource Locator (URL), back-end, and/or processing system may be used interchangeably in the descriptions herein. The server functionality typically represents data processing/reporting that are not closely tied to the location of movable image capture apparatuses 210, 212, 214, etc. For example, the server may be located essentially anywhere so long as it has network access to communicate with image capture apparatuses 210, 212, 214, etc. Server 240 may, for example, be a fleet management centralized monitoring station. In this case, server 240 may receive information from sensor apparatuses associated with various trailers or cargo containers, providing information such as the location of such cargo containers, the temperature within such cargo containers, any unusual events including sudden decelerations, temperature warnings when the temperature is either too high or too low, among other data. The server 240 may compile such information and store it for future reference. It may further alert an operator. For example, a sudden deceleration event may indicate that a trailer may have been in an accident and the operator may need to call emergency services and potentially dispatch another tractor to the location. In other embodiments, server 240 may be a trailer tracking and maintenance server which is used to determine how far a trailer has traveled and whether any parts of the trailer need to be maintained. Other examples of functionality for server 240 are possible. In the embodiment of FIG. 2, servers 240 and 242 may further have access to third-party information or information from other servers within the network. For example, a data services provider 250 may provide information to server 240. Similarly, a data repository or database 260 may also provide information to server 240. For example, data services provider 250 may be a subscription based service used by server 240 to obtain current road and weather conditions. Data repository or database 260 may for example provide information such as image data associated with a particular location, aerial maps, detailed street maps, or other such information. The types of information provided by data service provider 250 or the data repository or database 260 is not limited to the above examples and the information provided could be any data useful to server 240. In some embodiments, information from data service provider 250 or the data repository from database 260 can be provided to one or more of sensor apparatuses 210, 212, or 214 for processing at those sensor apparatuses. A sensor apparatus such as that described in FIGS. 1 and 2 above may be used mileage tracking in a first aspect of the present disclosure, and for inventory and parts maintenance in other aspects of the present disclosure. Specifically, utilizing a sensor apparatus such as that described with regard to FIGS. 1 and 2 above, a position sensor may be used to determine a location of the trailer. However, since the sensor apparatus may be a power limited device, the position sensor may only be used periodically or at discrete time intervals, as opposed to continuously to conserve battery power. As such, position fixes may be only periodically available. For example, in some cases a position fix is only taken every five minutes. In other cases, a position fix may be taken only every 15 minutes. Other examples are possible. Furthermore, the positioning system may not be completely accurate. Specifically, in many cases, a global positioning system fix may only be accurate to within one, ten or even one hundred meters, depending on the quality of the fix. Furthermore, a position fix may not be obtainable in every circumstance. For example, in a dense urban area a global positioning system (GPS) receiver may be unable to lock onto one or more satellites in the window provided for obtaining the position fix. Thus, even if the position fix is attempted every five minutes, in some instances the position may be unobtainable in some of the periods. Based on the above circumstances, maintaining the mileage of a trailer using such positioning system may be difficult. In accordance with the embodiments described below, a plurality of techniques may be used to determine the distance based on periodic or discrete position fixes. Further, the plurality of techniques may then be combined to find a distance travelled with generally higher accuracy. Four measurement techniques are described below. These include a straight-line technique, a road based routing technique, a road based matrix technique, and a bias confirmation technique. Straight-Line Technique Using a straight-line technique, a shortest distance between successive GPS fixes can be determined. Thus, the straight-line technique produces a minimum distance that the trailer could have travelled. In particular, reference is now made to FIG. 3, which shows a process for obtaining a straight-line measurement. The process of FIG. 3 starts at block 310 and proceeds to block 312 in which a position fix is taken. As will be appreciated by those in the art, the position fix may be taken periodically or at discrete intervals, and may not be continuously taken. For example, as described above, the position fix may be taken every five minutes. Once the position fix is taken at block 312, the process proceeds to block 314 in which a check is made to determine whether or not the fix was successful. For example, if a GPS receiver on the sensor apparatus was unable to lock to a satellite during this reading cycle, the position fix may be unsuccessful. In this case, the process proceeds back to block 312 in which a further position fix may be taken. The further position fix may, for example, be taken at the next scheduled time for taking such a position fix in order to avoid a battery drain on the sensor apparatus. From block 314, if the position fix was successfully taken, the process proceeds to block 320 in which a calculation is made to determine the straight-line distance from the last successful position fix to the current successful position fix. In one embodiment, the calculation may utilize the haversine formula to calculate the distance between two points on a spherical surface. In other cases, the spherical law of cosines formula may be utilized to calculate the straight-line distance. In other cases, the Vincenty formula may also be used for calculating the straight-line distance. In other cases, an approximation using Pythagoras' theorem on an equirectangular projection or a polar coordinate flat-earth formula may be used. Other similar formulas could also be used. From block 320 the process proceeds to block 330, in which the straight-line distance is added to the total distance being measured. Such total distance may be the distance driven for a particular trip, for a particular day, for a trailer in general, among other options. From block 330 the process proceeds to block 340 and ends. While the embodiment of FIG. 3 shows a calculation on the fly, in other cases the successful position fixes may simply be stored and a straight-line calculation may be performed at a future time on the points. This may, for example, be done on a server to which the position fixes are uploaded. As such, the method of FIG. 3 can utilize a series of points to calculate the straight-line distance between such points in order to determine the distance travelled by the trailer. Road Based Routing Technique In a further distance measurement technique, road based routing may be utilized to determine the distance between successive position fixes. In road based routing, the position fixes are snapped to a road map by determining the most likely route between the two points on such map. Reference is now made to FIG. 4. The process of FIG. 4 starts at block 410 and proceeds to block 412 in which a position fix is taken. The process then proceeds to block 414 in which a check is made to determine whether the position fix was successful. Such check may be similar to the check made at block 314 in FIG. 3 above. If the position fix is not successful, the process proceeds back to block 412. Otherwise the process proceeds to block 420. At block 420, the distance between the last successful position fix and the current position fix is found utilizing road based routing. In particular, either based on the data accumulated by the company itself or utilizing a third-party data such as a mapping database or application, a computing determination may be made to find the most likely route taken between the two points. For example, the most likely route may utilize major roads rather than side roads when possible. In some cases, the route may estimate that the easiest path between the two points was a used, and therefore use a route that minimizes that the number of turns. In other cases, more complex algorithms may be used to find the likely route. Utilizing such road based routing, the route could be snapped to one or more roads between the last two points and the distance between those two points could be found utilizing the map data. From block 420 the process proceeds to block 430, in which the road based routing distance is added to the total distance being measured. Such total distance may be the distance driven for a particular trip, for a particular day, for a trailer in general, among other options. From block 430 the process proceeds to block 440 and ends. Again, while the embodiment of FIG. 4 shows a calculation on the fly, in other cases the successful position fixes may simply be stored and a road based routing calculation may be performed at a future time on the points. This may, for example, be done on a server to which the position fixes are uploaded. As such, the method of FIG. 4 can utilize a series of points to calculate the road based routing distance between such points in order to determine the distance travelled by the trailer. Road Based Matrix Technique In a further distance measurement mechanism, a road based matrix may be utilized. This technique utilizes a plurality of position fixes to map the route between a start and an end point for the trailer. By utilizing a matrix of points, a more accurate picture of the route may be determined. For example, bad position fixes that are erroneous can be found and filtered out. Thus, reference is now made to FIG. 5. The process of FIG. 5 starts at block 510 and proceeds to block 512 in which a position fix is taken. The process then proceeds to block 514 in which the position fix is stored. The process then proceeds to block 520 in which a check is made to determine whether a condition for calculation has been met. For example, the matrix based routing may only be activated when a certain time threshold has elapsed. For example, the road based matrix may only be activated every six hours. In other cases, the calculation condition may be a number of position fixes. Thus, the number of stored position fixes at block 514 may need to exceed a threshold at block 520. In other embodiments, the condition may be based on whether or not the trailer is moving. For example, if the trailer is stopped for a predetermined time, then it may indicate that the trailer has reached a final destination and road based matrix calculations may be made. In other embodiments, the condition may be based on communication with a server to upload position fixes. Other examples of conditions at block 520 would be evident to those skilled in the art. From block 520, if the condition has not been met and the process proceeds back to block 512 in which position fixes continue to be taken. For example, the position fix may be taken every five minutes as described above. Once the condition at block 520 is met the process proceeds to block 530 in which a most likely route between a start and an end point is found. This may be done by snapping the position points to major roads or other secondary roads on the path. Likelihood metrics for the path can be used to find the most likely path. Erroneous position fixes may be filtered out in some cases. In this way, a likely route is found between and started in points. The process then proceeds to block 540 in which the distance between the start and end points along the route calculated at block 530 is found. From block 540 the process proceeds to block 550 and ends. Bias Confirmation Technique In a further technique, secondary sources may be added to GPS fixes to provide for increased accuracy. In one case, a secondary source may be a mobile device carried by a driver pulling the trailer. In another case the secondary source may be an in-cab GPS unit that is connected to the truck's power system and therefore can continually update its GPS positioning. In other cases, confirmatory sensors such as odometer readings from the truck cab among other such information may also be used. Reference is now made to FIG. 6, in which the process starts at block 610. The process then proceeds to block 612 in which a position fix is taken. From block 612 the process then proceeds to block 614 in which a successful position fix is stored. From block 614 the process proceeds to block 620 in which a determination is made on whether supplementary sources should be compared to the position data. The check at block 620 may, for example, determine if enough position fixes are stored to make the comparison worthwhile. The check may also determine whether bad position fixes have occurred recently. Other options are however possible. If the check determines that supplementary sources should not be used, the process proceeds back to block 612 in which further position fixes are taken and stored. From block 620, if supplementary sources should be used, the process proceeds to block 630 in which a distance from the stored position fixes is calculated. The calculation at block 630 may use any of the embodiments of FIG. 3, 4, or 5 above, for example. From block 630 the process proceeds to block 640 in which the calculated distance is compared with the distance calculated using one or more secondary sources. For example, a mobile device or tractor may be queried through a wired or wireless technologies to determine the distance calculated by these devices, for example using positioning technologies on those devices. Similarly, the odometer may be part of the calculation and may be queried by the sensor apparatus. Other options are possible. From block 640 the process proceeds to block 650 in which the distance may be adjusted up or down, or a delta between the calculated distance and the secondary source may stored for future processing. The process then proceeds to block 660 and ends. Combining Techniques The above the techniques for finding the distance travelled by a trailer may, in some embodiments, be combined to provide a more accurate distance travelled by the trailer. For example, two or more of the techniques described with regard to FIGS. 3 to 6 may be combined to provide a better distance measurements. Specifically, for long distance travel, the road based and road matrix techniques of FIG. 4 or 5 may be highly accurate and therefore a calculation for trailer distance can bias such values heavily. Conversely, in cities or heavy traffic situations, the straight line distance and bias confirmation may be more accurate due to position finding inaccuracy, and in this case the straight line or the bias confirmation techniques could be weighed more heavily. In still further embodiments, the route may be broken based on urban versus highway driving and the threshold speed of the movement and the different parts of the route may be biased differently using the different techniques above. For example, on a trip, a truck is pulling a trailer from a facility in one city to a facility in another city. During the trip the trailer is caught in a traffic jam due to road construction. In this case, the trip may be broken into segments as shown in Table 1 below: TABLE 1 Segments Of Trip Segment Description Segment 1 Trailer departs facility, proceeds through urban area, until trailer enters highway Segment 2 Trailer enters highway until trailer encounters traffic jam and speed drops below threshold Segment 3 During traffic jam when speed remains under a threshold Segment 3 Speed increases over threshold after traffic jam until trailer leaves highway Segment 4 Trailer leaves highway until trailer reaches facility In accordance with Table 1 above, a trip is shown with five segments. The example of Table 1 is merely provided for illustration, and a real-world trip could be broken into many segments. The different segments may be based on speed thresholds, geographic locations, among other options. In one example, the different segments may be biased individually. Therefore, if two measurement techniques are being used, a straight-line technique and a road based routing technique, each might be assigned a weight. For example, each segment may be calculated using Equation 1 below: Where A and B are biasing or weighting values and Straight-linesegment refers to the straight-line distance calculated for the segment and Road-basedsegment refers to the distance calculated for the segment using the road based routing technique. Using equation 1 above, the values of A and B can be varied based on factors such as speed or location. Thus, in segment 1 from Table 1 above, the slow speed and urban environment may favor a straight-line technique, and based on this, the value of A is set higher than the value of B. Similarly, in segment 2, the road based routing technique may be favorable and therefore the value of B might be set higher than the value of A. Further, in segment 3 where the speed is very low, the straight line technique can be significantly favored, and in this case the value of A might be much higher than B, and may be different from the values used in segment 1. Other options are possible. Thus using equation 1 and the different bias values for each segment, the accuracy of the distance tracking can be improved. If all four techniques were used, equation 1 can be modified to have bias values for each technique. Thus equation 2 could be used: Similarly, if only 3 of the techniques were used, then the three values could be biased for each segment. Equations 1 and 2 above are only examples of how the distances could be combined and weighted to produce a distance measurement. Other formulas could equally be used having regard to the embodiments described herein. The above is illustrated in FIG. 7. The process of FIG. 7 starts at block 710 and proceeds block 712 in which a bias is applied to the distance measurement found using the various techniques. The bias may be applied to the measurements for the entire route or to segments of the total route, depending on the categorization of the segment. Once the biases are applied the process proceeds to block 720 in which the distance is calculated utilizing the biased values. For example, a weighted average may be provided between the various calculation techniques to provide the final distance travelled. From block 720 the process proceeds to block 730 and ends. Therefore, utilizing the above techniques, a distance measurement with a higher likely accuracy may be found utilizing periodic or discrete position readings. The calculation of the distances and each of the techniques could be performed at either or both of the sensor apparatus or on a network server. For example, the sensor apparatus may periodically report to the network server its current location. This may be one or multiple position fixes. The network server may therefore know the position fixes and apply the techniques of FIGS. 3 to 7 to obtain the distance travelled. In other embodiments the data may be stored on the sensor apparatus until the sensor apparatus reaches a predetermined location, at which point it can provide all of the position fixes to the network server. In other cases, mapping information may be stored on the sensor apparatus and the calculations may be performed on the sensor apparatus itself. In still other cases, the sensor apparatus may access, through its communications subsystem, external resources such as mapping resources, and do the calculations on the sensor apparatus itself. Further, in some cases some of the calculations can be performed on the sensor apparatus and others of the calculations can be performed on the network server. Based on the above, trailer distance can be tracked. Parts Inventory In accordance with a further embodiment of the present disclosure, a maintenance tracking program has awareness and control of updates for the main wearable parts of the platform. Such awareness allows for inventory control. Parts data can be obtained in several ways. As provided above, the data may come from the CanBus or other bus on the trailer, or may be communicated with the sensor apparatus through wired or wireless techniques, among other options. Thus, in accordance with one embodiment the present disclosure, the sensor apparatus may know keys for authenticating the various components on the trailer. Reference is now made to FIG. 8. In the embodiment of FIG. 8, sensor apparatus 810 includes a key store 812 which may store the keys for each of the components that sensor apparatus communicates with. For example, the key for the brake controller may be known at sensor apparatus 810. Therefore, if communications are received from the brake controller, such communications may be signed by the brake controller and the sensor apparatus 810 may therefore utilize key store 812 to verify the identity of the brake controller. Conversely, if a communication arrives from a brake controller that is either not signed or signed by a key that is different than the key stored at sensor apparatus 810, the sensor apparatus 810 may know that the brake controller has been replaced and report such information to a central monitoring station. In other embodiments, replacement parts may not respond to queries by the sensor apparatus. For example, the sensor apparatus 810 may be expecting data from a tire pressure monitoring system in each tire. The TPMS 830 may, for example, provide periodic reports to sensor apparatus 810. Sensor apparatus 810 may expect such reports and if the TPMS 830 fails to send a report for a particular number of cycles, then the sensor apparatus 810 may assume that either the TPMS sensor is dead or that the wheel within which the TPMS sensor is located is has been inappropriately changed. Again, an alert may be sent to a monitoring station. Maintenance Alerts In a further embodiment of the present disclosure, the mileage and parts inventory may be used to create a usage-based maintenance alert system. Thus, a central controller 910 in FIG. 9 may store a list of trailers, the components installed in such trailers, and the mileage needed to perform maintenance on each part. Further, the mileage for the trailer may be updated and when it reaches one of the thresholds, an alert may be generated for that trailer. For example, the central controller 910 may keep a table for trailer 920 with a list of parts 922 installed on the trailer. Each part could have a mileage threshold 924 for performing maintenance. Further, a part may have a date threshold 926 by which point maintenance should be performed, regardless of mileage. Thereafter, once the mileage for trailer 920 is updated, a check may be made to determine whether any mileage or date thresholds have been exceeded. If yes, then controller 910 may generate an alert that the trailer needs to be maintained. In further embodiments, the table may be expanded for other data such as actual miles used, actual wear status, expected next maintenance cycle, regulatory limits, part wear warranties or expectations, among other data. Such additional data may be used to customize the maintenance program for the trailer. Using data from all these points, the maintenance cycle of the trailer can be optimized. For example, a regulation may be set the trailers must be inspected every 10,000 miles. However, at the same time, higher wear may be seen on the brake pad then a supplier predicts based on normal use. This may signal a discrepancy that can specifically be investigated on the next maintenance cycle. Based on the above, inventory tracking and maintenance cycles can be performed on trailers. The server performing the embodiments above may be any network based server or combination of servers. One simplified server that may be used is provided with regards to FIG. 10. In FIG. 10, server 1010 includes a processor 1020 and a communications subsystem 1030, where the processor 1020 and communications subsystem 1030 cooperate to perform the methods of the embodiments described herein. Processor 1020 is configured to execute programmable logic, which may be stored, along with data, on server 1010, and shown in the example of FIG. 10 as memory 1040. Memory 1040 can be any tangible, non-transitory computer readable storage medium, such as optical (e.g., CD, DVD, etc.), magnetic (e.g., tape), flash drive, hard drive, or other memory known in the art. Alternatively, or in addition to memory 1040, server 1010 may access data or programmable logic from an external storage medium, for example through communications subsystem 1030. Communications subsystem 1030 allows server 1010 to communicate with other devices or network elements. Communications between the various elements of server 1010 may be through an internal bus 1060 in one embodiment. However, other forms of communication are possible. The embodiments described herein are examples of structures, systems or methods having elements corresponding to elements of the techniques of this application. This written description may enable those skilled in the art to make and use embodiments having alternative elements that likewise correspond to the elements of the techniques of this application. The intended scope of the techniques of this application thus includes other structures, systems or methods that do not differ from the techniques of this application as described herein, and further includes other structures, systems or methods with insubstantial differences from the techniques of this application as described herein. While operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be employed. Moreover, the separation of various system components in the implementation descried above should not be understood as requiring such separation in all implementations, and it should be understood that the described program components and systems can generally be integrated together in a signal software product or packaged into multiple software products. Also, techniques, systems, subsystems, and methods described and illustrated in the various implementations as discrete or separate may be combined or integrated with other systems, modules, techniques, or methods. Other items shown or discussed as coupled or directly coupled or communicating with each other may be indirectly coupled or communicating through some interface, device, or intermediate component, whether electrically, mechanically, or otherwise. Other examples of changes, substitutions, and alterations are ascertainable by one skilled in the art and may be made. While the above detailed description has shown, described, and pointed out the fundamental novel features of the disclosure as applied to various implementations, it will be understood that various omissions, substitutions, and changes in the form and details of the system illustrated may be made by those skilled in the art. In addition, the order of method steps are not implied by the order they appear in the claims. When messages are sent to/from an electronic device, such operations may not be immediate or from the server directly. They may be synchronously or asynchronously delivered, from a server or other computing system infrastructure supporting the devices/methods/systems described herein. The foregoing steps may include, in whole or in part, synchronous/asynchronous communications to/from the device/infrastructure. Moreover, communication from the electronic device may be to one or more endpoints on a network. These endpoints may be serviced by a server, a distributed computing system, a stream processor, etc. Content Delivery Networks (CDNs) may also provide may provide communication to an electronic device. For example, rather than a typical server response, the server may also provision or indicate a data for content delivery network (CDN) to await download by the electronic device at a later time, such as a subsequent activity of electronic device. Thus, data may be sent directly from the server, or other infrastructure, such as a distributed infrastructure, or a CDN, as part of or separate from the system. Except where otherwise described as such, a server, central server, service, processing service, endpoint, Uniform Resource Identifier (URI), Uniform Resource Locator (URL), back-end, and/or processing system may be used interchangeably in the descriptions and examples herein. Mesh networks and processing may also be used alone or in conjunction with other types as well as fog computing. Moreover, communication may be from device to device, wherein they may use low power communication (e.g., Bluetooth, Wi-Fi), and/or a network, to communicate with other devices to get information. Typically, storage mediums can include any or some combination of the following: a semiconductor memory device such as a dynamic or static random access memory (a DRAM or SRAM), an erasable and programmable read-only memory (EPROM), an electrically erasable and programmable read-only memory (EEPROM) and flash memory; a magnetic disk such as a fixed, floppy and removable disk; another magnetic medium including tape; an optical medium such as a compact disk (CD) or a digital video disk (DVD); or another type of storage device. Note that the instructions discussed above can be provided on one computer-readable or machine-readable storage medium, or alternatively, can be provided on multiple computer-readable or machine-readable storage media distributed in a large system having possibly plural nodes. Such computer-readable or machine-readable storage medium or media is (are) considered to be part of an article (or article of manufacture). An article or article of manufacture can refer to any manufactured single component or multiple components. The storage medium or media can be located either in the machine running the machine-readable instructions, or located at a remote site from which machine-readable instructions can be downloaded over a network for execution. In the foregoing description, numerous details are set forth to provide an understanding of the subject disclosed herein. However, implementations may be practiced without some of these details. Other implementations may include modifications and variations from the details discussed above. It is intended that the appended claims cover such modifications and variations. 1. A method at a computing device for calculating a distance travelled, the method comprising: receiving a plurality of discrete position fixes; determining a first distance travelled over the plurality of discrete position fixes by using a first calculation technique between successive discrete position fixes; determining a second distance travelled over the plurality of discrete position fixes by using a second calculation technique between successive discrete position fixes; applying a first weight to the first distance travelled and a second weight to the second distance travelled; and determining the distance travelled using a weighted average of the first distance travelled and the second distance travelled. 2. The method of claim 1, wherein the first calculation technique is a straight-line calculation between successive position fixes. 3. The method of claim 1, wherein the second calculation technique is a technique selected from a road based routing technique; a road based matrix technique; or a bias confirmation technique. 4. The method of claim 1, further comprising: determining a third distance travelled over the plurality of discrete position fixes by using a third calculation technique between successive discrete position fixes; applying a third weight to the third distance travelled; and using the weighted third distance travelled in the weighted average calculation. 5. The method of claim 1, wherein the plurality of discrete points is for a segment of a trip. 6. The method of claim 5, wherein the first weight and second weight are determined based on characteristics of the segment. 7. The method of claim 6, wherein different segments use a different first weight and a different second weight. 8. The method of claim 7, further comprising calculating a total distance by adding the determined distance travelled for each segment. 9. The method of claim 1, wherein the receiving is from a sensor apparatus on a vehicle or trailer. 10. The method of claim 1, wherein the discrete position fixes are obtained periodically. 11. A computing device for calculating a distance travelled, the computing device comprising: a processor; and a communications subsystem, wherein the computing device is configured to: receive a plurality of discrete position fixes; determine a first distance travelled over the plurality of discrete position fixes by using a first calculation technique between successive discrete position fixes; determine a second distance travelled over the plurality of discrete position fixes by using a second calculation technique between successive discrete position fixes; apply a first weight to the first distance travelled and a second weight to the second distance travelled; and determine the distance travelled using a weighted average of the first distance travelled and the second distance travelled. 12. The computing device of claim 11, wherein the first calculation technique is a straight-line calculation between successive position fixes. 13. The computing device of claim 11, wherein the second calculation technique is a technique selected from a road based routing technique; a road based matrix technique; or a bias confirmation technique. 14. The computing device of claim 11, wherein the computing device is further configured to: determine a third distance travelled over the plurality of discrete position fixes by using a third calculation technique between successive discrete position fixes; apply a third weight to the third distance travelled; and use the weighted third distance travelled in the weighted average calculation. 15. The computing device of claim 11, wherein the plurality of discrete points is for a segment of a trip. 16. The computing device of claim 15, wherein the first weight and second weight are determined based on characteristics of the segment. 17. The computing device of claim 16, wherein different segments use a different first weight and a different second weight. 18. The computing device of claim 17, wherein the computing device is further configured to calculate a total distance by adding the determined distance travelled for each segment. 19. The computing device of claim 11, wherein the computing device is configured to receive from a sensor apparatus on a vehicle or trailer. 20. The computing device of claim 11, wherein the discrete position fixes are obtained periodically. 21. A computer readable medium for storing instruction code, which, when executed by a processor of a computing device, cause the computing device to: receive a plurality of discrete position fixes; determine a first distance travelled over the plurality of discrete position fixes by using a first calculation technique between successive discrete position fixes; determine a second distance travelled over the plurality of discrete position fixes by using a second calculation technique between successive discrete position fixes; apply a first weight to the first distance travelled and a second weight to the second distance travelled; and determine the distance travelled using a weighted average of the first distance travelled and the second distance travelled.

2017-07-28

en

2019-01-31

US-202217572018-A

Targeted Therapeutic Lysosomal Enzyme Fusion Proteins and Uses Thereof ABSTRACT The present invention relates in general to therapeutic fusion proteins useful to treat lysosomal storage diseases and methods for treating such diseases. Exemplary therapeutic fusion proteins comprise a lysosomal enzyme, a lysosomal targeting moiety, e.g., an IGF-II peptide, and a spacer peptide. Also provided are compositions and methods for treating Mucopolysaccharidosis Type IIIB (Sanfilippo B Syndrome), comprising a targeted therapeutic fusion protein comprising alpha-N-acetylglucosaminidase (Naglu), a lysosomal targeting moiety, e.g., an IGF-II peptide, and a spacer peptide. CROSS REFERENCE This application is a Continuation of U.S. patent application Ser. No. 16/378,163, filed Apr. 8, 2019, which is a Continuation of U.S. patent application Ser. No. 15/688,438, filed Aug. 28, 2017, now U.S. Pat. No. 10,301,369, issued on May 28, 2019, which is a Divisional of U.S. patent application Ser. No. 14/883,211, filed Oct. 14, 2015, now U.S. Pat. No. 9,771,408, issued on Sep. 26, 2017, which is a Divisional of U.S. patent application Ser. No. 14/092,336, filed Nov. 27, 2013, now U.S. Pat. No. 9,376,480, issued on Jun. 28, 2016, which claims the priority benefit of U.S. Provisional Application No. 61/730,378, filed Nov. 27, 2012, and U.S. Provisional Application No. 61/788,968, filed Mar. 15, 2013, herein incorporated by reference in their entireties. SEQUENCE LISTING The instant application contains a Sequence Listing which has been submitted electronically in ASCII format and is hereby incorporated by reference in its entirety. Said ASCII copy, created on Dec. 29, 2021, is named 58039-703_302SL.txt and is 382,252 bytes in size. FIELD OF THE INVENTION The present invention relates in general to therapeutic fusion proteins useful to treat lyssomal storage diseases and methods for treating such diseases. Exemplary therapeutic fusion proteins comprise a lysosomal enzyme, a lysosomal targeting moiety, e.g., an IGF-II peptide, and a spacer peptide. It is contemplated that the lysosomal enzyme is alpha-N-acetylglucosaminidase (Naglu) and the disease is Mucopolysaccharidosis Type IIIB (Sanfilippo B Syndrome). BACKGROUND Normally, mammalian lysosomal enzymes are synthesized in the cytosol and traverse the ER where they are glycosylated with N-linked, high mannose type carbohydrate. In the golgi, the high mannose carbohydrate is modified on lysosomal enzymes by the addition of mannose-6-phosphate (M6P) which targets these proteins to the lysosome. The M6P-modified proteins are delivered to the lysosome via interaction with either of two M6P receptors. The most favorable form of modification is when two M6Ps are added to a high mannose carbohydrate. More than forty lysosomal storage diseases (LSDs) are caused, directly or indirectly, by the absence of one or more lysosomal enzymes in the lysosome. Enzyme replacement therapy for LSDs is being actively pursued. Therapy generally requires that LSD proteins be taken up and delivered to the lysosomes of a variety of cell types in an M6P-dependent fashion. One possible approach involves purifying an LSD protein and modifying it to incorporate a carbohydrate moiety with M6P. This modified material may be taken up by the cells more efficiently than unmodified LSD proteins due to interaction with M6P receptors on the cell surface. The inventors of the present application have previously developed a peptide based targeting technology that allows more efficient delivery of therapeutic enzymes to the lysosomes. This proprietary technology is termed Glycosylation Independent Lysosomal Targeting (GILT) because a peptide tag replaces M6P as the moiety targeting the lysosomes. Details of the GILT technology are described in U.S. Application Publication Nos. 2003-0082176, 2004-0006008, 2003-0072761, 2005-0281805, 2005-0244400, and international publications WO 03/032913, WO 03/032727, WO 02/087510, WO 03/102583, WO 2005/078077, the disclosures of all of which are hereby incorporated by reference. SUMMARY OF THE INVENTION The present invention provides further improved compositions and methods for efficient lysosomal targeting based on the GILT technology. Among other things, the present invention provides methods and compositions for targeting lysosomal enzymes to lysosomes using lysosomal targeting peptides. The present invention also provides methods and compositions for targeting lysosomal enzymes to lysosomes using a lysosomal targeting peptide that has reduced or diminished binding affinity for the IGF-I receptor and/or reduced or diminished binding affinity for the insulin receptor, and/or is resistant to furin cleavage. The present invention also provides lysosomal enzyme fusion proteins comprising a lysosomal enzyme and IGF-II and spacer peptides that provide for improved production and uptake into lysosomes of the lysosomal enzyme fusion protein. In certain embodiments, the lysosomal enzyme is alpha-N-acetylglucosaminidase (Naglu). In one aspect, the invention provides a targeted therapeutic fusion protein comprising a lysosomal enzyme, a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and a spacer peptide between the lysosomal enzyme and the IGF-II peptide tag. In various embodiments, the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences, and optionally further comprises one or more of (i) GAP (SEQ ID NO: 9), (ii) GGGGS (SEQ ID NO: 12), (iii) GGGS (SEQ ID NO: 16), (iv) AAAAS (SEQ ID NO: 17), (v) AAAS (SEQ ID NO: 18), (vi) PAPA (SEQ ID NO: 19), (vii) TPAPA (SEQ ID NO: 20), (viii) AAAKE (SEQ ID NO: 21) or (ix) GGGGA (SEQ ID NO: 60). Exemplary lysosomal enzymes contemplated herein include those set out in Table 1. In various embodiments, the targeted therapeutic fusion protein comprises an amino acid sequence at least 85% identical to a human α-N-acetylglucosaminidase (Naglu) protein (FIG. 1, SEQ ID NO: 1), a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and a spacer peptide located between the Naglu amino acid sequence and the IGF-II peptide tag. In various embodiments, the spacer comprises the amino acid sequence GAP (SEQ ID NO: 9), GPS (SEQ ID NO: 10), or GGS (SEQ ID NO: 11). In various embodiments, the spacer sequence comprises amino acids Gly-Pro-Ser (GPS) (SEQ ID NO: 10) between the amino acids of mature human IGF-II and the amino acids of human Naglu. In various embodiments, the spacer peptide comprises one or more GGGGS (SEQ ID NO: 12) or GGGS (SEQ ID NO: 16) amino acid sequences. In various embodiments, the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences. In various embodiments, the spacer peptide comprises one or more AAAAS (SEQ ID NO: 17) or AAAS (SEQ ID NO: 18) amino acid sequences. In various embodiments, the spacer peptide comprises one or more PAPA (SEQ ID NO: 19) or TPAPA (SEQ ID NO: 20) amino acid sequences. In various embodiments, the spacer peptide comprises one or more AAAKE (SEQ ID NO: 21) amino acid sequences. In various embodiments, the spacer peptide comprises one or more GGGGA (SEQ ID NO: 60) amino acid sequences. In various embodiments, the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-GGGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n(SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7. In various embodiments, n is 1 to 4. In various embodiments, the present invention provides an IGF-II peptide for use as a peptide tag for targeting the peptide or fusion protein comprising the peptide to a mammalian lysosome. In various embodiments, the present invention provides an IGF-II mutein. In various embodiments, the invention provides a furin-resistant IGF-II mutein having an amino acid sequence at least 70% identical to mature human IGF-II (AYRPSETLCGGELVDTLQFVCGDRGFYFSRPASRVSRRSRGIVEECCFRSCDLALLETYC ATPAKSE) (SEQ ID NO: 5) and a mutation that abolishes at least one furin protease cleavage site. In some embodiments, the present invention provides an IGF-II mutein comprising an amino acid sequence at least 70% identical to mature human IGF-II. In various embodiments, the IGF-II mutein peptide tag comprises amino acids 8-67 of mature human IGF-II. In various embodiments, the IGF-II mutein comprises a mutation that reduces or diminishes the binding affinity for the insulin receptor as compared to the wild-type human IGF-II. In some embodiments, the IGF-II mutein has diminished binding affinity for the IGF-I receptor relative to the affinity of naturally-occurring human IGF-II for the IGF-I receptor. In various embodiments, the present invention provides a targeted therapeutic fusion protein containing a lysosomal enzyme; and an IGF-II mutein having an amino acid sequence at least 70% identical to mature human IGF-II, wherein the IGF-II mutein is resistant to furin cleavage and binds to the human cation-independent mannose-6-phosphate receptor in a mannose-6-phosphate-independent manner. In some embodiments, the present invention provides a targeted therapeutic fusion protein containing a lysosomal enzyme; and an IGF-II mutein having an amino acid sequence at least 70% identical to mature human IGF-II, and having diminished binding affinity for the insulin receptor relative to the affinity of naturally-occurring human IGF-II for the insulin receptor. In a related embodiment, the IGF-II mutein is resistant to furin cleavage and binds to the human cation-independent mannose-6-phosphate receptor in a mannose-6-phosphate-independent manner. In various embodiments, an IGF-II mutein suitable for the invention includes a mutation within a region corresponding to amino acids 30-40 of mature human IGF-II. In some embodiments, an IGF-II mutein suitable for the invention includes a mutation within a region corresponding to amino acids 34-40 of mature human IGF-II such that the mutation abolishes at least one furin protease cleavage site. In some embodiments, a suitable mutation is an amino acid substitution, deletion and/or insertion. In some embodiments, the mutation is an amino acid substitution at a position corresponding to Arg37 or Arg40 of mature human IGF-II. In some embodiments, the amino acid substitution is a Lys or Ala substitution. In some embodiments, a suitable mutation is a deletion or replacement of amino acid residues corresponding to positions selected from the group consisting of 30-40, 31-40, 32-40, 33-40, 34-40, 30-39, 31-39, 32-39, 34-37, 33-39, 34-39, 35-39, 36-39, 37-40 of mature human IGF-II, and combinations thereof. In various embodiments, an IGF-II mutein according to the invention further contains a deletion or a replacement of amino acids corresponding to positions 2-7 of mature human IGF-II. In various embodiments, an IGF-II mutein according to the invention further includes a deletion or a replacement of amino acids corresponding to positions 1-7 of mature human IGF-II. In various embodiments, an IGF-II mutein according to the invention further contains a deletion or a replacement of amino acids corresponding to positions 62-67 of mature human IGF-II. In various embodiments, an IGF-II mutein according to the invention further contains an amino acid substitution at a position corresponding to Tyr27, Leu43, or Ser26 of mature human IGF-II. In various embodiments, an IGF-II mutein according to the invention contains at least an amino acid substitution selected from the group consisting of Tyr27Leu, Leu43Val, Ser26Phe and combinations thereof. In various embodiments, an IGF-II mutein according to the invention contains amino acids corresponding to positions 48-55 of mature human IGF-II. In various embodiments, an IGF-II mutein according to the invention contains at least three amino acids selected from the group consisting of amino acids corresponding to positions 8, 48, 49, 50, 54, and 55 of mature human IGF-II. In various embodiments, an IGF-II mutein of the invention contains, at positions corresponding to positions 54 and 55 of mature human IGF-II, amino acids each of which is uncharged or negatively charged at pH 7.4. In various embodiments, the IGF-II mutein has diminished binding affinity for the IGF-I receptor relative to the affinity of naturally-occurring human IGF-II for the IGF-I receptor. In various embodiments, the IGF-II mutein is IGF2 A8-67 R37A (i.e., amino acids 8-67 of mature human IGF-II with the Arg at position 37 of mature human IGF-II substituted by Ala). In various embodiments, the peptide tag is attached to the N-terminus or C-terminus of the lysosomal enzyme, therefore is an N-terminal tag or a C-terminal tag, respectively. In various embodiments, the peptide tag is a C-terminal tag. In some embodiments, a lysosomal enzyme suitable for the invention is human alpha-N-acetylglucosaminidase (Naglu) (FIG. 1), or a functional fragment or variant thereof. In some embodiments, a lysosomal enzyme suitable for the invention includes amino acids 1-743 of human alpha-N-acetylglucosaminidase or amino acids 24-743 of human alpha-N-acetylglucosaminidase, which lacks a signal sequence. In various embodiments, a targeted therapeutic fusion protein of the invention further includes a spacer between the lysosomal enzyme and the IGF-II mutein. In various embodiments, the spacer comprises an alpha-helical structure or a rigid structure. In various embodiments, the spacer comprises one or more Gly-Ala-Pro (GAP) (SEQ ID NO: 9), Gly-Pro-Ser (GPS) (SEQ ID NO: 10), or Gly-Gly-Scr (GGS) (SEQ ID NO: 11) amino acid sequences. In some embodiments, the spacer is selected from the group consisting of (SEQ ID NO: 22) EFGGGGSTR, (SEQ ID NO: 9) GAP, (SEQ ID NO: 12) GGGGS, (SEQ ID NO: 23) GPSGSPG, (SEQ ID NO: 24) GPSGSPGT, (SEQ ID NO: 25) GPSGSPGH, (SEQ ID NO: 26) GGGGSGGGGSGGGGSGGGGSGGGPST, (SEQ ID NO: 27) GGGGSGGGGSGGGGSGGGGSGGGPSH, (SEQ ID NO: 28) GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS, (SEQ ID NO: 29) GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP, (SEQ ID NO: 30) GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 31) GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GA P, (SEQ ID NO: 32) GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS, (SEQ ID NO: 33) GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP, (SEQ ID NO: 34) GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS, (SEQ ID NO: 35) GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P, (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 37) GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP, (SEQ ID NO: 38) GGGGSGGGGSAAAASGGGGSGGGPS, (SEQ ID NO: 39) GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP, (SEQ ID NO: 40) GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS, (SEQ ID NO: 41) GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGG PSG AP, (SEQ ID NO: 42) GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS, (SEQ ID NO: 43) GAPGGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGG PSGA P, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, (SEQ ID NO: 56) GGGGSGGGGSGGGGS, (SEQ ID NO: 57) GAPGGGGSGGGGSGGGGSGAP, (SEQ ID NO: 58) GGGGSGGGGSGGGGSGGGGS, (SEQ ID NO: 59) GAPGGGGSGGGGSGGGGSGGGGSGAP, (SEQ ID NO: 60) GGGGA, (SEQ ID NO: 61) GGGGAGGGGAGGGGAGGGGAGGGPST, (SEQ ID NO: 62) GGGGAGGGGAGGGGAGGGGAGGGPSH, (SEQ ID NO: 63) GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS, (SEQ ID NO: 64) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP, (SEQ ID NO: 65) GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS, (SEQ ID NO: 66) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGG PSGAP, (SEQ ID NO: 67) GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS, (SEQ ID NO: 68) GAPGGGGAGGGGAGGGGAGGGPS GGGGAGGGGAGGGPS GAP, (SEQ ID NO: 69) GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS, (SEQ ID NO: 70) GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGG PSGAP, (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS, (SEQ ID NO: 72) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP, (SEQ ID NO: 73) GGGGAGGGGAAAAASGGGGAGGGPS, (SEQ ID NO: 74) GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP, (SEQ ID NO: 75) GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS, (SEQ ID NO: 76) GAPGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGG PSGAP, (SEQ ID NO: 77) GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS, (SEQ ID NO: 78) GAPGGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGG PSG AP, (SEQ ID NO: 79) GGGGAGGGGAGGGGA, (SEQ ID NO: 80) GAPGGGGAGGGGAGGGGAGAP, (SEQ ID NO: 81) GGGGAGGGGAGGGGAGGGGA, (SEQ ID NO: 82) GAPGGGGAGGGGAGGGGAGGGGAGAP, (SEQ ID NO: 83) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS], (SEQ ID NO: 84) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH], (SEQ ID NO: 85) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS], (SEQ ID NO: 86) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH], (SEQ ID NO: 87) GGGGPAPGPGPAPGPAPGPAGGGPS, (SEQ ID NO: 88) GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP, (SEQ ID NO: 89) GGGGPAPAPGPAPAPGPAPAGGGPS, and (SEQ ID NO: 90) GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP. In some embodiments, the spacer is selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPSG AP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. In some embodiments, the spacer is selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. In various embodiments, the fusion protein further comprises a pharmaceutically acceptable carrier, diluents or excipient. The present invention also provides nucleic acids encoding the IGF-II mutein or the targeted therapeutic fusion protein as described in various embodiments above. The present invention further provides various cells containing the nucleic acid of the invention. The present invention provides pharmaceutical compositions suitable for treating lysosomal storage disease containing a therapeutically effective amount of a targeted therapeutic fusion protein of the invention. The invention further provides methods of treating lysosomal storage diseases comprising administering to a subject in need of treatment a targeted therapeutic fusion protein according to the invention. In some embodiments, the lysosomal storage disease is Mucopolysaccharidosis Type IIIB (Sanfilippo B Syndrome). In another aspect, the present invention provides a method of producing a targeted therapeutic fusion protein including a step of culturing mammalian cells in a cell culture medium, wherein the mammalian cells carry the nucleic acid of the invention, in particular, as described in various embodiments herein; and the culturing is performed under conditions that permit expression of the targeted therapeutic fusion protein. In yet another aspect, the present invention provides a method of producing a targeted therapeutic fusion protein including a step of culturing furin-deficient cells (e.g., furin-deficient mammalian cells) in a cell culture medium, wherein the furin-deficient cells carry a nucleic acid encoding a fusion protein comprising a lysosomal enzyme and an IGF-II mutein having an amino acid sequence at least 70% identical to mature human IGF-II, wherein the IGF-II mutein binds to the human cation-independent mannose-6-phosphate receptor in a mannose-6-phosphate-independent manner; and wherein the culturing is performed under conditions that permit expression of the targeted therapeutic fusion protein. In various embodiments, it is contemplated that certain of the targeted therapeutic proteins comprising a spacer as described herein exhibit increased expression of active protein when expressed recombinantly compared to targeted therapeutic proteins comprising a different spacer peptide. In various embodiments, it is also contemplated that targeted therapeutic proteins described herein may have increased activity compared to other targeted therapeutic proteins herein. It is contemplated that those targeted therapeutic proteins exhibiting increased expression of active protein and/or having increased activity compared to other targeted therapeutic proteins comprising a different spacer peptide are used for further experimentation. In another aspect, the invention provides a method for treating a lysosomal storage disease in a subject comprising administering to the subject a therapeutically effective amount of a pharmaceutical composition comprising a fusion protein comprising a lysosomal enzyme, a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and a spacer peptide located between the lysosomal enzyme amino acid sequence and the IGF-II peptide tag. In various embodiments, the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences, and optionally further comprises one or more of (i) GAP (SEQ ID NO: 9), (ii) GGGGS (SEQ ID NO: 12), (iii) GGGS (SEQ ID NO: 16), (iv) AAAAS (SEQ ID NO: 17), (v) AAAS (SEQ ID NO: 18), (vi) PAPA (SEQ ID NO: 19), (vii) TPAPA (SEQ ID NO: 20), (viii) AAAKE (SEQ ID NO: 21) or (ix) GGGGA (SEQ ID NO: 60). In various embodiments, the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-GGGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n (SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7, optionally n is 1 to 4. In various embodiments, the spacer peptide has an amino acid sequence selected from the group consisting of EFGGGGSTR (SEQ ID NO: 22), GAP (SEQ ID NO: 9), GGGGS (SEQ ID NO: 12), GPSGSPG (SEQ ID NO: 23), GPSGSPGT (SEQ ID NO: 24), GPSGSPGH (SEQ ID NO: 25), GGGGSGGGGSGGGGSGGGGSGGGPST (SEQ ID NO: 26), GGGGSGGGGSGGGGSGGGGSGGGPSH (SEQ ID NO: 27), GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS (SEQ ID NO: 28), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP (SEQ ID NO: 29), GGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS (SEQ ID NO: 30), GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GAP (SEQ ID NO: 31), GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS (SEQ ID NO: 32), GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 33), GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS (SEQ ID NO: 34), GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P (SEQ ID NO: 35), GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 37), GGGGSGGGGSAAAASGGGGSGGGPS (SEQ ID NO: 38), GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP (SEQ ID NO: 39), GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS (SEQ ID NO: 40), GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPSG AP (SEQ ID NO: 41), GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS (SEQ ID NO: 42), GAP GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGA P (SEQ ID NO: 43), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP (SEQ ID NO: 51), GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), GGGGSGGGGSGGGGS (SEQ ID NO: 56), GAPGGGGSGGGGSGGGGSGAP (SEQ ID NO: 57), GGGGSGGGGSGGGGSGGGGS (SEQ ID NO: 58), GAPGGGGSGGGGSGGGGSGGGGSGAP (SEQ ID NO: 59), GGGGA (SEQ ID NO: 60), GGGGAGGGGAGGGGAGGGGAGGGPST (SEQ ID NO: 61), GGGGAGGGGAGGGGAGGGGAGGGPSH (SEQ ID NO: 62), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS (SEQ ID NO: 63), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP (SEQ ID NO: 64), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 65), GAP GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS GAP (SEQ ID NO:66), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 67), GAPGGGGAGGGGAGGGGAGGGPS GGGGAGGGGAGGGPS GAP (SEQ ID NO: 68), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 69), GAP GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS GAP (SEQ ID NO: 70), GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP (SEQ ID NO: 72), GGGGAGGGGAAAAASGGGGAGGGPS (SEQ ID NO: 73), GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP (SEQ ID NO: 74), GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS (SEQ ID NO: 75), GAP GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS GAP (SEQ ID NO: 76), GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS (SEQ ID NO: 77), GAP GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPSG AP (SEQ ID NO: 78), GGGGAGGGGAGGGGA (SEQ ID NO: 79), GAPGGGGAGGGGAGGGGAGAP (SEQ ID NO: 80), GGGGAGGGGAGGGGAGGGGA (SEQ ID NO: 81), GAPGGGGAGGGGAGGGGAGGGGAGAP (SEQ ID NO: 82), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS] (SEQ ID NO: 83), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH] (SEQ ID NO: 84), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS] (SEQ ID NO: 85), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH] (SEQ ID NO: 86), GGGGPAPGPGPAPGPAPGPAGGGPS (SEQ ID NO: 87), GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP (SEQ ID NO: 88), GGGGPAPAPGPAPAPGPAPAGGGPS (SEQ ID NO: 89), and GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP (SEQ ID NO: 90). In various embodiments, the spacer peptide has an amino acid sequence selected from the group consisting of GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPSGAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP (SEQ ID NO: 51), GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), and GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71). In various embodiments, the spacer peptide has an amino acid sequence selected from the group consisting of GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP (SEQ ID NO: 51), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), and GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71). Exemplary lysosomal storage diseases contemplated by the methods herein include those set out in Table 1. It is contemplated that the lysosomal storage disease is treated using a targeted therapeutic fusion protein comprising the enzyme deficient in the lysosomal storage disease, also disclosed in Table 1. In various embodiments, the invention provides a method for treating Mucopolysaccharidosis Type IIIB (Sanfilippo B Syndrome) in a subject comprising administering to the subject a therapeutically effective amount of a pharmaceutical composition comprising a fusion protein comprising an amino acid sequence at least 85% identical to a human α-N-acetylglucosaminidase (Naglu) protein (SEQ ID NO: 1), a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and a spacer peptide located between the Naglu amino acid sequence and the IGF-II peptide tag. In various embodiments, the spacer comprises the amino acid sequence GAP (SEQ ID NO: 9), GPS (SEQ ID NO: 10), or GGS (SEQ ID NO: 11). In various embodiments, the spacer sequence comprises amino acids Gly-Pro-Ser (GPS) (SEQ ID NO: 10) between the amino acids of mature human IGF-II and the amino acids of human Naglu. In various embodiments, the spacer peptide comprises one or more GGGGS (SEQ ID NO: 12) or GGGS (SEQ ID NO: 16) amino acid sequences. In various embodiments, the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences. In various embodiments, the spacer peptide comprises one or more AAAAS (SEQ ID NO: 17) or AAAS (SEQ ID NO: 18) amino acid sequences. In various embodiments, the spacer peptide comprises one or more PAPA (SEQ ID NO: 19) or TPAPA (SEQ ID NO: 20) amino acid sequences. In various embodiments, the spacer peptide comprises one or more AAAKE (SEQ ID NO: 21) amino acid sequences. In various embodiments, the spacer peptide comprises one or more GGGGA (SEQ ID NO: 60) amino acid sequences. In various embodiments, the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-GGGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n (SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7, optionally wherein n is 1 to 4. In various embodiments, the invention provides a method for reducing glycosaminoglycan (GAG) levels in vivo comprising administering to a subject suffering from Mucopolysaccharidosis Type TIIB (Sanfilippo B Syndrome) an effective amount of a fusion protein comprising i) an amino acid sequence at least 85% identical to a human α-N-acetylglucosaminidase (Naglu) protein (SEQ ID NO: 1), ii) a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II, and iii) a spacer peptide located between the Naglu amino acid sequence and the IGF-II peptide tag. In various embodiments, the spacer sequence comprises one or more copies of amino acids Gly-Ala-Pro (GAP) (SEQ ID NO: 9) between the amino acids of mature human IGF-II and the amino acids of human Naglu. In various embodiments, the spacer peptide is selected from the group consisting of (SEQ ID NO: 22) EFGGGGSTR, (SEQ ID NO: 9) GAP, (SEQ ID NO: 12) GGGGS, (SEQ ID NO: 23) GPSGSPG, (SEQ ID NO: 24) GPSGSPGT, (SEQ ID NO: 25) GPSGSPGH, (SEQ ID NO: 26) GGGGSGGGGSGGGGSGGGGSGGGPST, (SEQ ID NO: 27) GGGGSGGGGSGGGGSGGGGSGGGPSH, (SEQ ID NO: 28) GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS, (SEQ ID NO: 29) GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP, (SEQ ID NO: 30) GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 31) GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GA P, (SEQ ID NO: 32) GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS, (SEQ ID NO: 33) GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP, (SEQ ID NO: 34) GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS, (SEQ ID NO: 35) GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P, (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 37) GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP, (SEQ ID NO: 38) GGGGSGGGGSAAAASGGGGSGGGPS, (SEQ ID NO: 39) GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP, (SEQ ID NO: 40) GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS, (SEQ ID NO: 41) GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGG PSG AP, (SEQ ID NO: 42) GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS, (SEQ ID NO: 43) GAPGGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGG PSGA P, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, (SEQ ID NO: 56) GGGGSGGGGSGGGGS, (SEQ ID NO: 57) GAPGGGGSGGGGSGGGGSGAP, (SEQ ID NO: 58) GGGGSGGGGSGGGGSGGGGS, (SEQ ID NO: 59) GAPGGGGSGGGGSGGGGSGGGGSGAP, (SEQ ID NO: 60) GGGGA, (SEQ ID NO: 61) GGGGAGGGGAGGGGAGGGGAGGGPST, (SEQ ID NO: 62) GGGGAGGGGAGGGGAGGGGAGGGPSH, (SEQ ID NO: 63) GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS, (SEQ ID NO: 64) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP, (SEQ ID NO: 65) GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS, (SEQ ID NO: 66) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGG PSGAP, (SEQ ID NO: 67) GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS, (SEQ ID NO: 68) GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGAP, (SEQ ID NO: 69) GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS, (SEQ ID NO: 70) GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGG PSGAP, (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS, (SEQ ID NO: 72) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP, (SEQ ID NO: 73) GGGGAGGGGAAAAASGGGGAGGGPS, (SEQ ID NO: 74) GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP, (SEQ ID NO: 75) GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS, (SEQ ID NO: 76) GAPGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGG PSGAP, (SEQ ID NO: 77) GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS, (SEQ ID NO: 78) GAPGGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGG PSG AP, (SEQ ID NO: 79) GGGGAGGGGAGGGGA, (SEQ ID NO: 80) GAPGGGGAGGGGAGGGGAGAP, (SEQ ID NO: 81) GGGGAGGGGAGGGGAGGGGA, (SEQ ID NO: 82) GAPGGGGAGGGGAGGGGAGGGGAGAP, (SEQ ID NO: 83) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS], (SEQ ID NO: 84) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH], (SEQ ID NO: 85) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS], (SEQ ID NO: 86) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH], (SEQ ID NO: 87) GGGGPAPGPGPAPGPAPGPAGGGPS, (SEQ ID NO: 88) GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP, (SEQ ID NO: 89) GGGGPAPAPGPAPAPGPAPAGGGPS, and (SEQ ID NO: 90) GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP. In various embodiments, the spacer peptide is selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPSG AP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. In various embodiments, the spacer peptide is selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. In various embodiments, the lysosomal targeting domain or IGF-II peptide tag comprises amino acids 8-67 of mature human IGF-II (SEQ ID NO: 2, 4). In various embodiments, the IGF-II peptide tag comprises a mutation at residue Arg37. In various embodiments, the mutation is a substitution of alanine for arginine. In various embodiments, the lysosomal targeting domain or IGF-II peptide tag comprises IGF2 A8-67 R37A. In various embodiments, the fusion protein comprises amino acids 1-743 of human Naglu (SEQ ID NO: 1, 3). In various embodiments, the fusion protein comprises amino acids 24-743 of human Naglu. In various embodiments, the effective amount of fusion protein is in the range of about 0.1-1 mg/kg, about 1-5 mg/kg, about 2.5-20 mg/kg, about 5-20 mg/kg, about 10-50 mg/kg, or 20-100 mg/kg of body weight of the subject. In various embodiments, the effective amount of fusion protein is about 2.5-20 mg per kilogram of body weight of the subject. In various embodiments, the fusion protein is administered intrathecally, intravenously, intramuscularly, parenterally, transdermally, or transmucosally. In various embodiments, the fusion protein is administered intrathecally. In various embodiments, the intrathecal administration optionally further comprises administering the fusion protein intravenously. In various embodiments, intrathecal administration comprises introducing the fusion protein into a cerebral ventricle, lumbar area, or cisterna magna. In various embodiments, the fusion protein is administered bimonthly, monthly, triweekly, biweekly, weekly, daily, or at variable intervals. In various embodiments, the treatment results in reducing glycosaminoglycan (GAG) levels in a brain tissue. It is further contemplated that the treatment results in reducing lysosomal storage granules in a brain tissue. Also contemplated are compositions comprising the targeted therapeutic fusion proteins as described herein for use in treating lysosomal storage diseases. Exemplary lysosomal storage diseases include those set out in Table 1. Other features, objects, and advantages of the present invention are apparent in the detailed description that follows. It should be understood, however, that the detailed description, while indicating embodiments of the present invention, is given by way of illustration only, not limitation. Various changes and modifications within the scope of the invention will become apparent to those skilled in the art from the detailed description. BRIEF DESCRIPTION OF THE DRAWINGS The drawings are for illustration purposes only, not for limitation. FIGS. 1A-1B depict the amino acid sequences of a portion of an exemplary therapeutic fusion protein comprising (FIG. 1A) Naglu and (FIG. 1B) an IGF-II peptide comprising residues 8-67 of IGF-II and having an amino acid substitution at residue 37, R37A (Arg37A1a). FIGS. 2A-2B depict the nucleotide sequences of a portion of an exemplary therapeutic fusion protein comprising (FIG. 2A) Naglu and (FIG. 2B) an IGF-II peptide comprising residues 8-67 of IGF-II and having an amino acid substitution at residue 37, R37A (Arg37A1a). FIG. 3 discloses exemplary spacer sequences contemplated for use in the therapeutic fusion protein. DEFINITIONS Amelioration: As used herein, the term “amelioration” is meant the prevention, reduction or palliation of a state, or improvement of the state of a subject. Amelioration includes, but does not require complete recovery or complete prevention of a disease condition. In some embodiments, amelioration includes reduction of accumulated materials inside lysosomes of relevant diseases tissues. Furin-resistant IGF-II mutein: As used herein, the term “furin-resistant IGF-II mutein” refers to an IGF-II-based peptide containing an altered amino acid sequence that abolishes at least one native furin protease cleavage site or changes a sequence close or adjacent to a native furin protease cleavage site such that the furin cleavage is prevented, inhibited, reduced, or slowed down as compared to a wild-type human TGF-II peptide. As used herein, a furin-resistant IGF-II mutein is also referred to as an IGF-II mutein that is resistant to furin. Furin protease cleavage site: As used herein, the term “furin protease cleavage site” (also referred to as “furin cleavage site” or “furin cleavage sequence”) refers to the amino acid sequence of a peptide or protein that serves as a recognition sequence for enzymatic protease cleavage by furin or furin-like proteases. Typically, a furin protease cleavage site has a consensus sequence Arg-X-X-Arg (SEQ ID NO: 6), X is any amino acid. The cleavage site is positioned after the carboxy-terminal arginine (Arg) residue in the sequence. In some embodiments, a furin cleavage site may have a consensus sequence Lys/Arg-X-X-X-Lys/Arg-Arg (SEQ ID NO: 7), X is any amino acid. The cleavage site is positioned after the carboxy-terminal arginine (Arg) residue in the sequence. Furin: As used herein, the term “furin” refers to any protease that can recognize and cleave the furin protease cleavage site as defined herein, including furin or furin-like protease. Furin is also known as paired basic amino acid cleaving enzyme (PACE). Furin belongs to the subtilisin-like proprotein convertase family. The gene encoding furin was known as FUR (FES Upstream Region). Furin-deficient cells: As used herein, the term “furin-deficient cells” refers to any cells whose furin protease activity is inhibited, reduced or eliminated. Furin-deficient cells include both mammalian and non-mammalian cells that do not produce furin or produce reduced amount of furin or defective furin protease. Glycosylation Independent Lysosomal Targeting: As used herein, the term “glycosylation independent lysosomal targeting” (also referred to as “GILT”) refer to lysosomal targeting that is mannose-6-phosphate-independent. Human Alpha-N-acetylglucosaminidase: As used herein, the term “human alpha-N-acetylglucosaminidase” (also referred to as “Naglu”) refers to precursor (i.e., containing the native Naglu signal peptide sequence) or processed (i.e., lacking the native Naglu signal peptide sequence) wild-type form of human alpha-N-acetylglucosaminidase, or a functional fragment or variant thereof, that is capable of reducing glycosaminoglycan (GAG) levels in mammalian lysosomes or that can rescue or ameliorate one or more MPS ITIB (Sanfilippo B Syndrome) symptoms. As used herein, the term “functional” as it relates to Naglu refers to a Naglu enzyme that is capable of being taken up by mammalian lysosomes and having sufficient enzymatic activity to reduce storage material, i.e., glycosaminoglycan (GAG), in the mammalian lysosome. IGF-II mutein: As used herein, the term “IGF-II mutein” refers to an IGF-II-based peptide containing an altered amino acid sequence. As used herein, the term “furin-resistant IGF-II mutein” refers to an IGF-II-based peptide containing an altered amino acid sequence that abolishes at least one native furin protease cleavage site or changes a sequence close or adjacent to a native furin protease cleavage site such that the furin cleavage is prevented, inhibited, reduced, or slowed down as compared to a wild-type human peptide. As used herein, a furin-resistant IGF-II mutein is also referred to as an IGF-II mutein that is resistant to furin. Improve, increase, or reduce: As used herein, the terms “improve,” “increase” or “reduce,” or grammatical equivalents, indicate values that are relative to a baseline measurement, such as a measurement in the same individual prior to initiation of the treatment described herein, or a measurement in a control individual (or multiple control individuals) in the absence of the treatment described herein. A “control individual” is an individual afflicted with the same form of lysosomal storage disease (e.g., MPS TIM (Sanfilippo B Syndrome)) as the individual being treated, who is about the same age as the individual being treated (to ensure that the stages of the disease in the treated individual and the control individual(s) are comparable). Individual, subject, patient: As used herein, the terms “subject,” “individual” or “patient” refer to a human or a non-human mammalian subject. The individual (also referred to as “patient” or “subject”) being treated is an individual (fetus, infant, child, adolescent, or adult human) suffering from a lysosomal storage disease, for example, MPS IIIB (Sanfilippo B Syndrome) (i.e., either infantile-, juvenile-, or adult-onset or severe/classical type or attenuated type MPS IIIB (Sanfilippo B Syndrome)) or having the potential to develop a lysosomal storage disease (e.g., MPS IIIB (Sanfilippo B Syndrome)). Lysosomal storage diseases: As used herein, “lysosomal storage diseases” refer to a group of genetic disorders that result from deficiency in at least one of the enzymes (e.g., acid hydrolases) that are required to break macromolecules down to peptides, amino acids, monosaccharides, nucleic acids and fatty acids in lysosomes. As a result, individuals suffering from lysosomal storage diseases have accumulated materials in lysosomes. Exemplary lysosomal storage diseases are listed in Table 1. Lysosomal enzyme: As used herein, the term “lysosomal enzyme” refers to any enzyme that is capable of reducing accumulated materials in mammalian lysosomes or that can rescue or ameliorate one or more lysosomal storage disease symptoms. Lysosomal enzymes suitable for the invention include both wild-type or modified lysosomal enzymes and can be produced using recombinant and synthetic methods or purified from nature sources. Exemplary lysosomal enzymes are listed in Table 1. Spacer: As used herein, the term “spacer” (also referred to as “linker”) refers to a peptide sequence between two protein moieties in a fusion protein. A spacer is generally designed to be flexible or to interpose a structure, such as an alpha-helix, between the two protein moieties. A spacer can be relatively short, such for example, the sequence Gly-Ala-Pro (GAP) (SEQ ID NO: 9), Gly-Gly-Gly-Gly-Ser (GGGGS) (SEQ ID NO: 12), Gly-Gly-Gly-Gly-Ala (GGGGA) (SEQ ID NO: 60) or Gly-Gly-Gly-Gly-Gly-Pro (GGGGGP) (SEQ ID NO: 13), or can be longer, such as, for example, 10-25 amino acids in length, 25-50 amino acids in length or 35-55 amino acids in length. Exemplary spacer sequences are disclosed in greater detail in the Detailed Description. Therapeutically effective amount: As used herein, the term “therapeutically effective amount” or “effective amount” refers to an amount of a targeted therapeutic fusion protein which confers a therapeutic effect on the treated subject, at a reasonable benefit/risk ratio applicable to any medical treatment. The therapeutic effect may be objective (i.e., measurable by some test or marker) or subjective (i.e., subject gives an indication of or feels an effect). In particular, the “therapeutically effective amount” refers to an amount of a therapeutic fusion protein or composition effective to treat, ameliorate, or prevent a desired disease or condition, or to exhibit a detectable therapeutic or preventative effect, such as by ameliorating symptoms associated with the disease, preventing or delaying the onset of the disease, and/or also lessening the severity or frequency of symptoms of the disease. A therapeutically effective amount is commonly administered in a dosing regimen that may comprise multiple unit doses. For any particular therapeutic fusion protein, a therapeutically effective amount (and/or an appropriate unit dose within an effective dosing regimen) may vary, for example, depending on route of administration, on combination with other pharmaceutical agents. Also, the specific therapeutically effective amount (and/or unit dose) for any particular patient may depend upon a variety of factors including the disorder being treated and the severity of the disorder; the activity of the specific pharmaceutical agent employed; the specific composition employed; the age, body weight, general health, sex and diet of the patient; the time of administration, route of administration, and/or rate of excretion or metabolism of the specific fusion protein employed; the duration of the treatment; and like factors as is well known in the medical arts. Treatment: As used herein, the term “treatment” (also “treat” or “treating”) refers to any administration of a therapeutic fusion protein or pharmaceutical composition comprising said therapeutic fusion protein that partially or completely alleviates, ameliorates, relieves, inhibits, delays onset of, reduces severity of and/or reduces incidence of one or more symptoms or features of a particular disease, disorder, and/or condition. Such treatment may he of a subject who does not exhibit signs of the relevant disease, disorder and/or condition and/or of a subject who exhibits only early signs of the disease, disorder, and/or condition. Alternatively or additionally, such treatment may he of a subject who exhibits one or more established signs of the relevant disease, disorder and/or condition. For example, treatment can refer to improvement of cardiac status (e.g., increase of end-diastolic and/or end-systolic volumes, or reduction, amelioration or prevention of the progressive cardiomyopathy that is typically found in, e.g., Pompe disease) or of pulmonary function (e.g., increase in crying vital capacity over baseline capacity, and/or normalization of oxygen desaturation during crying); improvement in neurodevelopment and/or motor skills (e.g., increase in AIMS score); reduction of storage (e.g., glycosaminoglycan (GAG), levels in tissue of the individual affected by the disease; or any combination of these effects. In some embodiments, treatment includes improvement of glycosaminoglycan (GAG) clearance, particularly in reduction or prevention of MPS TTTB (Sanfilippo B Syndrome)-associated neuronal symptoms. As used in this application, the terms “about” and “approximately” are used as equivalents. Any numerals used in this application with or without about/approximately are meant to cover any normal fluctuations appreciated by one of ordinary skill in the relevant art. DETAILED DESCRIPTION OF THE INVENTION The present invention provides improved methods and compositions for targeting lysosomal enzymes based on the glycosylation-independent lysosomal targeting (GILT) technology. Among other things, the present invention provides IGF-II muteins that are resistant to furin and/or has reduced or diminished binding affinity for the insulin receptor, and/or has reduced or diminished binding affinity for the IGF-I receptor and targeted therapeutic fusion proteins containing an IGF-II mutein of the invention. The present invention also provides methods of making and using the same. Various aspects of the invention are described in detail in the following sections. The use of sections is not meant to limit the invention. Each section can apply to any aspect of the invention. In this application, the use of “or” means “and/or” unless stated otherwise. Lysosomal Enzymes A lysosomal enzyme suitable for the invention includes any enzyme that is capable of reducing accumulated materials in mammalian lysosomes or that can rescue or ameliorate one or more lysosomal storage disease symptoms. Suitable lysosomal enzymes include both wild-type or modified lysosomal enzymes and can be produced using recombinant or synthetic methods or purified from natural sources. Exemplary lysosomal enzymes are listed in Table 1. TABLE 1 Lysosomal Storage Diseases and associated enzyme defects Disease Name Enzyme Defect Substance Stored A. Glycogenosis Disorders Pompe Disease Acid-αl, 4- Glucosidase Glycogen α1-4 linked Oligosaccharides B. Glycolipidosis Disorders GM1 Gangliodsidosis β-Galactosidase GM1 Gangliosides Tay-Sachs Disease β-Hexosaminidase A GM2 Ganglioside GM2 Gangliosidosis: AB GM2 Activator Protein GM2 Ganglioside Variant Sandhoff Disease β-Hexosaminidase A&B GM2 Ganglioside Fabry Disease α-Galactosidase A Globosides Gaucher Disease Glucocerebrosidase Glucosylceramide Metachromatic Arylsulfatase A Sulphatides Leukodystrophy Krabbe Disease Galactosylceramidase Galactocerebroside Niemann-Pick, Types A & B Acid Sphingomyelinase Sphingomyelin Niemann-Pick, Type C Cholesterol Esterification Sphingomyelin Defect Niemann-Pick, Type D Unknown Sphingomyelin Farber Disease Acid Ceramidase Ceramide Wolman Disease Acid Lipase Cholesteryl Esters C. Mucopolysaccharide Disorders Hurler Syndrome (MPS IH) α-L-Iduronidase Heparan & Dermatan Sulfates Scheie Syndrome (MPS IS) α-L-Iduronidase Heparan & Dermatan Sulfates Hurler-Scheie (MPS IH/S) α-L-Iduronidase Heparan & Dermatan Sulfates Hunter Syndrome (MPS II) Iduronate Sulfatase Heparan & Dermatan Sulfates Sanfilippo A (MPS IIIA) Heparan N-Sulfatase Heparan Sulfate Sanfilippo B (MPS IIIB) α-N-Acetylglucosaminidase Heparan Sulfate Sanfilippo C (MPS IIIC) Acetyl-CoA-Glucosaminide Heparan Sulfate Acetyltransferase Sanfilippo D (MPS IIID) N-Acetylglucosamine-6- Heparan Sulfate Sulfatase Morquio A (MPS IVA) Galactosamine-6-Sulfatase Keratan Sulfate Morquio B (MPS IVB) β-Galactosidase Keratan Sulfate Maroteaux-Lamy (MPS VI) Arylsulfatase B Dermatan Sulfate Sly Syndrome (MPS VII) β-Glucuronidase D. Oligosaccharide/Glycoprotein Disorders α-Mannosidosis α-Mannosidase Mannose/Oligosaccharides β-Mannosidosis β-Mannosidase Mannosc/Oligosaccharides Fucosidosis α-L-Fucosidase Fucosyl Oligosaccharides Aspartylglucosaminuria N-Aspartyl-β- Aspartylglucosamine Glucosaminidase Asparagines Sialidosis (Mucolipidosis I) α-Neuraminidase Sialyloligosaccharides Galactosialidosis (Goldberg Lysosomal Protective Protein Sialyloligosaccharides Syndrome) Deficiency Schindler Disease α-N-Acetyl- Galactosaminidase E. Lysosomal Enzyme Transport Disorders Mucolipidosis II (I-Cell N-Acetylglucosamine-1- Heparan Sulfate Disease) Phosphotransferase Mucolipidosis II (Pseudo- Same as ML II Hurler Polydystrophy) F. Lysosomal Membrane Transport Disorders Cystinosis Cystine Transport Protein Free Cystine Salla Disease Sialic Acid Transport Protein Free Sialic Acid and Glucuronic Acid Infantile Sialic Acid Storage Sialic Acid Transport Protein Free Sialic Acid and Disease Glucuronic Acid G. Other Batten Disease Unknown Lipofuscins (Juvenile Neuronal Ceroid Lipofuscinosis) Infantile Neuronal Ceroid Palmitoyl-Protein Thioesterase Lipofuscins Lipofuscinosis Late Infantile Neuronal Ceroid Tripeptidyl Peptidase I Lipofuscins Lipofuscinosis Mucolipidosis IV Unknown Gangliosides & Hyaluronic Acid Prosaposin Saposins A, B, C or D In some embodiments, a lysosomal enzyme contemplated herein includes a polypeptide sequence having 50-100%, including 50%, 55%, 60%, 65%, 70%, 71%, 72%, 73%, 74%, 75%, 76%, 77%, 78%, 79%, 80%, 81%, 82%, 83%, 84%, 85%, 86%, 87%, 88%, 89%, 90%, 91%, 92%, 93%, 94%, 95%, 96%, 97%, 98%, 99% and 100%, sequence identity to the naturally-occurring polynucleotide sequence of a human enzyme shown in Table 1, while still encoding a protein that is functional, i.e., capable of reducing accumulated materials, e.g., glycosaminoglycan (GAG), in mammalian lysosomes or that can rescue or ameliorate one or more lysosomal storage disease symptoms. “Percent (%) amino acid sequence identity” with respect to the lysosomal enzyme sequences is defined as the percentage of amino acid residues in a candidate sequence that are identical with the amino acid residues in the naturally-occurring human enzyme sequence, after aligning the sequences and introducing gaps, if necessary, to achieve the maximum percent sequence identity, and not considering any conservative substitutions as part of the sequence identity. Alignment for purposes of determining percent amino acid sequence identity can be achieved in various ways that are within the skill in the art, for instance, using publicly available computer software such as BLAST, ALIGN or Megalign (DNASTAR) software. Those skilled in the art can determine appropriate parameters for measuring alignment, including any algorithms needed to achieve maximal alignment over the full length of the sequences being compared. Preferably, the WU-BLAST-2 software is used to determine amino acid sequence identity (Altschul et al., Methods in Enzymology 266, 460-480 (1996). WU-BLAST-2 uses several search parameters, most of which are set to the default values. The adjustable parameters are set with the following values: overlap span=1, overlap fraction=0.125, world threshold (T)=11. HSP score (5) and HSP S2 parameters are dynamic values and are established by the program itself, depending upon the composition of the particular sequence, however, the minimum values may he adjusted and are set as indicated above. Alpha-N-Acetylglucosaminidase Alpha-N-acetylglucosaminidase, Naglu, is produced as a precursor molecule that is processed to a mature form. This process generally occurs by removing the 23 amino acid signal peptide as the protein enters the endoplasmic reticulum. Typically, the precursor form is also referred to as full-length precursor or full-length Naglu protein, which contains 743 amino acids (SEQ ID NO: 1). The N-terminal 23 amino acids are cleaved as the precursor protein enters the endoplasmic reticulum, resulting in a processed or mature form. Thus, it is contemplated that the N-terminal 23 amino acids are generally not required for the Naglu protein activity. The amino acid sequences of the mature form and full-length precursor form of a typical wild-type or naturally-occurring human Naglu protein are shown in FIG. 1 and set out in SEQ ID NO: 1. The nucleotide sequence of the coding region of human Naglu is set out in SEQ ID NO: 3. The mRNA sequence of human Naglu is described in Genbank Accession number NM 000263. In various embodiments, the Naglu is human Naglu, with (amino acids 1-743) or without (amino acids 24-743) signal sequence. U.S. Pat. No. 6,255,096 describes that the molecular weight of purified human alpha-N-acetylglucosaminidase (i.e. 82 kDa and 77 kDa) and recombinant mammalian alpha-N-acetylglucosaminidase produced in CHO cells (i.e. 89 kDa and 79 kDa) are greater than the deduced molecular weight of the Naglu polypeptide (i.e. 70 kDa), suggesting that the purified and recombinant polypeptide are post-translationally modified. See also Weber et al., Hum Mol Genet 5:771-777, 1996. Mucopolysaccharidosis III B (Sanfilippo B Syndrome) One exemplary lysosomal storage disease is Mucopolysaccharidosis III B (MPS IIIB) disease, also known as Sanfilippo Type B Syndrome. MPS IIIB, Sanfilippo B Syndrome, is a rare autosomal recessive genetic disorder that is characterized by a deficiency of the enzyme alpha-N-acetyl-glucosaminidase (Naglu). In the absence of this enzyme, glycosaminoglycans (GAG), for example the GAG heparan sulfate, and partially degraded GAG molecules cannot be cleared from the body and accumulate in lysosomes of various tissues, resulting in progressive widespread somatic dysfunction (Kakkis et al., N Engl J Med. 344(3):182-8, 2001). It has been shown that GAGs accumulate in lysosomes of neurons and glial cells, with lesser accumulation outside the brain. Four distinct forms of MPS III, designated MPS IIIA, B, C, and D, have been identified. Each represents a deficiency in one of four enzymes involved in the degradation of the GAG heparan sulfate (Table 1). All forms include varying degrees of the same clinical symptoms, including coarse facial features, hepatosplenomegaly, corneal clouding and skeletal deformities. Most notably, however, is the severe and progressive loss of cognitive ability, which is tied not only to the accumulation of heparan sulfate in neurons, but also the subsequent elevation of the gangliosides GM2, GM3 and GD2 caused by primary GAG accumulation (Walkley et al., Ann N Y Acad Sci. 845:188-99,1998). A characteristic clinical feature of Sanfilippo B Syndrome is central nervous system (CNS) degeneration, which results in loss of, or failure to attain, major developmental milestones. The progressive cognitive decline culminates in dementia and premature mortality. The disease typically manifests itself in young children, and the lifespan of an affected individual generally does not extend beyond late teens to early twenties. MPS III diseases all have similar symptoms that typically manifest in young children. Affected infants are apparently normal, although some mild facial dysmorphism may be noticeable. The stiff joints, hirsuteness and coarse hair typical of other mucopolysaccharidoses are usually not present until late in the disease. After an initial symptom-free interval, patients usually present with a slowing of development and/or behavioral problems, followed by progressive intellectual decline resulting in severe dementia and progressive motor disease. Acquisition of speech is often slow and incomplete. The disease progresses to increasing behavioral disturbance including temper tantrums, hyperactivity, destructiveness, aggressive behavior, pica and sleep disturbance. As affected children have normal muscle strength and mobility, the behavioral disturbances are very difficult to manage. In the final phase of the illness, children become increasingly immobile and unresponsive, often require wheelchairs, and develop swallowing difficulties and seizures. The life-span of an affected child does not usually extend beyond late teens to early twenties. An alpha-N-acetylglucosaminidase enzyme suitable for treating MPS IIIB (Sanfilippo B Syndrome) includes a wild-type human alpha-N-acetylglucosaminidase (SEQ ID NO: 1 or 3), or a functional fragment or sequence variant thereof which retains the ability to be taken up into mammalian lysosomes and to hydrolyze alpha, 1,4 linkages at the terminal N-acetyl-D-glucosamine residue in linear oligosaccharides. Efficacy of treatment of MPS IIIB (Sanfilippo B Syndrome) using recombinant targeted therapeutic fusion proteins as described herein can be measured using techniques known in the art, as well as by analysis of lysosomal and neuronal biomarkers. Initial experiments are conducted on Naglu knock-out animals (see Li et al., Proc Natl Acad Sci USA 96:14505-510, 1999). Naglu knockouts present with large amounts of heparan sulfate in the liver and kidney and elevation of gangliosides in brain. Assays include analysis of the activity of and biodistribution of the exogenous enzyme, reduction of GAG storage in the lysosomes, particularly in brain cells, and activation of astrocytes and microglia. Levels of various lysosomal or neuronal biomarkers include, but are not limited to, Lysosomal-associated membrane protein 1 (LAMP1), glypican, gangliosides, cholesterol, Subunit c of Mitochondrial ATP Synthase (SCMAS), ubiquitin, P-GSK3b, beta amyloid and P-tau. Survival and behavioral analysis is also performed using techniques known in the field. Experiments have shown that Subunit c of Mitochondrial ATP Synthase (SCMAS) protein accumulates in the lysosomes of MPS IIIB animals (Ryazantsev et al., Mol Genet Metab. 90(4): 393-401, 2007). LAMP-1 and GM130 have also been shown to be elevated in MPS BIB animals (Vitry et al., Am J Pathol. 177(6):2984-99, 2010). In various embodiments, treatment of a lysosomal storage disease refers to decreased lysosomal storage (e.g., of GAG) in various tissues. In various embodiments, treatment refers to decreased lysosomal storage in brain target tissues, spinal cord neurons, and/or peripheral target tissues. In certain embodiments, lysosomal storage is decreased by about 5%, 10%, 15%, 20%, 25%, 30%, 35%, 40%, 45%, 50%, 55%, 60%, 65%, 70%, 75%, 80%, 85%, 90%, 95%, 100% or more as compared to a control. In various embodiments, lysosomal storage is decreased by at least 1-fold, 2-fold, 3-fold, 4-fold, 5-fold, 6-fold, 7-fold, 8-fold, 9-fold, 10-fold or more as compared to a control. In various embodiments, treatment refers to increased enzyme activity in various tissues. In various embodiments, treatment refers to increased enzyme activity in brain target tissues, spinal cord neurons and/or peripheral target tissues. In various embodiments, enzyme activity is increased by about 5%, 10%, 15%, 20%, 25%, 30%, 35%, 40%, 45%, 50%, 55%, 60%, 65%, 70%, 75%, 80%, 85%, 90%, 95%, 100%, 200%, 300%, 400%, 500%, 600%, 700%, 800%, 900% 1000% or more as compared to a control. In various embodiments, enzyme activity is increased by at least 1-fold, 2-fold, 3-fold, 4-fold, 5-fold, 6-fold, 7-fold, 8-fold, 9-fold, 10-fold or more as compared to a control. In various embodiments, increased enzymatic activity is at least approximately 10 nmol/hr/mg, 20 nmol/hr/mg, 40 nmol/hr/mg, 50 nmol/hr/mg, 60 nmol/hr/mg, 70 nmol/hr/mg, 80 nmol/hr/mg, 90 nmol/hr/mg, 100 nmol/hr/mg, 150 nmol/hr/mg, 200 nmol/hr/mg, 250 nmol/hr/mg, 300 nmol/hr/mg, 350 nmol/hr/mg, 400 nmol/hr/mg, 450 nmol/hr/mg, 500 nmol/hr/mg, 550 nmol/hr/mg, 600 nmol/hr/mg or more. In various embodiments, the lysosomal enzyme is Naglu. Enzyme Replacement Therapy Enzyme replacement therapy (ERT) is a therapeutic strategy to correct an enzyme deficiency by infusing the missing enzyme into the bloodstream. As the blood perfuses patient tissues, enzyme is taken up by cells and transported to the lysosome, where the enzyme acts to eliminate material that has accumulated in the lysosomes due to the enzyme deficiency. For lysosomal enzyme replacement therapy to be effective, the therapeutic enzyme must be delivered to lysosomes in the appropriate cells in tissues where the storage defect is manifest. Conventional lysosomal enzyme replacement therapeutics are delivered using carbohydrates naturally attached to the protein to engage specific receptors on the surface of the target cells. One receptor, the cation-independent M6P receptor (CI-MPR), is particularly useful for targeting replacement lysosomal enzymes because the CI-MPR is present on the surface of most cell types. The terms “cation-independent mannose-6-phosphate receptor (CI-MPR),” “M6P/IGF-II receptor,” “CI-MPR/IGF-II receptor,” “IGF-II receptor” or “IGF2 Receptor,” or abbreviations thereof, are used interchangeably herein, referring to the cellular receptor which hinds both M6P and IGF-II. Combination Therapy to Tolerize Subject to Enzyme Replacement Therapy It has been found that during administration of agents such as recombinant proteins and other therapeutic agents, a subject can mount an immune response against these agents, leading to the production of antibodies that bind and interfere with the therapeutic activity as well as cause acute or chronic immunologic reactions. This problem is most significant for protein therapeutics because proteins are complex antigens and in many cases, the subject is immunologically naive to the antigens. Thus, in certain aspects of the present invention, it may be useful to render the subject receiving the therapeutic enzyme tolerant to the enzyme replacement therapy. In this context, the enzyme replacement therapy may be given to the subject as a combination therapy with a tolerizing regimen. U.S. Pat. No. 7,485,314 (incorporated herein by reference) discloses treatment of lysosomal storage disorders using immune tolerance induction. Briefly, use of such a tolerization regimen may be useful to prevent the subject mounting an immune response to the enzyme replacement therapy and thereby decreasing or otherwise rendering ineffective the potential beneficial effects of the enzyme replacement therapy. In one method, the invention contemplates reducing or preventing a clinically significant antigen-specific immune response to recombinant therapeutic fusion protein, for example, comprising Naglu, used to treat a lysosomal storage disorder, for example mucopolysaccharidosis IIIB (MPS IIIB or Sanfilippo B Syndrome), where the fusion protein is administered intrathecally. The method employs an initial 30-60 day regimen of a T-cell immunosuppressive agent such as cyclosporin A (CsA) and an antiproliferative agent, such as, azathioprine (Aza), combined with weekly intrathecal infusions of low doses of the enzyme, e.g., Naglu. The typical strong IgG response to weekly infusions of enzyme becomes greatly reduced or prevented using a 60 day regimen of immunosuppressive drugs, cyclosporin A (CsA) and azathioprine (Aza), combined with weekly intrathecal or intravenous infusions of low doses of fusion protein comprising enzyme. Using such tolerization regimens, it will be possible to render the subject tolerant to higher therapeutic doses of therapeutic fusion protein for up to 6 months without an increase in antibody titer against Naglu, or indeed any other enzyme that could be used for enzyme replacement of a lysosomal storage disease. Such tolerization regimens have been described in U.S. Pat. No. 7,485,314. Glycosylation Independent Lysosomal Targeting A Glycosylation Independent Lysosomal Targeting (GILT) technology was developed to target therapeutic enzymes to lysosomes. Specifically, the GILT technology uses a peptide tag instead of M6P to engage the CI-MPR for lysosomal targeting. Typically, a GILT tag is a protein, peptide, or other moiety that binds the CI-MPR in a mannose-6-phosphate-independent manner. Advantageously, this technology mimics the normal biological mechanism for uptake of lysosomal enzymes, yet does so in a manner independent of mannose-6-phosphate. A preferred GILT tag is derived from human insulin-like growth factor II (IGF-II). Human IGF-II is a high affinity ligand for the CI-MPR, which is also referred to as IGF-II receptor. Binding of GILT-tagged therapeutic enzymes to the M6P/IGF-II receptor targets the protein to the lysosome via the endocytic pathway. This method has numerous advantages over methods involving glycosylation including simplicity and cost effectiveness, because once the protein is isolated, no further modifications need be made. Detailed description of the GILT technology and GILT tag can be found in U.S. Publication Nos. 20030082176, 20040006008, 20040005309, and 20050281805, the teachings of all of which are hereby incorporated by references in their entireties. Furin-Resistant GILT Tag During the course of development of GILT-tagged lysosomal enzymes for treating lysosomal storage disease, it has become apparent that the IGF-II derived GILT tag may be subjected to proteolytic cleavage by furin during production in mammalian cells (see the examples section). Furin protease typically recognizes and cleaves a cleavage site having a consensus sequence Arg-X-X-Arg (SEQ ID NO: 6), X is any amino acid. The cleavage site is positioned after the carboxy-terminal arginine (Arg) residue in the sequence. In some embodiments, a furin cleavage site has a consensus sequence Lys/Arg-X-X-X-Lys/Arg-Arg (SEQ ID NO: 7), X is any amino acid. The cleavage site is positioned after the carboxy-terminal arginine (Arg) residue in the sequence. As used herein, the term “furin” refers to any protease that can recognize and cleave the furin protease cleavage site as defined herein, including furin or furin-like protease. Furin is also known as paired basic amino acid cleaving enzyme (PACE). Furin belongs to the subtilisin-like proprotein convertase family that includes PC3, a protease responsible for maturation of proinsulin in pancreatic islet cells. The gene encoding furin was known as FUR (FES Upstream Region). The mature human IGF-II peptide sequence is shown below. (SEQ ID NO: 5) AYRPSETLCGGELVDTLQFVCGDRGFYFSRPAS RVSR ⬆ RSR ⬆GIVEECCFR SCDLALLETYC ATPAKSE As can be seen, the mature human IGF-II contains two potential overlapping furin cleavage sites between residues 34-40 (bolded and underlined). Arrows are inserted at two potential furin cleavage positions. Modified GILT tags that are resistant to cleavage by furin and still retain ability to bind to the CI-MPR in a mannose-6-phosphate-independent manner are disclosed in US 20110223147. Specifically, furin-resistant GILT tags can be designed by mutating the amino acid sequence at one or more furin cleavage sites such that the mutation abolishes at least one furin cleavage site. Thus, in some embodiments, a furin-resistant GILT tag is a furin-resistant IGF-II mutein containing a mutation that abolishes at least one furin protease cleavage site or changes a sequence adjacent to the furin protease cleavage site such that the furin cleavage is prevented, inhibited, reduced or slowed down as compared to a wild-type IGF-II peptide (e.g., wild-type human mature IGF-II). Typically, a suitable mutation does not impact the ability of the furin-resistant GILT tag to bind to the human cation-independent mannose-6-phosphate receptor. In particular, a furin-resistant IGF-II mutein suitable for the invention binds to the human cation-independent mannose-6-phosphate receptor in a mannose-6-phosphate-independent manner with a dissociation constant of 10−7M or less (e.g., 10−8, 10−9, 10−10, 10−11, or less) at pH 7.4. In some embodiments, a furin-resistant IGF-II mutein contains a mutation within a region corresponding to amino acids 30-40 (e.g., 30-40, 31-40, 32-40, 33-40, 34-40, 30-39, 31-39, 32-39, 34-37, 33-39, 34-39, 35-39, 36-39, 37-40) of mature human IGF-II. In some embodiments, a suitable mutation abolishes at least one furin protease cleavage site. A mutation can be amino acid substitutions, deletions, insertions. For example, any one amino acid within the region corresponding to residues 30-40 (e.g., 30-40, 31-40, 32-40, 33-40, 34-40, 30-39, 31-39, 32-39, 34-37, 33-39, 34-39, 35-39, 36-39, 37-40) of SEQ ID NO:5 can be substituted with any other amino acid or deleted. For example, substitutions at position 34 may affect furin recognition of the first cleavage site. Insertion of one or more additional amino acids within each recognition site may abolish one or both furin cleavage sites. Deletion of one or more of the residues in the degenerate positions may also abolish both furin cleavage sites. In various embodiments, a furin-resistant IGF-II mutein contains amino acid substitutions at positions corresponding to Arg37 or Arg40 of mature human IGF-II. In some embodiments, a furin-resistant IGF-II mutein contains a Lys or Ala substitution at positions Arg37 or Arg40. Other substitutions are possible, including combinations of Lys and/or Ala mutations at both positions 37 and 40, or substitutions of amino acids other than Lys or Ala. In various embodiments, an IGF-II mutein suitable for use herein may contain additional mutations. For example, up to 30% or more of the residues of SEQ ID NO:1 may be changed (e.g., up to 1%, 2%, 3%, 4%, 5%, 6%, 7%, 8%, 9%, 10%, 11%, 12%, 13%, 14%, 15%, 16%, 17%, 18%, 19%, 20%, 21%, 22%, 23%, 24%, 25%, 26%, 27%, 28%, 29%, 30% or more residues may be changed). Thus, an IGF-II mutein suitable for use herein may have an amino acid sequence at least 70%, including at least 70%, 71%, 72%, 73%, 74%, 75%, 76%, 77%, 78%, 79%, 80%, 81%, 82%, 83%, 84%, 85%, 86%, 87%, 88%, 89%, 90%, 91%, 92%, 93%, 94%, 95%, 96%, 97%, 98%, 99%, or more identical to mature human IGF-II. In various embodiments, an IGF-II mutein suitable for use herein is targeted specifically to the CI-MPR. Particularly useful are mutations in the IGF-II polypeptide that result in a protein that binds the CI-MPR with high affinity (e.g., with a dissociation constant of 10−7M or less at pH 7.4) while binding other receptors known to be bound by IGF-II with reduced affinity relative to native IGF-II. For example, a furin-resistant IGF-II mutein suitable for the invention can be modified to have diminished binding affinity for the IGF-I receptor relative to the affinity of naturally-occurring human IGF-II for the IGF-I receptor. For example, substitution of IGF-II residues Tyr 27 with Leu, Leu 43 with Val or Ser 26 with Phe diminishes the affinity of IGF-II for the IGF-I receptor by 94-, 56-, and 4-fold respectively (Torres et al. (1995) J. Mol. Biol, 248(2):385-401). Deletion of residues 1-7 of human IGF-II resulted in a 30-fold decrease in affinity for the human IGF-I receptor and a concomitant 12 fold increase in affinity for the rat IGF-II receptor (Hashimoto et al. (1995) J. Biol. Chem. 270(30):18013-8). The NMR structure of IGF-II shows that Thr-7 is located near residues Phe-48 Phe and Ser-50 as well as near the Cys-9-Cys-47 disulfide bridge. It is thought that interaction of Thr-7 with these residues can stabilize the flexible N-terminal hexapeptide required for IGF-I receptor binding (Terasawa et al. (1994) EMBO J. 13(23)5590-7). At the same time this interaction can modulate binding to the IGF-II receptor. Truncation of the C-terminus of IGF-II (residues 62-67) also appear to lower the affinity of IGF-II for the IGF-I receptor by 5 fold (Roth et al. (1991) Biochem. Biophys. Res. Commun. 181(2):907-14). The binding surfaces for the IGF-I and cation-independent M6P receptors are on separate faces of IGF-II. Based on structural and mutational data, functional cation-independent M6P binding domains can he constructed that are substantially smaller than human IGF-II. For example, the amino terminal amino acids (e.g., 1-7 or 2-7) and/or the carboxy terminal residues 62-67 can be deleted or replaced. Additionally, amino acids 29-40 can likely be eliminated or replaced without altering the folding of the remainder of the polypeptide or binding to the cation-independent M6P receptor. Thus, a targeting moiety including amino acids 8-28 and 41-61 can he constructed. These stretches of amino acids could perhaps he joined directly or separated by a linker. Alternatively, amino acids 8-28 and 41-61 can be provided on separate polypeptide chains. Comparable domains of insulin, which is homologous to IGF-II and has a tertiary structure closely related to the structure of IGF-II, have sufficient structural information to permit proper refolding into the appropriate tertiary structure, even when present in separate polypeptide chains (Wang et al. (1991) Trends Biochem. Sci. 279-281). Thus, for example, amino acids 8-28, or a conservative substitution variant thereof, could he fused to a lysosomal enzyme; the resulting fusion protein could be admixed with amino acids 41-61, or a conservative substitution variant thereof, and administered to a patient. IGF-II can also be modified to minimize binding to serum IGF-binding proteins (Baxter (2000) Am. J. Physiol Endocrinol Metab. 278(6):967-76) to avoid sequestration of IGF-II/GILT constructs. A number of studies have localized residues in IGF-II necessary for binding to IGF-binding proteins. Constructs with mutations at these residues can be screened for retention of high affinity binding to the M6P/IGF-II receptor and for reduced affinity for IGF-binding proteins. For example, replacing Phe-26 of IGF-II with Ser is reported to reduce affinity of IGF-II for IGFBP-1 and -6 with no effect on binding to the M6P/IGF-II receptor (Bach et al. (1993) J. Biol. Chem. 268(13):9246-54). Other substitutions, such as Lys for Glu-9, can also be advantageous. The analogous mutations, separately or in combination, in a region of IGF-I that is highly conserved with IGF-II result in large decreases in IGF-BP binding (Magee et al. 1999) Biochemistry 38(48):15863-70). An alternate approach is to identify minimal regions of IGF-II that can bind with high affinity to the M6P/IGF-II receptor. The residues that have been implicated in IGF-II binding to the M6P/IGF-II receptor mostly cluster on one face of IGF-II (Terasawa et al. (1994) EMBO J. 13(23):5590-7). Although IGF-II tertiary structure is normally maintained by three intramolecular disulfide bonds, a peptide incorporating the amino acid sequence on the M6P/IGF-II receptor binding surface of IGF-II can be designed to fold properly and have binding activity. Such a minimal binding peptide is a highly preferred lysosomal targeting domain. For example, a preferred lysosomal targeting domain is amino acids 8-67 of human IGF-II. Designed peptides, based on the region around amino acids 48-55, which bind to the M6P/IGF-II receptor, are also desirable lysosomal targeting domains. Alternatively, a random library of peptides can be screened for the ability to bind the M6P/IGF-II receptor either via a yeast two hybrid assay, or via a phage display type assay. Binding Affinity for the Insulin Receptor Many IGF-II muteins, including furin-resistant IGF-II muteins, described herein have reduced or diminished binding affinity for the insulin receptor. Thus, in some embodiments, a peptide tag suitable for the invention has reduced or diminished binding affinity for the insulin receptor relative to the affinity of naturally-occurring human IGF-II for the insulin receptor. In some embodiments, peptide tags with reduced or diminished binding affinity for the insulin receptor suitable for the invention include peptide tags having a binding affinity for the insulin receptor that is more than 1.5-fold, 2-fold, 3-fold, 4-fold, 5-fold, 6-fold, 7-fold, 8-fold, 9-fold, 10-fold, 12-fold, 14-fold, 16-fold, 18-fold, 20-fold, 30-fold, 40-fold, 50-fold, 60-fold, 70-fold, 80-fold, 90-fold, or 100-fold less than that of the wild-type mature human IGF-II. The binding affinity for the insulin receptor can be measured using various in vitro and in vivo assays known in the art. Exemplary binding assays are described in the Examples section. Mutagenesis IGF-II muteins can be prepared by introducing appropriate nucleotide changes into the IGF-II DNA, or by synthesis of the desired IGF-II polypeptide. Variations in the IGF-II sequence can be made, for example, using any of the techniques and guidelines for conservative and non-conservative mutations set forth, for instance, in U.S. Pat. No. 5,364,934. Variations may be a substitution, deletion or insertion of one or more codons encoding IGF-II that results in a change in the amino acid sequence of IGF-II as compared with a naturally-occurring sequence of mature human IGF-II. Amino acid substitutions can be the result of replacing one amino acid with another amino acid having similar structural and/or chemical properties, such as the replacement of a leucine with a serine, i.e., conservative amino acid replacements. Amino acid substitutions can also be the result of replacing one amino acid with another amino acid having dis-similar structural and/or chemical properties, i.e., non-conservative amino acid replacements. Insertions or deletions may optionally be in the range of 1 to 5 amino acids. The variation allowed may be determined by systematically making insertions, deletions or substitutions of amino acids in the sequence and testing the resulting variants for activity in the in vivo or in vitro assays known in the art (such as binding assays to the CI-MPR or furin cleavage assays). Scanning amino acid analysis can also be employed to identify one or more amino acids along a contiguous sequence. Among the preferred scanning amino acids are relatively small, neutral amino acids. Such amino acids include alanine, glycine, serine, and cysteine. Alanine is typically a preferred scanning amino acid among this group because it eliminates the side-chain beyond the beta-carbon and is less likely to alter the main-chain conformation of the variant. Alanine is also typically preferred because it is the most common amino acid. Further, it is frequently found in both buried and exposed positions [Creighton, The Proteins, (W. H. Freeman & Co., N.Y.); Chothia, J. Mol. Biol., 150:1 (1976)]. If alanine substitution does not yield adequate amounts of variant, an isoteric amino acid can be used. The variations can be made using methods known in the art such as oligonucleotide-mediated (site-directed) mutagenesis, alanine scanning, and PCR mutagenesis. Site-directed mutagenesis [Carter et al., Nucl. Acids Res., 13:4331 (1986); Zoller et al., Nucl. Acids Res., 10:6487 (1987)], cassette mutagenesis [Wells et al., Gene, 34:315 (1985)], restriction selection mutagenesis [Wells et al., Philos. Trans. R. Soc. London SerA, 317:415 (1986)] or other known techniques can be performed on the cloned DNA to produce IGF-II muteins. Spacer A GILT tag can be fused to the N-terminus or C-terminus of a lysosomal enzyme. The GILT tag can be fused directly to the lysosomal enzyme or can be separated from the lysosomal enzyme by a linker or a spacer. An amino acid linker or spacer is generally designed to be rigid, flexible or to interpose a structure, such as an alpha-helix, between the two protein moieties. A linker or spacer can be relatively short, such as, for example, the sequence Gly-Ala-Pro (GAP) (SEQ ID NO: 9), Gly-Gly-Gly-Gly-Ala (GGGGA) (SEQ ID NO: 60) or Gly-Gly-Gly-Gly-Ser (GGGGS) (SEQ ID NO: 12), or can be longer, such as, for example, 10-25 amino acids in length, 25-50 amino acids in length or 35-55 amino acids in length. The site of a fusion junction should be selected with care to promote proper folding and activity of both fusion partners and to prevent premature separation of a peptide tag from the lysosomal enzyme, e.g., alpha-N-acetylglucosaminidase. In various embodiments, the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences, and optionally further comprises one or more of (i) GAP (SEQ ID NO: 9), (ii) GGGGS (SEQ ID NO: 12), (iii) GGGS (SEQ ID NO: 16), (iv) AAAAS (SEQ ID NO: 17), (v) AAAS (SEQ ID NO: 18), (vi) PAPA (SEQ ID NO: 19), (vii) TPAPA (SEQ ID NO: 20), (viii) AAAKE (SEQ ID NO: 21) or (ix) GGGGA (SEQ ID NO: 60). In various embodiments, the spacer comprises the amino acid sequence GAP (SEQ ID NO: 9), GPS (SEQ ID NO: 10), or GGS (SEQ ID NO: 11). In various embodiments, the spacer peptide comprises one or more GGGGS (SEQ ID NO: 12) or GGGS (SEQ ID NO: 16) amino acid sequences. In various embodiments, the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences. In various embodiments, the spacer peptide comprises one or more AAAAS (SEQ ID NO: 17) or AAAS (SEQ ID NO: 18) amino acid sequences. In various embodiments, the spacer peptide comprises one or more PAPA (SEQ ID NO: 19) or TPAPA (SEQ ID NO: 20) amino acid sequences. In various embodiments, the spacer peptide comprises one or more AAAKE (SEQ ID NO: 21) amino acid sequences. In various embodiments, the spacer peptide comprises one or more GGGGA (SEQ ID NO: 60) amino acid sequences. In various embodiments, the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-OOGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n (SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7. In various embodiments, n is 1 to 4. In various embodiments, the spacer is selected from the group consisting of (SEQ ID NO: 22) EFGGGGSTR, (SEQ ID NO: 9) GAP, (SEQ ID NO: 12) GGGGS, (SEQ ID NO: 23) GPSGSPG, (SEQ ID NO: 24) GPSGSPGT, (SEQ ID NO: 25) GPSGSPGH, (SEQ ID NO: 26) GGGGSGGGGSGGGGSGGGGSGGGPST, (SEQ ID NO: 27) GGGGSGGGGSGGGGSGGGGSGGGPSH, (SEQ ID NO: 28) GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS, (SEQ ID NO: 29) GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP, (SEQ ID NO: 30) GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 31) GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGGSGGGGSGGG PSGA P, (SEQ ID NO: 32) GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS, (SEQ ID NO: 33) GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP, (SEQ ID NO: 34) GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS, (SEQ ID NO: 35) GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P, (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 37) GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP, (SEQ ID NO: 38) GGGGSGGGGSAAAASGGGGSGGGPS, (SEQ ID NO: 39) GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP, (SEQ ID NO: 40) GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS, (SEQ ID NO: 41) GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGG PSG AP, (SEQ ID NO: 42) GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS, (SEQ ID NO: 43) GAPGGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGG PSGA P, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, (SEQ ID NO: 56) GGGGSGGGGSGGGGS, (SEQ ID NO: 57) GAPGGGGSGGGGSGGGGSGAP, (SEQ ID NO: 58) GGGGSGGGGSGGGGSGGGGS, (SEQ ID NO: 59) GAPGGGGSGGGGSGGGGSGGGGSGAP, (SEQ ID NO: 60) GGGGA, (SEQ ID NO: 61) GGGGAGGGGAGGGGAGGGGAGGGPST, (SEQ ID NO: 62) GGGGAGGGGAGGGGAGGGGAGGGPSH, (SEQ ID NO: 63) GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS, (SEQ ID NO: 64) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP, (SEQ ID NO: 65) GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS, (SEQ ID NO: 66) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGG PSGAP, (SEQ ID NO: 67) GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS, (SEQ ID NO: 68) GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGAP, (SEQ ID NO: 69) GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS, (SEQ ID NO: 70) GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGG PSGAP, (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS, (SEQ ID NO: 72) GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP, (SEQ ID NO: 73) GGGGAGGGGAAAAASGGGGAGGGPS, (SEQ ID NO: 74) GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP, (SEQ ID NO: 75) GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS, (SEQ ID NO: 76) GAPGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGG PSGAP, (SEQ ID NO: 77) GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS, (SEQ ID NO: 78) GAPGGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGG PSG AP, (SEQ ID NO: 79) GGGGAGGGGAGGGGA, (SEQ ID NO: 80) GAPGGGGAGGGGAGGGGAGAP, (SEQ ID NO: 81) GGGGAGGGGAGGGGAGGGGA, (SEQ ID NO: 82) GAPGGGGAGGGGAGGGGAGGGGAGAP, (SEQ ID NO: 83) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS], (SEQ ID NO: 84) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH], (SEQ ID NO: 85) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS], (SEQ ID NO: 86) GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH], (SEQ ID NO: 87) GGGGPAPGPGPAPGPAPGPAGGGPS, (SEQ ID NO: 88) GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP, (SEQ ID NO: 89) GGGGPAPAPGPAPAPGPAPAGGGPS, and (SEQ ID NO: 90) GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP. In various embodiments, the spacer is selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPSG AP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. In various embodiments, the spacer is selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. Additional constructs of GILT-tagged alpha-N-acetylglucosaminidase proteins that can be used in the methods and compositions of the present invention were described in detail in U.S. Publication Nos. 20050244400 and 20050281805, the entire disclosures of which is incorporated herein by reference. Cells Any mammalian cell or cell type susceptible to cell culture, and to expression of polypeptides, may be utilized in accordance with the present invention, such as, for example, human embryonic kidney (HEK) 293, Chinese hamster ovary (CHO), monkey kidney (COS), HT1080, C10, HeLa, baby hamster kidney (BHK), 3T3, C127, CV-1, HaK, NS/0, and L-929 cells. Non-limiting examples of mammalian cells that may be used in accordance with the present invention include, but are not limited to, BALB/c mouse myeloma line (NS0/1, ECACC No: 85110503); human retinoblasts (PER.C6 (CruCell, Leiden, The Netherlands)); monkey kidney CV1 line transformed by SV40 (COS-7, ATCC CRL 1651); human embryonic kidney line (293 or 293 cells subcloned for growth in suspension culture, Graham et al., J. Gen Virol., 36:59 (1977)); baby hamster kidney cells (BHK, ATCC CCL 10); Chinese hamster ovary cells+/−DHFR (CHO, Urlaub and Chasin, Proc. Natl. Acad. Sci. USA, 77:4216 (1980)); mouse sertoli cells (TM4, Mather, Biol. Reprod., 23:243-251 (1980)); monkey kidney cells (CV1 ATCC CCL 70); African green monkey kidney cells (VERO-76, ATCC CRL-1 587); human cervical carcinoma cells (HeLa, ATCC CCL 2); canine kidney cells (MDCK, ATCC CCL 34); buffalo rat liver cells (BRL 3A, ATCC CRL 1442); human lung cells (W138, ATCC CCL 75); human liver cells (Hep G2, HB 8065); mouse mammary tumor (MMT 060562, ATCC CCL51); TM cells (Mather et al., Annals N.Y. Acad. Sci., 383:44-68 (1982)); MRC 5 cells; FS4 cells; and a human hepatoma line (Hep G2). In some embodiments, the fusion protein of the present invention is produced from CHO cell lines. The fusion protein of the invention can also he expressed in a variety of non-mammalian host cells such as, for example, insect (e.g., Sf-9, Sf-21, Hi5), plant (e.g., Legurninosa, cereal, or tobacco), yeast (e.g., S. cerevisiae, P. pastoris), prokaryote (e.g., E. Coli, B. subtilis and other Bacillus spp., Pseudomonas spp., Streptomyces spp), or fungus. In some embodiments, a fusion protein with or without a furin-resistant GILT tag can be produced in furin-deficient cells. As used herein, the term “furin-deficient cells” refers to any cells whose furin protease activity is inhibited, reduced or eliminated. Furin-deficient cells include both mammalian and non-mammalian cells that do not produce furin or produce reduced amount or defective furin protease. Exemplary furin deficient cells that are known and available to the skilled artisan, including but not limited to FD11 cells (Gordon et al (1997) Infection and Immunity 65(8):3370 3375), and those mutant cells described in Moebring and Moehring (1983) Infection and Immunity 41(3):998 1009. Alternatively, a furin deficient cell may be obtained by exposing the above-described mammalian and non-mammalian cells to mutagenesis treatment, e.g., irradiation, ethidium bromide, bromidated uridine (BrdU) and others, preferably chemical mutagenesis, and more preferred ethyl methane sulfonate mutagenesis, recovering the cells which survive the treatment and selecting for those cells which are found to be resistant to the toxicity of Pseudomonas exotoxin A (see Moehring and Moehrin (1983) Infection and Immunity 41(3):998 1009). In various embodiments, it is contemplated that certain of the targeted therapeutic proteins comprising a spacer as described herein may exhibit increased expression of active protein when expressed recombinantly compared to targeted therapeutic proteins comprising a different spacer peptide. In various embodiments, it is also contemplated that targeted therapeutic proteins described herein may have increased activity compared to other targeted therapeutic proteins herein. It is contemplated that those targeted therapeutic proteins exhibiting increased expression of active protein and/or having increased activity compared to other targeted therapeutic proteins comprising a different spacer peptide are used for further experimentation. Administration of Therapeutic Proteins In accordance of the invention, a therapeutic protein of the invention is typically administered to the individual alone, or in compositions or medicaments comprising the therapeutic protein (e.g., in the manufacture of a medicament for the treatment of the disease), as described herein. The compositions can be formulated with a physiologically acceptable carrier or excipient to prepare a pharmaceutical composition. The carrier and composition can be sterile. The formulation should suit the mode of administration. Suitable pharmaceutically acceptable carriers include but are not limited to water, salt solutions (e.g., NaCl), saline, buffered saline, alcohols, glycerol, ethanol, gum arabic, vegetable oils, benzyl alcohols, polyethylene glycols, gelatin, carbohydrates such as lactose, amylose or starch, sugars such as mannitol, sucrose, or others, dextrose, magnesium stearate, talc, silicic acid, viscous paraffin, perfume oil, fatty acid esters, hydroxymethylcellulose, polyvinyl pyrolidone, etc., as well as combinations thereof. The pharmaceutical preparations can, if desired, be mixed with auxiliary agents (e.g., lubricants, preservatives, stabilizers, wetting agents, emulsifiers, salts for influencing osmotic pressure, buffers, coloring, flavoring and/or aromatic substances and the like) which do not deleteriously react with the active compounds or interference with their activity. In a preferred embodiment, a water-soluble carrier suitable for intravenous administration is used. The composition or medicament, if desired, can also contain minor amounts of wetting or emulsifying agents, or pH buffering agents. The composition can be a liquid solution, suspension, emulsion, tablet, pill, capsule, sustained release formulation, or powder. The composition can also be formulated as a suppository, with traditional binders and carriers such as triglycerides. Oral formulation can include standard carriers such as pharmaceutical grades of mannitol, lactose, starch, magnesium stearate, polyvinyl pyrollidone, sodium saccharine, cellulose, magnesium carbonate, etc. The composition or medicament can be formulated in accordance with the routine procedures as a pharmaceutical composition adapted for administration to human beings. For example, in a preferred embodiment, a composition for intravenous administration typically is a solution in sterile isotonic aqueous buffer. Where necessary, the composition may also include a solubilizing agent and a local anesthetic to ease pain at the site of the injection. Generally, the ingredients are supplied either separately or mixed together in unit dosage form, for example, as a dry lyophilized powder or water free concentrate in a hermetically sealed container such as an ampule or sachette indicating the quantity of active agent. Where the composition is to be administered by infusion, it can be dispensed with an infusion bottle containing sterile pharmaceutical grade water, saline or dextrose/water. Where the composition is administered by injection, an ampule of sterile water for injection or saline can be provided so that the ingredients may be mixed prior to administration. The therapeutic protein can he formulated as neutral or salt forms. Pharmaceutically acceptable salts include those formed with free amino groups such as those derived from hydrochloric, phosphoric, acetic, oxalic, tartaric acids, etc., and those formed with free carboxyl groups such as those derived from sodium, potassium, ammonium, calcium, ferric hydroxides, isopropylamine, triethyl amine, 2-ethylamino ethanol, histidine, procaine, etc. A therapeutic protein (or a composition or medicament containing a therapeutic protein) is administered by any appropriate route. In various embodiments, a therapeutic protein is administered intravenously. In other embodiments, a therapeutic protein is administered by direct administration to a target tissue, such as heart or muscle (e.g., intramuscular), or nervous system (e.g., direct injection into the brain; intraventricularly; intrathecally). In various embodiments, a therapeutic protein is administered intrathecally. Alternatively, a therapeutic protein (or a composition or medicament containing a therapeutic protein) can be administered parenterally, transdermally, or transmucosally (e.g., orally or nasally). More than one route can be used concurrently, if desired, e.g., a therapeutic protein is administered intravenously and intrathecally. Concurrent intravenous and intrathecal administration need not be simultaneous, but can be sequential. A therapeutic protein (or a composition or medicament containing a therapeutic protein) can be administered alone, or in conjunction with other agents, such as antihistamines (e.g., diphenhydramine) or immunosuppressants or other immunotherapeutic agents which counteract anti-GILT-tagged lysosomal enzyme antibodies. The term, “in conjunction with, “indicates that the agent is administered prior to, at about the same time as, or following the therapeutic protein (or a composition or medicament containing the therapeutic protein). For example, the agent can be mixed into a composition containing the therapeutic protein, and thereby administered contemporaneously with the therapeutic protein; alternatively, the agent can be administered contemporaneously, without mixing (e.g., by “piggybacking” delivery of the agent on the intravenous line by which the therapeutic protein is also administered, or vice versa). In another example, the agent can be administered separately (e.g., not admixed), but within a short time frame (e.g., within 24 hours) of administration of the therapeutic protein. The therapeutic protein (or composition or medicament containing the therapeutic protein) is administered in a therapeutically effective amount (i.e., a dosage amount that, when administered at regular intervals, is sufficient to treat the disease, such as by ameliorating symptoms associated with the disease, preventing or delaying the onset of the disease, and/or also lessening the severity or frequency of symptoms of the disease, as described above). The dose which will be therapeutically effective for the treatment of the disease will depend on the nature and extent of the disease's effects, and can be determined by standard clinical techniques. In addition, in vitro or in vivo assays may optionally be employed to help identify optimal dosage ranges using methods known in the art. The precise dose to be employed will also depend on the route of administration, and the seriousness of the disease, and should be decided according to the judgment of a practitioner and each patient's circumstances. Effective doses may be extrapolated from dose-response curves derived from in vitro or animal model test systems. The therapeutically effective dosage amount can he, for example, about 0.1-1 mg/kg, about 1-5 mg/kg, about 2.5-20 mg/kg, about 5-20 mg/kg, about 20-50 mg/kg, or about 20-100 mg/kg or about 50-200 mg/kg, or about 2.5 to 20 mg/kg of body weight. The effective dose for a particular individual can he varied (e.g., increased or decreased) over time, depending on the needs of the individual. For example, in times of physical illness or stress, or if disease symptoms worsen, the dosage amount can be increased. The therapeutically effective amount of the therapeutic protein (or composition or medicament containing the therapeutic protein) is administered at regular intervals, depending on the nature and extent of the disease's effects, and on an ongoing basis. Administration at an “interval,” as used herein, indicates that the therapeutically effective amount is administered periodically (as distinguished from a one-time dose). The interval can be determined by standard clinical techniques. In some embodiments, the therapeutic protein is administered bimonthly, monthly, twice monthly, triweekly, biweekly, weekly, twice weekly, thrice weekly, or daily. The administration interval for a single individual need not be a fixed interval, but can be varied over time, depending on the needs of the individual. For example, in times of physical illness or stress, or if disease symptoms worsen, the interval between doses can be decreased. As used herein, the term “bimonthly” means administration once per two months (i.e., once every two months); the term “monthly” means administration once per month; the term “triweekly” means administration once per three weeks (i.e., once every three weeks); the term “biweekly” means administration once per two weeks (i.e., once every two weeks); the term “weekly” means administration once per week; and the term “daily” means administration once per day. The disclosure additionally pertains to a pharmaceutical composition comprising a therapeutic protein, as described herein, in a container (e.g., a vial, bottle, bag for intravenous administration, syringe, etc.) with a label containing instructions for administration of the composition for treatment of Mucopolysaccharidosis Type IIIB (Sanfilippo B Syndrome), such as by the methods described herein. Intrathecal Administration of the Pharmaceutically Acceptable Formulations In various embodiments, the enzyme fusion protein is administered by introduction into the central nervous system of the subject, e.g., into the cerebrospinal fluid of the subject. In certain aspects of the invention, the enzyme is introduced intrathecally, e.g., into the lumbar area, or the cistema magna or intraventricularly (or intracerebroventricularly) into a cerebral ventricle space. Methods of administering a lysosomal enzyme intrathecally are described in U.S. Pat. No. 7,442,372, incorporated herein by reference in its entirety. Those of skill in the art are aware of devices that may be used to effect intrathecal administration of a therapeutic composition. For example, the therapy may be given using an Ommaya reservoir which is in common use for intrathecally administering drugs for meningeal carcinomatosis (Ommaya A K, Lancet 2: 983-84, 1963). More specifically, in this method, a ventricular tube is inserted through a hole formed in the anterior horn and is connected to an Ommaya reservoir installed under the scalp, and the reservoir is subcutaneously punctured to intrathecally deliver the particular enzyme being replaced, which is injected into the reservoir. Other devices for intrathecal administration of therapeutic compositions to an individual are described in U.S. Pat. No. 6,217,552, incorporated herein by reference. Alternatively, the composition may be intrathecally given, for example, by a single injection, or continuous infusion. It should be understood that the dosage treatment may be in the form of a single dose administration or multiple doses. As used herein, the term “intrathecal administration” is intended to include delivering a pharmaceutical composition directly into the cerebrospinal fluid of a subject, by techniques including lateral cerebroventricular injection (i.e., intracerebroventricularly) through a burrhole or cistemal or lumbar puncture or the like (described in Lazorthes et al. Advances in Drug Delivery Systems and Applications in Neurosurgery, 143-192 and Omaya et al., Cancer Drug Delivery, 1: 169-179, the contents of which are incorporated herein by reference). The term “lumbar region” is intended to include the area between the third and fourth lumbar (lower back) vertebrae and, more inclusively, the L2-S1 region of the spine. The term “cisterna magna” is intended to include access to the space around and below the cerebellum via the opening between the skull and the top of the spine. The term “cerebral ventricle” is intended to include the cavities in the brain that are continuous with the central canal of the spinal cord. Administration of a pharmaceutical composition in accordance with the present invention to any of the above mentioned sites can be achieved by direct injection of the composition or by the use of infusion pumps. For injection, the composition of the invention can be formulated in liquid solutions, preferably in physiologically compatible buffers such as Hank's solution, Ringer's solution or phosphate buffer. In addition, the enzyme may be formulated in solid form and re-dissolved or suspended immediately prior to use. Lyophilized forms are also included. The injection can be, for example, in the form of a bolus injection or continuous infusion (e.g., using infusion pumps) of the enzyme. In various embodiments of the invention, the enzyme is administered by lateral cerebro ventricular injection into the brain of a subject. The injection can be made, for example, through a burr hole made in the subject's skull. In another embodiment, the enzyme and/or other pharmaceutical formulation is administered through a surgically inserted shunt into the cerebral ventricle of a subject. For example, the injection can be made into the lateral ventricles, which are larger, even though injection into the third and fourth smaller ventricles can also be made. In various embodiments, the pharmaceutical compositions used in the present invention are administered by injection into the cisterna magna, or lumbar area of a subject. In another embodiment of the method of the invention, the pharmaceutically acceptable formulation provides sustained delivery, e.g., “slow release” of the enzyme or other pharmaceutical composition used in the present invention, to a subject for at least one, two, three, four weeks or longer periods of time after the pharmaceutically acceptable formulation is administered to the subject. In various embodiments, a therapeutic fusion protein is delivered to one or more surface or shallow tissues of the brain or spinal cord. For example, in various embodiments, a therapeutic fusion protein is delivered to one or more surface or shallow tissues of the cerebrum or spinal cord. In some embodiments, the targeted surface or shallow tissues of the cerebrum or spinal cord are located within 4 mm from the surface of the cerebrum. In some embodiments, the targeted surface or shallow tissues of the cerebrum are selected from pia mater tissues, cerebral cortical ribbon tissues, hippocampus, Virchow Robin space, blood vessels within the VR space, the hippocampus, portions of the hypothalamus on the inferior surface of the brain, the optic nerves and tracts, the olfactory bulb and projections, and combinations thereof. In some embodiments, a therapeutic fusion protein is delivered to one or more deep tissues of the cerebrum or spinal cord. In some embodiments, the targeted surface or shallow tissues of the cerebrum or spinal cord are located 4 mm (e.g., 5 mm, 6 mm, 7 mm, 8 mm, 9 mm, or 10 mm) below (or internal to) the surface of the cerebrum. In some embodiments, targeted deep tissues of the cerebrum include the cerebral cortical ribbon. In some embodiments, targeted deep tissues of the cerebrum include one or more of the diencephalon (e.g., the hypothalamus, thalamus, prethalamus, subthalamus, etc.), metencephalon, lentiform nuclei, the basal ganglia, caudate, putamen, amygdala, globus pallidus, and combinations thereof. In various embodiments, a targeted surface or shallow tissue of the spinal cord contains pia matter and/or the tracts of white matter. In various embodiments, a targeted deep tissue of the spinal cord contains spinal cord grey matter and/or ependymal cells. In some embodiments, a therapeutic fusion protein is delivered to neurons of the spinal cord. In various embodiments, a therapeutic fusion protein is delivered to one or more tissues of the cerebellum. In certain embodiments, the targeted one or more tissues of the cerebellum are selected from the group consisting of tissues of the molecular layer, tissues of the Purkinje cell layer, tissues of the Granular cell layer, cerebellar peduncles, and combination thereof. In some embodiments, therapeutic agents (e.g., enzymes) are delivered to one or more deep tissues of the cerebellum including, but not limited to, tissues of the Purkinje cell layer, tissues of the Granular cell layer, deep cerebellar white matter tissue (e.g., deep relative to the Granular cell layer), and deep cerebellar nuclei tissue. In various embodiments, a therapeutic fusion protein is delivered to one or more tissues of the brainstem. In some embodiments, the targeted one or more tissues of the brainstem include brain stem white matter tissue and/or brain stem nuclei tissue. In various embodiments, a therapeutic fusion protein is delivered to various brain tissues including, but not limited to, gray matter, white matter, periventricular areas, pia-arachnoid, meninges, neocortex, cerebellum, deep tissues in cerebral cortex, molecular layer, caudate/putamen region, midbrain, deep regions of the pons or medulla, and combinations thereof. In various embodiments, a therapeutic fusion protein is delivered to various cells in the brain including, but not limited to, neurons, glial cells, perivascular cells and/or meningeal cells. In some embodiments, a therapeutic protein is delivered to oligodendrocytes of deep white matter. Kits for Use in the Methods of the Invention The agents utilized in the methods of the invention may be provided in a kit, which kit may further include instructions for use. Such a kit will comprise a fusion protein as described herein comprising an enzyme for use in the treatment of a lysosomal storage disease and a lysosomal targeting moiety, usually in a dose and form suitable for administration to the host. In various embodiments, the kit will usually comprise a device for delivering the enzyme intrathecally. A kit may also be provided for the conjugation of an antigen, particularly a polypeptide antigen, to a high uptake moiety, in order to generate a therapeutic composition. For example, a moiety such as an IGF-II mutein, either conjugated to a linker suitable for linking polypeptides, as described above, may be provided. The high uptake moiety may also be provided in an unconjugated form, in combination with a suitable linker, and instructions for use. Another kit may comprise instructions for the intrathecal administration of the therapeutic compositions of the present invention, in addition to the therapeutic compositions. In certain embodiments, the kits of the invention may comprise catheters or other devices for the intrathecal administration of the enzyme replacement therapy that are preloaded with the therapeutic compositions of the present invention. For example, catheters preloaded with 0.001-0.01 mg, 0.01-0.1 mg, 0.1-1.0 mg, 1.0-10 mg, 10-100 mg, or more of a therapeutic fusion protein comprising a lysosomal enzyme and lysosomal targeting moiety, such as Naglu and IGF-II mutein, in a pharmaceutically acceptable formulation are specifically contemplated. Exemplary catheters may single use catheters that can be discarded after use. Alternatively, the preloaded catheters may be refillable and presented in kits that have appropriate amounts of the enzyme for refilling such catheters. The invention will be further and more specifically described by the following examples. Examples, however, are included for illustration purposes, not for limitation. Example 1—Generation of Spacer Sequences Lysosomal enzymes comprising GILT tags and spacers have been disclosed in US Patent Publication Nos. 20030082176, 20040006008, 20040005309, and 20050281805. Alpha-N-acetylglucosaminidase (Naglu) fusion proteins comprising spacer peptides are disclosed in US Patent Publication No. 201120232021. Additional spacer peptides for use in targeted therapeutic fusion proteins comprising a lysosomal enzyme and a GILT tag were developed as described below. Spacers can be developed to link both IGF-II muteins and furin-resistant IGF-II muteins. Exemplary spacers include the following amino acid sequences: EFGGGGSTR (SEQ ID NO: 22) GAP (SEQ ID NO: 9), GGGGS (SEQ ID NO: 12), GGGGA (SEQ ID NO: 60), GPSGSPG (SEQ ID NO: 23), GPSGSPGT (SEQ ID NO: 24), GPSGSPH (SEQ ID NO: 25), GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71), GGGGSGGGGSGGGGSGGGGSGGGPST (SEQ ID NO: 26), GGGGSGGGGSGGGGSGGGGSGGGPSH (SEQ ID NO: 27), and GGGGAGGGGAGGGGAGGGGAGGGPSH (SEQ ID NO: 62). Constructs comprising a spacer, full-length Naglu (including the signal sequence) and an IGF-II peptide were generated in which the spacer sequence (EFGGGGSTR spacer (SEQ ID NO: 22), GAP spacer (SEQ ID NO: 9), GGGGS spacer (SEQ ID NO: 12), GPSGSPG spacer (SEQ ID NO: 23), or GGGGSGGGGSGGGGSGGGGSGGGPS spacer (SEQ ID NO: 36)) was inserted between full-length Naglu and IGF2 8-67 R37A (SEQ ID NOs: 560-564). Additional linkers were made based on the XTEN method as described in Schellenberger et al. (Nat Biotech 27:1186-1190, 2009). XTEN-like linkers may provide a longer half-life for the generated fusion protein as compared to other linkers. Exemplary spacers have the amino acid sequences GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPSGAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), and GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47). The spacer can be inserted between Naglu and IGF-2 mutein, optionally via the Asc1 sites on the constructs. Protein expression has been associated with the DNA codon used to encode a particular amino acid, e.g., changing the codon for an amino acid can increase expression of the protein without changing the amino acid sequence of the protein (Trinh et al, Mol. Immunol 40:717-722, 2004). Altering the codon encoding the peptide resulted in increased levels of recombinant fusion protein production. Using this technique additional spacer sequences were developed for use in the therapeutic fusion protein with lysosomal enzyme, such as GGGGSGGGGSGGGGS (SEQ ID NO: 56), GAPGGGGSGGGGSGGGGSGAP (SEQ ID NO: 57), GGGGSGGGGSGGGGSGGGGS (SEQ ID NO: 58) and GAPGGGGSGGGGSGGGGSGGGGSGAP (SEQ ID NO: 59). Additional spacer sequences are GGGGAGGGGAGGGGA (SEQ ID NO: 79), GAPGGGGAGGGGAGGGGAGAP (SEQ ID NO: 80), GGGGAGGGGAGGGGAGGGGA (SEQ ID NO: 81) and GAPGGGGAGGGGAGGGGAGGGGAGAP (SEQ ID NO: 82). Any one of these spacers is inserted between Naglu and IGF-II mutein, optionally via the Asc1 sites on the constructs. An exemplary rigid linker which comprises multiple prolines to contribute to rigidity, has the following sequence GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), or GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP (SEQ ID NO: 51), whereas an exemplary helical linker has the following sequence GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), or GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55). Any one of these spacers is inserted between Naglu and IGF-II mutein, optionally via the Asc1 sites on the constructs. Additional spacers can be generated using codon optimization using technology developed by DNA 2.0 (Menlo Park, Calif.). The spacers contemplated include GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS (SEQ ID NO: 32), GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 33), GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS (SEQ ID NO:28), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP (SEQ ID NO: 29), GGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS (SEQ ID NO: 30), GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GAP (SEQ ID NO: 31), GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS (SEQ ID NO: 34), GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P (SEQ ID NO: 35), GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 37), GGGGSGGGGSAAAASGGGGSGGGPS (SEQ ID NO: 38), GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP (SEQ ID NO: 39), GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS (SEQ ID NO: 40), GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPSG AP (SEQ ID NO: 41), GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS (SEQ ID NO: 42), GAP GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGA P (SEQ ID NO: 43), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 67), GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGAP (SEQ ID NO: 68), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS (SEQ ID NO: 63), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP (SEQ ID NO:64), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 65), GAP GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS GAP (SEQ ID NO:66), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 69), GAP GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS GAP (SEQ ID NO: 70), GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP (SEQ ID NO: 72), GGGGAGGGGAAAAASGGGGAGGGPS (SEQ ID NO: 73), GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP (SEQ ID NO: 74), GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS (SEQ ID NO: 75), GAP GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS GAP (SEQ ID NO: 76), GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS (SEQ ID NO: 77), GAP GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPSG AP (SEQ ID NO: 78), GGGGPAPGPGPAPGPAPGPAGGGPS (SEQ ID NO: 87), GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP (SEQ ID NO: 88), GGGGPAPAPGPAPAPGPAPAGGGPS (SEQ ID NO: 89), and GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP (SEQ ID NO: 90). Any one of these spacers is inserted between Naglu and IGF-II mutein, optionally via the Asc1 sites on the constructs. In certain embodiments if the BM-40 extracellular matrix protein signal peptide sequence (Nischt et al., Eur J. Biochem 200:529-536, 1991) is used, the Naglu in the construct does not comprise its own signal peptide sequence. The spacer is inserted between the Naglu sequence and the IGF-II mutein sequence (e.g., TGF2 8-67 R37A). An exemplary BM-40 signal peptide sequence is MRAWIFFLLCLAGRALA (SEQ ID NO: 8). A GAP peptide may be added to the spacer to facilitate cloning and addition of an Asc1 cloning site. In certain embodiments, if the native Naglu signal peptide sequence (Weber et al., Hum Mol Genet. 5:771-777, 1996) is used, the Naglu is full-length Naglu and the spacer is inserted between the full-length Naglu and the IGF-II mutein sequence (e.g., TGF2 8-67 R37A). A GAP peptide may be added to the spacer to facilitate cloning and addition of an Asc1 cloning site. In exemplary constructs, the human Naglu has been “codon optimized” using DNA 2.0 technology. It is contemplated that the Naglu comprises amino acids 1-743 or amino acids 24-743 of human Naglu. In an exemplary construct, the spacer optionally comprises a GAP spacer (Asc1 restriction enzyme site used for cloning) or any of the following sequences: EFGGGGSTR (SEQ ID NO: 22), GAP (SEQ ID NO: 9), GGGGS (SEQ ID NO: 12), GPSGSPG (SEQ ID NO: 23), GPSGSPGT (SEQ ID NO: 24), GPSGSPGH (SEQ ID NO: 25), GGGGSGGGGSGGGGSGGGGSGGGPST (SEQ ID NO: 26), GGGGSGGGGSGGGGSGGGGSGGGPSH (SEQ ID NO: 27), GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS (SEQ ID NO: 28), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP (SEQ ID NO: 29), GGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS (SEQ ID NO: 30), GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GAP (SEQ ID NO: 31), GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS (SEQ ID NO: 32), GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 33), GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS (SEQ ID NO: 34), GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P (SEQ ID NO: 35), GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 37), GGGGSGGGGSAAAASGGGGSGGGPS (SEQ ID NO: 38), GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP (SEQ ID NO: 39), GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS (SEQ ID NO: 40), GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPSG AP (SEQ ID NO: 41), GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS (SEQ ID NO: 42), GAP GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGA P (SEQ ID NO: 43), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP (SEQ ID NO: 51), GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), GGGGSGGGGSGGGGS (SEQ ID NO: 56), GAPGGGGSGGGGSGGGGS GAP (SEQ ID NO: 57), GGGGSGGGGSGGGGSGGGGS (SEQ ID NO: 58), GAPGGGGSGGGGSGGGGSGGGGSGAP (SEQ ID NO: 59), GGGGA (SEQ ID NO: 60), GGGGAGGGGAGGGGAGGGGAGGGPST (SEQ ID NO: 61), GGGGAGGGGAGGGGAGGGGAGGGPSH (SEQ ID NO: 62), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS (SEQ ID NO: 63), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP (SEQ ID NO: 64), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 65), GAP GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS GAP (SEQ ID NO:66), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 67), GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGAP (SEQ ID NO: 68), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 69), GAP GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS GAP (SEQ ID NO: 70), GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP (SEQ ID NO: 72), GGGGAGGGGAAAAASGGGGAGGGPS (SEQ ID NO: 73), GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP (SEQ ID NO: 74), GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS (SEQ ID NO: 75), GAP GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS GAP (SEQ ID NO: 76), GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS (SEQ ID NO: 77), GAP GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPSG AP (SEQ ID NO: 78), GGGGAGGGGAGGGGA (SEQ ID NO: 79), GAPGGGGAGGGGAGGGGAGAP (SEQ ID NO: 80), GGGGAGGGGAGGGGAGGGGA (SEQ ID NO: 81), GAPGGGGAGGGGAGGGGAGGGGAGAP (SEQ ID NO: 82), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS] (SEQ ID NO: 83), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH] (SEQ ID NO: 84), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS] (SEQ ID NO: 85), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH] (SEQ ID NO: 86), GGGGPAPGPGPAPGPAPGPAGGGPS (SEQ ID NO: 87), GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP (SEQ ID NO: 88), GGGGPAPAPGPAPAPGPAPAGGGPS (SEQ ID NO: 89), and GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP (SEQ ID NO: 90). The above spacers are optionally “codon optimized” using DNA 2.0 technology. Any of the IGF-II muteins described herein, which are optionally “codon optimized” using DNA 2.0 technology, are useful in the present constructs. In exemplary constructs, the IGF-II mutein is a furin-resistant IGF-II mutein, IGF2 48-67 R37A. Example 2—Expression and Purification of Constructs Constructs comprising the above spacers, the Naglu enzyme and the IGF-II targeting peptide are made and recombinantly expressed. In certain embodiments, the constructs comprise a signal peptide. Exemplary signal peptides include, for example and not for limitation, the Naglu signal peptide comprising amino acids 1-23 of full-length Naglu (Weber et al., Hum Mol Genet 5:771-777, 1996) or a signal peptide derived from the BM-40 extracellular matrix protein (Nischt et al., Eur J Biochem 200:529-536, 1991). DNA encoding the Naglu sequence, the IGF-II mutein and the spacer peptide are inserted into an appropriate expression vector, such as the pEE and pXC GS expression vectors (Lonza Biologics, Berkshire, UK) and the pC3B (BioMarin, in-house) expression vector. An Asc1 restriction site (ggcgcgcc (SEQ ID NO: 570)) can be inserted into the vector to aid in cloning the therapeutic fusion proteins described herein. An exemplary construct comprises the full-length Naglu sequence (FIG. 1 and FIG. 2), including signal peptide, a spacer peptide (FIG. 3) and an IGF-II peptide comprising residues 8-67 and having an Ala amino acid substitution at residue Arg-37, R37A (FIGS. 1 and 2), that confers furin resistance to the IGF-II peptide. Various linker or spacer sequences described in Example 1, connecting the Naglu and IGF-II peptide, are initially evaluated using a transient expression system. GILT-tagged Naglu plasmids (pXC17.4, Lonza) are transfected into suspension CHOK1SV GS KO cells (Lonza). 15 μg of plasmid DNA is transfected into 106 cells using electroporation. Media is completely exchanged at 24 hours post-transfection. The transfected cells are seeded in shaker flasks at 1.5×106 cells/ml without selection. Cell growth, viability, titer and specific productivity arc determined as the cells are grown at 30° C. for up to 14 days. GILT-tagged Naglu plasmids are transfected into suspension CHOK1SV cells (Lonza). The cells are grown in CDCHO media (Invitrogen) with 6 mM glutamine in shake flasks at 37° C. and 8% CO2. 30 μg of linearized plasmid DNA in 1×107 cells is transfected into the cells using electroporation. The cells are plated at 5000 cells/well in CDCHO media+40 μM MSX 48 hours after transfection. The plates are incubated at 37° C. and 8% CO2 for approximately 4-6 weeks to identify clonal growth. The colonies are then screened by the 4MU activity assay for Naglu (see Example 3) and the highest expressing colonies are transferred to 24 well plates in CDCHO media+40 μM MSX, and then continued to passage the highest expressing clones to 6 well plates, then to shake flasks to identify the highest expressing clones to produce the GILT-tagged Naglu fusion proteins. Purification is carried out using standard protein purification techniques. For example, in an exemplary purification method, starting material of mammalian cell culture supernatant, as described above, is thawed from storage at −80° C. The material is adjusted with NaCl to reach a final concentration of 1M, followed by 0.2 μm sterile filtration. The filtered material is loaded onto a butyl hydrophobic interaction column, pre-equilibrated with butyl load buffer (20 mM Tris, 1 M NaCl, pH 7.5). The bound materials are eluted with a linear gradient over 10 column volumes, using butyl elution buffer (20 mM Tris, pH 7.5). Samples from the elution peaks are pooled, buffer exchanged into 20 mM Tris, pH 7.5, and loaded onto a Q anion exchange column. Bound proteins are then eluted with a linear gradient (10 column volumes) using Q elution buffer (20 mM Tris, 1 M NaCl, pH 7.5). Purified samples are then buffer exchanged using centrifugal spin concentrators and sterile-filtered for storage. Construction, expression, production, purification and formulation of an exemplary Naglu fusion protein: Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568). A DNA construct encoding Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568) was generated by standard recombinant DNA methods. Naglu corresponds to amino acids 1-743 of full-length human Naglu and IGF-II corresponds to the IGF-II mutein comprising amino acids 8-67 of mature human IGF-II with the R37A amino acid substitution that confers furin-resistance. CHOK1SV cells were transfected with the DNA construct, and a stable GILT-tagged Naglu-IGF-II fusion protein expressing clone was isolated as described above. Cells expressing Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568) were grown in a bioreactor, and the Naglu fusion protein was purified from the culture medium as follows. The harvest was salt-adjusted to 1 M NaCl, then loaded onto a Butyl Sepharose 4 FF column. The Naglu fusion protein was salt-eluted from the Butyl Sepharose 4 FF column, collected and dialyzed, and then loaded onto a Heparin Sepharose 6 FF column. The Naglu fusion protein was collected in the flow-through fraction, and loaded onto a Q Sepharose HP column. The Naglu fusion protein was salt-eluted from the Q Sepharose HP column, concentrated, and then polished by preparative Sephacryl 5300 size exclusion chromatography. Using this purification procedure, a highly purified, enzymatically active Naglu fusion protein, Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568), was produced. The purified Naglu fusion protein was formulated at 20 mg/mL in artificial CSF (1 mM sodium phosphate, 148 mM sodium chloride, 3 mM potassium chloride, 0.8 mM magnesium chloride, 1.4 mM calcium chloride, pH 7.2). Construction, expression, production, purification and formulation of exemplary Naglu fusion proteins. DNA constructs encoding Naglu-(GGGGA)4GGGPS-IGF-II (SEQ ID NO: 569), Naglu-Rigid-IGF-II (SEQ ID NO: 566), Naglu-Helical-IGF-II (SEQ ID NO: 567), and Naglu-XTEN-IGF-II (SEQ ID NO: 565) were generated by standard recombinant DNA methods. Naglu corresponds to amino acids 1-743 of full-length human Naglu and IGF-II corresponds to the IGF-II mutein comprising amino acids 8-67 of mature human IGF-II with the R37A amino acid substitution that confers furin-resistance. Exemplary Rigid, Helical and XTEN linkers are described in Example 1. CHOK1SV cells were transfected with the DNA constructs, and stable GILT-tagged Naglu-IGF-II fusion protein expressing clones were isolated as described above. Cells expressing the Naglu-IGF-II fusion proteins were grown in a bioreactor. In typical fed-batch production runs (10-16 days), Naglu-IGF-II constructs with the various linkers all reached titers above 30 mg/L with high cell viability above 80%. The Naglu fusion proteins were purified from the culture medium as described above. Using this purification procedure, enzymatically active untagged Naglu and Naglu-IGF-II fusion proteins, such as Naglu-Rigid-IGF-II (SEQ ID NO: 566), Naglu-Helical-IGF-II (SEQ ID NO: 567), Naglu-XTEN-IGF-II (SEQ ID NO: 565) and Naglu-(GGGGA)4GGGPS-IGF-II (SEQ ID NO: 569), were purified to −99% purity, as determined by reverse-phase HPLC. The purified untagged Naglu and Naglu fusion proteins were formulated at 20 mg/mL in artificial CSF (1 mM sodium phosphate, 148 mM sodium chloride, 3 mM potassium chloride, 0.8 mM magnesium chloride, 1.4 mM calcium chloride, pH 7.2). It is contemplated that fusion proteins as described herein that demonstrate higher levels of recombinant expression of active protein and/or increased enzymatic activity compared to fusion proteins comprising a different spacer peptide may be used in further experimentation, such as activity assays, binding assays, uptake assays and in vivo activity assays as described further below. Example 3—Activity Assays To determine the enzymatic activity of the Naglu fusion proteins, an in vitro Naglu activity assay is carried out using a fluorescent labeled synthetic substrate. Materials used in the assay include: 4-Methylumbelliferyl-N-acetyl-α-D-glucosaminide (4MU-NaGlu Substrate) (Calbiochem, Cat #474500) prepared to final 20 mM concentration in 10% DMSO in the assay buffer (0.2 M Sodium Acetate, with or without 1 mg/ml BSA, and 0.005% Tween 20, pH 4.3-4.8) and stored at −80° C. Stock solution of 4-Methylumbelliferone (4-MU Standard) (Sigma, Cat #M1381) is prepared at 10 mM in DMSO and stored at −20° C. in small aliquots. A rhNaglu-His6 control (0.5 mg/ml, R&D Systems, Cat #7096-GH) is diluted to 10 μg/ml in 25 mM Tris, 125 mM NaCl, 0.001% Tween 20, pH7.5 and stored at −80° C. in small aliquots. On a clear 96 well dilution plate (Granger), 2× serial dilutions of standards in Dilution Buffer (1×PBS, with or without 1 mg/ml BSA, 0.005% Tween 20, pH 7.4 are used, from 200 μM to 1.563 μM plus one blank. On a clear dilution plate, samples are prepared in several dilutions (in Dilution Buffer) to ensure that they are within the standard curve. 10 μl of standards (200 μM to 1.563 control and working samples are transferred to a black non-treated polystyrene 96 well plate (Costar, Cat #3915). 75 μl of substrate (2 mM) is added to each well, followed by incubation for 30 minutes at 37° C. The reaction is then quenched by addition of 200 μl of stop buffer (0.5 M Glycine/NaOH, pH 10.7). The plates are read on an Ex355 Em460 with 455 cut off on a 96-well fluorescent plate reader. Using this assay, exemplary Naglu fusion proteins, including Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568), Naglu-(GGGGA)4GGGPS-IGF-II (SEQ ID NO: 569), Naglu-Rigid-IGF-II (SEQ ID NO: 566), Naglu-Helical-IGF-II (SEQ ID NO: 567), and Naglu-XTEN-IGF-II (SEQ ID NO: 565), were shown to have enzymatic activity in vitro, with specific activities toward the synthetic 4MU-Naglu substrate ranging from 175,000 to 220,000 nmol/hr/mg. The enzymatic activity of the Naglu fusion proteins was comparable to that of the untagged Naglu protein (˜190,000 nmol/hr/mg). Enzymatic activity data for exemplary Naglu fusion proteins is provided in Table 1. TABLE 2 Activity of Naglu Fusion Proteins Naglu1 Linker2 Sp. Act.3 IC50 4 Kuptake5 t1/2 5 Untagged Naglu — 190,000 — — 9.7 Naglu-(GGGGS)4GGGPS- 36 190,000 0.27, 5.4 ND IGF-II 0.23 Naglu-(GGGGA)4GGGPS- 71 220,000 0.36 6.3 ND IGF-II Naglu-Rigid-IGF-II 51 190,000 0.23 2.4 9.5 Naglu-Helical-IGF-II 55 175,000 0.25 2.3 9.4 Naglu-XTEN-IGF-II 47 170,000 0.24 3.7 ND 1Untagged Naglu and Naglu fusion proteins were constructed, expressed and purified as described in Example 2; exemplary Rigid, Helical and XTEN linkers are described in Example 1 2SEQ ID NO: of linkers in the Naglu fusion proteins tested in Examples 3 to 5 3Specific activity (nmol/hr/mg) for Naglu proteins was measured as described in Example 3 4IC50 for Naglu proteins for IGF2R competitive binding was measured as described in Example 4 5Kuptake and half life (t1/2) for Naglu proteins in MPS-IIIB fibroblasts were measured as described in Example 5 Example 4—Binding Assays Binding assays to determine binding of the Naglu fusion proteins to IGF-I, IGF-II and insulin receptors are carried out generally as described in US 20120213762. Briefly, fusion protein constructs are tested for binding affinity for the insulin receptor in an assay measuring the competition of biotinylated insulin binding to plate-bound insulin. An insulin receptor binding assay is conducted by competing insulin, IGF-II, and fusion protein with biotinylated-insulin binding to the insulin receptor (Insulin-R). Specifically, white Reacti-Bind plates are coated with Insulin-R at a concentration of 1 μg/well/100 μl (38.4 nM). The coated plates are incubated over night at room temperature, then washed 3× with washing buffer (300 μl/well). The plates are then blocked with blocking buffer (300 μl/well) for 1 hour. The washing steps are repeated and any trace of solution in the plates taken out. Biotinylated-insulin is mixed at 20 nM with different concentrations of insulin, IGF-II, or fusion protein, by serial dilutions. 100 μl of diluted Insulin, IGF-II, or Naglu fusion protein in 20 nM Insulin-biotin arc added into the coated plates and the plates are incubated at room temperature for 2 hours. The plates are then washed 3 times with washing buffer. 100 μl of strepavidin-HRP working solution (50 μl strepavidin-HRP in 10 ml blocking buffer) is added into the plates and the plates are incubated at room temperature for 30 minutes. 100 μl of Elisa-Pico working solution containing Elisa-Pico chemiluminescent substrate is added and the chemiluminescence is measured at 425 nm. IGF2R Competitive Binding Assay To measure the ability of the Naglu fusion protein constructs to bind to the IGF-II receptor a competitive binding assay is carried out. A fragment of the IGFIIR involved with IGF-II binding (domains 10-13, named protein 1288) is coated onto 96-well plates. Biotinylated IGF-II is incubated with the receptor in the presence of increasing amounts of competitors: either control IGF-II (non-biotinylated), or fusion protein sample (containing an IGF-II-derived GILT epitope tag). Receptor-bound biotinylated IGF-II is detected with streptavidin conjugated to horseradish peroxidase (HRP) and a chemiluminescent HRP substrate. The ability of the fusion protein to inhibit binding of biotinylated IGF-II to the IGFIIR is calculated from inhibition curves and reported as an TC50 value (concentration required to achieve 50% binding inhibition). For the assay, IGFIIR is coated in a white Reacti-bind plate (Pierce, Cat #437111) at 0.5 μg/well in a volume of 100 μl (69.6 nM/per well) in coating buffer. The plate is sealed and incubated overnight at room temperature. The plate is then washed 3× with wash buffer, blocked with blocking buffer and then washed again 3× with wash buffer (300 μl/well). Next, 8 nM IGF-II-biotin is mixed with different concentrations of competitors (IGF-II (non-biotinylated), Reference Protein, or Naglu fusion protein samples, and added into an IGFIIR-coated plate in 2× serial dilutions. The plate is incubated at room temperature for 2 hours, followed by washing the plate 3× with wash buffer. Streptavidin-HRP is prepared in blocking buffer (1:200 dilution), and 100 μ/well added to the plate. IGF-II-Biotin binding activity is detected via streptavidin-HRP using Pico-Elisa reagents. Briefly, the prepared Pico-Elisa working solution is added per well (100 μl/well), and incubated at room temperature for 5 minutes with gentle rocking, then the chemiluminescence at 425 nm is measured. The IC50 of the samples are calculated using the percent IGF-II-Biotin Bound for each concentration of inhibitor. Using this competitive IGFIIR binding assay, an exemplary Naglu fusion proteins, including Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568), Naglu-(GGGGA)4GGGPS-IGF-II (SEQ ID NO: 569), Naglu-Rigid-IGF-II (SEQ ID NO: 566), Naglu-Helical-IGF-II (SEQ ID NO: 567), and Naglu-XTEN-IGF-II (SEQ ID NO: 565), were shown to have an IC50 value of 0.23-0.36 nM. Untagged Naglu protein had no detectable binding in this assay. IGF2R competitive binding data for exemplary Naglu fusion proteins is provided in Table 1. Example 5—Uptake Assays To measure the ability of a Lysosomal Storage Disease enzyme to enter cells via receptor-mediated endocytosis an uptake assay is carried out which measures enzyme uptake using the CI-MPR receptor in rat myoblast L6 cells or in human MPS IIIB fibrobalsts. Mannose-6-phosphate (M6P) and IGF-II are used as inhibitors to determine the site of binding to the CI-MPR receptor. Data is collected to generate a saturation curve for enzyme uptake and determine the kinetic parameter, Kuptake, of the process. Prior to the uptake assay (24 hours), L6 cells (L6 Rat Myoblasts, ATCC #CRL-1458) or human MPS IIIB fibroblasts are plated at a density of 1×105 cells per well in 24-well plates (VWR #62406-183) and seeded 0.5 ml per well. On the morning of assay, enzyme is mixed with uptake media (1 L DMEM, 1.5 g Sodium Bicarbonate. 0.5 g Bovine Serum Albumin, 20 ml of L-glutamine (200 mM (Gibco #25030-081)), 20 ml of 1M of HEPES (Gibco #1563080)) (20 mM final), pH 7.2) in a tissue culture hood. Enzyme amounts may range from 2-500 nM. The final volume of uptake media+enzyme is 0.5 ml per well. M6P (5 mM final concentration) and/or IGF-II (2.4 μM or 18 μg/ml final concentration) are added to appropriate samples. For uptake inhibition, 18 μl IGF-II stock (1 mg/ml, 133.9 μM) is added per mL of uptake media. Growth media is aspirated from cells and 0.450 ml of enzyme in uptake buffer added to each well. Note time and return cells to incubator for 18 hours. Plate is removed from incubator and uptake buffer aspirated off cells. Plates are washed 4× by addition of 0.5 ml Dulbecco's PBS and aspirating off. 200 μl of CelLytic M lysis buffer (Sigma) is added to the plates and shaken at room temperature for 20-30 minutes. Lysate is removed from cells and stored in a tape-covered clear 96-well plate (VWR) at −80° C. until ready to assay. For the enzyme assay, 5 μl of each lysate is added in duplicate by adding to 15 μl of enzyme reaction mix (e.g., Naglu+4MU assays) in black 96-well plate (VWR) (see above) and enzyme/units/ml/hr determined in each lysate. For the lysate protein assay, 10 μI of each lysate in duplicate are assayed using a Pierce BCA protein Assay kit according to manufacturer's instructions. To measure absorbance, absorbance is read at 562 nm with a plate reader (BMG FluoStar Optima Plate reader) and ug/ml concentration determined. For each enzyme load, uptake is units of enzyme activity/mg lysate. To determine uptake, the enzyme units/ml are divided by protein ug/ml and multiplied by 1000 (uptake from blank wells subtracted). Results of the assays with or without inhibitors are compared to determine receptor uptake specificity. For saturation curves, 10 enzyme load concentrations ranging from 0.2-100 nM are used to generate a saturation curve using the assays described above. Using this assay, an exemplary Naglu fusion protein, Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568), was shown to have a Kuptake of 7-9 nM in MPS-IIIB fibroblasts. Alternatively, prior to the uptake assay (24 hours), L6 cells or human MPS IIIB fibroblasts are plated at a density of 1×105 cells per 0.5 ml per well in the 24-well plates. Enzyme samples at 1.6˜50 nM are prepared in uptake media: 1 L DMEM, 1.5 g Sodium Bicarbonate. 0.5 g Bovine Serum Albumin, 20 ml of 200 mM L-glutamine and 20 ml of 1M HEPES, pH7.2. For uptake inhibition, M6P (up to 5.0 mM final) and/or IGF-II (up to 1.0 μM final) are added to appropriate samples. Growth media is aspirated from cells and replaced by 0.5 ml of the enzyme preparation in uptake buffer per well. After 4-hour incubation, plates are washed 2 times with 0.5 ml Dulbecco's PBS. 100 μl of M-PER lysis buffer (Pierce) is added to the plates and shaken at room temperature for 10 minutes. Lysate is stored at −80° C. until ready to assay. For the enzyme assay, 10 μl of each lysate is added in duplicate to the black 96-well plate (see above). For the lysate protein assay, 10 μl of each lysate in duplicate are assayed using a Pierce BCA Protein Assay Kit according to manufacturer's instructions. Absorbance is read at 562 nm with a plate reader (BMG FluoStar Optima Plate reader) and μg/ml concentration determined using BSA as a standard. For each enzyme load, uptake is expressed as nmoles of 4-MU liberated in 30 minutes. For saturation curves, enzyme concentrations ranging from 1.6-50 nM are used to generate a saturation curve using the assays described above. Cellular stability of the Naglu fusion proteins was determined by monitoring intracellular Naglu activity over the period of ˜8 days. Human MPS IIIB fibroblasts plated at a density of 1×105 cells per well in 24-well plates (VWR #62406-183) were treated with Naglu fusion protein at 20 nM final concentration for 4 hours. After 4-hour incubation, cells were switched to growth media without Naglu fusion protein. For each time point (4 hours, 28 hours, 4 days, 6 days & 8 days), cells were lysed in 100 μl of M-PER lysis buffer (Pierce) at room temperature for 10 minutes, and assayed for enzyme activity using a 4-MU labeled substrate. Reduction of Naglu activity over the 8-day sample period can be fit to first-order kinetics to approximate a cellular half-life of the protein. Using this assay, exemplary Naglu fusion proteins, including Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568), Naglu-(GGGGA)4GGGPS-IGF-II (SEQ ID NO: 569), Naglu-Rigid-IGF-II (SEQ ID NO: 566), Naglu-Helical-IGF-II (SEQ ID NO: 567), and Naglu-XTEN-IGF-II (SEQ ID NO: 565), were shown to be internalized into MPS IIIB fibroblasts with Kuptake values of ˜2.3-6.3 nM. Untagged Naglu protein, in contrast, was not taken up by the cells under these experimental conditions. Furthermore, the observed uptake of Naglu fusion protein was inhibited by IGF-II, but not by M6P. After uptake, exemplary Naglu fusion proteins were found to be stable with an estimated half-life of ˜9.5 days, based on enzymatic activity (4-MU substrate) measured in cell lysates. Uptake and half-life data for exemplary Naglu fusion proteins is provided in Table 1. Example 6—In Vivo Naglu Fusion Protein Activity To determine the activity of Naglu fusion proteins in vivo, the fusion proteins are administered to Naglu knock-out animals (see Li et al., Proc Natl Acad Sci USA 96:14505-510, 1999). Naglu knockouts present with large amounts of heparan sulfate in the brain, liver and kidney, increase of beta-hexosaminidase activity and lysosomal-associated membrane protein 2 (LAMP-2) staining in brain, and elevation of gangliosides in brain. Activity and biodistribution of the exogenous enzyme are determined after 4 ICV (intracerebroventricular) injections over a two week period (100 μg/injection) of recombinant human (rh) Naglu-IGF2. A permanent cannulae is implanted in the mouse (n=12/gp, 8-12 wks old at start) and adjusted to cover those mice whose cannulae are not in the ventricle. Endpoint measurements include Naglu biodistribution, reduction of GAG, e.g., heparan sulfate, storage in the lysosomes of brain cells, and activation of astrocytes and microglia. Levels of various lysosomal or neuronal biomarkers (Ohmi et al., PLoS One 6:e27461, 2011) measured in treated and control groups levels include, but are not limited to, Lysosomal-associated membrane protein 1 (LAMP-1), LAMP-2, glypican 5, Naglu-specific non-reducing ends (NREs) of heparan sulfate, gangliosides, cholesterol, Subunit c of Mitochondrial ATP Synthase (SCMAS), ubiquitin, P-GSK3beta, beta amyloid, P-tau (phosphorylated-Tau), GFAP (astrocyte activation) and CD68 (microglial activation). Additional experiments to determine survival and behavioral analysis are carried out using mice receiving 4 ICV injections over a two week period of rhNaglu-IGF2 (n=12/gp, 5 months old at start, 100 μg/injection). Endpoints to be measured include survival time, open field activity, Naglu biodistribution, reduction of GAG, e.g., heparan sulfate, storage in lysosomes, levels of lysosomal or neuronal biomarkers, such as LAMP-1, LAMP-2, glypican 5, gangliosides, cholesterol, SCMAS, ubiquitin, P-GSK3beta, beta amyloid, P-tau, GFAP and CD68. Naglu knockout mice (Naglu −/−) having a mutation in exon 6 of the naglu gene have been developed (Li et al., Proc Natl Acad Sci USA. 96:14505-10, 1999). The exon 6 site was chosen because this is the site of many mutations in humans. No Naglu activity is detected in homozygous mice, and there is reduced Naglu activity in heterozygotes. Naglu −/−mice have reduced survival times (6-12 months), and may have other functional phenotypes like reduced activity levels. The effects of Naglu fusion proteins on the Naglu −/− mice are assayed. Naglu −/− mice (n=8) and 8 vehicle control Naglu −/− mice (n=8 littermate heterozygotes) are administered 4 ICV doses (100 μg Naglu-IGF2/dose) over 2 weeks. At day −2, mice are anesthetized and the left lateral ventricle cannulated. The mice are allowed to recover. At days 1, 5, 10 and 14, mice are anesthetized (Benedryl, 5 mg/kg IP) 15 minutes prior to ICV dose. The ICV dose is infused via cannula, 5 μl volume over 15 minutes, and mice are allowed to recover. On day 15, mice are sacrificed, exsanguinated and serum frozen. Brains are harvested and IR dye is injected into the cannula and the cannula imaged. The following assays are carried out to determine the effects of Naglu fusion proteins: body weight assessment, NIR imaging for cannula placement, assessment of Naglu-IGF2, GFAP, LAMP-1 and LAMP-2 levels in brain using immunohistochemistry, biochemical assay for Naglu activity, P-hexosaminadase levels and activity, SensiPro assay to detect non-reducing ends of accumulated glycosaminoglycans (GAGs) specific for Mucopolysaccharidosis IIIb (MPS-IIIb) (WO 2010/078511A2), GM3 ganglioside levels as measured by biochemical assay, as well as immunostain for SCMAS, A-beta, glypican 5, CD68, GFAP and Naglu in medial entorrhinal cortex (Li et al., supra). Effective treatment with Naglu-IGF2 is expected to result in a decrease in levels of LAMP-1, LAMP-2, GFAP, CD68, SCMAS, A-beta, glypican 5, β-hexosaminadase, GM3 ganglioside, and MPS-IIIb-specific GAGs. In vivo efficacy of exemplary Naglu fusion proteins in a mouse model of MPS IIIb. Four ICV doses (100 μg/dose) of Naglu-IGF-II fusion protein, either Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568) or Naglu-Rigid-IGF-II (SEQ ID NO: 566), were administered over a two week period to Naglu —/− mice (n=8). Naglu —/− mice (n=8) and eight heterozygous or wild-type littermates (n=8) were given vehicle alone as a control. At day −5, mice were anesthetized; the left lateral ventricle of the brain was cannulated. The mice were allowed to recover. On days 1, 5, 10 and 14, mice were anesthetized with inhaled isofluorane. Benadryl (5 mg/kg IP) was administered to each mouse 15 minutes prior to ICV dose to reduce any potential histamine release in response to the Naglu-IGF-II treatment. The ICV dose was infused via the implanted cannula, 5 μl volume over 15-20 minutes, and the mice were allowed to recover. At 1, 7, 14, and 28 days following the final dose, mice were sacrificed. Brains were harvested and divided sagittally into 5 sections for distribution to various assays. The following assays were carried out to determine the effects of Naglu-IGF-II fusion protein: immunohistochemical assessment of Naglu, LAMP-2, GFAP and CD68 levels in brain, biochemical assays for Naglu and beta-hexosaminadase activity, SensiPro assay (Deakin et al., Glycobiology 18:483, 2008; Lawrence et al., Nat Chem Biol. 8:197, 2012; Lawrence et al., J Biol Chem. 283:33674, 2008) to detect total heparan sulfate and NREs of heparan sulfate specific for Mucopolysaccharidosis TIM (MPS-IIIB) (WO 2010/078511A2), and immunofluorescent staining for SCMAS, beta-amyloid (A-beta), p-Tau, P-GSK3beta, glypican 5, GFAP and CD68 in medial entorrhinal cortex (Li et al., supra). When evaluated 24 hours after the final dose, treatment with either Naglu-(GGGGS)4GGGPS-IGF-II (SEQ ID NO: 568) or Naglu-Rigid-IGF-II (SEQ ID NO: 566) fusion protein resulted in a marked increase in Naglu enzyme activity, with a concomitant decrease in beta-hexosaminadase activity and levels of total heparan sulfate, Naglu-specific NREs of heparan sulfate, and LAMP-2. Naglu enzyme was easily detectable in brain tissues, not only in cortex, hippocampus, dentate gyrus and thalamus, but also in remote distal geographic locations, including amygdyla, perirhinal cortex and hypothalamus. Significant decreases in the levels of CD68, SCMAS, beta-amyloid (A-beta), p-Tau, P-GSK3beta, and glypican 5 were also observed in Naglu —/− brains upon treatment with Naglu-IGF-II. GFAP staining did not change by 24 hours post-last-dose. Immunohistochemistry demonstrated the presence of Naglu enzyme in many areas of the brain, inside neurons and glial cells, co-localizing with LAMP-2. Levels of heparan sulfate, Naglu-specific NREs, and beta-hexosaminidase activity continued to decrease over the 7, 14, and 28 days-post-last-dose timepoints. At 28 days, all analytes were at or near the normal mouse control values. EQUIVALENTS Those skilled in the art will recognize, or be able to ascertain using no more than routine experimentation, many equivalents to the specific embodiments of the invention described herein. The scope of the present invention is not intended to be limited to the above Description, but rather is as set forth in the appended claims. The articles “a”, “an”, and “the” as used herein in the specification and in the claims, unless clearly indicated to the contrary, should be understood to include the plural referents. Claims or descriptions that include “or” between one or more members of a group are considered satisfied if one, more than one, or all of the group members are present in, employed in, or otherwise relevant to a given product or process unless indicated to the contrary or otherwise evident from the context. The invention includes embodiments in which exactly one member of the group is present in, employed in, or otherwise relevant to a given product or process. The invention also includes embodiments in which more than one, or all, of the group members are present in, employed in, or otherwise relevant to a given product or process. Furthermore, it is to be understood that the invention encompasses variations, combinations, and permutations in which one or more limitations, elements, clauses, descriptive terms, etc., from one or more of the claims is introduced into another claim dependent on the same base claim (or, as relevant, any other claim) unless otherwise indicated or unless it would be evident to one of ordinary skill in the art that a contradiction or inconsistency would arise. Where elements are presented as lists, e.g., in Markush group or similar format, it is to be understood that each subgroup of the elements is also disclosed, and any element(s) can be removed from the group. It should it be understood that, in general, where the invention, or aspects of the invention, is/are referred to as comprising particular elements, features, etc., certain embodiments of the invention or aspects of the invention consist, or consist essentially of, such elements, features, etc. For purposes of simplicity those embodiments have not in every case been specifically set forth herein. It should also be understood that any embodiment of the invention, e.g., any embodiment found within the prior art, can be explicitly excluded from the claims, regardless of whether the specific exclusion is recited in the specification. It should also be understood that, unless clearly indicated to the contrary, in any methods claimed herein that include more than one act, the order of the acts of the method is not necessarily limited to the order in which the acts of the method are recited, but the invention includes embodiments in which the order is so limited. Furthermore, where the claims recite a composition, the invention encompasses methods of using the composition and methods of making the composition. Where the claims recite a composition, it should be understood that the invention encompasses methods of using the composition and methods of making the composition. All publications and patent documents cited in this application are incorporated by reference in their entirety to the same extent as if the contents of each individual publication or patent document were incorporated herein. What is claimed: 1. A targeted therapeutic fusion protein comprising (a) a lysosomal enzyme, (b) a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and (c) a spacer peptide between the lysosomal enzyme and the IGF-II peptide tag, wherein the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences, and optionally further comprises one or more of (i) GAP (SEQ ID NO: 9), (ii) GGGGS (SEQ ID NO: 12), (iii) GGGS (SEQ ID NO: 16), (iv) AAAAS (SEQ ID NO: 17), (v) AAAS (SEQ ID NO: 18), (vi) PAPA (SEQ ID NO: 19), (vii) TPAPA (SEQ ID NO: 20), (viii) AAAKE (SEQ ID NO: 21) or (ix) GGGGA (SEQ ID NO: 60). 2. The targeted therapeutic fusion protein of claim 1, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-GGGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n (SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7. 3. The targeted therapeutic fusion protein of claim 2, wherein n is 1 to 4. 4. The targeted therapeutic fusion protein of claim 1, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of EFGGGGSTR (SEQ ID NO: 22), GAP (SEQ ID NO: 9), GGGGS (SEQ ID NO: 12), GPSGSPG (SEQ ID NO: 23), GPSGSPGT (SEQ ID NO: 24), GPSGSPGH (SEQ ID NO: 25), GGGGSGGGGSGGGGSGGGGSGGGPST (SEQ ID NO: 26), GGGGSGGGGSGGGGSGGGGSGGGPSH (SEQ ID NO: 27), GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS (SEQ ID NO: 28), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP (SEQ ID NO: 29), GGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS (SEQ ID NO: 30), GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GAP (SEQ ID NO: 31), GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS (SEQ ID NO: 32), GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 33), GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS (SEQ ID NO: 34), GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P (SEQ ID NO: 35), GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 37), GGGGSGGGGSAAAASGGGGSGGGPS (SEQ ID NO: 38), GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP (SEQ ID NO: 39), GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS (SEQ ID NO: 40), GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPSG AP (SEQ ID NO: 41), GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS (SEQ ID NO: 42), GAP GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGA P (SEQ ID NO: 43), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPES GPGTSTEPSEGSAPGSPAGSPGPS GAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP (SEQ ID NO: 51), GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), GGGGSGGGGSGGGGS (SEQ ID NO: 56), GAPGGGGSGGGGSGGGGS GAP (SEQ ID NO: 57), GGGGSGGGGSGGGGSGGGGS (SEQ ID NO: 58), GAPGGGGSGGGGSGGGGSGGGGSGAP (SEQ ID NO: 59), GGGGA (SEQ ID NO: 60), GGGGAGGGGAGGGGAGGGGAGGGPST (SEQ ID NO: 61), GGGGAGGGGAGGGGAGGGGAGGGPSH (SEQ ID NO: 62), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS (SEQ ID NO: 63), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP (SEQ ID NO: 64), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 65), GAP GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS GAP (SEQ ID NO:66), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 67), GAPGGGGAGGGGAGGGGAGGGPS GGGGAGGGGAGGGPS GAP (SEQ ID NO: 68), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 69), GAP GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS GAP (SEQ ID NO: 70), GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP (SEQ ID NO: 72), GGGGAGGGGAAAAASGGGGAGGGPS (SEQ ID NO: 73), GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP (SEQ ID NO: 74), GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS (SEQ ID NO: 75), GAP GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS GAP (SEQ ID NO: 76), GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS (SEQ ID NO: 77), GAPGGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPSG AP (SEQ ID NO: 78), GGGGAGGGGAGGGGA (SEQ ID NO: 79), GAPGGGGAGGGGAGGGGAGAP (SEQ ID NO: 80), GGGGAGGGGAGGGGAGGGGA (SEQ ID NO: 81), GAPGGGGAGGGGAGGGGAGGGGAGAP (SEQ ID NO: 82), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS] (SEQ ID NO: 83), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH] (SEQ ID NO: 84), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS] (SEQ ID NO: 85), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH] (SEQ ID NO: 86), GGGGPAPGPGPAPGPAPGPAGGGPS (SEQ ID NO: 87), GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP (SEQ ID NO: 88), GGGGPAPAPGPAPAPGPAPAGGGPS (SEQ ID NO: 89), and GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP (SEQ ID NO: 90). 5. The targeted therapeutic fusion protein of claim 4, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPSG AP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. 6. The targeted therapeutic fusion protein of claim 5, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. 7. A targeted therapeutic fusion protein comprising an amino acid sequence at least 85% identical to a human α-N-acetylglucosaminidase (Naglu) protein, a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and a spacer peptide located between the Naglu amino acid sequence and the IGF-II peptide tag, wherein the spacer comprises the amino acid sequence GAP (SEQ ID NO: 9), GPS (SEQ ID NO: 10), or GGS (SEQ ID NO: 11). 8. The targeted therapeutic fusion protein of claim 7, wherein the spacer sequence comprises amino acids Gly-Pro-Ser (GPS) (SEQ ID NO: 10) between the amino acids of mature human IGF-II and the amino acids of human Naglu. 9. The targeted therapeutic fusion protein of any of claims 7 to 8, wherein the spacer peptide comprises one or more GGGGS (SEQ ID NO: 12), GGGGA (SEQ ID NO: 60) or GGGS (SEQ ID NO: 16) amino acid sequences. 10. The targeted therapeutic fusion protein of any of claims 7 to 9, wherein the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences. 11. The targeted therapeutic fusion protein of any of claims 7 to 10, wherein the spacer peptide comprises one or more AAAAS (SEQ ID NO: 17) or AAAS (SEQ ID NO: 18) amino acid sequences. 12. The targeted therapeutic fusion protein of any of claims 7 to 11, wherein the spacer peptide comprises one or more PAPA (SEQ ID NO: 19) or TPAPA (SEQ ID NO: 20) amino acid sequences. 13. The targeted therapeutic fusion protein of any of claims 7 to 12, wherein the spacer peptide comprises one or more AAAKE (SEQ ID NO: 21) amino acid sequences. 14. The targeted therapeutic fusion protein of any of claims 7 to 8, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-GGGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n (SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7. 15. The targeted therapeutic fusion protein of claim 14, wherein n is 1 to 4. 16. The targeted therapeutic fusion protein of claim 7, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of EFGGGGSTR (SEQ ID NO: 22), GAP (SEQ ID NO: 9), GGGGS (SEQ ID NO: 12), GPSGSPG (SEQ ID NO: 23), GPSGSPGT (SEQ ID NO: 24), GPSGSPGH (SEQ ID NO: 25), GGGGSGGGGSGGGGSGGGGSGGGPST (SEQ ID NO: 26), GGGGSGGGGSGGGGSGGGGSGGGPSH (SEQ ID NO: 27), GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS (SEQ ID NO: 28), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP (SEQ ID NO: 29), GGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS (SEQ ID NO: 30), GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GAP (SEQ ID NO: 31), GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS (SEQ ID NO: 32), GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 33), GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS (SEQ ID NO: 34), GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P (SEQ ID NO: 35), GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 37), GGGGSGGGGSAAAASGGGGSGGGPS (SEQ ID NO: 38), GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP (SEQ ID NO: 39), GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS (SEQ ID NO: 40), GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPSG AP (SEQ ID NO: 41), GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS (SEQ ID NO: 42), GAP GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGA P (SEQ ID NO: 43), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP (SEQ ID NO: 51), GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), GGGGSGGGGSGGGGS (SEQ ID NO: 56), GAPGGGGSGGGGSGGGGSGAP (SEQ ID NO: 57), GGGGSGGGGSGGGGSGGGGS (SEQ ID NO: 58), GAPGGGGSGGGGSGGGGSGGGGSGAP (SEQ ID NO: 59), GGGGA (SEQ ID NO: 60), GGGGAGGGGAGGGGAGGGGAGGGPST (SEQ ID NO: 61), GGGGAGGGGAGGGGAGGGGAGGGPSH (SEQ ID NO: 62), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS (SEQ ID NO: 63), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP (SEQ ID NO: 64), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 65), GAP GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS GAP (SEQ ID NO:66), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 67), GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGAP (SEQ ID NO: 68), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 69), GAP GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS GAP (SEQ ID NO: 70), GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP (SEQ ID NO: 72), GGGGAGGGGAAAAASGGGGAGGGPS (SEQ ID NO: 73), GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP (SEQ ID NO: 74), GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS (SEQ ID NO: 75), GAP GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS GAP (SEQ ID NO: 76), GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS (SEQ ID NO: 77), GAPGGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPSG AP (SEQ ID NO: 78), GGGGAGGGGAGGGGA (SEQ ID NO: 79), GAPGGGGAGGGGAGGGGAGAP (SEQ ID NO: 80), GGGGAGGGGAGGGGAGGGGA (SEQ ID NO: 81), GAPGGGGAGGGGAGGGGAGGGGAGAP (SEQ ID NO: 82), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS] (SEQ ID NO: 83), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH] (SEQ ID NO: 84), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS] (SEQ ID NO: 85), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH] (SEQ ID NO: 86), GGGGPAPGPGPAPGPAPGPAGGGPS (SEQ ID NO: 87), GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP (SEQ ID NO: 88), GGGGPAPAPGPAPAPGPAPAGGGPS (SEQ ID NO: 89), and GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP (SEQ ID NO: 90). 17. The targeted therapeutic fusion protein of claim 16, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 44) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS, (SEQ ID NO: 45) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP, (SEQ ID NO: 46) GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 48) GGGSPAPTPTPAPTPAPTPAGGGPS, (SEQ ID NO: 49) GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP, (SEQ ID NO: 50) GGGSPAPAPTPAPAPTPAPAGGGPS, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 52) GGGSAEAAAKEAAAKEAAAKAGGPS, (SEQ ID NO: 53) GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP, (SEQ ID NO: 54) GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. 18. The targeted therapeutic fusion protein of claim 17, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of (SEQ ID NO: 36) GGGGSGGGGSGGGGSGGGGSGGGPS, (SEQ ID NO: 47) GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTG PSGAP, (SEQ ID NO: 51) GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP, (SEQ ID NO: 55) GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP, and (SEQ ID NO: 71) GGGGAGGGGAGGGGAGGGGAGGGPS. 19. The targeted therapeutic fusion protein of any one of the preceding claims, wherein the peptide tag is an N-terminal tag or a C-terminal tag. 20. The targeted therapeutic fusion protein of claim 19, wherein the peptide tag is a C-terminal tag. 21. The targeted therapeutic fusion protein of any one of the preceding claims, wherein the spacer comprises a Gly-Ala-Pro (GAP) (SEQ ID NO: 9) or Gly-Pro-Ser (GPS) (SEQ ID NO: 10) amino acid sequence. 22. The targeted therapeutic fusion protein of any one of the preceding claims, wherein the lysosomal targeting domain comprises amino acids 8-67 of mature human IGF-II. 23. The targeted therapeutic fusion protein of any one of the preceding claims, wherein the spacer comprises an alpha-helical structure or a rigid structure. 24. The targeted therapeutic fusion protein of any one of the preceding claims, wherein the IGF-II peptide tag comprises a mutation at residue Arg37. 25. The targeted therapeutic fusion protein of claim 23, wherein the mutation is a substitution of alanine for arginine. 26. The targeted therapeutic fusion protein of any one of the preceding claims, further comprising a pharmaceutically acceptable carrier, diluent or excipient. 27. A pharmaceutical composition suitable for treating lysosomal storage disease comprising a targeted therapeutic fusion protein of any one of the preceding claims. 28. A nucleic acid encoding the targeted therapeutic fusion protein of any one of the preceding claims. 29. A cell containing the nucleic acid of claim 27. 30. A method of producing a targeted therapeutic fusion protein comprising a step of: culturing mammalian cells in a cell culture medium, wherein the mammalian cells carry the nucleic acid of claim 28; and the culturing is performed under conditions that permit expression of the targeted therapeutic fusion protein. 31. A method for treating a lysosomal storage disease in a subject comprising administering to the subject a therapeutically effective amount of a pharmaceutical composition comprising a fusion protein comprising a lysosomal enzyme, a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and a spacer peptide located between the lysosomal enzyme amino acid sequence and the IGF-II peptide tag, wherein the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences, and optionally further comprises one or more of (i) GAP (SEQ ID NO: 9), (ii) GGGGS (SEQ ID NO: 12), (iii) GGGS (SEQ ID NO: 16), (iv) AAAAS (SEQ ID NO: 17), (v) AAAS (SEQ ID NO: 18), (vi) PAPA (SEQ ID NO: 19), (vii) TPAPA (SEQ ID NO: 20), (viii) AAAKE (SEQ ID NO: 21) or (ix) GGGGA (SEQ ID NO: 60). 32. The method of claim 31, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-GGGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n (SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7. 33. The method of claim 32, wherein n is 1 to 4. 34. A method for treating Mucopolysaccharidosis Type IIIB (Sanfilippo B Syndrome) in a subject comprising administering to the subject a therapeutically effective amount of a pharmaceutical composition comprising a fusion protein comprising an amino acid sequence at least 85% identical to a human α-N-acetylglucosaminidase (Naglu) protein, a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II and a spacer peptide located between the Naglu amino acid sequence and the IGF-II peptide tag, wherein the spacer comprises the amino acid sequence GAP (SEQ ID NO: 9), GPS (SEQ ID NO: 10), or GGS (SEQ ID NO: 11). 35. The method of claim 34, wherein the spacer sequence comprises amino acids Gly-Pro-Ser (GPS) (SEQ ID NO: 10) between the amino acids of mature human IGF-II and the amino acids of human Naglu. 36. The method of any of claims 34 to 35, wherein the spacer peptide comprises one or more GGGGS (SEQ ID NO: 12), GGGGA (SEQ ID NO: 60) or GGGS (SEQ ID NO: 16) amino acid sequences. 37. The method of any of claims 34 to 36, wherein the spacer peptide comprises one or more GGGPS (SEQ ID NO: 14) or GGGSP (SEQ ID NO: 15) amino acid sequences. 38. The method of any of claims 34 to 37, wherein the spacer peptide comprises one or more AAAAS (SEQ ID NO: 17) or AAAS (SEQ ID NO: 18) amino acid sequences. 39. The method of any of claims 34 to 38, wherein the spacer peptide comprises one or more PAPA (SEQ ID NO: 19) or TPAPA (SEQ ID NO: 20) amino acid sequences. 40. The method of any of claims 34 to 39, wherein the spacer peptide comprises one or more AAAKE (SEQ ID NO: 21) amino acid sequences. 41. The method of any of claim 31 or 34, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of: (GGGGS)n (SEQ ID NOs: 12, 56, 58, 91-94), (GGGGS)n-GGGPS (SEQ ID NOs: 36, 95-100), GAP-(GGGGS)n-GGGPS (SEQ ID NOs: 101-107), GAP-(GGGGS)n-GGGPS-GAP (SEQ ID NOs: 37, 108-113), GAP-(GGGGS)n-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 114-162), GAP-GGGPS-(GGGGS)n-GAP (SEQ ID NOs: 163-169), GAP-(GGGGS)n-AAAAS-GGGPS-(GGGGS)n-AAAA-GAP (SEQ ID NOs: 170-218), GAP-(GGGGS)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 219-267), GAP-(GGGGS)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 268-316), GAP-(GGGGS)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGS)n-GAP (SEQ ID NOs: 544-551), (GGGGA)n (SEQ ID NOs: 60, 79, 81, 317-320), (GGGGA)n-GGGPS (SEQ ID NOs: 321-326), GAP-(GGGGA)n-GGGPS (SEQ ID NOs: 327-333), GAP-(GGGGA)n-GGGPS-GAP (SEQ ID NOs: 334-340), GAP-(GGGGA)n-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 341-389), GAP-GGGPS-(GGGGA)n-GAP (SEQ ID NOs: 390-396), GAP-(GGGGA)n-AAAAS-GGGPS-(GGGGA)n-AAAA-GAP (SEQ ID NOs: 397-445), GAP-(GGGGA)n-PAPAP-(Xaa)n-GAP (SEQ ID NOs: 446-494), GAP-(GGGGA)n-PAPAPT-(Xaa)n-GAP (SEQ ID NOs: 495-543), GAP-(GGGGA)n-(Xaa)n-PAPAP-(Xaa)n-(AAAKE)n-(Xaa)n-(GGGGA)n-GAP (SEQ ID NOs: 552-559); wherein n is 1 to 7. 42. The method of claim 41 wherein n is 1 to 4. 43. A method for reducing glycosaminoglycan levels in vivo comprising administering to a subject suffering from Mucopolysaccharidosis Type IIIB (Sanfilippo B Syndrome) an effective amount of a fusion protein comprising i) an amino acid sequence at least 85% identical to a human α-N-acetylglucosaminidase (Naglu) protein, ii) a peptide tag having an amino acid sequence at least 70% identical to amino acids 8-67 of mature human IGF-II, and iii) a spacer peptide located between the Naglu amino acid sequence and the IGF-II peptide tag. 44. The method of any one of claim 31, 34 or 43, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of EFGGGGSTR (SEQ ID NO: 22), GAP (SEQ ID NO: 9), GGGGS (SEQ ID NO: 12), GPSGSPG (SEQ ID NO: 23), GPSGSPGT (SEQ ID NO: 24), GPSGSPGH (SEQ ID NO: 25), GGGGSGGGGSGGGGSGGGGSGGGPST (SEQ ID NO: 26), GGGGSGGGGSGGGGSGGGGSGGGPSH (SEQ ID NO: 27), GGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPS (SEQ ID NO: 28), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGGGGSGGGPSGAP (SEQ ID NO: 29), GGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS (SEQ ID NO: 30), GAPGGGGS GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGGS GGGGS GGGPS GAP (SEQ ID NO: 31), GGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPS (SEQ ID NO: 32), GAPGGGGSGGGGSGGGGSGGGPSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 33), GGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS (SEQ ID NO: 34), GAPGGGGS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GGGGS GGGGS GGGPS GA P (SEQ ID NO: 35), GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGGGSGGGGSGGGGSGGGGSGGGPSGAP (SEQ ID NO: 37), GGGGSGGGGSAAAASGGGGSGGGPS (SEQ ID NO: 38), GAPGGGGSGGGGSAAAASGGGGSGGGPSGAP (SEQ ID NO: 39), GGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPS (SEQ ID NO: 40), GAPGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGGSGGGGSAAAASGGGPSG AP (SEQ ID NO: 41), GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPS (SEQ ID NO: 42), GAP GGGGSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGGGGSAAAASGGGPSGA P (SEQ ID NO: 43), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS GAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), GAPGGGSPAPAPTPAPAPTPAPAGGGPS GAP (SEQ ID NO: 51), GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), GGGGSGGGGSGGGGS (SEQ ID NO: 56), GAPGGGGSGGGGSGGGGS GAP (SEQ ID NO: 57), GGGGSGGGGSGGGGSGGGGS (SEQ ID NO: 58), GAPGGGGSGGGGSGGGGSGGGGSGAP (SEQ ID NO: 59), GGGGA (SEQ ID NO: 60), GGGGAGGGGAGGGGAGGGGAGGGPST (SEQ ID NO: 61), GGGGAGGGGAGGGGAGGGGAGGGPSH (SEQ ID NO: 62), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPS (SEQ ID NO: 63), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGPSGAP (SEQ ID NO: 64), GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 65), GAP GGGGAGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGGAGGGGAGGGPS GAP (SEQ ID NO:66), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 67), GAPGGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGAP (SEQ ID NO: 68), GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS (SEQ ID NO: 69), GAP GGGGAGGGGAGGGGAGGGPSGGGGAGGGGAGGGPSGGGGAGGGGAGGGPS GAP (SEQ ID NO: 70), GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71), GAPGGGGAGGGGAGGGGAGGGGAGGGPSGAP (SEQ ID NO: 72), GGGGAGGGGAAAAASGGGGAGGGPS (SEQ ID NO: 73), GAPGGGGAGGGGAAAAASGGGGAGGGPSGAP (SEQ ID NO: 74), GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS (SEQ ID NO: 75), GAP GGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGGAGGGGAAAAASGGGPS GAP (SEQ ID NO: 76), GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPS (SEQ ID NO: 77), GAP GGGGAGGGGAAAAASGGGPSGGGGAAAAASGGGPSGGGGAAAAASGGGPSG AP (SEQ ID NO: 78), GGGGAGGGGAGGGGA (SEQ ID NO: 79), GAPGGGGAGGGGAGGGGAGAP (SEQ ID NO: 80), GGGGAGGGGAGGGGAGGGGA (SEQ ID NO: 81), GAPGGGGAGGGGAGGGGAGGGGAGAP (SEQ ID NO: 82), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)8GGGPS] (SEQ ID NO: 83), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)8GGGPSH] (SEQ ID NO: 84), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPS [or (GGGGA)9GGGPS] (SEQ ID NO: 85), GGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGGAGGGPSH [or (GGGGA)9GGGPSH] (SEQ ID NO: 86), GGGGPAPGPGPAPGPAPGPAGGGPS (SEQ ID NO: 87), GAPGGGGPAPGPGPAPGPAPGPAGGGPGGAP (SEQ ID NO: 88), GGGGPAPAPGPAPAPGPAPAGGGPS (SEQ ID NO: 89), and GAPGGGGPAPAPGPAPAPGPAPAGGGPGGAP (SEQ ID NO: 90). 45. The method of claim 44, wherein the spacer comprises an amino acid sequence selected from the group consisting of GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPS (SEQ ID NO: 44), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPGPSGAP (SEQ ID NO: 45), GGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPS (SEQ ID NO: 46), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GGGSPAPTPTPAPTPAPTPAGGGPS (SEQ ID NO: 48), GAPGGGSPAPTPTPAPTPAPTPAGGGPSGAP (SEQ ID NO: 49), GGGSPAPAPTPAPAPTPAPAGGGPS (SEQ ID NO: 50), GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP (SEQ ID NO: 51), GGGSAEAAAKEAAAKEAAAKAGGPS (SEQ ID NO: 52), GAPGGGSAEAAAKEAAAKEAAAKAGGPSGAP (SEQ ID NO: 53), GGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGG (SEQ ID NO: 54), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), and GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71). 46. The method of claim 45, wherein the spacer peptide comprises an amino acid sequence selected from the group consisting of GGGGSGGGGSGGGGSGGGGSGGGPS (SEQ ID NO: 36), GAPGGSPAGSPTSTEEGTSESATPESGPGTSTEPSEGSAPGSPAGSPTSTGPSGAP (SEQ ID NO: 47), GAPGGGSPAPAPTPAPAPTPAPAGGGPSGAP (SEQ ID NO: 51), GAPGGGSPAEAAAKEAAAKEAAAKEAAAKEAAAKAPSGGGGAP (SEQ ID NO: 55), and GGGGAGGGGAGGGGAGGGGAGGGPS (SEQ ID NO: 71). 47. The method of any one of claims 31 to 46, wherein the spacer sequence comprises amino acids Gly-Ala-Pro (GAP) (SEQ ID NO: 9) sequence. 48. The method of any one of claims 31 to 47, wherein the peptide tag is an N-terminal tag or a C-terminal tag. 49. The method of claim 48, wherein the peptide tag is a C-terminal tag. 50. The method of any one of claims 31 to 49, wherein the spacer comprises an alpha-helical structure or a rigid structure. 51. The method of any one of claims 31 to 50, wherein the lysosomal targeting domain comprises amino acids 8-67 of mature human IGF-II. 52. The method of any one of claims 31 to 51, wherein the IGF-II peptide tag comprises a mutation at residue Arg37. 53. The method of claim 52, wherein the mutation is a substitution of alanine for arginine. 54. The method of any one of claims 31 to 53, wherein the fusion protein comprises amino acids 1-743 or amino acids 24-743 of human Naglu (FIG. 1). 55. The method of any one of claims 31 to 54, wherein the effective amount is in the range of 2.5-20 mg per kilogram of body weight of the subject. 56. The method of any one of claims 31 to 55, wherein the fusion protein is administered intrathecally, optionally further comprising administering the fusion protein intravenously. 57. The method of claim 56, wherein the administering comprises introducing the fusion protein into a cerebral ventricle, lumbar area, or cisterna magna. 58. The method of any one of claims 31 to 55, wherein the fusion protein is administered intravenously. 59. The method of any one of claims 31 to 58, wherein the fusion protein is administered bimonthly, monthly, triweekly, biweekly, weekly, daily, or at variable intervals. 60. The method of any one of claims 31 to 59, wherein the treatment results in reducing glycosaminoglycan (GAG) levels in a brain tissue. 61. The method of any one of claims 31 to 60, wherein the treatment results in reducing lysosomal storage granules in a brain tissue.

2022-01-10

en

2022-04-28

US-201313902218-A

Bonding clip ABSTRACT The disclosure relates to a bonding clip for making an electrical connection between metal pieces. FIELD OF THE DISCLOSURE The present disclosure generally relates to a bonding clip for making an electrical connection in the joining of at least two metal pieces (e.g., two, three, four, or more, metal pieces). BACKGROUND OF THE DISCLOSURE During the installation of a photovoltaic array composed of one or more photovoltaic modules, or solar panels, the arrays are installed onto a mounting structure. The individual photovoltaic modules typically have frames and structural mounting pieces which are generally made of anodized aluminum. The anodizing resists corrosion while also insulating the individual photovoltaic modules, preventing an electrical connection. In order to complete the electrical connection, the metal pieces must be bonded together, that is, joined thereby forming an electrically conductive path which ensures electrical continuity and safely conducts any imposed current. A need exists for improved devices for providing such electrical conductivity. SUMMARY OF THE DISCLOSURE Among the various aspects of the present disclosure is a bonding clip for maintaining an electrical connection between a first metal piece and a second metal piece. Briefly, therefore, the disclosure is directed to a bonding clip for maintaining an electrical connection in the joining of at least two metal pieces. The clip(s) is/are used in combination with a first metal piece, a second metal piece, and a fastener which holds the first metal piece to the second metal piece. In one embodiment, at least one of the first metal piece and the second metal piece is a photovoltaic module or solar panel (or portion thereof). In another embodiment, two bonding clips are used in combination with a first metal piece, a second metal piece, and a third metal piece; more preferably in this embodiment, at least two of the first, second, and third metal pieces are photovoltaic modules or solar panels (or portions thereof). In general, the bonding clip includes, for example, a metal body portion, a first set of one or more teeth extending substantially orthogonally to the metal body portion in a first direction, and a second set of one or more teeth extending substantially orthogonally to the metal body portion in a second direction opposite the first direction, wherein the first set of one or more teeth contact a first metal piece and the second set of one or more teeth contact a second metal piece when the metal body portion is placed between the first and second metal pieces. When tightened, the first set of one or more teeth embed into the first metal piece, thereby making electrical contact with the first metal piece, and the second set of one or more teeth embed into the second metal piece, thereby making electrical contact with the second metal piece, thereby in turn making electrical connection between the first metal piece and the second metal piece. The height of the first and second sets of teeth can be varied according to the properties of the metal pieces (e.g., the thickness of anodizing) to ensure that the first and second sets of teeth will fully penetrate the various metal pieces. Additionally, in some embodiments, a desired electrical resistance can be achieved by varying the number and shape of the first and second sets of teeth. In certain preferred embodiments, the bonding clip is connected to the first and/or second metal pieces in such a manner that the fastener is substantially adjacent to, but does not immediately connect with or penetrate, the bonding clip. In such embodiments, therefore, the bonding clip lacks any clearance hole or opening for accepting or otherwise cooperating with the fastener. In particularly preferred embodiments, two or more bonding clips are used for cooperating with at least a first metal piece and optionally a second metal piece. In certain other embodiments, the bonding clip may be affixed to the first metal piece during or after manufacture of the first metal piece such that the bonding clip is secured to the first metal piece prior to the installation or joining of the first metal piece and the second metal piece. Other objects and features will be in part apparent and in part pointed out hereinafter. BRIEF DESCRIPTION OF THE DRAWINGS The above mentioned and other features of the present disclosure and the manner of obtaining them will become more apparent and the disclosure will be best understood by reference to the following description of embodiments of the disclosure taken in conjunction with the accompanying drawings, in which like numerals refer to like parts, and in which: FIG. 1A is a perspective view of a bonding clip according to one embodiment of the present disclosure as described herein; FIG. 1B is a left side elevation view of a bonding clip according to one embodiment of the present disclosure as described herein; FIG. 1C is a top plan view of a bonding clip according to one embodiment of the present disclosure as described herein; FIG. 1D is a front elevation view of a bonding clip according to one embodiment of the present disclosure as described herein; FIG. 1E is a front elevation partial view including an enlarged view of a tooth in a bonding clip according to one embodiment of the present disclosure as described herein; FIG. 2A is a perspective view of a bonding clip having flanges according to one embodiment of the present disclosure as described herein; FIG. 2B is a left side elevation view of a bonding clip having flanges according to one embodiment of the present disclosure as described herein; FIG. 2C is a top plan view of a bonding clip having flanges according to one embodiment of the present disclosure as described herein; FIG. 2D is a front elevation view of a bonding clip having flanges according to one embodiment of the present disclosure as described herein; FIG. 2E is a front elevation partial view including an enlarged view of a tooth in a bonding clip having flanges according to one embodiment of the present disclosure as described herein; FIG. 3A is a perspective view of a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIG. 3B is a left side elevation view of a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIG. 3C is a top plan view of a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIG. 4A is a perspective view of a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIG. 4B is a left side elevation view of a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIG. 4C is a top plan view of a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIG. 4D is a left side elevation partial view including an enlarged view of teeth in a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIGS. 5A and 5B are partially exploded views of a first metal piece and a bonding clip having flanges according to one embodiment of the present disclosure as described herein; FIGS. 6A and 6B are partially exploded views of a first metal piece and a bonding clip having a semi-cylindrical retaining tab according to one embodiment of the present disclosure as described herein; FIG. 7 is a perspective view of two bonding clips in combination with a first metal piece, a T-bolt, spring and a keeper according to one embodiment of the present disclosure as described herein; FIG. 8 is a perspective view of two bonding clips in combination with a first metal piece and an exemplary fastener according to one embodiment of the present disclosure as described herein; FIG. 9 is a partially exploded view of two bonding clips in combination with a first metal piece and an exemplary fastener according to one embodiment of the present disclosure as described herein. Additional advantages and features will become apparent to those skilled in the art from this disclosure, including the following detailed description. While the inventions are described herein with reference to implementations thereof, the inventions are not limited to those implementations. Those of ordinary skill in the art having access to the teachings herein will recognize additional applications, modifications and implementations, which are within the scope of the disclosure and claimed herein and with respect to which the invention could be of utility. DETAILED DESCRIPTION The accompanying Figures and this description depict and describe embodiments of a bonding clip and related structures and systems in accordance with the present disclosure, and features and components thereof. It should also be noted that any references herein to front and back, right and left, top and bottom and upper and lower are intended for convenience of description, not to limit the present disclosure or its components to any one positional or spatial orientation. The present disclosure relates to a bonding clip for making electrical connection between metal pieces, generally identified as structure 10 in the related Figures. As shown in FIGS. 1A-1D, bonding clip 10 includes a substantially rectangular metal body portion 12. Accordingly, the substantially rectangular metal body portion has a first and a second long side portion and a first and a second short side portion, wherein the first and second long side portions each have a first dimension measured in a first direction and the first and second short side portions each have a second dimension measured in a second direction substantially orthogonal to the first direction and wherein the first dimension is longer than the second dimension. The metal body portion 12 further includes a substantially planar first surface 14 and a substantially planar second surface 16 opposite the first surface 14. In general, the bonding clip 10 described herein may be constructed of any suitable material that is suitable for conducting electricity and is preferably corrosion resistant. For example, the bonding clip and/or components thereof may be formed of various electrically conductive materials including, but not limited to, silver, copper, gold, aluminum, tungsten, zinc, nickel, iron, platinum, tin, titanium, stainless steel, and alloys thereof. In one embodiment, for example, bonding clip 10 may be steel or an alloy thereof (e.g., stainless steel alloys). In another embodiment, for example, bonding clip 10 may be silver or an alloy thereof. In yet another embodiment, for example, bonding clip 10 may be titanium or an alloy thereof. In yet another embodiment, for example, bonding clip 10 may be copper or an alloy thereof. Bonding clip 10 may also be coated with a thin coating of an additional material to increase the hardness, e.g., relative to the first and/or second metal pieces to which the bonding clip is to be bonded. In one embodiment, for example, the coating may be chromium. In another embodiment, for example, the coating may be titanium nitride. In yet another embodiment, the boding clip includes an anodized coating. The bonding clip 10 includes a first set of one or more teeth 18 extending substantially orthogonally from first surface 14 in a first direction, and a second set of one or more teeth 20 extending substantially orthogonally from second surface 16 in a second direction. As can be seen in the various figures, the first and second sets of teeth extend in directions opposite one another; that is, the second direction is substantially opposite the first direction. It will be understood that any number of teeth in the first and/or second sets of teeth can be employed. In some embodiments, a desired electrical resistance can be achieved by varying the number and shape of the first and second sets of teeth. In certain of the illustrated embodiments, for example, a single tooth 18 extends from first surface 14 in a first direction while two teeth 20 extend from second surface 16 in a second direction opposite the first direction. As shown in the various figures, first set of teeth 18 and second set of teeth 20 are generally circular in cross-sectional shape and may be punched out of metal body portion 12. Because the first set of teeth 18 and second set of teeth 20 extend substantially orthogonally to metal body portion, they enable greater mechanical contact between metal pieces (see, e.g., FIGS. 5A-9), resulting in greater electrical contact. As illustrated in FIG. 1E, for example, the teeth preferably have a cross-sectional height greater than their cross-sectional thickness. Additionally, in certain embodiments, the teeth in cross-section are asymmetrical with respect to the perpendicular (see, e.g., FIGS. 1E and 2E). Accordingly, the teeth have a very rigid structure which allows easy penetration into the metal pieces to which they are bonded. Although the illustrated sets of teeth 18 and 20 are substantially circular, it should be readily apparent to one skilled in the art that other tooth shapes (e.g., square, triangular, or other polygonal cross-sectional shapes) can be formed into metal body portion 12. Additionally, while it is envisioned that in some embodiments, first set of teeth 18 and second set of teeth 20 are formed by punching metal body portion 12, it should be readily apparent to one skilled in the art that, in other embodiments, other methods such as machining, casting, pressure forming, and photochemical machining may be used to form first set of teeth 18 and/or second set of teeth 20. The position of the various teeth on the first and/or second surfaces 14 and 16 can also vary. In one particular embodiment, illustrated in FIGS. 1A and 1C, for example, a single first tooth 18 is located substantially in the center of metal body portion 12, while a set of two second teeth 20 are located off center, closer to the opposing edges of the first and second long side portions of metal body portion 12. It will be understood that the desired positioning of the first set of teeth 18 and/or second set of teeth 20 may depend upon the shape, structure, and/or composition of the metal pieces with which the bonding clip is to be used. Multiple, or single, teeth in first and second sets of teeth 18 and 20 may also be employed as noted above. The height of the teeth extending away from the first and second surfaces can additionally, or alternatively, vary, e.g., depending upon the shape, structure, and/or composition of the metal pieces with which the bonding clip is to be used. Typically, first set of teeth 18 and/or second set of teeth 20 extend in a range between about 0.005 inches to about 0.05 inches from first surface 14 and second surface 16, respectively. In one embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.005 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.01 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.015 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.02 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.025 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.03 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.035 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.04 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.045 inches from first surface 14 and second surface 16, respectively. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 extend about 0.05 inches from first surface 14 and second surface 16, respectively. In still other embodiments, the height of the first set of teeth 18 and second set of teeth 20 can vary relative to one other; that is, for example, first set of teeth 18 can extend from first surface 14 further than second set of teeth 20 extends from second surface 16, or vice versa. As noted above, the shape of the teeth extending away from the first and second surfaces can additionally, or alternatively, vary, e.g., depending upon the shape, structure, and/or composition of the metal pieces with which the bonding clip is to be used. For example, where first set of teeth 18 and/or second set of teeth 20 are substantially circular in cross-sectional shape, first set of teeth 18 and/or second set of teeth 20 range in diameter from about 0.04 inches to about 0.075 inches. In one embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.04 inches. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.045 inches. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.05 inches. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.055 inches. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.06 inches. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.065 inches. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.07 inches. In another embodiment, for example, first set of teeth 18 and/or second set of teeth 20 have a diameter of about 0.075 inches. In still other embodiments, the diameter of the first set of teeth 18 and second set of teeth 20 can vary relative to one other; that is, for example, first set of teeth 18 can have a greater diameter than second set of teeth 20 extends from second surface 16, or vice versa. In one particular embodiment of the present disclosure illustrated in FIGS. 2A-2D, one or more flanges 24 are included at the short edges of metal body portion 12. Each flange 24 extends at an angle (e.g., about) 85-90° with respect to and away from first surface 14. In this way, flange(s) 24 provide additional surfaces to bond or otherwise secure to a metal piece, e.g., a first or second metal piece (see, e.g., FIGS. 5A and 5B). In certain embodiments, flange(s) 24 may further include projection 26 which may be formed, for example, by punching through each flange 24. When present, each projection 26, in combination with each flange 24, can provide a more secure attachment to the metal piece with which it is used. As shown in FIGS. 1A, 2C, 3A, 3C, 4A, and 4C, bonding clip 10 may include a locating hole 22 that can be used to orient bonding clip 10 during manufacture. The position of the locating hole within the metal body portion can vary (see, e.g., FIGS. 3A, 3C, 4A, and 4C), and this hole generally does not include extending portions similar to first set of teeth 18 and second set of teeth 20. In another particular embodiment of the present disclosure illustrated in FIGS. 3A-3C, the bonding clip 10 may further include a retaining tab 28 for engaging a corresponding portion of a first metal piece. In the illustrated embodiments, the retaining tab 28 has a generally semi-cylindrical structure and has a hollow region and a central axis running parallel to the first direction. As shown, semi-cylindrical retaining tab 28 is open on the first and second short side portions of metal body portion 12. FIGS. 4A-4C are substantially similar to FIGS. 3A-3C, except that the former illustrate that the various first and second teeth 18 and 20 can be differently oriented and differ in number, as can the position of the locating hole 22. Referring now to FIGS. 5A and 5B, attachment of the bonding clip 10 to a first metal piece 30 is shown. In FIGS. 5A and 5B, in one embodiment of the present disclosure, first metal piece 30 optionally includes one or more rib(s) 34 extending the length of one (or more) side(s) of first metal piece 30, for use in connection with the retaining tab 28 (not shown). First metal piece 30 further includes one or more hole(s) 36 which is adapted to accept a fastener (not shown), for example, for use in installing photovoltaic modules. Additionally, FIGS. 5A and 5B illustrate that bonding clip 10 can be further attached to first metal piece 30 via flanges 24. FIGS. 6A and 6B show the attachment of an alternative bonding clip 10 to a first metal piece 30. In FIGS. 6A and 6B, in one embodiment of the present disclosure, first metal piece optionally includes one or more groove(s) 32 extending the length of one (or more) side(s) of first metal piece 30, for use in connection with the retaining tab 28. As shown, retaining tab 28 is seated in groove 32 thereby holding bonding clip 10 in place. It will be understood that retaining tab 28 may also cooperate with the rib(s) 34 shown in FIGS. 5A and 5B, such that the retaining tab is clipped on the inner side of the rib thus holding bonding clip 10 in place. In FIG. 7, an embodiment of a mounting assembly including the bonding clip 10 is illustrated. In this particular embodiment, the first metal piece 30 and the second metal piece (not shown) are installed using a T-bolt and keeper type fastener 54, wherein the fastener includes a vertical portion orthogonal to and located near the midpoint of a horizontal portion. A portion of the vertical portion of fastener 54 may be threaded to accept a nut 56. A bracket 60 for accepting the vertical portion is also provided. The vertical portion may also include a spring 58 for providing tension to the assembly. Second metal pieces (not shown), such as photovoltaic modules, may be positioned between the bonding clips 10 located on the first metal piece 30 and the assembly tightened to engage the various teeth in the first and second metal pieces thus facilitating the electrical connection between the various components. Although the bonding clip of FIGS. 2A-2D is illustrated in FIG. 7, it will be understood that any bonding clip described herein, for example, those of FIGS. 1A-1D and/or FIGS. 3A-4D, can be employed with the first metal piece 30 and the T-bolt and keeper type fastener 54 shown in FIG. 7. FIGS. 8 and 9 illustrate yet another embodiment of a mounting assembly. In this particular embodiment, the fastener includes a bolt 50 which is inserted through hole 36 of the first metal piece 30 and a washer 52 is optionally placed between the head of bolt 50 and first metal piece 30. Similar to FIG. 7, second metal pieces (not shown), such as photovoltaic modules, may be positioned between the bonding clips 10 and the first metal piece 30 and the assembly tightened (e.g., using a threaded bolt and cooperating nut) to engage the various teeth in the first and second metal pieces thus facilitating the electrical connection between the various components. Although the bonding clip of FIGS. 2A-2D is illustrated in FIGS. 8 and 9, it will be understood that any bonding clip described herein, for example, those of FIGS. 1A-1D and/or FIGS. 3A-4D, can be employed with the first metal piece 30 and the bolt 50 shown in FIGS. 8-9. While specific embodiments have been shown and described, many variations are possible. The particular shape of the various components including all horizontal and vertical orientations, dimensions and thicknesses may be changed as desired to suit the particular metal pieces and fasteners with which the invention is used. Additionally, the types of fasteners used may be changed as desired to suit the metal pieces with which the invention is used. The material and its configuration and number of components segments may vary although certain preferred embodiments are shown and described. The terms, descriptions and figures used herein are set forth by way of illustration only and are not meant as limitations. Those of ordinary skill in the art will recognize that many variations are possible within the scope of the invention, which is intended to be defined by the disclosure herein and their equivalents, in which all terms are meant in their broadest reasonable sense unless otherwise indicated. In this specification, the terms “about” and “around” are to signify that in one embodiment, the respective exact value is designated, while in another embodiment, the approximate value is designated. Thus, for example, “at least about 1,000” may, in one embodiment, be interpreted to mean “at least 1,000” and, in another embodiment, be interpreted to mean “at least approximately 1,000.” The terms “comprising,” “including,” and “having,” as used in the claims and specification herein, shall indicate an open group that may include other elements not specified. The term “consisting essentially of,” as used in the claims and specification herein, shall indicate a partially open group that may include other elements not specified, so long as those other elements do not materially alter the basic and novel characteristics of the claimed invention. The terms “a,” “an,” and the singular forms of words shall be taken to include the plural form of the same words, such that the terms mean that one or more of something is provided. The terms “preferably,” “preferred,” “prefer,” “optionally,” “may,” and like terms are used in the specification to indicate that an item, condition, or step being referred to is an optional (not required) feature of the invention. Having described the invention in detail, it will be apparent that modifications and variations are possible without departing the scope of the invention defined in the appended claims. Furthermore, it should be appreciated that all examples and illustrated embodiments in the present disclosure are provided as non-limiting examples. What is claimed is: 1. A bonding clip for maintaining an electrical connection between a first metal piece and a second metal piece wherein a fastener holds the first metal piece to the second metal piece, the bonding clip comprising a substantially rectangular metal body portion, a first set of one or more teeth extending substantially orthogonally to the metal body portion in a first direction, and a second set of one or more teeth extending substantially orthogonally to the metal body portion in a second direction opposite the first direction, wherein the first set of one or more teeth contact a first metal piece and the second set of one or more teeth contact a second metal piece when the metal body portion is placed between the first and second metal pieces. 2. The bonding clip of claim 1, further comprising at least one flange positioned at a side region of the metal body portion and extending at an angle to the first or second surface. 3. The bonding clip of claim 2, comprising at least two flanges positioned at opposing side regions of the metal body portion and extending at an angle to the first or second surface. 4. The bonding clip of claim 2, wherein the flange further comprises a projection for securing a portion of the flange to the first metal piece. 5. The bonding clip of claim 3, wherein the flange further comprises a projection for securing a portion of the flange to the first metal piece. 6. The bonding clip of claim 1, wherein a retaining tab for mating with the first metal piece extends from a side region of the metal body portion for engaging a corresponding rib or groove on the first metal piece. 7. An assembly comprising a first metal piece, a second metal piece, a fastener, and the bonding clip of claim 1, wherein the fastener holds the first metal piece to the second metal piece and the bonding clip maintains an electrical connection between the first metal piece and the second metal piece. 8. The assembly of claim 7, wherein the fastener comprises a T-bolt, spring, and keeper arrangement. 9. The assembly of claim 7, wherein the fastener comprises a threaded bolt. 10. A method for securing a first metal piece and a second metal piece maintaining an electrical connection between the first metal piece and the second metal piece, the method comprising positioning the bonding clip of claim 1 between the first metal piece and the second metal piece and tightening the positioned pieces with a fastener.

2013-05-24

en

2013-11-28